{"meta":{"query_hash":"52bc407533fb","filters":{"topic":"Sparse and Compressive Sensing Techniques"},"cohort_total":892,"direct_labels_cover":1,"predictions_cover":892,"exported":892,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/52bc407533fb","api":"https://metacan.xera.ac/api/v1/cohort?topic=Sparse+and+Compressive+Sensing+Techniques"},"results":[{"id":"W1160395089","doi":"10.1137/14099509x","title":"A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging","year":2015,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ergodic theory; Separable space; Mathematics; Convex optimization; Convergence (economics); Convex function; Regular polygon; Mathematical optimization; Rank (graph theory); Rate of convergence; Computer science; Algorithm; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.03478142559768054,"score_gpt":0.3361379900673421,"score_spread":0.3013565644696615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1160395089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025669076,0.00008518616,0.99625695,0.00013654328,0.000021387927,0.00002760791,0.000011685087,0.000035413308,0.00085830584],"genre_scores_gemma":[0.11052166,0.00035539133,0.8830789,0.00016716323,0.00010637161,0.00021345117,0.0000824185,0.00010929553,0.005365402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936193,0.00023444286,0.00002413382,0.00009167738,0.00024536127,0.000042391977],"domain_scores_gemma":[0.99932635,0.00028660035,0.000056904817,0.00008919048,0.00016092684,0.000080015045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016709707,0.0008459029,0.00085389754,0.0005786317,0.00062003185,0.00066701596,0.0010966538,0.0014247077,0.002436458],"category_scores_gemma":[0.002298043,0.0004634042,0.0009070086,0.00067284895,0.001571624,0.001087718,0.0020274713,0.0025957748,0.00054172165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016779895,0.00012597512,0.0006046171,0.00025964226,0.0000852888,0.0002841026,0.00032378492,0.5013431,0.027764633,0.2819143,0.004055917,0.18307091],"study_design_scores_gemma":[0.000016352593,0.00008200254,0.0000917513,0.000011598246,0.000007443392,0.00007764986,0.0000130941935,0.96607333,0.003161308,0.027748466,0.0027006972,0.000016237193],"about_ca_topic_score_codex":0.001078019,"about_ca_topic_score_gemma":0.0012151292,"teacher_disagreement_score":0.002436458,"about_ca_system_score_codex":0.0006140774,"about_ca_system_score_gemma":0.0015449197,"threshold_uncertainty_score":0.008837044},"labels":[],"label_agreement":null},{"id":"W1189950277","doi":"10.1117/12.2186609","title":"Tightness of stability bounds by null space property","year":2015,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Null (SQL); Restricted isometry property; Property (philosophy); Stability (learning theory); Ideal (ethics); Mathematics; Space (punctuation); Isometry (Riemannian geometry); Pure mathematics; Topology (electrical circuits); Computer science; Compressed sensing; Algorithm; Combinatorics; Data mining","score_opus":0.01991913895545891,"score_gpt":0.22737933519858408,"score_spread":0.20746019624312517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1189950277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04916548,0.00274302,0.9146005,0.0015881129,0.00030236045,0.000083988336,0.0004480401,0.00066506583,0.030403454],"genre_scores_gemma":[0.9145855,0.0031073813,0.072959326,0.0013094353,0.0008876829,0.000406922,0.0006689325,0.0007931787,0.0052815885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893856,0.0024673664,0.0005450745,0.0022868405,0.0039152754,0.0013998332],"domain_scores_gemma":[0.9277805,0.055923656,0.0030048504,0.00679184,0.0048116413,0.0016874702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008737905,0.0018126252,0.0022098676,0.0031206403,0.0021425548,0.004122189,0.0031775062,0.0021659858,0.008631148],"category_scores_gemma":[0.05997438,0.0011900272,0.0015245387,0.0022143333,0.0066419593,0.011281971,0.007133326,0.005997555,0.001678149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049833686,0.00014471593,0.002148892,0.00062755734,0.00014850678,0.00041857932,0.0004807941,0.12461611,0.021477338,0.81429356,0.0063675465,0.028778072],"study_design_scores_gemma":[0.000042383028,0.00024497375,0.001029511,0.00013927747,0.000046045756,0.00045275787,0.00014859671,0.35633415,0.01066053,0.62588745,0.0049099834,0.00010436993],"about_ca_topic_score_codex":0.0008051954,"about_ca_topic_score_gemma":0.00057718495,"teacher_disagreement_score":0.008737905,"about_ca_system_score_codex":0.0019756546,"about_ca_system_score_gemma":0.0013752609,"threshold_uncertainty_score":0.046211004},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07041629827848618,"score_gpt":0.29777216346836655,"score_spread":0.22735586518988038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1202875439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012119939,0.0063468246,0.9672752,0.0020146193,0.0004355117,0.000015675578,0.0001850802,0.00012087836,0.011486309],"genre_scores_gemma":[0.6866731,0.0158166,0.27679586,0.0014753212,0.0028903133,0.00020086548,0.0006312131,0.00012949595,0.015387259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987754,0.00063563924,0.00005418121,0.00016756769,0.00030228644,0.00006491696],"domain_scores_gemma":[0.9960646,0.0029051611,0.0002510576,0.00037823166,0.00030838588,0.00009256801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016322986,0.0012664198,0.0013769265,0.0011676691,0.00042084296,0.0017568886,0.0011172141,0.0016885165,0.0023198558],"category_scores_gemma":[0.0083018225,0.00045117212,0.0007076508,0.0018569309,0.0036016328,0.003008183,0.0017442004,0.0033278943,0.0003890666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003528003,0.00001493691,0.00011678269,0.00010628369,0.000018799317,0.00006772652,0.000076496995,0.037451528,0.0009726819,0.94458234,0.0015391444,0.015018028],"study_design_scores_gemma":[0.000009102768,0.000014829217,0.000095191026,0.000020425286,0.000006136094,0.00004998374,0.000018269724,0.13742876,0.0001961135,0.86003196,0.0021150485,0.000014114288],"about_ca_topic_score_codex":0.0018770716,"about_ca_topic_score_gemma":0.0016109446,"teacher_disagreement_score":0.0023198558,"about_ca_system_score_codex":0.0008950475,"about_ca_system_score_gemma":0.0006845901,"threshold_uncertainty_score":0.008632541},"labels":[],"label_agreement":null},{"id":"W1241639403","doi":"10.1117/12.2188252","title":"Sparse reconstruction of compressed sensing multispectral data using a cross-spectral multilayered conditional random field model","year":2015,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Multispectral image; Computer science; Hyperspectral imaging; Conditional random field; Full spectral imaging; Artificial intelligence; Spectral imaging; Iterative reconstruction; Computer vision; Signal reconstruction; Pattern recognition (psychology); Remote sensing; Signal processing","score_opus":0.04738512447573211,"score_gpt":0.2789480355345858,"score_spread":0.23156291105885368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1241639403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02147572,0.00012187399,0.977395,0.00020766788,0.000016928945,0.000020812338,0.00009029585,0.00014905438,0.0005227107],"genre_scores_gemma":[0.6852011,0.00061139883,0.31045225,0.00019532762,0.00006066088,0.00011548963,0.00057760737,0.00006526739,0.0027209586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996456,0.00012581723,0.00001496777,0.000057122576,0.00012410972,0.000032386826],"domain_scores_gemma":[0.9986772,0.00079575507,0.00014706308,0.00012747984,0.00020866885,0.00004386828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013797331,0.00046112298,0.0005179575,0.0004896704,0.00018337148,0.0005883328,0.0007366475,0.0007614267,0.0009819724],"category_scores_gemma":[0.0029406254,0.00027517023,0.0006526709,0.00065598416,0.00061955635,0.00091139367,0.0005494894,0.0010488704,0.00019115389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011526583,0.000056239973,0.00077741063,0.000069091824,0.000041865165,0.000115352814,0.000054121676,0.9426207,0.008245852,0.021063566,0.00094704615,0.025893506],"study_design_scores_gemma":[0.0000018905478,0.000007746796,0.000070064045,0.0000015821839,0.0000023714636,0.000013630611,0.000001807576,0.9986451,0.0004036932,0.0007702655,0.00007785847,0.0000038735443],"about_ca_topic_score_codex":0.0072384356,"about_ca_topic_score_gemma":0.0059544803,"teacher_disagreement_score":0.0072384356,"about_ca_system_score_codex":0.0006001799,"about_ca_system_score_gemma":0.0008581357,"threshold_uncertainty_score":0.014392614},"labels":[],"label_agreement":null},{"id":"W1439019055","doi":"10.1016/j.acha.2016.04.005","title":"Quantization of compressive samples with stable and robust recovery","year":2016,"lang":"en","type":"preprint","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantization (signal processing); Compressed sensing; Signal reconstruction; Bernoulli's principle; Algorithm; Gaussian; Computer science; Convex optimization; Mathematics; Regular polygon; Applied mathematics; Signal processing; Physics; Telecommunications; Radar","score_opus":0.018967836166745664,"score_gpt":0.21212078949175717,"score_spread":0.1931529533250115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1439019055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010321091,0.00030929068,0.9866981,0.00034524573,0.00009619182,0.000028965766,0.00009425864,0.000089455825,0.00201753],"genre_scores_gemma":[0.46854472,0.0012578195,0.5192167,0.00032460198,0.00042095693,0.00011700414,0.00051487156,0.00015479658,0.009448548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885285,0.00034647246,0.00006469849,0.00017289184,0.00050758146,0.000055575438],"domain_scores_gemma":[0.99834895,0.00078566885,0.00018416757,0.00037780878,0.00024626747,0.00005718886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975642,0.00082287786,0.0006433038,0.00064299366,0.00026237962,0.0011840645,0.0008038902,0.0011709377,0.0030242067],"category_scores_gemma":[0.008587215,0.0004392741,0.00038695804,0.001039667,0.001458654,0.0020700288,0.0019115228,0.0013855591,0.000780111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006391771,0.000118191965,0.0006081353,0.0004622778,0.00007837541,0.00023297887,0.00026710288,0.23070525,0.057749763,0.37396795,0.008073919,0.32709694],"study_design_scores_gemma":[0.000034778095,0.0001009603,0.0002942118,0.000026181277,0.000013579366,0.00014908718,0.000044252236,0.8884517,0.013081186,0.09460165,0.0031728104,0.000029630319],"about_ca_topic_score_codex":0.0007265322,"about_ca_topic_score_gemma":0.00094626757,"teacher_disagreement_score":0.0030242067,"about_ca_system_score_codex":0.00035550233,"about_ca_system_score_gemma":0.0006200493,"threshold_uncertainty_score":0.010117054},"labels":[],"label_agreement":null},{"id":"W1481684356","doi":"10.48550/arxiv.1206.6455","title":"Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dimensionality reduction; Reduction (mathematics); Regular polygon; Nonlinear system; Mathematics; Curse of dimensionality; Combinatorics; Mathematical optimization; Computer science; Artificial intelligence; Physics; Geometry","score_opus":0.10861866083357356,"score_gpt":0.21192559875281072,"score_spread":0.10330693791923716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481684356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005728134,0.00025726357,0.9921461,0.0004280872,0.000029324978,0.000015005614,0.000028957169,0.000048828726,0.001318333],"genre_scores_gemma":[0.29219127,0.0021108077,0.6969166,0.00049402943,0.00052096025,0.00019682258,0.0002095651,0.00034939128,0.0070106247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998735,0.0005945521,0.000055838424,0.00019625982,0.00034331562,0.00007495845],"domain_scores_gemma":[0.9974178,0.0013349144,0.00027893108,0.0006315969,0.00024153222,0.00009521856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003050972,0.0012122327,0.0009177528,0.0006943571,0.00033023363,0.0014514558,0.0008425825,0.0008049112,0.002197783],"category_scores_gemma":[0.008309677,0.00036490668,0.00080041,0.0007070508,0.0030368532,0.003151063,0.0028504138,0.0029530774,0.0006436485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015034669,0.000092372386,0.00056024763,0.00022135318,0.0000648943,0.0001387015,0.00027087296,0.26927316,0.011316526,0.6142828,0.0038662008,0.09976257],"study_design_scores_gemma":[0.00001752757,0.000115485884,0.00017814504,0.00004279936,0.000016794871,0.00011388187,0.00004779023,0.74934494,0.0046782247,0.23972335,0.005693136,0.000027846596],"about_ca_topic_score_codex":0.0003537897,"about_ca_topic_score_gemma":0.00038455173,"teacher_disagreement_score":0.003050972,"about_ca_system_score_codex":0.0005078938,"about_ca_system_score_gemma":0.00058385334,"threshold_uncertainty_score":0.016135275},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.02169457895119201,"score_gpt":0.22236387672534574,"score_spread":0.20066929777415374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493250972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005030903,0.021196267,0.9472734,0.0004388434,0.0011749951,0.000027489275,0.00014176844,0.00071765407,0.028526513],"genre_scores_gemma":[0.017555896,0.03734073,0.82616585,0.0005065625,0.0023435054,0.00022264861,0.0007204108,0.0009652497,0.11417919],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995358,0.000075046104,0.000024061805,0.00007776185,0.00027325877,0.00001411844],"domain_scores_gemma":[0.99942327,0.00031745035,0.000022041158,0.000112607915,0.00011109769,0.000013569739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005692399,0.002256634,0.0019134614,0.0014217739,0.00029455553,0.0015915607,0.001354737,0.0017898013,0.016160505],"category_scores_gemma":[0.0015570207,0.0006791927,0.0009716261,0.003133879,0.0012596198,0.0023323814,0.0010098697,0.0031739227,0.012111957],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003513054,0.000027631268,0.000053684485,0.00066168106,0.000050642717,0.000049357423,0.00007092411,0.025667494,0.0044306098,0.16417743,0.07800848,0.72676694],"study_design_scores_gemma":[0.00003575855,0.000104713945,0.00035963286,0.00027385476,0.000059879563,0.0005824255,0.000047345464,0.18596302,0.0054017263,0.36170372,0.44539014,0.00007780552],"about_ca_topic_score_codex":0.00065901893,"about_ca_topic_score_gemma":0.00097247626,"teacher_disagreement_score":0.016160505,"about_ca_system_score_codex":0.00038113203,"about_ca_system_score_gemma":0.00045075407,"threshold_uncertainty_score":0.054062307},"labels":[],"label_agreement":null},{"id":"W1494907491","doi":"10.5281/zenodo.42417","title":"Compressed Sensing With Shannon-Kotel''Nikov Mapping In The Presence Of Noise","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Decoding methods; Compressed sensing; Noise (video); Computer science; Noise measurement; Algorithm; Distortion (music); Channel (broadcasting); Signal-to-noise ratio (imaging); Transmission (telecommunications); Nonlinear distortion; SIGNAL (programming language); Signal reconstruction; Signal processing; Noise reduction; Artificial intelligence; Bandwidth (computing); Telecommunications","score_opus":0.03682101306622744,"score_gpt":0.20458405124405235,"score_spread":0.1677630381778249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494907491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03453645,0.0018387003,0.9511905,0.0011349579,0.00037106065,0.000037222904,0.00016987813,0.00011472724,0.010606459],"genre_scores_gemma":[0.708651,0.004521468,0.270711,0.0004963276,0.00094465114,0.00016503266,0.00042334507,0.00012904537,0.013958217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989071,0.00047684685,0.000042804015,0.00008876112,0.0004117879,0.000072787094],"domain_scores_gemma":[0.99812275,0.001408652,0.00011701541,0.00013840191,0.0001604073,0.00005286308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015898047,0.0007748499,0.00078581454,0.0008462427,0.00036441005,0.0012799772,0.000731927,0.001227861,0.0020975221],"category_scores_gemma":[0.008046951,0.00027384592,0.0004042103,0.0009167001,0.0015901944,0.0020615924,0.0020943715,0.0013873976,0.0004012574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040303607,0.00006406129,0.00049502094,0.0003035468,0.0000638469,0.00036365777,0.00027295345,0.1548843,0.009786097,0.7550059,0.004074258,0.07428331],"study_design_scores_gemma":[0.000022001243,0.0000737719,0.0002176242,0.00003822253,0.000010964816,0.00027223764,0.000045226352,0.8349207,0.0025470974,0.15927507,0.0025494997,0.000027464572],"about_ca_topic_score_codex":0.00073561945,"about_ca_topic_score_gemma":0.000784933,"teacher_disagreement_score":0.0020975221,"about_ca_system_score_codex":0.00044027166,"about_ca_system_score_gemma":0.0007360637,"threshold_uncertainty_score":0.008407772},"labels":[],"label_agreement":null},{"id":"W1497001491","doi":"10.1109/dcc.2015.31","title":"Near-Optimal Compression for Compressed Sensing","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compression (physics); Computer science; Data compression; Computer vision; Materials science; Composite material","score_opus":0.047527508267707456,"score_gpt":0.2618199275034241,"score_spread":0.21429241923571662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497001491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009285858,0.001154977,0.9839812,0.00059526967,0.000060996976,0.00003262829,0.000049752296,0.00008263626,0.0047567287],"genre_scores_gemma":[0.5755951,0.0033836772,0.41359296,0.00055709865,0.000428066,0.00013790684,0.00020064082,0.00011153657,0.0059930263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.00019231086,0.000024291518,0.000081541766,0.00027353983,0.00003157892],"domain_scores_gemma":[0.99899775,0.000731022,0.00007095637,0.00009156316,0.00008564312,0.000023120941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008318519,0.0005562185,0.0005117008,0.00033719576,0.00024817165,0.0006839582,0.00039047003,0.0006708714,0.001961668],"category_scores_gemma":[0.003557786,0.00019489767,0.00017142126,0.0005292095,0.0011772785,0.001368065,0.0010419408,0.0012296741,0.00034899215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016459273,0.000055595756,0.00023482618,0.000370914,0.00002592294,0.00014483731,0.0001359789,0.23117574,0.028027138,0.6151966,0.0038105056,0.12065744],"study_design_scores_gemma":[0.000013515788,0.00008537281,0.000106761116,0.000035107372,0.000007887367,0.00017515376,0.00003332533,0.8229007,0.010901193,0.1612737,0.0044499054,0.000017308517],"about_ca_topic_score_codex":0.00046020388,"about_ca_topic_score_gemma":0.0005114202,"teacher_disagreement_score":0.001961668,"about_ca_system_score_codex":0.000558666,"about_ca_system_score_gemma":0.00048095192,"threshold_uncertainty_score":0.0065624714},"labels":[],"label_agreement":null},{"id":"W1504812568","doi":"10.1109/icassp.2015.7178123","title":"Binomial classification based on DLENE features in sparse representation: Application in kidney detection in 3D ultrasound","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Discriminative model; Computer science; Pattern recognition (psychology); Artificial intelligence; Classifier (UML); Sparse approximation; Representation (politics); Artificial neural network; Set (abstract data type); Machine learning","score_opus":0.031072576455912753,"score_gpt":0.2656272231299475,"score_spread":0.23455464667403478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504812568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08992117,0.00054280716,0.9071116,0.00024456042,0.00005926286,0.000067640176,0.00010825117,0.00045644777,0.0014882274],"genre_scores_gemma":[0.5979337,0.0007419249,0.3989275,0.00017861337,0.00012151378,0.000073882555,0.00041774812,0.000060071307,0.0015449828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943954,0.00013863038,0.0000305602,0.000100396355,0.00023367666,0.000057105677],"domain_scores_gemma":[0.99903226,0.0004591283,0.00011498196,0.00009569465,0.00024763236,0.000050357274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975265,0.0003950233,0.0006648743,0.00185957,0.0002608959,0.00049660273,0.0005256312,0.0007611651,0.0010355741],"category_scores_gemma":[0.0025730797,0.00019042949,0.00041064003,0.0011783644,0.0004106479,0.0010021758,0.00085622416,0.00051087793,0.00036137673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043150462,0.00020365842,0.00959858,0.00018385552,0.00006793753,0.000334764,0.00015929695,0.049545858,0.07596963,0.0062271324,0.0029171791,0.8543606],"study_design_scores_gemma":[0.000021398375,0.00019196504,0.004554917,0.00001926402,0.000030917156,0.0005719974,0.00006082612,0.9703466,0.01950613,0.002776769,0.0018907534,0.000028455937],"about_ca_topic_score_codex":0.0007035593,"about_ca_topic_score_gemma":0.00106817,"teacher_disagreement_score":0.00185957,"about_ca_system_score_codex":0.00021503879,"about_ca_system_score_gemma":0.0002523433,"threshold_uncertainty_score":0.00580436},"labels":[],"label_agreement":null},{"id":"W1510884249","doi":"10.1137/1.9781611972757.14","title":"A Cutting Algorithm for the Minimum Sum-of-Squared Error Clustering","year":2005,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cluster analysis; Computer science; Algorithm; Artificial intelligence","score_opus":0.026131004609656554,"score_gpt":0.26331808022744174,"score_spread":0.23718707561778518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510884249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011915389,0.0000768364,0.9979804,0.000056014942,0.000018028972,0.000022937591,0.000017802147,0.000073110576,0.0005632569],"genre_scores_gemma":[0.036007226,0.00017041889,0.9616235,0.00006965109,0.00003567796,0.00021485146,0.00016448305,0.00013741212,0.0015768034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989649,0.00028977098,0.00005705951,0.0001725319,0.00043159822,0.00008421566],"domain_scores_gemma":[0.9986053,0.0007156058,0.00010713734,0.0001681062,0.00035001175,0.000053868032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015489999,0.00096424896,0.0014371203,0.0013346818,0.00080514245,0.0011316814,0.0018683643,0.002085091,0.0034876876],"category_scores_gemma":[0.005075178,0.00070545095,0.0010947823,0.0017807964,0.0010991913,0.0014743179,0.0018773191,0.003000344,0.0012187927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018215949,0.00008216756,0.0004820196,0.0002027644,0.0000690233,0.00013828979,0.00022402359,0.53607565,0.01037914,0.1342063,0.009766339,0.30819204],"study_design_scores_gemma":[0.000023568471,0.00006097505,0.00014297626,0.000023694205,0.000010635611,0.00010376291,0.00002423473,0.96503663,0.0025184026,0.02774165,0.004292279,0.000021188162],"about_ca_topic_score_codex":0.0014918767,"about_ca_topic_score_gemma":0.0012174074,"teacher_disagreement_score":0.0034876876,"about_ca_system_score_codex":0.000999555,"about_ca_system_score_gemma":0.0012147189,"threshold_uncertainty_score":0.01166743},"labels":[],"label_agreement":null},{"id":"W1511703720","doi":"","title":"Denoising network tomography estimations","year":2010,"lang":"en","type":"article","venue":"International Conference on Data Communication Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Network tomography; Noise reduction; Computer science; Tomography; Artificial intelligence; Transformation (genetics); Algorithm; Pattern recognition (psychology)","score_opus":0.09204816260423844,"score_gpt":0.32145110536699034,"score_spread":0.22940294276275192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1511703720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020087926,0.00010398134,0.97832483,0.00011076855,0.000030936862,0.000015863421,0.000071006965,0.00017666616,0.0010780431],"genre_scores_gemma":[0.6588179,0.0006678191,0.33601534,0.00014110823,0.00006797049,0.00009004404,0.00063650915,0.00016019924,0.0034032487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968565,0.00007548922,0.000013070756,0.00005506842,0.00014232969,0.000028460834],"domain_scores_gemma":[0.9990717,0.00045910722,0.00011146596,0.000118585325,0.00021690372,0.000022159778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075057603,0.0006148847,0.0005063091,0.0006603364,0.00018169213,0.0005112406,0.00053772103,0.0006387993,0.0009309572],"category_scores_gemma":[0.0038122893,0.00029113347,0.00037294315,0.00054137316,0.00047331775,0.0012323575,0.0005977782,0.00094759965,0.00022349734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012506865,0.000026054502,0.0016476457,0.00011070972,0.000032139647,0.00017648074,0.000119455886,0.8918569,0.024266763,0.01337937,0.000985512,0.06727392],"study_design_scores_gemma":[0.0000035752382,0.00001446103,0.0003201829,0.000007114585,0.0000063176644,0.000052183157,0.000018245655,0.98966014,0.005907383,0.0031175178,0.00088393065,0.000008984925],"about_ca_topic_score_codex":0.0028905869,"about_ca_topic_score_gemma":0.0031207262,"teacher_disagreement_score":0.0028905869,"about_ca_system_score_codex":0.00041452408,"about_ca_system_score_gemma":0.0005521146,"threshold_uncertainty_score":0.005747497},"labels":[],"label_agreement":null},{"id":"W1516611346","doi":"10.1287/opre.2017.1705","title":"Inverse Optimization with Noisy Data","year":2018,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematical optimization; Inverse problem; Regularization (linguistics); Optimization problem; Mathematics; Heuristics; Curse of dimensionality; Computer science; Duality (order theory); Algorithm; Artificial intelligence","score_opus":0.20894179008982508,"score_gpt":0.39535653920595293,"score_spread":0.18641474911612785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1516611346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022758755,0.00027585262,0.99582666,0.00031712378,0.000026492626,0.000016610013,0.00005467169,0.000057682784,0.001148991],"genre_scores_gemma":[0.2668117,0.002038422,0.7250057,0.00047765244,0.0003413983,0.00036274848,0.00062030373,0.0002159366,0.0041261027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970758,0.0014880837,0.0001442514,0.0005192518,0.0006576922,0.00011487504],"domain_scores_gemma":[0.9897619,0.008220059,0.0006987836,0.0007488747,0.00046917782,0.000101298974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040157842,0.001352056,0.0020896927,0.001358863,0.0006482636,0.0026917513,0.001624131,0.0025566625,0.0021071467],"category_scores_gemma":[0.017363204,0.0010626409,0.0011989247,0.0022187456,0.0035717427,0.003492258,0.0030422849,0.0036362058,0.0005305826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008087531,0.00005113576,0.0005722094,0.00033249773,0.00008457944,0.00012242966,0.000116348325,0.7630704,0.0013747078,0.19177468,0.001827145,0.040593],"study_design_scores_gemma":[0.00001429698,0.00002104719,0.00011110564,0.000041047075,0.00000890078,0.000041016752,0.00002500968,0.8681128,0.000904529,0.12867646,0.0020303747,0.000013349807],"about_ca_topic_score_codex":0.0021445102,"about_ca_topic_score_gemma":0.0015445946,"teacher_disagreement_score":0.0040157842,"about_ca_system_score_codex":0.0012053513,"about_ca_system_score_gemma":0.0017220179,"threshold_uncertainty_score":0.02123779},"labels":[],"label_agreement":null},{"id":"W151959692","doi":"","title":"Applications of Stochastic Simulation and Compressed Sensing to Large Systems","year":2014,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Computer science; Compressed sensing; Algorithm; Mathematical optimization; Partial differential equation; Mathematics","score_opus":0.010879481578376692,"score_gpt":0.21765237643623886,"score_spread":0.20677289485786216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151959692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029564032,0.0007505684,0.9924286,0.0006345805,0.00009734809,0.00002630471,0.00002160859,0.00008786996,0.0029966428],"genre_scores_gemma":[0.319606,0.0075273896,0.6644813,0.0006383057,0.0007607449,0.00025156268,0.00018217023,0.00012395238,0.0064285877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912804,0.0003188999,0.000047466554,0.00011106911,0.00035242795,0.000041993284],"domain_scores_gemma":[0.9967302,0.002407263,0.00020892188,0.00027779036,0.00029132038,0.0000844927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012287971,0.00082935725,0.0007848372,0.0007680407,0.0004703442,0.0011044898,0.0006957113,0.0011733461,0.002403451],"category_scores_gemma":[0.00613849,0.00033483037,0.00063240295,0.0009614917,0.0016819526,0.0013714489,0.0016607763,0.0020131846,0.0003305962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053991705,0.00003562931,0.00063514145,0.00020406437,0.00005240707,0.000099998186,0.00013938588,0.4956761,0.0039484096,0.43289232,0.0018692653,0.06439338],"study_design_scores_gemma":[0.000009709562,0.000023316317,0.00011606874,0.000023587721,0.000007489628,0.000073569805,0.000018009365,0.9131165,0.0011791877,0.08145984,0.003958116,0.000014572554],"about_ca_topic_score_codex":0.0014692959,"about_ca_topic_score_gemma":0.0016028457,"teacher_disagreement_score":0.002403451,"about_ca_system_score_codex":0.0008275881,"about_ca_system_score_gemma":0.0008721614,"threshold_uncertainty_score":0.008040309},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011109360500339695,"score_gpt":0.25104104465765503,"score_spread":0.23993168415731533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529624360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003820778,0.00028331994,0.9889382,0.00056327734,0.00008541536,0.00005542622,0.00013086155,0.00018793395,0.0059348615],"genre_scores_gemma":[0.3307733,0.0015053215,0.6579008,0.0008029759,0.00060903194,0.00041372445,0.00049045513,0.00014515886,0.0073592262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986345,0.00042301475,0.000045198834,0.00016211368,0.0006417134,0.00009347632],"domain_scores_gemma":[0.9972101,0.001481732,0.00029591075,0.00067298603,0.00024385125,0.00009555164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012884468,0.00080855266,0.0007104374,0.0011861597,0.00054470473,0.0013039024,0.0012056648,0.0012896139,0.0036000642],"category_scores_gemma":[0.0062857373,0.00042103455,0.00060538435,0.001121004,0.002527102,0.0029477486,0.0030946382,0.002707967,0.000845162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007008288,0.00005524621,0.00033763945,0.00014432461,0.00004188905,0.00011026458,0.00014818786,0.06384172,0.009449652,0.84671664,0.005170741,0.073913686],"study_design_scores_gemma":[0.000026263793,0.000047253692,0.00016889322,0.000032183096,0.000009655803,0.00015299644,0.00002089179,0.67245585,0.0047573852,0.3160687,0.0062256404,0.000034333167],"about_ca_topic_score_codex":0.0009466783,"about_ca_topic_score_gemma":0.00097393105,"teacher_disagreement_score":0.0036000642,"about_ca_system_score_codex":0.0007340708,"about_ca_system_score_gemma":0.0007798861,"threshold_uncertainty_score":0.0120434165},"labels":[],"label_agreement":null},{"id":"W1531087325","doi":"10.48550/arxiv.1312.6820","title":"A Fast Greedy Algorithm for Generalized Column Subset Selection","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Selection (genetic algorithm); Greedy algorithm; Column (typography); Algorithm; Matrix (chemical analysis); Computer science; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.05593021816722405,"score_gpt":0.17935863332539834,"score_spread":0.12342841515817429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531087325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027788763,0.0001539689,0.9952194,0.00014351972,0.00006318889,0.000070210255,0.0000743631,0.0005363843,0.00096008735],"genre_scores_gemma":[0.061847363,0.00028750562,0.9333854,0.00029144585,0.00015289475,0.0003642488,0.0005914929,0.00019992437,0.0028796676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877423,0.0004120285,0.000054926993,0.00022216748,0.00040116886,0.0001355457],"domain_scores_gemma":[0.9987357,0.000703036,0.00007250076,0.00022257774,0.00020890309,0.000057197754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976655,0.0013742441,0.001348754,0.0011570256,0.0007407534,0.001054261,0.0013539754,0.0011698996,0.0046770056],"category_scores_gemma":[0.0038666297,0.0005072769,0.0006839226,0.0020794144,0.0008545678,0.0012948902,0.0017488701,0.0014434947,0.002116942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005090262,0.0001491739,0.00075423345,0.00020576495,0.00013427308,0.00022696983,0.00015712883,0.2767012,0.017890655,0.05397289,0.024937289,0.6243613],"study_design_scores_gemma":[0.00012369361,0.00012948462,0.00019916405,0.000023509361,0.000025621051,0.00027823314,0.0000551254,0.9392632,0.0055550574,0.044810366,0.009508261,0.000028235969],"about_ca_topic_score_codex":0.0022226528,"about_ca_topic_score_gemma":0.003505182,"teacher_disagreement_score":0.0046770056,"about_ca_system_score_codex":0.0005846037,"about_ca_system_score_gemma":0.0016486124,"threshold_uncertainty_score":0.0156461},"labels":[],"label_agreement":null},{"id":"W1536628953","doi":"10.48550/arxiv.0809.1833","title":"Fast GPU Implementation of Sparse Signal Recovery from Random Projections","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; SIGNAL (programming language); Signal recovery; Parallel computing; CUDA; General-purpose computing on graphics processing units; Computational science; Computer graphics (images); Algorithm; Compressed sensing; Graphics; Programming language","score_opus":0.044719363924537466,"score_gpt":0.27381881937077324,"score_spread":0.22909945544623578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536628953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700177,0.00057561253,0.91778517,0.00056014245,0.00022174661,0.00009623019,0.0009188495,0.01389996,0.018940559],"genre_scores_gemma":[0.35636213,0.00040619468,0.63140273,0.00021080078,0.00005176558,0.00023463223,0.0017051245,0.001201801,0.00842481],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996873,0.000069525675,0.000014440023,0.000043318192,0.00013986244,0.00004551329],"domain_scores_gemma":[0.9996099,0.00009502678,0.000016370364,0.00008711553,0.00016663666,0.000025103416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026545825,0.0007044785,0.0006620154,0.00045368366,0.00034231629,0.00093170477,0.001086497,0.0007041432,0.008693195],"category_scores_gemma":[0.0016660589,0.00023436877,0.0003247512,0.00078816595,0.00022124503,0.0007045097,0.00054172706,0.00073158497,0.0023816344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013210253,0.00025821532,0.0033424601,0.0005090501,0.00017276054,0.0011915136,0.00045901097,0.27999747,0.06763963,0.05954067,0.06905157,0.51651675],"study_design_scores_gemma":[0.000093135895,0.00006411541,0.0003866814,0.000017525703,0.000013461896,0.00013168706,0.000036442638,0.9539168,0.018925952,0.006683139,0.019714085,0.000017094791],"about_ca_topic_score_codex":0.0068540853,"about_ca_topic_score_gemma":0.006692895,"teacher_disagreement_score":0.008693195,"about_ca_system_score_codex":0.0004985689,"about_ca_system_score_gemma":0.0007123239,"threshold_uncertainty_score":0.029081583},"labels":[],"label_agreement":null},{"id":"W1543662351","doi":"10.1109/ccece.2015.7129337","title":"Binary input-output compressive sensing: A sub-gradient reconstruction","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Binary number; Decoding methods; Computer science; Compressed sensing; Algorithm; Process (computing); Sparse matrix; Binary code; Wireless; Mathematics; Telecommunications","score_opus":0.034251146962566016,"score_gpt":0.2262338701901896,"score_spread":0.19198272322762358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543662351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009558745,0.00027888213,0.9871607,0.00024534983,0.000051133466,0.000030386896,0.00004624469,0.00011425049,0.0025143442],"genre_scores_gemma":[0.44046515,0.0009319951,0.5538476,0.00031751825,0.00012802143,0.00010339973,0.00018407102,0.00008087335,0.0039413795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00014058105,0.000018811366,0.000074062715,0.0001754465,0.00003074231],"domain_scores_gemma":[0.99971205,0.000116503456,0.00004605677,0.000047306974,0.000052424803,0.000025726464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049381226,0.0004933418,0.00053556025,0.00035651575,0.00021340803,0.0006833447,0.00070738816,0.00073987007,0.0013707033],"category_scores_gemma":[0.0016992043,0.00020282349,0.0002703415,0.00056003005,0.00080356235,0.00093372917,0.001210164,0.00085780304,0.00035236133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006120093,0.00017811693,0.0016524615,0.00068272883,0.00006825071,0.0003971032,0.00029192946,0.2166437,0.12885876,0.27350643,0.0057486845,0.37135988],"study_design_scores_gemma":[0.000021125565,0.000103677994,0.00032218464,0.0000302087,0.000010782991,0.0003334943,0.00002546036,0.9535412,0.018106738,0.024355354,0.003129597,0.000020093032],"about_ca_topic_score_codex":0.00042512364,"about_ca_topic_score_gemma":0.00039276766,"teacher_disagreement_score":0.0013707033,"about_ca_system_score_codex":0.00027558004,"about_ca_system_score_gemma":0.00044607994,"threshold_uncertainty_score":0.004585445},"labels":[],"label_agreement":null},{"id":"W1556416173","doi":"","title":"On statistical restricted isometry property of a new class of deterministic partial Fourier compressed sensing matrices","year":2012,"lang":"en","type":"article","venue":"International Symposium on Information Theory and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Restricted isometry property; Compressed sensing; Block matrix; DFT matrix; Matrix (chemical analysis); Concatenation (mathematics); Algorithm; Isometry (Riemannian geometry); Sparse matrix; Mutual coherence; Discrete Fourier transform (general); Mathematics; Fourier transform; Single-entry matrix; Computer science; Coherence (philosophical gambling strategy); Fourier analysis; Combinatorics; Symmetric matrix; Mathematical analysis; Matrix function; Square matrix; Fractional Fourier transform; Physics; Gaussian","score_opus":0.012333381574275515,"score_gpt":0.254788107406447,"score_spread":0.24245472583217145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556416173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03898227,0.00050437887,0.9516515,0.00040338765,0.000071915085,0.000039388666,0.0001518494,0.00012930353,0.0080659455],"genre_scores_gemma":[0.83379334,0.0023744246,0.15543504,0.0005742495,0.00063506304,0.0002558295,0.0007575912,0.00016878845,0.0060057305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00026110574,0.00005120158,0.00026279927,0.000416587,0.0001313294],"domain_scores_gemma":[0.99679106,0.0014833151,0.0005047645,0.0005054071,0.00057845487,0.00013701864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013907871,0.0007534659,0.0005727854,0.0011790043,0.0005092628,0.00092732615,0.0005657759,0.0006733602,0.0028426137],"category_scores_gemma":[0.006222908,0.0003111268,0.0005827159,0.00087027374,0.0018550563,0.0022359702,0.0011233964,0.001635015,0.00053354556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011896138,0.00005558443,0.0011236928,0.00012087474,0.00003228265,0.00031349412,0.00020664337,0.057147823,0.016775658,0.8804475,0.0028782575,0.04077915],"study_design_scores_gemma":[0.00002911295,0.00022187446,0.0009508822,0.000029485354,0.000016186268,0.00082788215,0.000091205104,0.6130959,0.0059752855,0.37249354,0.006215906,0.000052660867],"about_ca_topic_score_codex":0.00052419974,"about_ca_topic_score_gemma":0.0003214194,"teacher_disagreement_score":0.0028426137,"about_ca_system_score_codex":0.00041019966,"about_ca_system_score_gemma":0.0005892509,"threshold_uncertainty_score":0.009509444},"labels":[],"label_agreement":null},{"id":"W1562732085","doi":"10.5281/zenodo.43380","title":"Focuss Algorithm For Rank Aware Row-Sparse Mmv Recovery","year":2013,"lang":"en","type":"article","venue":"INFM-OAR (INFN Catania)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rank (graph theory); Solver; Algorithm; Computer science; Sparse matrix; Norm (philosophy); Matrix norm; Regular polygon; Matrix (chemical analysis); Mathematical optimization; Mathematics; Combinatorics","score_opus":0.013679618461637835,"score_gpt":0.21752868118880558,"score_spread":0.20384906272716774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562732085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036886802,0.000444703,0.99173415,0.00020203933,0.0001416497,0.00006998445,0.0002700583,0.0014694618,0.0019793042],"genre_scores_gemma":[0.05472233,0.000490871,0.9324105,0.00025077985,0.00017451843,0.00022296567,0.0014814627,0.00038440767,0.009862219],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00012466668,0.00003499504,0.000101580394,0.0002718225,0.00006245422],"domain_scores_gemma":[0.99916863,0.00025614665,0.000051080147,0.00019734711,0.0002838085,0.000042931424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092306844,0.001386227,0.0012151963,0.001309153,0.0005951801,0.0012340207,0.0015471677,0.0015514526,0.014276275],"category_scores_gemma":[0.003580299,0.00064644567,0.00086716213,0.0013253121,0.0005287618,0.0015609589,0.0025697728,0.0017478124,0.005932056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006052142,0.00013686017,0.00048537223,0.00023130518,0.000104186256,0.00010899753,0.00011064201,0.03475986,0.0332129,0.015639212,0.026989864,0.88761556],"study_design_scores_gemma":[0.00014456995,0.00029805242,0.00063341996,0.000060783932,0.000059078546,0.00044094978,0.000112453825,0.92284375,0.03276645,0.01741457,0.025179079,0.000046967274],"about_ca_topic_score_codex":0.0019762688,"about_ca_topic_score_gemma":0.0036054798,"teacher_disagreement_score":0.014276275,"about_ca_system_score_codex":0.00032709996,"about_ca_system_score_gemma":0.0014428069,"threshold_uncertainty_score":0.047758877},"labels":[],"label_agreement":null},{"id":"W1570533091","doi":"10.48550/arxiv.1501.01695","title":"Robustness Properties of Dimensionality Reduction with Gaussian Random Matrices","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Restricted isometry property; Gaussian; Robustness (evolution); Mathematics; Erasure; Combinatorics; Applied mathematics; Algorithm; Computer science; Compressed sensing; Physics","score_opus":0.07492247263673599,"score_gpt":0.17415611286918078,"score_spread":0.0992336402324448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570533091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06873836,0.0010101894,0.92403775,0.0007052764,0.000070242924,0.000052032712,0.00017077572,0.00018488374,0.0050304905],"genre_scores_gemma":[0.9411468,0.0013693166,0.05437056,0.00028674744,0.00023793019,0.000126351,0.00021710657,0.00009424111,0.0021508972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968263,0.0010763269,0.00015309415,0.00056357513,0.0011173866,0.0002634681],"domain_scores_gemma":[0.9873006,0.008274436,0.001904452,0.0014657693,0.0008358586,0.00021894588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030228284,0.0010186804,0.00081388647,0.0012193368,0.0003812961,0.0011405601,0.0008222723,0.00090605667,0.0011415271],"category_scores_gemma":[0.019072391,0.00034436892,0.0008140036,0.0007243593,0.0028964903,0.0032387911,0.0021300318,0.0015655339,0.00026455722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002773356,0.00006797413,0.0013528644,0.00031784934,0.00017986848,0.00032114692,0.00021334196,0.55542934,0.03370684,0.37604678,0.001150204,0.030936444],"study_design_scores_gemma":[0.000018335202,0.00015369749,0.0007628613,0.000035728015,0.000027755013,0.00019426312,0.000051454528,0.8505965,0.015081343,0.13194536,0.0010864005,0.000046287063],"about_ca_topic_score_codex":0.00043718165,"about_ca_topic_score_gemma":0.00017533332,"teacher_disagreement_score":0.0030228284,"about_ca_system_score_codex":0.000837378,"about_ca_system_score_gemma":0.0004569331,"threshold_uncertainty_score":0.015986443},"labels":[],"label_agreement":null},{"id":"W1573195610","doi":"","title":"Cost-sensitive Multiclass Classification Risk Bounds","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"","keywords":"Multiclass classification; Computer science; Artificial intelligence; Risk analysis (engineering); Machine learning; Support vector machine; Business","score_opus":0.02617728603596874,"score_gpt":0.23788204179692116,"score_spread":0.2117047557609524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573195610","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030562755,0.0057690567,0.95096904,0.0051472713,0.00034976032,0.000094477844,0.0005102799,0.00041400135,0.0061833654],"genre_scores_gemma":[0.81103563,0.006910478,0.15507652,0.0019520136,0.0025169447,0.00048114097,0.0016113261,0.0005336865,0.019882323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345124,0.003243456,0.0002492805,0.00085248967,0.0017706304,0.0004328536],"domain_scores_gemma":[0.9516107,0.037418753,0.0022923972,0.0042892406,0.0034514584,0.00093749346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013945078,0.0021616758,0.0033833557,0.0018959164,0.00077956734,0.0038119457,0.0030751724,0.0037679742,0.004705913],"category_scores_gemma":[0.06186219,0.00092982914,0.0012858657,0.0021012323,0.0029609462,0.0040700836,0.0049253725,0.006436754,0.0009584041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061011483,0.00021899774,0.0028860725,0.0006279907,0.0002923609,0.0002526717,0.00014849944,0.64118195,0.0022402431,0.21684527,0.016285427,0.11841036],"study_design_scores_gemma":[0.000017232058,0.00004894988,0.0005056794,0.00006516783,0.000031461364,0.000077709316,0.000015638998,0.8892976,0.0005127533,0.108579926,0.00082829763,0.000019498939],"about_ca_topic_score_codex":0.0021309624,"about_ca_topic_score_gemma":0.0014477314,"teacher_disagreement_score":0.013945078,"about_ca_system_score_codex":0.0030936366,"about_ca_system_score_gemma":0.001741772,"threshold_uncertainty_score":0.07374948},"labels":[],"label_agreement":null},{"id":"W1573412864","doi":"10.1609/aaai.v26i1.8303","title":"Compressed Least-Squares Regression on Sparse Spaces","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Random projection; Compressed sensing; Estimator; Computer science; Curse of dimensionality; Projection (relational algebra); Range (aeronautics); Regression; Variance (accounting); Dimensionality reduction; Mathematics; Sampling (signal processing); Scale (ratio); Algorithm; Pattern recognition (psychology); Artificial intelligence; Statistics; Computer vision","score_opus":0.08049837298639498,"score_gpt":0.28570507450900046,"score_spread":0.20520670152260548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573412864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006614099,0.00033101067,0.99191344,0.00028230017,0.000031031566,0.000022455572,0.00007161373,0.00019424182,0.0005398149],"genre_scores_gemma":[0.35337067,0.001930464,0.6391634,0.00038958548,0.0003193455,0.0002231084,0.0008988748,0.0002664946,0.003438108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753076,0.0011876924,0.00009908556,0.00034752116,0.00072007166,0.00011500092],"domain_scores_gemma":[0.99183476,0.0060488055,0.00053927343,0.00071718363,0.00076885975,0.00009106361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028639855,0.00097244105,0.0012323621,0.00071064493,0.00032943115,0.0010373237,0.0010602302,0.0010945888,0.0014111821],"category_scores_gemma":[0.016323926,0.00047443304,0.0005640255,0.001094546,0.0013491092,0.0019527883,0.0013881074,0.0021707655,0.0005622148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020076573,0.00007738231,0.0008683215,0.0003268573,0.00010929716,0.00017140254,0.00011826567,0.77080643,0.012190933,0.10572367,0.0033075984,0.106099024],"study_design_scores_gemma":[0.000009025052,0.000023080107,0.00014551952,0.000013842023,0.0000050986246,0.000034710905,0.000010267985,0.97751814,0.0020005805,0.019480636,0.000750611,0.000008447479],"about_ca_topic_score_codex":0.0023249558,"about_ca_topic_score_gemma":0.0016942524,"teacher_disagreement_score":0.0028639855,"about_ca_system_score_codex":0.0006358696,"about_ca_system_score_gemma":0.00090952555,"threshold_uncertainty_score":0.015146375},"labels":[],"label_agreement":null},{"id":"W1585568489","doi":"10.1109/vetecf.2004.1404804","title":"Sparse channel estimation using orthogonal matching pursuit algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Matching pursuit; Channel (broadcasting); Algorithm; Basis pursuit; Computer science; Computational complexity theory; Selection (genetic algorithm); Convergence (economics); Least-squares function approximation; Compressed sensing; Mathematics; Artificial intelligence; Telecommunications; Statistics","score_opus":0.02256096279638439,"score_gpt":0.24927240208806284,"score_spread":0.22671143929167845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585568489","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004371831,0.00008822161,0.9946163,0.000073793926,0.000015398826,0.00001553232,0.000016329275,0.00019406118,0.00060854654],"genre_scores_gemma":[0.27245057,0.0004995724,0.72389174,0.00008753594,0.00008875051,0.00011972141,0.0001698183,0.000045595225,0.0026467317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993754,0.0001879796,0.000025634228,0.00008113326,0.0002755926,0.000054326538],"domain_scores_gemma":[0.9994948,0.0002461559,0.00006540876,0.0000589663,0.000119543096,0.000015157553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006479313,0.00045961575,0.000864733,0.0006436813,0.00029033935,0.0005282379,0.00050658645,0.0007556951,0.0011300364],"category_scores_gemma":[0.002487857,0.00023305984,0.00037904797,0.0009495712,0.00037784228,0.0010133586,0.000800352,0.0008287122,0.00051550125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030320187,0.000092571136,0.0006992066,0.00014024465,0.00008975957,0.00016516034,0.00010777693,0.45989302,0.036033828,0.035844374,0.0028743243,0.46375647],"study_design_scores_gemma":[0.000016919954,0.00003242127,0.00010789018,0.0000045499155,0.0000063969915,0.00004868991,0.000008145224,0.98986065,0.0040938873,0.004780127,0.0010314337,0.000008771095],"about_ca_topic_score_codex":0.0013332055,"about_ca_topic_score_gemma":0.0008912813,"teacher_disagreement_score":0.0013332055,"about_ca_system_score_codex":0.00023380143,"about_ca_system_score_gemma":0.0007094114,"threshold_uncertainty_score":0.003780365},"labels":[],"label_agreement":null},{"id":"W1597169801","doi":"10.1007/978-3-642-15711-0_64","title":"Under-Determined Non-cartesian MR Reconstruction with Non-convex Sparsity Promoting Analysis Prior","year":2010,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wavelet; Mathematics; Norm (philosophy); Regular polygon; Cartesian coordinate system; Convex optimization; Inverse problem; Image (mathematics); Iterative reconstruction; Algorithm; Metric (unit); Mathematical optimization; Applied mathematics; Computer science; Artificial intelligence; Mathematical analysis; Geometry","score_opus":0.007623799627371663,"score_gpt":0.21731722032938958,"score_spread":0.2096934207020179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597169801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005379258,0.00010070451,0.99248827,0.00016957405,0.000020628735,0.000011232295,0.00006881205,0.000099724624,0.0016617917],"genre_scores_gemma":[0.26463315,0.0009970181,0.7250484,0.00029475774,0.00017325493,0.00010153777,0.0005843092,0.0002858123,0.007881802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927944,0.00024881915,0.000034638062,0.00014396675,0.0002459874,0.00004714493],"domain_scores_gemma":[0.9984865,0.0006513846,0.00019758099,0.00033711642,0.00024953388,0.00007788435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096141984,0.000939378,0.000956916,0.0004894746,0.00023614145,0.0013720492,0.0006814211,0.00096586766,0.002279862],"category_scores_gemma":[0.005002567,0.00064482953,0.00051577843,0.0005548566,0.0011182986,0.0016406088,0.0018971593,0.0016794117,0.0012655419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012032253,0.00013945275,0.002187218,0.00089968345,0.00017819006,0.00072885404,0.00049428514,0.44324493,0.092281654,0.22447509,0.009972597,0.22419482],"study_design_scores_gemma":[0.000028253477,0.00007281766,0.0005695069,0.000034819117,0.000037546895,0.00052412116,0.00004972647,0.9396198,0.014477987,0.039578434,0.004969741,0.00003730768],"about_ca_topic_score_codex":0.00066519657,"about_ca_topic_score_gemma":0.0009477983,"teacher_disagreement_score":0.002279862,"about_ca_system_score_codex":0.00026950228,"about_ca_system_score_gemma":0.000964708,"threshold_uncertainty_score":0.0076268315},"labels":[],"label_agreement":null},{"id":"W1618893912","doi":"10.1109/isit.2015.7282922","title":"Low-complexity detection of zero blocks in wideband spectrum sensing","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Block (permutation group theory); Computer science; Wideband; Computational complexity theory; Cognitive radio; Algorithm; Sparse matrix; Context (archaeology); Signal recovery; Matrix (chemical analysis); Set (abstract data type); Mathematics; Electronic engineering; Wireless; Telecommunications; Engineering","score_opus":0.032605614417912605,"score_gpt":0.23385575690411536,"score_spread":0.20125014248620277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1618893912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020403976,0.00013370793,0.9782227,0.00007574409,0.000017955079,0.000022496562,0.000025221978,0.00012953115,0.0009686464],"genre_scores_gemma":[0.602948,0.00024290993,0.39433157,0.000102393074,0.000044045268,0.00007676366,0.00009307654,0.00002902673,0.0021321408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994173,0.00015864863,0.000028463455,0.00006645943,0.00027302295,0.000056035602],"domain_scores_gemma":[0.9981834,0.0010406383,0.00019876551,0.00028819885,0.00023635526,0.000052675558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080525375,0.00037758407,0.00048626977,0.0004219886,0.0003185284,0.00064750534,0.0006589652,0.0005618238,0.0010464626],"category_scores_gemma":[0.0038438584,0.00022915227,0.00018028171,0.00038351404,0.000682726,0.0010393655,0.0010459089,0.0008605283,0.0003204079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010734993,0.000106747444,0.001629358,0.00025519225,0.000047239508,0.00029718457,0.00036628146,0.23479313,0.20661329,0.15877545,0.0020982556,0.39394432],"study_design_scores_gemma":[0.000025216435,0.00015813162,0.00023294972,0.000018818188,0.0000092119335,0.00017122402,0.000030219668,0.94988316,0.030136198,0.017985256,0.0013304316,0.00001926364],"about_ca_topic_score_codex":0.0006529904,"about_ca_topic_score_gemma":0.0010773712,"teacher_disagreement_score":0.0010464626,"about_ca_system_score_codex":0.00027876673,"about_ca_system_score_gemma":0.0006500986,"threshold_uncertainty_score":0.0042586923},"labels":[],"label_agreement":null},{"id":"W1625520611","doi":"10.5281/zenodo.43381","title":"Generalized Non-Linear Sparse Classifier","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Generalization; Classifier (UML); Facial recognition system; Computer science; Pattern recognition (psychology); Linear classifier; Artificial intelligence; Mathematics; Algorithm","score_opus":0.039283782536091355,"score_gpt":0.23414472445648854,"score_spread":0.19486094192039718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1625520611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0114363665,0.0056694057,0.96229327,0.0028934903,0.0037600456,0.000119264194,0.0014897231,0.0014814436,0.010857001],"genre_scores_gemma":[0.26471397,0.0071836514,0.6343207,0.0011434454,0.003969715,0.0003056995,0.0120425625,0.0006408647,0.075679325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989561,0.00024779726,0.000046031815,0.00020167496,0.00045763914,0.000090729416],"domain_scores_gemma":[0.9980786,0.0004992342,0.0000916554,0.0004145403,0.0008314121,0.00008461135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014226137,0.0008129474,0.0015293049,0.0016105459,0.00043095293,0.0014373522,0.00089176884,0.0012905145,0.007805897],"category_scores_gemma":[0.0046359915,0.00032748905,0.00064622425,0.0018716253,0.00057570287,0.0012825284,0.0012020785,0.0017143682,0.005312984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023672867,0.00012542373,0.0007021039,0.00027661407,0.00010974816,0.0001605178,0.000056109817,0.038727168,0.015499386,0.026881833,0.11899112,0.7982332],"study_design_scores_gemma":[0.000040514326,0.0001569659,0.0014939425,0.00007720435,0.000058669368,0.00039180616,0.000040224506,0.9008562,0.0076126605,0.03171109,0.057525735,0.000035059486],"about_ca_topic_score_codex":0.0026824626,"about_ca_topic_score_gemma":0.0039135204,"teacher_disagreement_score":0.007805897,"about_ca_system_score_codex":0.00047218756,"about_ca_system_score_gemma":0.0014088054,"threshold_uncertainty_score":0.026113272},"labels":[],"label_agreement":null},{"id":"W1633303","doi":"","title":"Robustness, Risk, and Regularization in Support Vector Machines","year":2008,"lang":"en","type":"article","venue":"Targeted diagnosis and therapy","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Support vector machine; Robustness (evolution); Overfitting; Mathematical optimization; Regular polygon; Computer science; Margin classifier; Mathematics; Regularization perspectives on support vector machines; Regularization (linguistics); Artificial intelligence; Convex optimization; Machine learning; Algorithm; Inverse problem; Tikhonov regularization; Artificial neural network","score_opus":0.015408956881949917,"score_gpt":0.21523126196102985,"score_spread":0.19982230507907994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1633303","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003443645,0.0005910837,0.9939221,0.00070440373,0.00004266398,0.000019993462,0.000030907795,0.000048555143,0.0011966479],"genre_scores_gemma":[0.491488,0.0026186144,0.49768505,0.0009066992,0.0011842323,0.0004494385,0.00025742856,0.00019022783,0.005220374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942808,0.002444531,0.0003324237,0.0007887247,0.001896905,0.00025654468],"domain_scores_gemma":[0.9908709,0.006030923,0.0012355353,0.0008444035,0.0008236065,0.00019457485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006819057,0.001814596,0.0017846122,0.0017530251,0.00055368297,0.003172431,0.0019006875,0.0029621203,0.0015939751],"category_scores_gemma":[0.023602007,0.00064489036,0.0014493716,0.001497014,0.003436477,0.0046712463,0.0024184552,0.0036919618,0.00049127423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006596535,0.00007205896,0.00070727855,0.0002459441,0.000126036,0.00015825305,0.00019604168,0.35531265,0.0038095876,0.57439303,0.0020994868,0.06281377],"study_design_scores_gemma":[0.00001137808,0.00008384644,0.00021967651,0.000042373667,0.000018961742,0.000081942104,0.000021500182,0.6820434,0.0014541466,0.3141426,0.0018527203,0.000027467302],"about_ca_topic_score_codex":0.00059825013,"about_ca_topic_score_gemma":0.0003862751,"teacher_disagreement_score":0.006819057,"about_ca_system_score_codex":0.0012618654,"about_ca_system_score_gemma":0.0007646143,"threshold_uncertainty_score":0.036063015},"labels":[],"label_agreement":null},{"id":"W16541750","doi":"10.1016/j.neucom.2011.07.006","title":"Special issue on advances in web intelligence","year":2011,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Compressed sensing; Computer science; Neural coding; Linearization; Artificial intelligence; Image (mathematics); Coding (social sciences); Algorithm; Iterative reconstruction; Pattern recognition (psychology); Computer vision; Nonlinear system; Mathematics","score_opus":0.024476377424077395,"score_gpt":0.24163057607290575,"score_spread":0.21715419864882834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16541750","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017371769,0.054940216,0.006786557,0.02600696,0.7716154,0.00018014674,0.0007574414,0.0006778144,0.13729835],"genre_scores_gemma":[0.007312749,0.042100873,0.0025677108,0.0055250777,0.5015458,0.00014433863,0.0014732499,0.0005749682,0.43875527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867105,0.00014725374,0.00010669829,0.00022585507,0.0006930094,0.00015613431],"domain_scores_gemma":[0.9956201,0.0010052499,0.00027961383,0.0005163176,0.001470824,0.0011078934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016080122,0.0019750108,0.0027863903,0.004654105,0.0015639843,0.0058499468,0.0019267254,0.002570901,0.11766683],"category_scores_gemma":[0.0039893556,0.0004923325,0.0011257704,0.0035488328,0.0008144388,0.0039105457,0.0022022014,0.0026788649,0.050481968],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000438089,0.000058107416,0.00020778786,0.00038553376,0.000027569362,0.00010067378,0.000014515125,0.00014567247,0.00042071668,0.0037052825,0.9272515,0.06763877],"study_design_scores_gemma":[0.000010410912,0.000057000787,0.0006946025,0.00014693878,0.00002618956,0.00024853577,0.000026021859,0.00049904373,0.00022253038,0.0036369099,0.99441975,0.000012060456],"about_ca_topic_score_codex":0.000523895,"about_ca_topic_score_gemma":0.0020535404,"teacher_disagreement_score":0.11766683,"about_ca_system_score_codex":0.0012000495,"about_ca_system_score_gemma":0.0013826914,"threshold_uncertainty_score":0.3936348},"labels":[],"label_agreement":null},{"id":"W1672446266","doi":"10.1109/tsp.2015.2457391","title":"Restricted Isometry Property on Banded Block Toeplitz Matrices with Application to Multi-Channel Convolutive Source Separation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Toeplitz matrix; Restricted isometry property; Mathematics; Block (permutation group theory); Matrix (chemical analysis); Compressed sensing; Gaussian; Upper and lower bounds; Algorithm; Levinson recursion; Combinatorics; Mathematical analysis; Pure mathematics","score_opus":0.029906376913329372,"score_gpt":0.26463489888009845,"score_spread":0.23472852196676908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1672446266","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009865617,0.0003807274,0.98632205,0.00018535081,0.000040722538,0.000032500484,0.000066436114,0.00012450831,0.0029820665],"genre_scores_gemma":[0.70123005,0.0037436683,0.2873231,0.00053068285,0.00040539802,0.00032507334,0.0005001669,0.00021981302,0.0057220384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795747,0.0005284394,0.000115963194,0.00035108303,0.0008654711,0.000181514],"domain_scores_gemma":[0.9902192,0.005872317,0.0011865997,0.0010620829,0.0014454882,0.00021440703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021875363,0.0011222113,0.0007093786,0.0012084444,0.0004618336,0.0011620707,0.00074796594,0.0010919574,0.0028288648],"category_scores_gemma":[0.016085273,0.0005131872,0.00077558425,0.0014243427,0.0023029088,0.0027562536,0.001528606,0.002657262,0.00078451267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027937032,0.00013767852,0.0016030439,0.00039608157,0.000083895146,0.00094690284,0.00049991393,0.42437166,0.027591044,0.45336753,0.0035186592,0.08720422],"study_design_scores_gemma":[0.000015255845,0.000108582775,0.00044910266,0.000025252908,0.000013285069,0.00040022054,0.000050581668,0.9047937,0.0049514803,0.087539285,0.0016131273,0.000040130217],"about_ca_topic_score_codex":0.0011946156,"about_ca_topic_score_gemma":0.00069342734,"teacher_disagreement_score":0.0028288648,"about_ca_system_score_codex":0.00057280855,"about_ca_system_score_gemma":0.0008603566,"threshold_uncertainty_score":0.011568904},"labels":[],"label_agreement":null},{"id":"W1719460476","doi":"10.1109/tip.2014.2332755","title":"High-Accuracy Total Variation With Application to Compressed Video Sensing","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"ENCODE; Redundancy (engineering); Compressed sensing; Minification; Computational complexity theory; Quadratic equation; Image restoration; Iterative reconstruction; Total variation denoising; Quadratic programming","score_opus":0.006075626871021833,"score_gpt":0.2179854138974486,"score_spread":0.21190978702642677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719460476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007510697,0.00038461862,0.99063814,0.00015228761,0.000026407224,0.000014357962,0.00001040568,0.00009930944,0.0011637822],"genre_scores_gemma":[0.35409346,0.0009560249,0.6416445,0.0000832669,0.00008626853,0.000051648025,0.00005652801,0.00006218989,0.0029661031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999676,0.00010357143,0.000011315367,0.000041116386,0.00015268943,0.000015389633],"domain_scores_gemma":[0.99958986,0.00025254564,0.000042990338,0.00004098276,0.0000572813,0.000016328315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058007566,0.0004408552,0.00036929027,0.00037042683,0.00019576839,0.0003438683,0.00042168784,0.0006219122,0.00066456065],"category_scores_gemma":[0.0016454691,0.00017056578,0.00029025518,0.00047633174,0.00054615544,0.0004376526,0.00061971165,0.0006861489,0.00014667095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000156217,0.00006727677,0.00071460236,0.00024798163,0.000040777377,0.00016688697,0.00019406492,0.60911465,0.07502912,0.07942117,0.0016879983,0.23315924],"study_design_scores_gemma":[0.0000037373734,0.000029261928,0.0000611448,0.000004413288,0.0000024868036,0.000049125745,0.000004547687,0.9910227,0.004856898,0.0029008237,0.0010591361,0.0000056215486],"about_ca_topic_score_codex":0.0016262099,"about_ca_topic_score_gemma":0.0014759585,"teacher_disagreement_score":0.0016262099,"about_ca_system_score_codex":0.0002991591,"about_ca_system_score_gemma":0.0003405561,"threshold_uncertainty_score":0.0032334328},"labels":[],"label_agreement":null},{"id":"W1737609907","doi":"10.1016/j.acha.2015.07.003","title":"Directional tensor product complex tight framelets with low redundancy","year":2015,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Redundancy (engineering); Tensor product; Dimension (graph theory); Product (mathematics); Wavelet; Filter bank; Noise reduction","score_opus":0.01719145612645094,"score_gpt":0.22017228801464336,"score_spread":0.20298083188819244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1737609907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005725326,0.00012603065,0.9917671,0.0001585161,0.00009692852,0.000014964819,0.00009319516,0.00010291983,0.0019150107],"genre_scores_gemma":[0.1785411,0.0012598551,0.8067904,0.0004045428,0.00039879204,0.00009959917,0.00064870866,0.00024670153,0.011610337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.00016773686,0.000027703876,0.00008830425,0.00028581862,0.00003833763],"domain_scores_gemma":[0.99868244,0.00038663665,0.0001675214,0.00041884088,0.00026942135,0.00007514905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086161424,0.0011700735,0.0006618394,0.0008057549,0.00032605662,0.0012776727,0.00070010504,0.0011366513,0.004290676],"category_scores_gemma":[0.003705105,0.0005041939,0.00038703662,0.0013916038,0.0010303191,0.0019555013,0.0014119719,0.0014944673,0.0018065949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044989813,0.00011665192,0.00082046277,0.00031665826,0.00008226985,0.0002985143,0.00025192945,0.123694144,0.08629124,0.40357763,0.016151516,0.36794904],"study_design_scores_gemma":[0.000020147756,0.00012589767,0.0005588873,0.00003268938,0.00003031502,0.00038283438,0.000065870205,0.88675433,0.024715519,0.072786845,0.014478771,0.00004785998],"about_ca_topic_score_codex":0.0005142598,"about_ca_topic_score_gemma":0.0009667815,"teacher_disagreement_score":0.004290676,"about_ca_system_score_codex":0.00026978223,"about_ca_system_score_gemma":0.0005473447,"threshold_uncertainty_score":0.0143536925},"labels":[],"label_agreement":null},{"id":"W1763657074","doi":"10.1007/11784203_15","title":"Sub-sampling for Efficient Spectral Mesh Processing","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Sampling (signal processing); Measure (data warehouse); Algorithm; TRACE (psycholinguistics); Context (archaeology); Kernel (algebra); Pattern recognition (psychology); Artificial intelligence; Mathematics; Data mining; Computer vision","score_opus":0.01935876425803677,"score_gpt":0.2437447633353956,"score_spread":0.22438599907735884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1763657074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003379813,0.00017433826,0.99309206,0.00005334829,0.00004158658,0.000013540527,0.000046167734,0.00019481473,0.0030044026],"genre_scores_gemma":[0.109691285,0.0006703426,0.88179326,0.00011623652,0.00009740567,0.00007954577,0.00027636948,0.00018161158,0.0070939767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979013,0.000055098237,0.0000085344445,0.000020323978,0.00011132379,0.000014559744],"domain_scores_gemma":[0.9996088,0.00020237337,0.00001650019,0.00010220808,0.000056744266,0.0000134615275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002618733,0.00052051456,0.00047197856,0.0004501838,0.00020049252,0.0004817895,0.0005140006,0.00053062633,0.005855615],"category_scores_gemma":[0.0011424582,0.00022407171,0.0002639284,0.0008311796,0.00033692856,0.0006869599,0.00070155907,0.0006857475,0.001563767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002526447,0.00009098246,0.0002912087,0.00021500261,0.0000373569,0.0001090077,0.00008940097,0.10113277,0.07962948,0.12274829,0.010087114,0.6853167],"study_design_scores_gemma":[0.000010593082,0.00003139342,0.00012263167,0.000014249983,0.0000073868036,0.00013669883,0.000022621884,0.94187784,0.016299287,0.032252092,0.009217462,0.000007700438],"about_ca_topic_score_codex":0.00037690313,"about_ca_topic_score_gemma":0.00096899236,"teacher_disagreement_score":0.005855615,"about_ca_system_score_codex":0.00019425168,"about_ca_system_score_gemma":0.00020656126,"threshold_uncertainty_score":0.019589007},"labels":[],"label_agreement":null},{"id":"W1795776692","doi":"10.1371/journal.pone.0124088","title":"Nonlinear Spike-And-Slab Sparse Coding for Interpretable Image Encoding","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Bundesministerium für Bildung und Forschung; China Scholarship Council; Deutsche Forschungsgemeinschaft; Canadian Institute for Advanced Research","keywords":"Algorithm; Pixel; Computer science; Nonlinear system; Inference; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.0766875410619325,"score_gpt":0.2474714433505868,"score_spread":0.1707839022886543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795776692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050726575,0.00008989987,0.99362355,0.00017468909,0.000012223297,0.000012396748,0.00011213749,0.00013714186,0.0007653712],"genre_scores_gemma":[0.45499024,0.0008298785,0.5354799,0.0003996803,0.000116704505,0.00021587255,0.0008702532,0.00024168674,0.0068557523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996902,0.00009495044,0.00001339968,0.00004902825,0.000116750045,0.000035701654],"domain_scores_gemma":[0.9989348,0.0006294905,0.00010826407,0.0001672379,0.00011642054,0.000043721535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008621226,0.0004702931,0.00055909035,0.0005673135,0.00023536889,0.00079694483,0.0011956323,0.0009187843,0.002247256],"category_scores_gemma":[0.0036438776,0.00034488394,0.0006928133,0.0009340103,0.0011916267,0.0014415873,0.0010952224,0.002080921,0.0006142193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010260761,0.00003972419,0.0005241871,0.00013547733,0.000030322946,0.00011277779,0.00017749071,0.6400956,0.010200467,0.27507058,0.0027700213,0.07074077],"study_design_scores_gemma":[0.0000033111753,0.000006622341,0.00005167324,0.000005756224,0.0000020502755,0.000017781607,0.000005508937,0.96110904,0.00077097974,0.037478715,0.0005434133,0.000005170348],"about_ca_topic_score_codex":0.003766752,"about_ca_topic_score_gemma":0.0044082273,"teacher_disagreement_score":0.003766752,"about_ca_system_score_codex":0.0010808418,"about_ca_system_score_gemma":0.000828261,"threshold_uncertainty_score":0.007842064},"labels":[],"label_agreement":null},{"id":"W1807715286","doi":"10.48550/arxiv.1304.5586","title":"Tail bounds for stochastic approximation","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Stochastic approximation; Variance (accounting); Convergence (economics); Convex function; Mathematical optimization; Rate of convergence; Computer science; Scale (ratio); Regular polygon; Applied mathematics; Mathematics; Key (lock)","score_opus":0.06673869972299941,"score_gpt":0.17791397163904343,"score_spread":0.11117527191604402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807715286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008575637,0.008967263,0.94791716,0.003950033,0.00072307576,0.00008901722,0.0006368151,0.0007661509,0.02837479],"genre_scores_gemma":[0.6799208,0.032167826,0.20023827,0.0067858887,0.006088025,0.0017801296,0.0035574727,0.0026493326,0.06681233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99395496,0.0020473904,0.0002588487,0.0009859296,0.0019761194,0.00077670754],"domain_scores_gemma":[0.9306118,0.051610656,0.0032775013,0.005599553,0.0070732953,0.0018272504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011454049,0.00270387,0.0023518407,0.0031854317,0.0021349804,0.004738982,0.0034813776,0.0031106004,0.017806575],"category_scores_gemma":[0.08297659,0.001033915,0.0020710148,0.002994793,0.0049647437,0.008922572,0.005282649,0.010827305,0.0039173327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016533538,0.000055984827,0.0014669508,0.00044233972,0.00010082267,0.00019524268,0.00018450721,0.05585534,0.0011906575,0.9046147,0.011675509,0.02405256],"study_design_scores_gemma":[0.000021361639,0.000057889574,0.0005928811,0.00024519625,0.00005489202,0.00013987499,0.000056142544,0.3336318,0.00096951006,0.6544803,0.009704476,0.000045560235],"about_ca_topic_score_codex":0.0031562138,"about_ca_topic_score_gemma":0.002677063,"teacher_disagreement_score":0.017806575,"about_ca_system_score_codex":0.0045251055,"about_ca_system_score_gemma":0.0025039848,"threshold_uncertainty_score":0.060575485},"labels":[],"label_agreement":null},{"id":"W1821374938","doi":"10.1080/10556788.2015.1062891","title":"An efficient optimization approach for a cardinality-constrained index tracking problem","year":2015,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Key Research and Development Program of China; University of Otago","keywords":"Cardinality (data modeling); Mathematical optimization; Computer science; Tracking (education); Tracking error; Portfolio; Regularization (linguistics); Thresholding; Mathematics; Artificial intelligence; Data mining","score_opus":0.05089273698655643,"score_gpt":0.3335022468907675,"score_spread":0.2826095099042111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1821374938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027676157,0.000103051105,0.99581075,0.0001453564,0.000014506731,0.000037850416,0.000029738583,0.00006705919,0.001024053],"genre_scores_gemma":[0.16992784,0.00038608498,0.8245601,0.000199904,0.00010588286,0.00040877404,0.00028443587,0.00016722016,0.003959757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990683,0.00033830706,0.000050971423,0.00020206149,0.000257448,0.00008291196],"domain_scores_gemma":[0.9980032,0.001346224,0.0001682227,0.00013337523,0.000262455,0.00008659248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023635465,0.0011656715,0.0014019682,0.0009865364,0.0006073655,0.0013501927,0.0013645686,0.001979844,0.004115816],"category_scores_gemma":[0.0059287134,0.00087712595,0.0010491402,0.0012382211,0.00086323684,0.0017587317,0.0018815311,0.0021731362,0.00071137986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005174601,0.00006926733,0.00044003554,0.00011085727,0.000034921664,0.00010015874,0.000057029287,0.9175522,0.0018135065,0.023944726,0.0020504785,0.053775065],"study_design_scores_gemma":[0.0000072227963,0.000015633752,0.000043899876,0.0000052661744,0.000003980067,0.000016513462,0.000004936561,0.9941122,0.00022035847,0.005189801,0.0003768951,0.0000033431058],"about_ca_topic_score_codex":0.0036165786,"about_ca_topic_score_gemma":0.003207803,"teacher_disagreement_score":0.004115816,"about_ca_system_score_codex":0.0009945253,"about_ca_system_score_gemma":0.0019642976,"threshold_uncertainty_score":0.013768792},"labels":[],"label_agreement":null},{"id":"W1847865502","doi":"10.1109/wts.2014.6834995","title":"Bayesian quantized network coding via generalized approximate message passing","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Linear network coding; Decoding methods; Computer science; Message passing; Belief propagation; Network packet; Theoretical computer science; Distributed source coding; Robustness (evolution); Algorithm; Coding (social sciences); Computer network; Variable-length code; Mathematics; Distributed computing","score_opus":0.01292823694766395,"score_gpt":0.22027954254431695,"score_spread":0.207351305596653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847865502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005602752,0.00011631163,0.99225396,0.0001821803,0.000021037798,0.000020291676,0.000028754137,0.000063907406,0.0017108462],"genre_scores_gemma":[0.6200367,0.00089627504,0.37095934,0.0003171209,0.00014528478,0.0002860433,0.00021769661,0.00009181444,0.0070496215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862015,0.0006641907,0.000036696136,0.00011996017,0.00046617436,0.00009290344],"domain_scores_gemma":[0.9978163,0.0015348454,0.00017401375,0.00021131404,0.00022228614,0.000041169023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018649341,0.00067502185,0.00071808556,0.0005996862,0.0003156279,0.0010992938,0.001183548,0.0010533736,0.0015396652],"category_scores_gemma":[0.0065314695,0.00028558137,0.00039807815,0.0009588087,0.0017366341,0.0022598,0.0010924517,0.0013494708,0.00032242484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004980859,0.00001695528,0.00013383834,0.000054258868,0.000015118873,0.00004971491,0.000086298474,0.7059247,0.001583896,0.27296203,0.0006467798,0.018476624],"study_design_scores_gemma":[0.000008744754,0.000017535229,0.000024432404,0.00000667051,0.0000026097741,0.000016671609,0.000008346404,0.9542414,0.00048642338,0.044624288,0.000556588,0.0000062762924],"about_ca_topic_score_codex":0.0026606887,"about_ca_topic_score_gemma":0.0018285408,"teacher_disagreement_score":0.0026606887,"about_ca_system_score_codex":0.0013802751,"about_ca_system_score_gemma":0.0011484196,"threshold_uncertainty_score":0.010014653},"labels":[],"label_agreement":null},{"id":"W1851634808","doi":"10.1111/cgf.12622","title":"Compressive Volume Rendering","year":2015,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Rendering (computer graphics); Pixel; Volume rendering; Computer vision; Compressed sensing; Artificial intelligence; Tiled rendering; Image-based modeling and rendering; 3D rendering; Algorithm; Computer graphics (images); Computer graphics; Software rendering","score_opus":0.026544882224034224,"score_gpt":0.21999952010145532,"score_spread":0.1934546378774211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1851634808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057581406,0.000711459,0.9205245,0.0004634307,0.00017613685,0.00020326136,0.00026037195,0.0023391244,0.017740304],"genre_scores_gemma":[0.68110704,0.0007138134,0.3114287,0.000216209,0.00013199724,0.00011590262,0.00037920047,0.0002733109,0.005633792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920684,0.00013383185,0.000021537924,0.000084568324,0.00048693983,0.000066234454],"domain_scores_gemma":[0.9984529,0.0008837997,0.000102186714,0.000288775,0.0002159292,0.000056349665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007381999,0.0007078335,0.0006722619,0.0006011322,0.0003485524,0.0016185119,0.00077301613,0.0007551389,0.0065004285],"category_scores_gemma":[0.004710525,0.00024091032,0.0004703639,0.00049235433,0.0009732832,0.0010657081,0.0014384263,0.0010385856,0.00079533306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598643,0.00022046044,0.0016463822,0.00045612035,0.000089015986,0.0004587789,0.0003303477,0.47568107,0.18685944,0.05155204,0.010163536,0.27178296],"study_design_scores_gemma":[0.00010298783,0.00020362946,0.0005833228,0.00005059721,0.000022024451,0.00048686413,0.00006158217,0.9220509,0.05071005,0.015342165,0.010341597,0.000044410237],"about_ca_topic_score_codex":0.0018244211,"about_ca_topic_score_gemma":0.0016267736,"teacher_disagreement_score":0.0065004285,"about_ca_system_score_codex":0.00045652888,"about_ca_system_score_gemma":0.00060761365,"threshold_uncertainty_score":0.021746099},"labels":[],"label_agreement":null},{"id":"W1853318468","doi":"10.48550/arxiv.1305.3803","title":"A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems","year":2013,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Overdetermined system; Underdetermined system; Linear system; Compressed sensing; Mathematics; Solver; Convergence (economics); Speedup; System of linear equations; Algorithm; Mathematical optimization; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.06109026281954108,"score_gpt":0.2576122065992608,"score_spread":0.19652194377971974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853318468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015677005,0.00005958736,0.99718624,0.000110577144,0.000021551186,0.000036321755,0.000032476277,0.00037243663,0.00061307056],"genre_scores_gemma":[0.054273926,0.00012766662,0.94263405,0.00016203715,0.00006192181,0.00023445502,0.00023030648,0.000206894,0.0020685918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884295,0.0003431409,0.00005947952,0.00018745313,0.000471952,0.000094849245],"domain_scores_gemma":[0.9986259,0.0007167393,0.00013173075,0.00022213788,0.0002563564,0.000047124657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014299286,0.0010359939,0.000885756,0.00094301795,0.0007278215,0.0010144395,0.0014539576,0.0014910444,0.005695831],"category_scores_gemma":[0.00635939,0.00057846896,0.00072272,0.0009816688,0.00091825967,0.0014596734,0.001952441,0.0021134033,0.002233084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003408433,0.0001673791,0.00069313083,0.00020145641,0.0000870312,0.00021259995,0.00017837252,0.43167725,0.01953807,0.11901782,0.012647692,0.41523832],"study_design_scores_gemma":[0.000059991988,0.000046237285,0.00009498274,0.000011813968,0.000007228218,0.00008169943,0.000017974318,0.97425306,0.00344766,0.017720962,0.0042377487,0.000020660871],"about_ca_topic_score_codex":0.0030428476,"about_ca_topic_score_gemma":0.0057308143,"teacher_disagreement_score":0.005695831,"about_ca_system_score_codex":0.0006375302,"about_ca_system_score_gemma":0.0025461547,"threshold_uncertainty_score":0.019054413},"labels":[],"label_agreement":null},{"id":"W1898805148","doi":"10.1109/ssp.2016.7551732","title":"Sparse multivariate factor regression","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dimension (graph theory); Multivariate statistics; Matrix (chemical analysis); Mathematical optimization; Convex optimization; Algorithm; Convergence (economics); Optimization problem; Computer science; Mathematics; Set (abstract data type); Dimensionality reduction; Regression; Latent variable; Regular polygon; Artificial intelligence; Statistics; Combinatorics","score_opus":0.03997285170811636,"score_gpt":0.27557949108618324,"score_spread":0.23560663937806686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898805148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000722811,0.00011907476,0.9983382,0.00010004634,0.000030013704,0.000016726151,0.000079012556,0.00021274106,0.0003813744],"genre_scores_gemma":[0.060458567,0.00084953074,0.9336925,0.00024371354,0.00027177867,0.00016822705,0.000872099,0.0002320203,0.0032116252],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982659,0.000635242,0.000077705125,0.00036192682,0.00053339504,0.00012580953],"domain_scores_gemma":[0.99761957,0.0010968389,0.0002596626,0.0004840269,0.00045701902,0.000082879575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018475736,0.0015921907,0.0015926788,0.0011112414,0.0005067108,0.0013221004,0.0017308367,0.0014012808,0.0042670774],"category_scores_gemma":[0.009581193,0.0006176794,0.0013627323,0.0022197827,0.00090941467,0.0018607359,0.0016946702,0.0026722942,0.0025272775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014583545,0.000119803546,0.0018861906,0.00033090322,0.00023643748,0.0001510076,0.00013209987,0.41401416,0.010258831,0.10401105,0.017610965,0.45110264],"study_design_scores_gemma":[0.000016459477,0.000036435125,0.00028390062,0.000021447559,0.000020589203,0.000093576135,0.000014481728,0.9627286,0.002041622,0.026157217,0.008564543,0.000021097614],"about_ca_topic_score_codex":0.003677707,"about_ca_topic_score_gemma":0.0041927644,"teacher_disagreement_score":0.0042670774,"about_ca_system_score_codex":0.0005648206,"about_ca_system_score_gemma":0.0015388018,"threshold_uncertainty_score":0.014274776},"labels":[],"label_agreement":null},{"id":"W1922914710","doi":"10.1016/j.compbiomed.2015.07.014","title":"The use of compressive sensing and peak detection in the reconstruction of microtubules length time series in the process of dynamic instability","year":2015,"lang":"en","type":"article","venue":"Computers in Biology and Medicine","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; MacEwan University","funders":"","keywords":"Wavelet; Instability; Sampling (signal processing); Mean squared error; Algorithm; Shrinkage; Mathematics; Compressed sensing; Wavelet transform; Noise (video); SIGNAL (programming language); Biological system; Computer science; Statistics; Physics; Artificial intelligence; Telecommunications","score_opus":0.02157889676507799,"score_gpt":0.26710790513586274,"score_spread":0.24552900837078476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922914710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04489519,0.0005057635,0.9530907,0.00045250173,0.000045321667,0.000019570914,0.000053889427,0.00009464747,0.00084246544],"genre_scores_gemma":[0.654845,0.0011915034,0.34130964,0.00013468451,0.0002364215,0.000055498684,0.00014503671,0.00007445409,0.0020077936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969685,0.00011909305,0.00001819184,0.000053322132,0.00009293587,0.000019562873],"domain_scores_gemma":[0.99681395,0.0024519523,0.0002397317,0.00018667226,0.00021664772,0.00009112519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014772571,0.0005552364,0.00044494495,0.00070248265,0.0003185591,0.0007325976,0.0006169548,0.0008673366,0.0005847488],"category_scores_gemma":[0.008377498,0.00034861572,0.00037803518,0.0007227352,0.0012326444,0.0015544078,0.00084094267,0.0012716855,0.00012239859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067165925,0.00012868241,0.0033669872,0.0002733673,0.00010713588,0.00028475194,0.00047532056,0.5554285,0.064295895,0.13270372,0.0015708767,0.24069315],"study_design_scores_gemma":[0.000005016887,0.000027186423,0.00029983153,0.0000065845875,0.000005336971,0.000046441142,0.000012650772,0.98456,0.0031357505,0.011616096,0.00026970648,0.000015384561],"about_ca_topic_score_codex":0.0014476177,"about_ca_topic_score_gemma":0.0013264113,"teacher_disagreement_score":0.0014772571,"about_ca_system_score_codex":0.00031462387,"about_ca_system_score_gemma":0.00041949513,"threshold_uncertainty_score":0.00781256},"labels":[],"label_agreement":null},{"id":"W1923938124","doi":"10.1109/tsp.2014.2324994","title":"An Adaptive Approach to Learn Overcomplete Dictionaries With Efficient Numbers of Elements","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Toronto Metropolitan University; University of Toronto","funders":"","keywords":"K-SVD; Sparse approximation; Computer science; Representation (politics); Pattern recognition (psychology); Artificial intelligence; Set (abstract data type); Singular value decomposition; Algorithm","score_opus":0.01785593757122973,"score_gpt":0.2277793138414049,"score_spread":0.20992337627017518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923938124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033579136,0.00013161691,0.9958996,0.000052255873,0.000022191678,0.00001806817,0.000024767303,0.00016162654,0.0003319674],"genre_scores_gemma":[0.14194097,0.0006132776,0.85316277,0.0002892587,0.00014071692,0.00019726303,0.00037170216,0.00012239534,0.003161649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994155,0.0001222354,0.000050230563,0.00017786064,0.00019066382,0.000043488308],"domain_scores_gemma":[0.9991405,0.0003377029,0.00010039484,0.0001706299,0.00021335126,0.000037401966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066903856,0.0007977684,0.0011109096,0.0007453071,0.00030911833,0.00049947365,0.0012321649,0.000998343,0.0014368731],"category_scores_gemma":[0.0024720244,0.00050332095,0.0007435094,0.0010125663,0.00069847296,0.001402503,0.0011513326,0.0015139319,0.00081562356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025472275,0.00015682272,0.0010791881,0.0003209717,0.00015457821,0.00012652864,0.00022113566,0.347733,0.05795113,0.026938425,0.0052421885,0.5598213],"study_design_scores_gemma":[0.000015627651,0.00007397642,0.00013475648,0.000011510728,0.000016489756,0.000080305166,0.000013525184,0.98854244,0.004911382,0.004145408,0.0020420677,0.000012541228],"about_ca_topic_score_codex":0.0018599249,"about_ca_topic_score_gemma":0.002986936,"teacher_disagreement_score":0.0018599249,"about_ca_system_score_codex":0.00033982363,"about_ca_system_score_gemma":0.0007739511,"threshold_uncertainty_score":0.004806757},"labels":[],"label_agreement":null},{"id":"W1924844397","doi":"10.1214/15-ejs1061","title":"Multivariate sharp quadratic bounds via $\\mathbf{\\Sigma}$-strong convexity and the Fenchel connection","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Convexity; Mathematics; Monotonic function; Lipschitz continuity; Connection (principal bundle); Majorization; Combinatorics; Multivariate statistics; Applied mathematics; Convex function; Sigma; Regular polygon; Quadratic equation; Function (biology); Pure mathematics; Discrete mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.01741142896370025,"score_gpt":0.24233446174428555,"score_spread":0.22492303278058529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924844397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072447374,0.00049537624,0.98576516,0.0005723401,0.00005474096,0.000015231403,0.000097810385,0.00010040367,0.005654268],"genre_scores_gemma":[0.60614425,0.0032233624,0.36692536,0.0014379678,0.0008953536,0.00032799106,0.0006466944,0.00060266,0.019796355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983531,0.0007417555,0.000059459482,0.0002494534,0.00041974022,0.00017639117],"domain_scores_gemma":[0.99338007,0.004369223,0.0005508589,0.0006837757,0.00074498163,0.00027105268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052881595,0.0018362243,0.0011864891,0.002200425,0.00066204154,0.002159516,0.0013896741,0.0011231102,0.0041829827],"category_scores_gemma":[0.014708713,0.00067009276,0.0016467551,0.0013357792,0.0029791384,0.0043432936,0.0034038674,0.004511921,0.0008622437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050185878,0.000027795371,0.0005279746,0.000089210065,0.000042576445,0.00011906427,0.00009897791,0.072343424,0.0023316767,0.9008589,0.0030706332,0.02043957],"study_design_scores_gemma":[0.000007381534,0.000052314394,0.0005104365,0.000035483066,0.000017811506,0.00012284995,0.00003432891,0.55212885,0.001580189,0.44119596,0.0042848964,0.000029480021],"about_ca_topic_score_codex":0.0018507474,"about_ca_topic_score_gemma":0.0020910993,"teacher_disagreement_score":0.0052881595,"about_ca_system_score_codex":0.0017711349,"about_ca_system_score_gemma":0.0012356002,"threshold_uncertainty_score":0.027966738},"labels":[],"label_agreement":null},{"id":"W1926575136","doi":"10.1190/tle34101256.1","title":"Introduction to compressed sensing","year":2015,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Field (mathematics); Computer science; Compressed sensing; Foundation (evidence); Photography; Simple (philosophy); Digital imaging; Data science; Computer graphics (images); Digital image; Artificial intelligence; Image processing; Archaeology; Visual arts; Art; Epistemology; Mathematics; Image (mathematics); History; Philosophy","score_opus":0.03662192804540264,"score_gpt":0.2538282798210543,"score_spread":0.21720635177565167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926575136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017179516,0.17922358,0.62775165,0.013508641,0.010938028,0.00028633876,0.0044142194,0.001924052,0.16023552],"genre_scores_gemma":[0.054145254,0.33837616,0.453849,0.016927652,0.03412077,0.00090901024,0.0075009875,0.0012492372,0.09292197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867827,0.000245808,0.00009300024,0.00030168597,0.00059770927,0.00008342915],"domain_scores_gemma":[0.99782914,0.0013364388,0.00007762419,0.00021654677,0.00045141566,0.00008872149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010618621,0.0012654148,0.00078408775,0.0018605464,0.0005990021,0.0020308094,0.0011288406,0.0021417395,0.03295715],"category_scores_gemma":[0.004190854,0.000498176,0.00069470954,0.003144961,0.0015085657,0.0026612328,0.0015185059,0.004245385,0.016536597],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057658137,0.000075425836,0.0004854061,0.001871176,0.00006118694,0.0003167519,0.00029837416,0.006806298,0.0040157563,0.3484798,0.2353864,0.40214577],"study_design_scores_gemma":[0.000009264372,0.00007669488,0.00040478492,0.00046532642,0.000013777256,0.00080047344,0.00004761526,0.0052212738,0.00079247786,0.18461263,0.80750656,0.0000491013],"about_ca_topic_score_codex":0.0014122335,"about_ca_topic_score_gemma":0.000966839,"teacher_disagreement_score":0.03295715,"about_ca_system_score_codex":0.0008447309,"about_ca_system_score_gemma":0.0011878783,"threshold_uncertainty_score":0.11025268},"labels":[],"label_agreement":null},{"id":"W193587042","doi":"10.1007/978-3-642-30507-8_50","title":"Robust Wireless Sensor Networks with Compressed Sensing Theory","year":2012,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless sensor network; Computer science; Compressed sensing; Real-time computing; Key distribution in wireless sensor networks; Sensor node; Energy consumption; Computer network; Wireless; Wireless network; Telecommunications; Electrical engineering; Engineering; Algorithm","score_opus":0.035887522823653525,"score_gpt":0.2344550307298057,"score_spread":0.19856750790615219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W193587042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011791021,0.007577793,0.972829,0.0005818554,0.00036803656,0.000027672126,0.00008337854,0.00025464364,0.0170986],"genre_scores_gemma":[0.20507452,0.03936599,0.7128158,0.0008819273,0.0026543231,0.00035309576,0.000507602,0.0003172685,0.03802942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999376,0.00012822782,0.000025993018,0.00007404552,0.00037789135,0.000017912078],"domain_scores_gemma":[0.9995086,0.0003033528,0.00003593107,0.000065950226,0.000078079254,0.000008020572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055153,0.0008609667,0.00072104693,0.00065725856,0.0001602323,0.00085013587,0.0009789147,0.0008597387,0.0026942703],"category_scores_gemma":[0.0019165503,0.0003542205,0.00036031206,0.0013853565,0.00093757675,0.0017030938,0.0010212829,0.0012505738,0.0008617587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005369979,0.00003992282,0.00010583383,0.00071753905,0.000073573276,0.00010702164,0.000079740355,0.19395092,0.009358048,0.30873173,0.022781499,0.46400058],"study_design_scores_gemma":[0.000014475118,0.000068250825,0.00020830447,0.00012348496,0.000034572997,0.00030307315,0.0000314273,0.6435931,0.0050157835,0.30012402,0.050450873,0.000032653144],"about_ca_topic_score_codex":0.0003872588,"about_ca_topic_score_gemma":0.00038909612,"teacher_disagreement_score":0.0026942703,"about_ca_system_score_codex":0.00038566373,"about_ca_system_score_gemma":0.0003433069,"threshold_uncertainty_score":0.009013236},"labels":[],"label_agreement":null},{"id":"W1936234780","doi":"10.1007/s10107-013-0733-1","title":"Convex optimization for the planted k-disjoint-clique problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Mathematics; Combinatorics; Clique; Cluster analysis; Partition (number theory); Discrete mathematics","score_opus":0.015510040891089488,"score_gpt":0.22342986152008346,"score_spread":0.20791982062899397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1936234780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011993117,0.0006746595,0.97639966,0.0019357377,0.000098263576,0.00008177441,0.000564316,0.00012457387,0.008127845],"genre_scores_gemma":[0.4592068,0.0027020776,0.5098284,0.0010424862,0.0007706004,0.000893043,0.0021476788,0.00066940126,0.022739522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838793,0.00079128885,0.00004422045,0.00033604147,0.00029325,0.00014725202],"domain_scores_gemma":[0.99186796,0.006668621,0.00043693616,0.0003244279,0.0004265598,0.00027547678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029790679,0.0017478565,0.0022763524,0.0009951784,0.0008069797,0.0025199626,0.0033238067,0.0028183977,0.0073493253],"category_scores_gemma":[0.014663013,0.0011605418,0.001168709,0.0021147605,0.002589006,0.004421868,0.0025759095,0.0042028544,0.00090467813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016313787,0.00017572567,0.0005156469,0.0004457484,0.00009775217,0.00013141592,0.00011757544,0.66670614,0.0010391226,0.29395768,0.013279356,0.02337071],"study_design_scores_gemma":[0.000024528252,0.000016266948,0.00011742881,0.000019886576,0.000009526098,0.00002778342,0.000029933512,0.8712849,0.00015632669,0.12723993,0.0010634913,0.00001001718],"about_ca_topic_score_codex":0.0053380434,"about_ca_topic_score_gemma":0.0069127264,"teacher_disagreement_score":0.0073493253,"about_ca_system_score_codex":0.0025401732,"about_ca_system_score_gemma":0.002285821,"threshold_uncertainty_score":0.024585903},"labels":[],"label_agreement":null},{"id":"W1949733609","doi":"10.1109/icip.2001.959213","title":"QoS based video delivery with foveation","year":2002,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Data compression; Computer vision; Image compression; Transform coding; The Internet; Artificial intelligence; Computer graphics (images); Image processing; Image (mathematics); Computer network; Discrete cosine transform; World Wide Web","score_opus":0.013451976570871728,"score_gpt":0.16379527745356318,"score_spread":0.15034330088269146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1949733609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16991924,0.0035912106,0.8067671,0.0014685699,0.0002734597,0.00017099937,0.000116160474,0.0049874242,0.012705802],"genre_scores_gemma":[0.93562376,0.0005985573,0.059958056,0.00020772629,0.00016836438,0.0000397816,0.0000650701,0.000081688144,0.0032568998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990802,0.00017700109,0.00004264713,0.00017550593,0.00038928672,0.00013533907],"domain_scores_gemma":[0.998164,0.0007742378,0.00018739702,0.00027659663,0.00046035714,0.00013742498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083701505,0.00062115863,0.0007972106,0.0006312224,0.00074840157,0.000918023,0.0008552399,0.0009593081,0.0017303112],"category_scores_gemma":[0.003797723,0.00026820524,0.00023330773,0.0005576451,0.0006366655,0.0015647581,0.0017032339,0.0008904184,0.00041360263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020865751,0.0003948347,0.0024674488,0.00025104653,0.00010249405,0.0016475656,0.0008805447,0.13057631,0.2563506,0.029754026,0.012911042,0.56257755],"study_design_scores_gemma":[0.000085257656,0.00043534327,0.0010052132,0.000032318647,0.000048034562,0.0014043018,0.00024135232,0.9181177,0.0595005,0.010589536,0.008467756,0.00007276198],"about_ca_topic_score_codex":0.003646266,"about_ca_topic_score_gemma":0.0021790266,"teacher_disagreement_score":0.003646266,"about_ca_system_score_codex":0.0009372745,"about_ca_system_score_gemma":0.0006371414,"threshold_uncertainty_score":0.0072500706},"labels":[],"label_agreement":null},{"id":"W1959158481","doi":"10.48550/arxiv.1202.3772","title":"Rank/Norm Regularization with Closed-Form Solutions: Application to Subspace Clustering","year":2012,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Linear subspace; Subspace topology; Mathematics; Rank (graph theory); Cluster analysis; Regularization (linguistics); Invariant subspace; Norm (philosophy); Invariant (physics); Principal component analysis; Matrix norm; Generalization; Pure mathematics; Applied mathematics; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis; Computer science; Artificial intelligence; Statistics","score_opus":0.031241694813987027,"score_gpt":0.23946775475151855,"score_spread":0.20822605993753152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1959158481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002693408,0.0002455047,0.9954465,0.00027930553,0.000018216446,0.000016733527,0.00001837207,0.000062581574,0.0012192812],"genre_scores_gemma":[0.19119442,0.0018725031,0.80164224,0.00036569554,0.000330219,0.00022938372,0.00025391456,0.00021975877,0.003891907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789375,0.0010967082,0.00007811713,0.0002735273,0.000591368,0.00006655739],"domain_scores_gemma":[0.9950541,0.0033291043,0.0004362333,0.00040667155,0.00065062946,0.00012316795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034565642,0.001210494,0.0010742694,0.0009765052,0.0005863433,0.0012711878,0.001048773,0.002217375,0.00165679],"category_scores_gemma":[0.01497009,0.0005035088,0.00075837766,0.0016311612,0.0024400614,0.0020203644,0.0028873426,0.0023980972,0.00051903963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006393349,0.00009201841,0.00037888178,0.00026572502,0.00007135855,0.0001714849,0.00037259905,0.50380266,0.0062595676,0.3938547,0.004775856,0.08989123],"study_design_scores_gemma":[0.0000073788383,0.000025154377,0.000050947354,0.000014594045,0.0000039829847,0.00005349354,0.000033530774,0.88528395,0.0008705648,0.112089686,0.0015544418,0.000012216501],"about_ca_topic_score_codex":0.0011254359,"about_ca_topic_score_gemma":0.0010888822,"teacher_disagreement_score":0.0034565642,"about_ca_system_score_codex":0.0006678228,"about_ca_system_score_gemma":0.0009464578,"threshold_uncertainty_score":0.018280268},"labels":[],"label_agreement":null},{"id":"W1964457997","doi":"10.1109/icassp.2014.6854550","title":"Denoising using multi-stage randomized orthogonal matching pursuit","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Matching pursuit; Noise reduction; Algorithm; Matching (statistics); Range (aeronautics); Computer science; Reduction (mathematics); Mathematics; Mathematical optimization; Artificial intelligence; Compressed sensing; Statistics","score_opus":0.04193506552814732,"score_gpt":0.27850885864544855,"score_spread":0.23657379311730123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964457997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011424101,0.000108794025,0.98742515,0.00007266048,0.000021721027,0.000017955697,0.000013543244,0.00021967002,0.0006964152],"genre_scores_gemma":[0.43367493,0.00022886331,0.5636402,0.00014293037,0.000044205735,0.000098020384,0.00010219799,0.00008908004,0.00197965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991881,0.00025908957,0.000036479596,0.00015493031,0.00030063,0.000060742794],"domain_scores_gemma":[0.9991173,0.0004732902,0.00013075597,0.00012683423,0.0001208994,0.00003085698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011715016,0.000575419,0.0007983403,0.0003325098,0.00030788893,0.00056556537,0.0010291067,0.0010809355,0.00076677743],"category_scores_gemma":[0.002662,0.00041753604,0.00078890915,0.00044663882,0.00057765824,0.00094758114,0.0008556997,0.0009622551,0.00028181743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034759755,0.00013924955,0.00082779775,0.00013800683,0.00011552993,0.00021683214,0.00007737414,0.803243,0.06917079,0.026723333,0.0013054092,0.09769502],"study_design_scores_gemma":[0.000010301784,0.000045430024,0.00005355865,0.0000026861765,0.0000059360937,0.000032798936,0.0000023785906,0.9930159,0.005083785,0.0013438674,0.0003966761,0.000006801872],"about_ca_topic_score_codex":0.0009792144,"about_ca_topic_score_gemma":0.0013061061,"teacher_disagreement_score":0.0011715016,"about_ca_system_score_codex":0.00034817183,"about_ca_system_score_gemma":0.0006011253,"threshold_uncertainty_score":0.006195545},"labels":[],"label_agreement":null},{"id":"W1965164548","doi":"10.1007/s11432-012-4679-3","title":"Sparse kernel logistic regression based on L 1/2 regularization","year":2012,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Logistic regression; Kernel regression; Statistics; Kernel (algebra); Mathematics; Logistic model tree; Pattern recognition (psychology); Artificial intelligence; Regularization (linguistics); Regression; Computer science; Combinatorics","score_opus":0.035382380894864056,"score_gpt":0.28349430191133157,"score_spread":0.2481119210164675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965164548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056487485,0.00018242096,0.9930333,0.0003203124,0.00003387045,0.0000127851035,0.00004075469,0.00018032287,0.00054749],"genre_scores_gemma":[0.44313505,0.0011340148,0.5436017,0.00041973896,0.00039002436,0.0002273465,0.00059314916,0.0003105583,0.010188479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989723,0.0005457582,0.00004047568,0.00014724115,0.0002209327,0.00007333624],"domain_scores_gemma":[0.9969036,0.0019456877,0.0002841989,0.0003355279,0.00043792528,0.000093151066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020978963,0.00079915853,0.0013013496,0.0006383696,0.0004062157,0.0009686997,0.0015570341,0.0015444527,0.0021154224],"category_scores_gemma":[0.010660906,0.0005644181,0.00068293,0.0012204063,0.0010092744,0.00176097,0.0017801778,0.002383855,0.000939964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043769344,0.00017718336,0.0021877848,0.00028265527,0.00016037116,0.00028436785,0.00018006818,0.59156483,0.00920982,0.16922325,0.013253417,0.21303858],"study_design_scores_gemma":[0.0000069014236,0.000007641249,0.000068033136,0.0000034770248,0.000004316717,0.000024405308,0.0000037334069,0.9924078,0.00029941174,0.0067998567,0.00036870743,0.000005646999],"about_ca_topic_score_codex":0.0030613844,"about_ca_topic_score_gemma":0.0031362637,"teacher_disagreement_score":0.0030613844,"about_ca_system_score_codex":0.0005584797,"about_ca_system_score_gemma":0.0012110255,"threshold_uncertainty_score":0.011094809},"labels":[],"label_agreement":null},{"id":"W1966102612","doi":"10.1109/lsp.2011.2177086","title":"Compressed Sensing With Nonlinear Analog Mapping in a Noisy Environment","year":2011,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Compressed sensing; Computer science; Nonlinear system; Nonlinear distortion; Distortion (music); SIGNAL (programming language); Noise (video); Noise measurement; Signal reconstruction; Analog signal; Signal-to-noise ratio (imaging); Channel (broadcasting); Algorithm; Signal processing; Artificial intelligence; Noise reduction; Digital signal processing; Telecommunications; Bandwidth (computing); Image (mathematics)","score_opus":0.02492894682055673,"score_gpt":0.18574376289286823,"score_spread":0.1608148160723115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966102612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10459878,0.0006325217,0.88910395,0.0007352609,0.00013064855,0.000059831807,0.00005618288,0.00023434506,0.0044485196],"genre_scores_gemma":[0.84962875,0.0003309568,0.14768857,0.00021367504,0.00011156213,0.00004811057,0.000038228616,0.00001185533,0.0019283948],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997243,0.0000933668,0.000010809982,0.00003874601,0.000113997885,0.0000186309],"domain_scores_gemma":[0.99971884,0.00013435082,0.00004939941,0.000035923313,0.000044630262,0.00001679711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002488832,0.00035848108,0.00033395083,0.0001653676,0.00021670827,0.00035081146,0.00046320877,0.00047046726,0.0005946811],"category_scores_gemma":[0.00092410244,0.00012685033,0.00013187261,0.00023948721,0.0005449083,0.0007525087,0.00069304515,0.0003603088,0.00014233316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007974538,0.00017841159,0.0018514056,0.00045533024,0.000081670165,0.0006664882,0.00027904555,0.28297773,0.36306927,0.08636282,0.00238843,0.26089194],"study_design_scores_gemma":[0.000044492095,0.0002632458,0.00034920961,0.000012481311,0.000016524962,0.00028414352,0.000020420164,0.958675,0.031015255,0.007228191,0.0020613165,0.00002970108],"about_ca_topic_score_codex":0.00047064875,"about_ca_topic_score_gemma":0.00063520635,"teacher_disagreement_score":0.0005946811,"about_ca_system_score_codex":0.00022859318,"about_ca_system_score_gemma":0.00025321625,"threshold_uncertainty_score":0.0019893646},"labels":[],"label_agreement":null},{"id":"W1966570068","doi":"10.1109/camsap.2011.6136001","title":"Reconstruction of a Generalized Joint Sparsity Model using Principal Component Analysis","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Principal component analysis; Joint (building); Component (thermodynamics); Subspace topology; Compressed sensing; Computer science; Pattern recognition (psychology); SIGNAL (programming language); Signal reconstruction; Artificial intelligence; Independent component analysis; Minimum description length; Functional principal component analysis; Algorithm; Sparse approximation; Signal processing; Engineering; Telecommunications","score_opus":0.10901315277684562,"score_gpt":0.24198113658566214,"score_spread":0.13296798380881653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966570068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00940098,0.00006405142,0.9898782,0.00010949533,0.000014556349,0.000007469878,0.000043792894,0.00006561346,0.00041583707],"genre_scores_gemma":[0.56514484,0.00075354136,0.42840806,0.00021126245,0.00012838595,0.00012609344,0.00058904797,0.00011711377,0.004521663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992539,0.0002591007,0.000024536295,0.00017284832,0.00022765683,0.00006189154],"domain_scores_gemma":[0.99926096,0.00029276643,0.00011509288,0.00017114397,0.00012849938,0.00003146485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010161109,0.00061035785,0.00086392387,0.0005615523,0.00022213408,0.0008880571,0.00092568464,0.0008436365,0.0007962711],"category_scores_gemma":[0.0020912576,0.00041604132,0.0007603879,0.0008291072,0.000977404,0.0016721181,0.00087851065,0.0012071633,0.00031452818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106771426,0.000044254706,0.0010432041,0.00009997825,0.00008258048,0.00018951164,0.000119015065,0.8444924,0.011983845,0.08356903,0.0015925815,0.05667696],"study_design_scores_gemma":[0.000004267773,0.000015570322,0.0001298551,0.0000029800708,0.0000046652863,0.00003502447,0.00000871645,0.9880384,0.0005456283,0.01077269,0.00043528716,0.0000070281794],"about_ca_topic_score_codex":0.0021717118,"about_ca_topic_score_gemma":0.0020595824,"teacher_disagreement_score":0.0021717118,"about_ca_system_score_codex":0.00042301242,"about_ca_system_score_gemma":0.0007220608,"threshold_uncertainty_score":0.005373776},"labels":[],"label_agreement":null},{"id":"W1967018744","doi":"10.1109/icmla.2012.79","title":"Supervised Dictionary Learning via Non-negative Matrix Factorization for Classification","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Matrix decomposition; Artificial intelligence; Neural coding; Sparse approximation; K-SVD; Pattern recognition (psychology); Dictionary learning; Regularization (linguistics); Machine learning; Non-negative matrix factorization; Computation; Sparse matrix; Algorithm","score_opus":0.024333192010479645,"score_gpt":0.2625732286917468,"score_spread":0.23824003668126717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967018744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038064325,0.00026817914,0.994773,0.00012596844,0.000036390586,0.0000231665,0.000054277796,0.00039037885,0.00052216894],"genre_scores_gemma":[0.17360938,0.00089785777,0.82081896,0.0002178284,0.0002447976,0.00021082551,0.0009401329,0.00010135721,0.0029588307],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895537,0.00035963603,0.000049805272,0.00020744145,0.00036135328,0.00006643335],"domain_scores_gemma":[0.9983064,0.00086339575,0.00017424191,0.000293409,0.0003169547,0.000045628178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011014579,0.00073989935,0.0011612169,0.0010766345,0.00041409404,0.0006255392,0.00092828186,0.0009806172,0.0014369251],"category_scores_gemma":[0.0045420914,0.00030251476,0.00061035954,0.0015429034,0.0007226604,0.0012039916,0.0007741783,0.0015123183,0.000996237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001850775,0.00016410006,0.00083885883,0.00025108768,0.000072725124,0.000088133136,0.00013761994,0.19365998,0.016897328,0.0364413,0.013728316,0.7375355],"study_design_scores_gemma":[0.000011278037,0.000034951474,0.00013925886,0.0000069819803,0.000005542809,0.000038347283,0.000012029957,0.9856399,0.002193859,0.010079412,0.001831322,0.0000071183636],"about_ca_topic_score_codex":0.0020291517,"about_ca_topic_score_gemma":0.0029231454,"teacher_disagreement_score":0.0020291517,"about_ca_system_score_codex":0.00045547154,"about_ca_system_score_gemma":0.00086382806,"threshold_uncertainty_score":0.005825162},"labels":[],"label_agreement":null},{"id":"W1967734985","doi":"10.1109/tip.2012.2202672","title":"$\\ell_{2}$ Restoration of $\\ell_{\\infty}$-Decoded Images Via Soft-Decision Estimation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Notation; Coding (social sciences); Algorithm; Mathematics; Computer science; Discrete mathematics; Artificial intelligence; Statistics; Arithmetic","score_opus":0.014663219252223208,"score_gpt":0.259912541784106,"score_spread":0.24524932253188278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967734985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02879164,0.00012843982,0.9687783,0.00017130676,0.000032681375,0.00001666618,0.000045653473,0.00033302623,0.0017022858],"genre_scores_gemma":[0.44748932,0.00030130005,0.54697996,0.00025498922,0.00005719478,0.000044412864,0.0002063183,0.00015716098,0.004509418],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945074,0.00012384637,0.000031813444,0.00008146347,0.00026696836,0.00004510052],"domain_scores_gemma":[0.99908864,0.00037056548,0.00015853748,0.0001861615,0.00015646797,0.00003958719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006916368,0.00076194457,0.0006601832,0.00038695175,0.00024142147,0.001015417,0.00070332503,0.0006725377,0.0017720914],"category_scores_gemma":[0.0033669246,0.00025948707,0.0003817653,0.00029201581,0.0007794511,0.0010760009,0.0011897434,0.001152577,0.00068150845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008961015,0.00016890136,0.0010058546,0.00024444785,0.00006566055,0.00037101874,0.00021564074,0.24791688,0.18194905,0.048566587,0.003030992,0.51556885],"study_design_scores_gemma":[0.00001466159,0.00007850131,0.00029503772,0.00002345643,0.000012283054,0.00016415137,0.000025445666,0.9213998,0.06735444,0.009283496,0.001318049,0.00003072599],"about_ca_topic_score_codex":0.001227619,"about_ca_topic_score_gemma":0.0019712462,"teacher_disagreement_score":0.0017720914,"about_ca_system_score_codex":0.000412719,"about_ca_system_score_gemma":0.0009036943,"threshold_uncertainty_score":0.005928278},"labels":[],"label_agreement":null},{"id":"W1970602297","doi":"10.1109/vcip.2012.6410815","title":"Classification based on sparse representation and Euclidian distance","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Sparse approximation; Pattern recognition (psychology); Euclidean distance; Computer science; Representation (politics); Artificial intelligence; K-SVD; Class (philosophy); Contextual image classification; Support vector machine; Image (mathematics)","score_opus":0.04291778904630087,"score_gpt":0.2676781102710029,"score_spread":0.22476032122470205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970602297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005786602,0.00027346404,0.9926502,0.00011851337,0.00004964128,0.000032718894,0.00003570491,0.00022638732,0.0008267423],"genre_scores_gemma":[0.2034657,0.00093901803,0.79176307,0.00019070144,0.00024238296,0.0001519897,0.00050046324,0.00007707908,0.0026696667],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985782,0.0003088682,0.000084328494,0.0002998053,0.00063412945,0.00009472821],"domain_scores_gemma":[0.9983725,0.0006257529,0.00021753841,0.00020416052,0.0005255724,0.000054514112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010922623,0.0005957746,0.00120835,0.0019253128,0.0004048966,0.0011861806,0.0011815554,0.0011088162,0.0013013162],"category_scores_gemma":[0.003793284,0.00026864084,0.00062829605,0.0018549557,0.00075710856,0.0018673029,0.00095155556,0.0011219622,0.0008574316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020927282,0.00012979208,0.0016024393,0.00025932572,0.00008711743,0.00012917405,0.0001833641,0.08138672,0.026627898,0.04115251,0.0065992796,0.84163296],"study_design_scores_gemma":[0.000016011385,0.00012956593,0.00076865527,0.000026224941,0.00002349267,0.00029775462,0.00005398918,0.9749579,0.008277488,0.011559716,0.0038588855,0.000030389974],"about_ca_topic_score_codex":0.0013244017,"about_ca_topic_score_gemma":0.0011655393,"teacher_disagreement_score":0.0019253128,"about_ca_system_score_codex":0.0004686353,"about_ca_system_score_gemma":0.00062907086,"threshold_uncertainty_score":0.005776465},"labels":[],"label_agreement":null},{"id":"W1970814699","doi":"10.1137/110851377","title":"Sparse Orthogonal Linear Discriminant Analysis","year":2012,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Orthogonality; Mathematics; Linear discriminant analysis; Linear map; Norm (philosophy); Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Geometry; Statistics","score_opus":0.03527926915868062,"score_gpt":0.2803144904155625,"score_spread":0.24503522125688187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970814699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011101125,0.0006359765,0.9856969,0.00025610905,0.00010505203,0.000035859262,0.00011365204,0.00021167206,0.0018435947],"genre_scores_gemma":[0.41605335,0.001861488,0.5720848,0.00039644176,0.00058565824,0.00021477566,0.0010436367,0.0001749661,0.007584874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986076,0.0004995381,0.00006631788,0.00030266456,0.00041724692,0.00010673944],"domain_scores_gemma":[0.99826616,0.0007059027,0.00020250863,0.000302678,0.00045985577,0.00006297726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017682826,0.0009390595,0.001135688,0.0012218964,0.00048526638,0.0013258783,0.00088978786,0.00075128593,0.0021299901],"category_scores_gemma":[0.005869344,0.00029920728,0.0006399564,0.0014597533,0.00090093707,0.001584151,0.0014707407,0.0014118474,0.001517268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023182068,0.00017927286,0.0030117903,0.00037042407,0.00013419133,0.00019010509,0.00017788554,0.17305547,0.026015295,0.11778441,0.009721618,0.66912764],"study_design_scores_gemma":[0.000013542254,0.000090213834,0.0007113613,0.000032026142,0.000024072522,0.00017580984,0.000054143347,0.94195557,0.0056834924,0.043144878,0.008084427,0.000030380705],"about_ca_topic_score_codex":0.0008300585,"about_ca_topic_score_gemma":0.0006974393,"teacher_disagreement_score":0.0021299901,"about_ca_system_score_codex":0.000364238,"about_ca_system_score_gemma":0.000828456,"threshold_uncertainty_score":0.009351671},"labels":[],"label_agreement":null},{"id":"W1971129258","doi":"10.1504/ijsnet.2011.040237","title":"Increasing energy efficiency in sensor networks: blue noise sampling and non-convex matrix completion","year":2011,"lang":"en","type":"article","venue":"International Journal of Sensor Networks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Computer science; Sampling (signal processing); Wireless sensor network; Sample (material); Matrix (chemical analysis); Energy (signal processing); Convex optimization; Algorithm; Noise (video); Mathematical optimization; Grid; Regular polygon; Mathematics; Statistics; Artificial intelligence; Telecommunications; Computer network","score_opus":0.0191477104144557,"score_gpt":0.24498698259566634,"score_spread":0.22583927218121064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971129258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022504348,0.0005993063,0.9749228,0.00051319256,0.000026055406,0.00003260111,0.000032170756,0.00013606904,0.0012334447],"genre_scores_gemma":[0.7238219,0.0013269573,0.27156776,0.00020937684,0.00015397517,0.00012359516,0.00015626976,0.00011533857,0.002524811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982615,0.0010013673,0.00004507178,0.00016342619,0.0004318088,0.00009680215],"domain_scores_gemma":[0.99501234,0.0035833097,0.00031587514,0.0006049872,0.00039258844,0.0000908783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026594389,0.00077237916,0.00095280795,0.0005818831,0.00033514813,0.0006983581,0.0009245058,0.0008282086,0.00080967025],"category_scores_gemma":[0.009948416,0.00038823206,0.00045411044,0.0010706455,0.001497893,0.0020202894,0.0012537566,0.0011181553,0.00019794908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028146128,0.000114795796,0.0007122088,0.00013238772,0.000043600456,0.00008118053,0.0001012069,0.8742755,0.0044356915,0.043972585,0.0015421144,0.07430728],"study_design_scores_gemma":[0.000013470917,0.000041053252,0.00013932577,0.0000049740875,0.0000042976994,0.000029603943,0.00001489233,0.9832681,0.0012611366,0.014900067,0.00031783318,0.00000519525],"about_ca_topic_score_codex":0.0015417997,"about_ca_topic_score_gemma":0.0016505246,"teacher_disagreement_score":0.0026594389,"about_ca_system_score_codex":0.00069950183,"about_ca_system_score_gemma":0.0007104012,"threshold_uncertainty_score":0.01406461},"labels":[],"label_agreement":null},{"id":"W1972021676","doi":"10.1016/j.mri.2011.09.014","title":"Nuclear norm-regularized SENSE reconstruction","year":2011,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Sense (electronics); Matrix norm; Exploit; Iterative reconstruction; Norm (philosophy); Computer science; Wavelet; Compressed sensing; Algorithm; Artificial intelligence; Mathematics; Computer vision; Physics","score_opus":0.01098286350068991,"score_gpt":0.17893375416354332,"score_spread":0.1679508906628534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972021676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002832334,0.00011343904,0.9955656,0.00021074712,0.000035050503,0.000010998879,0.00005818412,0.00008387292,0.0010898351],"genre_scores_gemma":[0.21312182,0.0010819787,0.7762141,0.00034333093,0.00019861662,0.00011705601,0.0007162387,0.00015346555,0.0080534145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994236,0.00022129597,0.00002799713,0.00010984519,0.0001897003,0.000027645261],"domain_scores_gemma":[0.9988562,0.0004903014,0.00013235972,0.00022042786,0.0002461256,0.000054520966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012577472,0.0008351185,0.0009007208,0.0005213413,0.0002560782,0.0010034044,0.00084974914,0.0012060744,0.0017659074],"category_scores_gemma":[0.004984932,0.0004356536,0.00047336606,0.00075722544,0.0013204695,0.0013732899,0.0012609048,0.001242221,0.0009115175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003932628,0.00012716089,0.00082798104,0.00041656473,0.00013027106,0.000186257,0.00021879606,0.44702178,0.021623785,0.22110102,0.01242332,0.29552978],"study_design_scores_gemma":[0.000017436729,0.000045053603,0.00014541164,0.000016036925,0.000013758811,0.00012511967,0.000026539527,0.95014983,0.0038727398,0.042376447,0.0031941452,0.000017526456],"about_ca_topic_score_codex":0.0010702453,"about_ca_topic_score_gemma":0.0013710369,"teacher_disagreement_score":0.0017659074,"about_ca_system_score_codex":0.00028093375,"about_ca_system_score_gemma":0.0010558642,"threshold_uncertainty_score":0.0066516995},"labels":[],"label_agreement":null},{"id":"W1972380563","doi":"10.1117/12.2062135","title":"Reconstruction of compressive multispectral sensing data using a multilayered conditional random field approach","year":2014,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Multispectral image; Computer science; Nyquist rate; Iterative reconstruction; Data acquisition; Signal reconstruction; Conditional random field; Reconstruction algorithm; Algorithm; Artificial intelligence; Computer vision; Sampling (signal processing); Signal processing","score_opus":0.024333518472103893,"score_gpt":0.24534990402030973,"score_spread":0.22101638554820585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972380563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012029405,0.00007222124,0.98728406,0.0000851501,0.000008616167,0.000016386719,0.00006338738,0.0001587066,0.00028204606],"genre_scores_gemma":[0.51415163,0.0003177397,0.48338437,0.000102783095,0.000045215267,0.00008733826,0.0003838395,0.00006474936,0.0014622802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995753,0.00012525255,0.000025179297,0.00008874192,0.0001427046,0.000042811902],"domain_scores_gemma":[0.9984503,0.00091960345,0.00018976566,0.00016264351,0.00022160079,0.000056090823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893831,0.00053334096,0.0005355789,0.00055803644,0.00020048795,0.000588657,0.0007216051,0.0007849909,0.0010683994],"category_scores_gemma":[0.003438934,0.00038852566,0.00074365607,0.0004844021,0.00056842744,0.0010002862,0.0006429183,0.00097335916,0.00019738986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013586397,0.00003887534,0.0010124376,0.000090144764,0.00004138799,0.000112243164,0.000073490424,0.92121947,0.011506279,0.016490653,0.0006458393,0.04863332],"study_design_scores_gemma":[0.0000028278548,0.00001342227,0.00015365356,0.0000032431935,0.0000030562755,0.000022325641,0.0000030714518,0.9970283,0.0010811863,0.001522078,0.00015907898,0.000007799987],"about_ca_topic_score_codex":0.006073261,"about_ca_topic_score_gemma":0.005747216,"teacher_disagreement_score":0.006073261,"about_ca_system_score_codex":0.000666019,"about_ca_system_score_gemma":0.0008563057,"threshold_uncertainty_score":0.012075841},"labels":[],"label_agreement":null},{"id":"W1974827554","doi":"10.1109/iscas.2012.6271895","title":"Reconstruction of compressively sensed complex-valued terahertz data","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Commonwealth Scientific and Industrial Research Organisation","keywords":"Terahertz radiation; Iterative reconstruction; Curvelet; Computer science; Compressed sensing; Signal reconstruction; Algorithm; Reconstruction algorithm; Artificial intelligence; Signal processing; Wavelet; Wavelet transform; Optics; Physics; Telecommunications","score_opus":0.09748541885441932,"score_gpt":0.281719431494713,"score_spread":0.1842340126402937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974827554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06954748,0.00025021605,0.9276061,0.0003281828,0.000094409166,0.000031594893,0.00021551836,0.00023703472,0.0016894651],"genre_scores_gemma":[0.52360487,0.0010655872,0.47108912,0.00017613547,0.00013659353,0.00007045953,0.0007015247,0.00008715256,0.0030685265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967563,0.000065104985,0.000020754222,0.000058696416,0.00015248536,0.000027256074],"domain_scores_gemma":[0.9991781,0.00036981577,0.00011227044,0.00018457472,0.00012841301,0.000026789043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005621532,0.0005920037,0.00072358525,0.00055372366,0.00019863085,0.00059042784,0.00049594184,0.00078160065,0.0011506107],"category_scores_gemma":[0.0022503147,0.0002462831,0.00036949734,0.0007571378,0.0007632835,0.0010800955,0.0007901588,0.00088829064,0.00038998993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006911884,0.0001722944,0.0020407704,0.00057026284,0.00008593644,0.0009413318,0.00040178793,0.36595967,0.3446799,0.06590412,0.0029165328,0.2156363],"study_design_scores_gemma":[0.000025946316,0.00010381099,0.0008085283,0.000025335698,0.000014607,0.0006073943,0.0001042869,0.89740247,0.08423359,0.013521217,0.0031153967,0.0000373726],"about_ca_topic_score_codex":0.0003772421,"about_ca_topic_score_gemma":0.0003147826,"teacher_disagreement_score":0.0011506107,"about_ca_system_score_codex":0.00019767803,"about_ca_system_score_gemma":0.00037986046,"threshold_uncertainty_score":0.0038491488},"labels":[],"label_agreement":null},{"id":"W1975596825","doi":"10.1016/j.crma.2005.04.032","title":"Reconstruction and subgaussian processes","year":2005,"lang":"en","type":"article","venue":"Comptes Rendus Mathématique","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009363847357934427,"score_gpt":0.205285988179698,"score_spread":0.19592214082176357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975596825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008753044,0.000612804,0.98593915,0.00060197525,0.00011114627,0.000026960908,0.00017331661,0.00050528115,0.0032763288],"genre_scores_gemma":[0.42211235,0.0021477155,0.5407329,0.00084222463,0.00046638204,0.00024369123,0.0015001681,0.0005398483,0.03141466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814856,0.0006787836,0.000084955755,0.0003661827,0.0004952317,0.00022633144],"domain_scores_gemma":[0.99599624,0.0022935933,0.00029207693,0.00075607345,0.00046216298,0.00019989656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00281519,0.0010212604,0.0014943506,0.0016315224,0.0007533051,0.0021937443,0.0016329677,0.001964479,0.006678174],"category_scores_gemma":[0.012747552,0.00076645677,0.0017325355,0.0015262077,0.002569466,0.0035549372,0.0033270118,0.0033028855,0.0022505063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005312572,0.00007600239,0.0018273448,0.00021097064,0.00011438825,0.00014083339,0.00021928857,0.26829425,0.0025079346,0.5911988,0.008838598,0.12604032],"study_design_scores_gemma":[0.000036843223,0.000033098637,0.00019855697,0.000025987993,0.000014966892,0.000063035804,0.000032083728,0.85431546,0.0017053667,0.14015193,0.0034016233,0.000021071864],"about_ca_topic_score_codex":0.00584114,"about_ca_topic_score_gemma":0.004848798,"teacher_disagreement_score":0.006678174,"about_ca_system_score_codex":0.0021134918,"about_ca_system_score_gemma":0.0018328348,"threshold_uncertainty_score":0.022340655},"labels":[],"label_agreement":null},{"id":"W1975977244","doi":"10.4043/25067-ms","title":"Increasing the Efficiency of Seismic Data Acquisition via Compressive Sensing","year":2014,"lang":"en","type":"article","venue":"Offshore Technology Conference-Asia","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"ConocoPhillips","keywords":"Compressed sensing; Computer science; Sampling (signal processing); Coherence (philosophical gambling strategy); Nyquist–Shannon sampling theorem; Field (mathematics); Data acquisition; Computer engineering; Algorithm; Statistics; Telecommunications; Mathematics; Computer vision","score_opus":0.02044501412010832,"score_gpt":0.23822754965519718,"score_spread":0.21778253553508886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975977244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029341847,0.0001424276,0.9674384,0.00021285459,0.000012821541,0.000049219314,0.000057946596,0.0004794968,0.0022650247],"genre_scores_gemma":[0.4109499,0.00025762178,0.58727807,0.00011334857,0.00002985595,0.0001313097,0.00013692045,0.00009315746,0.0010098434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984567,0.00053264754,0.00009499911,0.00018096635,0.0006567964,0.00007794564],"domain_scores_gemma":[0.9948791,0.0032629273,0.00047089884,0.00077461964,0.0005426607,0.00006968848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673844,0.0006321552,0.00050528266,0.00066256826,0.0002620731,0.000637942,0.0006095164,0.0005955075,0.0015948656],"category_scores_gemma":[0.008212738,0.0003551419,0.00028868846,0.0007671542,0.00074928824,0.0013604603,0.001037949,0.00079196383,0.0006531713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066094147,0.00020084583,0.0029080762,0.0003259516,0.000066148285,0.00012901919,0.00026196108,0.35696003,0.15458739,0.025961164,0.001598617,0.4563399],"study_design_scores_gemma":[0.000051465824,0.00030329314,0.0011490594,0.00003647038,0.000017403567,0.00012796138,0.00005582142,0.91561764,0.06797888,0.010472758,0.004157143,0.000032047563],"about_ca_topic_score_codex":0.000961873,"about_ca_topic_score_gemma":0.0014516996,"teacher_disagreement_score":0.001673844,"about_ca_system_score_codex":0.0005080008,"about_ca_system_score_gemma":0.0007006647,"threshold_uncertainty_score":0.008852243},"labels":[],"label_agreement":null},{"id":"W1976064797","doi":"10.1007/s11548-013-0938-z","title":"MR image reconstruction based on framelets and nonlocal total variation using split Bregman method","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Assisted Radiology and Surgery","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal University Hospital; University of Saskatchewan","funders":"Government of Canada","keywords":"Compressed sensing; Algorithm; Computational complexity theory; Computer science; Mathematics; Regularization (linguistics); Mutual coherence; Visualization; Image (mathematics); Total variation denoising; Iterative reconstruction; Artificial intelligence; Coherence (philosophical gambling strategy)","score_opus":0.013153075008152274,"score_gpt":0.24724549207516083,"score_spread":0.23409241706700856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976064797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006841765,0.000121989855,0.99252385,0.00007615562,0.000022919903,0.0000115569455,0.000022776525,0.00008011109,0.00029890923],"genre_scores_gemma":[0.092271835,0.00049735856,0.90533817,0.00008111791,0.000051430558,0.00005231356,0.00015596615,0.00008347518,0.0014683809],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960274,0.0001287518,0.000021555092,0.000057836725,0.00016310664,0.000026026353],"domain_scores_gemma":[0.9993375,0.00026945284,0.00008973692,0.00010050346,0.00016137834,0.000041350475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921144,0.00073602085,0.00094227516,0.0008383336,0.00030757734,0.00072620687,0.0008242477,0.0011993027,0.0010419367],"category_scores_gemma":[0.0022639171,0.0005504004,0.00075110764,0.0009655825,0.0004951738,0.0012375071,0.0009442834,0.0011976412,0.00045623913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006347862,0.00016166783,0.00149888,0.00043253662,0.00021771596,0.0004639985,0.00034026522,0.32060212,0.12097216,0.059957106,0.004447151,0.4902716],"study_design_scores_gemma":[0.0000106054995,0.000048631908,0.00024035004,0.00000984183,0.000018302984,0.00016610991,0.000010410264,0.9880923,0.0070266975,0.0032778273,0.0010797443,0.00001912649],"about_ca_topic_score_codex":0.0013882363,"about_ca_topic_score_gemma":0.0017136054,"teacher_disagreement_score":0.0013882363,"about_ca_system_score_codex":0.0002416059,"about_ca_system_score_gemma":0.00086793175,"threshold_uncertainty_score":0.0041891336},"labels":[],"label_agreement":null},{"id":"W1976603814","doi":"10.1109/acssc.2012.6489374","title":"2D signal compression via parallel compressed sensing with permutations","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Permutation (music); Compression ratio; Zigzag; Algorithm; Computer science; Vectorization (mathematics); SIGNAL (programming language); Compression (physics); Data compression; Compressed sensing; Matrix (chemical analysis); Signal-to-noise ratio (imaging); Upper and lower bounds; Block (permutation group theory); Signal compression; Mathematics; Parallel computing; Computer vision; Combinatorics; Image (mathematics); Image processing; Telecommunications; Physics","score_opus":0.01695018483292225,"score_gpt":0.22707341142990667,"score_spread":0.21012322659698443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976603814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04056694,0.00033203635,0.9542351,0.0003027114,0.00009384326,0.00010247497,0.00009668486,0.00050536095,0.00376488],"genre_scores_gemma":[0.47074455,0.000526585,0.5244103,0.00031078735,0.00014992106,0.00018826383,0.00026401095,0.00006671818,0.003338871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992374,0.00019022888,0.000045115066,0.000112087626,0.0003575131,0.000057685334],"domain_scores_gemma":[0.99927694,0.00027540704,0.0000931678,0.00024078286,0.00008988153,0.000023735944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045780116,0.0007595157,0.0006114624,0.0007296104,0.00042758556,0.00059074024,0.0006426368,0.00063667796,0.0013340522],"category_scores_gemma":[0.0016501537,0.00032690947,0.0003902819,0.001002534,0.000791412,0.0013788011,0.0010278823,0.0006581662,0.00038903437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001097911,0.00020569496,0.0015342261,0.00024043271,0.0000988365,0.0006878859,0.00025675338,0.22285141,0.16540518,0.08142092,0.002751583,0.5234491],"study_design_scores_gemma":[0.00008869779,0.0004478535,0.00054459675,0.00002901505,0.000030107874,0.00096031977,0.000047646005,0.8805893,0.086370386,0.022393957,0.008422658,0.00007551605],"about_ca_topic_score_codex":0.0009109948,"about_ca_topic_score_gemma":0.0011859547,"teacher_disagreement_score":0.0013340522,"about_ca_system_score_codex":0.00030690216,"about_ca_system_score_gemma":0.0004937666,"threshold_uncertainty_score":0.004462838},"labels":[],"label_agreement":null},{"id":"W1977159052","doi":"10.1016/j.physleta.2012.10.018","title":"Exact Fourier spectrum recovery","year":2012,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Discrete Fourier transform (general); Discrete-time Fourier transform; Non-uniform discrete Fourier transform; Fourier transform; Algorithm; Spectrum (functional analysis); Discrete Fourier series; Fourier analysis; SIGNAL (programming language); Spectral density estimation; Sampling (signal processing); Signal processing; Frequency spectrum; Multidimensional signal processing; Noise (video); Short-time Fourier transform; Fractional Fourier transform; Computer science; Mathematics; Mathematical analysis; Physics; Spectral density; Telecommunications; Artificial intelligence","score_opus":0.014002153130693005,"score_gpt":0.20867532142872913,"score_spread":0.19467316829803613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977159052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010952526,0.00046859297,0.97240824,0.00065252144,0.00024048609,0.000028360286,0.00022658161,0.00032477063,0.014697838],"genre_scores_gemma":[0.4016075,0.0015971524,0.5521589,0.000599784,0.00049398356,0.00008650385,0.0010322494,0.00032237728,0.0421016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995048,0.00009476557,0.000026474134,0.000102654696,0.00022663746,0.00004466175],"domain_scores_gemma":[0.9993175,0.00018925931,0.000055027464,0.00028507566,0.0001236263,0.000029470655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005911884,0.0007750228,0.00069406966,0.0007745019,0.0003420351,0.0010522743,0.0005623378,0.0011561492,0.0072651575],"category_scores_gemma":[0.0033095586,0.0003766154,0.00039489957,0.00086886855,0.0011010509,0.0025769437,0.0016547849,0.0014705769,0.0025528665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030327495,0.00010601009,0.0005344742,0.00024404377,0.000075172415,0.00020938189,0.00012667483,0.088317074,0.028490916,0.4700807,0.014863617,0.39664882],"study_design_scores_gemma":[0.000034687288,0.000044793494,0.0005308787,0.000044420158,0.000021758438,0.0005502153,0.00005902268,0.70503277,0.019032288,0.26225966,0.012350159,0.000039351977],"about_ca_topic_score_codex":0.00061091426,"about_ca_topic_score_gemma":0.00077759346,"teacher_disagreement_score":0.0072651575,"about_ca_system_score_codex":0.00027686366,"about_ca_system_score_gemma":0.00068402436,"threshold_uncertainty_score":0.02430433},"labels":[],"label_agreement":null},{"id":"W1977794869","doi":"10.3390/s130404961","title":"Compressive Sensing Image Sensors-Hardware Implementation","year":2013,"lang":"en","type":"article","venue":"Sensors","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; CMC Microsystems","keywords":"Compressed sensing; Computer science; Image sensor; CMOS; Computer hardware; Implementation; Coding (social sciences); Chip; Encoding (memory); Data acquisition; Electronic engineering; Artificial intelligence; Engineering; Telecommunications","score_opus":0.011671316095405204,"score_gpt":0.251402855512459,"score_spread":0.2397315394170538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977794869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006452229,0.0014687417,0.97348166,0.00051176565,0.0001716578,0.00016406826,0.0001280859,0.001455142,0.01616671],"genre_scores_gemma":[0.23992884,0.0027973522,0.74566555,0.0005063527,0.00028307003,0.00033363124,0.00033849254,0.00008438898,0.010062266],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995498,0.000072673094,0.000022862194,0.00006164722,0.00026020716,0.000032753112],"domain_scores_gemma":[0.99974936,0.00007904881,0.000017853508,0.00004601669,0.00009599761,0.0000117841655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029997018,0.0005135522,0.00035969686,0.00032951127,0.00020397216,0.0006875087,0.0008971752,0.00069558405,0.0058942693],"category_scores_gemma":[0.0010123479,0.00022476907,0.00023411216,0.00035646156,0.00029882498,0.00076147425,0.00054513296,0.0007126222,0.0025163624],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025102036,0.00014412083,0.000741112,0.0008842711,0.00006899927,0.00024071403,0.00012879714,0.06725451,0.15895428,0.094982184,0.013019978,0.66332996],"study_design_scores_gemma":[0.00008573211,0.0007103156,0.000844741,0.00021637158,0.00006210257,0.001323333,0.00009538548,0.67832243,0.17956582,0.026145678,0.11255209,0.00007601879],"about_ca_topic_score_codex":0.0006238401,"about_ca_topic_score_gemma":0.0007988441,"teacher_disagreement_score":0.0058942693,"about_ca_system_score_codex":0.00031572726,"about_ca_system_score_gemma":0.00049846363,"threshold_uncertainty_score":0.01971829},"labels":[],"label_agreement":null},{"id":"W1978258815","doi":"10.1002/dac.684","title":"GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Computer science; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Shortest Path Faster Algorithm; Yen's algorithm; Algorithm; Mathematical optimization; Path (computing); Average path length; Convergence (economics); Routing (electronic design automation); Link-state routing protocol; Dijkstra's algorithm; Routing protocol; Mathematics; Theoretical computer science; Computer network; Graph","score_opus":0.026305594186888707,"score_gpt":0.273776655301145,"score_spread":0.24747106111425626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978258815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060485816,0.00011768236,0.9928088,0.00009074608,0.000035024183,0.000029206145,0.000021753149,0.0003270785,0.0005210947],"genre_scores_gemma":[0.23049861,0.00031337005,0.7658866,0.00017883995,0.00009290145,0.00023217424,0.00021992906,0.00012964387,0.002447947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.000158546,0.00002943931,0.0001140275,0.0002015795,0.000056682533],"domain_scores_gemma":[0.9993266,0.0003204353,0.00008598611,0.00007800253,0.00014077139,0.000048118884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095565314,0.0006432373,0.00087002164,0.00072498916,0.00047890877,0.0009321443,0.0016186436,0.0013087335,0.0014227418],"category_scores_gemma":[0.0028952758,0.0003545124,0.0005115043,0.0009647309,0.00086141395,0.0014585146,0.0015812335,0.0012256154,0.0004832324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012964898,0.00004318442,0.00045447296,0.00007740388,0.000056031065,0.0000716058,0.000096121454,0.75510746,0.0056623924,0.023808833,0.003448136,0.21104468],"study_design_scores_gemma":[0.000014738596,0.000024935496,0.00003581423,0.0000028833292,0.0000035822818,0.000018436464,0.000005211886,0.9938698,0.0004174968,0.0046413206,0.0009619869,0.0000039288702],"about_ca_topic_score_codex":0.0031574504,"about_ca_topic_score_gemma":0.0022884726,"teacher_disagreement_score":0.0031574504,"about_ca_system_score_codex":0.0005803704,"about_ca_system_score_gemma":0.0011979418,"threshold_uncertainty_score":0.0062780976},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W1978360634","doi":"10.1109/jetcas.2012.2212774","title":"Algorithms to Approximately Solve NP Hard Row-Sparse MMV Recovery Problem: Application to Compressive Color Imaging","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Emerging and Selected Topics in Circuits and Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Algorithm; Nondeterministic algorithm; Sparse approximation; Convex optimization; Mathematical optimization; Regular polygon; Computational complexity theory; Computer science; Optimization problem; Row; Mathematics","score_opus":0.023618238405197375,"score_gpt":0.2552226654830735,"score_spread":0.2316044270778761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978360634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024157972,0.00014688206,0.99539715,0.00032385765,0.000022083961,0.00004998254,0.000043853994,0.00030973318,0.0012905815],"genre_scores_gemma":[0.13375492,0.0005518895,0.8615996,0.00027284917,0.00012630147,0.00047328425,0.00031033644,0.00022462377,0.0026861867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922585,0.00027111976,0.000039369574,0.00014757292,0.0002231781,0.000092760456],"domain_scores_gemma":[0.9946556,0.0040819817,0.0003523778,0.00037193848,0.00043723683,0.00010084533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438367,0.001257271,0.001115664,0.0006784254,0.0006452107,0.0012400771,0.0012655732,0.0016906962,0.0052987775],"category_scores_gemma":[0.008296932,0.000510051,0.000703265,0.001020352,0.000853277,0.0016956168,0.0015446248,0.003013896,0.001075429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014829884,0.00020158215,0.00053279067,0.0002630454,0.000045653363,0.00009760807,0.00011925491,0.7581346,0.003153566,0.04266739,0.007131873,0.18750429],"study_design_scores_gemma":[0.000021988393,0.000022714697,0.00005129113,0.000008998564,0.0000045375486,0.000030287778,0.00002234881,0.9822568,0.0007618582,0.015905647,0.0009064273,0.0000069939138],"about_ca_topic_score_codex":0.0041316603,"about_ca_topic_score_gemma":0.006863986,"teacher_disagreement_score":0.0052987775,"about_ca_system_score_codex":0.0010125615,"about_ca_system_score_gemma":0.0024557412,"threshold_uncertainty_score":0.017726123},"labels":[],"label_agreement":null},{"id":"W1979180832","doi":"10.1145/1273496.1273544","title":"Bayesian compressive sensing and projection optimization","year":2007,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Foundation for Dietetic Research","keywords":"Compressed sensing; Bayesian optimization; Computer science; Sparse approximation; Basis pursuit; Machine learning; Artificial intelligence; Bayesian probability; Wavelet; Projection (relational algebra); Dimension (graph theory); Point (geometry); SIGNAL (programming language); Bayesian inference; Lasso (programming language); Pattern recognition (psychology); Algorithm; Matching pursuit; Mathematics","score_opus":0.008092897275023435,"score_gpt":0.21786926832108797,"score_spread":0.20977637104606453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979180832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025327588,0.0018775003,0.9862575,0.0014567496,0.00012392162,0.00002086365,0.00007898498,0.00007613034,0.007575612],"genre_scores_gemma":[0.42862067,0.014634154,0.5321167,0.0013819446,0.0016561574,0.00040692734,0.0007080879,0.0001792122,0.02029606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984761,0.0006566459,0.00004824383,0.00022249974,0.00051770173,0.00007890757],"domain_scores_gemma":[0.9977223,0.0015597373,0.00021540071,0.00018172305,0.00023600558,0.00008485552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022630405,0.0008955854,0.0012258347,0.00066777127,0.00048315173,0.001469736,0.0010414192,0.0015069476,0.0029476562],"category_scores_gemma":[0.0071132774,0.00049707585,0.0005413265,0.0010874687,0.0023521998,0.002450959,0.002078455,0.0024280273,0.00073211844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048744067,0.000028721859,0.00032800474,0.00019539527,0.0000418206,0.000097366275,0.00009767076,0.13083799,0.0012487534,0.8131923,0.0043726563,0.049510673],"study_design_scores_gemma":[0.000023208937,0.000035769768,0.000256005,0.000056990266,0.000010530905,0.00010273177,0.00003293613,0.4131398,0.00060771784,0.5769259,0.00878324,0.000025190755],"about_ca_topic_score_codex":0.002223391,"about_ca_topic_score_gemma":0.0017953345,"teacher_disagreement_score":0.0029476562,"about_ca_system_score_codex":0.0009370807,"about_ca_system_score_gemma":0.001195893,"threshold_uncertainty_score":0.011968255},"labels":[],"label_agreement":null},{"id":"W1980088890","doi":"10.1109/icip.2011.6115699","title":"Hybrid parametric-nonparametric modeling with application to natural image upsampling","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Matrix decomposition; Nonparametric statistics; Parametric statistics; Rank (graph theory); Autoregressive model; Estimator; Computer science; Mathematical optimization; Algorithm; Matrix (chemical analysis); Parametric model; Applied mathematics; Mathematics; Statistics","score_opus":0.019859385932901118,"score_gpt":0.22402360154776482,"score_spread":0.2041642156148637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980088890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020880593,0.00017289129,0.9778958,0.00005823687,0.000010044706,0.000011815301,0.000024879577,0.00014778336,0.0007980023],"genre_scores_gemma":[0.6586892,0.00047543584,0.3381135,0.00005632594,0.000042909975,0.00006650446,0.0001221649,0.00005963423,0.0023743492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997663,0.00008427341,0.000008980406,0.00003981409,0.000082928906,0.000017701614],"domain_scores_gemma":[0.9996425,0.00018813997,0.000048746744,0.000058571455,0.00005157951,0.000010460063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006554148,0.00028503028,0.0004041764,0.00027861714,0.00019243418,0.00038936216,0.0003945976,0.00039538686,0.00052399613],"category_scores_gemma":[0.0012159233,0.00017361299,0.0006203044,0.00040097252,0.0003689971,0.00038350179,0.0005277613,0.00048366532,0.000091317146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009369207,0.00005750498,0.001623691,0.000105807594,0.000051906056,0.0002254393,0.00017426335,0.83952856,0.022262841,0.04137819,0.0005463309,0.09395181],"study_design_scores_gemma":[0.0000010600182,0.000009248399,0.00013180822,0.0000012653275,0.0000024460753,0.00002319351,0.0000042673573,0.99651814,0.0009872277,0.0019550202,0.00036220843,0.0000042198985],"about_ca_topic_score_codex":0.002448555,"about_ca_topic_score_gemma":0.0019133859,"teacher_disagreement_score":0.002448555,"about_ca_system_score_codex":0.0002418613,"about_ca_system_score_gemma":0.0003378797,"threshold_uncertainty_score":0.0048686266},"labels":[],"label_agreement":null},{"id":"W1981028967","doi":"10.1109/lsp.2015.2426654","title":"Compressed Sensing with Non-Gaussian Noise and Partial Support Information","year":2015,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Gaussian noise; Computer science; Noise (video); Compressed sensing; Gaussian; Noise measurement; Artificial intelligence; Noise reduction; Physics; Image (mathematics)","score_opus":0.01373653777517439,"score_gpt":0.20786002746354335,"score_spread":0.19412348968836896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981028967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055256266,0.001416434,0.93784606,0.0017751276,0.00010169411,0.00003479431,0.00031170287,0.00014948807,0.0031085103],"genre_scores_gemma":[0.79260033,0.0031281929,0.19169928,0.0005364103,0.00050447515,0.00018387532,0.0010800337,0.000114642346,0.010152802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895775,0.00033594941,0.000038265534,0.00021873387,0.00033630172,0.000113031776],"domain_scores_gemma":[0.9959692,0.0032294502,0.00031744118,0.0001885617,0.0002095047,0.000085851825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015659365,0.0011407759,0.0010930815,0.0005859989,0.00027151988,0.0011220083,0.0013117316,0.0019527253,0.0012112106],"category_scores_gemma":[0.008432221,0.00045328704,0.0006595524,0.0011984691,0.001736288,0.0020883519,0.0013212948,0.0015751332,0.00035776565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039373775,0.00008158226,0.0010234128,0.00055535114,0.0001087823,0.00056872756,0.00020021721,0.8128468,0.0075195567,0.13746583,0.0025085635,0.036727376],"study_design_scores_gemma":[0.000019064932,0.00003784203,0.00017771768,0.000014883469,0.000011618039,0.000059079022,0.000017359596,0.9743804,0.0012592286,0.023519829,0.0004911672,0.000011882986],"about_ca_topic_score_codex":0.0042826086,"about_ca_topic_score_gemma":0.0028396863,"teacher_disagreement_score":0.0042826086,"about_ca_system_score_codex":0.0006939734,"about_ca_system_score_gemma":0.0008060126,"threshold_uncertainty_score":0.008515358},"labels":[],"label_agreement":null},{"id":"W1981359877","doi":"10.1109/camsap.2013.6714086","title":"Distributed spectrum sensing in cognitive radios via graphical models","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Exploit; Cognitive radio; Computer science; Joint (building); Compressed sensing; Spectrum (functional analysis); Scheme (mathematics); Distributed computing; Wireless; Artificial intelligence; Telecommunications; Computer security; Mathematics","score_opus":0.014922679229400741,"score_gpt":0.2141621510472409,"score_spread":0.19923947181784016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981359877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026728993,0.00045763995,0.96807355,0.0010595972,0.000042674208,0.000030561558,0.00016422424,0.0001969188,0.0032459442],"genre_scores_gemma":[0.9059196,0.0011802472,0.08605227,0.00030260766,0.00012845478,0.0001795908,0.0002529467,0.00006318465,0.005921062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865496,0.00074230816,0.00003322634,0.00020392421,0.00022957813,0.0001360901],"domain_scores_gemma":[0.99520445,0.0035848953,0.0005581852,0.00024063751,0.00024358394,0.00016832884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017961842,0.00094351586,0.0012182565,0.0012333761,0.00054629316,0.0018042112,0.0015554307,0.0015451264,0.0024049308],"category_scores_gemma":[0.007643201,0.0008031881,0.0012676748,0.0011969632,0.0022755035,0.0020866205,0.0017853219,0.0016681269,0.00038528175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000610414,0.000025776548,0.0006723923,0.00005921043,0.000052886007,0.00012569732,0.00013404484,0.7548514,0.0005359953,0.23496008,0.00080652453,0.0077150175],"study_design_scores_gemma":[0.000023026583,0.000014034449,0.000104680264,0.000008687793,0.000009966009,0.000022213486,0.000016655356,0.8924181,0.00007999506,0.106792964,0.00050048175,0.000009230933],"about_ca_topic_score_codex":0.0063895104,"about_ca_topic_score_gemma":0.007883477,"teacher_disagreement_score":0.0063895104,"about_ca_system_score_codex":0.0014593891,"about_ca_system_score_gemma":0.0011035274,"threshold_uncertainty_score":0.012704611},"labels":[],"label_agreement":null},{"id":"W1982839888","doi":"10.1016/j.mri.2011.07.021","title":"Exploiting rank deficiency and transform domain sparsity for MR image reconstruction","year":2011,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund","keywords":"Domain (mathematical analysis); Image (mathematics); Artificial intelligence; Rank (graph theory); Computer vision; Computer science; Pattern recognition (psychology); Mathematics; Combinatorics; Mathematical analysis","score_opus":0.015745572913656893,"score_gpt":0.20461956253960129,"score_spread":0.1888739896259444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982839888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011259299,0.00032406018,0.98699516,0.00035031728,0.00002760144,0.000011920945,0.000045466044,0.00006474908,0.0009215189],"genre_scores_gemma":[0.33224994,0.002037775,0.66093034,0.00022488112,0.0002341317,0.000067524874,0.00027570516,0.00008363303,0.0038961412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996244,0.00014949216,0.000018202945,0.000037776164,0.0001505397,0.000019640864],"domain_scores_gemma":[0.9977702,0.0015469948,0.00019214241,0.00022121258,0.00021209569,0.000057500853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012105866,0.0005423907,0.0005788741,0.00061502354,0.00017206205,0.00068931945,0.0004282827,0.00085823593,0.001262891],"category_scores_gemma":[0.00639855,0.0003507048,0.00030033506,0.000646776,0.001026547,0.0014044986,0.0008214137,0.0010225821,0.00032180786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006030956,0.00015334217,0.0011906434,0.00061850407,0.00009916183,0.00044589874,0.00025128468,0.33016598,0.077006705,0.28389555,0.007047213,0.29852256],"study_design_scores_gemma":[0.000024896024,0.00005989036,0.00018079946,0.000014693221,0.000009767766,0.00021584696,0.00002309955,0.9185972,0.006760977,0.07247627,0.0016198823,0.000016655906],"about_ca_topic_score_codex":0.0006836633,"about_ca_topic_score_gemma":0.00085427274,"teacher_disagreement_score":0.001262891,"about_ca_system_score_codex":0.0001752262,"about_ca_system_score_gemma":0.00047455743,"threshold_uncertainty_score":0.006402254},"labels":[],"label_agreement":null},{"id":"W1983288926","doi":"10.1109/tip.2011.2163520","title":"Model-Assisted Adaptive Recovery of Compressed Sensing with Imaging Applications","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compressed sensing; Signal recovery; Wavelet; Autoregressive model; Computer science; SIGNAL (programming language); Signal reconstruction; Iterative reconstruction; Algorithm; Piecewise; Artificial intelligence; Discrete cosine transform; Set (abstract data type); Image (mathematics); Signal processing; Mathematics; Computer vision; Pattern recognition (psychology); Statistics; Mathematical analysis","score_opus":0.030948730023666472,"score_gpt":0.22666976950209136,"score_spread":0.1957210394784249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983288926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077894586,0.00042111558,0.9892982,0.00034273075,0.00003475022,0.000015763975,0.000019961692,0.0001694055,0.0019086358],"genre_scores_gemma":[0.5976125,0.0018758175,0.39449573,0.00029089395,0.00015253582,0.00010241825,0.00012919844,0.000080449754,0.0052604335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997384,0.00008102784,0.000009056104,0.000035650603,0.00011700838,0.000018828896],"domain_scores_gemma":[0.9996648,0.0001794228,0.000046503665,0.000053237247,0.000043430053,0.000012746744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044967898,0.00056436803,0.00042798053,0.00034047966,0.00017927002,0.0004452636,0.0005073108,0.000784691,0.0010606383],"category_scores_gemma":[0.0016114549,0.00023448076,0.00044495473,0.0006269063,0.00061497197,0.0007751424,0.0009777877,0.0007439687,0.00029637894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012165974,0.000072133684,0.0005548609,0.0002184823,0.000061290215,0.00022227968,0.00015732563,0.62436754,0.040157367,0.13376687,0.0034879942,0.19681226],"study_design_scores_gemma":[0.0000037979678,0.000029722209,0.000067845234,0.0000053276995,0.0000044875874,0.00006220665,0.00000969551,0.9850247,0.0028856557,0.010402067,0.0014977698,0.000006815427],"about_ca_topic_score_codex":0.0013690438,"about_ca_topic_score_gemma":0.0014101993,"teacher_disagreement_score":0.0013690438,"about_ca_system_score_codex":0.0003369101,"about_ca_system_score_gemma":0.00042660136,"threshold_uncertainty_score":0.003548205},"labels":[],"label_agreement":null},{"id":"W1983383872","doi":"10.1016/j.compmedimag.2013.08.006","title":"Micro-CT image reconstruction based on alternating direction augmented Lagrangian method and total variation","year":2013,"lang":"en","type":"article","venue":"Computerized Medical Imaging and Graphics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal University Hospital; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Augmented Lagrangian method; Regularization (linguistics); Total variation denoising; Iterative reconstruction; Algorithm; Computer science; Image quality; Reduction (mathematics); Mathematical optimization; Mathematics; Artificial intelligence; Image (mathematics)","score_opus":0.0056835538499412875,"score_gpt":0.23420832184492157,"score_spread":0.22852476799498028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983383872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004107301,0.00010420738,0.99504554,0.00006636167,0.000014876531,0.000015442405,0.00001957881,0.000104032326,0.0005227478],"genre_scores_gemma":[0.12920076,0.0004133703,0.86789554,0.000077463155,0.000039977953,0.00008961579,0.00014171307,0.00008647756,0.0020550657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970466,0.000068353474,0.000018421772,0.00003965484,0.00015477983,0.000014001666],"domain_scores_gemma":[0.99961674,0.000170665,0.00006591115,0.000040115377,0.000084220475,0.000022263273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995792,0.0004829068,0.0006071982,0.00059033954,0.00021863486,0.00066561665,0.00069118146,0.00068302476,0.0011719754],"category_scores_gemma":[0.0011754631,0.0004040724,0.0006118987,0.00066412694,0.0003833499,0.0009922638,0.0007895123,0.00080119935,0.00031933538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002980557,0.000110425266,0.0021166175,0.0005941913,0.00017119065,0.00035797054,0.00025226577,0.46599692,0.079951376,0.04461874,0.0041108388,0.40142146],"study_design_scores_gemma":[0.000008713537,0.000023479994,0.00015742157,0.0000060641923,0.000010658052,0.00013903831,0.0000074564173,0.99326706,0.0032306402,0.0022571103,0.0008810181,0.000011372497],"about_ca_topic_score_codex":0.0013232921,"about_ca_topic_score_gemma":0.0017408455,"teacher_disagreement_score":0.0013232921,"about_ca_system_score_codex":0.00018934894,"about_ca_system_score_gemma":0.00080289034,"threshold_uncertainty_score":0.0039206743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020470435141674067,"score_gpt":0.2359204618546497,"score_spread":0.21545002671297564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984305442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006947672,0.0009766708,0.97941226,0.0009771413,0.00012174087,0.000017086177,0.00011805652,0.000045669676,0.011383689],"genre_scores_gemma":[0.58887196,0.0074281455,0.37155655,0.0018375783,0.002324634,0.00044372128,0.0007148011,0.00029374514,0.02652888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974141,0.0011365775,0.000092830014,0.00029807736,0.0009116123,0.00014667159],"domain_scores_gemma":[0.9922792,0.0056186127,0.0004199833,0.00057312194,0.00081132434,0.00029787296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052329954,0.0014009539,0.0014400039,0.0019998965,0.0009778216,0.0027861597,0.0018481534,0.0022593774,0.0029915785],"category_scores_gemma":[0.016731275,0.0008842748,0.0012331558,0.0016429737,0.005082682,0.0052010003,0.0035306935,0.0043925075,0.000595493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016926513,0.00000774455,0.000060816226,0.000029308541,0.000013500064,0.000022619522,0.00004668544,0.012065127,0.00032727068,0.98276305,0.0008860882,0.0037609218],"study_design_scores_gemma":[0.0000048710403,0.000008745701,0.000093562696,0.000014186065,0.000007210571,0.000037699632,0.000017324995,0.11245355,0.00023437219,0.88568026,0.0014357736,0.000012508633],"about_ca_topic_score_codex":0.0011918088,"about_ca_topic_score_gemma":0.0011021649,"teacher_disagreement_score":0.0052329954,"about_ca_system_score_codex":0.0015014246,"about_ca_system_score_gemma":0.0011310811,"threshold_uncertainty_score":0.027675033},"labels":[],"label_agreement":null},{"id":"W1984381276","doi":"10.1016/j.camwa.2005.04.009","title":"Complex singular wishart matrices and applications","year":2005,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wishart distribution; Mathematics; Rank (graph theory); Singular value; Hermitian matrix; Singular value decomposition; Eigenvalues and eigenvectors; Matrix (chemical analysis); Jacobian matrix and determinant; Ergodic theory; Pure mathematics; Applied mathematics; Mathematical analysis; Combinatorics; Algorithm; Statistics; Multivariate statistics","score_opus":0.014315313860104342,"score_gpt":0.23076151495056568,"score_spread":0.21644620109046134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984381276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019554732,0.03972225,0.8687029,0.002271909,0.0014218776,0.000045104465,0.00028276775,0.0006435182,0.06735491],"genre_scores_gemma":[0.57898647,0.057145283,0.29287872,0.0012871439,0.0048271785,0.0001946121,0.0006050843,0.00038933393,0.063686185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959844,0.00008911501,0.000029099014,0.00007672632,0.00018180674,0.000024856163],"domain_scores_gemma":[0.99761885,0.0012145315,0.00021747373,0.00029234416,0.0005392499,0.000117503936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005448745,0.00085261214,0.0007822131,0.0019475382,0.0004307024,0.0023154512,0.00055821094,0.001280734,0.0066903727],"category_scores_gemma":[0.004181414,0.00034821648,0.0003799796,0.003656539,0.0015480894,0.0015446726,0.0010571213,0.0015611767,0.0020801737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058638638,0.00005521055,0.00042900842,0.0003282888,0.00003743143,0.00028041695,0.00021704275,0.029664766,0.004889901,0.78366077,0.012496925,0.16788165],"study_design_scores_gemma":[0.000012297859,0.000043111555,0.0005302486,0.000076805714,0.000026687641,0.0007955827,0.00011859608,0.20261376,0.002846788,0.7435086,0.04938109,0.000046446523],"about_ca_topic_score_codex":0.00069811265,"about_ca_topic_score_gemma":0.00058532984,"teacher_disagreement_score":0.0066903727,"about_ca_system_score_codex":0.00037929378,"about_ca_system_score_gemma":0.00043703124,"threshold_uncertainty_score":0.022381544},"labels":[],"label_agreement":null},{"id":"W1984904631","doi":"10.1109/jsen.2012.2219143","title":"Block-Based CS in a CMOS Image Sensor","year":2012,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; CMC Microsystems","keywords":"CMOS; Scalability; Block (permutation group theory); Image sensor; Pixel; Computer hardware; Computer science; Electronic circuit; CMOS sensor; Electronic engineering; Electrical engineering; Engineering; Artificial intelligence; Mathematics","score_opus":0.01605555553531335,"score_gpt":0.24138061246020068,"score_spread":0.22532505692488733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984904631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07364035,0.0010884027,0.9093465,0.00066877325,0.0002493331,0.00015604473,0.00032746568,0.0016879647,0.012835224],"genre_scores_gemma":[0.4200115,0.0006720981,0.567817,0.00039531864,0.00009592099,0.00014472414,0.00021377316,0.000078380996,0.010571331],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997445,0.000034931647,0.00001035846,0.000045236127,0.00014834024,0.000016581716],"domain_scores_gemma":[0.9998423,0.000038069487,0.000026799233,0.000022925988,0.00005443284,0.00001540457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017155813,0.00025092874,0.0003114948,0.00019953726,0.00015252206,0.00037732412,0.00072043145,0.0005334978,0.0019712567],"category_scores_gemma":[0.00029062017,0.00021695986,0.00021683724,0.00027541432,0.00021529749,0.000664232,0.0004623446,0.0004168607,0.00090701896],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016960096,0.000050371076,0.00027219986,0.00016150673,0.00002299313,0.00009440849,0.000057783556,0.021238321,0.9105694,0.013761215,0.0019301439,0.051672116],"study_design_scores_gemma":[0.000050412415,0.00044652,0.00084192585,0.000024826439,0.0000368189,0.00030885503,0.000022204713,0.58931464,0.3849477,0.0021678347,0.021786142,0.000052159812],"about_ca_topic_score_codex":0.0012364226,"about_ca_topic_score_gemma":0.001547086,"teacher_disagreement_score":0.0019712567,"about_ca_system_score_codex":0.000494119,"about_ca_system_score_gemma":0.00053974683,"threshold_uncertainty_score":0.006594479},"labels":[],"label_agreement":null},{"id":"W1985308950","doi":"10.1109/icip.2013.6738484","title":"Sensitivity analysis of compressed sensing ISAR imaging to rotational acceleration rate mismatch","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pixel; Inverse synthetic aperture radar; Sensitivity (control systems); Acceleration; Synthetic aperture radar; Compressed sensing; Iterative reconstruction; Computer science; Radar imaging; Optics; Artificial intelligence; Radar; Physics; Electronic engineering; Telecommunications; Engineering","score_opus":0.013497932500263663,"score_gpt":0.23458520589553947,"score_spread":0.2210872733952758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985308950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51283956,0.0019678157,0.47723374,0.0009377575,0.000082641534,0.00010531788,0.00026253486,0.00065211323,0.005918507],"genre_scores_gemma":[0.98516244,0.0003001638,0.013786082,0.0001124921,0.000022181832,0.000026992802,0.00009199446,0.0000427114,0.00045491528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841464,0.00054061605,0.00006165889,0.00019884399,0.00066136674,0.0001228701],"domain_scores_gemma":[0.9846064,0.013249874,0.00074654113,0.0006316199,0.0006826867,0.00008298081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020265924,0.00061968004,0.0005477677,0.000604042,0.00025002818,0.00051393395,0.0003223741,0.0009958764,0.00086808443],"category_scores_gemma":[0.018446855,0.00024953665,0.00034304353,0.0003933884,0.0009404111,0.00087004574,0.0005966725,0.0004623543,0.00014969445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007323925,0.000060278468,0.0054097567,0.00027681273,0.0001320394,0.00058389467,0.00016292765,0.8606837,0.09299409,0.008306354,0.0004382329,0.030219551],"study_design_scores_gemma":[0.000010504733,0.00020002112,0.004617223,0.000027412523,0.000038517646,0.0004639157,0.000053403222,0.94166213,0.049089305,0.0032674323,0.0005227887,0.000047344136],"about_ca_topic_score_codex":0.0010602595,"about_ca_topic_score_gemma":0.00050301204,"teacher_disagreement_score":0.0020265924,"about_ca_system_score_codex":0.00068836333,"about_ca_system_score_gemma":0.0002168765,"threshold_uncertainty_score":0.01071775},"labels":[],"label_agreement":null},{"id":"W1985636041","doi":"10.1109/apccas.2014.7032709","title":"Compressive imaging by generalized total variation minimization","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minification; Compressed sensing; Discretization; Computer science; Mathematical optimization; Algorithm; Image (mathematics); Iterative method; Iterative reconstruction; Regular polygon; Mathematics; Artificial intelligence; Mathematical analysis; Geometry","score_opus":0.004402722087704799,"score_gpt":0.19105068349265367,"score_spread":0.18664796140494888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985636041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020392549,0.00020759515,0.9963291,0.00014440727,0.000023994633,0.000013485864,0.000021415235,0.0000879956,0.0011328368],"genre_scores_gemma":[0.14559054,0.0009915706,0.84753513,0.00019422297,0.0001641284,0.000120929326,0.00022521065,0.000094022434,0.0050841942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999438,0.00022944786,0.000021323625,0.000092401686,0.00019157653,0.000027237566],"domain_scores_gemma":[0.9996581,0.00018284614,0.000041150484,0.000052241317,0.00005156458,0.000014123602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005640136,0.0007111846,0.0007609077,0.00043476725,0.0001777931,0.00075356604,0.00069649913,0.00087833364,0.0012691456],"category_scores_gemma":[0.0018989289,0.0002749528,0.000554132,0.000780995,0.00079860137,0.0008561877,0.0010435585,0.0012092555,0.00047857634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012921424,0.000040969397,0.00034061115,0.00030077825,0.000099252626,0.00018092895,0.00012854364,0.5790001,0.03560704,0.12579075,0.0054783816,0.2529034],"study_design_scores_gemma":[0.000007976424,0.00003376067,0.00007745993,0.000009179766,0.000006113299,0.00008236631,0.000008865715,0.9809193,0.0032608726,0.012775005,0.0028091425,0.000010037859],"about_ca_topic_score_codex":0.0014381113,"about_ca_topic_score_gemma":0.001944246,"teacher_disagreement_score":0.0014381113,"about_ca_system_score_codex":0.00042264847,"about_ca_system_score_gemma":0.0007250206,"threshold_uncertainty_score":0.0042456985},"labels":[],"label_agreement":null},{"id":"W1985964050","doi":"10.1190/1.2944169","title":"New insights into one-norm solvers from the Pareto curve","year":2008,"lang":"en","type":"article","venue":"Geophysics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pareto principle; Convexity; Prior probability; Stylized fact; Norm (philosophy); Mathematics; Applied mathematics; Mathematical optimization; Computer science; Bayesian probability; Statistics; Economics","score_opus":0.019525893811704127,"score_gpt":0.1976761970378075,"score_spread":0.17815030322610337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985964050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024112845,0.00056523044,0.95837384,0.0012500336,0.000058514637,0.000050957027,0.000072289695,0.00023228912,0.01528396],"genre_scores_gemma":[0.56605387,0.0013819693,0.41744402,0.0008655082,0.00020623484,0.00025866667,0.00038455898,0.0009494342,0.012455764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982973,0.0007442659,0.00008058699,0.0001354766,0.0005997616,0.00014265484],"domain_scores_gemma":[0.98881,0.008084632,0.00058129296,0.0007567472,0.0013139333,0.0004534064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00727397,0.0013889789,0.0008663206,0.0023701896,0.001234668,0.002471827,0.0014621259,0.0025724543,0.0049594864],"category_scores_gemma":[0.028093712,0.00065108296,0.0009904394,0.0014022946,0.003908117,0.0044272994,0.004463845,0.003187843,0.0010795236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008799511,0.00006675915,0.0009655487,0.00013028122,0.000020639487,0.000119117336,0.00028977043,0.3605423,0.0023223443,0.59307563,0.003932346,0.038447224],"study_design_scores_gemma":[0.000010257819,0.000029670886,0.00012677792,0.00004928263,0.0000031868012,0.000053478445,0.000054042815,0.80064523,0.0008993498,0.1958802,0.0022317257,0.000016793992],"about_ca_topic_score_codex":0.0018118997,"about_ca_topic_score_gemma":0.0012704864,"teacher_disagreement_score":0.00727397,"about_ca_system_score_codex":0.001564385,"about_ca_system_score_gemma":0.0018274124,"threshold_uncertainty_score":0.038468897},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015198572735487343,"score_gpt":0.23953245100648488,"score_spread":0.22433387827099754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986219860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061365366,0.000078752324,0.9917807,0.00018210782,0.000015815382,0.000035410503,0.00007832845,0.0002367709,0.0014554329],"genre_scores_gemma":[0.2696442,0.00036703958,0.7244222,0.0003261922,0.00006410952,0.00045416364,0.00080827874,0.0003015735,0.0036121309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820065,0.0009150529,0.000066555265,0.00027859074,0.000410092,0.00012905951],"domain_scores_gemma":[0.99603975,0.0028967862,0.00028942773,0.00023366796,0.00043449822,0.00010579403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024515255,0.0016231379,0.0013906612,0.00083177513,0.00065053866,0.0013815331,0.001506627,0.0015495244,0.002527519],"category_scores_gemma":[0.006623043,0.0009372588,0.0010656888,0.0012467911,0.0015176487,0.0016152266,0.0014462486,0.0030244759,0.0007915326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047285543,0.000057553938,0.00021465344,0.00008918329,0.000022829452,0.000035892415,0.00005251217,0.96095616,0.000998926,0.020784529,0.0022302011,0.0145102935],"study_design_scores_gemma":[0.0000046360515,0.000008151864,0.000018328194,0.0000031032325,0.0000011760808,0.000006179672,0.000007986792,0.99408025,0.00019425814,0.0054983934,0.00017473889,0.0000028260374],"about_ca_topic_score_codex":0.0045480737,"about_ca_topic_score_gemma":0.005756875,"teacher_disagreement_score":0.0045480737,"about_ca_system_score_codex":0.0014526878,"about_ca_system_score_gemma":0.0017138419,"threshold_uncertainty_score":0.012965083},"labels":[],"label_agreement":null},{"id":"W1986322690","doi":"10.1109/acssc.2014.7094558","title":"On the convergence of an alternating direction penalty method for nonconvex problems","year":2014,"lang":"en","type":"article","venue":"2014 48th Asilomar Conference on Signals, Systems and Computers","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Penalty method; Convergence (economics); Mathematical optimization; Scalability; Quadratic equation; Function (biology); Computer science; Augmented Lagrangian method; Point (geometry); Optimization problem; Constrained optimization; Quadratic programming; Mathematics; Algorithm; Applied mathematics","score_opus":0.03133406381037876,"score_gpt":0.2633691879002347,"score_spread":0.23203512408985597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986322690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008190204,0.00038373758,0.98812765,0.00024042948,0.00005841155,0.000047258203,0.000023255392,0.00007376818,0.0028553368],"genre_scores_gemma":[0.40844402,0.0017317212,0.5790534,0.0003988588,0.00022881362,0.0006614135,0.0002996398,0.00040828166,0.008773773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894625,0.00056719553,0.000038289665,0.00011080379,0.00027640082,0.000061065046],"domain_scores_gemma":[0.9930708,0.005280963,0.00037547923,0.000322272,0.00071410823,0.00023636685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004128132,0.0016895649,0.00095530174,0.000824071,0.00051177305,0.0008693247,0.000905221,0.0013836412,0.0026957982],"category_scores_gemma":[0.016870195,0.0004638408,0.00077441445,0.0006722551,0.0022308964,0.0017844423,0.0022351237,0.00217819,0.00057041354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014648374,0.00005965301,0.0007363488,0.0002683847,0.000054347438,0.00018184686,0.00011608978,0.8586678,0.0053586615,0.09603564,0.0020442628,0.036330532],"study_design_scores_gemma":[0.0000060081175,0.000033838704,0.000043649274,0.000012760945,0.0000018739269,0.000020736616,0.000006778631,0.99078536,0.0003027108,0.008359272,0.00042236346,0.0000046186497],"about_ca_topic_score_codex":0.001586061,"about_ca_topic_score_gemma":0.001199161,"teacher_disagreement_score":0.004128132,"about_ca_system_score_codex":0.0005264813,"about_ca_system_score_gemma":0.0012026511,"threshold_uncertainty_score":0.02183187},"labels":[],"label_agreement":null},{"id":"W1987976208","doi":"10.1080/17415977.2014.934821","title":"Optimal design of simultaneous source encoding","year":2014,"lang":"en","type":"article","venue":"Inverse Problems in Science and Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Range (aeronautics); Inverse problem; Set (abstract data type); Domain (mathematical analysis); Selection (genetic algorithm); Energy (signal processing); Algorithm; Reduction (mathematics); Field (mathematics); Encoding (memory); Mathematical optimization; Inverse; Mathematics; Statistics; Artificial intelligence","score_opus":0.017099732246512164,"score_gpt":0.20836145481100268,"score_spread":0.19126172256449053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987976208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007685143,0.00020310373,0.98954856,0.00022839682,0.00003217008,0.000080458456,0.00008275527,0.00015939848,0.0019800274],"genre_scores_gemma":[0.36020645,0.0005768635,0.6334728,0.00031563482,0.00010511849,0.0007277596,0.00036908174,0.00012394645,0.0041024806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717194,0.00120024,0.00013379974,0.00061821257,0.0006556782,0.000220095],"domain_scores_gemma":[0.9928733,0.004963114,0.0006249906,0.0005450927,0.0007216204,0.00027189305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00346065,0.0015289292,0.0016789992,0.00073020515,0.00039598907,0.0014370825,0.0013988534,0.0016743602,0.00322016],"category_scores_gemma":[0.01521549,0.0012431281,0.0007171483,0.0007873095,0.0022767305,0.0026769775,0.0027420344,0.0016555698,0.0008784542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013624041,0.00027415477,0.0012751509,0.0007328304,0.00015772252,0.00021549026,0.0002941689,0.64934474,0.03606221,0.112872936,0.0024011622,0.19500703],"study_design_scores_gemma":[0.000095881456,0.00027797162,0.00033494682,0.000053045736,0.00003426919,0.00007977672,0.000044263546,0.94434947,0.008399881,0.04404296,0.0022490732,0.000038466373],"about_ca_topic_score_codex":0.00095247576,"about_ca_topic_score_gemma":0.001287053,"teacher_disagreement_score":0.00346065,"about_ca_system_score_codex":0.0009172073,"about_ca_system_score_gemma":0.0019440758,"threshold_uncertainty_score":0.018301845},"labels":[],"label_agreement":null},{"id":"W1988507320","doi":"10.1109/icc.2012.6364461","title":"A multiple access scheme based on multi-dimensional compressed sensing","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Compressed sensing; Computer science; Wireless sensor network; Channel (broadcasting); Scheme (mathematics); Wireless; Power (physics); Real-time computing; Computer network; Telecommunications; Algorithm","score_opus":0.0518193954258955,"score_gpt":0.2812307751915913,"score_spread":0.22941137976569578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988507320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01788976,0.0007157282,0.97782624,0.00035169857,0.0001238384,0.00011652173,0.00006569874,0.00022223817,0.0026883204],"genre_scores_gemma":[0.68075746,0.0011988262,0.31302842,0.00043409187,0.00031617034,0.00028081177,0.00018947328,0.000023644228,0.0037710941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926776,0.0001763924,0.000035760226,0.00012242066,0.000333847,0.000063850006],"domain_scores_gemma":[0.9991509,0.00029766836,0.000130001,0.00019373439,0.00017153687,0.000056314304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054710003,0.00047421266,0.00065082987,0.0006868568,0.00054474134,0.0005386642,0.0009960334,0.00081458787,0.0012195122],"category_scores_gemma":[0.0020986123,0.00014829224,0.00031355605,0.0009943827,0.0007974295,0.001396546,0.0010741057,0.0008378896,0.00026673535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067446823,0.00035737595,0.000975394,0.00058684655,0.00018050478,0.00076018623,0.00048251482,0.09001024,0.21482985,0.17855905,0.005570527,0.507013],"study_design_scores_gemma":[0.00014830363,0.0007180039,0.00054908916,0.000050781066,0.00006888378,0.0016386155,0.0000798085,0.92170733,0.038148496,0.024587004,0.012202883,0.00010086104],"about_ca_topic_score_codex":0.0006438439,"about_ca_topic_score_gemma":0.0007651906,"teacher_disagreement_score":0.0012195122,"about_ca_system_score_codex":0.00030005828,"about_ca_system_score_gemma":0.00045210787,"threshold_uncertainty_score":0.0040796995},"labels":[],"label_agreement":null},{"id":"W1989261534","doi":"10.4171/pm/1881","title":"Euclidean distance matrices, semidefinite programming and sensor network localization","year":2011,"lang":"en","type":"article","venue":"Portugaliae Mathematica","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Polytechnique Montréal; University of Windsor","funders":"Stanford Bio-X; Mitacs; Air Force Office of Scientific Research; Alexander von Humboldt-Stiftung","keywords":"Semidefinite programming; Mathematics; Euclidean geometry; Embedding; Regular polygon; Dimension (graph theory); Context (archaeology); Convex optimization; Euclidean distance matrix; Combinatorics; Discrete mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.027500746315902023,"score_gpt":0.21736577855185735,"score_spread":0.18986503223595533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989261534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017157042,0.015543249,0.92509407,0.004353705,0.00046383197,0.000034567936,0.00034449244,0.00015267747,0.03685635],"genre_scores_gemma":[0.6172206,0.035578016,0.31593984,0.0016726963,0.0016598242,0.00028458255,0.0009102874,0.00019872807,0.026535388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992607,0.00033890703,0.00002680212,0.0001300979,0.00019682171,0.000046635658],"domain_scores_gemma":[0.99849,0.000999526,0.00021230598,0.00009081318,0.00014073243,0.000066665154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010349602,0.00090176804,0.00060086075,0.0007334561,0.00034076738,0.0011920439,0.00068845454,0.0009334472,0.0035262073],"category_scores_gemma":[0.0035450393,0.00030595533,0.00034861238,0.0018121655,0.002132697,0.0022483831,0.0009464393,0.0025283946,0.0006627979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003338247,0.0000381407,0.00023972175,0.00023409398,0.000022379378,0.00008625793,0.000103485836,0.06893134,0.0011260579,0.8878169,0.007509068,0.03385924],"study_design_scores_gemma":[0.0000116352885,0.00004208253,0.00025021125,0.000046769095,0.000007030625,0.00013734827,0.000084361585,0.12860203,0.0003430383,0.85679644,0.013661965,0.000016986882],"about_ca_topic_score_codex":0.0011990212,"about_ca_topic_score_gemma":0.0011983641,"teacher_disagreement_score":0.0035262073,"about_ca_system_score_codex":0.0008357861,"about_ca_system_score_gemma":0.0007047373,"threshold_uncertainty_score":0.011796355},"labels":[],"label_agreement":null},{"id":"W1989343095","doi":"10.1155/2013/142602","title":"Analysis of Moving Object Imaging from Compressively Sensed SAR Data in the Presence of Dictionary Mismatch","year":2013,"lang":"en","type":"article","venue":"International Journal of Antennas and Propagation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Upsampling; Computer science; Azimuth; Synthetic aperture radar; Coded aperture; Algorithm; Gaussian; Artificial intelligence; Range (aeronautics); Position (finance); Mean squared error; Computer vision; Mathematics; Image (mathematics); Physics; Optics; Materials science; Telecommunications; Statistics; Detector","score_opus":0.017761130964550422,"score_gpt":0.25600164038418843,"score_spread":0.238240509419638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989343095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17023633,0.00088991836,0.8247101,0.0005683751,0.000065120636,0.000041576408,0.00009879705,0.00025285484,0.003136916],"genre_scores_gemma":[0.86923146,0.0010285414,0.12680274,0.00015035422,0.000115316856,0.000050530543,0.00022019703,0.00007489834,0.002325844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996226,0.000080326055,0.000015162167,0.000045812074,0.00020717655,0.00002894991],"domain_scores_gemma":[0.9984812,0.001035696,0.00019027534,0.00007741453,0.00017861642,0.000036654237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073036,0.00054414297,0.00051975204,0.00038387888,0.00019147055,0.00045034694,0.00047491016,0.0008532087,0.0006951907],"category_scores_gemma":[0.0032509875,0.00024085656,0.00034971605,0.000430601,0.000772959,0.0008832125,0.000554207,0.0005424757,0.00008930393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002950173,0.000051974024,0.0021516015,0.00032850535,0.00008849498,0.0011085079,0.00019710048,0.8417365,0.076366626,0.025958382,0.00084219925,0.05087508],"study_design_scores_gemma":[0.000002310695,0.000030235266,0.00037962382,0.000004745938,0.000006791173,0.00012006101,0.000010834094,0.99509615,0.003087265,0.0010680923,0.00018711294,0.000006732138],"about_ca_topic_score_codex":0.0014998927,"about_ca_topic_score_gemma":0.0010660717,"teacher_disagreement_score":0.0014998927,"about_ca_system_score_codex":0.00026544306,"about_ca_system_score_gemma":0.00029984067,"threshold_uncertainty_score":0.0038625598},"labels":[],"label_agreement":null},{"id":"W1989520444","doi":"10.1109/icdm.2012.133","title":"Fast Kernel Sparse Representation Approaches for Classification","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Sparse approximation; Computer science; Kernel (algebra); K-SVD; Neural coding; Artificial intelligence; Representation (politics); Dimension (graph theory); Pattern recognition (psychology); Dictionary learning; Kernel method; Feature learning; Set (abstract data type); Machine learning; External Data Representation; Algorithm; Mathematics; Support vector machine","score_opus":0.1537749020227621,"score_gpt":0.2875790385646192,"score_spread":0.1338041365418571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989520444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012361492,0.00032495536,0.99770385,0.00010331084,0.000023646699,0.000017897533,0.0000254821,0.00018522516,0.00037952437],"genre_scores_gemma":[0.14700997,0.0019466406,0.8459072,0.0001553012,0.00028610855,0.0002658747,0.0004898985,0.0001504882,0.0037885692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906105,0.00032404938,0.000046809993,0.0001597122,0.00033321313,0.00007511505],"domain_scores_gemma":[0.9980615,0.0010264195,0.00015857974,0.00027873792,0.00042603668,0.000048708513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001665193,0.0011027325,0.0014966177,0.0017356316,0.00051475735,0.0013055687,0.0019371252,0.0015056798,0.0030577583],"category_scores_gemma":[0.0047316896,0.000450292,0.0009311781,0.0027276573,0.0009332587,0.0025691385,0.0014130931,0.0023628417,0.0018280178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010685177,0.00013089494,0.0005288981,0.00032303727,0.00008939301,0.00006396172,0.0001530851,0.33308834,0.00581117,0.13326842,0.009107771,0.5173282],"study_design_scores_gemma":[0.000008224248,0.000019016908,0.00006682075,0.000008664694,0.0000060786383,0.00003206459,0.0000122584415,0.9713523,0.0009242583,0.025455914,0.0021056684,0.000008652878],"about_ca_topic_score_codex":0.0019368505,"about_ca_topic_score_gemma":0.00153124,"teacher_disagreement_score":0.0030577583,"about_ca_system_score_codex":0.00071343186,"about_ca_system_score_gemma":0.00082958804,"threshold_uncertainty_score":0.01022917},"labels":[],"label_agreement":null},{"id":"W1991937133","doi":"10.1007/s10107-014-0795-8","title":"Extreme point inequalities and geometry of the rank sparsity ball","year":2014,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Extreme point; Ball (mathematics); Unit sphere; Matrix norm; Norm (philosophy); Penalty method; Convex geometry; Rank (graph theory); Regular polygon; Algebra over a field; Mathematical optimization; Combinatorics; Geometry; Convex optimization; Convex set; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.029097338672444233,"score_gpt":0.22102634940451651,"score_spread":0.19192901073207227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991937133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025029069,0.0020705576,0.9346903,0.0053334883,0.00020776893,0.000050034552,0.00046866463,0.00008944839,0.032060727],"genre_scores_gemma":[0.7559467,0.009084015,0.20066456,0.0021393152,0.0019381994,0.00067971373,0.001248183,0.00027166415,0.02802762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977673,0.0011840983,0.00006820383,0.00026575575,0.0005554552,0.00015925703],"domain_scores_gemma":[0.98932487,0.008189277,0.0007823378,0.00033109688,0.00091130566,0.0004610993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032931578,0.0017662302,0.001601366,0.0021215442,0.0009295178,0.003856556,0.0017397841,0.0016413695,0.0070137414],"category_scores_gemma":[0.017403431,0.00077948236,0.0010614637,0.0018961817,0.0046904143,0.0054607764,0.0034554983,0.0056515713,0.0008050553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003187021,0.000017886196,0.00014790588,0.00006903452,0.000017276283,0.00004291809,0.00006803188,0.015562252,0.0003803471,0.97642446,0.0020743427,0.005163558],"study_design_scores_gemma":[0.00001121955,0.000021645232,0.000108910346,0.00002064985,0.0000054314464,0.000032940574,0.000032917902,0.06449594,0.0001330565,0.9337033,0.0014242319,0.000009812893],"about_ca_topic_score_codex":0.0016627167,"about_ca_topic_score_gemma":0.0010423199,"teacher_disagreement_score":0.0070137414,"about_ca_system_score_codex":0.0017426137,"about_ca_system_score_gemma":0.0010659051,"threshold_uncertainty_score":0.023463309},"labels":[],"label_agreement":null},{"id":"W1992002716","doi":"10.1109/iscas.2013.6572216","title":"Compressed sensing SAR moving target imaging in the presence of basis mismatch","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synthetic aperture radar; Compressed sensing; Computer science; Basis (linear algebra); Gaussian; Artificial intelligence; Radar imaging; Computer vision; Iterative reconstruction; Bernoulli's principle; Algorithm; Radar; Pattern recognition (psychology); Mathematics; Physics; Telecommunications","score_opus":0.010266920639765722,"score_gpt":0.2112411747171932,"score_spread":0.20097425407742747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992002716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18292995,0.0009837477,0.8120922,0.0005926783,0.00010445832,0.000027348955,0.000048803533,0.00021733454,0.0030035276],"genre_scores_gemma":[0.8412448,0.00069447246,0.15589614,0.00016698203,0.000107952255,0.00001919194,0.0001074873,0.000029696128,0.0017333456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970263,0.00007974573,0.000010390121,0.000039789313,0.00014487772,0.00002257033],"domain_scores_gemma":[0.99948126,0.00032209104,0.00006268817,0.000043935477,0.00007017275,0.000019922023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035905105,0.0003749766,0.00040652,0.0001814821,0.00014356029,0.00032556336,0.00030752076,0.00068385387,0.00046607974],"category_scores_gemma":[0.0015520355,0.00014198099,0.00018185627,0.00029831263,0.00047172446,0.00073807716,0.00047519093,0.00049362873,0.000120916615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009105971,0.00008602704,0.0029248747,0.00037980877,0.00010232325,0.0018986884,0.00031696996,0.38493425,0.33635032,0.034308206,0.0017991605,0.2359888],"study_design_scores_gemma":[0.00001436456,0.00012718269,0.00081204064,0.000011215642,0.000019250432,0.0009988659,0.00004387627,0.9604807,0.032209307,0.004099625,0.0011662947,0.00001717379],"about_ca_topic_score_codex":0.0005854431,"about_ca_topic_score_gemma":0.0005569968,"teacher_disagreement_score":0.00068385387,"about_ca_system_score_codex":0.00012148129,"about_ca_system_score_gemma":0.0001966651,"threshold_uncertainty_score":0.0018988848},"labels":[],"label_agreement":null},{"id":"W1993460718","doi":"10.1117/12.2027069","title":"Weighted and reweighted approximate message passing","year":2013,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Computer science; Linear programming; Algorithm; Message passing; Computational complexity theory; Scheme (mathematics); Mathematical optimization; Mathematics","score_opus":0.009888182093892632,"score_gpt":0.20994755494091522,"score_spread":0.20005937284702258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993460718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013658958,0.000117902935,0.9975804,0.000065889006,0.000033719378,0.000016861093,0.000018026765,0.000121520694,0.00067965675],"genre_scores_gemma":[0.09681388,0.00057183154,0.8934184,0.0003005895,0.00016247398,0.00017531024,0.0002308937,0.00020391613,0.008122699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982267,0.00057585974,0.000110403016,0.0003037924,0.0006557943,0.00012745541],"domain_scores_gemma":[0.9967912,0.0014879227,0.00026007227,0.00070948614,0.0006562741,0.000094961375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020669007,0.0011169316,0.0012866043,0.0010470868,0.0004195807,0.0016304222,0.002510151,0.0019389698,0.004342442],"category_scores_gemma":[0.009303712,0.00052204664,0.0008162265,0.0012794264,0.0014836068,0.0035956248,0.0022072638,0.0020065696,0.002247629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000234736,0.000069276095,0.00030815235,0.00025453625,0.00010754728,0.00014624296,0.00017437078,0.53639024,0.006821,0.17943776,0.0038693843,0.27218676],"study_design_scores_gemma":[0.000012194272,0.000048720325,0.000046749392,0.000015806709,0.000011562538,0.00007560964,0.000014176747,0.9431713,0.003212564,0.049079545,0.0042952877,0.000016560407],"about_ca_topic_score_codex":0.0012006063,"about_ca_topic_score_gemma":0.0014285389,"teacher_disagreement_score":0.004342442,"about_ca_system_score_codex":0.0007791099,"about_ca_system_score_gemma":0.0009993064,"threshold_uncertainty_score":0.014526904},"labels":[],"label_agreement":null},{"id":"W1997572011","doi":"10.1049/el.2014.0770","title":"Compressive sensing of images based on discrete periodic Radon transform","year":2014,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Radon; Radon transform; Compressed sensing; Computer science; Remote sensing; Acoustics; Materials science; Environmental science; Algorithm; Computer vision; Geology; Physics","score_opus":0.003971057975190701,"score_gpt":0.19366204802455686,"score_spread":0.18969099004936615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997572011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050669037,0.0005821339,0.9445485,0.0002517374,0.00008681875,0.000033735836,0.00004791049,0.00020534392,0.00357484],"genre_scores_gemma":[0.61897075,0.000840476,0.37707818,0.00013872862,0.00010817599,0.00006742986,0.0001277895,0.000028867446,0.0026395503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997191,0.00007877521,0.000010662203,0.000041113766,0.00012899574,0.000021506676],"domain_scores_gemma":[0.9997571,0.00010376829,0.000038558508,0.000045144432,0.000041438434,0.000013937918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030898754,0.000273526,0.00033828808,0.0002645116,0.00011505092,0.0003203111,0.00033814492,0.00038063186,0.0007406104],"category_scores_gemma":[0.0009254369,0.00016050419,0.00024814915,0.00032551217,0.00048256494,0.0006267324,0.00043240617,0.00047176782,0.00019152717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049404596,0.00009237923,0.0009856491,0.00030975955,0.000074142554,0.00042590927,0.00016516066,0.2139411,0.33407554,0.14261736,0.0033910866,0.30342782],"study_design_scores_gemma":[0.000034429402,0.00016105994,0.0004785705,0.000013704868,0.000016207248,0.00029050876,0.000016903867,0.94463116,0.042553775,0.008795647,0.0029802078,0.000027841896],"about_ca_topic_score_codex":0.00040354906,"about_ca_topic_score_gemma":0.00041514853,"teacher_disagreement_score":0.0007406104,"about_ca_system_score_codex":0.00018491957,"about_ca_system_score_gemma":0.0002961592,"threshold_uncertainty_score":0.0024775863},"labels":[],"label_agreement":null},{"id":"W1998182736","doi":"10.1109/icc.2010.5501843","title":"Hybrid Techniques for Large-Scale IP Traffic Matrix Estimation","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Internet traffic engineering; Traffic generation model; Network traffic simulation; Internet traffic; Network tomography; Overhead (engineering); The Internet; Matrix (chemical analysis); Data mining; Traffic engineering; Real-time computing; Algorithm; Computer network; Network traffic control; Network packet; Network topology","score_opus":0.007743694563244526,"score_gpt":0.2517404305323524,"score_spread":0.24399673596910787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998182736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029288977,0.0000508313,0.99661726,0.000031155898,0.0000054352995,0.000009560979,0.000010988552,0.00013535713,0.00021052877],"genre_scores_gemma":[0.17568187,0.00026543383,0.8224727,0.00006435352,0.000063053456,0.00009270353,0.00015129316,0.00005258325,0.001156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994748,0.00017196502,0.000022471831,0.00007203265,0.00022822872,0.000030399979],"domain_scores_gemma":[0.99783,0.0014712923,0.00018691173,0.00021834444,0.0002613009,0.00003221745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011140656,0.0008132232,0.0005194695,0.0010062514,0.00029045672,0.00047197993,0.000795656,0.00069170236,0.0010182279],"category_scores_gemma":[0.004588368,0.00033381808,0.00045896694,0.0009727533,0.000550091,0.0013791373,0.00090998976,0.00074822083,0.0002993351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017334381,0.00009329267,0.0009442717,0.00015756498,0.00007170837,0.000100142846,0.00019735184,0.49591005,0.035190713,0.02243288,0.0012787101,0.4434501],"study_design_scores_gemma":[0.000005948306,0.000019461844,0.00020051627,0.0000039774527,0.0000037190441,0.00004991354,0.000009521124,0.9912976,0.0035411255,0.0043688877,0.000491656,0.0000076076503],"about_ca_topic_score_codex":0.0016664173,"about_ca_topic_score_gemma":0.0020118828,"teacher_disagreement_score":0.0016664173,"about_ca_system_score_codex":0.00033065924,"about_ca_system_score_gemma":0.00045974084,"threshold_uncertainty_score":0.0058918595},"labels":[],"label_agreement":null},{"id":"W1998186731","doi":"10.1109/icassp.2013.6638052","title":"A nonlinear dictionary for image reconstruction","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Discrete cosine transform; Computer science; Artificial intelligence; Sparse approximation; Pattern recognition (psychology); K-SVD; Transform coding; Neural coding; Data compression; Coding (social sciences); Representation (politics); Speech recognition; Image (mathematics); Computer vision; Mathematics","score_opus":0.008964926502040744,"score_gpt":0.20771267417863365,"score_spread":0.1987477476765929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998186731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026538882,0.00043345313,0.9934336,0.00019243706,0.00008772756,0.000024204148,0.000105263134,0.000127293,0.0029421172],"genre_scores_gemma":[0.14627059,0.0029624626,0.8315385,0.00037139785,0.00026224036,0.00021406719,0.0008759006,0.00014229424,0.017362589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969816,0.00007822496,0.000017842382,0.00006981033,0.00011738736,0.000018573855],"domain_scores_gemma":[0.99969566,0.000090365356,0.000029792314,0.000076356235,0.00008772864,0.00002011152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031846494,0.00037835824,0.0004639516,0.00043302652,0.00023986517,0.00054642645,0.0005053248,0.00060816517,0.0033851569],"category_scores_gemma":[0.0012940759,0.00019267506,0.00037439176,0.0007726214,0.0004807372,0.0007952126,0.00092779053,0.0009716636,0.001884773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002284653,0.00007020217,0.0006613874,0.000526675,0.00008449243,0.00020385576,0.00017169568,0.18090807,0.07305949,0.2119488,0.016739713,0.5153972],"study_design_scores_gemma":[0.000021497299,0.00008786465,0.00030562113,0.000039490216,0.000013225371,0.00035703447,0.000035706456,0.92649275,0.01084149,0.02777821,0.03400053,0.00002662447],"about_ca_topic_score_codex":0.0008940238,"about_ca_topic_score_gemma":0.0010558008,"teacher_disagreement_score":0.0033851569,"about_ca_system_score_codex":0.0002353029,"about_ca_system_score_gemma":0.00045286375,"threshold_uncertainty_score":0.011324465},"labels":[],"label_agreement":null},{"id":"W1998873033","doi":"10.1109/icassp.2013.6637959","title":"MULTI-STAGE OMP sparse coding using local matching pursuit atoms selection","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Saskatchewan Health Authority; Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Matching pursuit; Sparse approximation; Neural coding; Computer science; Pattern recognition (psychology); Set (abstract data type); Basis pursuit; Coding (social sciences); Artificial intelligence; K-SVD; Matching (statistics); Component (thermodynamics); Algorithm; Mathematics; Compressed sensing; Statistics","score_opus":0.04740505309010606,"score_gpt":0.27024451072647176,"score_spread":0.2228394576363657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998873033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004321651,0.00006829669,0.99484813,0.000045632238,0.000017447699,0.000020926636,0.000015374753,0.0001550482,0.00050756143],"genre_scores_gemma":[0.14352319,0.00021036416,0.8522509,0.00008738635,0.00005227825,0.000111771194,0.00017401771,0.00007223514,0.003517837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947375,0.00012533744,0.00002621349,0.00006920708,0.00025196807,0.00005356801],"domain_scores_gemma":[0.99943227,0.00021681837,0.00006476912,0.00010067012,0.00015548867,0.000029907624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005722135,0.00060471485,0.0009303192,0.0005351316,0.00031122973,0.00066287175,0.0011667518,0.00092278887,0.0016960009],"category_scores_gemma":[0.0013208474,0.00039636338,0.0007501713,0.00089241285,0.00035820008,0.0012170601,0.0013259522,0.0009092457,0.0007719138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056564546,0.00027657708,0.001188275,0.0002806139,0.00012119144,0.00030959953,0.00015334944,0.16494596,0.19581267,0.020440217,0.0040133074,0.6118925],"study_design_scores_gemma":[0.00001784968,0.00012205502,0.0002634116,0.000006671573,0.000013842171,0.0001404428,0.0000112516955,0.9759478,0.02020529,0.0015695269,0.0016861729,0.000015653002],"about_ca_topic_score_codex":0.00072810246,"about_ca_topic_score_gemma":0.0010967342,"teacher_disagreement_score":0.0016960009,"about_ca_system_score_codex":0.00021648151,"about_ca_system_score_gemma":0.0006849376,"threshold_uncertainty_score":0.005673647},"labels":[],"label_agreement":null},{"id":"W1999418275","doi":"10.1007/s10589-013-9634-8","title":"Robust least square semidefinite programming with applications","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Robustification; Mathematics; Mathematical optimization; Semidefinite embedding; Rounding; Duality (order theory); Sequence (biology); Interior point method; Cartesian product; Duality gap; Linear programming; Feasible region; Optimization problem; Computer science; Quadratically constrained quadratic program; Discrete mathematics; Quadratic programming","score_opus":0.013506021585064452,"score_gpt":0.20815008141569386,"score_spread":0.1946440598306294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999418275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013152647,0.0004957387,0.9914029,0.00049443136,0.000121657235,0.000020707694,0.00008849031,0.00017945412,0.0058812406],"genre_scores_gemma":[0.16309191,0.0026886961,0.80772585,0.00060433784,0.0007274705,0.00041027385,0.00047347703,0.00092088094,0.023357084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878186,0.0005689538,0.000051917807,0.00018509066,0.000367596,0.000044638127],"domain_scores_gemma":[0.9955871,0.0029107346,0.0003074712,0.0003487675,0.00072547427,0.000120396646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019725526,0.0019944678,0.001393866,0.00072431687,0.0004017638,0.0014675263,0.001134296,0.0015127661,0.007816088],"category_scores_gemma":[0.008613553,0.0007786523,0.0007354887,0.001776384,0.001748301,0.0014402247,0.0022143417,0.0037444704,0.0021673732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013030673,0.00026326661,0.00021695677,0.0006988569,0.00008677766,0.0001880981,0.00020829936,0.35786203,0.005161465,0.41022864,0.036585405,0.18837005],"study_design_scores_gemma":[0.000015611176,0.00004679668,0.00004919858,0.000033676693,0.000009939017,0.000057023586,0.000023499832,0.8611103,0.0011634226,0.13067211,0.0068015307,0.000016879016],"about_ca_topic_score_codex":0.00089482026,"about_ca_topic_score_gemma":0.0009875374,"teacher_disagreement_score":0.007816088,"about_ca_system_score_codex":0.0004899842,"about_ca_system_score_gemma":0.0009762722,"threshold_uncertainty_score":0.026147366},"labels":[],"label_agreement":null},{"id":"W1999997491","doi":"10.1145/1462173.1462178","title":"Algorithm 890","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Benchmarking; MATLAB; Algorithm; License; Software; Compressed sensing; Software testing; Data mining; Computer engineering; Computational science; Programming language; Operating system","score_opus":0.015950903839724154,"score_gpt":0.24121376215908566,"score_spread":0.2252628583193615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999997491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005191615,0.0007148424,0.946084,0.00070271216,0.0004954842,0.00042169468,0.002557488,0.0057468736,0.038085334],"genre_scores_gemma":[0.07834856,0.0009046142,0.8388426,0.000970588,0.00030199924,0.0012260365,0.015331509,0.0030961963,0.06097787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983626,0.000313439,0.00014696839,0.00052094285,0.00049512036,0.00016096956],"domain_scores_gemma":[0.9984394,0.00041715556,0.0000654449,0.0004737428,0.00053406094,0.000070237984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386225,0.0014705186,0.0011744597,0.0018005763,0.0011077336,0.0027541993,0.0018273706,0.0018102385,0.06822247],"category_scores_gemma":[0.007167069,0.00041782987,0.001055831,0.0018947842,0.0007289435,0.0020241742,0.0026184767,0.0016315379,0.046540838],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041492135,0.00017855309,0.0011535408,0.00045314705,0.00011859778,0.00012592768,0.00010780959,0.06562675,0.0049364003,0.08480579,0.10496222,0.73711634],"study_design_scores_gemma":[0.00029667487,0.0002753415,0.00094284106,0.00020518243,0.000081226404,0.0008781124,0.00016943704,0.5771286,0.013929761,0.18424152,0.2217574,0.000093865885],"about_ca_topic_score_codex":0.0022978846,"about_ca_topic_score_gemma":0.0034852603,"teacher_disagreement_score":0.06822247,"about_ca_system_score_codex":0.0010287566,"about_ca_system_score_gemma":0.0025906505,"threshold_uncertainty_score":0.2282269},"labels":[],"label_agreement":null},{"id":"W2000047817","doi":"10.1117/12.2017919","title":"Fast Fourier sampling for ultra-wide band digital receiver applications","year":2013,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Fast Fourier transform; Sampling (signal processing); Coherent sampling; Computer science; Electronic engineering; Compressed sensing; Digital signal processing; Radar; Fourier transform; Computer hardware; Telecommunications; Algorithm; Engineering; Mathematics","score_opus":0.01347280427444089,"score_gpt":0.2241161787814785,"score_spread":0.2106433745070376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000047817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008055533,0.0015627663,0.9848546,0.00041780816,0.00013199952,0.00003195955,0.000035086872,0.00030404233,0.0046061534],"genre_scores_gemma":[0.34771684,0.0038424092,0.6410319,0.00033225858,0.00036849294,0.0000958573,0.00014046239,0.00007167797,0.006400059],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996525,0.000077362514,0.000015702812,0.000040022318,0.00019617783,0.000018196517],"domain_scores_gemma":[0.99949765,0.00023372368,0.000038081274,0.00009149809,0.00012179722,0.000017204102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000491968,0.00029444016,0.00023618467,0.0003855862,0.00022836728,0.0005809756,0.00039026048,0.000695962,0.003148907],"category_scores_gemma":[0.0017078324,0.00013804002,0.0001706066,0.0006005052,0.0004096555,0.0007239083,0.00046218839,0.0008153225,0.0010168174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002804183,0.00008878883,0.0009864344,0.00036982755,0.000035357898,0.00037493638,0.00022278188,0.033860378,0.16315979,0.12598208,0.0067426213,0.6678966],"study_design_scores_gemma":[0.000057525278,0.0003630727,0.001412269,0.00014845992,0.000037301983,0.0016543329,0.00014511452,0.75568277,0.10557634,0.05576358,0.07910802,0.00005125165],"about_ca_topic_score_codex":0.00044660372,"about_ca_topic_score_gemma":0.0005414369,"teacher_disagreement_score":0.003148907,"about_ca_system_score_codex":0.0002678217,"about_ca_system_score_gemma":0.00037488498,"threshold_uncertainty_score":0.010534167},"labels":[],"label_agreement":null},{"id":"W2000888362","doi":"10.1109/tsp.2013.2250967","title":"Social Sparsity! Neighborhood Systems Enrich Structured Shrinkage Operators","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Lasso (programming language); Thresholding; Shrinkage; Domain (mathematical analysis); Computer science; Regular polygon; Flexibility (engineering); Algorithm; Artificial intelligence; Mathematics; Mathematical optimization; Theoretical computer science; Machine learning; Statistics; Image (mathematics)","score_opus":0.015626702202060767,"score_gpt":0.2266834711919013,"score_spread":0.21105676898984052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000888362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10294576,0.0004977184,0.88073415,0.0014772189,0.00010053742,0.000038000457,0.00017775339,0.00013417631,0.013894702],"genre_scores_gemma":[0.9105863,0.0006510251,0.080411926,0.000265107,0.00022109303,0.00009491887,0.0001992852,0.00007383215,0.007496498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999469,0.00021421217,0.00001829452,0.00012394895,0.000121522804,0.00005301754],"domain_scores_gemma":[0.99842656,0.0006363229,0.000325907,0.00025741835,0.00022759788,0.000126269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000791857,0.0003600605,0.00051558844,0.00050168525,0.0005280521,0.0011566393,0.00051763473,0.0008482893,0.002693151],"category_scores_gemma":[0.0032472503,0.0002782086,0.00045375695,0.00035991397,0.0014213833,0.001854651,0.0015278071,0.0011104468,0.0004094199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000443223,0.00003098022,0.0013050253,0.00009779362,0.000034898334,0.00023533638,0.0003694045,0.054051135,0.0072872234,0.9064475,0.0026820304,0.02741431],"study_design_scores_gemma":[0.000020568115,0.00006989189,0.0013335649,0.000030690215,0.000016345402,0.00027844563,0.00023443191,0.3852602,0.0020162612,0.60246795,0.008241229,0.00003038423],"about_ca_topic_score_codex":0.0007629858,"about_ca_topic_score_gemma":0.0010277648,"teacher_disagreement_score":0.002693151,"about_ca_system_score_codex":0.00041988379,"about_ca_system_score_gemma":0.00041917033,"threshold_uncertainty_score":0.0090094805},"labels":[],"label_agreement":null},{"id":"W2002360418","doi":"10.1016/s0898-1221(00)00172-3","title":"The convergence of the Weiszfeld algorithm","year":2000,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Convergence (economics); Convergence tests; Norm (philosophy); Applied mathematics; Compact convergence; Iterative method; Algorithm; Normal convergence; Mathematical optimization; Rate of convergence; Computer science","score_opus":0.005353807827601077,"score_gpt":0.1905888270504848,"score_spread":0.1852350192228837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002360418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0325612,0.002427915,0.933627,0.0014444658,0.00038145957,0.00006041455,0.0001051374,0.00021681798,0.029175548],"genre_scores_gemma":[0.58534044,0.0050720796,0.34116855,0.00053436286,0.000530305,0.00029580988,0.0003562708,0.00042512006,0.06627708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991278,0.0003660751,0.000037388647,0.000117849566,0.0002652556,0.00008567281],"domain_scores_gemma":[0.9969073,0.0018590206,0.00017461259,0.00025079577,0.00068194035,0.00012645885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002638706,0.00077135273,0.00069202937,0.0017026148,0.0008162845,0.0019043764,0.0010982424,0.0015616674,0.004824618],"category_scores_gemma":[0.016656814,0.00042959224,0.00062664464,0.0012504279,0.0025318228,0.0026800118,0.0019297962,0.002383187,0.0017388412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018091947,0.00002859563,0.00040750657,0.00013950992,0.000030282523,0.00006564628,0.00024159052,0.07466761,0.0040096813,0.8619387,0.0034546987,0.054835264],"study_design_scores_gemma":[0.0000324298,0.00004646312,0.00031696324,0.00008321427,0.0000136176905,0.00012692109,0.00006603086,0.5273093,0.0030798458,0.46082473,0.008061328,0.000039159393],"about_ca_topic_score_codex":0.0023714257,"about_ca_topic_score_gemma":0.0016589052,"teacher_disagreement_score":0.004824618,"about_ca_system_score_codex":0.001052734,"about_ca_system_score_gemma":0.0016537547,"threshold_uncertainty_score":0.016139925},"labels":[],"label_agreement":null},{"id":"W2004337682","doi":"10.5539/jmr.v3n1p125","title":"Some More Noiseless Coding Theorem on Generalized R-Norm Entropy","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; BETA (programming language); Norm (philosophy); Entropy (arrow of time); Discrete mathematics; Physics","score_opus":0.1464761695238121,"score_gpt":0.35484167307057046,"score_spread":0.20836550354675837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004337682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012771284,0.0020009815,0.9643988,0.0020630243,0.00044831017,0.00004428234,0.0005792101,0.00018566113,0.017508486],"genre_scores_gemma":[0.54698855,0.0053518317,0.40657866,0.005598959,0.004417532,0.0005437111,0.0012409743,0.0005589299,0.028720945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795073,0.00064489915,0.00012455706,0.00041364,0.0006823814,0.0001837915],"domain_scores_gemma":[0.9933467,0.0044200616,0.00047769563,0.000996251,0.00061807,0.00014130826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036008474,0.0012456658,0.001049514,0.0021095674,0.00070697366,0.00209156,0.0015334855,0.0016136365,0.0041853827],"category_scores_gemma":[0.010363813,0.0003656404,0.0011749672,0.0018164676,0.0037685826,0.005843425,0.0024764095,0.0034672043,0.0009663777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028585324,0.0000105232575,0.0001426815,0.00007629277,0.000016208262,0.00004892876,0.0000746182,0.012741251,0.0015913529,0.9709475,0.002280892,0.012041112],"study_design_scores_gemma":[0.000013280648,0.000061700855,0.00028696394,0.000058523136,0.000014994993,0.000120258395,0.000025537769,0.094231,0.0021064293,0.8963632,0.0066785635,0.000039671348],"about_ca_topic_score_codex":0.0009007238,"about_ca_topic_score_gemma":0.0008050308,"teacher_disagreement_score":0.0041853827,"about_ca_system_score_codex":0.001673996,"about_ca_system_score_gemma":0.0008295928,"threshold_uncertainty_score":0.019043326},"labels":[],"label_agreement":null},{"id":"W2004537123","doi":"10.1109/icassp.2010.5495703","title":"Non-convex group sparsity: Application to color imaging","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Group (periodic table); Regular polygon; Combinatorics; Optimization problem; Convex optimization; Mathematics; Computer science; Algorithm; Physics; Geometry","score_opus":0.0038370569036365273,"score_gpt":0.2041594887535935,"score_spread":0.20032243184995696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004537123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016315885,0.00017960316,0.9812278,0.00041590806,0.00003598962,0.000022997292,0.000027041851,0.00012079058,0.001654055],"genre_scores_gemma":[0.39800996,0.0006195204,0.59631026,0.00025774346,0.00013733884,0.00006704872,0.00013823486,0.0001241656,0.004335643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959534,0.00016868176,0.0000112380585,0.00005841741,0.00013115081,0.000035201945],"domain_scores_gemma":[0.99878174,0.0007334373,0.000114434995,0.00012464914,0.0001840983,0.0000617284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009988811,0.0006661304,0.00068423327,0.0005280554,0.00033925875,0.00065393583,0.0006390744,0.000984158,0.0013726903],"category_scores_gemma":[0.0028409045,0.00029353373,0.00056383276,0.00065126794,0.0008607485,0.0007785451,0.0010641986,0.0010014375,0.00023603835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017396575,0.00009371208,0.0010959193,0.00016415422,0.0000724242,0.00029515626,0.00022352133,0.8444153,0.017717727,0.03675857,0.0028537237,0.096135825],"study_design_scores_gemma":[0.000004132142,0.000011450195,0.000059379523,0.0000017433963,0.0000027126841,0.000029549275,0.000009028726,0.99494946,0.0013131946,0.0032365413,0.00037965475,0.0000030995516],"about_ca_topic_score_codex":0.002687248,"about_ca_topic_score_gemma":0.002742813,"teacher_disagreement_score":0.002687248,"about_ca_system_score_codex":0.00046897115,"about_ca_system_score_gemma":0.0006265655,"threshold_uncertainty_score":0.0053432584},"labels":[],"label_agreement":null},{"id":"W2005209248","doi":"10.1080/15598608.2008.10411885","title":"On Optimal Uniform Deconvolution","year":2008,"lang":"en","type":"article","venue":"Journal of Statistical Theory and Practice","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Toronto","funders":"","keywords":"Mathematics; Deconvolution; Applied mathematics; Mathematical optimization; Statistics","score_opus":0.02169044560598648,"score_gpt":0.2880429906308096,"score_spread":0.26635254502482314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005209248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009001457,0.0052433605,0.9330047,0.0023757298,0.0007919186,0.000031248932,0.00017158876,0.00020997567,0.049170014],"genre_scores_gemma":[0.475059,0.013688203,0.41686806,0.0029531997,0.0030903697,0.00021424155,0.0007161313,0.0006248967,0.08678581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886787,0.00049992086,0.000051086987,0.00021649516,0.00027121475,0.000093399154],"domain_scores_gemma":[0.9983429,0.00096168485,0.00010149621,0.0002744815,0.00024276333,0.000076638935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023370085,0.0016763684,0.0017232249,0.0013940524,0.0007665564,0.0016005168,0.0010593034,0.0019098396,0.008527655],"category_scores_gemma":[0.008749767,0.000738144,0.0008260148,0.0014973903,0.0033793817,0.0040009944,0.004155859,0.0024656092,0.0014417637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013309927,0.000029980152,0.00013059884,0.00012628485,0.000033434404,0.000040515784,0.000062552805,0.031473562,0.0013299959,0.91065997,0.009000889,0.046979114],"study_design_scores_gemma":[0.000015829384,0.000029253744,0.00016428083,0.00005367605,0.000022951019,0.00010617819,0.00003240433,0.15701401,0.0013763449,0.8305452,0.01061873,0.00002115666],"about_ca_topic_score_codex":0.0010573348,"about_ca_topic_score_gemma":0.0009040754,"teacher_disagreement_score":0.008527655,"about_ca_system_score_codex":0.0010105853,"about_ca_system_score_gemma":0.0009287932,"threshold_uncertainty_score":0.028527915},"labels":[],"label_agreement":null},{"id":"W2005528754","doi":"10.1109/tip.2012.2188810","title":"Binned Progressive Quantization for Compressive Sensing","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Encoder; Quantization (signal processing); Computer science; Compressed sensing; Algorithm; Data compression; Decoding methods; Distributed source coding; Electronic engineering; Channel code; Engineering","score_opus":0.022318837297480583,"score_gpt":0.2708660088469465,"score_spread":0.24854717154946593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005528754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004945147,0.0020135553,0.9897127,0.00024784176,0.00011998408,0.00004923667,0.00006153575,0.00023194133,0.0026180143],"genre_scores_gemma":[0.31476134,0.0042129834,0.6750302,0.0004003372,0.00021942717,0.0001480327,0.00026475312,0.000068187095,0.0048947446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995254,0.00012723575,0.00002067391,0.00006688975,0.00024018764,0.00001952787],"domain_scores_gemma":[0.99952066,0.00023839192,0.000042420957,0.00009808098,0.00008437009,0.000016107138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060629414,0.00040638592,0.00032338285,0.0004257009,0.00020806276,0.0004804243,0.0005868085,0.00048339315,0.0022954938],"category_scores_gemma":[0.0022670017,0.00016157985,0.00018552589,0.0010270195,0.0007021945,0.000859497,0.0006869029,0.0011785317,0.0004393139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002516274,0.000050408576,0.0003663836,0.00041458086,0.000033835036,0.0001742244,0.00017465361,0.14696033,0.07001489,0.30556634,0.0054797553,0.47051302],"study_design_scores_gemma":[0.000033733166,0.00016755975,0.00040824083,0.00010586431,0.000018847273,0.00032583077,0.000048120946,0.8406967,0.02826521,0.10754539,0.022341056,0.000043321346],"about_ca_topic_score_codex":0.0011264462,"about_ca_topic_score_gemma":0.0016147869,"teacher_disagreement_score":0.0022954938,"about_ca_system_score_codex":0.00044774843,"about_ca_system_score_gemma":0.00061104755,"threshold_uncertainty_score":0.0076791644},"labels":[],"label_agreement":null},{"id":"W2006772625","doi":"10.1109/icassp.2010.5494984","title":"Color image desaturation using sparse reconstruction","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pixel; Artificial intelligence; Computer science; Channel (broadcasting); Image (mathematics); Algorithm; Range (aeronautics); Minification; Computer vision; Mathematics; Pattern recognition (psychology)","score_opus":0.014098499674140055,"score_gpt":0.22912204796473762,"score_spread":0.21502354829059755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006772625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008293077,0.00011657258,0.9901468,0.00010737797,0.000021228007,0.000026261956,0.000020855472,0.00027229902,0.0009954036],"genre_scores_gemma":[0.15619627,0.0004877964,0.83948076,0.00015595503,0.00008607302,0.000051546747,0.00015652811,0.00010770984,0.0032773518],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971014,0.00004594332,0.000013435021,0.000064978834,0.00013747574,0.000027936814],"domain_scores_gemma":[0.9994704,0.00018570626,0.00007086723,0.000104864215,0.00014133488,0.000026825212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045336375,0.00057259435,0.0005536289,0.0006515929,0.00030850418,0.000645013,0.00077634846,0.0005951157,0.0016067136],"category_scores_gemma":[0.0015316505,0.00026873406,0.0005222843,0.0006594506,0.00049600354,0.0013031662,0.00096639886,0.00084885245,0.00044876325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032488632,0.00008990788,0.0010372179,0.00018717156,0.00007286491,0.00019979928,0.00025635926,0.15718213,0.17483944,0.027696213,0.0025572928,0.63555676],"study_design_scores_gemma":[0.000023796487,0.0000683032,0.0003512323,0.000011855265,0.000026839189,0.00022838061,0.000038205922,0.9222407,0.06573113,0.006510138,0.0047485097,0.000020915002],"about_ca_topic_score_codex":0.0022535813,"about_ca_topic_score_gemma":0.0029686226,"teacher_disagreement_score":0.0022535813,"about_ca_system_score_codex":0.00047563275,"about_ca_system_score_gemma":0.00065470353,"threshold_uncertainty_score":0.005374968},"labels":[],"label_agreement":null},{"id":"W2006987799","doi":"10.1155/2014/524740","title":"Application of Compressive Sampling in Computer Based Monitoring of Power Systems","year":2014,"lang":"en","type":"article","venue":"Advances in Computer Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Compressed sensing; Nyquist–Shannon sampling theorem; Nyquist rate; Sampling (signal processing); SIGNAL (programming language); Computer science; Power (physics); Data acquisition; Sampling theory; Electronic engineering; Algorithm; Computer vision; Mathematics; Statistics; Engineering; Physics; Sample size determination","score_opus":0.0077671324847396655,"score_gpt":0.234709401332244,"score_spread":0.22694226884750432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006987799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017224707,0.034049343,0.9235537,0.001403138,0.00023496078,0.00007443039,0.000109693945,0.00026924053,0.023080865],"genre_scores_gemma":[0.70267284,0.05873946,0.23252933,0.0004511037,0.0010729822,0.000099416364,0.00015818341,0.00003414014,0.0042426507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996,0.00013084346,0.000023029132,0.00005825189,0.00017358856,0.0000143107345],"domain_scores_gemma":[0.9994105,0.00041206536,0.00004752963,0.000035533063,0.000082983795,0.000011342414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039688457,0.00030879345,0.00032605446,0.0007911824,0.00017587616,0.0006409449,0.00032844458,0.0005815479,0.0009807971],"category_scores_gemma":[0.0016633327,0.00012860965,0.00018645336,0.0012970157,0.00050439726,0.00060230534,0.0004523111,0.0005322445,0.00021749175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009244755,0.000055768942,0.0020903305,0.0008779658,0.00005510444,0.00044118884,0.00026472443,0.21549805,0.02333367,0.11159794,0.0041218437,0.6415711],"study_design_scores_gemma":[0.00001715106,0.0002618737,0.0031619947,0.0003474599,0.000047456368,0.00091388,0.0001870164,0.8032132,0.01907857,0.108885854,0.06382367,0.00006187495],"about_ca_topic_score_codex":0.0008328969,"about_ca_topic_score_gemma":0.00065560883,"teacher_disagreement_score":0.0009807971,"about_ca_system_score_codex":0.0003252739,"about_ca_system_score_gemma":0.00028398706,"threshold_uncertainty_score":0.0032810569},"labels":[],"label_agreement":null},{"id":"W2009394266","doi":"10.1007/s11081-008-9072-0","title":"Sensor Network Localization, Euclidean Distance Matrix completions, and graph realization","year":2008,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Euclidean distance; Mathematical optimization; Euclidean distance matrix; Relaxation (psychology); Euclidean geometry; Graph; Matrix (chemical analysis); Realization (probability); Stability (learning theory); Quadratic equation; Low-rank approximation; Approximation algorithm; Algorithm; Computer science; Combinatorics; Tensor (intrinsic definition); Geometry","score_opus":0.008924183446798219,"score_gpt":0.19450713792148394,"score_spread":0.18558295447468573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009394266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059676897,0.00057688204,0.99114007,0.0004214679,0.000048257425,0.0000123113305,0.00009130007,0.00012044176,0.0016215598],"genre_scores_gemma":[0.5919951,0.004993901,0.38964555,0.00042145766,0.00062606286,0.00024509773,0.0010251584,0.00020406276,0.010843599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990706,0.00036750396,0.000028935745,0.00022228935,0.00025552354,0.000055276712],"domain_scores_gemma":[0.99735487,0.0015525318,0.00040458675,0.0003245429,0.0002853334,0.000078082245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010256877,0.0009001001,0.0011058421,0.0010673084,0.0004444587,0.0009973034,0.0011728951,0.0010212965,0.0019465728],"category_scores_gemma":[0.0067691323,0.00048875523,0.0004999314,0.0020586213,0.0020810072,0.0026529864,0.0013402228,0.0020925037,0.00047963383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012703746,0.000050859755,0.0005664255,0.00020452373,0.000055128665,0.000080345715,0.000120085,0.42527416,0.002285291,0.48723042,0.0056317775,0.078373924],"study_design_scores_gemma":[0.000015127828,0.000027655473,0.000280118,0.000018450597,0.0000094646575,0.00006840084,0.000039169205,0.6934846,0.00052952213,0.3034165,0.0020922525,0.000018843662],"about_ca_topic_score_codex":0.0041011227,"about_ca_topic_score_gemma":0.003394973,"teacher_disagreement_score":0.0041011227,"about_ca_system_score_codex":0.0006716045,"about_ca_system_score_gemma":0.00086597237,"threshold_uncertainty_score":0.008154511},"labels":[],"label_agreement":null},{"id":"W2009603062","doi":"10.1109/icassp.2013.6637799","title":"Exploiting sparsity and rank-deficiency in dynamic MRI reconstruction","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund","keywords":"Norm (philosophy); Iterative reconstruction; Matrix norm; Optimization problem; Low-rank approximation; Compressed sensing; Rank (graph theory); Algorithm; Dynamic contrast-enhanced MRI; Minification; Computer science; Mathematical optimization; Mathematics; Combinatorics; Artificial intelligence; Pure mathematics","score_opus":0.007459112383276614,"score_gpt":0.18987462055356488,"score_spread":0.18241550817028826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009603062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00473182,0.00008468468,0.9946668,0.00010374647,0.000008035058,0.000010712791,0.000020192505,0.00011235162,0.00026168715],"genre_scores_gemma":[0.1285329,0.000540842,0.86828154,0.00013491946,0.00006014278,0.000063971784,0.00027425546,0.0001534877,0.0019578373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992526,0.0002734128,0.000043284075,0.00012738263,0.00025335426,0.000049975126],"domain_scores_gemma":[0.99813384,0.0011134519,0.00020589767,0.00026066878,0.00022203053,0.00006421099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016917484,0.00077500794,0.0009847245,0.0005791172,0.0003498007,0.00084249466,0.00095085864,0.0011186576,0.0010423056],"category_scores_gemma":[0.005239349,0.00066446594,0.00063354854,0.00064974657,0.0010922727,0.0018917631,0.0014054518,0.0011274575,0.0005716455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047021944,0.00010539891,0.0011715001,0.00045888286,0.00010124638,0.00039669414,0.0003127273,0.5727272,0.07972502,0.06417616,0.0041832733,0.2761717],"study_design_scores_gemma":[0.000014229069,0.000048593643,0.00018253029,0.000010010054,0.000008843832,0.00019796325,0.000019615323,0.9760282,0.011579273,0.010145423,0.0017446554,0.00002075192],"about_ca_topic_score_codex":0.0014617627,"about_ca_topic_score_gemma":0.0018764365,"teacher_disagreement_score":0.0016917484,"about_ca_system_score_codex":0.0003703107,"about_ca_system_score_gemma":0.0011062536,"threshold_uncertainty_score":0.008946896},"labels":[],"label_agreement":null},{"id":"W2010181911","doi":"10.1364/oe.18.021003","title":"Rapid Volumetric OCT Image Acquisition Using Compressive Sampling","year":2010,"lang":"en","type":"article","venue":"Optics Express","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research; Michael Smith Health Research BC","keywords":"Optical coherence tomography; Image quality; Compressed sensing; Computer vision; Computer science; Artificial intelligence; Iterative reconstruction; Sampling (signal processing); Data acquisition; Image processing; Optics; Image (mathematics); Physics","score_opus":0.02773417782651211,"score_gpt":0.263534208529478,"score_spread":0.2358000307029659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010181911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07212375,0.00029285694,0.9225548,0.00031852015,0.000041869785,0.0001606604,0.00030312644,0.0010836684,0.003120791],"genre_scores_gemma":[0.30039516,0.0004675187,0.69703984,0.00012668523,0.000048503687,0.00020237836,0.0004100034,0.00009984718,0.0012101657],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997677,0.000054637483,0.000013368081,0.000026149732,0.000118323835,0.00001981694],"domain_scores_gemma":[0.9993844,0.00022662527,0.0000758214,0.0001348152,0.00014615989,0.00003216594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065731,0.0003979317,0.00024252193,0.00068686134,0.00018103051,0.0005535036,0.00034378245,0.0003818148,0.001762035],"category_scores_gemma":[0.0014565276,0.0002598411,0.00019612952,0.0005429602,0.00027984762,0.00063858187,0.00074328267,0.0005283217,0.00044430897],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042450996,0.00010386548,0.0011769305,0.00017051157,0.000034317018,0.00027244192,0.0001641565,0.052164022,0.58840084,0.0069760024,0.0034145436,0.346698],"study_design_scores_gemma":[0.0000628504,0.00029685043,0.0024414433,0.000042007166,0.000023350764,0.0011208617,0.00008883086,0.7354961,0.24585955,0.006245351,0.008243888,0.00007886056],"about_ca_topic_score_codex":0.0011583301,"about_ca_topic_score_gemma":0.0017663243,"teacher_disagreement_score":0.001762035,"about_ca_system_score_codex":0.00026652133,"about_ca_system_score_gemma":0.00050523935,"threshold_uncertainty_score":0.0058946013},"labels":[],"label_agreement":null},{"id":"W2010194014","doi":"10.4028/www.scientific.net/amm.347-350.327","title":"Ultrasonic Phased Array Industrial Imaging with Sub-Nyquist Sampling Rate","year":2013,"lang":"en","type":"article","venue":"Applied Mechanics and Materials","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China; fRI Research","keywords":"Phased array; Nyquist–Shannon sampling theorem; Sampling (signal processing); Nyquist rate; SIGNAL (programming language); Phased-array optics; Nyquist frequency; Ultrasonic sensor; Acoustics; Electronic engineering; Transducer; Phased array ultrasonics; Noise (video); Computer science; Engineering; Physics; Telecommunications; Computer vision; Bandwidth (computing)","score_opus":0.017072517444464138,"score_gpt":0.2023617789958101,"score_spread":0.18528926155134595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010194014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052234735,0.00018765155,0.99323696,0.00008218735,0.000023488576,0.00001367801,0.000025939104,0.00018943542,0.0010172471],"genre_scores_gemma":[0.35780427,0.0009822197,0.63730514,0.00016295399,0.00010063403,0.00013381954,0.00024606983,0.00007987332,0.0031850867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991505,0.00017509832,0.00003882265,0.00012641819,0.0004656264,0.000043571203],"domain_scores_gemma":[0.99933076,0.00027571962,0.00007965534,0.00014147653,0.00015037035,0.000022058653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073610083,0.00050362904,0.00049763784,0.0004802125,0.00019502146,0.00051711395,0.0005789986,0.0006133725,0.0009842737],"category_scores_gemma":[0.0021474692,0.00023915955,0.00038100922,0.00070217106,0.00053916627,0.001344626,0.00044620986,0.0007996461,0.00039566116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005784878,0.00011637213,0.00283695,0.0004631366,0.000077624936,0.00023478479,0.00034474483,0.18095693,0.19358543,0.14333704,0.003208185,0.4742603],"study_design_scores_gemma":[0.000016434844,0.0000933358,0.00048517133,0.000010688116,0.0000123480695,0.0001901655,0.000017702914,0.95780134,0.027926695,0.008649136,0.004777442,0.000019606367],"about_ca_topic_score_codex":0.0010355529,"about_ca_topic_score_gemma":0.0009190325,"teacher_disagreement_score":0.0010355529,"about_ca_system_score_codex":0.0005419651,"about_ca_system_score_gemma":0.0004522624,"threshold_uncertainty_score":0.003932297},"labels":[],"label_agreement":null},{"id":"W2011050789","doi":"10.1109/embc.2012.6346933","title":"Saliency-guided compressive fluorescence microscopy","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Microscopy; Fluorescence microscope; Compressed sensing; Fluorescence; Materials science; Fluorescence-lifetime imaging microscopy; Sampling (signal processing); Optical microscope; Biomedical engineering; Computer science; Artificial intelligence; Computer vision; Optics; Physics; Scanning electron microscope; Composite material; Medicine","score_opus":0.021609262111854582,"score_gpt":0.26539838602833704,"score_spread":0.24378912391648247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011050789","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030969687,0.00025348636,0.9665005,0.0001729588,0.000029712712,0.000038635553,0.000039023187,0.000417604,0.0015782877],"genre_scores_gemma":[0.6050832,0.00031470385,0.3923707,0.00015114495,0.00006932854,0.000082216146,0.00011948913,0.000065391396,0.001743803],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982613,0.000029179957,0.00000540426,0.000030612136,0.00008989046,0.000018831717],"domain_scores_gemma":[0.99961495,0.00014738238,0.00006212493,0.000040111332,0.000101982434,0.00003341234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391046,0.0004405513,0.00036993594,0.00036923657,0.00025562375,0.0002960779,0.0006079806,0.00043415267,0.0009999254],"category_scores_gemma":[0.0011016983,0.00021480107,0.00019228562,0.0002174621,0.0004412151,0.00067777466,0.00082927744,0.00037852384,0.00021115609],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040405727,0.0000740139,0.0008484348,0.00026711842,0.00003730985,0.00027728162,0.00023131078,0.090350434,0.653406,0.014451649,0.002766881,0.23688552],"study_design_scores_gemma":[0.0000295416,0.00015573188,0.0007030812,0.000011227204,0.000012646135,0.0003186991,0.00002904989,0.9124865,0.077997014,0.005102382,0.0031241497,0.000029991535],"about_ca_topic_score_codex":0.0012577125,"about_ca_topic_score_gemma":0.0019044616,"teacher_disagreement_score":0.0012577125,"about_ca_system_score_codex":0.00038022295,"about_ca_system_score_gemma":0.00050092716,"threshold_uncertainty_score":0.0033450723},"labels":[],"label_agreement":null},{"id":"W2011195124","doi":"10.1109/waina.2013.215","title":"Network Topology Inference from End-to-End Unicast Measurements","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Network tomography; Unicast; Topology (electrical circuits); Network topology; Computer science; Logical topology; Inference; Scheme (mathematics); Identification (biology); TRACE (psycholinguistics); Process (computing); Computer network; Mathematics; Artificial intelligence; Multicast","score_opus":0.05293574474959043,"score_gpt":0.25665338510214,"score_spread":0.20371764035254955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011195124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07049561,0.0000886872,0.9281887,0.00009158415,0.000017204115,0.000029335099,0.000067825,0.0003756347,0.00064547564],"genre_scores_gemma":[0.7897906,0.00024295424,0.2087878,0.000048871687,0.00003551116,0.000058568112,0.00034390003,0.000048577134,0.00064328226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993018,0.00019040519,0.000038275426,0.00011805931,0.0003016162,0.000049881357],"domain_scores_gemma":[0.99673444,0.0018043303,0.0004702872,0.000606095,0.00031758362,0.00006717077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699523,0.0005979033,0.00062878913,0.0008570228,0.00039756275,0.0006527295,0.0011017392,0.0007641205,0.0004982644],"category_scores_gemma":[0.008686815,0.00038929717,0.00024026803,0.00076045975,0.00053088943,0.0022704222,0.001020705,0.0011549873,0.00020956655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074986235,0.00026312817,0.007778451,0.00020346712,0.00010212263,0.00041548559,0.0004592769,0.6250943,0.077591956,0.014936089,0.0012606343,0.2711453],"study_design_scores_gemma":[0.000012273484,0.00007049396,0.0011731181,0.000010235231,0.000009799665,0.00021472796,0.00007591969,0.9732159,0.017675756,0.0070307823,0.0004965234,0.000014466498],"about_ca_topic_score_codex":0.001013628,"about_ca_topic_score_gemma":0.0013646985,"teacher_disagreement_score":0.0011017392,"about_ca_system_score_codex":0.00033170305,"about_ca_system_score_gemma":0.00038306823,"threshold_uncertainty_score":0.004071951},"labels":[],"label_agreement":null},{"id":"W2011790463","doi":"10.1109/icc.2012.6364058","title":"Reconstruction of jointly sparse signals using iterative hard thresholding","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Compressed sensing; Thresholding; Computer science; Minification; Algorithm; Greedy algorithm; Iterative method; Computational complexity theory; Artificial intelligence; Image (mathematics)","score_opus":0.06083940311376699,"score_gpt":0.2631701805730666,"score_spread":0.20233077745929964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011790463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004380289,0.00008024443,0.99468994,0.000079486505,0.000014652909,0.000011941417,0.000017993589,0.00012699558,0.000598417],"genre_scores_gemma":[0.13724548,0.00029895987,0.8599936,0.00009215821,0.00006619289,0.000091867405,0.00017189643,0.00008640232,0.0019534216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985752,0.0003885749,0.00009112085,0.00022514653,0.0006169577,0.00010296003],"domain_scores_gemma":[0.99698883,0.0018183726,0.00031206492,0.0004225082,0.00038329844,0.000074947595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016844759,0.00091844075,0.0013354123,0.0008842975,0.00035312353,0.0012260111,0.00095810235,0.0013149556,0.0012716408],"category_scores_gemma":[0.008633874,0.00063217815,0.001055481,0.0013532857,0.0010934679,0.0018286643,0.001866918,0.001779428,0.00056482037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030578006,0.0000640425,0.0010378408,0.00018695899,0.00013001353,0.00025080502,0.0002657725,0.65555733,0.028707592,0.05349413,0.0027736907,0.25722605],"study_design_scores_gemma":[0.00001325616,0.000022966382,0.000112892485,0.000008012909,0.000007648356,0.000075863805,0.000012946773,0.9842275,0.0040550935,0.010741418,0.00071079226,0.00001159905],"about_ca_topic_score_codex":0.0014421819,"about_ca_topic_score_gemma":0.0015505893,"teacher_disagreement_score":0.0016844759,"about_ca_system_score_codex":0.00051535264,"about_ca_system_score_gemma":0.0011446341,"threshold_uncertainty_score":0.008908451},"labels":[],"label_agreement":null},{"id":"W2012483518","doi":"10.1016/j.cam.2014.12.011","title":"Vectorial additive half-quadratic minimization for isotropic regularization","year":2014,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Rate of convergence; Stationary point; Regularization (linguistics); Quadratic equation; Fast Fourier transform; Applied mathematics; Mathematical optimization; Convex function; Minification; Convergence (economics); Regular polygon; Algorithm; Mathematical analysis; Geometry; Computer science","score_opus":0.009055277754323118,"score_gpt":0.21361382407242335,"score_spread":0.20455854631810022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012483518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016177362,0.00012364492,0.996852,0.00013574999,0.000034263612,0.000008415241,0.000029124583,0.000054096676,0.001145004],"genre_scores_gemma":[0.1347022,0.00069522695,0.85162807,0.0003045187,0.00017154994,0.00015342596,0.00034926232,0.00031693093,0.011678814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993476,0.00024546802,0.00003231425,0.00007665069,0.00026440996,0.00003357126],"domain_scores_gemma":[0.9988624,0.00066095067,0.00006840669,0.00014373126,0.00021943734,0.000045105233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958585,0.0008889219,0.0009935143,0.00043933757,0.00031862926,0.0008048371,0.0013681888,0.0014874104,0.0025614824],"category_scores_gemma":[0.0034633412,0.0004607816,0.00056270533,0.00080634403,0.0010179005,0.001226535,0.0018658201,0.0020874983,0.0007619809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016728042,0.00015727794,0.00041242735,0.00056100765,0.00012933556,0.00015607008,0.00022310406,0.46970004,0.016684901,0.2608313,0.01688318,0.23409413],"study_design_scores_gemma":[0.0000064146466,0.000022129632,0.000050099472,0.000008597059,0.0000074341333,0.00004023468,0.00001565934,0.97238916,0.0009748881,0.024737172,0.0017400015,0.000008145402],"about_ca_topic_score_codex":0.0016548376,"about_ca_topic_score_gemma":0.0024580446,"teacher_disagreement_score":0.0025614824,"about_ca_system_score_codex":0.00035490992,"about_ca_system_score_gemma":0.0007863288,"threshold_uncertainty_score":0.008569002},"labels":[],"label_agreement":null},{"id":"W2014217675","doi":"10.1109/ccece.2013.6567719","title":"Exploiting rank deficiency for MR image reconstruction from multiple partial K-space scans","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"k-space; Iterative reconstruction; Computer vision; Artificial intelligence; Compressed sensing; Computer science; Fourier transform; Algorithm; Mathematics; Mathematical analysis","score_opus":0.016624215159195994,"score_gpt":0.21358999389039887,"score_spread":0.19696577873120288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014217675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014878966,0.00030406515,0.98363113,0.000181923,0.000021263017,0.000016287318,0.000041539,0.00017418149,0.00075071404],"genre_scores_gemma":[0.17850032,0.00078302075,0.8174452,0.000111272544,0.000047970043,0.00005308898,0.00028636353,0.000101675745,0.002671057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995832,0.00013770822,0.000020632084,0.000042341075,0.00019100943,0.000025161393],"domain_scores_gemma":[0.99920005,0.00045562116,0.000081817016,0.0001116092,0.000115869865,0.00003504011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000813591,0.0006523056,0.00057564856,0.0004986395,0.00021077169,0.0005250118,0.0003937178,0.0006462461,0.0012635497],"category_scores_gemma":[0.0027987703,0.00029250619,0.0004274517,0.0005452421,0.0006451833,0.000910819,0.0007864048,0.00064394827,0.0005168247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095875375,0.000101218386,0.0016069433,0.0007887855,0.00012057143,0.0008181845,0.00047521724,0.30732366,0.1511576,0.06983871,0.0055033453,0.46130702],"study_design_scores_gemma":[0.000022479078,0.00011328588,0.00029550883,0.00002016582,0.000011462865,0.00062233605,0.000037858004,0.96132034,0.01931562,0.014320583,0.0038907633,0.000029675155],"about_ca_topic_score_codex":0.0010610598,"about_ca_topic_score_gemma":0.0011315256,"teacher_disagreement_score":0.0012635497,"about_ca_system_score_codex":0.00020371463,"about_ca_system_score_gemma":0.00052559184,"threshold_uncertainty_score":0.00430274},"labels":[],"label_agreement":null},{"id":"W2014752278","doi":"10.1016/j.bspc.2015.02.016","title":"Neural signal compression using a minimum Euclidean or Manhattan distance cluster-based deterministic compressed sensing matrix","year":2015,"lang":"en","type":"article","venue":"Biomedical Signal Processing and Control","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; McGill University","keywords":"Compressed sensing; Restricted isometry property; Computer science; Matrix (chemical analysis); Algorithm; Euclidean distance; SIGNAL (programming language); Signal reconstruction; Signal compression; Signal processing; Artificial intelligence; Telecommunications","score_opus":0.030642238320305454,"score_gpt":0.27984296677817944,"score_spread":0.24920072845787397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014752278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014948205,0.00012305002,0.9830888,0.0002560831,0.00004894979,0.000030568815,0.00008400338,0.00012978427,0.0012905762],"genre_scores_gemma":[0.450266,0.0003477409,0.54500574,0.0001837228,0.00012550004,0.00009869021,0.00029579393,0.00006253797,0.003614315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944884,0.00012874657,0.00002713012,0.00013649669,0.00022815337,0.00003053808],"domain_scores_gemma":[0.99931824,0.0002437997,0.00008093511,0.00013395557,0.00019073127,0.0000324488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186996,0.00044196058,0.0004713282,0.00049252214,0.00038140552,0.0006100176,0.0008577225,0.00072126236,0.0012253176],"category_scores_gemma":[0.0025966947,0.0001892316,0.0003639001,0.0007936368,0.00074650865,0.00094296585,0.00072773243,0.0006924777,0.00029400171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004816008,0.00011667584,0.0008670893,0.00018364895,0.000079488724,0.00014324136,0.00014125023,0.6337401,0.04491632,0.10768988,0.0035982518,0.20804238],"study_design_scores_gemma":[0.0000067357646,0.000047064288,0.00020632276,0.000005779543,0.0000060582033,0.00005866402,0.000009698798,0.9891266,0.005135885,0.004720438,0.0006639924,0.000012777653],"about_ca_topic_score_codex":0.0030195867,"about_ca_topic_score_gemma":0.0038360276,"teacher_disagreement_score":0.0030195867,"about_ca_system_score_codex":0.0006198286,"about_ca_system_score_gemma":0.000918023,"threshold_uncertainty_score":0.0060040355},"labels":[],"label_agreement":null},{"id":"W2018214963","doi":"10.1109/lsp.2013.2281597","title":"Deterministic Construction of Real-Valued Ternary Sensing Matrices Using Optical Orthogonal Codes","year":2013,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Golomb coding; Hadamard transform; Normalization (sociology); Binary number; Algorithm; Matrix (chemical analysis); Hadamard matrix; Computer science; Complex Hadamard matrix; Ternary operation; Sparse matrix; Mathematics; Theoretical computer science; Arithmetic; Image (mathematics); Image processing; Image compression; Artificial intelligence","score_opus":0.01800034238972296,"score_gpt":0.2396329377314017,"score_spread":0.22163259534167876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018214963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06444027,0.0004403458,0.92518,0.00023528609,0.00017655254,0.000089556816,0.00009745677,0.0002422415,0.009098279],"genre_scores_gemma":[0.6106858,0.00046412353,0.3852158,0.00021014265,0.000102930295,0.00015960773,0.00015255652,0.000055061526,0.0029539973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951017,0.00009384165,0.000028333765,0.00008283794,0.00022582033,0.000059059395],"domain_scores_gemma":[0.9993431,0.00019048626,0.00014033231,0.0001347645,0.00014140854,0.00004989731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004116318,0.0004181239,0.00028992884,0.00057394913,0.0003366959,0.000617798,0.00043082167,0.00042377244,0.0011877624],"category_scores_gemma":[0.0015120619,0.00020712178,0.00026826534,0.0004637997,0.00069851754,0.0007524642,0.00068788783,0.0005816899,0.00034322636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021641812,0.00008190369,0.00056538073,0.0001987916,0.000026714424,0.00030908198,0.00021690784,0.048322517,0.16121916,0.66058975,0.0016270896,0.12662624],"study_design_scores_gemma":[0.00009107414,0.00050421694,0.0005535079,0.00006999511,0.000029339306,0.0009903716,0.00011512432,0.6042405,0.25093016,0.11463164,0.027711622,0.00013246092],"about_ca_topic_score_codex":0.000339399,"about_ca_topic_score_gemma":0.0005156956,"teacher_disagreement_score":0.0011877624,"about_ca_system_score_codex":0.00043512712,"about_ca_system_score_gemma":0.00062520365,"threshold_uncertainty_score":0.003973484},"labels":[],"label_agreement":null},{"id":"W2019717466","doi":"10.1109/icassp.2010.5495429","title":"Compressive sensing with modified Total Variation minimization algorithm","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compressed sensing; Minification; Algorithm; Computer science; Discrete cosine transform; Image (mathematics); Mathematical optimization; Image compression; Set (abstract data type); Optimization problem; Iterative reconstruction; Mathematics; Image processing; Artificial intelligence","score_opus":0.006673967963741379,"score_gpt":0.19495927021970266,"score_spread":0.1882853022559613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019717466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002379893,0.00014451372,0.99659204,0.00006999926,0.000024964766,0.000020390422,0.000015544292,0.000072373994,0.00068038993],"genre_scores_gemma":[0.16939986,0.00065258204,0.8250855,0.00018805047,0.00014367777,0.00022650619,0.00025313575,0.00007919278,0.0039713993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991437,0.0002471388,0.000037267357,0.00012341706,0.0004058313,0.00004267515],"domain_scores_gemma":[0.9995472,0.00023092868,0.000043071886,0.00004520547,0.00011665066,0.000017014892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068323896,0.00064787356,0.00080670527,0.0004246807,0.0002000398,0.00059820875,0.00097083906,0.0010122451,0.0012348396],"category_scores_gemma":[0.0019650448,0.00027364574,0.00053386914,0.0006782913,0.00050263247,0.00086761295,0.00077781023,0.0008972316,0.00036496096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022260608,0.000075740936,0.0003626589,0.000268232,0.000106787185,0.00018693128,0.00009699366,0.5697855,0.03664143,0.055007137,0.0044482467,0.33279783],"study_design_scores_gemma":[0.000011561816,0.000048074693,0.000066950946,0.0000063857724,0.0000063529346,0.00006616168,0.0000045988586,0.9921301,0.0031978905,0.0030243152,0.001428941,0.0000086896125],"about_ca_topic_score_codex":0.0012088629,"about_ca_topic_score_gemma":0.0010963425,"teacher_disagreement_score":0.0012348396,"about_ca_system_score_codex":0.00033857135,"about_ca_system_score_gemma":0.000615349,"threshold_uncertainty_score":0.0041309},"labels":[],"label_agreement":null},{"id":"W2020122740","doi":"10.3390/s140915729","title":"A Low-Rank Matrix Recovery Approach for Energy Efficient EEG Acquisition for a Wireless Body Area Network","year":2014,"lang":"en","type":"article","venue":"Sensors","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Energy (signal processing); Computer science; Compressed sensing; Transmission (telecommunications); Sampling (signal processing); Wireless sensor network; Matrix (chemical analysis); SIGNAL (programming language); Wireless; Body area network; Real-time computing; Signal processing; Power (physics); Algorithm; Computer hardware; Telecommunications; Digital signal processing; Computer network; Mathematics; Statistics; Detector","score_opus":0.008327967309131993,"score_gpt":0.21130374504909824,"score_spread":0.20297577773996625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020122740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029620011,0.000083700914,0.99616724,0.00011018385,0.000013232274,0.000019647106,0.000018361488,0.000090744004,0.000534897],"genre_scores_gemma":[0.14730111,0.00058488484,0.8475365,0.000123496,0.00012361558,0.00012644571,0.00013215806,0.000075381155,0.003996362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978524,0.000049636074,0.000010568342,0.000038045255,0.00009908531,0.000017392193],"domain_scores_gemma":[0.99971575,0.0001340403,0.00003555449,0.000036633715,0.00006249172,0.000015602829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035506574,0.0005563304,0.0004427867,0.00035304527,0.00025058855,0.00041898497,0.00051287276,0.00052946457,0.0031166864],"category_scores_gemma":[0.0012644582,0.00020643823,0.00039453234,0.00053804304,0.0004580827,0.0007135182,0.0006001685,0.0008724237,0.00063745363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020026269,0.00016638832,0.0004382977,0.0003351267,0.000064263375,0.00024671087,0.00020590045,0.44903567,0.07636707,0.04323637,0.0052126385,0.4244913],"study_design_scores_gemma":[0.000009889507,0.00006256462,0.00008895576,0.000005466669,0.000007126896,0.00007608572,0.000014230519,0.9890694,0.0059342515,0.003116046,0.0016082136,0.000007862145],"about_ca_topic_score_codex":0.0015355041,"about_ca_topic_score_gemma":0.0026760497,"teacher_disagreement_score":0.0031166864,"about_ca_system_score_codex":0.00025853928,"about_ca_system_score_gemma":0.0006845868,"threshold_uncertainty_score":0.010426402},"labels":[],"label_agreement":null},{"id":"W2020262269","doi":"10.1109/tw.2013.060413.121184","title":"Multiple Access and Data Reconstruction in Wireless Sensor Networks Based on Compressed Sensing","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Compressed sensing; Computer science; Wireless sensor network; Transmission (telecommunications); Spatial correlation; Signal reconstruction; Throughput; Data transmission; Wireless; Physical layer; Noise (video); Real-time computing; Computer network; Algorithm; Signal processing; Artificial intelligence; Telecommunications","score_opus":0.05166800874709377,"score_gpt":0.27919174001030816,"score_spread":0.2275237312632144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020262269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026171397,0.002211585,0.96844816,0.00052228256,0.000060714297,0.00004780669,0.00002815126,0.00009236606,0.0024174885],"genre_scores_gemma":[0.81309575,0.00410585,0.17993414,0.00017672966,0.00027242448,0.00012836467,0.00007594933,0.000018304083,0.0021924383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922097,0.00030919054,0.00003003394,0.000069493646,0.00032576435,0.000044584685],"domain_scores_gemma":[0.9988217,0.0008497183,0.00011093694,0.00009330928,0.00010183019,0.00002252587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008154072,0.00040766285,0.00048673118,0.00045104013,0.00029058332,0.0005845039,0.0005543782,0.00067344913,0.00049050635],"category_scores_gemma":[0.0028842937,0.00017787043,0.00025894042,0.0008730486,0.00093829655,0.0010634237,0.0007313218,0.0006659009,0.00009293371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028859643,0.00010349905,0.0011248165,0.0004605565,0.000092833645,0.00048025453,0.0003598026,0.6136475,0.027942205,0.1607437,0.0019937772,0.19276252],"study_design_scores_gemma":[0.0000132885925,0.00008036295,0.0001485119,0.000016473037,0.000010430853,0.00015550562,0.000029652907,0.98086846,0.0032304265,0.014325877,0.0011103807,0.000010693254],"about_ca_topic_score_codex":0.0013525165,"about_ca_topic_score_gemma":0.0010819291,"teacher_disagreement_score":0.0013525165,"about_ca_system_score_codex":0.00038645684,"about_ca_system_score_gemma":0.0005374833,"threshold_uncertainty_score":0.0043123364},"labels":[],"label_agreement":null},{"id":"W2020538086","doi":"10.1109/tip.2012.2208979","title":"Efficient Algorithm for Nonconvex Minimization and Its Application to PM Regularization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Regularization (linguistics); Algorithm; Mathematics; Computation; Convex function; Minification; Mathematical optimization; Rate of convergence; Convergence (economics); Iterative method; Regular polygon; Computer science; Channel (broadcasting); Artificial intelligence","score_opus":0.011356763140976311,"score_gpt":0.24759619813366068,"score_spread":0.23623943499268438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020538086","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012741573,0.00008259618,0.9980483,0.000054306318,0.000015092174,0.000015363474,0.0000046603272,0.000039876926,0.00046566242],"genre_scores_gemma":[0.08010696,0.00032878297,0.9161208,0.00007849413,0.000050216793,0.000172618,0.000056376914,0.000081937156,0.0030037637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.00018089873,0.000024345914,0.000056858724,0.00016669113,0.00002927685],"domain_scores_gemma":[0.9993793,0.00031130994,0.000053568718,0.0001095379,0.00012492215,0.000021277481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010921276,0.00078013475,0.0006735191,0.000687041,0.0003916419,0.00049171294,0.00095348724,0.0009979783,0.0018470787],"category_scores_gemma":[0.002802299,0.0003367044,0.00059098523,0.00090540247,0.00083764736,0.0008668611,0.0014924642,0.0012065655,0.0004304192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013990064,0.00007745553,0.00048766925,0.0002561632,0.00006256625,0.00017391633,0.00021773539,0.53185046,0.019228756,0.15920284,0.0033304049,0.28497213],"study_design_scores_gemma":[0.000009569282,0.000024865207,0.000058335438,0.000006471363,0.000003295765,0.00005220759,0.0000058307373,0.98557043,0.0021401546,0.010506201,0.0016161748,0.0000063954753],"about_ca_topic_score_codex":0.0011449237,"about_ca_topic_score_gemma":0.0013024216,"teacher_disagreement_score":0.0018470787,"about_ca_system_score_codex":0.00046574906,"about_ca_system_score_gemma":0.0008316324,"threshold_uncertainty_score":0.006179154},"labels":[],"label_agreement":null},{"id":"W2021151186","doi":"10.1109/icip.2012.6467006","title":"Compressed sensing based image formation of SAR/ISAR data in presence of basis mismatch","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Inverse synthetic aperture radar; Synthetic aperture radar; Computer science; Basis (linear algebra); Matching pursuit; Compressed sensing; Artificial intelligence; Radar imaging; Basis pursuit; Image formation; Computer vision; Iterative reconstruction; Radar; Algorithm; Image (mathematics); Mathematics; Telecommunications","score_opus":0.042116233200817976,"score_gpt":0.2676755195768359,"score_spread":0.2255592863760179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021151186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49346772,0.00032519782,0.50224453,0.00034173045,0.000051375977,0.00006695338,0.0000809742,0.00021837256,0.0032032363],"genre_scores_gemma":[0.8731821,0.00014810028,0.12539853,0.00005330045,0.0000234267,0.000023773526,0.0001408749,0.000025880347,0.0010039314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995659,0.000108637054,0.000015445938,0.00004256508,0.00023973212,0.000027597038],"domain_scores_gemma":[0.999032,0.0004880747,0.00016440976,0.0001344111,0.00014324437,0.000037724447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005776671,0.00026867105,0.0003382149,0.00025022397,0.00018693399,0.00029548712,0.00023849054,0.0003964977,0.0003914993],"category_scores_gemma":[0.0022919201,0.00013464104,0.00016630118,0.00021992403,0.00061769143,0.0005397443,0.00050915964,0.00033517784,0.0000892658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008564183,0.00013697767,0.0043406533,0.0002215281,0.000063565814,0.00092535396,0.00043350435,0.60877234,0.26628226,0.020561025,0.00067836326,0.09672803],"study_design_scores_gemma":[0.000018435148,0.00014566327,0.002005304,0.00000771174,0.000010013769,0.0004724342,0.000058801055,0.94346714,0.05021717,0.0027366618,0.0008442984,0.000016322763],"about_ca_topic_score_codex":0.0007501738,"about_ca_topic_score_gemma":0.00055444107,"teacher_disagreement_score":0.0007501738,"about_ca_system_score_codex":0.00018462447,"about_ca_system_score_gemma":0.00022974361,"threshold_uncertainty_score":0.003055036},"labels":[],"label_agreement":null},{"id":"W2021757605","doi":"10.1162/neco_a_00546","title":"Improved Sparse Coding Under the Influence of Perceptual Attention","year":2013,"lang":"en","type":"article","venue":"Neural Computation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Neural coding; Computer science; Perception; Sparse approximation; Coding (social sciences); Artificial intelligence; Context (archaeology); Filter (signal processing); Perceptual system; Bayesian probability; Machine learning; Computer vision; Psychology; Mathematics","score_opus":0.01974397791492013,"score_gpt":0.23961799916887305,"score_spread":0.21987402125395292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021757605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06876878,0.0004500604,0.92315114,0.000780803,0.00009169563,0.000027016373,0.000048459755,0.00026677965,0.006415382],"genre_scores_gemma":[0.75208867,0.0007714937,0.24166408,0.00052448217,0.00024487503,0.000058981568,0.00011194837,0.00012612216,0.004409344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994661,0.00015182112,0.000020437332,0.00009023809,0.00019928475,0.00007203752],"domain_scores_gemma":[0.9974273,0.0017337999,0.00015188089,0.0003012233,0.00030609855,0.00007977156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011154541,0.0004765,0.0005244164,0.00046449216,0.00029777217,0.00067308504,0.0007559983,0.0008224028,0.0014916805],"category_scores_gemma":[0.0071414434,0.00022351353,0.0003602164,0.0005745139,0.0009997773,0.0019499414,0.0012074341,0.0009568599,0.00026128895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000530709,0.00014872395,0.0010642546,0.00023059906,0.00006741374,0.00029888403,0.0005152218,0.31973177,0.10135398,0.36429682,0.0035924588,0.20816919],"study_design_scores_gemma":[0.000035830984,0.00009585504,0.0004956155,0.000012461079,0.000017553155,0.00010114591,0.00002397791,0.93088603,0.009421522,0.057478014,0.001411163,0.000020810605],"about_ca_topic_score_codex":0.0016195308,"about_ca_topic_score_gemma":0.0016596051,"teacher_disagreement_score":0.0016195308,"about_ca_system_score_codex":0.0005185876,"about_ca_system_score_gemma":0.0006835037,"threshold_uncertainty_score":0.005899191},"labels":[],"label_agreement":null},{"id":"W2022401652","doi":"10.1109/lsp.2012.2205142","title":"Tractable Bound for Spherical Section Property in the Presence of Side-Information","year":2012,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Semidefinite programming; Relaxation (psychology); Upper and lower bounds; Compressed sensing; Semidefinite embedding; Linear programming; Constraint (computer-aided design); Dual (grammatical number); Property (philosophy); Mathematics; Computer science; Algorithm; Mathematical optimization; Computational complexity theory; Combinatorics; Quadratically constrained quadratic program; Quadratic programming; Mathematical analysis; Geometry","score_opus":0.021915080156452174,"score_gpt":0.23723496350879497,"score_spread":0.2153198833523428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022401652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015302681,0.0006206626,0.9701662,0.0008656756,0.00006396788,0.00006545623,0.00032245895,0.00018506525,0.012407813],"genre_scores_gemma":[0.767493,0.0023326117,0.21728249,0.0008777638,0.00039842282,0.0004749997,0.0009750629,0.00045324786,0.009712369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979425,0.0006704588,0.000066803696,0.0003222122,0.00068680674,0.00031118395],"domain_scores_gemma":[0.98540765,0.011567077,0.00072936364,0.0008821173,0.0010365226,0.0003771582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033193978,0.0018214701,0.0012977151,0.00083700067,0.0006824616,0.002255527,0.0014799908,0.0014105372,0.0088848155],"category_scores_gemma":[0.015443637,0.0006318655,0.00087875384,0.00097369595,0.0024486692,0.0049113655,0.0028334807,0.0044562295,0.0012806138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003628465,0.00014256366,0.0008906304,0.00052480964,0.00006961196,0.0008344566,0.0003102451,0.44224912,0.015416925,0.4919404,0.010064609,0.037193812],"study_design_scores_gemma":[0.000021296028,0.00008648745,0.00021790458,0.000075748416,0.000017233455,0.0002763529,0.00009102866,0.85484344,0.0036034256,0.13824692,0.0024890779,0.00003096306],"about_ca_topic_score_codex":0.0013563436,"about_ca_topic_score_gemma":0.0015937808,"teacher_disagreement_score":0.0088848155,"about_ca_system_score_codex":0.001773102,"about_ca_system_score_gemma":0.0017383595,"threshold_uncertainty_score":0.02972269},"labels":[],"label_agreement":null},{"id":"W2023639783","doi":"10.1016/j.physleta.2007.05.019","title":"Analog random coding","year":2007,"lang":"en","type":"article","venue":"Physics Letters A","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Physics; Random noise; Coding (social sciences); Encryption; Random matrix; Algorithm; Statistical physics; Quantum mechanics; Statistics; Computer science; Eigenvalues and eigenvectors; Mathematics","score_opus":0.013191256853478286,"score_gpt":0.2214047599183734,"score_spread":0.2082135030648951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023639783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014471226,0.0035566438,0.85891914,0.0025463325,0.0020737746,0.00010438922,0.00056176307,0.0007511069,0.117015645],"genre_scores_gemma":[0.67390335,0.004869626,0.21649793,0.002382146,0.0018986048,0.00018748442,0.00097264745,0.00021875024,0.099069566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950695,0.00011271297,0.000023942725,0.00009754253,0.00022398193,0.000034866836],"domain_scores_gemma":[0.99928766,0.00024450148,0.00006176273,0.00020109821,0.000168167,0.000036898153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003598641,0.0006828819,0.00052189216,0.0007999296,0.0003578006,0.0012386456,0.00054124754,0.001054896,0.011269251],"category_scores_gemma":[0.0024788375,0.0002608464,0.00034099826,0.0011456852,0.00090937386,0.0011337455,0.0010535351,0.0011472305,0.002274774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015534853,0.000051256273,0.00036894978,0.00020362093,0.00005224543,0.00017661578,0.000059914302,0.03779679,0.012715415,0.71399,0.014785617,0.2196443],"study_design_scores_gemma":[0.000054889464,0.00011749015,0.00093653944,0.00015301655,0.00008138995,0.0009619461,0.00005162381,0.43134743,0.017925953,0.48957345,0.05870768,0.000088614186],"about_ca_topic_score_codex":0.0005593059,"about_ca_topic_score_gemma":0.00073594274,"teacher_disagreement_score":0.011269251,"about_ca_system_score_codex":0.000483006,"about_ca_system_score_gemma":0.00049382687,"threshold_uncertainty_score":0.03769934},"labels":[],"label_agreement":null},{"id":"W2025237502","doi":"10.1109/tsp.2013.2284762","title":"Permutation Meets Parallel Compressed Sensing: How to Relax Restricted Isometry Property for 2D Sparse Signals","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Restricted isometry property; Property (philosophy); Permutation (music); Isometry (Riemannian geometry); Compressed sensing; Computer science; Mathematics; Algorithm; Pure mathematics; Physics; Acoustics","score_opus":0.033834491518760404,"score_gpt":0.2478086902965299,"score_spread":0.21397419877776952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025237502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005449349,0.000103545215,0.99238425,0.00025399434,0.000073265284,0.000044712426,0.000060501792,0.00013993296,0.0014905777],"genre_scores_gemma":[0.20010957,0.0010511901,0.7937771,0.000434984,0.00028010702,0.00021390262,0.0004132505,0.00016860137,0.0035512652],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999268,0.00020508611,0.000050735754,0.00011553026,0.0003013866,0.000059298458],"domain_scores_gemma":[0.9987025,0.0006003542,0.00008884591,0.00036354008,0.0001926195,0.00005211041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008812786,0.00085790805,0.0006608904,0.00045696186,0.00037658383,0.00083360594,0.0007530521,0.00087749,0.0036902325],"category_scores_gemma":[0.005196743,0.00035598833,0.00045780442,0.0009971191,0.0012013917,0.00274056,0.0012870296,0.0014145405,0.0009828832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057989237,0.000110263536,0.0009765114,0.00039517423,0.000054373464,0.0006531014,0.00026280948,0.20570956,0.077234805,0.2651424,0.007490076,0.44139105],"study_design_scores_gemma":[0.000045052213,0.00019205282,0.00027528248,0.000024919971,0.000015118258,0.00058555265,0.00005339557,0.8705802,0.02373475,0.09344965,0.01099126,0.000052694082],"about_ca_topic_score_codex":0.0014406864,"about_ca_topic_score_gemma":0.0013109341,"teacher_disagreement_score":0.0036902325,"about_ca_system_score_codex":0.00032136668,"about_ca_system_score_gemma":0.0011305016,"threshold_uncertainty_score":0.012345076},"labels":[],"label_agreement":null},{"id":"W2026496967","doi":"10.1109/iscas.2010.5537822","title":"Robust signal recovery approach for compressive sensing using unconstrained optimization","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Compressed sensing; Hessian matrix; Algorithm; Function (biology); Mathematics; Signal reconstruction; Computer science; Applied mathematics; Mathematical optimization; Signal processing","score_opus":0.03692299165614283,"score_gpt":0.224523006035843,"score_spread":0.18760001437970017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026496967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015305926,0.0001021055,0.99740064,0.00008869041,0.00001720267,0.000019540252,0.000020558804,0.00010190064,0.00071881554],"genre_scores_gemma":[0.12563176,0.00075502327,0.867817,0.00022177772,0.00014631377,0.00026815358,0.0003612598,0.00012595582,0.004672767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00023569528,0.00004282578,0.00017225114,0.00038643533,0.00005828323],"domain_scores_gemma":[0.9992872,0.00030621223,0.000107810505,0.000101802965,0.00016546929,0.00003155433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009619316,0.0011357972,0.0010335575,0.00066110084,0.00040494232,0.0008127766,0.0012506716,0.0011234687,0.0026194346],"category_scores_gemma":[0.002468125,0.00043620585,0.0009221372,0.00085237133,0.00090943155,0.0011753187,0.0016472992,0.0017380657,0.0009993612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001722886,0.00008561943,0.00031710236,0.00035492904,0.000101643505,0.00026432946,0.0001718218,0.66445494,0.0440754,0.07943247,0.004677048,0.20589235],"study_design_scores_gemma":[0.000007760553,0.00005039609,0.00006838434,0.000011939053,0.000009716569,0.00007473353,0.000012284231,0.9871285,0.0049619717,0.0053235027,0.0023329468,0.000017947066],"about_ca_topic_score_codex":0.0018979576,"about_ca_topic_score_gemma":0.0015175894,"teacher_disagreement_score":0.0026194346,"about_ca_system_score_codex":0.0005347092,"about_ca_system_score_gemma":0.0015400214,"threshold_uncertainty_score":0.008762896},"labels":[],"label_agreement":null},{"id":"W2027009076","doi":"10.1109/radar.2011.5960527","title":"Regularization for capon and APES","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Capon; Regularization (linguistics); Estimator; Inverse problem; Spectral density estimation; Parametric statistics; Algorithm; Quadratic equation; Mathematics; Oracle; Applied mathematics; Inverse; Singular value decomposition; Computer science; Mathematical optimization; Artificial intelligence; Mathematical analysis; Statistics; Fourier transform","score_opus":0.030383384092881133,"score_gpt":0.19247155935403162,"score_spread":0.1620881752611505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027009076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018776304,0.0001535127,0.99599177,0.00012161539,0.000046368863,0.000012037926,0.000018570725,0.000050957235,0.001727555],"genre_scores_gemma":[0.24270326,0.0012516449,0.7370125,0.0008186176,0.00040397022,0.00022727445,0.0004149221,0.0002437541,0.01692401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986009,0.00052018143,0.000054244327,0.00026419348,0.0004932848,0.000067115936],"domain_scores_gemma":[0.99799347,0.0010830424,0.00016490524,0.0002717076,0.00041962723,0.000067321576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022360033,0.0009440963,0.00061642524,0.00078190194,0.00038009483,0.0011383253,0.001006683,0.0014601835,0.0026884724],"category_scores_gemma":[0.007112783,0.0003739938,0.00057014695,0.00065449416,0.0013513106,0.0021077774,0.001277517,0.0019190859,0.0006564629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016548335,0.00007635569,0.0008375414,0.0003884532,0.00008309003,0.0001955526,0.0002291629,0.24483512,0.016055692,0.5119821,0.00786698,0.21728447],"study_design_scores_gemma":[0.000005397476,0.00003211592,0.00022990146,0.00001852653,0.000007951917,0.00013386957,0.00002120319,0.93456846,0.00255478,0.054199748,0.008208213,0.000019901276],"about_ca_topic_score_codex":0.0008027706,"about_ca_topic_score_gemma":0.0009110829,"teacher_disagreement_score":0.0026884724,"about_ca_system_score_codex":0.00042764816,"about_ca_system_score_gemma":0.0004773428,"threshold_uncertainty_score":0.0118252635},"labels":[],"label_agreement":null},{"id":"W2028890028","doi":"10.1109/icc.2012.6364036","title":"Network coding based wideband compressed spectrum sensing","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Cognitive radio; Nyquist–Shannon sampling theorem; Nyquist rate; Minification; Coding (social sciences); Algorithm; Mathematics; Sampling (signal processing); Telecommunications; World Wide Web; Wireless; Statistics; Computer vision","score_opus":0.021016672965009225,"score_gpt":0.21804721164774693,"score_spread":0.1970305386827377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028890028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014230705,0.00080344424,0.9750336,0.00078888016,0.00025405656,0.00007927555,0.00023360008,0.00041912374,0.008157364],"genre_scores_gemma":[0.66726,0.0019983368,0.31125,0.00084046065,0.0003768255,0.0003331114,0.001191082,0.000082142964,0.016668024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993604,0.000117380834,0.00002368298,0.000105927385,0.00031608276,0.000076604745],"domain_scores_gemma":[0.99910223,0.00045632577,0.0000792264,0.00011804395,0.00021340292,0.000030801035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004969666,0.0006055849,0.00056798063,0.000510839,0.0002752442,0.00059470546,0.0007344798,0.0007101792,0.0023235471],"category_scores_gemma":[0.0027898918,0.00015670627,0.00024709807,0.00079639745,0.00059850933,0.0011485525,0.0010278176,0.0011607474,0.0005232627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006329082,0.0001243816,0.0004653331,0.00027998403,0.000058845326,0.00040657952,0.0002122279,0.5104426,0.035041995,0.11548827,0.014612146,0.32223472],"study_design_scores_gemma":[0.000018988212,0.00004764158,0.000119834105,0.000020812906,0.000008370999,0.00009684343,0.00001967886,0.97744316,0.0039700675,0.0147705665,0.0034702772,0.000013733446],"about_ca_topic_score_codex":0.0038778821,"about_ca_topic_score_gemma":0.0039417637,"teacher_disagreement_score":0.0038778821,"about_ca_system_score_codex":0.0006045034,"about_ca_system_score_gemma":0.0009969072,"threshold_uncertainty_score":0.007772982},"labels":[],"label_agreement":null},{"id":"W2028911681","doi":"10.1109/tit.2014.2331341","title":"Hidden Cliques and the Certification of the Restricted Isometry Property","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Restricted isometry property; Isometry (Riemannian geometry); Underdetermined system; Property (philosophy); Mathematics; Matrix (chemical analysis); Compressed sensing; Probabilistic logic; Time complexity; Clique; Algorithm; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.008996019967242282,"score_gpt":0.19698555094763953,"score_spread":0.18798953098039725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028911681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11330356,0.0002754475,0.87347376,0.0022947972,0.000106939515,0.00025142907,0.0006976585,0.00060861715,0.008987769],"genre_scores_gemma":[0.8725841,0.00036185866,0.12116999,0.00054506806,0.00025534965,0.00031445888,0.0011310143,0.0002709373,0.0033672242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921686,0.0031339317,0.0003042383,0.0017426239,0.0017703506,0.00088026625],"domain_scores_gemma":[0.92819536,0.049550623,0.0047106883,0.011578642,0.004098314,0.0018663845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004701847,0.0009030797,0.0015894807,0.0013404582,0.0020602255,0.0029527743,0.0026342385,0.0019304244,0.0062596193],"category_scores_gemma":[0.049738616,0.001114194,0.0016363895,0.0015380058,0.005407323,0.0096899,0.005334824,0.0050462545,0.0010209326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010777537,0.00032159692,0.0052763447,0.00031495767,0.00013808093,0.00086476316,0.0010250432,0.1571856,0.010131093,0.76023406,0.008376829,0.055053808],"study_design_scores_gemma":[0.000114789684,0.000091804075,0.0008059583,0.000036632802,0.000022480848,0.00025398395,0.00016375621,0.39000255,0.0036437288,0.60256284,0.002246017,0.000055515127],"about_ca_topic_score_codex":0.0027561844,"about_ca_topic_score_gemma":0.0022614272,"teacher_disagreement_score":0.0062596193,"about_ca_system_score_codex":0.001243513,"about_ca_system_score_gemma":0.0022101705,"threshold_uncertainty_score":0.024866045},"labels":[],"label_agreement":null},{"id":"W2029935000","doi":"10.1109/spawc.2014.6941855","title":"Power-constrained low-complexity coding of compressed sensing measurements","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Channel code; Compressed sensing; Computer science; Channel (broadcasting); Coding (social sciences); Scalar (mathematics); Scaling; Exponent; Algorithm; Upper and lower bounds; Dimension (graph theory); Signal-to-noise ratio (imaging); Electronic engineering; Decoding methods; Mathematics; Telecommunications; Engineering; Statistics","score_opus":0.045881192044839425,"score_gpt":0.2429551144821468,"score_spread":0.19707392243730737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029935000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089036174,0.00045145786,0.9060314,0.00045547317,0.000047871836,0.0000662243,0.00007306429,0.00010938687,0.0037289453],"genre_scores_gemma":[0.95771146,0.00036295317,0.04031549,0.000063821906,0.000046979683,0.00006170919,0.00004635767,0.000017051088,0.0013742091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896383,0.00046226115,0.000028683799,0.00009514703,0.00033753086,0.000112554335],"domain_scores_gemma":[0.99403894,0.004983987,0.00042740253,0.00016776043,0.00031971646,0.00006224482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449716,0.000720346,0.00063783437,0.00033843628,0.0003088226,0.0006761125,0.0007059423,0.0006791263,0.0010162005],"category_scores_gemma":[0.0061457735,0.00026158284,0.0002265024,0.00066658575,0.0013326616,0.0012457287,0.0007863175,0.0007491551,0.00015711458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021037212,0.00006263483,0.00046545835,0.00018513894,0.000031277345,0.00024968278,0.00011614074,0.9236178,0.0154045755,0.043371372,0.00048729492,0.015798297],"study_design_scores_gemma":[0.000007925284,0.000039866518,0.000057589947,0.000003923458,0.000003921015,0.000025715466,0.0000072460034,0.996293,0.0014259624,0.002035677,0.000094656745,0.000004473987],"about_ca_topic_score_codex":0.0023191695,"about_ca_topic_score_gemma":0.0018754443,"teacher_disagreement_score":0.0023191695,"about_ca_system_score_codex":0.00075482595,"about_ca_system_score_gemma":0.00070526375,"threshold_uncertainty_score":0.0055264235},"labels":[],"label_agreement":null},{"id":"W2030165619","doi":"10.1016/j.procs.2013.06.040","title":"Low Sampling-rate Approach for ECG Signals with Compressed Sensing Theory","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless; Wireless network; Compressed sensing; Computer network; Body area network; Wi-Fi; Noise (video); Telecommunications; Real-time computing; Artificial intelligence","score_opus":0.01900672927921186,"score_gpt":0.22100795649529273,"score_spread":0.20200122721608088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030165619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018955822,0.00054089335,0.9957812,0.00024015298,0.00005971037,0.000030830208,0.000049504095,0.0000837543,0.0013183466],"genre_scores_gemma":[0.25642124,0.004350109,0.72999567,0.0004383795,0.00055300025,0.00032815654,0.00068663084,0.00014088031,0.0070859347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992687,0.0002048724,0.000034847424,0.00009297425,0.00035886889,0.000039654675],"domain_scores_gemma":[0.99889296,0.00074786256,0.00007150027,0.00006966602,0.00018887156,0.00002921153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141726,0.00094130926,0.00048587413,0.0007153395,0.0002998564,0.00072859286,0.0008034031,0.0010275278,0.0023918573],"category_scores_gemma":[0.0039024223,0.00023179247,0.000607228,0.00093564205,0.00067741016,0.0011454653,0.0009024561,0.0017365878,0.00074196747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025521003,0.000101677295,0.00096872624,0.0005910838,0.00009579777,0.00033452862,0.000310436,0.6120426,0.020420086,0.11024017,0.0057097077,0.24892987],"study_design_scores_gemma":[0.000007678861,0.000046799963,0.00013061105,0.000022829416,0.000009653022,0.00009508656,0.000015313706,0.9881209,0.0020206394,0.0075175776,0.0020008998,0.000011861626],"about_ca_topic_score_codex":0.0030312312,"about_ca_topic_score_gemma":0.0020315438,"teacher_disagreement_score":0.0030312312,"about_ca_system_score_codex":0.00050568086,"about_ca_system_score_gemma":0.0007067564,"threshold_uncertainty_score":0.008001506},"labels":[],"label_agreement":null},{"id":"W2032240925","doi":"10.1007/s10915-012-9597-4","title":"An Efficient Algorithm for ℓ 0 Minimization in Wavelet Frame Based Image Restoration","year":2012,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Deblurring; Wavelet; Mathematics; Compressed sensing; Norm (philosophy); Algorithm; Frame (networking); Minification; Image restoration; Image (mathematics); Piecewise; Image processing; Calculus (dental); Artificial intelligence; Computer science; Mathematical optimization; Mathematical analysis; Telecommunications","score_opus":0.016985256017787775,"score_gpt":0.26836909155521727,"score_spread":0.2513838355374295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032240925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015082756,0.000060964667,0.99766564,0.00004868794,0.000037113914,0.000023924567,0.000016472512,0.00014018524,0.0004986618],"genre_scores_gemma":[0.015127892,0.000120029035,0.9822925,0.00004137449,0.000030205687,0.00008372795,0.00007629575,0.00006097191,0.0021669536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996172,0.000071023256,0.000023747605,0.00005034872,0.00020751139,0.00003021668],"domain_scores_gemma":[0.99966955,0.00013400777,0.000027996168,0.000040850657,0.000106859065,0.000020701395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007596221,0.0008605165,0.00075606134,0.0007532268,0.00042891665,0.000725305,0.0011022893,0.0011462283,0.0040748334],"category_scores_gemma":[0.0015799971,0.00044888305,0.0006902138,0.00084352645,0.00056208676,0.00082127587,0.0014691099,0.0013939143,0.0019002099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023599288,0.00014014183,0.00027939107,0.00022033845,0.000060981485,0.0001249401,0.00014368304,0.083487675,0.053883273,0.05452466,0.0073584374,0.7995405],"study_design_scores_gemma":[0.00006177318,0.00012945083,0.00025685024,0.000022612621,0.000024597884,0.0002044563,0.000034693803,0.95610696,0.016365211,0.01748791,0.009273509,0.000031822132],"about_ca_topic_score_codex":0.0016435629,"about_ca_topic_score_gemma":0.0031231141,"teacher_disagreement_score":0.0040748334,"about_ca_system_score_codex":0.00040844845,"about_ca_system_score_gemma":0.0011171141,"threshold_uncertainty_score":0.0136317015},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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)","score_opus":0.012962118880837013,"score_gpt":0.21831007911874625,"score_spread":0.20534796023790924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032473164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08518199,0.0006645653,0.9079977,0.001260709,0.00015194993,0.000060720497,0.00012346562,0.00034786563,0.0042108945],"genre_scores_gemma":[0.7729364,0.00047963994,0.22408599,0.00042198936,0.00015739053,0.000108797096,0.00019692212,0.00008603891,0.0015268204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838805,0.0006605335,0.000068500434,0.00023966713,0.00052176707,0.000121395205],"domain_scores_gemma":[0.99110985,0.0061354865,0.00058762333,0.001379485,0.0006101747,0.00017737303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021503945,0.000453856,0.0007170284,0.00046156716,0.0003843892,0.0009698037,0.00092760986,0.00080149795,0.002534886],"category_scores_gemma":[0.012341609,0.0003005831,0.00030441588,0.00057993445,0.0019121671,0.002074939,0.001630132,0.0012296718,0.000479611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012295423,0.00030795392,0.002803748,0.00044131928,0.000114554416,0.00036245305,0.0002733433,0.6110473,0.077663235,0.16399954,0.004639472,0.13711748],"study_design_scores_gemma":[0.00006754207,0.000212828,0.00045925952,0.00003707765,0.000018710234,0.00010158662,0.000049830618,0.94366246,0.013934898,0.039550092,0.0018781793,0.00002756631],"about_ca_topic_score_codex":0.0011245357,"about_ca_topic_score_gemma":0.0010167757,"teacher_disagreement_score":0.002534886,"about_ca_system_score_codex":0.00045593028,"about_ca_system_score_gemma":0.0007749541,"threshold_uncertainty_score":0.011372566},"labels":[],"label_agreement":null},{"id":"W2032782431","doi":"10.1117/12.894165","title":"Weighted-ℓ 1 minimization with multiple weighting sets","year":2011,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Weighting; Robustness (evolution); Computer science; Signal recovery; Compressed sensing; Algorithm; Structural risk minimization; Stability (learning theory); Support vector machine; Artificial intelligence; Machine learning; Physics","score_opus":0.014925445427210663,"score_gpt":0.20944402630302866,"score_spread":0.194518580875818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032782431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023528013,0.00019335447,0.9743815,0.0002086157,0.000020545262,0.000030738407,0.00004080166,0.000046120498,0.001550452],"genre_scores_gemma":[0.55201834,0.0006086896,0.4404633,0.00024085518,0.00012059992,0.0002360964,0.00033134682,0.00016565467,0.005815137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883705,0.00037691326,0.00007298356,0.00025199278,0.00038360563,0.000077365046],"domain_scores_gemma":[0.99726534,0.0017643011,0.0003342343,0.00020771692,0.0003565008,0.000071925046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026777887,0.0014908293,0.0010109503,0.00068082585,0.00029136313,0.001026546,0.0011813724,0.0014750824,0.001824572],"category_scores_gemma":[0.009449385,0.0004983893,0.00061624637,0.00059372146,0.001257616,0.002219827,0.0020718824,0.0011699793,0.00047729732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004220863,0.00011092525,0.0015532421,0.0005686307,0.00017306767,0.0004617788,0.00025752478,0.6786665,0.031072643,0.18023011,0.0019298728,0.10455369],"study_design_scores_gemma":[0.000011588337,0.00007079112,0.00015968079,0.000021257314,0.000010755835,0.00010493014,0.000024938143,0.9772968,0.0049749473,0.016656466,0.0006515525,0.000016270546],"about_ca_topic_score_codex":0.00055825216,"about_ca_topic_score_gemma":0.00042950295,"teacher_disagreement_score":0.0026777887,"about_ca_system_score_codex":0.0005700641,"about_ca_system_score_gemma":0.00047669763,"threshold_uncertainty_score":0.014161646},"labels":[],"label_agreement":null},{"id":"W2032822842","doi":"10.1109/icpr.2010.521","title":"AdaMKL: A Novel Biconvex Multiple Kernel Learning Approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multiple kernel learning; Kernel (algebra); Margin (machine learning); Norm (philosophy); Tree kernel; Regular polygon; Radial basis function kernel; Mathematical optimization; Convex function; Computer science; Kernel embedding of distributions; Kernel method; Convex optimization; Artificial intelligence; Mathematics; Support vector machine; Machine learning; Combinatorics","score_opus":0.01441578427127942,"score_gpt":0.20403854458732815,"score_spread":0.18962276031604872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032822842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020709482,0.00018466804,0.99654883,0.00015356355,0.000025377756,0.000016874399,0.00002823581,0.0004919944,0.00047946163],"genre_scores_gemma":[0.22797893,0.0005540148,0.76128757,0.0006454148,0.00016945174,0.00023198931,0.00068943296,0.000627579,0.007815634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975848,0.0010363568,0.00012571698,0.0003646473,0.0007361458,0.00015239663],"domain_scores_gemma":[0.997785,0.00080460927,0.00020265902,0.00037651192,0.0007024475,0.000128661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021336917,0.0013363538,0.001847114,0.00086965,0.00055906875,0.0015100836,0.0036495603,0.0020414258,0.0025783964],"category_scores_gemma":[0.006050375,0.00080203806,0.0008003574,0.0010994488,0.0011674606,0.002919966,0.0029026212,0.00281834,0.0021251068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028582322,0.00017447346,0.0011915948,0.0003232488,0.00017568833,0.000158429,0.0001467178,0.5243873,0.008086551,0.04001202,0.014098889,0.4109592],"study_design_scores_gemma":[0.0000060547677,0.000018914016,0.000042529882,0.0000040405366,0.000003517262,0.000031049924,0.0000057473685,0.993541,0.000855,0.0043355417,0.001149393,0.0000072660127],"about_ca_topic_score_codex":0.0027373012,"about_ca_topic_score_gemma":0.0026791187,"teacher_disagreement_score":0.0036495603,"about_ca_system_score_codex":0.00092077453,"about_ca_system_score_gemma":0.0013747115,"threshold_uncertainty_score":0.011284232},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Algorithm; Isometry (Riemannian geometry); Combinatorics; Mathematical analysis","score_opus":0.015192961616420725,"score_gpt":0.22381197671911995,"score_spread":0.20861901510269923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033585806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043936633,0.00010416982,0.9876589,0.0003304331,0.00006019786,0.000034352608,0.00036836555,0.00065085903,0.006398951],"genre_scores_gemma":[0.17747332,0.0011045578,0.78640705,0.00032317132,0.00023557438,0.00017837474,0.002900585,0.0007939184,0.030583406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968743,0.00006780006,0.000017755148,0.00005267037,0.00015214247,0.000022201071],"domain_scores_gemma":[0.99948186,0.00021770207,0.00005545949,0.000114281844,0.00011087631,0.000019895262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005115699,0.00065849815,0.00034283524,0.00078393426,0.00026866002,0.00086291076,0.00048846134,0.0005054349,0.012541955],"category_scores_gemma":[0.0032350284,0.00024346187,0.00041850915,0.0011028018,0.0005092737,0.0010690882,0.0010823049,0.00086169835,0.0061056963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027866202,0.00008516934,0.0005190137,0.0004047562,0.00007046042,0.00025492086,0.0003021699,0.10560687,0.078671396,0.19680512,0.043940276,0.5730611],"study_design_scores_gemma":[0.00003180935,0.0000922369,0.0005983975,0.000056140765,0.00002009398,0.00029096752,0.000095322226,0.8378124,0.04472052,0.0794966,0.03674994,0.000035446523],"about_ca_topic_score_codex":0.0014597706,"about_ca_topic_score_gemma":0.0022742513,"teacher_disagreement_score":0.012541955,"about_ca_system_score_codex":0.0002519995,"about_ca_system_score_gemma":0.00072649197,"threshold_uncertainty_score":0.04195702},"labels":[],"label_agreement":null},{"id":"W2035112484","doi":"10.1007/s11760-012-0401-6","title":"Sparsity aware consistent and high precision variable selection","year":2012,"lang":"en","type":"article","venue":"Signal Image and Video Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Variable (mathematics); Selection (genetic algorithm); Computer science; Algorithm; Feature selection; SIGNAL (programming language); Function (biology); Convex optimization; Mathematical optimization; Signal processing; Regular polygon; Mathematics; Artificial intelligence","score_opus":0.013605247735622616,"score_gpt":0.22978841418778323,"score_spread":0.21618316645216062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035112484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004929221,0.00017114502,0.99367166,0.00016850983,0.00003954573,0.000014039719,0.00005826793,0.00015575917,0.00079176435],"genre_scores_gemma":[0.33496302,0.0005345757,0.65769845,0.00034841118,0.0002812415,0.00012683537,0.00042987804,0.0002001965,0.005417349],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.00063978275,0.0000763167,0.00028706907,0.0005775613,0.000110942754],"domain_scores_gemma":[0.99541664,0.0028392496,0.0002752924,0.0009774079,0.0004141142,0.00007723605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018769982,0.0011184519,0.0012903055,0.00061858457,0.00055476354,0.0015399592,0.0012516738,0.0013170507,0.0026110762],"category_scores_gemma":[0.010974173,0.00081579416,0.0005122686,0.0012846892,0.0010925329,0.0019043683,0.0021825773,0.0019393648,0.00069877395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080350647,0.00016417235,0.001396727,0.00026136253,0.0001959446,0.000245283,0.00019847206,0.41567877,0.027964957,0.12369242,0.011641286,0.41775715],"study_design_scores_gemma":[0.000048429127,0.000062374405,0.00030993207,0.00001672375,0.000020157579,0.00011460851,0.00001975522,0.9483692,0.0075568296,0.04174172,0.0017223064,0.000018032642],"about_ca_topic_score_codex":0.00082077365,"about_ca_topic_score_gemma":0.0015811401,"teacher_disagreement_score":0.0026110762,"about_ca_system_score_codex":0.0003538899,"about_ca_system_score_gemma":0.0010261104,"threshold_uncertainty_score":0.009926617},"labels":[],"label_agreement":null},{"id":"W2036817298","doi":"10.1109/jstars.2014.2314216","title":"Compressed Sensing ISAR Reconstruction in the Presence of Rotational Acceleration","year":2014,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Inverse synthetic aperture radar; Acceleration; Compressed sensing; Focus (optics); Computer science; Synthetic aperture radar; Computer vision; Iterative reconstruction; Rotation around a fixed axis; Frame (networking); Artificial intelligence; Angular acceleration; Radar imaging; Radar; Physics; Optics; Telecommunications","score_opus":0.02693266203297788,"score_gpt":0.22779254252401857,"score_spread":0.2008598804910407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036817298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027368965,0.00029499273,0.97056085,0.0002612833,0.00006084431,0.00001647713,0.000049257767,0.00013192702,0.001255342],"genre_scores_gemma":[0.4134122,0.00104243,0.58149964,0.0002025229,0.00023554899,0.000054681394,0.00032361448,0.00005504482,0.0031743636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997019,0.000074856776,0.0000123196,0.000046047167,0.00014184459,0.000023087467],"domain_scores_gemma":[0.99951553,0.00022324556,0.00007875421,0.00007523398,0.00008857934,0.000018707511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004535978,0.00046390452,0.000503308,0.0002508912,0.00016618625,0.00036885694,0.00039075693,0.0006022982,0.0004898609],"category_scores_gemma":[0.0016323957,0.00021938284,0.0002905697,0.00035385852,0.00046698935,0.0007615149,0.0005498273,0.000845334,0.00023231795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004777935,0.00007580923,0.001691423,0.00037154608,0.00008681664,0.00073502277,0.0004101933,0.46610215,0.15357995,0.061960366,0.0039290907,0.31057987],"study_design_scores_gemma":[0.000017504759,0.000053368047,0.00040241674,0.000011305803,0.000012670064,0.00030408474,0.000028782819,0.98217034,0.010149938,0.0045321025,0.002302597,0.00001491262],"about_ca_topic_score_codex":0.0011017319,"about_ca_topic_score_gemma":0.0010049839,"teacher_disagreement_score":0.0011017319,"about_ca_system_score_codex":0.00016892652,"about_ca_system_score_gemma":0.00036895703,"threshold_uncertainty_score":0.0023988485},"labels":[],"label_agreement":null},{"id":"W2037002473","doi":"10.1109/icsmc.2011.6083963","title":"Compressive sensing indoor localization","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Ontario","keywords":"Compressed sensing; Wireless sensor network; Computer science; Wireless; Real-time computing; Sampling (signal processing); Minification; SIGNAL (programming language); Nyquist–Shannon sampling theorem; Algorithm; Computer vision; Computer network; Telecommunications; Filter (signal processing)","score_opus":0.03105893667762,"score_gpt":0.20140908250498862,"score_spread":0.17035014582736863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037002473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017079232,0.0007752848,0.97675306,0.00031411237,0.00010348512,0.000027185804,0.0001088774,0.00046560538,0.004373207],"genre_scores_gemma":[0.68295836,0.0021806788,0.30831775,0.00026066139,0.00026765914,0.000101045734,0.0004806263,0.000076365024,0.0053568855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955434,0.00013712344,0.000014347469,0.00009273079,0.00015982032,0.000041689676],"domain_scores_gemma":[0.99960214,0.00016691624,0.00005669601,0.00007934833,0.000079317084,0.000015538752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003039603,0.0004895768,0.000523609,0.00033209287,0.00032583662,0.00050673395,0.0005264121,0.000657591,0.0014574066],"category_scores_gemma":[0.0015334907,0.00023002195,0.00038078066,0.0005653921,0.00051559386,0.0008999569,0.0009195169,0.0006581471,0.000629368],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027053495,0.00007627428,0.0021547598,0.00035778654,0.0000698695,0.00038371683,0.00018000335,0.54374695,0.04929641,0.039468434,0.0076342793,0.35636106],"study_design_scores_gemma":[0.000023773111,0.00010850333,0.001054127,0.000028216195,0.000022917913,0.0002943138,0.00006997401,0.9673625,0.014038563,0.009589963,0.007380714,0.00002637091],"about_ca_topic_score_codex":0.0016898552,"about_ca_topic_score_gemma":0.0017813644,"teacher_disagreement_score":0.0016898552,"about_ca_system_score_codex":0.00030274875,"about_ca_system_score_gemma":0.00037221875,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2037857866","doi":"10.1109/memea.2013.6549738","title":"New sampling approach for wireless ECG systems with compressed sensing theory","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless; Compressed sensing; Sampling (signal processing); Health care; Real-time computing; Artificial intelligence; Telecommunications","score_opus":0.023317985207292932,"score_gpt":0.21405472204194645,"score_spread":0.19073673683465353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037857866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015673657,0.00026041537,0.99659866,0.00016641058,0.00003854182,0.000016443442,0.000018642728,0.00003563839,0.0012978431],"genre_scores_gemma":[0.3248419,0.0031770328,0.6638109,0.00043584395,0.0005423997,0.000242533,0.00026455522,0.000070498725,0.0066144136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951875,0.00015029011,0.000021826942,0.00005382627,0.00023112106,0.00002420157],"domain_scores_gemma":[0.9994873,0.0002921435,0.000038817885,0.000042968222,0.00011974666,0.00001896182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006399137,0.0005816183,0.00036358004,0.00043326296,0.00022938834,0.0005186786,0.0006469782,0.00073414005,0.0017368731],"category_scores_gemma":[0.001724289,0.00019167733,0.0004900586,0.0006059717,0.0005589049,0.001056402,0.0006816413,0.0011415466,0.00036297136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015619001,0.000101783975,0.000811363,0.00038843806,0.000077952405,0.00025870028,0.00029216256,0.5065099,0.031077944,0.25897813,0.005203515,0.19614395],"study_design_scores_gemma":[0.00000821083,0.000041843276,0.00008401685,0.000009171556,0.000008165819,0.00007348656,0.000009761841,0.98649627,0.0013226111,0.0100335125,0.0019044501,0.000008481138],"about_ca_topic_score_codex":0.001406434,"about_ca_topic_score_gemma":0.001201743,"teacher_disagreement_score":0.0017368731,"about_ca_system_score_codex":0.00043951394,"about_ca_system_score_gemma":0.00045529834,"threshold_uncertainty_score":0.0058104396},"labels":[],"label_agreement":null},{"id":"W2042145505","doi":"10.1016/s0004-3702(02)00366-1","title":"Robustness of regional matching scheme over global matching scheme","year":2003,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Robustness (evolution); Voting; Pixel; Artificial intelligence; Principal component analysis; Pattern recognition (psychology); Computer science; Clutter; Mathematics; Computer vision; Radar","score_opus":0.04898738547814663,"score_gpt":0.2899518753897909,"score_spread":0.24096448991164426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042145505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1538562,0.00052516145,0.8401422,0.00022550752,0.000110986344,0.000056883837,0.00018245618,0.0006103458,0.00429032],"genre_scores_gemma":[0.9027833,0.0003870165,0.09251164,0.000104853476,0.000098363584,0.0000521927,0.0003316977,0.00013540157,0.00359543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839336,0.0004858581,0.00006501081,0.00035832616,0.0005270194,0.00017042719],"domain_scores_gemma":[0.9953759,0.0021613059,0.00059285393,0.0011654246,0.0005404112,0.00016416324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020950253,0.00068019255,0.0009845425,0.00095172826,0.00046126917,0.0009704743,0.0008744539,0.0013218392,0.00310138],"category_scores_gemma":[0.011490799,0.00035841682,0.00051135366,0.00087456394,0.00070132077,0.0015443173,0.0012795506,0.0006099505,0.00081024447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004679967,0.00013430374,0.006821909,0.00027788628,0.000305059,0.00026726906,0.00019452184,0.45806077,0.19967617,0.029343976,0.0031829192,0.29705524],"study_design_scores_gemma":[0.00005525839,0.00028567776,0.00269048,0.000012572374,0.00007431661,0.0002515461,0.00004237624,0.95288026,0.03743264,0.005226897,0.0010204351,0.000027551589],"about_ca_topic_score_codex":0.001331573,"about_ca_topic_score_gemma":0.00095151115,"teacher_disagreement_score":0.00310138,"about_ca_system_score_codex":0.00043787027,"about_ca_system_score_gemma":0.0005641881,"threshold_uncertainty_score":0.011079729},"labels":[],"label_agreement":null},{"id":"W2042626276","doi":"10.1109/tip.2014.2368359","title":"Coded Acquisition of High Frame Rate Video","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Frame rate; Computer vision; Random access; Frame (networking); SIGNAL (programming language); Shutter; Data acquisition; Pixel; Real-time computing; Telecommunications","score_opus":0.008847911570110218,"score_gpt":0.22683248991777416,"score_spread":0.21798457834766394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042626276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13747902,0.0002304951,0.85892856,0.0001285245,0.000044629985,0.00006898748,0.0001306467,0.00035629305,0.0026328352],"genre_scores_gemma":[0.6238911,0.00027384632,0.37331504,0.00009218339,0.000033832814,0.00007184421,0.00025493646,0.00003388984,0.0020333177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998109,0.00003046082,0.0000065183285,0.000033303397,0.000095979165,0.00002287975],"domain_scores_gemma":[0.9992582,0.00029979958,0.00008182178,0.00012202845,0.00020414511,0.000033941473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003257956,0.00033047204,0.00027249812,0.00033420944,0.00018331395,0.0004091337,0.0005068946,0.00042874782,0.0009014498],"category_scores_gemma":[0.0015159176,0.00013010301,0.00014432467,0.00034863202,0.00039577228,0.0006818976,0.0005482067,0.00048417918,0.00018707414],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007151942,0.00013179793,0.0022587848,0.00030382842,0.000047242534,0.00051753334,0.00026854448,0.17099422,0.51612425,0.02169879,0.0026858905,0.28425384],"study_design_scores_gemma":[0.0000326144,0.00028833907,0.0013261719,0.00002313808,0.000011962953,0.00040868414,0.000049418184,0.8448004,0.1472575,0.0027906538,0.0029662873,0.000044755376],"about_ca_topic_score_codex":0.0016586463,"about_ca_topic_score_gemma":0.0021400342,"teacher_disagreement_score":0.0016586463,"about_ca_system_score_codex":0.00031434564,"about_ca_system_score_gemma":0.00058676343,"threshold_uncertainty_score":0.003297925},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04902607468451811,"score_gpt":0.32625349412192656,"score_spread":0.2772274194374085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042860556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002039945,0.00036832536,0.9907013,0.0006580886,0.00014944466,0.00007256313,0.00008957838,0.0002370918,0.0056836433],"genre_scores_gemma":[0.08920204,0.00065111514,0.89260274,0.00044952467,0.00027639055,0.000837933,0.00028678658,0.0008298001,0.014863714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983374,0.0007364145,0.000064989064,0.00013802105,0.00059090747,0.00013233135],"domain_scores_gemma":[0.99206674,0.0061449637,0.00026975138,0.0005811114,0.00068963226,0.00024777255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369251,0.0025297527,0.0017149502,0.0010808392,0.0010135445,0.002637667,0.0027361535,0.0021943538,0.0129825715],"category_scores_gemma":[0.016361663,0.000917559,0.001214336,0.001334474,0.0025626083,0.003425905,0.0032835384,0.008854479,0.0028099983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033493002,0.00041579036,0.00042421903,0.00047411243,0.000065142915,0.000113216374,0.0001697067,0.29613757,0.0015480217,0.56820625,0.017203642,0.114907525],"study_design_scores_gemma":[0.000038331364,0.00003029078,0.00005130546,0.000032290467,0.000008100727,0.000025916692,0.000017894383,0.89375305,0.0004963892,0.10303965,0.0024948928,0.000011889858],"about_ca_topic_score_codex":0.0044304114,"about_ca_topic_score_gemma":0.008190772,"teacher_disagreement_score":0.0129825715,"about_ca_system_score_codex":0.0022811713,"about_ca_system_score_gemma":0.0035851216,"threshold_uncertainty_score":0.043431044},"labels":[],"label_agreement":null},{"id":"W2043567166","doi":"10.1109/icassp.2014.6855084","title":"Generalized quadratically constrained quadratic programming for signal processing","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Quadratic growth; Quadratically constrained quadratic program; Quadratic programming; Karush–Kuhn–Tucker conditions; Second-order cone programming; Generalization; Mathematical optimization; Mathematics; Polynomial; Convex optimization; Computer science; Regular polygon; Algorithm","score_opus":0.01778530577757805,"score_gpt":0.24888914858967554,"score_spread":0.23110384281209748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043567166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008704849,0.00035511734,0.9969592,0.00016074604,0.000044656088,0.000014271785,0.000025329655,0.00004786647,0.0015224515],"genre_scores_gemma":[0.19742699,0.003223453,0.7872846,0.00046296415,0.00055250485,0.00033128628,0.00045274402,0.00024670083,0.010018697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999183,0.00035341264,0.000027287158,0.00013882364,0.00023731371,0.00006025645],"domain_scores_gemma":[0.9991861,0.0005202766,0.000051836883,0.00006354496,0.00015413169,0.00002410101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011874031,0.0013253676,0.0009109826,0.0004387416,0.00033376622,0.0007502722,0.00096855895,0.0011224246,0.0027936073],"category_scores_gemma":[0.002585231,0.00035560285,0.0007346901,0.0011358839,0.0010039442,0.0009606682,0.0010493931,0.0027203502,0.00087280653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058274163,0.000057740934,0.00016700981,0.00042632845,0.00005872825,0.00010789999,0.000089065776,0.70238936,0.0036592633,0.18999468,0.0070645893,0.09592712],"study_design_scores_gemma":[0.0000071200147,0.000026626556,0.0000390773,0.0000112872385,0.0000053186623,0.000024667377,0.0000080360805,0.95863986,0.0004021721,0.037409253,0.0034209054,0.0000056158856],"about_ca_topic_score_codex":0.0022808448,"about_ca_topic_score_gemma":0.0019293855,"teacher_disagreement_score":0.0027936073,"about_ca_system_score_codex":0.00072478293,"about_ca_system_score_gemma":0.00110198,"threshold_uncertainty_score":0.009345531},"labels":[],"label_agreement":null},{"id":"W2044083107","doi":"10.1109/taslp.2014.2300336","title":"The Theory of Compressive Sensing Matching Pursuit Considering Time-domain Noise with Application to Speech Enhancement","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Audio Speech and Language Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Notation; Compressed sensing; Matching pursuit; Noise (video); Domain (mathematical analysis); Computer science; Mathematics; Speech recognition; Algorithm; Artificial intelligence; Mathematical analysis; Arithmetic; Image (mathematics)","score_opus":0.005930449692735746,"score_gpt":0.22264040361163134,"score_spread":0.2167099539188956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044083107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019230921,0.00078990264,0.9917862,0.0003783066,0.00010760459,0.000017479937,0.00003588566,0.00004674418,0.0049147536],"genre_scores_gemma":[0.3570042,0.0133450655,0.609237,0.0013763902,0.0024464703,0.00056107366,0.0004146568,0.00020300888,0.015412118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982509,0.0004498102,0.00011413892,0.0003314593,0.0007191203,0.00013450826],"domain_scores_gemma":[0.99677616,0.0020744246,0.0002571473,0.00020700078,0.000589353,0.000095896496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024490082,0.0018024138,0.0010576834,0.0017986216,0.0006874884,0.0018272157,0.0013000879,0.0020158275,0.002119383],"category_scores_gemma":[0.008005842,0.0005769952,0.0012773613,0.0018901125,0.0034926247,0.0033523093,0.0031581705,0.0036597247,0.00081205624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005935426,0.000030047167,0.00034931244,0.00032433769,0.000047089634,0.00024382683,0.00017604092,0.1515772,0.007411946,0.79805267,0.0027141278,0.039013922],"study_design_scores_gemma":[0.000007686776,0.00007108221,0.00014941156,0.0000428195,0.000016756,0.00014740057,0.000029330895,0.827083,0.0027135094,0.16476406,0.0049460405,0.00002891772],"about_ca_topic_score_codex":0.0016769312,"about_ca_topic_score_gemma":0.00082134554,"teacher_disagreement_score":0.0024490082,"about_ca_system_score_codex":0.0012117623,"about_ca_system_score_gemma":0.0012501898,"threshold_uncertainty_score":0.012951732},"labels":[],"label_agreement":null},{"id":"W2045608322","doi":"10.1049/iet-com.2013.0571","title":"Sparse channel estimation of pulse‐shaping multiple‐input–multiple‐output orthogonal frequency division multiplexing systems with an approximate gradient <i>l</i> <sub>2</sub> <i>−</i> <i>Sl</i> <sub>0</sub> reconstruction algorithm","year":2014,"lang":"en","type":"article","venue":"IET Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Orthogonal frequency-division multiplexing; Multiplexing; Channel (broadcasting); Computer science; Algorithm; Division (mathematics); Mathematics; Control theory (sociology); Telecommunications; Arithmetic; Artificial intelligence","score_opus":0.028249298803047777,"score_gpt":0.22757125603719044,"score_spread":0.19932195723414267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045608322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046204664,0.00012008935,0.952221,0.00013740189,0.000019994077,0.000021593612,0.000025846834,0.00015756149,0.0010917463],"genre_scores_gemma":[0.6912616,0.0002659755,0.30602053,0.00007350262,0.000039241266,0.00006820115,0.000110787994,0.000025342784,0.0021348663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998117,0.000065886794,0.000006240401,0.000021994007,0.00007794192,0.000016335021],"domain_scores_gemma":[0.99958843,0.00023711426,0.000055053613,0.000030147161,0.00007634674,0.0000128346055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037596686,0.0003452825,0.0003444896,0.00021942658,0.0001594521,0.0003357897,0.00031339916,0.00047039465,0.00054361916],"category_scores_gemma":[0.0013280686,0.00018079126,0.00025750019,0.00026862905,0.0003147121,0.00049465324,0.00043750645,0.00045781143,0.00012142663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020912709,0.00005066139,0.00060825597,0.00009980726,0.000028178278,0.00010081074,0.0001057783,0.8389104,0.025259884,0.010498291,0.0010164643,0.12311235],"study_design_scores_gemma":[0.0000043319374,0.000016110105,0.00007435864,0.0000017216278,0.0000019632955,0.00001627312,0.000005146801,0.99692184,0.0022163333,0.0005918553,0.00014687167,0.0000031978523],"about_ca_topic_score_codex":0.0021585915,"about_ca_topic_score_gemma":0.0020593952,"teacher_disagreement_score":0.0021585915,"about_ca_system_score_codex":0.00025185538,"about_ca_system_score_gemma":0.00064821873,"threshold_uncertainty_score":0.0042920113},"labels":[],"label_agreement":null},{"id":"W2047361848","doi":"10.1186/1687-1499-2014-40","title":"Quantized Network Coding for correlated sources","year":2014,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Hydro-Québec; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Computer science; Distributed source coding; Linear network coding; Network packet; Exploit; Algorithm; Coding (social sciences); Theoretical computer science; Computer network; Variable-length code; Decoding methods; Mathematics; Statistics","score_opus":0.03485743755944566,"score_gpt":0.26140277286298,"score_spread":0.22654533530353438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047361848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077810106,0.00016984045,0.9903081,0.00016431858,0.00003425224,0.000018870676,0.000039620874,0.00007387428,0.0014100418],"genre_scores_gemma":[0.6403859,0.0007890906,0.35367516,0.00027801152,0.0000996604,0.00018300378,0.00022006378,0.00006542754,0.004303568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993222,0.00021118675,0.000023817609,0.00009165022,0.00029834243,0.00005284162],"domain_scores_gemma":[0.998166,0.0011653809,0.00016104749,0.00024571802,0.0002271688,0.000034785015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096377777,0.0004614985,0.00048153498,0.00054754113,0.00030826312,0.00064686907,0.0008604307,0.0006497438,0.0015908774],"category_scores_gemma":[0.00443705,0.00024359026,0.00030508122,0.00083101937,0.001106068,0.0017889148,0.0012915216,0.0011137595,0.00023214701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017228712,0.00003076986,0.00032040186,0.00013071724,0.000028408444,0.00016684138,0.00019393275,0.598207,0.012786486,0.31786594,0.0017140148,0.068383195],"study_design_scores_gemma":[0.000013067384,0.000022720153,0.000053458523,0.000012021958,0.0000053451463,0.00005597289,0.00001575772,0.9579128,0.0021283617,0.038532354,0.0012381943,0.000009897484],"about_ca_topic_score_codex":0.0018372333,"about_ca_topic_score_gemma":0.0014848872,"teacher_disagreement_score":0.0018372333,"about_ca_system_score_codex":0.00088041875,"about_ca_system_score_gemma":0.00086612004,"threshold_uncertainty_score":0.006387949},"labels":[],"label_agreement":null},{"id":"W2048291033","doi":"10.1016/j.patrec.2010.06.014","title":"Improved Group Sparse Classifier","year":2010,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Classifier (UML); Artificial intelligence; Margin classifier; Computer science; Quadratic classifier; Pattern recognition (psychology); Regular polygon; Machine learning; Optimization problem; Mathematics; Algorithm","score_opus":0.018522080994392422,"score_gpt":0.20992444286089232,"score_spread":0.1914023618664999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048291033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02045817,0.0007182254,0.96955734,0.00076333684,0.000648054,0.00011146664,0.00045961075,0.0017528583,0.005530907],"genre_scores_gemma":[0.24426644,0.00066714536,0.7198502,0.0009022112,0.0009821877,0.00027087357,0.0032092037,0.0003422018,0.029509582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988626,0.00023424842,0.000051724073,0.00023687477,0.0004915141,0.00012309015],"domain_scores_gemma":[0.9988098,0.00023595837,0.0000543869,0.00037651567,0.0004590429,0.000064337124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772154,0.000707351,0.0018760534,0.0013469401,0.0008677081,0.001213484,0.0014158693,0.0016227198,0.008621484],"category_scores_gemma":[0.0023507837,0.00033988987,0.00090888323,0.0014968828,0.0003859061,0.0015053328,0.0015421816,0.0015111385,0.0049691014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048109863,0.0003122503,0.0011079323,0.00009311219,0.00013103354,0.00009771362,0.00006724437,0.041323785,0.016492441,0.013974597,0.038925845,0.8869929],"study_design_scores_gemma":[0.000052993117,0.000110784604,0.0006367333,0.000011259721,0.000056427987,0.0001304003,0.000026836557,0.9693505,0.008697106,0.00898143,0.01192352,0.00002196538],"about_ca_topic_score_codex":0.0029308635,"about_ca_topic_score_gemma":0.005453473,"teacher_disagreement_score":0.008621484,"about_ca_system_score_codex":0.00047309743,"about_ca_system_score_gemma":0.0016922373,"threshold_uncertainty_score":0.028841734},"labels":[],"label_agreement":null},{"id":"W2049079538","doi":"10.1016/j.jat.2015.02.007","title":"Near oracle performance and block analysis of signal space greedy methods","year":2015,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Azrieli Foundation; Simons Foundation","keywords":"Orthonormal basis; Compressed sensing; Block (permutation group theory); Oracle; Algorithm; Mathematics; Additive white Gaussian noise; SIGNAL (programming language); Greedy algorithm; Space (punctuation); Basis (linear algebra); Gaussian; Noise (video); Computer science; White noise; Artificial intelligence; Combinatorics; Statistics","score_opus":0.02407761480701673,"score_gpt":0.28081189330877177,"score_spread":0.256734278501755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049079538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02526007,0.00128462,0.96502477,0.0008380825,0.00010430086,0.00007760893,0.00023734361,0.00038048005,0.0067927754],"genre_scores_gemma":[0.6222896,0.0027266915,0.36112568,0.0006034964,0.0005432651,0.000392193,0.0010348945,0.0007901193,0.010494003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949103,0.0028980013,0.00013132663,0.00032519898,0.0012807794,0.00045447706],"domain_scores_gemma":[0.9579208,0.036460202,0.0009907711,0.0021309436,0.0019549837,0.00054230785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009044945,0.0017578488,0.0019046955,0.001457514,0.0006500101,0.002153324,0.0020601577,0.0023079421,0.007843188],"category_scores_gemma":[0.049768463,0.00094921933,0.0006400583,0.0017854059,0.0027460547,0.005487616,0.0035175234,0.002699096,0.0012913161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00151946,0.00020128449,0.0014146483,0.00037400605,0.00010258472,0.000117805364,0.00019890684,0.57346016,0.007061749,0.338717,0.0064585763,0.07037373],"study_design_scores_gemma":[0.00002629989,0.000080538004,0.00019769625,0.000022399709,0.000011680882,0.000045511435,0.000020821915,0.95326835,0.0010065202,0.044718947,0.000585438,0.000015826645],"about_ca_topic_score_codex":0.0018645579,"about_ca_topic_score_gemma":0.0016400581,"teacher_disagreement_score":0.009044945,"about_ca_system_score_codex":0.0015631329,"about_ca_system_score_gemma":0.002580843,"threshold_uncertainty_score":0.047834814},"labels":[],"label_agreement":null},{"id":"W2049338538","doi":"10.1109/iscas.2012.6271884","title":"Reconstruction of block-sparse signals by using an l&lt;inf&gt;2/p&lt;/inf&gt;-regularized least-squares algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Conjugate gradient method; Compressed sensing; Block (permutation group theory); Minification; Norm (philosophy); Computation; Line search; Point (geometry); Mathematics; Computer science; Combinatorics; Mathematical optimization","score_opus":0.023004324005413156,"score_gpt":0.23924682712326087,"score_spread":0.2162425031178477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049338538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016462124,0.000047028258,0.99785453,0.00004238491,0.000015131221,0.000010850893,0.000019998162,0.00012575144,0.00023812031],"genre_scores_gemma":[0.029270513,0.00018379456,0.9689406,0.000046965575,0.000034538487,0.00006496714,0.00012963382,0.000047336278,0.0012817145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995722,0.00011042307,0.000024331703,0.000077360586,0.00019348052,0.000022207743],"domain_scores_gemma":[0.99951184,0.0002234944,0.000060316415,0.000079158635,0.00010544229,0.000019828312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073560054,0.00061221083,0.00083242403,0.0004931742,0.00020932492,0.00059834134,0.00069587346,0.0008812442,0.0018153898],"category_scores_gemma":[0.0019805639,0.0003527425,0.0006330567,0.00075075886,0.00040923865,0.0010403249,0.00080702326,0.0010760295,0.0009905065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031884582,0.00012430472,0.0006076165,0.0002888997,0.00011619059,0.00020061867,0.00013184313,0.3937079,0.088613875,0.03649558,0.0047087516,0.4746856],"study_design_scores_gemma":[0.000013542412,0.000056275112,0.00010979542,0.000007837187,0.000009925118,0.000105261766,0.0000068889863,0.9874765,0.007239933,0.0024363815,0.0025240874,0.000013627127],"about_ca_topic_score_codex":0.0010623068,"about_ca_topic_score_gemma":0.0015822795,"teacher_disagreement_score":0.0018153898,"about_ca_system_score_codex":0.00030659395,"about_ca_system_score_gemma":0.0007433907,"threshold_uncertainty_score":0.0060730577},"labels":[],"label_agreement":null},{"id":"W2050698612","doi":"10.1109/isspa.2012.6310680","title":"A novel automated approach for segmenting lateral ventricle in MR images of the brain using sparse representation classification and dictionary learning","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Saskatchewan Health Authority; University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Sparse approximation; Artificial intelligence; Computer science; Pattern recognition (psychology); Segmentation; Market segmentation; K-SVD; Representation (politics); Image segmentation; Computer vision","score_opus":0.05135255233683044,"score_gpt":0.2854290410604884,"score_spread":0.23407648872365794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050698612","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033088163,0.00006415222,0.9957777,0.0000779457,0.000018725348,0.000033535085,0.000030224683,0.00036583468,0.00032300258],"genre_scores_gemma":[0.038172178,0.00019463948,0.9595795,0.000088073924,0.00005773,0.00007953751,0.00024333765,0.00008840118,0.0014964766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.00008045246,0.000034887,0.00012288566,0.00019847906,0.00005415523],"domain_scores_gemma":[0.9994024,0.00017946555,0.000083842955,0.00010882074,0.00018828646,0.00003719682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058326125,0.00055041094,0.00090653595,0.0017789655,0.00037343163,0.0009642333,0.000961659,0.001302341,0.0013200721],"category_scores_gemma":[0.0014757006,0.000408013,0.0009426231,0.0011836394,0.00048795497,0.0011917204,0.0010197603,0.001100056,0.0009531398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012270643,0.0001242424,0.0009986267,0.00015055972,0.00006772803,0.00020058258,0.00020582018,0.041242156,0.092883416,0.009122338,0.005169453,0.8497124],"study_design_scores_gemma":[0.000016164671,0.00010444727,0.0008353355,0.000017759903,0.000026203217,0.0006192148,0.00006311596,0.9646327,0.02283412,0.0060738083,0.0047467523,0.000030379051],"about_ca_topic_score_codex":0.0016460457,"about_ca_topic_score_gemma":0.0027659435,"teacher_disagreement_score":0.0017789655,"about_ca_system_score_codex":0.0003222856,"about_ca_system_score_gemma":0.00076502725,"threshold_uncertainty_score":0.0044160485},"labels":[],"label_agreement":null},{"id":"W2051127768","doi":"10.3166/ria.20.757-774","title":"Kernel Basis Pursuit","year":2006,"lang":"fr","type":"article","venue":"Revue d intelligence artificielle","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Artificial intelligence; Pattern recognition (psychology); Computer science; Mathematics","score_opus":0.031139038441804313,"score_gpt":0.2502228104054959,"score_spread":0.21908377196369155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051127768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015564556,0.00027704224,0.99621445,0.00010494861,0.00003294798,0.000020454901,0.00004147219,0.0001704989,0.0015818478],"genre_scores_gemma":[0.15237656,0.0016211526,0.8360103,0.00020934154,0.00018059179,0.0002092553,0.0005283502,0.00020555739,0.008658863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888295,0.00036878657,0.00004932446,0.00018790292,0.00043304928,0.00007794247],"domain_scores_gemma":[0.9988115,0.00054881314,0.000092582195,0.00020281336,0.0002955564,0.000048687787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013923269,0.0010261901,0.0012185094,0.0007863423,0.00040586077,0.0012354343,0.0010163264,0.001534625,0.0035177309],"category_scores_gemma":[0.005755227,0.00043891039,0.0007929104,0.0014276318,0.0006918883,0.0014791377,0.0016767484,0.0017681649,0.002578123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022796192,0.00010783112,0.000731019,0.00038030866,0.00014346054,0.0001079411,0.00012693886,0.32497057,0.016015965,0.14927106,0.011486593,0.49643043],"study_design_scores_gemma":[0.000014696912,0.000032841268,0.00019136249,0.000016449858,0.000009546914,0.00006337097,0.000014836003,0.96549815,0.0025412242,0.0249296,0.006675037,0.000012860777],"about_ca_topic_score_codex":0.0012211238,"about_ca_topic_score_gemma":0.0010490248,"teacher_disagreement_score":0.0035177309,"about_ca_system_score_codex":0.00048237568,"about_ca_system_score_gemma":0.0008396391,"threshold_uncertainty_score":0.011767924},"labels":[],"label_agreement":null},{"id":"W2051397518","doi":"10.1007/s00034-011-9378-6","title":"Optimal Pilot Pattern Design for Compressed Sensing-Based Sparse Channel Estimation in OFDM Systems","year":2011,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mutual coherence; Coherence (philosophical gambling strategy); Orthogonal frequency-division multiplexing; Compressed sensing; Channel (broadcasting); Computer science; Mean squared error; Algorithm; Bit error rate; Electronic engineering; Mathematics; Statistics; Telecommunications; Engineering","score_opus":0.08006058573198464,"score_gpt":0.24065398460207627,"score_spread":0.1605933988700916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051397518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064851437,0.00013831336,0.99240404,0.00012789882,0.000024008386,0.000021744925,0.00003259245,0.000091756,0.00067445176],"genre_scores_gemma":[0.44671804,0.0006194725,0.55077094,0.00018062904,0.0001240535,0.00018910317,0.00021856699,0.00006935979,0.0011097917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999485,0.00019316957,0.000029808456,0.00007092277,0.00016895648,0.00005211166],"domain_scores_gemma":[0.99843246,0.00090746704,0.00014171879,0.0001300837,0.0003443266,0.000043944616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006817377,0.00065053714,0.00057817245,0.00044093843,0.00026427285,0.0006044858,0.00055220386,0.0008745531,0.0018221716],"category_scores_gemma":[0.0050968044,0.00039899946,0.0002468313,0.0006412608,0.0005990678,0.00096486375,0.0005536199,0.0007201706,0.00047877964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008223135,0.00020403934,0.0010555859,0.00047896215,0.00009328706,0.00024649533,0.00028305128,0.48642498,0.075276874,0.045422886,0.0046898294,0.38500166],"study_design_scores_gemma":[0.0000432009,0.00009568684,0.00015817581,0.000020511809,0.000015941465,0.00009562088,0.000020503183,0.98476136,0.0075766714,0.0063257297,0.0008724001,0.000014120232],"about_ca_topic_score_codex":0.0014900622,"about_ca_topic_score_gemma":0.002125401,"teacher_disagreement_score":0.0018221716,"about_ca_system_score_codex":0.00030195317,"about_ca_system_score_gemma":0.0011061877,"threshold_uncertainty_score":0.006095767},"labels":[],"label_agreement":null},{"id":"W2051911120","doi":"10.1109/mwscas.2010.5548758","title":"Reconstruction of sparse signals by minimizing a re-weighted approximate &amp;#x2113;&lt;inf&gt;0&lt;/inf&gt;-norm in the null space of the measurement matrix","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Norm (philosophy); Computation; Algorithm; Null (SQL); Signal reconstruction; Matrix (chemical analysis); SIGNAL (programming language); Mathematics; Computer science; Signal processing; Data mining; Telecommunications","score_opus":0.023510676831558025,"score_gpt":0.2299225527293759,"score_spread":0.20641187589781787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051911120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002926719,0.000045921137,0.9965342,0.000056253342,0.000016268963,0.000009841968,0.00001157517,0.000077776866,0.000321392],"genre_scores_gemma":[0.055307824,0.00024156053,0.9417261,0.0000625115,0.00004517584,0.0000683099,0.0001355497,0.00007038821,0.0023426749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995079,0.00012126324,0.000023526094,0.000116012394,0.00020401548,0.000027402106],"domain_scores_gemma":[0.999298,0.00031857568,0.00011241323,0.00010295068,0.00014259534,0.000025409883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121583,0.00095024914,0.00069213886,0.0005070565,0.0003022795,0.0008280223,0.0007877662,0.00094217376,0.0015833494],"category_scores_gemma":[0.0026148143,0.00036437064,0.00067524315,0.0006785877,0.00072300894,0.0014497602,0.00086354074,0.0010668291,0.0007271916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024718523,0.00010552646,0.0006288243,0.0002148489,0.000084703184,0.00019669013,0.00019244777,0.5120941,0.06320147,0.047300685,0.0033363963,0.37239712],"study_design_scores_gemma":[0.000008993364,0.000057042194,0.00011890281,0.000011309137,0.000008769188,0.00011505886,0.000017198192,0.98425496,0.010045734,0.0036414964,0.0017052512,0.000015176193],"about_ca_topic_score_codex":0.0015722734,"about_ca_topic_score_gemma":0.0025842588,"teacher_disagreement_score":0.0015833494,"about_ca_system_score_codex":0.0005370398,"about_ca_system_score_gemma":0.00094394473,"threshold_uncertainty_score":0.0053529143},"labels":[],"label_agreement":null},{"id":"W2053023753","doi":"10.1155/2014/317979","title":"Efficient LED‐SAC Sparse Estimator Using Fast Sequential Adaptive Coordinate‐Wise Optimization (LED‐2SAC)","year":2014,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Estimator; Computer science; Algorithm; Mathematics; Mathematical optimization; Control theory (sociology); Artificial intelligence; Statistics","score_opus":0.018231680972550734,"score_gpt":0.22494597498209282,"score_spread":0.20671429400954208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053023753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002971745,0.00010280483,0.99588865,0.000090509064,0.000032297678,0.000020205589,0.000034978315,0.00032081333,0.0005380014],"genre_scores_gemma":[0.08726584,0.0002599957,0.9087954,0.0001634576,0.00009896256,0.00014173085,0.0004218764,0.000130871,0.0027218654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993297,0.00018159328,0.000029839972,0.000103245766,0.00030084667,0.00005492181],"domain_scores_gemma":[0.9989446,0.00043979887,0.00011380485,0.00012244786,0.00031566757,0.000063655374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951155,0.00095552794,0.0010646954,0.00069987855,0.00039054113,0.0007144916,0.0009530712,0.0011241147,0.0018544004],"category_scores_gemma":[0.0031011575,0.0004982867,0.0007021584,0.0009999208,0.00058146205,0.0011072113,0.0014223738,0.0015418526,0.0009011178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032586072,0.00013240006,0.0018835448,0.00033515063,0.00013456742,0.00022139994,0.00018217377,0.5017698,0.03802107,0.0329725,0.014807813,0.40921378],"study_design_scores_gemma":[0.000017320757,0.00003217446,0.00014592489,0.000006711578,0.0000056902377,0.000073015515,0.0000087568205,0.9928284,0.0030288564,0.0016283056,0.0022131687,0.000011613931],"about_ca_topic_score_codex":0.003884187,"about_ca_topic_score_gemma":0.005589787,"teacher_disagreement_score":0.003884187,"about_ca_system_score_codex":0.00040503632,"about_ca_system_score_gemma":0.0022752276,"threshold_uncertainty_score":0.0077231526},"labels":[],"label_agreement":null},{"id":"W2054439341","doi":"10.1109/twc.2013.012313.121150","title":"Transmission Control for Compressive Sensing Video over Wireless Channel","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Wireless; Power control; Real-time computing; Transmission (telecommunications); Wireless sensor network; Channel (broadcasting); Node (physics); Wireless network; Computer network; Compressed sensing; Power (physics); Telecommunications; Algorithm; Engineering","score_opus":0.02248239599713587,"score_gpt":0.252618535302647,"score_spread":0.23013613930551113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054439341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024451192,0.0003903398,0.9729634,0.0002687629,0.000060611063,0.000039648352,0.00003637286,0.00011336008,0.0016762741],"genre_scores_gemma":[0.9329078,0.000586265,0.06389431,0.00011129679,0.00011392786,0.00009178287,0.00006994996,0.000037526952,0.002187153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993693,0.00017653468,0.000026904685,0.00013799753,0.00022532257,0.00006395719],"domain_scores_gemma":[0.99859565,0.0008804295,0.00023241855,0.000070719376,0.00017944658,0.000041438874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009602925,0.0006065042,0.00045471083,0.00025819195,0.000317033,0.0005094143,0.0007014183,0.000565774,0.0010184005],"category_scores_gemma":[0.0033402946,0.00016288155,0.00026936125,0.00040052764,0.00070102804,0.0010047418,0.0005943128,0.0008321036,0.00012751114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020624384,0.000087092674,0.00035229168,0.00016652384,0.000027858057,0.00015381284,0.00012778741,0.90222776,0.017285503,0.028367957,0.0011372565,0.049859766],"study_design_scores_gemma":[0.0000078783505,0.000043968066,0.000052010408,0.0000039285223,0.000004084312,0.000019521303,0.000008120603,0.99649614,0.0013408674,0.0018137565,0.00020558748,0.0000041215976],"about_ca_topic_score_codex":0.0033752457,"about_ca_topic_score_gemma":0.0021861743,"teacher_disagreement_score":0.0033752457,"about_ca_system_score_codex":0.00072277855,"about_ca_system_score_gemma":0.0006333077,"threshold_uncertainty_score":0.006711185},"labels":[],"label_agreement":null},{"id":"W2054802669","doi":"10.5220/0005277902950299","title":"Estimating Positive Definite Matrices using Frechet Mean","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Positive-definite matrix; Covariance matrix; Covariance; Estimation of covariance matrices; Mathematics; Matrix (chemical analysis); Algorithm; Set (abstract data type); Estimation theory; Mathematical optimization; Computer science; Applied mathematics; Statistics; Eigenvalues and eigenvectors","score_opus":0.061709604471339254,"score_gpt":0.27612172563358717,"score_spread":0.21441212116224792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054802669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041069062,0.000059090456,0.9952957,0.00007194425,0.00001586293,0.000010994722,0.000012703821,0.00012474245,0.0003021272],"genre_scores_gemma":[0.24432404,0.00056736014,0.75182056,0.00026849774,0.00014265711,0.00010230844,0.00024409607,0.00013569639,0.002394745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992173,0.00022755124,0.000037370715,0.00014160894,0.00032698482,0.000049133938],"domain_scores_gemma":[0.99613047,0.0023675417,0.00046782888,0.0003576439,0.0006173996,0.000059125014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017955047,0.0009849431,0.000689349,0.0011722969,0.00052096025,0.0009804346,0.0006968324,0.0012805734,0.0012938085],"category_scores_gemma":[0.009595874,0.00046807277,0.0005948832,0.00078281446,0.0010587136,0.0017242958,0.0008354802,0.0015246673,0.00064115605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014512053,0.00009753986,0.0019511824,0.00022088265,0.0001116301,0.00030391008,0.00031145613,0.5819364,0.06611387,0.07542733,0.004095228,0.26928538],"study_design_scores_gemma":[0.0000067233022,0.00006449512,0.00055932195,0.000015618793,0.000009454901,0.0001788665,0.000021861626,0.96626896,0.007914994,0.023148993,0.0017691039,0.000041626965],"about_ca_topic_score_codex":0.0029242907,"about_ca_topic_score_gemma":0.0034233627,"teacher_disagreement_score":0.0029242907,"about_ca_system_score_codex":0.00049074605,"about_ca_system_score_gemma":0.00095398835,"threshold_uncertainty_score":0.009495616},"labels":[],"label_agreement":null},{"id":"W2055244679","doi":"10.1155/2013/985819","title":"MR Image Reconstruction Based on Iterative Split Bregman Algorithm and Nonlocal Total Variation","year":2013,"lang":"en","type":"article","venue":"Computational and Mathematical Methods in Medicine","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal University Hospital; University of Saskatchewan","funders":"Government of Canada","keywords":"Algorithm; Iterative reconstruction; Regularization (linguistics); Total variation denoising; Variation (astronomy); Mathematics; Computational complexity theory; Compressed sensing; Image (mathematics); Iterative method; Computer science; Mathematical optimization; Artificial intelligence; Physics","score_opus":0.019730253832916295,"score_gpt":0.3251729741376548,"score_spread":0.3054427203047385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055244679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026937625,0.00015935017,0.99658537,0.000053388652,0.000010614437,0.000015368265,0.000009205709,0.000117580734,0.00035531574],"genre_scores_gemma":[0.04866338,0.00032375235,0.94928354,0.000052922816,0.000018778368,0.00007183164,0.00008732423,0.000094290794,0.0014040507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991953,0.00021423583,0.000040001454,0.00011967037,0.0003956588,0.000035128505],"domain_scores_gemma":[0.9994905,0.00018905249,0.00008061687,0.0000914274,0.00012657487,0.000021834549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009079795,0.0007549303,0.0011144314,0.0009186766,0.00037788495,0.0008137771,0.0012991948,0.0011867252,0.0010664978],"category_scores_gemma":[0.0022873299,0.00051038316,0.000743845,0.0010589588,0.0007086631,0.0015050676,0.0011983424,0.0010699995,0.0004782827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023985351,0.000091282905,0.000845165,0.0004195241,0.00014062009,0.00030478806,0.00040321983,0.3481821,0.07633919,0.07476285,0.0029930812,0.49527818],"study_design_scores_gemma":[0.000015637377,0.000061523126,0.000231911,0.000014931113,0.000011889542,0.000326529,0.000016973323,0.9770205,0.011520207,0.007809506,0.0029404175,0.000030057556],"about_ca_topic_score_codex":0.0011297496,"about_ca_topic_score_gemma":0.0015589865,"teacher_disagreement_score":0.0012991948,"about_ca_system_score_codex":0.00044275649,"about_ca_system_score_gemma":0.00096477603,"threshold_uncertainty_score":0.0048018694},"labels":[],"label_agreement":null},{"id":"W2057424870","doi":"10.1088/0266-5611/26/2/025002","title":"Numerical methods for the design of large-scale nonlinear discrete ill-posed inverse problems","year":2009,"lang":"en","type":"article","venue":"Inverse Problems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Tikhonov regularization; Mathematics; Inverse problem; Regularization (linguistics); Nonlinear system; Well-posed problem; Mathematical optimization; Applied mathematics; Minification; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03892780584061213,"score_gpt":0.3070670433527876,"score_spread":0.2681392375121755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057424870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003408658,0.000060322553,0.9991788,0.00006379435,0.00001007743,0.000027265949,0.000007673189,0.000036023466,0.00027524008],"genre_scores_gemma":[0.05406401,0.00034905272,0.9433287,0.000103201826,0.000055696044,0.00090898806,0.00006927876,0.000083568215,0.0010375193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839145,0.00081468094,0.00008489309,0.00013544144,0.0005262159,0.00004734154],"domain_scores_gemma":[0.99212086,0.0060786554,0.0006725911,0.00036856267,0.000635858,0.00012346022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052451226,0.001351108,0.0012679525,0.00096343353,0.0005269769,0.0011632001,0.0013004154,0.0018584038,0.0028712254],"category_scores_gemma":[0.014781506,0.00079841865,0.0008141246,0.0007643914,0.0023181604,0.0010828411,0.0020779725,0.0024770563,0.0006410937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007614766,0.000055277796,0.0002763985,0.0003916489,0.00004384581,0.000049418653,0.00009342146,0.8497042,0.004340317,0.11153922,0.0008459931,0.032584026],"study_design_scores_gemma":[0.000023095623,0.000025334104,0.000029274841,0.000019468784,0.0000039419892,0.000010043706,0.000006516209,0.9789163,0.0004839569,0.019449094,0.0010260488,0.000006893038],"about_ca_topic_score_codex":0.000875155,"about_ca_topic_score_gemma":0.0010966476,"teacher_disagreement_score":0.0052451226,"about_ca_system_score_codex":0.0008859556,"about_ca_system_score_gemma":0.0016872656,"threshold_uncertainty_score":0.027739167},"labels":[],"label_agreement":null},{"id":"W2058269785","doi":"10.1109/tasl.2013.2263142","title":"Second Order Methods for Optimizing Convex Matrix Functions and Sparse Covariance Clustering","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Audio Speech and Language Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Management and Science University; Division of Mathematical Sciences; Rice University; Natural Sciences and Engineering Research Council of Canada; Northwestern University","keywords":"Covariance; Covariance matrix; Hessian matrix; Computer science; Algorithm; Optimization problem; Mathematical optimization; Cluster analysis; Matrix (chemical analysis); Divergence (linguistics); Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.01492480232061018,"score_gpt":0.2876448535775226,"score_spread":0.27272005125691245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058269785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000772098,0.00017194377,0.9981388,0.00008972532,0.00001808196,0.0000112621665,0.000019712932,0.00011078552,0.00066755794],"genre_scores_gemma":[0.07000968,0.0010142875,0.9221698,0.0002136544,0.00014367572,0.000269897,0.0003132397,0.00041353414,0.005452226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875534,0.00044966082,0.000057086512,0.00015365072,0.0005027457,0.00008155925],"domain_scores_gemma":[0.9976447,0.0014025612,0.0001625281,0.0002673295,0.00045879526,0.00006391601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025234648,0.0016681984,0.0011680946,0.0014443803,0.0006554277,0.0014777312,0.0014547728,0.0017335031,0.0024870087],"category_scores_gemma":[0.008065562,0.000911643,0.0012003147,0.0018114167,0.0016598532,0.0018700848,0.0016194144,0.0023461818,0.0012769866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040616655,0.00004072301,0.0003271744,0.00022023196,0.00006069701,0.00004725831,0.00012585857,0.7570483,0.002831884,0.15890464,0.0045155254,0.07583704],"study_design_scores_gemma":[0.0000046664027,0.0000124810595,0.00005967757,0.000011054663,0.000003473194,0.000015696898,0.0000080067,0.96950567,0.0006653633,0.02805026,0.0016541848,0.000009382124],"about_ca_topic_score_codex":0.006154529,"about_ca_topic_score_gemma":0.006626423,"teacher_disagreement_score":0.006154529,"about_ca_system_score_codex":0.0015539038,"about_ca_system_score_gemma":0.002325833,"threshold_uncertainty_score":0.01334554},"labels":[],"label_agreement":null},{"id":"W205955364","doi":"10.1007/978-3-642-34141-0_19","title":"Simultaneous Convex Optimization of Regions and Region Parameters in Image Segmentation Models","year":2012,"lang":"en","type":"book-chapter","venue":"Mathematics and visualization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Maxima and minima; Regular polygon; Mathematics; Piecewise; Image segmentation; Proper convex function; Conic optimization; Convex optimization; Relaxation (psychology); Image (mathematics); Segmentation; Dimension (graph theory); Mathematical optimization; Focus (optics); Convex analysis; Algorithm; Artificial intelligence; Computer science; Combinatorics; Mathematical analysis; Geometry; Physics","score_opus":0.03636128059645777,"score_gpt":0.2626620752144736,"score_spread":0.22630079461801583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205955364","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012189111,0.0004523147,0.99712557,0.00014717036,0.000012360285,0.000007778039,0.000037023172,0.00009991701,0.00089910516],"genre_scores_gemma":[0.1928435,0.0039548893,0.7881704,0.00020324763,0.00028369515,0.00023908398,0.0005029281,0.0007591417,0.013043115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.00021972685,0.00002069963,0.00011391422,0.00013861503,0.00002951256],"domain_scores_gemma":[0.99873155,0.0009343492,0.00009727176,0.000100873534,0.00010599277,0.000029984207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012519831,0.0012459737,0.001444656,0.000555776,0.00029808318,0.0015283419,0.0015890555,0.0015606195,0.0018981916],"category_scores_gemma":[0.0033876514,0.0013862487,0.0011657692,0.0012090263,0.0014357743,0.0024241854,0.0014495372,0.0024154156,0.000785463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005417015,0.000024467305,0.00014016392,0.0002139996,0.00005358818,0.000050767296,0.00011718832,0.8027359,0.005930776,0.11253523,0.0043784752,0.07376531],"study_design_scores_gemma":[0.0000017709037,0.00000796089,0.000039536822,0.000010127726,0.000007090022,0.000024487475,0.0000062764534,0.96389794,0.0008653147,0.033778995,0.0013528112,0.0000076722345],"about_ca_topic_score_codex":0.0035176391,"about_ca_topic_score_gemma":0.0050550075,"teacher_disagreement_score":0.0035176391,"about_ca_system_score_codex":0.0010799998,"about_ca_system_score_gemma":0.00081156695,"threshold_uncertainty_score":0.007836044},"labels":[],"label_agreement":null},{"id":"W2059619892","doi":"10.1109/icip.2010.5654000","title":"Block-based adaptive compressed sensing for video","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Redundancy (engineering); Compressed sensing; Computer vision; Artificial intelligence; Adaptive sampling; Intra-frame; Block (permutation group theory); Nyquist rate; Iterative reconstruction; Sampling (signal processing); Pixel; Mathematics","score_opus":0.016317378232040373,"score_gpt":0.22780335828899,"score_spread":0.21148598005694963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059619892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01118684,0.0014354826,0.9843031,0.0002611798,0.00006701514,0.00006182457,0.000056572837,0.0002322647,0.0023957302],"genre_scores_gemma":[0.44647336,0.0031231777,0.5454503,0.00031127123,0.0002378094,0.00018743667,0.00023619291,0.000053904823,0.003926573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997061,0.00006888179,0.000009784601,0.000031844585,0.00016712444,0.000016354088],"domain_scores_gemma":[0.9997056,0.00014557979,0.000030201576,0.00003907614,0.00006859155,0.000010884383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002878598,0.0002902563,0.0002746256,0.00041934758,0.00019354082,0.0002504302,0.00044169035,0.0004382906,0.0014460048],"category_scores_gemma":[0.0012049909,0.000099084486,0.00019403991,0.0006365824,0.00026936433,0.0005071094,0.0003380487,0.00045531135,0.00032480876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032880873,0.00010368759,0.0009414641,0.00038707684,0.00007278517,0.00018182717,0.00013250759,0.22344275,0.13262546,0.056672174,0.008138747,0.5769726],"study_design_scores_gemma":[0.00002019915,0.00009282309,0.0003849069,0.000016075057,0.0000120028835,0.00012573822,0.000011824044,0.9761345,0.010899363,0.00584864,0.006439621,0.000014345514],"about_ca_topic_score_codex":0.002813945,"about_ca_topic_score_gemma":0.0031873886,"teacher_disagreement_score":0.002813945,"about_ca_system_score_codex":0.0003145153,"about_ca_system_score_gemma":0.00037070012,"threshold_uncertainty_score":0.005595088},"labels":[],"label_agreement":null},{"id":"W2062459594","doi":"10.1109/iscas.2013.6572105","title":"A new algorithm for compressive sensing based on total-variation norm","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjugate gradient method; Algorithm; Norm (philosophy); Compressed sensing; Minification; Variation (astronomy); Computer science; Iterative reconstruction; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.009896892014149155,"score_gpt":0.21110989774357797,"score_spread":0.20121300572942882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062459594","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004678395,0.00007437138,0.9987895,0.00004534445,0.000045803805,0.000017838274,0.000013079529,0.00010131285,0.00044489338],"genre_scores_gemma":[0.023903709,0.000308194,0.9729586,0.000091130816,0.00009175093,0.00013066392,0.000112410446,0.00010761475,0.0022959576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992005,0.00017950305,0.00004123573,0.00012195125,0.00041906573,0.000037748483],"domain_scores_gemma":[0.9992724,0.00030538358,0.00006514399,0.00009724233,0.00022544946,0.00003427969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008465919,0.0008542699,0.000855557,0.0007904619,0.0003903673,0.0010789575,0.0013366198,0.0010769048,0.0026902156],"category_scores_gemma":[0.002721498,0.000423109,0.00069031614,0.00093248265,0.0009454199,0.0016047086,0.0013138402,0.0018553716,0.001159934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019832546,0.000072495226,0.00045425433,0.00044050897,0.00011368582,0.00020646605,0.00015185968,0.19766246,0.056973327,0.15906304,0.009169909,0.5754937],"study_design_scores_gemma":[0.000025506646,0.00008710218,0.00015168464,0.000024413654,0.000015031381,0.00031796304,0.000017224296,0.9567007,0.011680708,0.017073583,0.013870166,0.000036025616],"about_ca_topic_score_codex":0.0009994169,"about_ca_topic_score_gemma":0.0012876685,"teacher_disagreement_score":0.0026902156,"about_ca_system_score_codex":0.0004893932,"about_ca_system_score_gemma":0.00093165145,"threshold_uncertainty_score":0.008999705},"labels":[],"label_agreement":null},{"id":"W2062892927","doi":"10.1109/icip.2012.6467209","title":"A focuss based method for low rank matrix recovery","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Inpainting; Solver; Matrix completion; Minification; Matrix (chemical analysis); Low-rank approximation; Computer science; Rank (graph theory); Mathematical optimization; Matrix norm; Norm (philosophy); Algorithm; Sparse matrix; Image (mathematics); Mathematics; Artificial intelligence; Combinatorics","score_opus":0.016575216152170794,"score_gpt":0.28591252783823645,"score_spread":0.2693373116860657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062892927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016008862,0.000108243934,0.9972319,0.000054655622,0.000024562985,0.000027712016,0.00002285194,0.00027495774,0.00065430155],"genre_scores_gemma":[0.042984746,0.00028462763,0.9525781,0.00013642239,0.0000764264,0.00010355017,0.0001979184,0.0001483292,0.003489801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.00012598389,0.00002773671,0.00010362095,0.0003424398,0.000028230761],"domain_scores_gemma":[0.9994355,0.00019153295,0.00005372435,0.000097119824,0.00018672764,0.000035380363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006787889,0.0009861356,0.00069396116,0.000982886,0.00047406755,0.0005873515,0.0011295005,0.0012789365,0.0049286103],"category_scores_gemma":[0.0017974678,0.00044088252,0.00071697915,0.00070596277,0.00067191856,0.0015180671,0.0013893269,0.0014153975,0.0017250207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000244799,0.00014893206,0.00054171524,0.00045813946,0.00012985626,0.00024846487,0.0003408942,0.078122705,0.16115883,0.04035101,0.010694686,0.70755994],"study_design_scores_gemma":[0.000047620466,0.0001389378,0.0002819304,0.00002408299,0.000024593983,0.00051933236,0.000047747617,0.9414093,0.038414117,0.006772101,0.012279953,0.00004030796],"about_ca_topic_score_codex":0.0010704956,"about_ca_topic_score_gemma":0.002063295,"teacher_disagreement_score":0.0049286103,"about_ca_system_score_codex":0.0003574295,"about_ca_system_score_gemma":0.00084921246,"threshold_uncertainty_score":0.016487896},"labels":[],"label_agreement":null},{"id":"W2063568666","doi":"10.1016/j.compbiomed.2015.04.014","title":"Sparsity-constrained three-dimensional image reconstruction for C-arm angiography","year":2015,"lang":"en","type":"article","venue":"Computers in Biology and Medicine","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alzheimer Society Research Program","keywords":"Scanner; Rotational angiography; Fluoroscopy; Computer vision; Artificial intelligence; Projection (relational algebra); Computer science; Angiography; Iterative reconstruction; Offset (computer science); Medicine; Radiology; Algorithm","score_opus":0.02672342431760597,"score_gpt":0.276479577962575,"score_spread":0.24975615364496903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063568666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007267047,0.00025517412,0.9905813,0.00046160675,0.00001847978,0.000022980084,0.00010212197,0.00022997525,0.0010613377],"genre_scores_gemma":[0.23111293,0.0009190337,0.76415396,0.00035918175,0.00007881716,0.00015859764,0.0004279124,0.00017853615,0.0026109882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996662,0.000112995076,0.00002183033,0.000036046367,0.00013692107,0.000026045784],"domain_scores_gemma":[0.99888545,0.00064581475,0.00011345438,0.00013499161,0.0001641361,0.00005619946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058302,0.0004941292,0.0005930942,0.00047593412,0.00025490264,0.0011316705,0.0007307614,0.0012884745,0.0018655175],"category_scores_gemma":[0.0037158537,0.00044264572,0.00046027492,0.0007076093,0.00047452305,0.00090702967,0.0012938943,0.001590043,0.00055712153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009450358,0.00023815245,0.0023567227,0.0007081441,0.00013315248,0.0006489906,0.00032168048,0.38066486,0.11118513,0.040739764,0.013003024,0.44905534],"study_design_scores_gemma":[0.000017170876,0.000036928854,0.00034583436,0.00002048559,0.000011183995,0.00029840332,0.000023442917,0.9810277,0.009630525,0.006468477,0.0020947566,0.00002514391],"about_ca_topic_score_codex":0.002018494,"about_ca_topic_score_gemma":0.002802038,"teacher_disagreement_score":0.002018494,"about_ca_system_score_codex":0.0002778799,"about_ca_system_score_gemma":0.0011531063,"threshold_uncertainty_score":0.0062407255},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023488488135037677,"score_gpt":0.3072439672906072,"score_spread":0.28375547915556953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063761188","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058496575,0.000096382246,0.9980508,0.00013150582,0.000035368732,0.000021611135,0.00002790074,0.00007475645,0.0009767497],"genre_scores_gemma":[0.041405056,0.0004140677,0.9490022,0.00022386582,0.00016369301,0.00041067498,0.00025938274,0.00040553414,0.0077154385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988772,0.00054855837,0.000047672464,0.00017593075,0.00029814674,0.000052477128],"domain_scores_gemma":[0.9971656,0.001869868,0.0001704561,0.00022998398,0.00048674704,0.00007725408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024376486,0.0019082034,0.0013938819,0.000972059,0.0005773993,0.0016724995,0.0024423085,0.0026013202,0.0062334826],"category_scores_gemma":[0.009634188,0.0010850225,0.0010211972,0.0011792538,0.001885732,0.0021463619,0.0027306876,0.0031118754,0.0019587276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009431022,0.00012129703,0.00025336276,0.00052546116,0.00010812742,0.00013784542,0.00014006344,0.6840877,0.0040019853,0.16625431,0.013513514,0.13076206],"study_design_scores_gemma":[0.0000065063114,0.000011667194,0.000018904559,0.000014168166,0.0000052330556,0.000015912874,0.000009243683,0.98071414,0.00049590936,0.016820569,0.0018806377,0.000007152882],"about_ca_topic_score_codex":0.0034073647,"about_ca_topic_score_gemma":0.004736338,"teacher_disagreement_score":0.0062334826,"about_ca_system_score_codex":0.0009340352,"about_ca_system_score_gemma":0.0018436629,"threshold_uncertainty_score":0.020853102},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Scalar (mathematics); Geometry","score_opus":0.009047416774174153,"score_gpt":0.1988572305365369,"score_spread":0.18980981376236275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066086960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01480407,0.0031715527,0.96971714,0.0017904718,0.000265843,0.000019747455,0.00008874469,0.00013593504,0.010006471],"genre_scores_gemma":[0.61697274,0.011631546,0.32901648,0.0015430186,0.0028424351,0.00020242335,0.00039755407,0.00042483505,0.036968905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871767,0.00068136596,0.00005391876,0.00015152364,0.0003380013,0.00005756989],"domain_scores_gemma":[0.9930148,0.0050617866,0.0004548078,0.00053929735,0.0007218636,0.00020742477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518289,0.0015916632,0.0014716295,0.0027850617,0.0006862071,0.0019567637,0.00129459,0.002600865,0.0028288579],"category_scores_gemma":[0.014376435,0.0006825878,0.0009749333,0.0025289648,0.005740849,0.0059183193,0.0024657545,0.0032406054,0.0006216961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000260847,0.000016641243,0.00013501968,0.00007148629,0.000013578857,0.00006534039,0.0001060201,0.019180935,0.00092988927,0.9638368,0.0017401138,0.013878049],"study_design_scores_gemma":[0.0000061143814,0.000016717471,0.00014187291,0.000015778094,0.0000098774835,0.00011693921,0.00004443535,0.20304844,0.0004194173,0.7936772,0.002487149,0.000015923302],"about_ca_topic_score_codex":0.0014245943,"about_ca_topic_score_gemma":0.0009854105,"teacher_disagreement_score":0.003518289,"about_ca_system_score_codex":0.0011084466,"about_ca_system_score_gemma":0.0007086914,"threshold_uncertainty_score":0.018606663},"labels":[],"label_agreement":null},{"id":"W2066337887","doi":"10.1109/tsp.2014.2362886","title":"Reduced Complexity HMM Filtering With Stochastic Dominance Bounds: A Convex Optimization Approach","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Hidden Markov model; Markov chain; Convex optimization; Matrix completion; Stochastic dominance; Mathematical optimization; Algorithm; Regular polygon; Applied mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.025221121244948682,"score_gpt":0.22485014749441157,"score_spread":0.19962902624946288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066337887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009674185,0.000075135395,0.9980945,0.00008318024,0.000011354865,0.000009028039,0.000021765432,0.000074974065,0.00066262926],"genre_scores_gemma":[0.21822336,0.001072711,0.76986784,0.00041425056,0.00031665212,0.00041361066,0.00051813823,0.00044521716,0.008728179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979109,0.00084900705,0.00008756634,0.0002961207,0.00068156165,0.00017483404],"domain_scores_gemma":[0.9926762,0.005956105,0.000278537,0.00038327993,0.0005628544,0.00014312581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037986594,0.0015653856,0.001586428,0.0012227875,0.0006177574,0.0020264073,0.0015840061,0.0015369868,0.004047801],"category_scores_gemma":[0.011878531,0.001053224,0.001315379,0.0009487722,0.001454504,0.002581621,0.0021941033,0.0029487845,0.000928979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055394303,0.000039576636,0.00021685389,0.00008236264,0.00004197563,0.000060181068,0.00007001222,0.87045413,0.0018316227,0.0945918,0.0013318791,0.031224202],"study_design_scores_gemma":[0.0000027753938,0.000007674825,0.000025855396,0.000005394406,0.0000028412321,0.000006127464,0.0000023892146,0.98613703,0.00040345386,0.013052958,0.000349194,0.0000043261516],"about_ca_topic_score_codex":0.006743712,"about_ca_topic_score_gemma":0.006235063,"teacher_disagreement_score":0.006743712,"about_ca_system_score_codex":0.0025919974,"about_ca_system_score_gemma":0.0023415445,"threshold_uncertainty_score":0.020089507},"labels":[],"label_agreement":null},{"id":"W2066544664","doi":"10.1007/s00365-010-9117-4","title":"Restricted Isometry Property of Matrices with Independent Columns and Neighborly Polytopes by Random Sampling","year":2010,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Polytope; Restricted isometry property; Mathematics; Combinatorics; Convex hull; Isometry (Riemannian geometry); Regular polygon; Convex body; Convex polytope; Compressed sensing; Discrete mathematics; Convex set; Convex optimization; Pure mathematics; Geometry; Algorithm","score_opus":0.007001860467787129,"score_gpt":0.2031312011075564,"score_spread":0.19612934063976925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066544664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038395423,0.00029120664,0.9555601,0.0003247768,0.000060601724,0.00004751932,0.00017590124,0.0001077217,0.0050367825],"genre_scores_gemma":[0.7109714,0.001620288,0.2762084,0.0005263306,0.0006073218,0.00038546,0.0011469233,0.0003034798,0.00823042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972236,0.0010907348,0.00010591604,0.0005393152,0.0008947254,0.00014574017],"domain_scores_gemma":[0.9891234,0.007117956,0.0009888606,0.001524918,0.00086109084,0.00038381905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025387057,0.0016113404,0.0015442182,0.001514009,0.00054961065,0.0018709163,0.0015660803,0.0013616165,0.0031301351],"category_scores_gemma":[0.018794062,0.0011149544,0.0011430227,0.001456183,0.0038135645,0.0040417016,0.0022445172,0.0034466328,0.0006696331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032660743,0.00017280984,0.001095528,0.00026999065,0.000084309264,0.0003128578,0.00036362655,0.13121367,0.009497062,0.81723547,0.003314184,0.036113925],"study_design_scores_gemma":[0.00006178541,0.00012400401,0.00057643914,0.00002650342,0.000023970986,0.00029871307,0.000079920355,0.53286093,0.003112381,0.4607478,0.0020389508,0.000048605987],"about_ca_topic_score_codex":0.0010393575,"about_ca_topic_score_gemma":0.00072169484,"teacher_disagreement_score":0.0031301351,"about_ca_system_score_codex":0.00066606153,"about_ca_system_score_gemma":0.0007948156,"threshold_uncertainty_score":0.013426125},"labels":[],"label_agreement":null},{"id":"W2067041664","doi":"10.1007/s11045-013-0255-2","title":"Image denoising by generalized total variation regularization and least squares fidelity","year":2013,"lang":"en","type":"article","venue":"Multidimensional Systems and Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Total variation denoising; Regularization (linguistics); Minification; Noise reduction; Mathematics; Image denoising; Norm (philosophy); Mathematical optimization; Fidelity; Algorithm; Variation (astronomy); Computer science; Applied mathematics; Artificial intelligence; Telecommunications","score_opus":0.008292083592318766,"score_gpt":0.2070052879665825,"score_spread":0.19871320437426374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067041664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029746084,0.00013655191,0.99604815,0.00014882514,0.00003148911,0.0000069746516,0.000016182594,0.000059568698,0.00057769613],"genre_scores_gemma":[0.19962418,0.0011381714,0.78948736,0.00026693265,0.00021649852,0.00006443877,0.0001698474,0.0002211466,0.008811458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942005,0.00021087154,0.000028348884,0.00009557016,0.00021812023,0.000026991014],"domain_scores_gemma":[0.99910754,0.00043610737,0.00011574947,0.00015265851,0.00015640857,0.000031483192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010507156,0.00077602157,0.0008462189,0.0007154646,0.00027072243,0.0009589357,0.0008452664,0.0017653392,0.0011921426],"category_scores_gemma":[0.0040788506,0.00044954658,0.00080585055,0.00066971674,0.0013729759,0.001459098,0.0012272589,0.0015876769,0.00042324903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023147555,0.000095294825,0.00070074573,0.00044068458,0.000196694,0.00024284935,0.0002694717,0.4284785,0.061293174,0.27372715,0.0056873085,0.22863668],"study_design_scores_gemma":[0.0000097358725,0.000026135924,0.00017719575,0.00001602962,0.000018030563,0.00013273474,0.000018024373,0.958578,0.007987288,0.030544914,0.0024684635,0.000023368333],"about_ca_topic_score_codex":0.0012957847,"about_ca_topic_score_gemma":0.0017360738,"teacher_disagreement_score":0.0017653392,"about_ca_system_score_codex":0.00039168875,"about_ca_system_score_gemma":0.0005226361,"threshold_uncertainty_score":0.005556762},"labels":[],"label_agreement":null},{"id":"W2067125310","doi":"10.1109/wivec.2014.6953225","title":"Frame-based mobility estimation via compressive sensing in delay-tolerant vehicular networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mobility model; Frame (networking); Real-time computing; Scheme (mathematics); TRACE (psycholinguistics); Trajectory; Computer network","score_opus":0.0068494460753071055,"score_gpt":0.20747446366715958,"score_spread":0.20062501759185247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067125310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024551237,0.00033983996,0.97446436,0.00014668952,0.000028988587,0.000016823113,0.00003104995,0.000074813724,0.00034625496],"genre_scores_gemma":[0.8229845,0.000967569,0.17468882,0.00007339522,0.0001507787,0.00007721834,0.00018900202,0.000019238772,0.00084943953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961346,0.00014462584,0.000021251597,0.000069158436,0.000109875495,0.000041678388],"domain_scores_gemma":[0.9989642,0.0007127821,0.00012658436,0.00007119801,0.000093106406,0.000032101616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064286136,0.0005971185,0.00050085026,0.00040421126,0.00028980806,0.0003963014,0.000873684,0.0007210267,0.00024956113],"category_scores_gemma":[0.0029651849,0.00029566942,0.00025120546,0.0005737864,0.0006939258,0.0010873005,0.0006335552,0.00058618514,0.00008535358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012056649,0.000024404773,0.00067040336,0.0000822814,0.000025219646,0.00009693714,0.00012527047,0.93131846,0.0064887563,0.008626374,0.0004957627,0.05192551],"study_design_scores_gemma":[0.000004565328,0.000028377832,0.00011693444,0.0000038213593,0.0000036703211,0.000025016423,0.000016119686,0.9963606,0.0010433386,0.0021483644,0.0002435355,0.000005642672],"about_ca_topic_score_codex":0.0040746187,"about_ca_topic_score_gemma":0.002113199,"teacher_disagreement_score":0.0040746187,"about_ca_system_score_codex":0.0004547076,"about_ca_system_score_gemma":0.00044284365,"threshold_uncertainty_score":0.008101821},"labels":[],"label_agreement":null},{"id":"W2067810487","doi":"10.1109/icassp.2014.6854217","title":"Side information-aided compressed sensing reconstruction via approximate message passing","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Underdetermined system; Compressed sensing; Message passing; Computer science; Signal reconstruction; Noise (video); Sensitivity (control systems); Algorithm; SIGNAL (programming language); State (computer science); Signal processing; Theoretical computer science; Artificial intelligence; Parallel computing; Electronic engineering; Engineering; Telecommunications; Image (mathematics)","score_opus":0.007444358228117588,"score_gpt":0.1888769938345221,"score_spread":0.18143263560640452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067810487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006502383,0.00010991308,0.9924549,0.00011116958,0.000017468885,0.000019650575,0.00002611713,0.00014004625,0.0006183936],"genre_scores_gemma":[0.53897387,0.00044627942,0.45627564,0.0002224359,0.00011553196,0.00018185664,0.00024055976,0.00005753965,0.0034862175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999049,0.00036319936,0.00004147841,0.0001337981,0.0003401588,0.000072450166],"domain_scores_gemma":[0.9985587,0.00084986776,0.00016429895,0.0002045865,0.00018967374,0.000032987868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013004434,0.0009355542,0.0009838571,0.00040203368,0.00035873833,0.000751428,0.0010739885,0.0010165311,0.0012720332],"category_scores_gemma":[0.0043921093,0.00037305072,0.00043061314,0.0007416289,0.00091246504,0.0016627216,0.0012648526,0.0012728294,0.00039487646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040351474,0.000065921624,0.00072303205,0.00020948649,0.00007475392,0.00021459507,0.00023592112,0.7706072,0.014885637,0.07474998,0.0015318928,0.13629808],"study_design_scores_gemma":[0.000010874732,0.00003966644,0.000036831745,0.000005893945,0.0000062135027,0.000046093373,0.0000066204107,0.9905719,0.0032146159,0.0056472523,0.0004066886,0.0000072433454],"about_ca_topic_score_codex":0.0013904355,"about_ca_topic_score_gemma":0.0011981073,"teacher_disagreement_score":0.0013904355,"about_ca_system_score_codex":0.00043766014,"about_ca_system_score_gemma":0.00094513845,"threshold_uncertainty_score":0.006877482},"labels":[],"label_agreement":null},{"id":"W2068677177","doi":"10.1109/pcs.2013.6737750","title":"Low bit-rate image coding via local random down-sampling","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Upsampling; Computer science; Decimation; Encoder; Artificial intelligence; Computer vision; Algorithm; Codec; Filter (signal processing); Image (mathematics)","score_opus":0.011630776762309754,"score_gpt":0.2180561932052231,"score_spread":0.20642541644291335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068677177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017663026,0.0002806136,0.97966355,0.00009876963,0.00002568258,0.0000385382,0.000029146868,0.00027489755,0.0019257702],"genre_scores_gemma":[0.45569822,0.0006940893,0.53910893,0.00016028859,0.00006774707,0.00013070351,0.00014177777,0.00008006518,0.003918246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994649,0.00014099175,0.000020761843,0.000060394857,0.00028198093,0.0000309191],"domain_scores_gemma":[0.9993839,0.00024806516,0.00007747321,0.00015174465,0.00012035363,0.00001848006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904834,0.0004427968,0.00041242034,0.0003934128,0.00018460106,0.00044495304,0.00062234676,0.0003956063,0.001163121],"category_scores_gemma":[0.0018478314,0.00018577371,0.00026731123,0.00042969786,0.00052436214,0.0007113259,0.0006691043,0.0006426534,0.0004746226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052758906,0.00014235773,0.0011800521,0.0003533988,0.00006198206,0.00046083872,0.0002681967,0.22279173,0.29268646,0.09141879,0.0033023243,0.38680634],"study_design_scores_gemma":[0.000024569385,0.000081916696,0.00030770118,0.00002332309,0.00001589411,0.00030672055,0.000014930721,0.92973083,0.06207159,0.0047711576,0.002625083,0.000026261047],"about_ca_topic_score_codex":0.0009656022,"about_ca_topic_score_gemma":0.0012740089,"teacher_disagreement_score":0.001163121,"about_ca_system_score_codex":0.00026274685,"about_ca_system_score_gemma":0.0003443786,"threshold_uncertainty_score":0.0038910508},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.006768574504163851,"score_gpt":0.1985659125949414,"score_spread":0.19179733809077756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070145771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0644086,0.00034024558,0.92582256,0.00040153312,0.00009684332,0.00005051633,0.00013777791,0.00026505924,0.008476967],"genre_scores_gemma":[0.46860987,0.0003915092,0.5246828,0.00022582781,0.00009671287,0.000094279196,0.00023215085,0.00004654016,0.0056203213],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974626,0.000041536103,0.000008448395,0.000043639284,0.00013462988,0.000025365125],"domain_scores_gemma":[0.9996662,0.00010293971,0.000047022517,0.000075527794,0.00007774151,0.00003060079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022546579,0.00041823235,0.00030845864,0.00036727817,0.0001911342,0.00051090785,0.00073455926,0.00043829912,0.0015312961],"category_scores_gemma":[0.0007543245,0.00018471094,0.00017921123,0.00038941408,0.0006405346,0.0009623931,0.0010345303,0.00075915206,0.0003009998],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055014587,0.00021697409,0.0009839095,0.00024208636,0.000051066825,0.00034464177,0.0002080512,0.100917675,0.5123132,0.14241275,0.003093041,0.23866646],"study_design_scores_gemma":[0.000031275038,0.00010672612,0.00026061677,0.000020246522,0.000012184826,0.00030023107,0.000030485824,0.8461643,0.13539276,0.0120236715,0.005622889,0.000034615372],"about_ca_topic_score_codex":0.00043459632,"about_ca_topic_score_gemma":0.00094230886,"teacher_disagreement_score":0.0015312961,"about_ca_system_score_codex":0.00030811122,"about_ca_system_score_gemma":0.000415219,"threshold_uncertainty_score":0.005122721},"labels":[],"label_agreement":null},{"id":"W2071044073","doi":"10.1007/s11222-008-9054-2","title":"Output-sensitive algorithms for Tukey depth and related problems","year":2008,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of New Brunswick","funders":"","keywords":"Algorithm; Outlier; Point (geometry); Value (mathematics); Mathematics; Set (abstract data type); Tukey's range test; Computer science; Statistics; Geometry","score_opus":0.026519832492889434,"score_gpt":0.24183970951607608,"score_spread":0.21531987702318664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071044073","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021220548,0.00013513194,0.99659353,0.00011322429,0.000040344345,0.000026792268,0.00004819422,0.00015749634,0.0007630853],"genre_scores_gemma":[0.07755223,0.0004569953,0.9149317,0.00025201237,0.0001968966,0.00017949537,0.00029175237,0.00034748964,0.005791472],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787486,0.00072427944,0.000088746885,0.00034563476,0.00080609345,0.00016047365],"domain_scores_gemma":[0.9946471,0.0031848375,0.0003809404,0.00090346247,0.00064169796,0.00024187964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025723467,0.001850596,0.0016333596,0.0012599126,0.0010448119,0.0019693016,0.003303807,0.0022085328,0.007845171],"category_scores_gemma":[0.015701365,0.00088618265,0.0011456269,0.0018547898,0.002117981,0.0044661066,0.005299841,0.0047709956,0.0015400823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005574951,0.00024983636,0.00065505714,0.00045585123,0.00010140944,0.000088009554,0.0003095441,0.23136254,0.012468633,0.31494927,0.009467903,0.4293345],"study_design_scores_gemma":[0.000043543365,0.00009424402,0.00015765753,0.000033759206,0.000018087778,0.00007000562,0.000047098714,0.79213536,0.005922363,0.19799729,0.0034472388,0.000033355558],"about_ca_topic_score_codex":0.0014715377,"about_ca_topic_score_gemma":0.0030901488,"teacher_disagreement_score":0.007845171,"about_ca_system_score_codex":0.0013213527,"about_ca_system_score_gemma":0.0018918865,"threshold_uncertainty_score":0.0262447},"labels":[],"label_agreement":null},{"id":"W2071272049","doi":"10.1109/fbw.2011.5965565","title":"Low-power wireless sensor network with compressed sensing theory","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless sensor network; Compressed sensing; Computer science; Key distribution in wireless sensor networks; Real-time computing; Asynchronous communication; Wireless; Wireless network; Computer network; Embedded system; Telecommunications; Artificial intelligence","score_opus":0.013905768311479135,"score_gpt":0.18477410125896768,"score_spread":0.17086833294748854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071272049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032657175,0.0023553553,0.9887257,0.00045435267,0.00013331404,0.000050222134,0.00006536473,0.00014799954,0.0048018666],"genre_scores_gemma":[0.4803905,0.014071236,0.4949106,0.0006263236,0.0010624183,0.00044354986,0.00041543602,0.00007449195,0.008005475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99927384,0.00019673872,0.000035975052,0.00007925029,0.00038259156,0.000031526597],"domain_scores_gemma":[0.99933535,0.00042080745,0.000058532914,0.0000497913,0.00011909575,0.000016421904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050706445,0.0005869181,0.00058286195,0.00055737677,0.00028127144,0.00074115547,0.0008145059,0.00081980164,0.0011831986],"category_scores_gemma":[0.0020445366,0.00020361246,0.00033840953,0.0012076234,0.0007787651,0.0015707097,0.00070819183,0.0012008162,0.00036630538],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019360446,0.00009469757,0.0007242371,0.0010137417,0.00007631678,0.00051555556,0.0003352817,0.42205262,0.029701276,0.2706492,0.0083007235,0.2663428],"study_design_scores_gemma":[0.00002012599,0.00012710426,0.00023175732,0.00006352713,0.000021583264,0.0002960272,0.00004372014,0.92142856,0.00446881,0.06092839,0.012341898,0.000028500071],"about_ca_topic_score_codex":0.0010659122,"about_ca_topic_score_gemma":0.0006651968,"teacher_disagreement_score":0.0011831986,"about_ca_system_score_codex":0.0004938309,"about_ca_system_score_gemma":0.00044177924,"threshold_uncertainty_score":0.0039582253},"labels":[],"label_agreement":null},{"id":"W2071548530","doi":"10.5539/apr.v4n1p30","title":"Compressive Sensing Based Robust Signal Sampling","year":2012,"lang":"en","type":"article","venue":"Applied Physics Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Compressed sensing; Nyquist–Shannon sampling theorem; Nyquist rate; Computer science; Sampling (signal processing); SIGNAL (programming language); Algorithm; Signal reconstruction; A priori and a posteriori; Nyquist frequency; Coherent sampling; Key (lock); Signal processing; Telecommunications; Computer vision; Bandwidth (computing)","score_opus":0.18230836244531,"score_gpt":0.34797061663545453,"score_spread":0.16566225419014452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071548530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002875051,0.0005886324,0.99441457,0.00010882994,0.00003641656,0.0000337465,0.00005247197,0.00017471834,0.0017155275],"genre_scores_gemma":[0.25817445,0.0033071998,0.7332888,0.00030552794,0.00036668108,0.00030917113,0.00045655243,0.00011231076,0.003679295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832743,0.00047733978,0.0000840655,0.00029700383,0.0007447467,0.00006944673],"domain_scores_gemma":[0.9984357,0.0009035429,0.00014844417,0.0002380439,0.00023999855,0.000034414534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012433508,0.0009872791,0.0012446045,0.0007741812,0.00032184192,0.0009950125,0.00088035,0.0009612298,0.0016785284],"category_scores_gemma":[0.0050906665,0.0003467139,0.00057071424,0.0009624477,0.0010554559,0.0012381361,0.0013159121,0.0013327935,0.0008021715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045234113,0.00010219664,0.00065539,0.00068960234,0.00012953025,0.00023809676,0.00017588634,0.34517902,0.06719148,0.17303027,0.003716468,0.4084396],"study_design_scores_gemma":[0.000032414515,0.00014832288,0.000285971,0.000053787735,0.000025245508,0.00019990152,0.000023802742,0.93936497,0.022645101,0.027878758,0.009302807,0.00003888258],"about_ca_topic_score_codex":0.0006955615,"about_ca_topic_score_gemma":0.00055312837,"teacher_disagreement_score":0.0016785284,"about_ca_system_score_codex":0.0004644994,"about_ca_system_score_gemma":0.0006949248,"threshold_uncertainty_score":0.0065755844},"labels":[],"label_agreement":null},{"id":"W2071710078","doi":"10.1109/icosp.2014.7015181","title":"Video reconstruction using inductive three dimensional sparsity measure","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compressed sensing; Computer science; Measure (data warehouse); Artificial intelligence; Projection (relational algebra); Sparse matrix; Domain (mathematical analysis); Iterative reconstruction; Computer vision; Property (philosophy); Sequence (biology); Pattern recognition (psychology); Algorithm; Mathematics; Data mining","score_opus":0.029451879166531053,"score_gpt":0.21306210761927022,"score_spread":0.18361022845273917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071710078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029033111,0.00015580682,0.96903527,0.00012316908,0.000022865204,0.000025739639,0.000053159998,0.0001630798,0.0013877728],"genre_scores_gemma":[0.60469264,0.0003884136,0.3930849,0.00016939752,0.00007708774,0.00010220642,0.00033098698,0.00004047721,0.0011138796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992736,0.00018880735,0.000039848095,0.000113298614,0.0003354444,0.000048918915],"domain_scores_gemma":[0.9988457,0.00044707084,0.0002450316,0.00014852795,0.00023405843,0.000079559984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006986993,0.00047143403,0.0005104175,0.0009203114,0.00023862769,0.00062906335,0.0006825754,0.0005105248,0.0007404802],"category_scores_gemma":[0.0024001398,0.00014745229,0.0004774004,0.00065688597,0.000696846,0.0011424331,0.0016611449,0.0007023849,0.00018183287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005881863,0.00023893728,0.0045749038,0.0002702664,0.00011730396,0.00032667202,0.00022202799,0.33798832,0.10628837,0.078728564,0.0037773405,0.46687904],"study_design_scores_gemma":[0.000014356824,0.00017595476,0.0006178887,0.000013218321,0.000010265752,0.00019638159,0.000031093572,0.97306764,0.01878359,0.00582456,0.0012394376,0.0000255859],"about_ca_topic_score_codex":0.000659378,"about_ca_topic_score_gemma":0.0005541148,"teacher_disagreement_score":0.0009203114,"about_ca_system_score_codex":0.00042947367,"about_ca_system_score_gemma":0.00041979234,"threshold_uncertainty_score":0.0036951303},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006347213519459692,"score_gpt":0.20355703720722437,"score_spread":0.19720982368776468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072327470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007847988,0.00041640596,0.982522,0.0015844447,0.00008164999,0.000056479406,0.00020032722,0.00014467651,0.007146131],"genre_scores_gemma":[0.3933613,0.0019638308,0.587299,0.00083405356,0.00079924567,0.0005581007,0.0012174972,0.0006407984,0.013326098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982765,0.0009247276,0.0000626849,0.0002863517,0.0003266022,0.00012321849],"domain_scores_gemma":[0.99025154,0.008216522,0.00036698105,0.00061423605,0.00037137527,0.00017930554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034351056,0.0020366623,0.0028948437,0.001000128,0.0005930863,0.0026337286,0.0019652345,0.002822009,0.0067116404],"category_scores_gemma":[0.022534978,0.0011714748,0.0014235048,0.0014514696,0.002439212,0.0046350304,0.0028414733,0.0049768,0.0009232136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022416381,0.00013522527,0.00044337055,0.00029775393,0.00011631917,0.00010592921,0.000097863915,0.58300734,0.0011680379,0.35999742,0.012755282,0.041651357],"study_design_scores_gemma":[0.0000295542,0.000028615783,0.00007344478,0.000018418825,0.000011156314,0.000030957504,0.000015341147,0.8373648,0.00040456065,0.16098696,0.0010271957,0.000009073143],"about_ca_topic_score_codex":0.0023073612,"about_ca_topic_score_gemma":0.0022547212,"teacher_disagreement_score":0.0067116404,"about_ca_system_score_codex":0.0016422544,"about_ca_system_score_gemma":0.001692545,"threshold_uncertainty_score":0.022452652},"labels":[],"label_agreement":null},{"id":"W2075709901","doi":"10.1007/s10013-013-0055-x","title":"Faster Gradient Descent and the Efficient Recovery of Images","year":2013,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Deblurring; Gradient descent; Slowness; Mathematics; Method of steepest descent; Context (archaeology); Mathematical optimization; Descent (aeronautics); Nonlinear conjugate gradient method; Smoothing; Stochastic gradient descent; Descent direction; Gradient method; Algorithm; Image restoration; Computer science; Image (mathematics); Artificial intelligence; Image processing; Artificial neural network; Statistics","score_opus":0.00965784556237763,"score_gpt":0.20035700063937034,"score_spread":0.1906991550769927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075709901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018588904,0.00044910415,0.9781822,0.0006098195,0.000090070695,0.000021373275,0.000055656834,0.00015885108,0.001843997],"genre_scores_gemma":[0.3354371,0.0009855942,0.64750725,0.00025599002,0.00022127295,0.000118456606,0.0002726281,0.00025259925,0.014949103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994648,0.0002061158,0.000022351702,0.00007104224,0.00017780616,0.000057850364],"domain_scores_gemma":[0.9984933,0.0009510662,0.000118623306,0.00020894661,0.00017626323,0.000051757637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013983859,0.00074211525,0.00097248505,0.00073979155,0.00037468455,0.0009190023,0.0008699449,0.0013744556,0.0020792612],"category_scores_gemma":[0.005751155,0.0006558335,0.0005456242,0.0008641672,0.0013378036,0.0021555913,0.001490402,0.0018999757,0.00058929645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038230763,0.000083976076,0.0003943392,0.00019236557,0.0000689015,0.00015011098,0.00018229477,0.5682844,0.018046949,0.26499027,0.008257806,0.13896632],"study_design_scores_gemma":[0.000013851195,0.00001527748,0.00006641749,0.000005086103,0.0000029911635,0.000026833608,0.0000064778615,0.97429943,0.0012250177,0.023409797,0.0009229795,0.000005825454],"about_ca_topic_score_codex":0.004476082,"about_ca_topic_score_gemma":0.0047631906,"teacher_disagreement_score":0.004476082,"about_ca_system_score_codex":0.00069300586,"about_ca_system_score_gemma":0.0011160015,"threshold_uncertainty_score":0.008900046},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06246138348487786,"score_gpt":0.30765550598596625,"score_spread":0.24519412250108838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077318038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031749033,0.00014538532,0.99520653,0.00011059773,0.000037234986,0.0000740182,0.00005987995,0.0008385002,0.00035295176],"genre_scores_gemma":[0.08141454,0.00022788276,0.9157864,0.00013313761,0.000049331113,0.00024145708,0.00045096138,0.00014606767,0.0015501571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.00015381792,0.000040907344,0.00013282803,0.00038422388,0.00007044118],"domain_scores_gemma":[0.99893326,0.0003958509,0.00013140624,0.00018155223,0.00026684313,0.00009116596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097103755,0.0013087709,0.0011214227,0.0012737694,0.000753964,0.00057437574,0.0014908911,0.0010050256,0.0017808938],"category_scores_gemma":[0.0026587634,0.00045138295,0.00073684764,0.0016265243,0.0009493677,0.0016299093,0.0021455053,0.0021260898,0.00086806825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034172236,0.00017275839,0.00058959227,0.00023533712,0.000059919832,0.00017054733,0.00029644583,0.3936656,0.033348344,0.015740877,0.010864838,0.54451394],"study_design_scores_gemma":[0.000027400274,0.00008409405,0.00010136328,0.000008175605,0.000004416326,0.000065472275,0.00002753355,0.9881741,0.0044786767,0.004263431,0.0027496214,0.000015773987],"about_ca_topic_score_codex":0.004457245,"about_ca_topic_score_gemma":0.005080777,"teacher_disagreement_score":0.004457245,"about_ca_system_score_codex":0.000694198,"about_ca_system_score_gemma":0.0018194858,"threshold_uncertainty_score":0.008862555},"labels":[],"label_agreement":null},{"id":"W2078226159","doi":"10.1016/j.acha.2014.08.001","title":"Stable recovery of analysis based approaches","year":2014,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Mathematics; Signal recovery; SIGNAL (programming language); Matrix (chemical analysis); Algorithm; Signal processing; Sparse matrix; Signal reconstruction; Sparse approximation; Computer science","score_opus":0.019027934210165343,"score_gpt":0.20142142108448485,"score_spread":0.1823934868743195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078226159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062764003,0.00026285474,0.9905956,0.00016098881,0.0000480917,0.000015907355,0.000034033663,0.00010171803,0.0025044372],"genre_scores_gemma":[0.40891635,0.0018134769,0.56986725,0.0003314348,0.00033523963,0.00016672749,0.00035270336,0.0002926146,0.017924238],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999265,0.00021721896,0.000026662325,0.00013848118,0.00030275324,0.00004975125],"domain_scores_gemma":[0.99906784,0.00036979257,0.0001093391,0.00022740873,0.00019190066,0.000033774482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420529,0.001003971,0.0007027368,0.0009527807,0.0004486204,0.0012929246,0.00082044053,0.0010663378,0.002893557],"category_scores_gemma":[0.0034251332,0.0005148339,0.0005758799,0.00077742187,0.0012560472,0.0015177896,0.0022278386,0.0012978431,0.0014079188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004903779,0.00009137754,0.0006858121,0.00033377038,0.00018061756,0.00018195172,0.00032679236,0.19108254,0.13369249,0.2920787,0.0044203303,0.37643525],"study_design_scores_gemma":[0.000022756558,0.000089544774,0.00035505195,0.00002844106,0.000028467544,0.0001339107,0.000047741778,0.890141,0.018144205,0.0854781,0.005502544,0.000028217066],"about_ca_topic_score_codex":0.0006794685,"about_ca_topic_score_gemma":0.0008822262,"teacher_disagreement_score":0.002893557,"about_ca_system_score_codex":0.00041138372,"about_ca_system_score_gemma":0.00073349423,"threshold_uncertainty_score":0.009679973},"labels":[],"label_agreement":null},{"id":"W2080175226","doi":"10.1109/tit.2012.2206368","title":"Density Evolution Analysis of Node-Based Verification-Based Algorithms in Compressed Sensing","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Compressed sensing; Computer science; Node (physics); Context (archaeology); Dimension (graph theory); Theoretical computer science; Mathematics; Combinatorics","score_opus":0.011176297979237939,"score_gpt":0.22129574943123265,"score_spread":0.2101194514519947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080175226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007219699,0.00022530093,0.9900181,0.00022776613,0.000020859645,0.000038687074,0.000028335937,0.000087259694,0.00213397],"genre_scores_gemma":[0.70430917,0.0014948602,0.28257814,0.0004252066,0.00018293055,0.00038053785,0.00026923508,0.0002716139,0.010088261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977932,0.000715935,0.000070442926,0.00023287295,0.0010025502,0.00018496654],"domain_scores_gemma":[0.98494995,0.011963255,0.0008336833,0.0006604922,0.0013784758,0.00021419376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004006758,0.0009185646,0.00089274877,0.0011022672,0.00052604894,0.0011870001,0.0019182127,0.001348535,0.0023243984],"category_scores_gemma":[0.025845245,0.00051254703,0.0006453592,0.0009480001,0.0026165298,0.0034052508,0.0019114463,0.0021238371,0.0004061644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100617406,0.000028810933,0.0010076342,0.00019442421,0.000044680353,0.000110165245,0.00029281602,0.5678377,0.0041876826,0.3992578,0.00093948527,0.025998147],"study_design_scores_gemma":[0.0000030482277,0.000013382229,0.00007925038,0.000012872509,0.00000419572,0.000023684093,0.000012159931,0.9714148,0.0009019099,0.027172051,0.00035562838,0.000007061953],"about_ca_topic_score_codex":0.0030045672,"about_ca_topic_score_gemma":0.0015958156,"teacher_disagreement_score":0.004006758,"about_ca_system_score_codex":0.0021629825,"about_ca_system_score_gemma":0.0019528545,"threshold_uncertainty_score":0.021189988},"labels":[],"label_agreement":null},{"id":"W2080439709","doi":"10.1155/2013/176249","title":"Bayesian Sparse Estimation Using Double Lomax Priors","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Prior probability; Smoothing; Latent variable; Bayesian inference; Inference; Bayesian probability; Autoregressive model; Mathematics; Computer science; Algorithm; Applied mathematics; Artificial intelligence; Mathematical optimization; Statistics","score_opus":0.01923914469937144,"score_gpt":0.22640934628454298,"score_spread":0.20717020158517155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080439709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00200424,0.000058137997,0.99721366,0.0000742088,0.000006578176,0.000009825769,0.000025783233,0.00006857893,0.0005389391],"genre_scores_gemma":[0.28105214,0.0006705725,0.71136045,0.00030378578,0.00012032096,0.00023426863,0.00048547192,0.00016289164,0.005610131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999164,0.00037248447,0.00003144896,0.00015094204,0.00021762431,0.00006357089],"domain_scores_gemma":[0.99857116,0.00094424485,0.00014372965,0.00015488073,0.00013136299,0.000054629785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016412782,0.00079595135,0.0008525277,0.0007186644,0.0003962353,0.0009676394,0.001171448,0.0010191057,0.0024516224],"category_scores_gemma":[0.005209173,0.00063534745,0.0006673676,0.0008144322,0.0012358527,0.0020475052,0.0018587124,0.0018266976,0.0006722651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020154429,0.0000844315,0.001227214,0.00022427994,0.000087978595,0.00014996837,0.00020527434,0.5643479,0.0131470235,0.26215407,0.0031198123,0.15505044],"study_design_scores_gemma":[0.000011423473,0.000023326094,0.00016722469,0.000015205631,0.0000069647126,0.00003628607,0.000010674618,0.9612529,0.0015577464,0.03535288,0.0015507324,0.000014611972],"about_ca_topic_score_codex":0.0023508137,"about_ca_topic_score_gemma":0.0030754386,"teacher_disagreement_score":0.0024516224,"about_ca_system_score_codex":0.00057231117,"about_ca_system_score_gemma":0.0011199676,"threshold_uncertainty_score":0.008679986},"labels":[],"label_agreement":null},{"id":"W2080646231","doi":"10.1109/isit.2012.6281807","title":"Analysis and design of irregular graphs for node-based verification-based recovery algorithms in compressed sensing","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Probabilistic analysis of algorithms; Node (physics); Compressed sensing; Context (archaeology); Probabilistic logic; Computational complexity theory; Iterative method; Dimension (graph theory); Decoding methods; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.027013477380494342,"score_gpt":0.2402903385315523,"score_spread":0.21327686115105796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080646231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010150752,0.000046190835,0.98892176,0.0000801894,0.000008831182,0.000034152563,0.000021722855,0.0000884372,0.0006480353],"genre_scores_gemma":[0.58550525,0.0003680361,0.4125724,0.00011223171,0.000032056974,0.00016523195,0.00013411578,0.00011018835,0.001000483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988452,0.0004130853,0.000044619508,0.00019021714,0.00042975176,0.00007701528],"domain_scores_gemma":[0.99277085,0.0048164986,0.00068663247,0.00087620935,0.000699842,0.00014998954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017270023,0.00056419993,0.0005208915,0.0007690199,0.00043308147,0.00074442755,0.001055904,0.0006722266,0.0012894714],"category_scores_gemma":[0.011495155,0.00042130632,0.00043764533,0.0006394638,0.0014991289,0.0015110796,0.0010423596,0.0009897494,0.00027526153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007367703,0.000030136292,0.00074812694,0.00010709451,0.000021689555,0.00008702389,0.00008915219,0.8671415,0.008997825,0.08578984,0.00046092787,0.036453117],"study_design_scores_gemma":[0.0000049382184,0.000027530488,0.00010020771,0.0000067087494,0.0000048800166,0.00004558983,0.000012764816,0.97770554,0.002305758,0.019202115,0.0005772944,0.000006707937],"about_ca_topic_score_codex":0.0011149213,"about_ca_topic_score_gemma":0.0011947829,"teacher_disagreement_score":0.0017270023,"about_ca_system_score_codex":0.0009209456,"about_ca_system_score_gemma":0.0010605692,"threshold_uncertainty_score":0.009133339},"labels":[],"label_agreement":null},{"id":"W2080825927","doi":"10.1364/oe.20.017281","title":"Compressive fluorescence microscopy using saliency-guided sparse reconstruction ensemble fusion","year":2012,"lang":"en","type":"article","venue":"Optics Express","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Microscopy; Fluorescence microscope; Fusion; Optics; Noise (video); Materials science; Fluorescence; Signal-to-noise ratio (imaging); Artificial intelligence; Computer science; Pattern recognition (psychology); Physics; Image (mathematics)","score_opus":0.0351124963329821,"score_gpt":0.27238458494975243,"score_spread":0.23727208861677032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080825927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037806325,0.0001643272,0.96052086,0.000118863936,0.000015190893,0.00003513675,0.000042106753,0.00030630498,0.0009909372],"genre_scores_gemma":[0.5023665,0.0002892077,0.4957945,0.00009258897,0.000047899393,0.00007389739,0.00019781134,0.000050527615,0.001087127],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996569,0.00008096718,0.000014344235,0.00006276907,0.00015485023,0.000030233592],"domain_scores_gemma":[0.9994266,0.00022105068,0.000101170306,0.0000824587,0.00013442726,0.000034325352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006358284,0.0005900759,0.0005782295,0.0004691169,0.0002553188,0.0003826974,0.00053699815,0.0005764323,0.000698067],"category_scores_gemma":[0.0014988562,0.0002641323,0.0003874621,0.00049095217,0.00046648883,0.001036891,0.0011032867,0.0005918688,0.00020164782],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039122,0.00010465662,0.0013568175,0.000207609,0.00009786602,0.00026165543,0.00031269627,0.2066793,0.5057429,0.019008173,0.0014075091,0.2644297],"study_design_scores_gemma":[0.000016629121,0.00011717809,0.00042934722,0.000007903161,0.000014838649,0.00015164087,0.000020131909,0.9128086,0.081319585,0.0037849855,0.0013051936,0.000023965673],"about_ca_topic_score_codex":0.00088364934,"about_ca_topic_score_gemma":0.0012333437,"teacher_disagreement_score":0.00088364934,"about_ca_system_score_codex":0.0003713532,"about_ca_system_score_gemma":0.00041556585,"threshold_uncertainty_score":0.0033626556},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.01578720993470217,"score_gpt":0.2747935385947342,"score_spread":0.25900632866003204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080902082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025300884,0.0005417278,0.9935875,0.00022957304,0.00003401129,0.000020924492,0.000018186814,0.00009261349,0.0029453482],"genre_scores_gemma":[0.2943378,0.0027186316,0.6871416,0.0005630727,0.00034148988,0.0004921766,0.00024860108,0.0005421241,0.0136145335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983335,0.0009384312,0.00005406095,0.00018272772,0.00039410207,0.00009722419],"domain_scores_gemma":[0.9943538,0.0041432963,0.00032040873,0.0002500396,0.0007622461,0.0001702915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005429577,0.0016126774,0.0010921926,0.000949208,0.0004769844,0.001106613,0.0011502211,0.0014453896,0.0033275571],"category_scores_gemma":[0.013903379,0.00048762074,0.00095141225,0.0007281555,0.0021083872,0.0020872967,0.0022495955,0.003054179,0.0010330909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017363566,0.000093730174,0.00073368824,0.00070264563,0.000089878136,0.0003108454,0.00034120824,0.6046877,0.0069468347,0.30456445,0.0067987535,0.07455658],"study_design_scores_gemma":[0.000010362542,0.000053580326,0.00005777001,0.000030450117,0.0000066823914,0.00006456257,0.000014624066,0.9636931,0.0009750852,0.03351709,0.0015667032,0.000010002321],"about_ca_topic_score_codex":0.0012517894,"about_ca_topic_score_gemma":0.0012127553,"teacher_disagreement_score":0.005429577,"about_ca_system_score_codex":0.000711705,"about_ca_system_score_gemma":0.0012341905,"threshold_uncertainty_score":0.028714716},"labels":[],"label_agreement":null},{"id":"W2081250382","doi":"10.1109/tbcas.2013.2263459","title":"Compressive Sensing of Electrocardiogram Signals by Promoting Sparsity on the Second-Order Difference and by Using Dictionary Learning","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Circuits and Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Signal reconstruction; Algorithm; Norm (philosophy); Computer science; Dictionary learning; Iterative reconstruction; Convergence (economics); SIGNAL (programming language); Artificial intelligence; Signal processing; Conjugate gradient method; Pattern recognition (psychology); Sparse approximation; Digital signal processing","score_opus":0.016941323439116737,"score_gpt":0.2111720642423573,"score_spread":0.19423074080324054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081250382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008575674,0.00017781254,0.9904096,0.000116825024,0.000035741206,0.000016314636,0.000017949302,0.00006919514,0.0005809064],"genre_scores_gemma":[0.17373899,0.00064740557,0.8234857,0.00012476416,0.00012739198,0.00010292431,0.00014815631,0.00004140974,0.0015833313],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996618,0.00009239153,0.000018566345,0.000050915052,0.00015828948,0.000018082854],"domain_scores_gemma":[0.9993349,0.00035775456,0.00007645726,0.00009200184,0.00011539573,0.000023455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004909975,0.00041669427,0.00043288726,0.00043381652,0.00016213236,0.00045123903,0.0006145153,0.00064283377,0.0005794576],"category_scores_gemma":[0.0021494464,0.00019720607,0.00037249082,0.0005847508,0.000569783,0.00095204345,0.00074681715,0.0007990843,0.00022506264],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039402777,0.00016026123,0.0016793726,0.00040836885,0.000099454184,0.0002935589,0.00022472607,0.2472175,0.16211647,0.078689754,0.00299208,0.50572443],"study_design_scores_gemma":[0.000022630626,0.00012176582,0.00029788777,0.00001242644,0.000010430665,0.00026267278,0.000011898375,0.97350085,0.017143622,0.0061757434,0.00242203,0.000017927208],"about_ca_topic_score_codex":0.00044460007,"about_ca_topic_score_gemma":0.0006940018,"teacher_disagreement_score":0.00064283377,"about_ca_system_score_codex":0.00018791815,"about_ca_system_score_gemma":0.000400113,"threshold_uncertainty_score":0.0025966763},"labels":[],"label_agreement":null},{"id":"W2081300664","doi":"10.1016/j.acha.2014.07.004","title":"Greedy signal space methods for incoherence and beyond","year":2014,"lang":"en","type":"preprint","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation","keywords":"Orthonormal basis; SIGNAL (programming language); Basis (linear algebra); Space (punctuation); Compressed sensing; Computer science; Sampling (signal processing); Signal reconstruction; Greedy algorithm; Algorithm; Signal processing; Artificial intelligence; Mathematics; Computer vision; Physics; Telecommunications","score_opus":0.018893323730423132,"score_gpt":0.2915741462550513,"score_spread":0.27268082252462816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081300664","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016242666,0.0010043692,0.9934471,0.0004724069,0.00009621391,0.000008093756,0.000037703358,0.000071194605,0.003238746],"genre_scores_gemma":[0.22080743,0.006137493,0.74081296,0.0010555304,0.0011654582,0.00022615903,0.00035248138,0.0006155316,0.028827043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910706,0.000385845,0.000031894237,0.00015865719,0.00025808686,0.000058348793],"domain_scores_gemma":[0.99717355,0.001962946,0.00014651964,0.00034592126,0.00027974046,0.00009131572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042324,0.0018410472,0.0014404655,0.0011943112,0.0006709938,0.0017068255,0.0016387493,0.0019965256,0.003854239],"category_scores_gemma":[0.0076850066,0.0006659793,0.0008428403,0.001430553,0.0033154734,0.0031828315,0.0029711158,0.0038616904,0.0010916818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006826959,0.000025072859,0.00011937353,0.0001726291,0.000045061046,0.000046130648,0.0000997328,0.05635686,0.0026551737,0.89147407,0.005165321,0.043772206],"study_design_scores_gemma":[0.0000135813825,0.000022125258,0.00007339022,0.000026617794,0.000013272034,0.000053491243,0.000027119628,0.33887485,0.00087286095,0.6521533,0.007848837,0.000020486223],"about_ca_topic_score_codex":0.0015419723,"about_ca_topic_score_gemma":0.0017043988,"teacher_disagreement_score":0.003854239,"about_ca_system_score_codex":0.0010397101,"about_ca_system_score_gemma":0.0009518185,"threshold_uncertainty_score":0.012893736},"labels":[],"label_agreement":null},{"id":"W2082576386","doi":"10.1109/icc.2012.6364377","title":"Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Algorithm; Nyquist–Shannon sampling theorem; Computer science; Nyquist rate; Wideband; Minification; Norm (philosophy); Block (permutation group theory); Sampling (signal processing); Mathematics; Electronic engineering; Combinatorics; Telecommunications; Engineering; Detector; Computer vision","score_opus":0.029923353093670512,"score_gpt":0.25305504710193094,"score_spread":0.22313169400826044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082576386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014773362,0.00025620093,0.99702615,0.00012143175,0.000027838278,0.00002122815,0.000048016263,0.0001329144,0.0008889434],"genre_scores_gemma":[0.107329346,0.0018285167,0.8824865,0.00025963158,0.00024908828,0.0003211835,0.0007922716,0.00020864849,0.006524713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992086,0.00024253075,0.00004726778,0.0001220793,0.00031494143,0.00006452039],"domain_scores_gemma":[0.99786264,0.001400225,0.00017519496,0.00017842987,0.0003373215,0.000046175883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011843194,0.0011400052,0.00093450566,0.0009039453,0.00036366322,0.00078521535,0.0011241538,0.0012880842,0.0035702582],"category_scores_gemma":[0.007193158,0.00045099002,0.0008551792,0.001501579,0.00087486487,0.0015163211,0.0015632847,0.002317125,0.0013714588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024501976,0.0000856915,0.0003595749,0.0003816497,0.00008748392,0.0001631386,0.00030744777,0.59633094,0.012675684,0.12611897,0.008157346,0.25508714],"study_design_scores_gemma":[0.000014672173,0.000029026673,0.000075409385,0.000017619523,0.000006687158,0.000052252344,0.000016943788,0.9743916,0.0016818763,0.021210315,0.0024906516,0.000012923203],"about_ca_topic_score_codex":0.0030076469,"about_ca_topic_score_gemma":0.0029119581,"teacher_disagreement_score":0.0035702582,"about_ca_system_score_codex":0.00068050437,"about_ca_system_score_gemma":0.0010608106,"threshold_uncertainty_score":0.011943698},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005176297853252878,"score_gpt":0.2167130036065461,"score_spread":0.21153670575329322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083057505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002853987,0.00004278803,0.99913603,0.000058141177,0.00002846641,0.000013148274,0.0000149746,0.00010274098,0.00031834247],"genre_scores_gemma":[0.0072069764,0.00013424303,0.99069726,0.00006625054,0.000041988133,0.00008103651,0.0000759021,0.00008028496,0.0016160129],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948955,0.0001222769,0.00003095925,0.00008801942,0.00024317362,0.000025970943],"domain_scores_gemma":[0.9993026,0.00028735795,0.0000454789,0.00010511232,0.00021718303,0.000042253007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009486407,0.0010922087,0.0009677269,0.0007729388,0.0005735352,0.0009321256,0.0015469026,0.0018964262,0.0043676705],"category_scores_gemma":[0.0032477428,0.00070309243,0.0008398148,0.0012593721,0.00088760484,0.0014574843,0.002064073,0.0026386469,0.00300431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017999293,0.00009923653,0.00024290137,0.00028884932,0.00007577555,0.00017253551,0.00018117725,0.18527544,0.025792098,0.09610058,0.013640595,0.67795086],"study_design_scores_gemma":[0.00003651071,0.00007160738,0.00011415349,0.000025394223,0.00001931003,0.0003112177,0.000020819725,0.9465202,0.007261971,0.0326131,0.012970949,0.00003472727],"about_ca_topic_score_codex":0.0014879473,"about_ca_topic_score_gemma":0.0023541946,"teacher_disagreement_score":0.0043676705,"about_ca_system_score_codex":0.00039516756,"about_ca_system_score_gemma":0.0013508932,"threshold_uncertainty_score":0.014611363},"labels":[],"label_agreement":null},{"id":"W2084886252","doi":"10.1186/s13634-015-0194-1","title":"Object detection oriented video reconstruction using compressed sensing","year":2015,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer vision; Artificial intelligence; Computer science; Object detection; Object (grammar); Video tracking; Video denoising; Background subtraction; Sequence (biology); Compressed sensing; Key (lock); Multiview Video Coding; Pattern recognition (psychology); Pixel","score_opus":0.02829355811478894,"score_gpt":0.2793816119028577,"score_spread":0.25108805378806875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084886252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016901825,0.00033366325,0.9814709,0.0001421436,0.000042719403,0.000031035044,0.00005134695,0.00029492387,0.00073147356],"genre_scores_gemma":[0.36824197,0.00090374035,0.62810683,0.0002284617,0.00015776439,0.00007987892,0.00048181423,0.00006112783,0.0017383782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958664,0.000074455515,0.00001823767,0.00008401498,0.0002066864,0.000029868717],"domain_scores_gemma":[0.99940765,0.00024868196,0.000086511805,0.00008610913,0.00014199257,0.000029067887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043416466,0.00070025347,0.0005965809,0.00081220095,0.00018190448,0.00047110746,0.0006206103,0.00070018246,0.0007656989],"category_scores_gemma":[0.0022150371,0.00024236683,0.0004337338,0.0008373229,0.00038941076,0.00084448105,0.00065701845,0.00082003366,0.00030349728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005950044,0.00016981618,0.0018191473,0.00034073295,0.00012230981,0.0005700014,0.00022051446,0.21109235,0.1635651,0.02318757,0.0035398286,0.59477764],"study_design_scores_gemma":[0.00001522878,0.00006185369,0.00040273808,0.000010471091,0.000011624847,0.00021639395,0.000016463255,0.9776775,0.017608097,0.002899016,0.0010688527,0.000011804623],"about_ca_topic_score_codex":0.0017786454,"about_ca_topic_score_gemma":0.00130323,"teacher_disagreement_score":0.0017786454,"about_ca_system_score_codex":0.00026471214,"about_ca_system_score_gemma":0.000426204,"threshold_uncertainty_score":0.0035366416},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.021902724673580936,"score_gpt":0.23472759952908184,"score_spread":0.21282487485550092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085040216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022964512,0.00014396208,0.9964169,0.00012931164,0.000015293288,0.00003701662,0.000060874714,0.00026361545,0.0006365513],"genre_scores_gemma":[0.26466113,0.0008043083,0.7292914,0.00025218044,0.0002099801,0.0006065598,0.0006411808,0.00018373622,0.0033495482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802387,0.0010900378,0.00006933101,0.0002642852,0.00044145284,0.000110969326],"domain_scores_gemma":[0.9913339,0.0070128525,0.00044503575,0.0005971618,0.00047642319,0.00013471917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034730993,0.0012245808,0.0019853634,0.0009995374,0.0008837988,0.001593979,0.0021541868,0.0020388248,0.0037387416],"category_scores_gemma":[0.012681482,0.0011889611,0.0013433729,0.0013748955,0.0014128494,0.0024109536,0.0012005349,0.0027870464,0.0012761743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007031242,0.000053474592,0.00046034562,0.00009613464,0.00006527091,0.000059615802,0.000074924304,0.90545416,0.00073643116,0.053069156,0.0019781177,0.03788203],"study_design_scores_gemma":[0.0000074689015,0.0000063147304,0.0000387597,0.0000060114153,0.0000031306604,0.000010270211,0.0000029550574,0.9838876,0.00012751015,0.015593281,0.0003105859,0.000006200139],"about_ca_topic_score_codex":0.0127386255,"about_ca_topic_score_gemma":0.014905293,"teacher_disagreement_score":0.0127386255,"about_ca_system_score_codex":0.0013485632,"about_ca_system_score_gemma":0.0017037878,"threshold_uncertainty_score":0.025328934},"labels":[],"label_agreement":null},{"id":"W2085870631","doi":"10.1016/s0167-8655(03)00110-7","title":"QoS based video delivery with foveation and bandwidth monitoring","year":2003,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Bandwidth (computing); Data compression; Real-time computing; Computer vision; Artificial intelligence; Computer network","score_opus":0.015592525047011092,"score_gpt":0.18819497340828875,"score_spread":0.17260244836127767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085870631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.128222,0.0018435466,0.86060447,0.0009908173,0.0002663818,0.000107685766,0.000086662476,0.0021079883,0.005770489],"genre_scores_gemma":[0.9026066,0.00037447727,0.09356209,0.0001508757,0.0001909834,0.000037154627,0.00005342862,0.000059465285,0.00296503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992866,0.00013079184,0.00003924339,0.00014703513,0.00026967947,0.000126758],"domain_scores_gemma":[0.99754,0.0012159443,0.00021721114,0.0003064787,0.0005384037,0.00018187812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086291565,0.0007661026,0.0010527014,0.00072923646,0.00081195566,0.0011656675,0.0008733577,0.00094044284,0.0014368648],"category_scores_gemma":[0.0042254217,0.00038872313,0.00022164303,0.00066219777,0.00059379387,0.0015760282,0.0011898096,0.0009180615,0.00024871455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002705098,0.00054476433,0.003481053,0.00018070008,0.00010375783,0.00086418085,0.0004622169,0.12051847,0.30545288,0.025960226,0.0071813236,0.5325453],"study_design_scores_gemma":[0.000051605617,0.00022421825,0.00094756135,0.000013861608,0.000040743165,0.00055198866,0.00010774804,0.93621,0.052739106,0.0069306823,0.002149373,0.000033168842],"about_ca_topic_score_codex":0.0032723865,"about_ca_topic_score_gemma":0.0036811293,"teacher_disagreement_score":0.0032723865,"about_ca_system_score_codex":0.0008907871,"about_ca_system_score_gemma":0.0007571436,"threshold_uncertainty_score":0.0065066814},"labels":[],"label_agreement":null},{"id":"W2087003203","doi":"10.1109/iih-msp.2012.125","title":"Learning Multilevel Dictionaries for Compressed Sensing Using Discriminative Clustering","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Discriminative model; Computer science; Cluster analysis; Toolbox; Artificial intelligence; Compressed sensing; Pattern recognition (psychology); Dictionary learning; Scheme (mathematics); Sparse matrix; Sparse approximation; K-SVD; Discriminant; Mathematics","score_opus":0.05682633888801926,"score_gpt":0.28298010695872666,"score_spread":0.22615376807070742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087003203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075906687,0.000039945913,0.99168444,0.000061279294,0.000009694322,0.000014518468,0.00003117106,0.00018244248,0.00038582523],"genre_scores_gemma":[0.23791258,0.0001456417,0.7598354,0.00010981415,0.000034565102,0.00007436096,0.0003318251,0.00010250584,0.0014533319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.000072655115,0.00002292933,0.00008633416,0.00013432368,0.00003616325],"domain_scores_gemma":[0.9993337,0.00023330523,0.000084150706,0.00019639057,0.00011857423,0.00003395369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048257664,0.00043503405,0.00054477196,0.0004923011,0.00029656835,0.000501956,0.00085572375,0.0006569207,0.0017746936],"category_scores_gemma":[0.0026235948,0.00028741636,0.00034070955,0.00082759757,0.00055852893,0.0010609289,0.0012233865,0.0010717701,0.0007891121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029766402,0.00014445392,0.0014111014,0.00020192949,0.00006851689,0.00010039045,0.00019912448,0.35040534,0.08694299,0.051015865,0.004150865,0.50506175],"study_design_scores_gemma":[0.000011403981,0.000053216158,0.00023943493,0.000007078037,0.000006487675,0.00006239121,0.00002011296,0.97790134,0.012652297,0.0075341365,0.0014988445,0.000013233745],"about_ca_topic_score_codex":0.001290973,"about_ca_topic_score_gemma":0.0025644652,"teacher_disagreement_score":0.0017746936,"about_ca_system_score_codex":0.00037429287,"about_ca_system_score_gemma":0.00051180914,"threshold_uncertainty_score":0.0059369802},"labels":[],"label_agreement":null},{"id":"W2087286870","doi":"10.1142/s0219691313600047","title":"PHASE TRANSITIONS IN ERROR CORRECTING AND COMPRESSED SENSING BY ℓ<sub>1</sub> LINEAR PROGRAMMING","year":2013,"lang":"en","type":"article","venue":"International Journal of Wavelets Multiresolution and Information Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Underdetermined system; Matrix (chemical analysis); Mathematics; Linear programming; Combinatorics; Rank (graph theory); Orthonormal basis; Code (set theory); Algorithm; Discrete mathematics; Computer science; Physics","score_opus":0.010438188602915469,"score_gpt":0.25303469774702825,"score_spread":0.2425965091441128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087286870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12880003,0.003202486,0.8176222,0.0031820296,0.00027180067,0.00011608855,0.00019556616,0.0006228584,0.045987014],"genre_scores_gemma":[0.8267589,0.0014501568,0.15972105,0.0008715465,0.00025287142,0.00029226037,0.00016319523,0.0003156561,0.010174269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979462,0.0008430732,0.000066235414,0.0002297515,0.0006696421,0.00024500693],"domain_scores_gemma":[0.9894589,0.008553821,0.0006621669,0.0005118022,0.0006660448,0.00014718405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034670888,0.00076536555,0.00075862557,0.00090891874,0.0006370431,0.0019899323,0.00094985304,0.0010241766,0.0023747142],"category_scores_gemma":[0.014521427,0.00056230486,0.0004990413,0.00087386253,0.003744056,0.00226912,0.0016958453,0.0024064025,0.0004135102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022677673,0.00005667304,0.00069799344,0.00018120022,0.000034498073,0.000111957575,0.0003282519,0.20959653,0.0032933508,0.7453626,0.0024563954,0.03765381],"study_design_scores_gemma":[0.000023323406,0.00010499683,0.0003351875,0.00007305653,0.0000072287557,0.00007344725,0.0000672898,0.76938164,0.0033450862,0.22423169,0.0023288268,0.00002822539],"about_ca_topic_score_codex":0.0017534472,"about_ca_topic_score_gemma":0.0009340927,"teacher_disagreement_score":0.0034670888,"about_ca_system_score_codex":0.0017432842,"about_ca_system_score_gemma":0.0010879837,"threshold_uncertainty_score":0.018335879},"labels":[],"label_agreement":null},{"id":"W2087515962","doi":"10.1109/tim.2012.2190550","title":"Energy-Efficient Compressive State Recovery From Sparsely Noisy Measurements","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Underdetermined system; Signal reconstruction; Wireless sensor network; Computer science; Energy (signal processing); Gaussian; SIGNAL (programming language); Signal processing; Algorithm; Mathematics; Telecommunications; Statistics","score_opus":0.07738180498407746,"score_gpt":0.235482785200147,"score_spread":0.15810098021606955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087515962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016058987,0.00016301133,0.98189294,0.0002375271,0.000033007305,0.000021495704,0.000079658326,0.00015212261,0.0013612082],"genre_scores_gemma":[0.6092245,0.000825424,0.38293543,0.00019627593,0.00014977524,0.00014404142,0.00064869045,0.00007201017,0.0058038263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996244,0.00008753319,0.00001865261,0.00008823149,0.0001473166,0.00003389157],"domain_scores_gemma":[0.999468,0.00026706568,0.00007227651,0.000091469294,0.000086399035,0.000014763691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042508435,0.0006294751,0.0006353995,0.00034305986,0.00027435133,0.0005260141,0.000650868,0.00068039354,0.0012680702],"category_scores_gemma":[0.0021727236,0.00027364236,0.00044970022,0.0005898623,0.0006487602,0.0013289123,0.0010361638,0.00087949226,0.00038929717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035750127,0.000098959,0.00071537326,0.00023118852,0.000066646586,0.00019978164,0.0001807245,0.6903895,0.052863747,0.040948723,0.003387927,0.21055996],"study_design_scores_gemma":[0.00000821113,0.000026043106,0.00015104114,0.000006923993,0.000005259585,0.000029827717,0.000012843652,0.98762053,0.006006315,0.0054335315,0.00069131004,0.000008141359],"about_ca_topic_score_codex":0.0015831951,"about_ca_topic_score_gemma":0.00184515,"teacher_disagreement_score":0.0015831951,"about_ca_system_score_codex":0.00030491286,"about_ca_system_score_gemma":0.0006257539,"threshold_uncertainty_score":0.0042420626},"labels":[],"label_agreement":null},{"id":"W2087832775","doi":"10.1016/j.laa.2004.10.025","title":"On the uniqueness of Euclidean distance matrix completions: the case of points in general position","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Euclidean distance matrix; Mathematics; Uniqueness; Euclidean distance; Euclidean geometry; Semidefinite programming; Matrix (chemical analysis); Distance matrix; Position (finance); Matrix completion; Combinatorics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.012662614968095297,"score_gpt":0.25757883284599525,"score_spread":0.24491621787789997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087832775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027005583,0.002146727,0.9624084,0.0017467153,0.00018757838,0.000039640436,0.00016697319,0.000053596745,0.0062447675],"genre_scores_gemma":[0.5772715,0.01075787,0.39008594,0.0010570762,0.001978643,0.00027341687,0.0010252297,0.0003823244,0.017167963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99542964,0.0022384962,0.00024977597,0.00090952794,0.0008938034,0.00027874095],"domain_scores_gemma":[0.96077114,0.030370563,0.0023150728,0.0021530255,0.0031541712,0.0012360932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008873922,0.0013802587,0.0024940418,0.0026487226,0.0014955819,0.0039566606,0.0034292715,0.0033718213,0.0034311966],"category_scores_gemma":[0.05774907,0.0012937314,0.0015963383,0.003028651,0.00953841,0.014428338,0.007318482,0.006016517,0.0007621508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085737716,0.000036695055,0.00040156956,0.00016316978,0.00004773397,0.00013368046,0.00026431575,0.035437226,0.0007043549,0.94598144,0.0021527396,0.014591406],"study_design_scores_gemma":[0.000014028005,0.000036152436,0.00020459163,0.000042849493,0.000011199193,0.0001320021,0.000121533456,0.12049899,0.00031780984,0.877014,0.0015642747,0.000042535627],"about_ca_topic_score_codex":0.0019843187,"about_ca_topic_score_gemma":0.0013715671,"teacher_disagreement_score":0.008873922,"about_ca_system_score_codex":0.0010451335,"about_ca_system_score_gemma":0.0016026229,"threshold_uncertainty_score":0.046930373},"labels":[],"label_agreement":null},{"id":"W2089752091","doi":"10.1016/j.mri.2012.08.011","title":"Non-convex algorithm for sparse and low-rank recovery: Application to dynamic MRI reconstruction","year":2012,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Norm (philosophy); Algorithm; Rank (graph theory); Property (philosophy); Computer science; Regular polygon; SIGNAL (programming language); Mathematical optimization; Convex optimization; Space (punctuation); Dynamic contrast-enhanced MRI; Mathematics; Combinatorics; Magnetic resonance imaging","score_opus":0.004359878919697714,"score_gpt":0.21465550146221593,"score_spread":0.2102956225425182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089752091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015344406,0.00011119346,0.99746895,0.0001769129,0.00001665838,0.000015658907,0.000020944122,0.0001066275,0.0005486568],"genre_scores_gemma":[0.04595068,0.0005495489,0.9487123,0.0001284396,0.000083217106,0.00012536216,0.0001392794,0.00016657294,0.004144577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942183,0.00019183982,0.00003152669,0.00007637879,0.00024352892,0.00003483944],"domain_scores_gemma":[0.99685645,0.0021294637,0.00017986637,0.00024501144,0.00050321774,0.00008582504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017379764,0.0011163423,0.0012747499,0.0007122674,0.0006218612,0.0011441283,0.0012012641,0.0019224636,0.0035102123],"category_scores_gemma":[0.0078033074,0.0004943113,0.0006560939,0.0015076812,0.0011532935,0.0014539534,0.0017230355,0.0027597148,0.0012623743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027391352,0.0002378994,0.00036524274,0.00032449907,0.00006901605,0.0002745791,0.00021616784,0.53894514,0.017799,0.056632537,0.0075465427,0.37731555],"study_design_scores_gemma":[0.000011776987,0.000025887919,0.000060371156,0.0000060515636,0.0000046764285,0.000059893635,0.000012953252,0.9912477,0.0019114424,0.0054139583,0.001236465,0.000008796445],"about_ca_topic_score_codex":0.003739051,"about_ca_topic_score_gemma":0.0055739144,"teacher_disagreement_score":0.003739051,"about_ca_system_score_codex":0.00060133944,"about_ca_system_score_gemma":0.0015574812,"threshold_uncertainty_score":0.01174283},"labels":[],"label_agreement":null},{"id":"W2091394133","doi":"10.1088/1751-8113/40/16/f02","title":"Competitive optimization of compressed sensing","year":2007,"lang":"en","type":"article","venue":"Journal of Physics A Mathematical and Theoretical","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Compressed sensing; Computer science; Geology; Artificial intelligence","score_opus":0.007876184970820523,"score_gpt":0.22484572130062522,"score_spread":0.2169695363298047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091394133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013250043,0.0004375845,0.97697836,0.0003733821,0.000078040415,0.00006861508,0.000064613,0.00011510079,0.008634124],"genre_scores_gemma":[0.7308855,0.00072967185,0.2607714,0.0004482058,0.00020083015,0.00033582048,0.00021070857,0.00009367192,0.0063243266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985941,0.00061178586,0.00004124601,0.00021164642,0.00041870677,0.00012260678],"domain_scores_gemma":[0.9981893,0.0011681933,0.00013178735,0.00019245553,0.00023771319,0.00008051391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016586178,0.0009098614,0.0012179398,0.00047505143,0.00046291217,0.00094505027,0.001165651,0.0014395377,0.002751542],"category_scores_gemma":[0.005566395,0.0003658752,0.0005157278,0.00073861255,0.0014395185,0.0012628392,0.001489843,0.0010706541,0.0004329151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016351725,0.00006681672,0.00041588402,0.00016511278,0.000092229224,0.00009686294,0.000059277623,0.6529389,0.0053766393,0.28527766,0.004115766,0.05123126],"study_design_scores_gemma":[0.000009143291,0.00003192519,0.00005497356,0.0000038524827,0.0000051479597,0.000023926415,0.000004418124,0.9808775,0.0006413709,0.017462866,0.00087760785,0.000007149757],"about_ca_topic_score_codex":0.0017891506,"about_ca_topic_score_gemma":0.001449415,"teacher_disagreement_score":0.002751542,"about_ca_system_score_codex":0.0008966202,"about_ca_system_score_gemma":0.0008222516,"threshold_uncertainty_score":0.009204805},"labels":[],"label_agreement":null},{"id":"W2091478247","doi":"10.1109/camsap.2013.6714076","title":"Experimental results of compressive sensing based imaging in ultrasonic non-destructive testing","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Compressed sensing; Bin; SIGNAL (programming language); Artificial intelligence; Noise (video); Ultrasonic sensor; Frequency domain; Image (mathematics); Iterative reconstruction; Transmitter; Computer vision; Test data; Nondestructive testing; Pattern recognition (psychology); Algorithm; Acoustics; Physics","score_opus":0.013271400832608105,"score_gpt":0.22631312927480268,"score_spread":0.21304172844219457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091478247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87197447,0.00082947075,0.12022603,0.00028314357,0.00011738475,0.00015119722,0.00044467417,0.000844194,0.0051293885],"genre_scores_gemma":[0.9312471,0.00042196317,0.06525765,0.00007719565,0.000027068827,0.00010633895,0.0005528361,0.00008119971,0.0022285457],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991153,0.00020948453,0.000059978152,0.000094557334,0.00044298504,0.00007771609],"domain_scores_gemma":[0.9974075,0.0011673518,0.0002356107,0.00041310562,0.00067703554,0.00009932497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035723,0.00060959044,0.00035057258,0.00062251225,0.00024882058,0.00030417944,0.0005834292,0.0007450425,0.0020537495],"category_scores_gemma":[0.0030483261,0.00017915195,0.00018658355,0.00056311605,0.0006661316,0.0005946332,0.0005312754,0.00029518837,0.00032985103],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012344643,0.0006043193,0.0017885498,0.0005252328,0.000046439658,0.00030106836,0.00020904254,0.021044355,0.892766,0.000884296,0.00076978584,0.07982644],"study_design_scores_gemma":[0.00007926516,0.0025137055,0.0055543785,0.00003607371,0.000045915862,0.00046631903,0.0001528873,0.07447781,0.9144777,0.00044198078,0.0017068103,0.000047185364],"about_ca_topic_score_codex":0.0006907876,"about_ca_topic_score_gemma":0.00082898466,"teacher_disagreement_score":0.0020537495,"about_ca_system_score_codex":0.00020382363,"about_ca_system_score_gemma":0.0001372702,"threshold_uncertainty_score":0.0068704486},"labels":[],"label_agreement":null},{"id":"W2092500953","doi":"10.1007/s00454-009-9236-5","title":"VC Dimensions of Principal Component Analysis","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Principal component analysis; Affine transformation; Upper and lower bounds; Dimension (graph theory); Eigenvalues and eigenvectors; Subspace topology; Simple (philosophy); VC dimension; Covariance; Discrete mathematics; Covariance matrix; Constant (computer programming); Sign (mathematics); Spectrum (functional analysis); Pure mathematics; Statistics; Mathematical analysis","score_opus":0.011452529167206021,"score_gpt":0.2531162487751962,"score_spread":0.24166371960799016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092500953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019087724,0.0038811038,0.958855,0.0017360523,0.00062063645,0.00005648214,0.0011070156,0.00050798105,0.014148054],"genre_scores_gemma":[0.5846443,0.010660579,0.37299046,0.0013002115,0.002356933,0.0004596154,0.0025244253,0.0004464331,0.024617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986235,0.00047372378,0.00007943578,0.00021638625,0.0005072714,0.00009981301],"domain_scores_gemma":[0.9957274,0.0021805265,0.00029081394,0.00070865767,0.0008842476,0.00020843103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104546,0.0008377526,0.0007139879,0.0015252758,0.00050940964,0.0027291751,0.000910462,0.00084615074,0.005772431],"category_scores_gemma":[0.01032232,0.0003558329,0.0004575891,0.00175888,0.0013121819,0.0024576916,0.0017266726,0.0018455172,0.0012485803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009282059,0.000037126127,0.00058839825,0.00018394241,0.000042966472,0.00008944313,0.00013302633,0.020519786,0.003972999,0.8126389,0.017088171,0.14461257],"study_design_scores_gemma":[0.00001536067,0.00005353992,0.0011806821,0.000070036505,0.000026452342,0.0003517087,0.00009339015,0.30488202,0.0028373918,0.6570155,0.0334203,0.000053492557],"about_ca_topic_score_codex":0.0016218007,"about_ca_topic_score_gemma":0.0009944955,"teacher_disagreement_score":0.005772431,"about_ca_system_score_codex":0.0005909103,"about_ca_system_score_gemma":0.0009903003,"threshold_uncertainty_score":0.019310713},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012313040778714288,"score_gpt":0.2311079300959838,"score_spread":0.2187948893172695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092554297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034928776,0.0002786707,0.9603574,0.0002972775,0.000017516113,0.000032653326,0.00004432546,0.00013459913,0.003908735],"genre_scores_gemma":[0.77045304,0.00051896693,0.22357105,0.00029766205,0.00007320007,0.00021515148,0.00023074416,0.00018061262,0.004459669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979231,0.0008805904,0.00008194501,0.00033311968,0.0006058076,0.00017556502],"domain_scores_gemma":[0.99686784,0.0018669285,0.0003608283,0.00040608767,0.0003819648,0.0001164301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023994162,0.00085785496,0.0010799664,0.0006886461,0.00049616647,0.0013993471,0.0007693296,0.0011866417,0.0011427859],"category_scores_gemma":[0.00895113,0.00045906976,0.00068139087,0.00065953034,0.0019638613,0.0017328786,0.0020460617,0.0020759827,0.00018658835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008126093,0.00006467833,0.00062993827,0.00014893682,0.000044657783,0.00009832122,0.00014895826,0.7820693,0.005748423,0.17813314,0.0013587124,0.031473514],"study_design_scores_gemma":[0.0000072077946,0.000025894504,0.00012639335,0.000009416007,0.0000033715403,0.000029899338,0.00001551996,0.9450596,0.0012082567,0.052988518,0.00051986106,0.000006072339],"about_ca_topic_score_codex":0.0011020945,"about_ca_topic_score_gemma":0.0009383328,"teacher_disagreement_score":0.0023994162,"about_ca_system_score_codex":0.0011068728,"about_ca_system_score_gemma":0.0009290989,"threshold_uncertainty_score":0.012689471},"labels":[],"label_agreement":null},{"id":"W2093238275","doi":"10.1016/j.sigpro.2010.12.005","title":"Some empirical advances in matrix completion","year":2010,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Minification; Mathematical optimization; Matrix norm; Convex optimization; Matrix (chemical analysis); Sampling (signal processing); Mathematics; Low-rank approximation; Algorithm; Norm (philosophy); Regular polygon; Optimization problem; Sparse matrix; Computer science","score_opus":0.017014906061336873,"score_gpt":0.2983029703516247,"score_spread":0.2812880642902878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093238275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008334234,0.04242467,0.9116386,0.011643732,0.0011446979,0.000039804778,0.00034250403,0.00015496375,0.024276737],"genre_scores_gemma":[0.32063216,0.1028376,0.52294946,0.004201279,0.018142195,0.00032523304,0.0013645932,0.00044901785,0.029098509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973558,0.0013462208,0.00015351856,0.00033666176,0.0007052546,0.0001025368],"domain_scores_gemma":[0.9786323,0.016201349,0.00062446337,0.0020044877,0.0022139149,0.00032346504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00860759,0.0013770845,0.0011261296,0.0023562305,0.001000708,0.0026780306,0.0018556057,0.0016985752,0.0050103175],"category_scores_gemma":[0.0377465,0.000848622,0.0010604004,0.004075509,0.005275335,0.006529013,0.0026875301,0.0060197967,0.0010895219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003706841,0.00005616011,0.00063561863,0.00030164773,0.000036424248,0.000059012655,0.00015621542,0.0113316085,0.00032737866,0.9207883,0.010835297,0.055435166],"study_design_scores_gemma":[0.0000152345365,0.000036929247,0.0006301867,0.00012311898,0.00002071464,0.00013144664,0.000059121376,0.06726256,0.00034325485,0.9046232,0.026727619,0.000026670874],"about_ca_topic_score_codex":0.0025349439,"about_ca_topic_score_gemma":0.0020206114,"teacher_disagreement_score":0.00860759,"about_ca_system_score_codex":0.0013866574,"about_ca_system_score_gemma":0.0015938606,"threshold_uncertainty_score":0.045521855},"labels":[],"label_agreement":null},{"id":"W2094411899","doi":"10.1109/mmsp.2012.6343411","title":"Temporal derivatives in compressed video sensing","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer vision; Compressed sensing; Video tracking; ENCODE; Frame (networking); Block-matching algorithm; Tracking (education); Artificial intelligence; Motion compensation; Motion estimation; Video compression picture types; Sampling (signal processing); Video processing; Telecommunications","score_opus":0.022583002723725053,"score_gpt":0.24046815010435205,"score_spread":0.217885147380627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094411899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007984463,0.0010018446,0.9885233,0.00031347683,0.0000969812,0.000024509161,0.000027336602,0.00006704814,0.001960935],"genre_scores_gemma":[0.56206614,0.0032371066,0.42730913,0.00031725585,0.00031078342,0.00008570884,0.000118141455,0.000087156164,0.006468711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960345,0.00012081804,0.000015811465,0.000050522147,0.00018880377,0.000020593305],"domain_scores_gemma":[0.99943286,0.00035242137,0.000059856513,0.000059109876,0.000077738856,0.000018060877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248275,0.00040528312,0.00033681886,0.00032566738,0.00019783662,0.0005245336,0.0005054556,0.00060731487,0.00097178353],"category_scores_gemma":[0.0030083905,0.00018386397,0.00021972554,0.00048746084,0.00088173634,0.0011128024,0.0006217773,0.00086910074,0.0001434559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022639413,0.00003645221,0.0007632249,0.00035750895,0.000042499414,0.00032938583,0.0002544545,0.34986985,0.03861331,0.4349283,0.0022647944,0.17231385],"study_design_scores_gemma":[0.000010918403,0.000053012558,0.00017518646,0.000018831157,0.000007747382,0.00013457412,0.0000204165,0.961759,0.0052418183,0.029073646,0.0034902191,0.000014652173],"about_ca_topic_score_codex":0.0017830789,"about_ca_topic_score_gemma":0.0012215541,"teacher_disagreement_score":0.0017830789,"about_ca_system_score_codex":0.0005141461,"about_ca_system_score_gemma":0.00045265985,"threshold_uncertainty_score":0.003833294},"labels":[],"label_agreement":null},{"id":"W2094443059","doi":"10.1155/2013/101974","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>s</mml:mi></mml:mrow></mml:math>-Goodness for Low-Rank Matrix Recovery","year":2013,"lang":"en","type":"article","venue":"Abstract and Applied Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; National Natural Science Foundation of China","keywords":"Algorithm; Artificial intelligence; Rank (graph theory); Computer science; Mathematics; Combinatorics","score_opus":0.01244491763012212,"score_gpt":0.22713651370997306,"score_spread":0.21469159607985094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094443059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037432318,0.0012507301,0.8905489,0.0056103147,0.0009958227,0.0004949293,0.0065993723,0.008737801,0.082018904],"genre_scores_gemma":[0.08091004,0.0064841947,0.7434386,0.005108316,0.0013099937,0.001502054,0.024265228,0.009348613,0.12763302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943013,0.0014122901,0.0006099861,0.00085119664,0.002448758,0.00037654839],"domain_scores_gemma":[0.9935961,0.0020914439,0.00062235305,0.0020752691,0.0013525242,0.00026235648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004044851,0.0016014292,0.0012092325,0.0026556917,0.0014330947,0.005316541,0.0030903895,0.003801703,0.061484076],"category_scores_gemma":[0.01620681,0.0009980563,0.00147897,0.004871574,0.0025137963,0.0071786423,0.0045923963,0.003389493,0.06227511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003291044,0.00017739143,0.00068725605,0.00060208177,0.00004549044,0.0002807044,0.00029088763,0.017946478,0.009486504,0.36248234,0.25419933,0.35347247],"study_design_scores_gemma":[0.00006976975,0.00013620188,0.0011026084,0.00022001825,0.00002908275,0.00061129883,0.00018644787,0.106336564,0.014068266,0.3334115,0.5437013,0.00012700581],"about_ca_topic_score_codex":0.007685669,"about_ca_topic_score_gemma":0.009035197,"teacher_disagreement_score":0.061484076,"about_ca_system_score_codex":0.0021081746,"about_ca_system_score_gemma":0.0027844699,"threshold_uncertainty_score":0.20568472},"labels":[],"label_agreement":null},{"id":"W2095066043","doi":"10.1109/icassp.2010.5495811","title":"Adaptive structured recovery of compressive sensing via piecewise autoregressive modeling","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compressed sensing; Autoregressive model; Signal recovery; Piecewise; SIGNAL (programming language); Signal reconstruction; Wavelet; Computer science; Algorithm; Space (punctuation); Set (abstract data type); Signal processing; Mathematical optimization; Artificial intelligence; Mathematics; Mathematical analysis; Statistics; Telecommunications","score_opus":0.012529961332502206,"score_gpt":0.21390674748793315,"score_spread":0.20137678615543095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095066043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007426131,0.00015868284,0.9913722,0.00009936095,0.000014928988,0.000009264839,0.000021548401,0.00014487312,0.00075297186],"genre_scores_gemma":[0.591273,0.0015764661,0.40103814,0.00016704606,0.00010486046,0.000094486764,0.00019945795,0.00011706176,0.00542956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973565,0.00009283265,0.000008510313,0.0000411777,0.00009970561,0.000022164442],"domain_scores_gemma":[0.99962974,0.00021108301,0.000060999577,0.000049337003,0.000037500376,0.000011321416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000487762,0.0005598203,0.00042792218,0.00027463923,0.00015008435,0.0004411644,0.0006031888,0.0005674471,0.0007331849],"category_scores_gemma":[0.0015596516,0.00031095775,0.0005459821,0.00046136128,0.0006670077,0.00085359823,0.00067122537,0.0008906467,0.00030787804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010439849,0.000033654273,0.00047875082,0.00012266461,0.00004162193,0.00015630203,0.000121059806,0.8040548,0.032988843,0.07885416,0.0010985968,0.0819452],"study_design_scores_gemma":[0.0000029756416,0.000025389816,0.000070995135,0.000003742331,0.0000050044596,0.000031137104,0.0000053607287,0.9910851,0.0018228432,0.0063349335,0.0006054803,0.0000070215706],"about_ca_topic_score_codex":0.0014275644,"about_ca_topic_score_gemma":0.0012499951,"teacher_disagreement_score":0.0014275644,"about_ca_system_score_codex":0.00030612366,"about_ca_system_score_gemma":0.00043094635,"threshold_uncertainty_score":0.002838552},"labels":[],"label_agreement":null},{"id":"W2095786391","doi":"10.5281/zenodo.41777","title":"Derivative Compressive Sampling With Application To Phase Unwrapping","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Computer science; Sampling (signal processing); Inverse problem; Iterative reconstruction; A priori and a posteriori; Basis (linear algebra); Algorithm; Representation (politics); Derivative (finance); Set (abstract data type); Mathematical optimization; Mathematics; Artificial intelligence; Computer vision","score_opus":0.018660733707161876,"score_gpt":0.284135151141011,"score_spread":0.26547441743384914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095786391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043370556,0.00043881315,0.9926911,0.00016006122,0.00016155893,0.00002137284,0.000025764984,0.00034042218,0.0018237889],"genre_scores_gemma":[0.10224296,0.0013012575,0.88866156,0.00009350612,0.0001968812,0.00003569077,0.0001277998,0.00021401662,0.0071263397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995945,0.00009514139,0.000021021846,0.000052532145,0.00021680436,0.000020087498],"domain_scores_gemma":[0.99922276,0.00040681162,0.00003221378,0.00012217362,0.0001849694,0.00003111459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094072,0.00069689215,0.0005366236,0.0006077961,0.00030236656,0.00095632806,0.0005992402,0.00071058405,0.0041704364],"category_scores_gemma":[0.0038404965,0.0003486003,0.00039271993,0.0009910025,0.00063584663,0.00084477634,0.0009974279,0.0012112008,0.0012121912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050627615,0.00011318729,0.000580768,0.00023475777,0.00004014727,0.00036459096,0.00019281462,0.06485589,0.09036089,0.0864499,0.0073038526,0.74899703],"study_design_scores_gemma":[0.000021772885,0.00008308114,0.00031507097,0.000015446032,0.000018507577,0.00039247877,0.000016991155,0.9477142,0.025856398,0.012896595,0.012649825,0.000019636987],"about_ca_topic_score_codex":0.0012862919,"about_ca_topic_score_gemma":0.0018984844,"teacher_disagreement_score":0.0041704364,"about_ca_system_score_codex":0.00023239903,"about_ca_system_score_gemma":0.00046930072,"threshold_uncertainty_score":0.01395154},"labels":[],"label_agreement":null},{"id":"W2095841587","doi":"10.1109/icassp.2010.5496101","title":"Compressive detection for wide-band spectrum sensing","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Compressed sensing; Channel (broadcasting); Computer science; Minification; Energy (signal processing); Norm (philosophy); Spectrum (functional analysis); Electronic engineering; Algorithm; Telecommunications; Physics; Engineering","score_opus":0.007884772449394083,"score_gpt":0.2102002182062073,"score_spread":0.2023154457568132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095841587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009589365,0.00025431774,0.98860127,0.00012181567,0.00004985217,0.000025131945,0.00001999963,0.0001040604,0.0012341208],"genre_scores_gemma":[0.42519775,0.0006970609,0.5710952,0.0002797835,0.0002072748,0.00012011773,0.00015643732,0.000039517497,0.0022068394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991221,0.00026727866,0.00003101651,0.00014986028,0.00038278746,0.00004705092],"domain_scores_gemma":[0.9989385,0.0006039098,0.00010064802,0.00015747162,0.00016397177,0.000035467332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060334214,0.00051394256,0.0005572968,0.00041410368,0.00028763374,0.0005281941,0.00061955187,0.00073678896,0.001458768],"category_scores_gemma":[0.0025583482,0.0002290605,0.0002643026,0.00037557876,0.00075644074,0.0012512399,0.0010183409,0.00092934334,0.00039988323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006273502,0.00015506595,0.000973854,0.00034840396,0.000093660106,0.0002549042,0.00020958962,0.22063921,0.17229867,0.101990856,0.0028658817,0.4995426],"study_design_scores_gemma":[0.000025869987,0.00015134313,0.0003594826,0.000030637635,0.000015599659,0.00026573075,0.000043670367,0.94657207,0.025132457,0.02307462,0.0043019205,0.000026600166],"about_ca_topic_score_codex":0.00042100344,"about_ca_topic_score_gemma":0.00058386556,"teacher_disagreement_score":0.001458768,"about_ca_system_score_codex":0.00026108127,"about_ca_system_score_gemma":0.00035985274,"threshold_uncertainty_score":0.0048800707},"labels":[],"label_agreement":null},{"id":"W2095979461","doi":"10.1109/icpr.2014.238","title":"Sparse Representation and Low-Rank Approximation for Robust Face Recognition","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Facial recognition system; Computer science; Artificial intelligence; Three-dimensional face recognition; Face (sociological concept); Sparse approximation; Representation (politics); Pattern recognition (psychology); Rank (graph theory); Face hallucination; Character recognition; Computer vision; Face detection; Image (mathematics); Mathematics","score_opus":0.040178742160873374,"score_gpt":0.24239908733049675,"score_spread":0.2022203451696234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095979461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00423941,0.0016786144,0.99241686,0.00027342403,0.00006593064,0.000019439016,0.00009027977,0.000288471,0.0009275194],"genre_scores_gemma":[0.29191968,0.006977187,0.69431204,0.00044349657,0.0007621064,0.00017772858,0.001101407,0.00014771796,0.004158637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999246,0.0002119814,0.000038108014,0.00012205826,0.00032775194,0.000054182397],"domain_scores_gemma":[0.9988949,0.0006483968,0.00011906187,0.00015878149,0.00015034963,0.00002855989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077109406,0.00066691864,0.0010449567,0.00085304363,0.00025971307,0.00058142655,0.00069856347,0.0009014016,0.002752395],"category_scores_gemma":[0.003693011,0.00023513066,0.00065756374,0.0014972555,0.00063289015,0.0010409376,0.00071364496,0.0014144435,0.0012050167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002321594,0.00012035316,0.0006926539,0.0005026263,0.00012986822,0.00017700183,0.00013016704,0.21100199,0.037863128,0.053944252,0.014085626,0.6811202],"study_design_scores_gemma":[0.0000137151055,0.000078440986,0.00043144438,0.000024483628,0.000025457415,0.00016255256,0.000024808478,0.9659641,0.0064261737,0.021889409,0.0049364963,0.000022971459],"about_ca_topic_score_codex":0.001787957,"about_ca_topic_score_gemma":0.0016370977,"teacher_disagreement_score":0.002752395,"about_ca_system_score_codex":0.0003115952,"about_ca_system_score_gemma":0.00051463273,"threshold_uncertainty_score":0.009207666},"labels":[],"label_agreement":null},{"id":"W2097098226","doi":"10.1186/1687-6180-2013-155","title":"Deterministic construction of Fourier-based compressed sensing matrices using an almost difference set","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Block matrix; DFT matrix; Matrix (chemical analysis); Algorithm; Concatenation (mathematics); Fast Fourier transform; Discrete Fourier transform (general); Fourier transform; Mathematics; Sparse matrix; Single-entry matrix; Integer matrix; Row; Computer science; Combinatorics; Symmetric matrix; Short-time Fourier transform; Fourier analysis; Square matrix; Mathematical analysis; Nonnegative matrix; Physics","score_opus":0.029727312320954977,"score_gpt":0.2877581266520866,"score_spread":0.2580308143311316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097098226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061064223,0.00008558924,0.99213636,0.00007446399,0.000034345365,0.00002467374,0.000038498085,0.000072687784,0.0014269991],"genre_scores_gemma":[0.27906042,0.00043393398,0.7167882,0.00022288767,0.00012549275,0.00019622795,0.0003260953,0.00007561763,0.0027712085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879277,0.00031707677,0.00006364333,0.00022214638,0.0005379099,0.00006637333],"domain_scores_gemma":[0.99852955,0.0007231981,0.00015628917,0.00027905244,0.00025787196,0.000054022807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009577027,0.0005917256,0.0005243991,0.00077900704,0.00040200684,0.00071914843,0.00084649393,0.0005855165,0.0019049774],"category_scores_gemma":[0.0035600048,0.00034618512,0.0006433017,0.00066509447,0.001016584,0.0012120706,0.0012121795,0.0011333951,0.00050896604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018538658,0.00009177327,0.0006393587,0.00020152888,0.000055231132,0.00022126421,0.0002323152,0.19194175,0.04050424,0.6089562,0.0023605747,0.15461043],"study_design_scores_gemma":[0.000022151893,0.00017490657,0.00021552606,0.000022955574,0.000012202664,0.00033379925,0.00003071233,0.92051244,0.014171075,0.058416873,0.006046071,0.000041335446],"about_ca_topic_score_codex":0.0005263554,"about_ca_topic_score_gemma":0.00052062667,"teacher_disagreement_score":0.0019049774,"about_ca_system_score_codex":0.0005304546,"about_ca_system_score_gemma":0.00067382754,"threshold_uncertainty_score":0.00637275},"labels":[],"label_agreement":null},{"id":"W2097572927","doi":"10.1109/glocom.2008.ecp.549","title":"Compressive Sensing Receiver for Free-Space Optical Communication Through the Atmosphere","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Detector; Preamplifier; Antenna diversity; Digital micromirror device; Optics; Compressed sensing; Bit error rate; Electronic engineering; Computer science; Free-space optical communication; SIGNAL (programming language); Optical communication; Channel (broadcasting); Physics; Telecommunications; Bandwidth (computing); Engineering; Wireless; Algorithm","score_opus":0.030449332036385203,"score_gpt":0.2422619071199291,"score_spread":0.2118125750835439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097572927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045026787,0.00083240354,0.9477305,0.00048506737,0.00015030729,0.000036262696,0.000064056956,0.00040523004,0.005269403],"genre_scores_gemma":[0.6027423,0.0007081246,0.3885966,0.00029249527,0.00026003088,0.00005923216,0.00011551484,0.00003451125,0.007191137],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997141,0.0000615722,0.000007521402,0.000034754637,0.00016547702,0.000016479564],"domain_scores_gemma":[0.9996013,0.00019549992,0.000047531357,0.000040355386,0.000096605654,0.000018720915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033124423,0.00029616768,0.00024890172,0.00017263969,0.00021748738,0.00037213802,0.00040621747,0.00051366043,0.0019371113],"category_scores_gemma":[0.0008391668,0.000121617704,0.00017135295,0.00018324284,0.0003121307,0.0005818401,0.00039111843,0.0006302879,0.0005443681],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045079863,0.00014987198,0.0014396048,0.00028063625,0.00008486418,0.00023736611,0.00018497651,0.09071867,0.53330785,0.0684462,0.0046930504,0.30000618],"study_design_scores_gemma":[0.000047011195,0.0005015809,0.00057143037,0.00003499808,0.000039837847,0.0003490971,0.00004196326,0.84294605,0.13541077,0.0070504355,0.012956894,0.000050035615],"about_ca_topic_score_codex":0.0004953345,"about_ca_topic_score_gemma":0.00082066486,"teacher_disagreement_score":0.0019371113,"about_ca_system_score_codex":0.00024698055,"about_ca_system_score_gemma":0.00036208177,"threshold_uncertainty_score":0.006480336},"labels":[],"label_agreement":null},{"id":"W2097963165","doi":"10.1109/icc.2011.5963359","title":"Scalable Video Coding with Compressive Sensing for Wireless Videocast","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scalable Video Coding; Scalability; Wireless; Unicast; Bitstream; Bit error rate; Multicast; Computer network; Real-time computing; Coding (social sciences); Channel (broadcasting); Decoding methods; Algorithm; Telecommunications","score_opus":0.03292024757889676,"score_gpt":0.21693281194261171,"score_spread":0.18401256436371496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097963165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022654667,0.0005665779,0.9744717,0.00027846816,0.000046454003,0.00003291127,0.000022458482,0.00013953722,0.0017872828],"genre_scores_gemma":[0.7060926,0.0010990322,0.2904887,0.0001333409,0.00013931346,0.000114026625,0.00010424598,0.00002085166,0.0018080026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998436,0.000037531907,0.0000051870625,0.000013738757,0.00008995008,0.000009826329],"domain_scores_gemma":[0.9997141,0.00014740233,0.00003354548,0.00004000673,0.00005347481,0.000011524311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003122024,0.00024337227,0.00018978237,0.00024746987,0.00015129028,0.00019657079,0.0003173384,0.00031573567,0.0005132823],"category_scores_gemma":[0.000993706,0.00009183455,0.00018563417,0.00034814328,0.00035690615,0.0005025918,0.0003725519,0.0005168747,0.00010134869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001953238,0.000081547914,0.0006643372,0.00019317343,0.000045334866,0.00020903828,0.00014079994,0.47764045,0.16838443,0.07953028,0.003539577,0.2693757],"study_design_scores_gemma":[0.000013153005,0.000056611636,0.0001388807,0.000009609793,0.0000073366855,0.00004806519,0.000012340513,0.9785982,0.010412652,0.0092676105,0.0014277766,0.000007727417],"about_ca_topic_score_codex":0.0012096288,"about_ca_topic_score_gemma":0.0017160805,"teacher_disagreement_score":0.0012096288,"about_ca_system_score_codex":0.00024029301,"about_ca_system_score_gemma":0.0003217284,"threshold_uncertainty_score":0.0024051666},"labels":[],"label_agreement":null},{"id":"W2098204196","doi":"10.1080/10556788.2014.936438","title":"Penalty decomposition methods for rank minimization","year":2014,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Minification; Mathematical optimization; Penalty method; Mathematics; Low-rank approximation; Matrix (chemical analysis); Sequence (biology); Algorithm; Computer science; Combinatorics; Hankel matrix","score_opus":0.03348095355379413,"score_gpt":0.39550123841638335,"score_spread":0.3620202848625892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098204196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008896248,0.0002980029,0.9976672,0.00009784562,0.000031218093,0.000015620268,0.00002002028,0.000047925772,0.00093255757],"genre_scores_gemma":[0.07105533,0.0016068416,0.91891736,0.00021245625,0.00024218371,0.00021210704,0.00025863358,0.00025342708,0.007241612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989108,0.00048968237,0.000046536574,0.00014131704,0.0003560053,0.000055590215],"domain_scores_gemma":[0.99827135,0.000956916,0.00016323027,0.00022467678,0.00030826282,0.00007551691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001825512,0.0012562427,0.0010333887,0.0006662107,0.00041079783,0.000954102,0.0009302017,0.0013475477,0.0036274611],"category_scores_gemma":[0.005190806,0.00043438032,0.00069253874,0.00090736384,0.001207341,0.0014707155,0.0014464987,0.0023740951,0.0015091434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013955134,0.000104734754,0.0005433738,0.0007992348,0.00012342486,0.0002073068,0.00016461052,0.44525737,0.018940741,0.32224634,0.009882045,0.20159118],"study_design_scores_gemma":[0.000012213936,0.000043400727,0.00007947522,0.00003139158,0.000009861224,0.00009788249,0.000013873293,0.94683707,0.0028292167,0.0421957,0.007835754,0.000014195992],"about_ca_topic_score_codex":0.0007833406,"about_ca_topic_score_gemma":0.0008820473,"teacher_disagreement_score":0.0036274611,"about_ca_system_score_codex":0.00043416093,"about_ca_system_score_gemma":0.00075853016,"threshold_uncertainty_score":0.012135029},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03735659040357165,"score_gpt":0.22195609151028053,"score_spread":0.1845995011067089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099474155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0288343,0.0031144873,0.9527525,0.0013180742,0.00016661534,0.00005692074,0.0001982361,0.00007846729,0.013480479],"genre_scores_gemma":[0.61829203,0.009323228,0.35840082,0.000979898,0.0019066058,0.0004974309,0.0009248063,0.00025254654,0.009422603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713033,0.00086618494,0.00024836595,0.0005426142,0.0010598651,0.00015271644],"domain_scores_gemma":[0.9866796,0.008322739,0.0016593308,0.00087188446,0.0021426145,0.00032391673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041663293,0.0009368919,0.0011288723,0.004744177,0.0009958408,0.003100183,0.0012914126,0.0017857705,0.0020073806],"category_scores_gemma":[0.021489294,0.00043751832,0.00092827866,0.00361801,0.004478401,0.007822903,0.0024928155,0.0029598244,0.0008481818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026468097,0.000022910861,0.00079822383,0.00012178135,0.000026265378,0.00014806456,0.00013027519,0.024700304,0.0029073416,0.9463978,0.0012356259,0.02348506],"study_design_scores_gemma":[0.0000084285675,0.0001113715,0.00097094005,0.0000758904,0.000018073662,0.0005619547,0.00007504624,0.22687902,0.0014976434,0.7630007,0.006751374,0.00004959053],"about_ca_topic_score_codex":0.00084698806,"about_ca_topic_score_gemma":0.00052592636,"teacher_disagreement_score":0.004744177,"about_ca_system_score_codex":0.0015664741,"about_ca_system_score_gemma":0.0009535871,"threshold_uncertainty_score":0.02203393},"labels":[],"label_agreement":null},{"id":"W2099548308","doi":"10.1109/pacrim.2011.6032866","title":"Recovery of sparse signals from noisy measurements using an &amp;#x2113;&lt;inf&gt;p&lt;/inf&gt; regularized least-squares algorithm","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Algorithm; Minification; Norm (philosophy); Complement (music); Computation; Mathematics; Descent (aeronautics); Computer science; Mathematical optimization; Physics","score_opus":0.11339109039001762,"score_gpt":0.25741935795586063,"score_spread":0.14402826756584303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099548308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014619088,0.000061917875,0.997898,0.00005910212,0.000020095447,0.000013184599,0.00002243394,0.00017224114,0.0002910257],"genre_scores_gemma":[0.04192677,0.00026408065,0.95551157,0.00006669342,0.000062867664,0.00008949223,0.00015379659,0.000055659853,0.0018690831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.0001427737,0.000031957992,0.00012213794,0.00029091575,0.000024918358],"domain_scores_gemma":[0.9995104,0.0002240844,0.00005897836,0.00007770983,0.00011107019,0.000017709477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007231864,0.0006832376,0.0008692043,0.0005114704,0.00026955365,0.00065444055,0.0008091057,0.0008925756,0.0018475746],"category_scores_gemma":[0.002429877,0.00040513056,0.00061614945,0.0007582447,0.00056632084,0.0011757206,0.0009790335,0.0013578378,0.0010784052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039262685,0.00012964448,0.0005495184,0.0003704067,0.00012148336,0.0002845345,0.00018842917,0.34768745,0.073329665,0.038164534,0.0051549794,0.5336267],"study_design_scores_gemma":[0.000028037022,0.00009133197,0.00015245653,0.000015422327,0.000013939743,0.00016509088,0.000012106867,0.9817817,0.009599413,0.0042812927,0.0038365112,0.000022713304],"about_ca_topic_score_codex":0.0013172652,"about_ca_topic_score_gemma":0.001867894,"teacher_disagreement_score":0.0018475746,"about_ca_system_score_codex":0.0003529157,"about_ca_system_score_gemma":0.00087965355,"threshold_uncertainty_score":0.0061807036},"labels":[],"label_agreement":null},{"id":"W2100286988","doi":"10.1109/tsmcb.2009.2038493","title":"Robust Classifiers for Data Reduced via Random Projections","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dimensionality reduction; Random projection; Curse of dimensionality; Pattern recognition (psychology); Random subspace method; Artificial intelligence; Classifier (UML); Subspace topology; Computer science; Robustness (evolution); k-nearest neighbors algorithm; Machine learning","score_opus":0.057345601118771676,"score_gpt":0.2547730542609776,"score_spread":0.19742745314220594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100286988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069825877,0.00042490396,0.99117553,0.00023535172,0.00004394775,0.000042819633,0.000064319494,0.00025755216,0.0007730166],"genre_scores_gemma":[0.32819855,0.0014372716,0.664224,0.0003219753,0.00038736095,0.0004334259,0.0007207707,0.0001221965,0.0041543934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964479,0.0009236968,0.00018472174,0.00065525837,0.0015911069,0.00019727314],"domain_scores_gemma":[0.99437153,0.0030818982,0.0006965482,0.00084419415,0.00091929286,0.000086533975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003447085,0.00086134166,0.0016215345,0.0014476031,0.0005954394,0.0016363895,0.0010403146,0.0013960047,0.0016839772],"category_scores_gemma":[0.016473705,0.000478917,0.0008726278,0.0012825314,0.0014203693,0.0024267328,0.0017710262,0.0019945048,0.00088877574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002732304,0.00007768866,0.0009123732,0.00023376787,0.000146317,0.00019288564,0.00019627388,0.4938033,0.011559632,0.12909222,0.0059596826,0.3575526],"study_design_scores_gemma":[0.000008354977,0.000038203292,0.00020142656,0.000013705211,0.000009852533,0.00005976749,0.000015406978,0.97079897,0.0023817804,0.024900828,0.0015580984,0.000013646443],"about_ca_topic_score_codex":0.001634731,"about_ca_topic_score_gemma":0.0011516173,"teacher_disagreement_score":0.003447085,"about_ca_system_score_codex":0.00091810786,"about_ca_system_score_gemma":0.0011563122,"threshold_uncertainty_score":0.01823014},"labels":[],"label_agreement":null},{"id":"W2101499617","doi":"10.1109/lcomm.2013.13.0621130828","title":"Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compressed sensing; Computer science; Wireless sensor network; Data aggregator; Algorithm; Integer programming; Linear programming; Approximation algorithm; Mathematical optimization; Computer network; Mathematics","score_opus":0.07220159110532873,"score_gpt":0.2935396447795668,"score_spread":0.22133805367423806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101499617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027325323,0.00012699829,0.9956117,0.00015683212,0.000022984765,0.000032542248,0.00002673949,0.00015401976,0.0011357843],"genre_scores_gemma":[0.16411558,0.0004781364,0.8327655,0.000120582205,0.00008978632,0.00036009512,0.00024954518,0.000103956685,0.0017168303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990625,0.00028467827,0.000042158776,0.00014128136,0.00035046498,0.00011893657],"domain_scores_gemma":[0.99807656,0.0012573673,0.00016317415,0.00016775027,0.00026500886,0.00007022498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164281,0.0012933754,0.001138655,0.0007796732,0.00064018246,0.0011326056,0.0012394175,0.0011946737,0.0028944886],"category_scores_gemma":[0.0054976344,0.000674598,0.0006271701,0.0011992399,0.0010588992,0.0019611574,0.0021175575,0.0022276414,0.00069916225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010772971,0.00014266263,0.00031312276,0.00012381215,0.000027617165,0.000049277543,0.00010005953,0.83062154,0.0028918318,0.05271968,0.0031622755,0.10974044],"study_design_scores_gemma":[0.000014333847,0.000023423487,0.000026916696,0.000006310319,0.0000025451366,0.0000132744035,0.000014755239,0.98331094,0.00053314504,0.015519433,0.0005306302,0.0000042395222],"about_ca_topic_score_codex":0.0022016398,"about_ca_topic_score_gemma":0.0027915307,"teacher_disagreement_score":0.0028944886,"about_ca_system_score_codex":0.00087875006,"about_ca_system_score_gemma":0.0018035654,"threshold_uncertainty_score":0.009683013},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013665174780859551,"score_gpt":0.26140875239392786,"score_spread":0.2477435776130683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102138843","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008450956,0.00009418008,0.99736375,0.0001883069,0.000024809204,0.000020018546,0.000023720386,0.00015481345,0.0012852773],"genre_scores_gemma":[0.095876716,0.00044709624,0.8973876,0.0002646377,0.00021590943,0.00030994372,0.0002669092,0.00029697202,0.0049342313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808025,0.00078466674,0.00006823524,0.00037788798,0.00057075924,0.00011829886],"domain_scores_gemma":[0.9955974,0.0028852045,0.000251923,0.0006142275,0.0005192469,0.00013198025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003008409,0.0018145277,0.0012148566,0.0005389649,0.00078324653,0.0015128857,0.0016796939,0.0018526141,0.0058377488],"category_scores_gemma":[0.00985307,0.0006598183,0.00071588025,0.0011605943,0.0021213938,0.0027573118,0.0024890148,0.0044232197,0.002058348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017582769,0.00012877281,0.00035868128,0.0002731513,0.000050152146,0.00011209229,0.00012972699,0.6296468,0.0057571493,0.22282842,0.015753953,0.12478532],"study_design_scores_gemma":[0.000008393001,0.000020723586,0.000034848355,0.000008330331,0.000002285484,0.000022815326,0.000009383906,0.9575914,0.0010210143,0.039223664,0.0020510915,0.000006013047],"about_ca_topic_score_codex":0.0021502974,"about_ca_topic_score_gemma":0.002932497,"teacher_disagreement_score":0.0058377488,"about_ca_system_score_codex":0.0013496329,"about_ca_system_score_gemma":0.0018708444,"threshold_uncertainty_score":0.019529164},"labels":[],"label_agreement":null},{"id":"W2102460275","doi":"10.1109/icassp.2009.4959720","title":"Classification via group sparsity promoting regularization","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Training set; Artificial intelligence; Elastic net regularization; Test set; Computer science; Pattern recognition (psychology); Mathematics; Class (philosophy); Sample (material); Benchmark (surveying); Regularization perspectives on support vector machines; Tikhonov regularization; Machine learning; Feature selection; Inverse problem","score_opus":0.016150921892917225,"score_gpt":0.2151156575446244,"score_spread":0.19896473565170716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102460275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010646556,0.00014992109,0.9876236,0.00030203525,0.00003724819,0.000026800633,0.000051262887,0.00022524287,0.0009373205],"genre_scores_gemma":[0.42208678,0.0007040784,0.5676045,0.00068044744,0.0006685552,0.0003258668,0.0009721843,0.00015047143,0.006807106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850476,0.00054469495,0.000052849886,0.00031864812,0.00047995776,0.00009910535],"domain_scores_gemma":[0.99783605,0.0010571127,0.00028144513,0.0004302039,0.00031532024,0.000079883444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019445571,0.0006613866,0.0013554713,0.0011327864,0.00041866497,0.0010106965,0.0011776609,0.0013866356,0.00136545],"category_scores_gemma":[0.0050563677,0.00033831532,0.00080915925,0.0012265005,0.0012135411,0.0016408368,0.0014739627,0.0016594059,0.0007616828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005185842,0.00019063243,0.0022968375,0.00024318248,0.0001611068,0.00017949946,0.00027070622,0.32138,0.013917498,0.072688825,0.01749185,0.57066125],"study_design_scores_gemma":[0.000015862199,0.000043037282,0.00022490753,0.000007658091,0.000011293364,0.000044850218,0.000013055344,0.97565746,0.0014097507,0.021112485,0.0014500634,0.000009508079],"about_ca_topic_score_codex":0.0008148856,"about_ca_topic_score_gemma":0.0007076926,"teacher_disagreement_score":0.0019445571,"about_ca_system_score_codex":0.00049428863,"about_ca_system_score_gemma":0.00050109404,"threshold_uncertainty_score":0.010283947},"labels":[],"label_agreement":null},{"id":"W2102524639","doi":"10.1109/icassp.2008.4518243","title":"Channel estimation using DPSS based frames","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Western University","funders":"","keywords":"Channel (broadcasting); Estimator; Algorithm; Representation (politics); Computer science; Basis (linear algebra); Frame (networking); Basis function; Fading; Estimation theory; Matching (statistics); Mathematics; Decoding methods; Statistics; Telecommunications","score_opus":0.05763585744257798,"score_gpt":0.27435185634381454,"score_spread":0.21671599890123655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102524639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015352488,0.000109283654,0.9834804,0.00005202389,0.00003057227,0.00001681516,0.00003743508,0.00014024499,0.0007806424],"genre_scores_gemma":[0.38691017,0.0004632735,0.610195,0.00006845959,0.00009089362,0.0000782185,0.00023198871,0.000032815737,0.0019292372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963784,0.00010331474,0.000016113945,0.000058669684,0.00015269105,0.00003139553],"domain_scores_gemma":[0.99953246,0.00016032212,0.00006457609,0.00009816589,0.00012619533,0.000018272545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045286765,0.0005265702,0.0004885908,0.00054461934,0.00026166838,0.00052285613,0.0004076481,0.00053492456,0.0007608573],"category_scores_gemma":[0.0019517748,0.00021705651,0.00026002672,0.0006668815,0.0003684721,0.00081150705,0.00050816475,0.0005827145,0.00032795084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043614657,0.00005994802,0.0012336355,0.00011424943,0.000057435722,0.00014173242,0.00014065013,0.40644225,0.10632606,0.033777043,0.001821583,0.4494493],"study_design_scores_gemma":[0.0000139573285,0.000057154357,0.0002895079,0.000009522456,0.000008862516,0.000059906106,0.000017597538,0.97460043,0.01969659,0.0034189003,0.0018128625,0.00001471662],"about_ca_topic_score_codex":0.0022861855,"about_ca_topic_score_gemma":0.0017913431,"teacher_disagreement_score":0.0022861855,"about_ca_system_score_codex":0.00028636685,"about_ca_system_score_gemma":0.0004704034,"threshold_uncertainty_score":0.0045457482},"labels":[],"label_agreement":null},{"id":"W2103208142","doi":"10.1109/iscas.2011.5938018","title":"Signal recovery method for compressive sensing using relaxation and second-order cone programming","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relaxation (psychology); Compressed sensing; Algorithm; Second-order cone programming; Mathematical optimization; Convex optimization; Mathematics; Computer science; Linear programming; Approximation error; Applied mathematics; Regular polygon; Geometry","score_opus":0.04816456461697613,"score_gpt":0.27062773502143267,"score_spread":0.22246317040445654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103208142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007983639,0.000075890144,0.9983872,0.00007619487,0.000021234195,0.00001976468,0.00001553109,0.000072688454,0.0005331486],"genre_scores_gemma":[0.072689064,0.0006930291,0.92218053,0.00021523489,0.00013044152,0.00024477433,0.00025844868,0.00013837495,0.0034500828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00017285589,0.000029772955,0.000093723145,0.00033136157,0.000045051398],"domain_scores_gemma":[0.999091,0.000446277,0.000113297254,0.000078099656,0.00021641243,0.000054930166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011307471,0.0012099693,0.0009990375,0.00057931844,0.00044998922,0.0008613807,0.0013331554,0.0010822858,0.0022213398],"category_scores_gemma":[0.002123037,0.0005042992,0.0010905385,0.0008624693,0.00088998204,0.0012700859,0.0015089493,0.002932695,0.00076146045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015351824,0.000120269724,0.00036323472,0.00047009808,0.000088782195,0.00029490868,0.00024584722,0.6625288,0.040804107,0.08461734,0.008122063,0.20219108],"study_design_scores_gemma":[0.0000059008294,0.00003114126,0.000029944771,0.00000950855,0.000004225031,0.00005513893,0.0000096268195,0.99348587,0.0021603121,0.0026832826,0.001514333,0.000010734415],"about_ca_topic_score_codex":0.0023410688,"about_ca_topic_score_gemma":0.0020230024,"teacher_disagreement_score":0.0023410688,"about_ca_system_score_codex":0.0005336265,"about_ca_system_score_gemma":0.001671818,"threshold_uncertainty_score":0.0074311495},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.02411154975420832,"score_gpt":0.23799322509561327,"score_spread":0.21388167534140495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103351706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15040174,0.00024557134,0.84567297,0.00039933404,0.00005629072,0.00002504223,0.00015965525,0.0002254362,0.0028139525],"genre_scores_gemma":[0.86606175,0.000591699,0.13028046,0.00016332493,0.00011481113,0.000053577292,0.00043875512,0.000109703156,0.002185993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995503,0.00013451057,0.000016847409,0.00009730352,0.00013692256,0.00006414121],"domain_scores_gemma":[0.9977222,0.0014461842,0.00020946773,0.0002986589,0.00023964231,0.000083820225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061799615,0.0007890208,0.00051396945,0.0015373066,0.0003388292,0.0010553015,0.00075484184,0.0009856039,0.0014269638],"category_scores_gemma":[0.006071039,0.00031781377,0.000432079,0.001063602,0.0012951987,0.0015738732,0.0011467417,0.001279667,0.00033351145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044795003,0.00007328389,0.0030195697,0.00024699207,0.000069918235,0.0005690336,0.00045304405,0.49433768,0.049317006,0.35782346,0.0023117778,0.09133026],"study_design_scores_gemma":[0.000017993045,0.000061374005,0.00078921654,0.00002242861,0.000011556463,0.00013548466,0.00012745133,0.8434093,0.0047260844,0.14906591,0.0016116768,0.000021502778],"about_ca_topic_score_codex":0.0011496893,"about_ca_topic_score_gemma":0.00094272994,"teacher_disagreement_score":0.0015373066,"about_ca_system_score_codex":0.00048643711,"about_ca_system_score_gemma":0.00024693063,"threshold_uncertainty_score":0.0047736764},"labels":[],"label_agreement":null},{"id":"W2103376933","doi":"10.1109/icvgip.2008.30","title":"Regularization of Incompletely, Irregularly and Randomly Sampled Data","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Interpolation (computer graphics); Kurtosis; Computer science; Bandlimiting; Matching pursuit; Fourier transform; Regularization (linguistics); Mathematical optimization; Mathematics; Artificial intelligence; Mathematical analysis; Statistics; Compressed sensing","score_opus":0.0611843477480413,"score_gpt":0.23298206279248163,"score_spread":0.17179771504444033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103376933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059494425,0.00024517154,0.93901944,0.00022243198,0.000035644753,0.000020434614,0.000084779946,0.00015385622,0.00072390126],"genre_scores_gemma":[0.59962034,0.0006229459,0.3968374,0.00016162888,0.00009128009,0.00009687782,0.0005405096,0.00007827872,0.0019506692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991048,0.00031653218,0.000047530364,0.00016817183,0.00029131072,0.00007162581],"domain_scores_gemma":[0.9970054,0.0019319913,0.00027971412,0.00049495307,0.00022904335,0.000059012833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018185629,0.0005267745,0.000791942,0.0005648722,0.00030122718,0.00053124275,0.0007533622,0.0009110647,0.00047246108],"category_scores_gemma":[0.0072167334,0.00030365415,0.00056563574,0.00070963695,0.0010580926,0.00089271803,0.0010131525,0.0009767072,0.0001461732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030892718,0.00006289304,0.0021366552,0.0002825744,0.000103587736,0.00038159313,0.00023992048,0.85102576,0.033862907,0.038431272,0.0013504791,0.07181341],"study_design_scores_gemma":[0.000007974496,0.000031191626,0.0005269808,0.000011149817,0.000006247279,0.000075166834,0.000023213628,0.9852325,0.005225727,0.007989677,0.00086007686,0.000010279905],"about_ca_topic_score_codex":0.0016651114,"about_ca_topic_score_gemma":0.0016574472,"teacher_disagreement_score":0.0018185629,"about_ca_system_score_codex":0.00046093683,"about_ca_system_score_gemma":0.0006983837,"threshold_uncertainty_score":0.009617627},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05386574135832146,"score_gpt":0.26614033896466255,"score_spread":0.2122745976063411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104417092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006163192,0.00007070782,0.9983621,0.000098119606,0.000019822739,0.000007820737,0.000019176756,0.000023689237,0.00078231544],"genre_scores_gemma":[0.067052126,0.0006854304,0.92531276,0.0001649743,0.00016164462,0.00022891593,0.00019775405,0.0001333368,0.0060629863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949396,0.00023686381,0.000019696747,0.000049323815,0.0001701643,0.00003009103],"domain_scores_gemma":[0.9989404,0.0006664029,0.00007781787,0.000075683565,0.00019547893,0.00004425315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489138,0.0009059954,0.0010538021,0.0008160115,0.00043582582,0.0011844311,0.0012740338,0.0010866745,0.002872517],"category_scores_gemma":[0.0035650185,0.0006468543,0.00086285395,0.0010713465,0.0010981947,0.0014631322,0.0017673419,0.0021168473,0.0007124966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035621888,0.00006182313,0.00018240849,0.00019635621,0.000044866192,0.000091057664,0.00008271286,0.60139155,0.0023546796,0.32027647,0.0052238335,0.07005864],"study_design_scores_gemma":[0.0000042023985,0.000011114405,0.000018541465,0.0000071706163,0.000004282636,0.000012874113,0.000005569451,0.9656085,0.00017224732,0.032783736,0.0013669429,0.000004801556],"about_ca_topic_score_codex":0.0021449723,"about_ca_topic_score_gemma":0.0029751132,"teacher_disagreement_score":0.002872517,"about_ca_system_score_codex":0.0004956822,"about_ca_system_score_gemma":0.0013216214,"threshold_uncertainty_score":0.00960958},"labels":[],"label_agreement":null},{"id":"W2104967066","doi":"10.1109/icip.2008.4712422","title":"Spect image restoration via Recursive Inverse Filtering constrained by a probabilistic MRI atlas","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Deconvolution; Computer science; Artificial intelligence; Probabilistic logic; Computer vision; Brain atlas; Image resolution; Inverse problem; Pattern recognition (psychology); Algorithm; Mathematics","score_opus":0.014304935724902908,"score_gpt":0.21097922751318884,"score_spread":0.19667429178828594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104967066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004837872,0.000035540696,0.9946091,0.00004590373,0.0000059572185,0.0000122717165,0.000020933487,0.00018026485,0.00025203076],"genre_scores_gemma":[0.16633233,0.00025994185,0.83146787,0.00007241436,0.00005697947,0.00012487678,0.00017902227,0.0000940607,0.0014124574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996357,0.000121472855,0.000016298163,0.00006138053,0.00014021245,0.000024843392],"domain_scores_gemma":[0.9995573,0.00020229271,0.000086154636,0.00007414977,0.000059460956,0.000020671887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007238228,0.0007702998,0.00071752013,0.00052749045,0.0002295205,0.00057607784,0.000767845,0.00090506056,0.00097530393],"category_scores_gemma":[0.0020506966,0.0004989207,0.0008863161,0.0005108796,0.00069959584,0.00061550236,0.0010526318,0.00091347634,0.00044079596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022881648,0.00003784125,0.0005151721,0.00015463862,0.0000672078,0.00021142841,0.00016452672,0.7700015,0.060752235,0.01884035,0.001331948,0.14769433],"study_design_scores_gemma":[0.000014096191,0.00004840603,0.0003083959,0.0000069268413,0.000015742857,0.00014331994,0.000007860248,0.9867207,0.0067018936,0.004719564,0.0012960223,0.000017089362],"about_ca_topic_score_codex":0.0022776676,"about_ca_topic_score_gemma":0.0020241905,"teacher_disagreement_score":0.0022776676,"about_ca_system_score_codex":0.0003986782,"about_ca_system_score_gemma":0.00085638196,"threshold_uncertainty_score":0.0045288205},"labels":[],"label_agreement":null},{"id":"W2105226795","doi":"10.1109/icassp.2013.6637798","title":"Reconstruction of ECG signals for compressive sensing by promoting sparsity on the gradient","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Conjugate gradient method; Algorithm; Computation; Reduction (mathematics); Computer science; Signal reconstruction; Regularization (linguistics); Block (permutation group theory); SIGNAL (programming language); Least-squares function approximation; Bayesian probability; Pattern recognition (psychology); Signal processing; Artificial intelligence; Mathematics; Statistics; Telecommunications","score_opus":0.01917047420036618,"score_gpt":0.20703810572431675,"score_spread":0.18786763152395056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105226795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022469058,0.0001018654,0.9970919,0.000071694434,0.000021806281,0.00001539192,0.000010488263,0.00008568966,0.00035419164],"genre_scores_gemma":[0.07291589,0.00042809607,0.9250251,0.00008780591,0.000068258596,0.00008023745,0.000082702936,0.000044120687,0.0012678028],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997538,0.00007014042,0.000013397019,0.000030904477,0.000117567324,0.000014289056],"domain_scores_gemma":[0.9997402,0.00013315349,0.000028658522,0.00003127932,0.000053090727,0.00001370444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048566316,0.00056687783,0.0004936772,0.0003011901,0.00019997533,0.0005217795,0.00050440204,0.0006708928,0.0012872571],"category_scores_gemma":[0.0014143896,0.0002402071,0.00034238567,0.0004328068,0.00034736271,0.0007346538,0.00070873974,0.00090195023,0.0005179205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002820598,0.00011390139,0.0009596477,0.00029393224,0.00007735465,0.00022437338,0.00016036452,0.26366788,0.106439754,0.04930668,0.0049360786,0.57353795],"study_design_scores_gemma":[0.000015227972,0.00007566018,0.00014311654,0.000010899956,0.00000809348,0.00015947696,0.000009630833,0.98670745,0.0071540126,0.0031962928,0.002510387,0.000009733232],"about_ca_topic_score_codex":0.0005981429,"about_ca_topic_score_gemma":0.0010989131,"teacher_disagreement_score":0.0012872571,"about_ca_system_score_codex":0.0001864635,"about_ca_system_score_gemma":0.00044638195,"threshold_uncertainty_score":0.004306257},"labels":[],"label_agreement":null},{"id":"W2105240317","doi":"10.1109/tcsvt.2011.2133890","title":"Maximum Frame Rate Video Acquisition Using Adaptive Compressed Sensing","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems for Video Technology","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer vision; Artificial intelligence; Redundancy (engineering); Inter frame; Compressed sensing; Nyquist rate; Frame rate; Video compression picture types; Frame (networking); Intra-frame; Sampling (signal processing); Motion compensation; Video tracking; Reference frame; Video processing; Pixel","score_opus":0.05146870068740761,"score_gpt":0.2400862297601714,"score_spread":0.1886175290727638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105240317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046468206,0.0004613564,0.9491927,0.00017120126,0.000034170083,0.000111472924,0.000054166565,0.000567041,0.0029396594],"genre_scores_gemma":[0.52158844,0.0005200803,0.47610408,0.00010343545,0.00005800134,0.000107965185,0.0001398441,0.000031977113,0.0013462324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962246,0.0000828441,0.000012097777,0.000047038222,0.00021239562,0.000023136856],"domain_scores_gemma":[0.9996594,0.00015746926,0.00004317638,0.00004697984,0.00007739626,0.000015653413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040671072,0.00033056657,0.00029493295,0.00045619067,0.0001776645,0.00028045205,0.00048672006,0.00037542553,0.0007976286],"category_scores_gemma":[0.0013673459,0.000112189904,0.00022149221,0.00043886478,0.0002543416,0.0005882047,0.0004060632,0.00037391306,0.00016602453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007840808,0.0002025595,0.0028938265,0.00025167092,0.0000768393,0.00037506508,0.00020077742,0.0985671,0.28276932,0.013897204,0.0033070685,0.59667456],"study_design_scores_gemma":[0.00006619823,0.00037561476,0.0021599643,0.000029435745,0.000030678704,0.0005924276,0.00003893909,0.90372396,0.08414331,0.003254751,0.005550618,0.000034120476],"about_ca_topic_score_codex":0.0018371675,"about_ca_topic_score_gemma":0.0023946795,"teacher_disagreement_score":0.0018371675,"about_ca_system_score_codex":0.0002424759,"about_ca_system_score_gemma":0.0003149573,"threshold_uncertainty_score":0.0036529899},"labels":[],"label_agreement":null},{"id":"W2105473502","doi":"10.1186/1687-1499-2012-281","title":"A novel reduced power compressive sensing technique for wideband cognitive radio","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Ottawa","funders":"","keywords":"Nyquist rate; Cognitive radio; Computer science; Wideband; Nyquist–Shannon sampling theorem; Spectral density; Compressed sensing; Algorithm; Sampling (signal processing); Power (physics); Power consumption; Electronic engineering; Telecommunications; Wireless; Physics; Computer vision","score_opus":0.04571479492555498,"score_gpt":0.2867807462393675,"score_spread":0.24106595131381253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105473502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007341984,0.00016476205,0.9911283,0.00011506644,0.000043055003,0.000021341759,0.00001956283,0.00010915414,0.0010567013],"genre_scores_gemma":[0.22932667,0.00042744854,0.76713115,0.00021941906,0.00013419778,0.000082890656,0.00008739514,0.00002764533,0.0025631865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996624,0.000078959965,0.000012999161,0.00004853452,0.00017895568,0.00001816216],"domain_scores_gemma":[0.9996426,0.00016576162,0.000046968027,0.000063446736,0.0000601097,0.00002119342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029573907,0.00046303702,0.00035272533,0.00032579966,0.00024116128,0.00031608113,0.0005709009,0.00054337847,0.00095879094],"category_scores_gemma":[0.0013838434,0.000190002,0.00033269497,0.00041484612,0.00035359027,0.0006858037,0.00070103846,0.0007029474,0.0003238373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033959077,0.0002042372,0.0005898122,0.00021766083,0.00006670976,0.00036951381,0.00022280423,0.08752551,0.26188654,0.0347858,0.003081601,0.6107102],"study_design_scores_gemma":[0.000042777647,0.00034288288,0.0005837729,0.000023123734,0.000025107904,0.0008949955,0.000039583465,0.9468453,0.036514666,0.007859415,0.0067928024,0.000035527082],"about_ca_topic_score_codex":0.00039909704,"about_ca_topic_score_gemma":0.000940541,"teacher_disagreement_score":0.00095879094,"about_ca_system_score_codex":0.00015163215,"about_ca_system_score_gemma":0.0003087346,"threshold_uncertainty_score":0.0032075047},"labels":[],"label_agreement":null},{"id":"W2106662462","doi":"","title":"Convex Deep Learning via Normalized Kernels","year":2014,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Deep learning; Computer science; Heuristics; Parametric statistics; Range (aeronautics); Artificial intelligence; Regular polygon; Nonparametric statistics; Machine learning; Layer (electronics); Kernel (algebra); Mathematical optimization; Mathematics; Engineering","score_opus":0.007515000331167515,"score_gpt":0.2033569785074465,"score_spread":0.195841978176279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106662462","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075541437,0.00010018963,0.99067277,0.0001294087,0.000009810727,0.000007980843,0.00003461282,0.00010701105,0.0013840451],"genre_scores_gemma":[0.62869275,0.00093580055,0.36179665,0.00019668552,0.00008886175,0.00014114093,0.00031110167,0.00020727565,0.0076297047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994692,0.0002001014,0.000023286722,0.000086171436,0.00017861745,0.000042636726],"domain_scores_gemma":[0.9991566,0.00039390996,0.000097248405,0.00017498937,0.0001303563,0.00004696212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008837483,0.00079543126,0.00045826726,0.00037844066,0.00020144602,0.0007007939,0.0007583477,0.0005678783,0.0015608044],"category_scores_gemma":[0.004269637,0.00042757476,0.0003571318,0.0003996527,0.0014170463,0.0022705519,0.001555793,0.001661556,0.00042872658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051135932,0.000017073204,0.00026577731,0.000059373393,0.000021628335,0.00004871316,0.000054885655,0.7135185,0.0061645606,0.23753725,0.0014154009,0.040845606],"study_design_scores_gemma":[0.0000015017746,0.000006402193,0.00003396046,0.0000032643834,0.0000010432552,0.000007850439,0.0000032253065,0.96659976,0.0007012626,0.03219302,0.0004459182,0.0000026749135],"about_ca_topic_score_codex":0.0022524442,"about_ca_topic_score_gemma":0.0027815255,"teacher_disagreement_score":0.0022524442,"about_ca_system_score_codex":0.00095753104,"about_ca_system_score_gemma":0.0007561759,"threshold_uncertainty_score":0.006947398},"labels":[],"label_agreement":null},{"id":"W2106696083","doi":"10.1109/icme.2008.4607702","title":"Sub-optimal MMSE based joint source/channel decoding of a matching pursuit coded image bit-stream over a memoryless noisy channel","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Decoding methods; Matching pursuit; Computer science; Redundancy (engineering); Algorithm; Channel (broadcasting); Residual; Error concealment; Bitstream; Bandwidth (computing); Telecommunications; Compressed sensing","score_opus":0.022846865340816296,"score_gpt":0.22258700360755118,"score_spread":0.1997401382667349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106696083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04469041,0.00013829998,0.9537001,0.00012961178,0.000017352257,0.000019359446,0.00003449036,0.00011154146,0.001158825],"genre_scores_gemma":[0.6510435,0.00028225742,0.34479892,0.000057404424,0.00003633814,0.000052306164,0.000101832105,0.000043654407,0.0035838098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965656,0.00009836514,0.000020659,0.000052857387,0.000135794,0.000035705154],"domain_scores_gemma":[0.9995751,0.00022048679,0.0000690577,0.00004745719,0.000072023395,0.000015880227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046930407,0.00050138927,0.00075745926,0.00023252537,0.0002036653,0.0005337793,0.0003438047,0.0006409578,0.00077295833],"category_scores_gemma":[0.0016993742,0.00020697845,0.00025667195,0.00038149752,0.0005530748,0.00075934164,0.00057895464,0.00048168068,0.000241036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006696845,0.00008864453,0.0009910722,0.00022343369,0.0000727968,0.0002924565,0.00019955996,0.68543893,0.10732175,0.047031794,0.0010642147,0.15660574],"study_design_scores_gemma":[0.000010179502,0.000045465138,0.00008218412,0.0000062231748,0.0000074224326,0.00005998457,0.000011781782,0.97805154,0.019040931,0.0023716395,0.0003057558,0.0000068320246],"about_ca_topic_score_codex":0.0012312176,"about_ca_topic_score_gemma":0.0011508453,"teacher_disagreement_score":0.0012312176,"about_ca_system_score_codex":0.0003031112,"about_ca_system_score_gemma":0.00079306186,"threshold_uncertainty_score":0.0025857687},"labels":[],"label_agreement":null},{"id":"W2107479212","doi":"10.1007/s10208-013-9161-0","title":"Restricted Normal Cones and Sparsity Optimization with Affine Constraints","year":2013,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Affine transformation; Convergence (economics); Heuristics; Underdetermined system; Regular polygon; Conic optimization; Mathematical optimization; Optimization problem; Convex optimization; Constraint (computer-aided design); Cone (formal languages); Applied mathematics; Algorithm; Convex analysis; Pure mathematics; Geometry","score_opus":0.011912643596671489,"score_gpt":0.21050952260356548,"score_spread":0.198596879006894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107479212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01003304,0.0016191757,0.9673978,0.0012599574,0.00023131582,0.000036305788,0.000270049,0.000093029455,0.019059308],"genre_scores_gemma":[0.48278657,0.007904038,0.45746914,0.0011249658,0.0019242814,0.00043943056,0.0015573031,0.00043434955,0.046360016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856526,0.0006471717,0.000056109162,0.00020941792,0.00044721394,0.00007486892],"domain_scores_gemma":[0.996983,0.0018964309,0.00031364892,0.00020571322,0.0004308808,0.00017036701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019915258,0.0016471392,0.0015029566,0.0013867075,0.00065190974,0.0030174658,0.0018866217,0.0014135917,0.0045853546],"category_scores_gemma":[0.008842263,0.00087001256,0.00085513643,0.0021039485,0.0035253947,0.0042580427,0.0026565178,0.0046481467,0.0006759334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026345191,0.000026840475,0.000107453176,0.000077566605,0.000015378082,0.000044946893,0.00004776302,0.050740883,0.0004217018,0.9345289,0.0030352022,0.010927123],"study_design_scores_gemma":[0.000011768118,0.000015674828,0.00006452381,0.000017178121,0.0000046486834,0.000034890338,0.000027279206,0.24450675,0.00016853331,0.7524709,0.0026637174,0.000014051966],"about_ca_topic_score_codex":0.0033231322,"about_ca_topic_score_gemma":0.0027895176,"teacher_disagreement_score":0.0045853546,"about_ca_system_score_codex":0.0009887961,"about_ca_system_score_gemma":0.0013472242,"threshold_uncertainty_score":0.015339553},"labels":[],"label_agreement":null},{"id":"W2109874386","doi":"10.1109/isspa.2012.6310502","title":"Minimum noiseless description length (MNDL) based regularization parameter selection","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Regularization (linguistics); Subspace topology; Estimation theory; Model selection; Selection (genetic algorithm); Algorithm; Computer science; Minimum description length; Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.02124612547258672,"score_gpt":0.21601147364098422,"score_spread":0.1947653481683975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109874386","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004827009,0.00011200329,0.99434245,0.000119686905,0.000014061783,0.000024964655,0.00005312675,0.00016007447,0.00034658128],"genre_scores_gemma":[0.14855672,0.00028432,0.848176,0.00026707433,0.00005217124,0.00020112857,0.0006491485,0.00016483215,0.0016486581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828523,0.0007683726,0.00012637643,0.00021323755,0.0005311703,0.00007568609],"domain_scores_gemma":[0.99728346,0.0016170571,0.00024757115,0.0003153582,0.00045908595,0.000077428296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024653266,0.00076005474,0.000995166,0.00089109235,0.00042003894,0.0008319047,0.0013783718,0.0011897518,0.0012501492],"category_scores_gemma":[0.008727891,0.0003605464,0.0005871732,0.00078016374,0.0007955465,0.0015513138,0.0015033201,0.0011571965,0.0006536302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036462335,0.00015081995,0.0021357553,0.00035852904,0.00011801189,0.0002040255,0.00015073181,0.54189765,0.028181331,0.0441935,0.0058422023,0.37640288],"study_design_scores_gemma":[0.0000149054995,0.00004024608,0.00017215776,0.000010233239,0.0000075701596,0.00005995647,0.000012065386,0.98720205,0.005722541,0.005699239,0.0010416762,0.000017364167],"about_ca_topic_score_codex":0.0015559953,"about_ca_topic_score_gemma":0.0022709344,"teacher_disagreement_score":0.0024653266,"about_ca_system_score_codex":0.0008288832,"about_ca_system_score_gemma":0.001611754,"threshold_uncertainty_score":0.013038039},"labels":[],"label_agreement":null},{"id":"W2110817419","doi":"10.1109/icassp.1997.604773","title":"Estimation of transfer function parameters with output Fourier transform sensitivity vectors","year":2002,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transfer function; Parametric statistics; Context (archaeology); Fourier transform; Mathematics; Nonlinear system; Covariance matrix; Estimation theory; Parameter space; Boundary (topology); Mathematical analysis; Function (biology); Algorithm; Computer science; Physics; Statistics","score_opus":0.017001796075863995,"score_gpt":0.1840318981181728,"score_spread":0.1670301020423088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110817419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061554504,0.00002310668,0.99334997,0.000035568355,0.0000047315684,0.0000109395,0.000018449731,0.00010782011,0.0002940429],"genre_scores_gemma":[0.3793122,0.00027156968,0.61770356,0.000072719144,0.000044756165,0.00014250744,0.00020064732,0.00009415098,0.0021579573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99964726,0.000095895026,0.000018691357,0.0000633338,0.00014706688,0.000027698481],"domain_scores_gemma":[0.99889094,0.0007021,0.00013475133,0.00014504766,0.00011290345,0.000014234157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008111889,0.0009275224,0.00050620147,0.00058474997,0.00025320344,0.00059066876,0.00041904926,0.000815067,0.0012451765],"category_scores_gemma":[0.005168557,0.000506256,0.0005993279,0.00034709062,0.0006681707,0.0011317132,0.0006987003,0.0009193823,0.00046382737],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012434156,0.00009062775,0.0013862436,0.00014708836,0.00007807811,0.00017088668,0.00017636133,0.6712486,0.067530364,0.038071956,0.00063783716,0.22033758],"study_design_scores_gemma":[0.000008919123,0.00004523409,0.0006373526,0.00001607262,0.000015140098,0.00010907495,0.000013544279,0.96258414,0.022643864,0.013094656,0.0008072301,0.000024750687],"about_ca_topic_score_codex":0.0011048191,"about_ca_topic_score_gemma":0.0010025477,"teacher_disagreement_score":0.0012451765,"about_ca_system_score_codex":0.0003511981,"about_ca_system_score_gemma":0.0005291712,"threshold_uncertainty_score":0.0042900443},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Computer science; Compressed sensing; Algorithm; Artificial intelligence; World Wide Web","score_opus":0.03576259163528422,"score_gpt":0.23016141952304084,"score_spread":0.19439882788775661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111394763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073810294,0.0004600843,0.92161924,0.0007803459,0.00004542634,0.000046035686,0.00019650033,0.00016564433,0.0028763597],"genre_scores_gemma":[0.8302518,0.0010343859,0.16208708,0.0002636738,0.00016474185,0.00016889807,0.001003124,0.00013708118,0.004889088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898344,0.00029749106,0.000055854234,0.00019122132,0.00036626455,0.00010570774],"domain_scores_gemma":[0.9938539,0.004381109,0.0007002568,0.00042488033,0.00050441,0.00013542408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020253535,0.001537423,0.0011474846,0.0006921643,0.00032707874,0.00097409583,0.0010962737,0.0016666251,0.0019040004],"category_scores_gemma":[0.016368655,0.0005745394,0.0007354523,0.0006272299,0.0017859897,0.002579552,0.0021106498,0.001407451,0.00054175773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010938898,0.000176847,0.0020302495,0.00074458704,0.0001792334,0.00058523956,0.00032595656,0.7203965,0.06273185,0.13203488,0.002467127,0.077233694],"study_design_scores_gemma":[0.00001954232,0.00008352745,0.00023771416,0.000026096106,0.0000119763245,0.000072411305,0.000025995309,0.9770362,0.008940342,0.013041672,0.00048610207,0.00001837532],"about_ca_topic_score_codex":0.0014018568,"about_ca_topic_score_gemma":0.00093697663,"teacher_disagreement_score":0.0020253535,"about_ca_system_score_codex":0.0004732905,"about_ca_system_score_gemma":0.000813422,"threshold_uncertainty_score":0.010711193},"labels":[],"label_agreement":null},{"id":"W2112299160","doi":"","title":"An FPGA-based face detector using neural network and a scalable floating point unit","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Field-programmable gate array; Floating point; Artificial neural network; Scalability; Reduction (mathematics); Floating-point unit; Arithmetic; Computer hardware; Fixed-point arithmetic; Arithmetic logic unit; IEEE floating point; Detector; Parallel computing; Algorithm; Mathematics; Artificial intelligence","score_opus":0.01922016410183285,"score_gpt":0.23159090028253598,"score_spread":0.21237073618070312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112299160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4035635,0.000660544,0.5816848,0.00038737786,0.0003638502,0.00021290508,0.00018127282,0.003042842,0.009902994],"genre_scores_gemma":[0.84481335,0.00012636489,0.1510137,0.000103203216,0.000023235863,0.00006227349,0.000094575254,0.000022319153,0.0037409344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997485,0.000037836893,0.000012442276,0.000048324575,0.00012562981,0.000027266771],"domain_scores_gemma":[0.9996363,0.00009354761,0.00003139333,0.00004713497,0.00017523977,0.000016432989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033129475,0.00032792677,0.0002936188,0.00037338465,0.0002161214,0.00033057603,0.000829673,0.00041064512,0.0020718055],"category_scores_gemma":[0.00067697867,0.00014470264,0.00015685354,0.00028193727,0.0001814567,0.0006004013,0.00018791456,0.0002916288,0.00031028996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012366608,0.0002805621,0.005116923,0.0003513199,0.00017724266,0.00067210465,0.0001333109,0.09044414,0.31287253,0.007284764,0.005420138,0.5760103],"study_design_scores_gemma":[0.00008134056,0.00079413847,0.0025535673,0.000033989636,0.00006491804,0.0003624987,0.000031284006,0.80067897,0.19007361,0.0006966619,0.0045909323,0.000038050177],"about_ca_topic_score_codex":0.003148681,"about_ca_topic_score_gemma":0.003912052,"teacher_disagreement_score":0.003148681,"about_ca_system_score_codex":0.0005287041,"about_ca_system_score_gemma":0.00042247528,"threshold_uncertainty_score":0.006930828},"labels":[],"label_agreement":null},{"id":"W2113303397","doi":"10.1109/pacrim.2011.6032870","title":"New algorithms for sparse representation of discrete signals based on &amp;#x2113;&lt;inf&gt;p&lt;/inf&gt;-&amp;#x2113;&lt;inf&gt;2&lt;/inf&gt; optimization","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Institute of Science and Technology Austria","keywords":"Algorithm; Representation (politics); Computer science; Minification; Solver; Monotone polygon; Relaxation (psychology); Artificial intelligence; Mathematics","score_opus":0.060337195166853985,"score_gpt":0.28038892593816095,"score_spread":0.22005173077130696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113303397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084977795,0.00015529015,0.9978288,0.00010250866,0.00003936942,0.000020595106,0.00003162363,0.0001124954,0.00085953786],"genre_scores_gemma":[0.03579168,0.0012664809,0.95455974,0.00023391543,0.00021206406,0.00021691131,0.0005268184,0.0001653257,0.007027069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901557,0.00024290259,0.000053044958,0.0001750533,0.00043848532,0.000074948206],"domain_scores_gemma":[0.9986797,0.0006671805,0.00015023357,0.00015946635,0.00029190604,0.000051438066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013416952,0.0012156669,0.0011400963,0.0012242175,0.00041177115,0.0013516273,0.0015333549,0.0012988168,0.004719041],"category_scores_gemma":[0.004318721,0.00061608665,0.0010584989,0.002022979,0.00093515724,0.00272498,0.0014982183,0.0026490844,0.002051377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016668835,0.00016444623,0.00036518121,0.00040575324,0.000097707016,0.00009853844,0.00016557043,0.3792546,0.011785131,0.1207299,0.012226873,0.47453952],"study_design_scores_gemma":[0.000025583024,0.00004940078,0.00009919038,0.00001995572,0.000010983977,0.00006578599,0.000021312397,0.97800225,0.0021567827,0.013156566,0.006380346,0.000011734832],"about_ca_topic_score_codex":0.0023411624,"about_ca_topic_score_gemma":0.0042104847,"teacher_disagreement_score":0.004719041,"about_ca_system_score_codex":0.0007204294,"about_ca_system_score_gemma":0.0014479182,"threshold_uncertainty_score":0.015786767},"labels":[],"label_agreement":null},{"id":"W2114727753","doi":"10.1109/sam.2008.4606867","title":"Compressed sensing of Gauss-Markov random field with wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Compressed sensing; Computer science; Fusion center; Markov process; Markov chain; Channel (broadcasting); Wireless; Algorithm; Sensor fusion; Encoder; A priori and a posteriori; Scalability; Statistical model; Artificial intelligence; Telecommunications; Mathematics; Computer network; Machine learning","score_opus":0.010129513634506373,"score_gpt":0.19331682713587303,"score_spread":0.18318731350136666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114727753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010469893,0.0004475578,0.98778474,0.00023700917,0.00004350484,0.000021669608,0.00003171477,0.0001114661,0.000852514],"genre_scores_gemma":[0.63622135,0.0015967021,0.35873124,0.00023048122,0.00031459736,0.00013999463,0.000192832,0.00003679923,0.0025360116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949086,0.00017936388,0.000019368363,0.00006450828,0.00020642334,0.000039442974],"domain_scores_gemma":[0.99918634,0.00052942603,0.000094961426,0.00009360115,0.000074946714,0.000020819989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073932175,0.00053758937,0.0005323163,0.00033298053,0.0001969678,0.00042630907,0.0007466805,0.0005004854,0.0006502858],"category_scores_gemma":[0.0024431415,0.0002415808,0.00034013332,0.00050341064,0.00068481296,0.0012161644,0.0008211084,0.0007820235,0.00017611026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019056274,0.00005597338,0.00051813916,0.00016515172,0.000049369915,0.00020199701,0.000094648094,0.7966189,0.011342992,0.08692446,0.0015038605,0.102334],"study_design_scores_gemma":[0.000009628081,0.000023354427,0.00005178936,0.0000059994118,0.0000047754274,0.000035961097,0.000005919685,0.98750967,0.0015125386,0.010231671,0.0006043681,0.0000043504815],"about_ca_topic_score_codex":0.0017187619,"about_ca_topic_score_gemma":0.0015033968,"teacher_disagreement_score":0.0017187619,"about_ca_system_score_codex":0.00037743026,"about_ca_system_score_gemma":0.00054770266,"threshold_uncertainty_score":0.0039099455},"labels":[],"label_agreement":null},{"id":"W2115488979","doi":"10.1109/wocn.2011.5872918","title":"Increasing the reliability of wireless sensor network with a new testing approach based on compressed sensing theory","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless sensor network; Compressed sensing; Key distribution in wireless sensor networks; Computer science; Reliability (semiconductor); Wireless; Wireless network; Wi-Fi array; Mobile wireless sensor network; Real-time computing; Computer network; Telecommunications; Artificial intelligence","score_opus":0.03417062721301328,"score_gpt":0.20014629832282693,"score_spread":0.16597567110981365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115488979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056447345,0.0017126327,0.9887644,0.0006302966,0.00014118377,0.00003995429,0.000031265197,0.00017712264,0.0028583691],"genre_scores_gemma":[0.47416523,0.0068450216,0.51298296,0.0005616288,0.0013518818,0.0002765988,0.00016183995,0.00013779878,0.0035170037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998431,0.00040184075,0.00008720203,0.0001984235,0.00081271504,0.0000687066],"domain_scores_gemma":[0.9973126,0.0016206105,0.00022583583,0.00029118746,0.0004758996,0.00007375634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011521319,0.0007259128,0.00079197215,0.001485936,0.0003756011,0.0007978779,0.0011611959,0.0008596411,0.0011340118],"category_scores_gemma":[0.004753801,0.0002649025,0.0007180342,0.0013318806,0.0019434599,0.0030819965,0.0012935294,0.001495409,0.0002376688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018620942,0.00012434335,0.0016987546,0.0007818344,0.00012685652,0.0004504827,0.00052294845,0.1602241,0.055964325,0.44495177,0.0058971546,0.32907125],"study_design_scores_gemma":[0.00004210867,0.0003728621,0.0007626812,0.00009199265,0.000065983,0.00075209246,0.00008949679,0.82959896,0.015640846,0.13867423,0.013833723,0.000075006494],"about_ca_topic_score_codex":0.00063242734,"about_ca_topic_score_gemma":0.00032820387,"teacher_disagreement_score":0.001485936,"about_ca_system_score_codex":0.00070655067,"about_ca_system_score_gemma":0.0005147419,"threshold_uncertainty_score":0.006093085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040395220358010415,"score_gpt":0.22166888502645446,"score_spread":0.18127366466844405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116616571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017110044,0.0006193087,0.9703078,0.002109628,0.00009957933,0.000063374995,0.0003365272,0.000076284035,0.009277417],"genre_scores_gemma":[0.40939167,0.0023964106,0.5488406,0.0010884306,0.0007916455,0.0009752117,0.0017372465,0.0005328671,0.03424605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984195,0.00084131525,0.000035911264,0.00027185702,0.00031669147,0.00011461681],"domain_scores_gemma":[0.9928531,0.0055036047,0.00046798322,0.0002950621,0.00052219996,0.00035807816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032771775,0.0013819832,0.0019266952,0.0012327806,0.0009968142,0.0022963602,0.0029682766,0.0031476754,0.0059034247],"category_scores_gemma":[0.015614402,0.001027201,0.00090085564,0.0019827131,0.003294548,0.0042207353,0.0028820867,0.004238251,0.000676272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009414746,0.000103964674,0.00035137637,0.00024502413,0.00004861136,0.000061910985,0.00012940215,0.2594862,0.0007522504,0.7115536,0.0075698188,0.019603709],"study_design_scores_gemma":[0.000018090614,0.000020195092,0.00012254884,0.000022788867,0.000006302221,0.000028807493,0.00004119814,0.6255973,0.00017814977,0.3724661,0.0014829572,0.000015644091],"about_ca_topic_score_codex":0.004527499,"about_ca_topic_score_gemma":0.0062854122,"teacher_disagreement_score":0.0059034247,"about_ca_system_score_codex":0.0023547458,"about_ca_system_score_gemma":0.0021624712,"threshold_uncertainty_score":0.019748926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01031610926605511,"score_gpt":0.23577735317481474,"score_spread":0.22546124390875963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119047398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088542444,0.00008914227,0.99849,0.00013242646,0.000009335932,0.000008157752,0.00001808972,0.000049857375,0.0003175343],"genre_scores_gemma":[0.19969164,0.0011012986,0.793806,0.000420733,0.00021050828,0.00032031038,0.00037709158,0.00021309007,0.0038592473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.0004638692,0.000033934273,0.00011012586,0.0003249937,0.000045763998],"domain_scores_gemma":[0.9974573,0.0016930238,0.00026453548,0.00024436944,0.00026947167,0.00007126601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018597824,0.00068477343,0.00089558284,0.0005879598,0.00031199591,0.000790948,0.0013892004,0.0013168838,0.0015359472],"category_scores_gemma":[0.007627701,0.00056427147,0.0007000623,0.00074460387,0.0012156293,0.0015288455,0.001179901,0.0020496468,0.000706476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006667073,0.000052017527,0.00048102185,0.00014732376,0.00004319324,0.0000803314,0.00007284241,0.7895442,0.0048721028,0.15324254,0.0027965258,0.048601247],"study_design_scores_gemma":[0.0000050045132,0.000011198525,0.00004286137,0.0000066120215,0.0000027954907,0.000027600558,0.0000027832964,0.98154473,0.00043810712,0.016998738,0.0009132782,0.000006411171],"about_ca_topic_score_codex":0.00208985,"about_ca_topic_score_gemma":0.0021872802,"teacher_disagreement_score":0.00208985,"about_ca_system_score_codex":0.00073800475,"about_ca_system_score_gemma":0.000939068,"threshold_uncertainty_score":0.009835601},"labels":[],"label_agreement":null},{"id":"W2119403778","doi":"10.4208/cicp.310811.090312a","title":"The Convex Relaxation Method on Deconvolution Model with Multiplicative Noise","year":2012,"lang":"en","type":"article","venue":"Communications in Computational Physics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Deblurring; Deconvolution; Relaxation (psychology); Regular polygon; Multiplicative noise; Convex optimization; Mathematical optimization; Convex analysis; Noise (video); Multiplicative function; Computer science; Applied mathematics; Mathematics; Algorithm; Mathematical analysis; Image restoration; Artificial intelligence; Image processing; Image (mathematics); Geometry","score_opus":0.055316865711938425,"score_gpt":0.3290506210491289,"score_spread":0.27373375533719047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119403778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002533329,0.000095786076,0.9963921,0.00012954762,0.0000131599945,0.000009412723,0.000013757034,0.000025167421,0.000787781],"genre_scores_gemma":[0.34402373,0.000920808,0.6443757,0.00031527283,0.00016704253,0.00023844615,0.0002358847,0.00020395516,0.009519199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942696,0.0003152296,0.000019464815,0.000080781734,0.000116162184,0.000041460004],"domain_scores_gemma":[0.9994161,0.00035677644,0.000055430148,0.000046418245,0.00009261757,0.00003278951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016502755,0.00096578297,0.0010741312,0.000540347,0.00029815055,0.0007626972,0.00136393,0.0013971645,0.0021443102],"category_scores_gemma":[0.0025732338,0.00052703265,0.0010343342,0.0005521007,0.0009966139,0.0015594246,0.0015496477,0.0019033236,0.00037483708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006602302,0.00004178197,0.00019583084,0.0001646663,0.000050765186,0.00012623945,0.00010755479,0.8623008,0.005913323,0.10131592,0.0016845609,0.028032476],"study_design_scores_gemma":[0.0000031051115,0.000008929626,0.000013051631,0.0000036371985,0.0000027062842,0.000011944331,0.0000036147696,0.99531794,0.00028351828,0.0040321774,0.00031644135,0.0000030662297],"about_ca_topic_score_codex":0.002722194,"about_ca_topic_score_gemma":0.0015241222,"teacher_disagreement_score":0.002722194,"about_ca_system_score_codex":0.0005598574,"about_ca_system_score_gemma":0.000936604,"threshold_uncertainty_score":0.00872761},"labels":[],"label_agreement":null},{"id":"W2119653241","doi":"10.1109/icassp.2011.5947205","title":"Improved model-based spectral compressive sensing via nested least squares","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Compressed sensing; Algorithm; Least-squares function approximation; SIGNAL (programming language); Signal reconstruction; Norm (philosophy); Signal-to-noise ratio (imaging); Computer science; Amplitude; Noise (video); Mean squared error; Mathematics; Signal processing; Statistics; Artificial intelligence; Physics; Telecommunications; Image (mathematics); Optics","score_opus":0.026187498571365507,"score_gpt":0.21183009095308347,"score_spread":0.18564259238171796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119653241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029059423,0.000053393636,0.9964987,0.000034333654,0.000012415085,0.0000075240705,0.00001268291,0.00011640852,0.0003584633],"genre_scores_gemma":[0.17961396,0.00019783455,0.8182256,0.00009660213,0.00004533203,0.000080656624,0.00018744198,0.0000846804,0.0014678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919397,0.00022462422,0.00002935269,0.00012022775,0.00039348408,0.000038464277],"domain_scores_gemma":[0.99933296,0.00029547446,0.00007804343,0.00013084356,0.00013404395,0.000028610673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077312515,0.00073432963,0.00094555423,0.0003916757,0.000263979,0.0004886243,0.0009766114,0.0007730798,0.0010979614],"category_scores_gemma":[0.002810113,0.0004457813,0.0006605781,0.00045715642,0.00057297706,0.0013884625,0.0013119509,0.0009368048,0.00048789082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001579532,0.00009793863,0.0005399295,0.00021868105,0.00007503846,0.0001304456,0.0002624633,0.70133644,0.046565365,0.03889057,0.0019661672,0.20975904],"study_design_scores_gemma":[0.0000056135555,0.000026984153,0.000046465524,0.0000042108873,0.000004067367,0.000043316788,0.0000047103517,0.9947791,0.001929948,0.0023638168,0.00078456546,0.0000072188104],"about_ca_topic_score_codex":0.0019254861,"about_ca_topic_score_gemma":0.0021052624,"teacher_disagreement_score":0.0019254861,"about_ca_system_score_codex":0.00031456118,"about_ca_system_score_gemma":0.00072461204,"threshold_uncertainty_score":0.0040887594},"labels":[],"label_agreement":null},{"id":"W2119692864","doi":"10.1109/itwnit.2009.5158580","title":"High dimensional Principal Component Analysis with contaminated data","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Principal component analysis; Subspace topology; Bounded function; Dimensionality reduction; Sparse PCA; Curse of dimensionality; Limit (mathematics); Algorithm; Mathematics; Computer science; Set (abstract data type); Clustering high-dimensional data; Robust principal component analysis; Data set; Mathematical optimization; Artificial intelligence; Cluster analysis","score_opus":0.01867229550763425,"score_gpt":0.2313065269151868,"score_spread":0.21263423140755255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119692864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00460948,0.00019969752,0.99434704,0.00021732517,0.000023733635,0.000016588465,0.000052824926,0.000056891102,0.0004763595],"genre_scores_gemma":[0.31606245,0.0021017846,0.677346,0.0002501886,0.00040662813,0.00025707076,0.00055421476,0.0000722923,0.0029494527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982241,0.000773753,0.000067875946,0.00033064027,0.0004961165,0.00010759109],"domain_scores_gemma":[0.99690115,0.0018849261,0.000306974,0.0005189841,0.00031695224,0.00007107075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021103283,0.0010828576,0.0012705651,0.0008678884,0.00052763027,0.0013295391,0.001463475,0.0016871915,0.0011541845],"category_scores_gemma":[0.009263517,0.0004659227,0.000828548,0.0020611521,0.002165726,0.0019976099,0.0018478455,0.002425153,0.0006036124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014334153,0.00008626873,0.0013514005,0.00028900857,0.0001317132,0.00047643413,0.00017421976,0.6736569,0.0065697334,0.24546322,0.0029186937,0.06873904],"study_design_scores_gemma":[0.000009978545,0.00003285766,0.00020669431,0.00001251763,0.000012097645,0.0000784693,0.000023619496,0.9164382,0.0014083517,0.08009549,0.0016654796,0.000016240456],"about_ca_topic_score_codex":0.0015949925,"about_ca_topic_score_gemma":0.00094058755,"teacher_disagreement_score":0.0021103283,"about_ca_system_score_codex":0.0005230328,"about_ca_system_score_gemma":0.0008240737,"threshold_uncertainty_score":0.011160612},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.034277973959265094,"score_gpt":0.2604920053561653,"score_spread":0.2262140313969002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119883478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005540718,0.00014187848,0.99352735,0.000120285826,0.000014349717,0.000018437795,0.00001880394,0.00010443251,0.0005136627],"genre_scores_gemma":[0.19246846,0.00030778884,0.8019136,0.0001576898,0.00007450572,0.00016305328,0.00018721735,0.00018194437,0.004545778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993293,0.0002588789,0.000028530027,0.00015700093,0.00017924992,0.000047023663],"domain_scores_gemma":[0.9985252,0.000857671,0.00020123551,0.00012351156,0.00024439156,0.000047971018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013082549,0.0009982398,0.0010529867,0.00059936754,0.00031143217,0.00062553264,0.0013012022,0.0014394596,0.0015672423],"category_scores_gemma":[0.0053887037,0.00053067185,0.0006215166,0.00065333594,0.0010967755,0.0013447809,0.0011442809,0.0019374507,0.0006463893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012623466,0.000068677175,0.0005775777,0.00017344939,0.00007852962,0.0001422742,0.00016169666,0.858668,0.017244156,0.0351741,0.0022439791,0.08534122],"study_design_scores_gemma":[0.000003305592,0.000013266525,0.00003660508,0.000006085942,0.0000021159822,0.000012609642,0.0000044700782,0.9954699,0.0011265599,0.0030158458,0.00030542765,0.0000037987595],"about_ca_topic_score_codex":0.0032564928,"about_ca_topic_score_gemma":0.0022588703,"teacher_disagreement_score":0.0032564928,"about_ca_system_score_codex":0.00070335885,"about_ca_system_score_gemma":0.001201224,"threshold_uncertainty_score":0.0069187284},"labels":[],"label_agreement":null},{"id":"W2120662221","doi":"10.1109/iembs.2006.260696","title":"Optimal Window Length in the Windowed Adaptive Chirplet Analysis of Visual Evoked Potentials","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Window (computing); Computer science; Speech recognition; Artificial intelligence; Evoked potential; Computer vision; Pattern recognition (psychology); Psychology; Neuroscience","score_opus":0.009972654868515732,"score_gpt":0.23234854608016875,"score_spread":0.22237589121165302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120662221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21604072,0.0014352276,0.78109115,0.00019111461,0.00004841466,0.000058190857,0.00010119044,0.00022450295,0.00080955407],"genre_scores_gemma":[0.54396915,0.0010372449,0.45392224,0.000066879096,0.0000687227,0.00011834175,0.00015945078,0.00009445596,0.00056360645],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996972,0.00010998597,0.000032904816,0.00006860111,0.00006217355,0.000029110159],"domain_scores_gemma":[0.9984665,0.0009965157,0.000150123,0.00012914363,0.00018693697,0.00007080267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009804995,0.0004057656,0.0003924417,0.00032054173,0.00019700686,0.0004232353,0.0003223102,0.00042298783,0.00046310632],"category_scores_gemma":[0.0050506783,0.0002666095,0.00017848052,0.00032972934,0.00036554364,0.0010475048,0.0004313541,0.00047470382,0.00022376642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028305524,0.00021522454,0.0037647737,0.00040470692,0.000059368336,0.0003379604,0.0003362879,0.0579419,0.5447052,0.013151497,0.0009517083,0.37530085],"study_design_scores_gemma":[0.00019479959,0.0012080057,0.011496488,0.00017159997,0.00016402159,0.00075500493,0.00020247282,0.6552364,0.3103283,0.01454871,0.0055584586,0.00013567375],"about_ca_topic_score_codex":0.0002642512,"about_ca_topic_score_gemma":0.0005020531,"teacher_disagreement_score":0.0009804995,"about_ca_system_score_codex":0.00017527565,"about_ca_system_score_gemma":0.00029729106,"threshold_uncertainty_score":0.0051854253},"labels":[],"label_agreement":null},{"id":"W2120785704","doi":"10.1109/icassp.2012.6288515","title":"Graph spectral compressed sensing for sensor networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Wireless sensor network; Computer science; Compressed sensing; Graph; Bandwidth (computing); Latency (audio); Network topology; Spectral graph theory; Algorithm; Real-time computing; Topology (electrical circuits); Theoretical computer science; Computer network; Mathematics; Telecommunications","score_opus":0.020014499167842974,"score_gpt":0.2315179959364258,"score_spread":0.21150349676858282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120785704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011439974,0.0014508865,0.98255414,0.0011011745,0.00012410463,0.000040658728,0.00017276622,0.00020111978,0.0029151102],"genre_scores_gemma":[0.62660384,0.0052901777,0.362736,0.00051161443,0.0004882292,0.0002215338,0.0006173944,0.000084647465,0.0034466214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958676,0.00015441024,0.000013807436,0.00006066454,0.00015630163,0.000027977409],"domain_scores_gemma":[0.99913615,0.0005817314,0.000073956406,0.00007887445,0.000099490666,0.000029905552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044959266,0.00061234355,0.0005063199,0.0006122178,0.00028439699,0.00064486766,0.00064940756,0.0007161468,0.001268716],"category_scores_gemma":[0.0029609897,0.00017405357,0.00025897622,0.001115664,0.00088070356,0.0011954381,0.000719365,0.0009676758,0.00024422488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013995855,0.000051496907,0.0004329012,0.0003411669,0.000039743285,0.00020487269,0.000126216,0.6972438,0.007043302,0.18409833,0.005552379,0.10472584],"study_design_scores_gemma":[0.000010394765,0.000022170232,0.000094559386,0.000013725396,0.000004618715,0.000046688623,0.000027955113,0.9160145,0.00077908003,0.08109291,0.0018861014,0.0000074014856],"about_ca_topic_score_codex":0.002359216,"about_ca_topic_score_gemma":0.0019147313,"teacher_disagreement_score":0.002359216,"about_ca_system_score_codex":0.0005974851,"about_ca_system_score_gemma":0.00050095934,"threshold_uncertainty_score":0.004690945},"labels":[],"label_agreement":null},{"id":"W2121133091","doi":"","title":"Accelerated Training for Matrix-norm Regularization: A Boosting Approach","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Boosting (machine learning); Computer science; Mathematical optimization; Oracle; Matrix norm; Regularization (linguistics); Norm (philosophy); Sparse matrix; Artificial intelligence; Algorithm; Machine learning; Mathematics; Gaussian","score_opus":0.09027443290588827,"score_gpt":0.2853606580663344,"score_spread":0.19508622516044616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121133091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020461022,0.00012782871,0.99699247,0.00008375954,0.000022397813,0.000017541759,0.0000102937465,0.00022610766,0.00047349115],"genre_scores_gemma":[0.23472416,0.00047089127,0.76049197,0.00030673432,0.0002547235,0.0001656119,0.00018503697,0.0002560879,0.0031448188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986854,0.000557278,0.000042073632,0.00015274907,0.00046177415,0.00010076369],"domain_scores_gemma":[0.9977544,0.0009729153,0.00016185854,0.0004399341,0.0005395722,0.00013142226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026941204,0.0010817853,0.0016923501,0.00064161356,0.0004171034,0.0007358389,0.001919761,0.001564102,0.002818407],"category_scores_gemma":[0.006384799,0.0005993913,0.00067274703,0.00081168604,0.0010123661,0.0013731518,0.0018330844,0.002611203,0.0015910267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026062774,0.00022478361,0.00093243725,0.00019232117,0.00011395358,0.000104468905,0.00010004321,0.59319913,0.02244379,0.06804843,0.0077711367,0.3066089],"study_design_scores_gemma":[0.0000074619643,0.000032362794,0.00004869275,0.000004326907,0.0000041646945,0.000022395747,0.000002184921,0.9922983,0.0013404926,0.005393524,0.0008416908,0.0000044089834],"about_ca_topic_score_codex":0.0007932312,"about_ca_topic_score_gemma":0.00094339764,"teacher_disagreement_score":0.002818407,"about_ca_system_score_codex":0.00049934577,"about_ca_system_score_gemma":0.00073507713,"threshold_uncertainty_score":0.0142480135},"labels":[],"label_agreement":null},{"id":"W2122508088","doi":"10.1109/icdm.2010.162","title":"Compressed Nonnegative Sparse Coding","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Nuclear Safety Commission; National Science Council; National Science Foundation","keywords":"Neural coding; Random projection; Computer science; Coding (social sciences); Artificial intelligence; Pattern recognition (psychology); Sparse approximation; Compressed sensing; K-SVD; Sparse matrix; Projection (relational algebra); Algorithm; Mathematics","score_opus":0.012203635369344825,"score_gpt":0.21861811199858222,"score_spread":0.2064144766292374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122508088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006107393,0.00037728692,0.9893087,0.000402194,0.00016067055,0.00004336117,0.00018816456,0.00017721725,0.0032349837],"genre_scores_gemma":[0.36487275,0.0019392968,0.62280226,0.00073828996,0.00053529826,0.00025029152,0.0014263747,0.00011910085,0.007316391],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.00022374731,0.000028461583,0.000087469256,0.00027618988,0.000053602496],"domain_scores_gemma":[0.99911696,0.00035434874,0.0000926964,0.0001755124,0.0002219402,0.00003864205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005783833,0.00054191373,0.00058657693,0.0005811636,0.0002625778,0.00060835126,0.00078091427,0.0006788756,0.0022827575],"category_scores_gemma":[0.0036843051,0.00014921391,0.00032392464,0.0011630063,0.00072596467,0.001082279,0.000988862,0.0009446007,0.0004590857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027425057,0.00008130601,0.00049080426,0.00037165562,0.000043084423,0.00039442026,0.000108000466,0.1758478,0.03709777,0.27277723,0.019473085,0.49304068],"study_design_scores_gemma":[0.000028907125,0.00007980897,0.0002541253,0.00003659176,0.000013638855,0.00029796493,0.00002956714,0.9159094,0.007510881,0.064451925,0.011357013,0.000030119545],"about_ca_topic_score_codex":0.0016456916,"about_ca_topic_score_gemma":0.0018776719,"teacher_disagreement_score":0.0022827575,"about_ca_system_score_codex":0.00030844862,"about_ca_system_score_gemma":0.00069407164,"threshold_uncertainty_score":0.0076366067},"labels":[],"label_agreement":null},{"id":"W2122716017","doi":"10.1109/icassp.2012.6288745","title":"Smoothed &amp;#x2113;&lt;inf&gt;p&lt;/inf&gt;-&amp;#x2113;&lt;inf&gt;2&lt;/inf&gt; solvers for signal denoising","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Algorithm; Minification; Computer science; Artificial intelligence; World Wide Web","score_opus":0.03262776263032407,"score_gpt":0.2558016763091429,"score_spread":0.22317391367881884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122716017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009873883,0.0005199767,0.9570421,0.0010868395,0.00027957358,0.000083739076,0.00077147916,0.003463688,0.03576521],"genre_scores_gemma":[0.037960075,0.0021325038,0.80195546,0.0011103028,0.00039733297,0.00050186156,0.0037746667,0.006563458,0.14560433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871373,0.00031050833,0.00008538246,0.0002607128,0.0005127144,0.00011703077],"domain_scores_gemma":[0.99848783,0.0005954287,0.00011568198,0.0003140046,0.00041005548,0.000077017976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016121201,0.0021674559,0.001158633,0.0010468499,0.0009980177,0.0032538646,0.00225097,0.0031355629,0.11553039],"category_scores_gemma":[0.004555906,0.0009868715,0.0013537233,0.0019852642,0.0014147601,0.002734378,0.0036322607,0.0042616995,0.07257946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023093932,0.0001254366,0.0004995347,0.000784529,0.000080137455,0.0004933862,0.00030732458,0.10508596,0.020058949,0.21165475,0.20738858,0.45329046],"study_design_scores_gemma":[0.000068800975,0.00005884174,0.00026603354,0.0001388374,0.000023833987,0.00032115701,0.000086966524,0.69252306,0.016764844,0.07037298,0.21932504,0.00004964394],"about_ca_topic_score_codex":0.005470932,"about_ca_topic_score_gemma":0.0089589255,"teacher_disagreement_score":0.11553039,"about_ca_system_score_codex":0.0014104915,"about_ca_system_score_gemma":0.0025542292,"threshold_uncertainty_score":0.38648766},"labels":[],"label_agreement":null},{"id":"W2124319884","doi":"10.1109/icassp.2014.6854438","title":"Compressive sensing of ECG signals based on mixed pseudonorm of the first- and second-order differences","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Algorithm; SIGNAL (programming language); Compression ratio; Signal reconstruction; Signal-to-noise ratio (imaging); Computer science; Compression (physics); Minification; Noise (video); Hilbert transform; Signal processing; Pattern recognition (psychology); Mathematics; Artificial intelligence; Telecommunications; Engineering; Materials science; Image (mathematics)","score_opus":0.01030792729882765,"score_gpt":0.19086405639880058,"score_spread":0.18055612909997293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124319884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009415943,0.00023295726,0.9893993,0.0001214453,0.00004780189,0.00002708044,0.000021551343,0.00010653464,0.0006273058],"genre_scores_gemma":[0.18092108,0.0005038043,0.8164527,0.00013254657,0.00012685033,0.00010994389,0.00015221401,0.000037593632,0.0015632862],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928904,0.00021493968,0.000036747406,0.000069535374,0.0003582504,0.00003155237],"domain_scores_gemma":[0.99925643,0.00040304472,0.00007617355,0.00008927154,0.00014864274,0.000026456653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000788477,0.00061555894,0.00055960426,0.00045870055,0.00022406936,0.0005265978,0.00068449846,0.0006657236,0.0006543642],"category_scores_gemma":[0.0023445194,0.00020280761,0.00043809338,0.0005835671,0.00052471115,0.00089241704,0.0007461175,0.00089219084,0.000233255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046109865,0.00015302947,0.0011588162,0.00030482342,0.00011366926,0.00020843965,0.00017622522,0.28367838,0.121821105,0.051131893,0.0028086673,0.53798383],"study_design_scores_gemma":[0.000022140846,0.00020171404,0.00039298245,0.00001371637,0.0000111852,0.00026908072,0.00001239069,0.97633386,0.01707718,0.0035327193,0.0021119993,0.000020986874],"about_ca_topic_score_codex":0.0007113473,"about_ca_topic_score_gemma":0.001207537,"teacher_disagreement_score":0.000788477,"about_ca_system_score_codex":0.0002451249,"about_ca_system_score_gemma":0.0005371466,"threshold_uncertainty_score":0.004169941},"labels":[],"label_agreement":null},{"id":"W2124731380","doi":"10.1109/icassp.2013.6637932","title":"View interpolation confidence-aided compressed sensing of multiview images","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Artificial intelligence; Computer vision; Computer science; Interpolation (computer graphics); Pixel; Iterative reconstruction; Compressed sensing; Frame (networking); Flexibility (engineering); Image (mathematics); Mathematics","score_opus":0.01587140310155606,"score_gpt":0.23060867759815087,"score_spread":0.2147372744965948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124731380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01870842,0.00025124734,0.98019385,0.00007898417,0.000023103412,0.000012781812,0.00003216051,0.00009765473,0.00060179544],"genre_scores_gemma":[0.718771,0.00043756454,0.27912158,0.00009723447,0.00012132919,0.000042819684,0.00016702266,0.000043773172,0.0011976613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993118,0.00016853133,0.000029122866,0.00011345433,0.00032438457,0.000052811756],"domain_scores_gemma":[0.99880695,0.00062913925,0.00020355942,0.00012834845,0.00019398988,0.000037970454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533591,0.0006244156,0.00072954193,0.000519051,0.000202596,0.0006053417,0.0009198691,0.00067498384,0.00083412527],"category_scores_gemma":[0.0029460576,0.00029377447,0.0004758248,0.0006230848,0.0005057202,0.0010378715,0.0010785316,0.00086248363,0.00016217612],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007127728,0.00008656989,0.0014667289,0.00028828657,0.0001077015,0.00034132204,0.00021043075,0.6891024,0.047346767,0.023832666,0.0015237727,0.23498046],"study_design_scores_gemma":[0.000012024903,0.00005856864,0.00017860578,0.000006285844,0.000013548178,0.000105482184,0.00001109884,0.9909174,0.0062699104,0.0020186247,0.00039622758,0.000012259198],"about_ca_topic_score_codex":0.001398599,"about_ca_topic_score_gemma":0.001221702,"teacher_disagreement_score":0.001398599,"about_ca_system_score_codex":0.00034140958,"about_ca_system_score_gemma":0.00044181565,"threshold_uncertainty_score":0.0045130253},"labels":[],"label_agreement":null},{"id":"W2125260254","doi":"10.1109/asru.2007.4430130","title":"A compact semidefinite programming (SDP) formulation for large margin estimation of HMMS in speech recognition","year":2007,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Semidefinite programming; Computer science; Margin (machine learning); Gaussian; Optimization problem; Mathematical optimization; Pattern recognition (psychology); Variable (mathematics); Feature vector; Mixture model; Algorithm; Mathematics; Artificial intelligence; Machine learning","score_opus":0.03128455180349903,"score_gpt":0.2838439221880888,"score_spread":0.25255937038458975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125260254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012596322,0.00006429842,0.99807954,0.00011811874,0.000014118779,0.000013795322,0.000021512355,0.000057233272,0.0003717987],"genre_scores_gemma":[0.17751728,0.00048236063,0.81655884,0.0003533016,0.00016146706,0.00041076948,0.00037059412,0.00021627914,0.003929085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.00050305144,0.000041259595,0.00017518972,0.00015235037,0.000039481325],"domain_scores_gemma":[0.99592626,0.0034488929,0.00014175009,0.00016109394,0.00026642604,0.00005562312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018571685,0.00117458,0.0009634413,0.0002906368,0.0003180811,0.00079773384,0.000897947,0.0011508343,0.0036558458],"category_scores_gemma":[0.0056867916,0.0006772904,0.0006123722,0.0005080214,0.0010044704,0.0018006115,0.0010176029,0.0023071112,0.00069360674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006445276,0.00010301192,0.00027258828,0.00021829428,0.00003844761,0.00010858934,0.00009098098,0.8754624,0.0038210005,0.04345641,0.004099286,0.07226459],"study_design_scores_gemma":[0.000004923375,0.000014671341,0.000019672905,0.000003822608,0.0000019198087,0.0000107597325,0.0000046157056,0.9937211,0.0003765509,0.0055045844,0.00033408366,0.0000032755672],"about_ca_topic_score_codex":0.0014943364,"about_ca_topic_score_gemma":0.002065531,"teacher_disagreement_score":0.0036558458,"about_ca_system_score_codex":0.0005426487,"about_ca_system_score_gemma":0.0007889971,"threshold_uncertainty_score":0.012230039},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University; University of Missouri; National Science Foundation","keywords":"Mathematics","score_opus":0.10565713049889985,"score_gpt":0.392955741318173,"score_spread":0.28729861081927316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125889434","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005155079,0.0008968164,0.9378729,0.0043069874,0.0005015194,0.00008247977,0.00046541844,0.00023734324,0.050481442],"genre_scores_gemma":[0.2671678,0.0032921836,0.6509039,0.0054830783,0.0018916059,0.0007966644,0.001508993,0.00078846124,0.068167344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978326,0.0005458519,0.00011014188,0.0007494911,0.00055886246,0.00020308583],"domain_scores_gemma":[0.9950942,0.0019244583,0.00038230015,0.0012079502,0.0010288061,0.00036231882],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022539697,0.0014306246,0.0011582617,0.0022261452,0.0018486389,0.004015059,0.0030219923,0.0029224772,0.022614652],"category_scores_gemma":[0.011931184,0.00076862355,0.002145839,0.0014691135,0.003694055,0.0072076274,0.0055304263,0.00439844,0.0062964596],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012886266,0.000017810897,0.00038069906,0.00005651726,0.000013233562,0.00006759826,0.00012294443,0.006268474,0.0005780243,0.9750215,0.0035119753,0.01394838],"study_design_scores_gemma":[0.000009966159,0.000041681273,0.00029454293,0.00007007533,0.00001739935,0.00023037792,0.00011306603,0.07051992,0.0011601703,0.8653852,0.06212777,0.00002980034],"about_ca_topic_score_codex":0.0026627774,"about_ca_topic_score_gemma":0.0024158452,"teacher_disagreement_score":0.97738534,"about_ca_system_score_codex":0.0025653143,"about_ca_system_score_gemma":0.0019150722,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2126009392","doi":"","title":"Hierarchical Eigensolver for Transition Matrices in Spectral Methods","year":2004,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Representation (politics); Eigenvalues and eigenvectors; Rank (graph theory); Sparse approximation; Computer science; Hierarchy; MATLAB; Sparse matrix; Matrix (chemical analysis); Algorithm; Mathematics; Computational chemistry; Combinatorics","score_opus":0.021037520611340968,"score_gpt":0.3041453919956044,"score_spread":0.28310787138426347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126009392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013829988,0.000024035355,0.9975357,0.00003979822,0.000009817718,0.000020167794,0.000023956245,0.0002857198,0.0006778847],"genre_scores_gemma":[0.08755851,0.00009790562,0.9091349,0.00008096938,0.000026734298,0.00024857954,0.00016134858,0.00036460033,0.0023263819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.00015487387,0.00002039668,0.00004915438,0.00024320248,0.000040512026],"domain_scores_gemma":[0.999271,0.00034149224,0.00006631651,0.00012932264,0.00015505079,0.000036809877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072956557,0.00074083457,0.00048752403,0.0005552467,0.0004917917,0.0006797697,0.0009731737,0.0008630974,0.006243998],"category_scores_gemma":[0.0027194046,0.00035409303,0.00057600037,0.0005445399,0.0008140831,0.0009945513,0.0012358039,0.0015106135,0.0022918056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006120113,0.00008191412,0.00032844767,0.0001514338,0.000025789388,0.00008358018,0.00015497794,0.7075637,0.012435537,0.15911932,0.0049674213,0.115026586],"study_design_scores_gemma":[0.0000061399815,0.000012316057,0.000023769544,0.0000055145565,0.000001634005,0.000012624005,0.000009717137,0.9782015,0.0015980285,0.018353125,0.0017710413,0.000004673636],"about_ca_topic_score_codex":0.0020571474,"about_ca_topic_score_gemma":0.0031198808,"teacher_disagreement_score":0.006243998,"about_ca_system_score_codex":0.00055979413,"about_ca_system_score_gemma":0.0010010998,"threshold_uncertainty_score":0.020888269},"labels":[],"label_agreement":null},{"id":"W2126833874","doi":"10.1109/ssp.2007.4301292","title":"Compressed Network Monitoring","year":2007,"lang":"en","type":"article","venue":"2007 IEEE/SP 14th Workshop on Statistical Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Metric (unit); Exploit; Path (computing); Wavelet; Compressed sensing; Algorithm; Routing (electronic design automation); Set (abstract data type); Basis (linear algebra); Network monitoring; Real-time computing; Data mining; Mathematics; Artificial intelligence; Computer network","score_opus":0.02825340884641831,"score_gpt":0.29022574400761975,"score_spread":0.26197233516120144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126833874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016082885,0.00038900893,0.9785418,0.00035505468,0.00010164264,0.00008718182,0.00035734355,0.00063720386,0.0034480128],"genre_scores_gemma":[0.41290915,0.0009642341,0.57995087,0.00030008017,0.00028584054,0.0002428639,0.0013753622,0.00013904388,0.0038325351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.00016299529,0.00003270022,0.00014364845,0.00043181732,0.000051327497],"domain_scores_gemma":[0.9988475,0.00045861563,0.0001698591,0.00029275418,0.00019898446,0.00003218406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055486214,0.0006282081,0.00057684176,0.00087578857,0.0003925283,0.00073610997,0.0008952116,0.00064802513,0.001928374],"category_scores_gemma":[0.0036404617,0.00024621194,0.00030133198,0.00092137,0.00048024088,0.001637171,0.0011842597,0.0010285813,0.0004158871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006159681,0.00013311008,0.0029214597,0.00035479438,0.000082399194,0.0003582099,0.0003323127,0.21907397,0.079444885,0.050991654,0.009183532,0.6365077],"study_design_scores_gemma":[0.000029640858,0.000107261054,0.001536128,0.000040248335,0.00002187755,0.00048815456,0.000065786335,0.9387061,0.029342633,0.019298062,0.0103340205,0.000030139407],"about_ca_topic_score_codex":0.0012299072,"about_ca_topic_score_gemma":0.00131665,"teacher_disagreement_score":0.001928374,"about_ca_system_score_codex":0.00047125792,"about_ca_system_score_gemma":0.0006286747,"threshold_uncertainty_score":0.0064510107},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; 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","score_opus":0.012850320717291912,"score_gpt":0.22059973371260508,"score_spread":0.20774941299531316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127300249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012191643,0.00046879347,0.9848579,0.00070623367,0.000033771707,0.000042079504,0.0001341888,0.00023514891,0.0013301363],"genre_scores_gemma":[0.5664553,0.0014327955,0.42540765,0.0009739088,0.00025920745,0.00065884995,0.00089151744,0.00039784674,0.0035229544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596125,0.0016176384,0.00023614889,0.0007769157,0.0010619775,0.00034602865],"domain_scores_gemma":[0.9794881,0.015795331,0.0018842682,0.0009654805,0.0013092923,0.00055769394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008289787,0.0016784327,0.0024401487,0.0011390949,0.0006598149,0.0020492168,0.002282837,0.0026602168,0.002927066],"category_scores_gemma":[0.043438613,0.0010518563,0.0011214985,0.0011749297,0.003873799,0.004397609,0.004306234,0.004105456,0.0006585838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007218246,0.00016841119,0.0018343198,0.0008353046,0.00017073128,0.0005485772,0.0005198818,0.6609396,0.015235453,0.24497549,0.006453958,0.0675965],"study_design_scores_gemma":[0.000027697983,0.00007559649,0.00036091506,0.000050565915,0.000011284815,0.00006030039,0.000035443158,0.9337121,0.001795932,0.06325095,0.0005934231,0.000025817088],"about_ca_topic_score_codex":0.002034457,"about_ca_topic_score_gemma":0.0013540122,"teacher_disagreement_score":0.008289787,"about_ca_system_score_codex":0.0013835666,"about_ca_system_score_gemma":0.002228765,"threshold_uncertainty_score":0.043841064},"labels":[],"label_agreement":null},{"id":"W2127771846","doi":"10.1007/s10208-015-9256-x","title":"A Quadratically Convergent Algorithm for Structured Low-Rank Approximation","year":2015,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Rank (graph theory); Quadratic growth; Low-rank approximation; Matrix (chemical analysis); Applied mathematics; Algorithm; Combinatorics; Hankel matrix; Mathematical analysis","score_opus":0.03189418823480892,"score_gpt":0.2781377065146248,"score_spread":0.24624351827981592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127771846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011099752,0.00006049509,0.99778193,0.00008516844,0.000051811843,0.00002131901,0.000022832994,0.00012492498,0.0007415776],"genre_scores_gemma":[0.04502371,0.00017500218,0.9488373,0.00017904275,0.00012009694,0.00016657422,0.00022934338,0.00014203716,0.005126751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882835,0.00026310422,0.000054775126,0.00016195334,0.00062383374,0.000068021334],"domain_scores_gemma":[0.9979182,0.0009593256,0.00009293532,0.00028236414,0.00063306576,0.00011414561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001735963,0.0010203725,0.0011680523,0.00066794123,0.0005198714,0.0011651664,0.0018769366,0.0018495243,0.0052048946],"category_scores_gemma":[0.0078086443,0.00054515735,0.0006397113,0.0009280589,0.0010820698,0.0015895095,0.0025220588,0.0032478648,0.0029556719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045370858,0.000277019,0.00039453068,0.00035947788,0.00008738062,0.00019471321,0.00024592073,0.38979334,0.026040575,0.12559628,0.014570943,0.44198605],"study_design_scores_gemma":[0.000030772444,0.0000654906,0.000041048104,0.000011735304,0.000005690972,0.000054846303,0.000012448045,0.981832,0.0018287534,0.013732462,0.0023725021,0.000012250569],"about_ca_topic_score_codex":0.0017445997,"about_ca_topic_score_gemma":0.0026247855,"teacher_disagreement_score":0.0052048946,"about_ca_system_score_codex":0.00055808167,"about_ca_system_score_gemma":0.0016721141,"threshold_uncertainty_score":0.017412066},"labels":[],"label_agreement":null},{"id":"W2128276860","doi":"10.1002/cpe.3492","title":"Sparse support vector machine for pattern recognition","year":2015,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Support vector machine; Pattern recognition (psychology); Outlier; Artificial intelligence; Computer science; Sparse approximation; Norm (philosophy); Ranking SVM; Structured support vector machine; Representation (politics); Machine learning","score_opus":0.07136342235487081,"score_gpt":0.32623165268705695,"score_spread":0.25486823033218614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128276860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031261859,0.008980952,0.9794796,0.0014439313,0.0003778292,0.000075706565,0.00049303315,0.001747007,0.004275729],"genre_scores_gemma":[0.26098204,0.015849171,0.7023733,0.00084139104,0.0018843281,0.00045022715,0.0032571298,0.00029294117,0.014069452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985441,0.0004351377,0.00012604927,0.00032084616,0.00050593296,0.00006802714],"domain_scores_gemma":[0.99794716,0.0009785577,0.00023280982,0.00030052217,0.00048694827,0.000054064873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250001,0.00087344804,0.0011621164,0.0016260791,0.00027154112,0.0015483585,0.0010672377,0.0012139353,0.0076017464],"category_scores_gemma":[0.0062679597,0.00026688696,0.00073773885,0.0027562748,0.00073927204,0.0013051964,0.000985844,0.0018650416,0.004774749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096226504,0.00005718968,0.0009339513,0.0006907086,0.00011960208,0.00018138377,0.00007957709,0.073567174,0.0065455404,0.059563972,0.030942941,0.8272217],"study_design_scores_gemma":[0.000015514785,0.00007576016,0.0007806008,0.00014879604,0.000030818894,0.00020902678,0.00004905931,0.837152,0.003066973,0.11003375,0.048398342,0.00003945633],"about_ca_topic_score_codex":0.0014177117,"about_ca_topic_score_gemma":0.00087601086,"teacher_disagreement_score":0.0076017464,"about_ca_system_score_codex":0.00053649035,"about_ca_system_score_gemma":0.0006898939,"threshold_uncertainty_score":0.025430322},"labels":[],"label_agreement":null},{"id":"W2128692736","doi":"10.1016/j.image.2012.09.003","title":"Image reconstruction with locally adaptive sparsity and nonlocal robust regularization","year":2012,"lang":"en","type":"article","venue":"Signal Processing Image Communication","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Deblurring; Sparse approximation; Regularization (linguistics); Compressed sensing; Iterative reconstruction; Robustness (evolution); Artificial intelligence; Inverse problem; Computer science; Pattern recognition (psychology); Mathematics; Minification; Image resolution; Image (mathematics); Algorithm; Image restoration; Image processing; Mathematical optimization","score_opus":0.019121937532770847,"score_gpt":0.21595377846971103,"score_spread":0.19683184093694017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128692736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005465243,0.00020515273,0.99283665,0.00022376516,0.000033477456,0.0000098306455,0.000017868371,0.000057026253,0.0011509956],"genre_scores_gemma":[0.28844273,0.0011460361,0.7009706,0.0003108819,0.00033380967,0.000110347144,0.00019615024,0.00018023961,0.008309295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994215,0.00023432987,0.000026668482,0.00009326742,0.00019920574,0.000025010277],"domain_scores_gemma":[0.99898726,0.000503365,0.00015543604,0.00018201332,0.00013509823,0.0000369375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009976522,0.0006790681,0.0007659803,0.0006275564,0.00019514331,0.00080488273,0.0008642438,0.0013935991,0.0012074652],"category_scores_gemma":[0.003821304,0.00044221804,0.00058037264,0.0007194898,0.0013266836,0.0018137092,0.001332586,0.0013813929,0.00034387142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048675065,0.00013472016,0.0006178769,0.0004097689,0.00016322975,0.0003400954,0.00026520996,0.3493348,0.074901104,0.41042814,0.005539477,0.15737882],"study_design_scores_gemma":[0.000015289774,0.000031435295,0.00010966869,0.000008168073,0.000011823724,0.000113711496,0.000013855854,0.95176303,0.005360676,0.04142133,0.0011323475,0.000018603652],"about_ca_topic_score_codex":0.0006078378,"about_ca_topic_score_gemma":0.00079308497,"teacher_disagreement_score":0.0013935991,"about_ca_system_score_codex":0.00030911042,"about_ca_system_score_gemma":0.00037068382,"threshold_uncertainty_score":0.0052761436},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01448241195974086,"score_gpt":0.20520698678331692,"score_spread":0.19072457482357605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129809168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067817695,0.00080835214,0.98054725,0.00044415065,0.0001765217,0.000028449165,0.000093065566,0.0005039682,0.010616539],"genre_scores_gemma":[0.42468217,0.0035314886,0.51296055,0.00043685985,0.00060229993,0.00013851676,0.0008521994,0.0004647897,0.056331053],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994856,0.000119968674,0.000024433624,0.00011891072,0.00021023658,0.00004084392],"domain_scores_gemma":[0.999178,0.00019860128,0.00009200381,0.00024843565,0.00022926788,0.00005375663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060630596,0.0006743788,0.0010363484,0.00089659076,0.00043929927,0.0016446358,0.0005751221,0.0010879947,0.0056941323],"category_scores_gemma":[0.0032185041,0.0003552103,0.00050166796,0.0013441971,0.0008035605,0.0016159575,0.0017390085,0.0013939647,0.005051891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022842275,0.00011475547,0.0005793169,0.00018659543,0.000080739024,0.00009189556,0.00006974092,0.050630488,0.017031467,0.2913045,0.017151605,0.6225306],"study_design_scores_gemma":[0.000020982132,0.00006477223,0.0005080951,0.000023230354,0.00003328099,0.00025593498,0.000033816763,0.83112526,0.010331841,0.12972994,0.027845291,0.000027448661],"about_ca_topic_score_codex":0.0004820601,"about_ca_topic_score_gemma":0.00039208456,"teacher_disagreement_score":0.0056941323,"about_ca_system_score_codex":0.00038207765,"about_ca_system_score_gemma":0.0007319381,"threshold_uncertainty_score":0.01904875},"labels":[],"label_agreement":null},{"id":"W2130716915","doi":"10.1016/j.neuroimage.2005.02.007","title":"Spatial smoothing of autocorrelations to control the degrees of freedom in fMRI analysis","year":2005,"lang":"en","type":"article","venue":"NeuroImage","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Montreal Neurological Institute and Hospital; McGill University","funders":"","keywords":"Smoothing; Autocorrelation; Spatial analysis; Smoothness; Regularization (linguistics); Degrees of freedom (physics and chemistry); Computer science; Statistics; Mathematics; Pattern recognition (psychology); Artificial intelligence; Algorithm","score_opus":0.011993708216634145,"score_gpt":0.232659817228257,"score_spread":0.22066610901162284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130716915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010322413,0.00025922246,0.9887476,0.00010587013,0.000031216783,0.00001126966,0.000023870434,0.0001754216,0.0003231233],"genre_scores_gemma":[0.22365017,0.00077280623,0.7735733,0.00013141615,0.00010528453,0.00007498271,0.00011511815,0.0002973681,0.0012796397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949,0.00025252404,0.000034419714,0.00006436792,0.00013213237,0.000026498648],"domain_scores_gemma":[0.99603075,0.0026225597,0.00030933236,0.00059064064,0.00037049715,0.000076314725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018210158,0.00053459377,0.0003423713,0.0005854099,0.0003157808,0.00046325137,0.0005747177,0.0007506895,0.0010088312],"category_scores_gemma":[0.01126044,0.0003884923,0.0003792739,0.0009286551,0.0008018264,0.0009472634,0.0006368655,0.0010995845,0.00022855155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046672055,0.00020807348,0.0012574624,0.00042230386,0.00017764233,0.00013883754,0.00033278344,0.37704152,0.15913133,0.10912728,0.0034026687,0.34829342],"study_design_scores_gemma":[0.000022129365,0.000068776775,0.0008052834,0.00002155241,0.000031262633,0.00009378222,0.00001608839,0.9425216,0.029749937,0.024535967,0.002101674,0.000031930467],"about_ca_topic_score_codex":0.0015784235,"about_ca_topic_score_gemma":0.003900814,"teacher_disagreement_score":0.0018210158,"about_ca_system_score_codex":0.00026818019,"about_ca_system_score_gemma":0.00073305535,"threshold_uncertainty_score":0.009630561},"labels":[],"label_agreement":null},{"id":"W2130860712","doi":"10.1109/radar.2014.6875735","title":"Blind multipath identification using compressive sensing for through-the-wall noise imaging radar","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Compressed sensing; Multipath propagation; Computer science; Toeplitz matrix; Radar; Noise (video); Algorithm; Channel (broadcasting); Matrix (chemical analysis); Radar imaging; Sparse matrix; Computer vision; Artificial intelligence; Image (mathematics); Mathematics; Telecommunications; Physics","score_opus":0.031068004368885373,"score_gpt":0.2746435227111376,"score_spread":0.24357551834225225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130860712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013054775,0.00013342564,0.9861356,0.000056288703,0.000018810495,0.000011547505,0.000009936332,0.000094506715,0.00048497296],"genre_scores_gemma":[0.48040825,0.00048516408,0.51755875,0.00007800286,0.00007346821,0.000059538943,0.00007411621,0.00004029137,0.001222461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997255,0.000092769405,0.000012535843,0.000042802087,0.00010613418,0.000020155803],"domain_scores_gemma":[0.9996356,0.00019018074,0.00005079829,0.000051353036,0.00005649249,0.000015636435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034747765,0.0004413257,0.00033430886,0.00027849097,0.0001867375,0.00029318605,0.00039639414,0.0004943006,0.00047816985],"category_scores_gemma":[0.0014755488,0.00019292563,0.00029862733,0.00026843473,0.0005184564,0.00068321417,0.0006248561,0.00049690716,0.00017400064],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034559637,0.0000881992,0.00087350706,0.00017635293,0.000072524475,0.0001631505,0.00014029261,0.56540495,0.13146007,0.026814325,0.0010541606,0.27340686],"study_design_scores_gemma":[0.000009166462,0.00006077588,0.000115576586,0.0000056720473,0.0000071255713,0.00008231615,0.000010336792,0.98462546,0.01099424,0.003509906,0.0005658092,0.00001366552],"about_ca_topic_score_codex":0.00077371515,"about_ca_topic_score_gemma":0.0009577779,"teacher_disagreement_score":0.00077371515,"about_ca_system_score_codex":0.00017307284,"about_ca_system_score_gemma":0.000414469,"threshold_uncertainty_score":0.0018376708},"labels":[],"label_agreement":null},{"id":"W2131437840","doi":"","title":"Polar Operators for Structured Sparse Estimation","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Smoothing; Estimator; Computer science; Lasso (programming language); Operator (biology); Algorithm; Simple (philosophy); Polar; Class (philosophy); Artificial intelligence; Mathematics; Computer vision; Statistics","score_opus":0.010913217490994486,"score_gpt":0.2211188185415283,"score_spread":0.2102056010505338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131437840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009257787,0.00020309766,0.99650985,0.00014792687,0.000041559128,0.000015277512,0.00007271622,0.000064529864,0.002019191],"genre_scores_gemma":[0.10864796,0.0027437736,0.87583166,0.00045219559,0.0004955915,0.000276749,0.00060268224,0.00034759846,0.010601843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992168,0.00035998272,0.000030273934,0.00010097462,0.00024946808,0.00004252916],"domain_scores_gemma":[0.9987876,0.0006408668,0.00011519282,0.00018074703,0.00021942279,0.00005628567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012578532,0.0008205176,0.0004935177,0.00073076,0.00030486693,0.00096308434,0.00059804774,0.00082444836,0.005680709],"category_scores_gemma":[0.0042701643,0.00029622472,0.0005713143,0.0009673214,0.0012874746,0.0015276261,0.0017666683,0.0025027548,0.0020668032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006907496,0.000025013713,0.00020036472,0.0001782154,0.000026601805,0.000098174365,0.0001314904,0.07276127,0.010356437,0.8205453,0.008092476,0.08751551],"study_design_scores_gemma":[0.0000136128,0.00004814274,0.00019645675,0.000046068726,0.00001153829,0.00016896847,0.000050383824,0.55731857,0.0041027693,0.4163863,0.021631826,0.00002537578],"about_ca_topic_score_codex":0.0006466453,"about_ca_topic_score_gemma":0.00069086766,"teacher_disagreement_score":0.005680709,"about_ca_system_score_codex":0.0003452333,"about_ca_system_score_gemma":0.0006025697,"threshold_uncertainty_score":0.019003868},"labels":[],"label_agreement":null},{"id":"W2131929195","doi":"10.1590/s0101-74382009000300002","title":"A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering","year":2009,"lang":"en","type":"article","venue":"Pesquisa Operacional","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"HEC Montréal; Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Explained sum of squares; Cluster analysis; Mathematics; Semidefinite programming; Centroid; Algorithm; Equivalence (formal languages); Set (abstract data type); Branch and cut; Combinatorics; Mathematical optimization; Computer science; Linear programming; Discrete mathematics; Statistics","score_opus":0.016016027578216734,"score_gpt":0.2562669848879408,"score_spread":0.24025095730972407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131929195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019515961,0.00007311481,0.9968901,0.0001129523,0.000017199736,0.00004103877,0.000036545815,0.0001533142,0.0007241246],"genre_scores_gemma":[0.063757785,0.00011912918,0.9337406,0.00012206258,0.00003892639,0.00026987772,0.0002825811,0.00010405805,0.0015649502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900144,0.00040108527,0.000050398005,0.00018961038,0.00028767792,0.000069802474],"domain_scores_gemma":[0.99832064,0.0010457899,0.00011396524,0.00011065048,0.0003389135,0.00006989361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017183446,0.0013099381,0.0018450076,0.0009862337,0.0009383154,0.0010221808,0.0016924057,0.0021444673,0.0035585605],"category_scores_gemma":[0.004273574,0.0007181232,0.0007507599,0.0015766307,0.0010964031,0.001410971,0.0018228231,0.0025126128,0.0010302862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014999759,0.00012437337,0.0003703602,0.00014594318,0.000059402675,0.0000863363,0.00013099516,0.742455,0.002694469,0.03586938,0.0073380675,0.21057564],"study_design_scores_gemma":[0.000016051146,0.000027426657,0.000032082535,0.0000050059716,0.0000031976163,0.000022648592,0.000008299928,0.9883222,0.0004682374,0.010347722,0.0007414299,0.000005695922],"about_ca_topic_score_codex":0.0023296967,"about_ca_topic_score_gemma":0.0031894254,"teacher_disagreement_score":0.0035585605,"about_ca_system_score_codex":0.0008866924,"about_ca_system_score_gemma":0.00178471,"threshold_uncertainty_score":0.011904538},"labels":[],"label_agreement":null},{"id":"W2132315948","doi":"10.1049/iet-spr.2013.0354","title":"Time–frequency‐based instantaneous frequency estimation of sparse signals from incomplete set of samples","year":2014,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence","funders":"","keywords":"Time–frequency analysis; Algorithm; SIGNAL (programming language); Mathematics; Instantaneous phase; Signal reconstruction; Bilinear interpolation; Fourier transform; Set (abstract data type); Computer science; Spectral density estimation; Pattern recognition (psychology); Signal processing; Artificial intelligence; Statistics; Digital signal processing; Telecommunications; Mathematical analysis","score_opus":0.02559073078830124,"score_gpt":0.24140254109107587,"score_spread":0.21581181030277463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132315948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049100053,0.00012298713,0.9943498,0.00003855319,0.000016534761,0.00000777318,0.000032689783,0.000047122292,0.0004744858],"genre_scores_gemma":[0.30580738,0.0015712865,0.6893338,0.00008208483,0.00017376481,0.00007760963,0.0003943196,0.00006481857,0.0024949042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970204,0.00007201021,0.000017554476,0.000051449053,0.00013566633,0.000021335036],"domain_scores_gemma":[0.9991646,0.0004365305,0.00012419204,0.00013062156,0.0001232223,0.000020725201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007131416,0.0005711717,0.0005761456,0.0006225615,0.00019818894,0.0005627123,0.0006008341,0.00066175644,0.0009564133],"category_scores_gemma":[0.0029054487,0.00022600386,0.0004583887,0.0007670537,0.0006910425,0.0011170167,0.0005391689,0.0006681844,0.00034257976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029726236,0.00006564153,0.0010920523,0.0005434787,0.00009033117,0.00034674432,0.00030863294,0.48085198,0.08443315,0.09238965,0.0019876508,0.33759344],"study_design_scores_gemma":[0.0000046622126,0.00004484874,0.00036262945,0.00002690338,0.000014546541,0.00020314024,0.000022626242,0.9747242,0.012300979,0.010482954,0.0017934579,0.000019018207],"about_ca_topic_score_codex":0.00065572915,"about_ca_topic_score_gemma":0.00070729206,"teacher_disagreement_score":0.0009564133,"about_ca_system_score_codex":0.00027204305,"about_ca_system_score_gemma":0.00040959226,"threshold_uncertainty_score":0.003771484},"labels":[],"label_agreement":null},{"id":"W2133079381","doi":"10.2316/p.2012.782-022","title":"Fast Dual-based Linearized Bregman Algorithm for Compressive Sensing of Digital Images","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Compressed sensing; Dual (grammatical number); Algorithm; Basis pursuit; Signal reconstruction; Signal recovery; Computer science; SIGNAL (programming language); Nonlinear system; Basis (linear algebra); Sampling (signal processing); Mathematics; Signal processing; Mathematical optimization; Artificial intelligence; Computer vision; Digital signal processing; Matching pursuit; Physics","score_opus":0.016086350881949468,"score_gpt":0.2423308274753727,"score_spread":0.22624447659342325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133079381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004709414,0.00017512946,0.99362916,0.00012613152,0.000022401886,0.000022651864,0.000015134302,0.0002356456,0.0010643118],"genre_scores_gemma":[0.087993495,0.00029472692,0.908033,0.00010556978,0.00003457516,0.00011166033,0.000112621885,0.00007648489,0.003237873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995907,0.00014950024,0.000015560507,0.000041975323,0.00017517932,0.00002711519],"domain_scores_gemma":[0.999592,0.0001543984,0.00005017001,0.00005577453,0.00012292938,0.000024695215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070325664,0.00054722757,0.0006103733,0.0006479103,0.00038054673,0.00061861286,0.0008368076,0.0009452133,0.0024853153],"category_scores_gemma":[0.0017112226,0.00028829073,0.0003743034,0.00070685276,0.0006045739,0.0010001956,0.0011176814,0.0015261024,0.0010247895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004971755,0.0001649191,0.0005789026,0.00021012181,0.00005262457,0.00016776449,0.0002354339,0.3989639,0.0598134,0.07870478,0.0052048666,0.45540607],"study_design_scores_gemma":[0.00001534979,0.000043443044,0.00005826193,0.0000063012776,0.000003072336,0.00006698627,0.000011446794,0.98762894,0.0059292857,0.0038113848,0.0024133692,0.000012184467],"about_ca_topic_score_codex":0.0012361258,"about_ca_topic_score_gemma":0.0015072074,"teacher_disagreement_score":0.0024853153,"about_ca_system_score_codex":0.0004439519,"about_ca_system_score_gemma":0.0009224771,"threshold_uncertainty_score":0.008314192},"labels":[],"label_agreement":null},{"id":"W213438331","doi":"","title":"{Near-optimal max-affine estimators for convex regression}","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Affine transformation; Estimator; Applied mathematics; Logarithm; Lipschitz continuity; Mathematical optimization; Nonlinear regression; Convex function; Affine combination; Rate of convergence; Regular polygon; Regression analysis; Statistics; Computer science; Mathematical analysis","score_opus":0.17412430085091807,"score_gpt":0.36123885276550244,"score_spread":0.18711455191458437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213438331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005858368,0.00031082,0.99281645,0.000119656725,0.000017366925,0.000015954183,0.000049386654,0.00015651682,0.0006555347],"genre_scores_gemma":[0.5440267,0.0014344425,0.4478938,0.00047640782,0.00028773127,0.00019185453,0.0006109679,0.00032540952,0.0047526974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997663,0.0011548654,0.00010734558,0.0004890912,0.0004563332,0.00012927917],"domain_scores_gemma":[0.99476177,0.0035632818,0.0005347946,0.0005313499,0.00047975546,0.00012903137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038831832,0.0013916383,0.0014532108,0.00075595005,0.00039088863,0.0015520754,0.0012309491,0.0012778686,0.002169376],"category_scores_gemma":[0.017219892,0.0007220505,0.0007782428,0.0009202847,0.0018735281,0.00293407,0.0018690715,0.0019505435,0.0010325551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042478097,0.00012649626,0.0018789105,0.0004221121,0.00016535728,0.00013299141,0.00013177701,0.6000233,0.013039442,0.21146195,0.0030875094,0.16910535],"study_design_scores_gemma":[0.000011867124,0.0000643029,0.00028601324,0.000021599617,0.000011724797,0.000054279684,0.000010860846,0.9616091,0.003892424,0.03302921,0.0009922255,0.000016398028],"about_ca_topic_score_codex":0.0009235783,"about_ca_topic_score_gemma":0.000696148,"teacher_disagreement_score":0.0038831832,"about_ca_system_score_codex":0.0008744777,"about_ca_system_score_gemma":0.00077424693,"threshold_uncertainty_score":0.020536482},"labels":[],"label_agreement":null},{"id":"W2134385004","doi":"10.1109/mdsp.1989.97066","title":"Affine algorithms for L-minimization","year":2003,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interior point method; Affine transformation; Linear programming; Minification; Simplex algorithm; Algorithm; Simplex; Mathematical optimization; Computer science; Mathematics; Combinatorics","score_opus":0.0250359452441942,"score_gpt":0.2445181011477419,"score_spread":0.2194821559035477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134385004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080031814,0.0019325493,0.98305315,0.00023057274,0.00034378804,0.00004081484,0.00008176591,0.0006569471,0.012859959],"genre_scores_gemma":[0.053768765,0.0049508037,0.89731526,0.00046961865,0.00075720536,0.00030729215,0.00060508924,0.00081568107,0.04101029],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993783,0.00018416118,0.000047742884,0.00012239313,0.00022377292,0.00004363229],"domain_scores_gemma":[0.99915075,0.0004163453,0.00006016321,0.00016569001,0.00017445565,0.0000326211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063076534,0.0010172786,0.0010063105,0.0007488261,0.00052293437,0.0012821418,0.0012447069,0.0010398964,0.034863666],"category_scores_gemma":[0.0030183955,0.0003734389,0.00079686166,0.001745311,0.00085477263,0.0014351516,0.0017768187,0.0020743043,0.01670327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000827094,0.000057914956,0.00030994613,0.00043569395,0.00006201717,0.00011451632,0.00009255799,0.112224884,0.0046425313,0.22454956,0.04099541,0.61643225],"study_design_scores_gemma":[0.00003332581,0.000070664,0.00027344955,0.00008992643,0.00003169834,0.00035041335,0.000049600316,0.65724045,0.005018621,0.19010498,0.14668843,0.000048498478],"about_ca_topic_score_codex":0.0011134725,"about_ca_topic_score_gemma":0.001728389,"teacher_disagreement_score":0.034863666,"about_ca_system_score_codex":0.0006421103,"about_ca_system_score_gemma":0.00067379227,"threshold_uncertainty_score":0.116630614},"labels":[],"label_agreement":null},{"id":"W2136660391","doi":"","title":"In Pursuit of a Root","year":2007,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Basis pursuit; Least-squares function approximation; Mathematical optimization; Norm (philosophy); Underdetermined system; Total least squares; Applied mathematics; Non-linear least squares; Differentiable function; Iteratively reweighted least squares; Algorithm; Mathematical analysis; Compressed sensing; Estimation theory; Statistics","score_opus":0.008835539302612154,"score_gpt":0.23457435716319128,"score_spread":0.22573881786057912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136660391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008441068,0.0003817064,0.9837226,0.00042762098,0.00009114515,0.00002160766,0.000030156396,0.00019720086,0.006686943],"genre_scores_gemma":[0.35800937,0.0014390079,0.6210237,0.00065156986,0.00029886072,0.00016352885,0.00021703012,0.00020274876,0.017994167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994103,0.00015715192,0.00002402824,0.0001425714,0.00022227292,0.000043683194],"domain_scores_gemma":[0.9992255,0.0004113099,0.00007929665,0.0001103875,0.00013200684,0.000041490683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081434415,0.0008065773,0.0007620687,0.0005408969,0.00048588542,0.0012943688,0.00067398715,0.0014739177,0.0029802958],"category_scores_gemma":[0.0038793613,0.0003808808,0.00033945934,0.00068243267,0.0014182829,0.0016061249,0.0018978819,0.0016291847,0.0013724406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003622852,0.000067972964,0.0010783653,0.00032584844,0.000094184645,0.00027182145,0.0005048974,0.19592081,0.048958905,0.46755698,0.0113963075,0.27346164],"study_design_scores_gemma":[0.000043612534,0.00011675071,0.0003616625,0.000040600906,0.00001729466,0.00027692813,0.000097316384,0.8466518,0.009395308,0.12705654,0.015911503,0.000030708467],"about_ca_topic_score_codex":0.0006691384,"about_ca_topic_score_gemma":0.0005703277,"teacher_disagreement_score":0.0029802958,"about_ca_system_score_codex":0.0004083877,"about_ca_system_score_gemma":0.0006654464,"threshold_uncertainty_score":0.009970069},"labels":[],"label_agreement":null},{"id":"W2136676913","doi":"10.1109/dcc.2009.69","title":"Model-Guided Adaptive Recovery of Compressive Sensing","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compressed sensing; Signal recovery; SIGNAL (programming language); Computer science; Autoregressive model; Signal reconstruction; Wavelet; Piecewise; Set (abstract data type); Process (computing); Iterative reconstruction; Algorithm; Artificial intelligence; Signal processing; Computer vision; Mathematics; Telecommunications","score_opus":0.039539044484889214,"score_gpt":0.24732335258121352,"score_spread":0.2077843080963243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136676913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005246657,0.0001486842,0.9927636,0.00016127253,0.000023060955,0.0000107209235,0.000018973584,0.00016753418,0.0014595927],"genre_scores_gemma":[0.5466044,0.0007892415,0.4459246,0.00033308592,0.0001034178,0.00013034519,0.00020449267,0.0001774555,0.0057329084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997067,0.00008467375,0.000009969886,0.000060855866,0.00011230905,0.00002551478],"domain_scores_gemma":[0.9996216,0.00016929152,0.000055659388,0.00007883681,0.00005800668,0.000016494863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053786125,0.00054140855,0.00053043896,0.00033812347,0.00019266053,0.00053632294,0.0006635177,0.00079382554,0.0013969417],"category_scores_gemma":[0.0018629628,0.00028421456,0.00044639767,0.0003683234,0.00074599695,0.0010028754,0.0011608497,0.0010169132,0.00048402252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009805221,0.000042120202,0.00038863486,0.00012276426,0.000043906985,0.00011879468,0.00010498461,0.7751409,0.028556412,0.0893472,0.0030987556,0.10293742],"study_design_scores_gemma":[0.0000037112363,0.000015663663,0.00004403927,0.000004134754,0.0000030660403,0.000027365972,0.000004796325,0.99007905,0.0016224444,0.0072699045,0.0009196561,0.0000061763308],"about_ca_topic_score_codex":0.0015849513,"about_ca_topic_score_gemma":0.0015045538,"teacher_disagreement_score":0.0015849513,"about_ca_system_score_codex":0.00041155785,"about_ca_system_score_gemma":0.00054934045,"threshold_uncertainty_score":0.004673302},"labels":[],"label_agreement":null},{"id":"W2136690855","doi":"10.48550/arxiv.1211.0056","title":"Iterative Hard Thresholding Methods for $l_0$ Regularized Convex Cone Programming","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Thresholding; Regular polygon; Cone (formal languages); Convex optimization; Mathematics; Convex cone; Second-order cone programming; Dual cone and polar cone; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Convex analysis; Geometry; Image (mathematics)","score_opus":0.13133665342612777,"score_gpt":0.2551386078294804,"score_spread":0.12380195440335262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136690855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020863346,0.00012576721,0.9961976,0.00011672703,0.000018273708,0.0000242667,0.000017127735,0.000046612393,0.0013673746],"genre_scores_gemma":[0.14350039,0.0006073001,0.8479439,0.00024919314,0.00015738253,0.00028109338,0.00019704681,0.0002317697,0.006831937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889153,0.0004886495,0.000042723987,0.00018418106,0.00031127763,0.00008166097],"domain_scores_gemma":[0.99788743,0.0014087835,0.00016479733,0.00015744218,0.00029872748,0.00008293313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020290588,0.0012027932,0.0010699078,0.0005962404,0.0004407474,0.0011927031,0.0013713973,0.0012834448,0.002672833],"category_scores_gemma":[0.0055809547,0.00046127773,0.0008939604,0.0007256382,0.001626001,0.0015370329,0.0017314407,0.002907057,0.0007426483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001041183,0.00010743587,0.00057846896,0.00032732953,0.00005974918,0.000189926,0.0002071175,0.70816964,0.008584221,0.18634039,0.0041262023,0.09120537],"study_design_scores_gemma":[0.000005636229,0.000019922534,0.00004120721,0.000010682259,0.000002609353,0.000025328189,0.000011182715,0.97814286,0.0009933742,0.01975755,0.000982817,0.0000067746173],"about_ca_topic_score_codex":0.0016964976,"about_ca_topic_score_gemma":0.0015489307,"teacher_disagreement_score":0.002672833,"about_ca_system_score_codex":0.00082292885,"about_ca_system_score_gemma":0.0009879811,"threshold_uncertainty_score":0.010730803},"labels":[],"label_agreement":null},{"id":"W2137891991","doi":"10.1109/tip.2008.2001048","title":"Adaptive Rate-Distortion Optimal In-Loop Quantization for Matching Pursuit","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantization (signal processing); Matching pursuit; Coding (social sciences); Vector quantization; Mathematics; Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.028543124154710713,"score_gpt":0.254943348524528,"score_spread":0.22640022436981727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137891991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004169816,0.00020937907,0.9948472,0.000053011518,0.000028306395,0.000020434212,0.000012667905,0.000111302455,0.00054797734],"genre_scores_gemma":[0.4672259,0.0005059455,0.5296693,0.00014126087,0.00008857914,0.000103418366,0.00008378102,0.00005997258,0.0021218492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923944,0.00020727694,0.000045315843,0.00012366772,0.0003452434,0.000039211835],"domain_scores_gemma":[0.99939764,0.0002860092,0.00007382558,0.0000895433,0.00013483896,0.000018068285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007823894,0.0004116075,0.00051804,0.0002913173,0.0002802019,0.0005079846,0.00083434104,0.00047257595,0.0013770852],"category_scores_gemma":[0.0032947797,0.00015340053,0.00020481151,0.0005152905,0.0004860272,0.0008916682,0.00064010127,0.0008030395,0.00032196593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005601084,0.00013035217,0.0006463063,0.00029654172,0.00006214951,0.00012068293,0.00021020838,0.2303865,0.09127539,0.09915057,0.0031056479,0.5740556],"study_design_scores_gemma":[0.000028748993,0.00013688588,0.00011732626,0.000012683422,0.0000099521985,0.0001028238,0.000011255047,0.9670418,0.019379498,0.010181842,0.0029596284,0.000017537724],"about_ca_topic_score_codex":0.00064863963,"about_ca_topic_score_gemma":0.0006035707,"teacher_disagreement_score":0.0013770852,"about_ca_system_score_codex":0.00040934636,"about_ca_system_score_gemma":0.00042543825,"threshold_uncertainty_score":0.0046067834},"labels":[],"label_agreement":null},{"id":"W2138044000","doi":"10.2174/1876825300902010040","title":"Non-Convex Compressed Sensing from Noisy Measurements","year":2009,"lang":"en","type":"article","venue":"The Open Signal Processing Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Norm (philosophy); Optimization problem; Convex optimization; Regular polygon; Algorithm; Mathematics; Mathematical optimization; Noise (video); Matrix (chemical analysis); Matrix norm; Gaussian; Computer science; Artificial intelligence; Physics","score_opus":0.05053264588207327,"score_gpt":0.27617801103260337,"score_spread":0.2256453651505301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138044000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043810317,0.0003898802,0.9928156,0.00047525245,0.000043586602,0.000021442982,0.00004979456,0.00008276674,0.0017406557],"genre_scores_gemma":[0.37827563,0.0027936096,0.608529,0.00056419306,0.0005023261,0.00022444886,0.00054467237,0.00014758011,0.008418643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.00035166307,0.000039206934,0.0001679555,0.00031686385,0.000051706433],"domain_scores_gemma":[0.9989767,0.0007009794,0.000094346244,0.000090920636,0.00011244173,0.000024646499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011554962,0.0008808396,0.0011425775,0.0004519256,0.0002699585,0.0009929895,0.00094625587,0.0010888195,0.0014316993],"category_scores_gemma":[0.0043976195,0.00048459167,0.00050594343,0.00070580264,0.001198448,0.0016627414,0.0013981044,0.0014044704,0.0004433708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001689647,0.000047751357,0.0002961209,0.0004164997,0.00006527136,0.00024232338,0.00016248171,0.72911507,0.011675767,0.13012005,0.0041632997,0.12352643],"study_design_scores_gemma":[0.000014886105,0.000033087745,0.00010116191,0.00001968984,0.0000074876534,0.00006773288,0.000022178327,0.96763504,0.0020826764,0.027734384,0.0022696652,0.0000120320265],"about_ca_topic_score_codex":0.0014036107,"about_ca_topic_score_gemma":0.0013867558,"teacher_disagreement_score":0.0014316993,"about_ca_system_score_codex":0.00048960315,"about_ca_system_score_gemma":0.000887862,"threshold_uncertainty_score":0.0061109066},"labels":[],"label_agreement":null},{"id":"W2138771231","doi":"10.1109/icassp.2009.4960341","title":"&amp;#x2113;&lt;inf&gt;P&lt;/inf&gt; minimization for sparse vector reconstruction","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Minification; Function (biology); Regular polygon; Convex function; Mathematical optimization; Iterative method; Mathematics; Property (philosophy); Point (geometry); Algorithm; Convex optimization; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.02092711897299894,"score_gpt":0.23378040771565947,"score_spread":0.21285328874266052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138771231","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022949523,0.00017507479,0.9951461,0.00016184022,0.000023046388,0.000011766049,0.00003272024,0.00013255261,0.002021862],"genre_scores_gemma":[0.14203653,0.0011385098,0.83882165,0.0002029142,0.00013921213,0.00013370242,0.00032557317,0.00044840106,0.01675351],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996697,0.00010883676,0.0000118511825,0.000048859074,0.00014166333,0.000019111367],"domain_scores_gemma":[0.99969804,0.00015505019,0.00003635748,0.000043513464,0.00005688029,0.000010251999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005779562,0.0007437387,0.00053384976,0.00038599203,0.00025048057,0.0005704296,0.00048079377,0.00060968136,0.0053031496],"category_scores_gemma":[0.0012738294,0.0002356246,0.00035620152,0.000511834,0.0008230014,0.0008891332,0.00065609545,0.0009060329,0.0021206744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001801629,0.00007506888,0.00043901082,0.00036506617,0.000053111627,0.00017868441,0.00014539844,0.3269722,0.0448785,0.15445976,0.016806908,0.45544612],"study_design_scores_gemma":[0.0000071371387,0.000037504327,0.0001319849,0.000015064089,0.00000542408,0.00007571785,0.000013567645,0.9705173,0.0097606685,0.01223374,0.007193394,0.000008553939],"about_ca_topic_score_codex":0.0011644047,"about_ca_topic_score_gemma":0.0015670343,"teacher_disagreement_score":0.0053031496,"about_ca_system_score_codex":0.0003967764,"about_ca_system_score_gemma":0.0004483686,"threshold_uncertainty_score":0.017740786},"labels":[],"label_agreement":null},{"id":"W2138972044","doi":"","title":"Better Approximation and Faster Algorithm Using the Proximal Average","year":2013,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Smoothing; Lasso (programming language); Overhead (engineering); Regular polygon; Algorithm; Computer science; Convex function; Approximation algorithm; Graph; Point (geometry); Proximal Gradient Methods; Mathematical optimization; Smoothness; Mathematics; Theoretical computer science; Geometry","score_opus":0.014777664856310664,"score_gpt":0.2135759926542853,"score_spread":0.19879832779797466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138972044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025975371,0.0001187012,0.9961444,0.00011439795,0.00004397028,0.000017067814,0.000014472148,0.0003055177,0.00064397685],"genre_scores_gemma":[0.13598011,0.00040131283,0.8586719,0.0002345331,0.00019157337,0.00016367335,0.00018618214,0.00028782163,0.0038828012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989981,0.00028247837,0.000050242925,0.00019208061,0.00038373447,0.00009339343],"domain_scores_gemma":[0.9987093,0.0006146813,0.0000843288,0.0002627682,0.00024837547,0.00008057875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016515385,0.0010195845,0.0015312567,0.00079940987,0.00049963954,0.001198782,0.0011680563,0.001561886,0.004112727],"category_scores_gemma":[0.005426655,0.00045021556,0.00091551174,0.0010147218,0.0008251329,0.0018306107,0.0018951432,0.0025723858,0.001705423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031439232,0.0001406928,0.00089283095,0.0002988911,0.00011535335,0.00021432867,0.00034835056,0.5956946,0.018801035,0.098758265,0.009353822,0.27506736],"study_design_scores_gemma":[0.000019100757,0.000035414265,0.000093582465,0.000009396043,0.000008926938,0.000058628077,0.00001642653,0.9846713,0.0018272904,0.011185252,0.002062934,0.00001164078],"about_ca_topic_score_codex":0.0032401802,"about_ca_topic_score_gemma":0.0025362666,"teacher_disagreement_score":0.004112727,"about_ca_system_score_codex":0.0005367471,"about_ca_system_score_gemma":0.0014037545,"threshold_uncertainty_score":0.013758421},"labels":[],"label_agreement":null},{"id":"W2140196696","doi":"10.1109/icassp.2005.1416098","title":"Flexible Tree-Search Based Orthogonal Matching Pursuit Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Matching pursuit; Tree (set theory); Algorithm; Computer science; Matching (statistics); Computation; Flexibility (engineering); Computational complexity theory; Sparse approximation; Search algorithm; Mathematical optimization; Mathematics; Compressed sensing","score_opus":0.012568980541765988,"score_gpt":0.22597852364978463,"score_spread":0.21340954310801863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140196696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042936862,0.00011380549,0.9942058,0.0000718654,0.000019956433,0.000026759064,0.000032429736,0.00015002409,0.0010856544],"genre_scores_gemma":[0.21529026,0.00040379175,0.7803272,0.00017438247,0.0000539705,0.00019513191,0.0003282949,0.00008706987,0.003139938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933416,0.00015512596,0.00003682137,0.000101079655,0.00029820378,0.00007466742],"domain_scores_gemma":[0.99932265,0.00022832784,0.00007377858,0.00010946779,0.0002163986,0.000049410544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074819336,0.0004141248,0.00082165166,0.0006185303,0.00043448183,0.0006584627,0.0011285546,0.001196228,0.0021810825],"category_scores_gemma":[0.0025980426,0.00021677646,0.0004972765,0.0014079952,0.0004628131,0.0011960246,0.0014333369,0.0009750931,0.0010629923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003999542,0.00011118005,0.000868653,0.00016853906,0.0000625846,0.00022162536,0.00014503169,0.33345208,0.03679176,0.08562459,0.0068731476,0.5352809],"study_design_scores_gemma":[0.000025472875,0.00006676615,0.00011941395,0.0000064055744,0.000006448006,0.00012208022,0.000009467602,0.984116,0.0027288182,0.009720885,0.0030642154,0.000013864757],"about_ca_topic_score_codex":0.00079874555,"about_ca_topic_score_gemma":0.0008045323,"teacher_disagreement_score":0.0021810825,"about_ca_system_score_codex":0.0002997429,"about_ca_system_score_gemma":0.0009072782,"threshold_uncertainty_score":0.007296443},"labels":[],"label_agreement":null},{"id":"W2140878114","doi":"10.1109/tbme.2010.2089456","title":"Sparse Reconstruction of Breast MRI Using Homotopic &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$L_0$&lt;/tex&gt;&lt;/formula&gt; Minimization in a Regional Sparsified Domain","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Minification; Nyquist–Shannon sampling theorem; Computer science; Iterative reconstruction; Differential (mechanical device); Algorithm; Artificial intelligence; Mathematical optimization; Mathematics; Computer vision","score_opus":0.012999246865135709,"score_gpt":0.2206229638988365,"score_spread":0.2076237170337008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140878114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033683833,0.00009404037,0.964576,0.00011615581,0.000010675257,0.000015511283,0.000049799924,0.00009789493,0.0013560526],"genre_scores_gemma":[0.3720405,0.00042637723,0.6231043,0.0001222112,0.00003206364,0.000042169457,0.00030632174,0.00006755248,0.0038584494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989164,0.000035173343,0.0000058001738,0.000018415449,0.000042225605,0.0000067461424],"domain_scores_gemma":[0.999821,0.00008067698,0.000027251981,0.000037409845,0.000024882285,0.000008740288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025579418,0.00029695878,0.0002536074,0.0002760405,0.0000977046,0.0002508448,0.00025061148,0.00027594445,0.00093766785],"category_scores_gemma":[0.0008661048,0.000111809495,0.00028253385,0.0003529803,0.00032875568,0.0002847562,0.00042062294,0.00029878397,0.0003049966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000281228,0.00007658036,0.0012388836,0.0002465526,0.000061736486,0.0009068075,0.00029093653,0.4013319,0.27417806,0.040194854,0.0024283577,0.27876416],"study_design_scores_gemma":[0.000008653438,0.00006582107,0.0005670509,0.000006961395,0.000010248458,0.00048193973,0.000034326018,0.95729023,0.03478307,0.0050474755,0.0016940471,0.000010146307],"about_ca_topic_score_codex":0.00064809335,"about_ca_topic_score_gemma":0.0010469756,"teacher_disagreement_score":0.00093766785,"about_ca_system_score_codex":0.00013697115,"about_ca_system_score_gemma":0.00028135782,"threshold_uncertainty_score":0.0031368136},"labels":[],"label_agreement":null},{"id":"W2141202473","doi":"10.1109/icassp.2011.5946908","title":"Online performance guarantees for sparse recovery","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Azrieli Foundation; European Commission; Rice University","keywords":"Computer science; Algorithm; Context (archaeology); Combinatorics; Discrete mathematics; Mathematics","score_opus":0.052214217442722366,"score_gpt":0.22346817929934043,"score_spread":0.17125396185661806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141202473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05244523,0.0025347066,0.9124897,0.003916937,0.0003794216,0.00021848545,0.002092741,0.007673153,0.01824967],"genre_scores_gemma":[0.7844143,0.0016171886,0.19545083,0.0010923729,0.00066269864,0.0004573493,0.0045642643,0.0009939324,0.010747161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99436367,0.0010408027,0.00032633223,0.0010028202,0.0020229232,0.001243364],"domain_scores_gemma":[0.9792029,0.012490284,0.0012297396,0.0039147586,0.0022787119,0.0008836482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041654985,0.0021727236,0.0024251947,0.001233062,0.0012446868,0.003079438,0.0027666907,0.0024834329,0.010535824],"category_scores_gemma":[0.032158773,0.0007993985,0.0008314383,0.0022823426,0.0014931635,0.005552652,0.0056972704,0.0033549087,0.0040730634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004603355,0.00059404335,0.0028656425,0.0008958555,0.00015046966,0.00047832204,0.00032238648,0.5338652,0.014792227,0.06507235,0.05038834,0.32597175],"study_design_scores_gemma":[0.000089475194,0.00015543542,0.00044091733,0.000037523012,0.000019575702,0.0001626399,0.000072375384,0.9566134,0.003749633,0.036257915,0.0023786,0.000022613101],"about_ca_topic_score_codex":0.0037467426,"about_ca_topic_score_gemma":0.0046560625,"teacher_disagreement_score":0.010535824,"about_ca_system_score_codex":0.0018225167,"about_ca_system_score_gemma":0.0044202413,"threshold_uncertainty_score":0.035245895},"labels":[],"label_agreement":null},{"id":"W2143353022","doi":"10.1109/mwscas.2011.6026662","title":"A compressive sensing method for noise reduction of speech and audio signals","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compressed sensing; Noise reduction; Computer science; Speech recognition; Gaussian noise; Noise (video); Reduction (mathematics); Noise measurement; White noise; Additive white Gaussian noise; Algorithm; Audio signal; Speech enhancement; Signal processing; Artificial intelligence; Mathematics; Speech coding; Digital signal processing; Telecommunications","score_opus":0.042713125818346874,"score_gpt":0.2743757357408369,"score_spread":0.23166260992249002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143353022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024838438,0.00023313501,0.9963111,0.00013311379,0.00003837357,0.0000164622,0.000018903062,0.00006430195,0.00070074835],"genre_scores_gemma":[0.13028947,0.0010780441,0.86349094,0.00023448732,0.0002483456,0.00015650284,0.00017037788,0.000053174692,0.004278682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995264,0.00012637847,0.000021305183,0.000091529175,0.00021449126,0.00001987959],"domain_scores_gemma":[0.9996669,0.00017684021,0.000033227327,0.000031228385,0.000074764546,0.00001702073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052450906,0.0006837431,0.0005275878,0.0005017419,0.00032955242,0.00035281613,0.00058341,0.00087844155,0.0014597095],"category_scores_gemma":[0.0015027083,0.00023341409,0.0005319501,0.000539761,0.0006349497,0.00072584185,0.00072241836,0.000933621,0.00044802594],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025750656,0.00010395953,0.00034957656,0.00044468904,0.00009100536,0.00023028255,0.00022670261,0.25004894,0.1576107,0.0668202,0.004793533,0.5190228],"study_design_scores_gemma":[0.000025309842,0.00014624225,0.0002393053,0.00002569432,0.000025286561,0.00023182301,0.000024591316,0.9631335,0.020139745,0.008792031,0.0071850047,0.00003132477],"about_ca_topic_score_codex":0.0009656367,"about_ca_topic_score_gemma":0.0012229605,"teacher_disagreement_score":0.0014597095,"about_ca_system_score_codex":0.0002296201,"about_ca_system_score_gemma":0.0005685206,"threshold_uncertainty_score":0.0048832297},"labels":[],"label_agreement":null},{"id":"W2143375189","doi":"10.1109/allerton.2012.6483272","title":"Distributed strongly convex optimization","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Node (physics); Separable space; Rate of convergence; Convex optimization; Convergence (economics); Convex function; Mathematical optimization; Regular polygon; Optimization problem; Zero (linguistics); Mathematics; Computer science; Mathematical analysis; Engineering","score_opus":0.020463786236714625,"score_gpt":0.23092496516958075,"score_spread":0.21046117893286612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143375189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034386218,0.00040578525,0.99261475,0.0005148428,0.00007161094,0.000024908662,0.000042077507,0.00013900014,0.0027484652],"genre_scores_gemma":[0.6632188,0.002045529,0.31704807,0.00060483173,0.00051840354,0.0004623564,0.0003714412,0.00029733946,0.015433158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805707,0.00081279036,0.00007328449,0.0004428084,0.00047819133,0.00013587312],"domain_scores_gemma":[0.9956321,0.0028423544,0.00023358458,0.0006271556,0.00050963013,0.00015509909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023870969,0.0010402749,0.0013949556,0.00041241976,0.0004001744,0.0011992577,0.0011844097,0.0014028056,0.0026175452],"category_scores_gemma":[0.009728466,0.0005066644,0.0006029351,0.0006751814,0.0016689156,0.0017027557,0.0022871154,0.0024881163,0.00081220985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020611881,0.000051473075,0.00039686248,0.00021377034,0.00007528531,0.0001001694,0.00007015167,0.79664403,0.0030170134,0.14111736,0.006481844,0.051625982],"study_design_scores_gemma":[0.000017396877,0.000024645478,0.000058246816,0.000006424364,0.000003519244,0.000019249204,0.00000654154,0.9542595,0.0005168849,0.04376234,0.0013211101,0.000004176919],"about_ca_topic_score_codex":0.0011509461,"about_ca_topic_score_gemma":0.0010601201,"teacher_disagreement_score":0.0026175452,"about_ca_system_score_codex":0.00109855,"about_ca_system_score_gemma":0.0011368488,"threshold_uncertainty_score":0.012624323},"labels":[],"label_agreement":null},{"id":"W2146543387","doi":"10.1109/icassp.2012.6288695","title":"A sparse reconstruction based algorithm for image and video classification","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Pattern recognition (psychology); Sparse approximation; K-SVD; Class (philosophy); Dictionary learning; Facial recognition system; Noise (video); Contextual image classification; Image (mathematics); Face (sociological concept); Iterative reconstruction; Representation (politics)","score_opus":0.027672546172876043,"score_gpt":0.24564084805836336,"score_spread":0.21796830188548733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146543387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074945303,0.00016715973,0.9980927,0.00009912796,0.000037035938,0.000030425243,0.00003473724,0.00024180955,0.00054750504],"genre_scores_gemma":[0.028828807,0.0005027981,0.96632594,0.0001518379,0.00012308104,0.00015296297,0.000301814,0.000048164355,0.0035645263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917775,0.00015702187,0.000047587404,0.00017144793,0.00039398044,0.00005203457],"domain_scores_gemma":[0.9994541,0.00016929446,0.00006571284,0.000109464214,0.00017529906,0.000026083952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092944026,0.00070078654,0.000923273,0.00137512,0.00045107945,0.0009017555,0.0011373389,0.0014476308,0.003598166],"category_scores_gemma":[0.0023644678,0.00036066517,0.0007925614,0.0020623843,0.0006647966,0.0012452346,0.0011118544,0.0019791045,0.0032738599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012074054,0.000077484554,0.00035165375,0.00013409405,0.000045502493,0.00007340218,0.000069665,0.059418704,0.022600494,0.04075009,0.009895376,0.8664628],"study_design_scores_gemma":[0.000023934366,0.000088587694,0.00030971967,0.000027578779,0.0000150513715,0.00031956373,0.000019947549,0.95306325,0.0094497325,0.018915802,0.017737342,0.000029610745],"about_ca_topic_score_codex":0.0014154162,"about_ca_topic_score_gemma":0.0015579633,"teacher_disagreement_score":0.003598166,"about_ca_system_score_codex":0.00046220003,"about_ca_system_score_gemma":0.00070649915,"threshold_uncertainty_score":0.012037039},"labels":[],"label_agreement":null},{"id":"W2147720374","doi":"10.1186/1687-6180-2012-82","title":"Using learned under-sampling pattern for increasing speed of cardiac cine MRI based on compressive sensing principles","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Institutes of Health","keywords":"Compressed sensing; k-space; Computer science; Thresholding; Cardiac cycle; Artificial intelligence; Sampling (signal processing); Algorithm; Fuzzy logic; Markov chain; Pattern recognition (psychology); Fourier transform; Computer vision; Mathematics; Image (mathematics)","score_opus":0.0856835156420304,"score_gpt":0.33958764019480486,"score_spread":0.25390412455277445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147720374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03732206,0.00027573228,0.96054316,0.00018878216,0.00005297635,0.0000397066,0.000046866637,0.00038813276,0.0011426649],"genre_scores_gemma":[0.48916423,0.00053409865,0.5080806,0.00018903558,0.000104494815,0.000111865964,0.00025041102,0.000115002855,0.0014502461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.00012736444,0.000031635715,0.00009700388,0.00021698902,0.000044229993],"domain_scores_gemma":[0.99849,0.0007460701,0.00016459895,0.00023461167,0.00029813522,0.00006648947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007456995,0.0005122425,0.0005329037,0.00055297837,0.0002750889,0.0004674038,0.0005805032,0.0005927427,0.0013892971],"category_scores_gemma":[0.0045673517,0.00027756163,0.00027774615,0.00048668665,0.00044842265,0.0010224564,0.00073429046,0.00075739506,0.00038056218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000824481,0.00027743535,0.0038931167,0.0003084551,0.000075420605,0.00039692182,0.00043831076,0.25900635,0.16305618,0.022690939,0.0036261547,0.5454063],"study_design_scores_gemma":[0.000017225899,0.00010924357,0.00059551955,0.00001621141,0.00001195749,0.0001565639,0.00002155927,0.9787127,0.01591552,0.0031046518,0.0013238469,0.000015007868],"about_ca_topic_score_codex":0.0011724862,"about_ca_topic_score_gemma":0.0016568706,"teacher_disagreement_score":0.0013892971,"about_ca_system_score_codex":0.00023236581,"about_ca_system_score_gemma":0.0005481983,"threshold_uncertainty_score":0.004647672},"labels":[],"label_agreement":null},{"id":"W2147795503","doi":"10.1109/pacrim.2009.5291404","title":"Fast Group Sparse Classification","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Classifier (UML); Optimization problem; Quadratic programming; Greedy algorithm; Computer science; Sparse approximation; Minification; Convex optimization; Mathematical optimization; Linear programming; Linear programming relaxation; Artificial intelligence; Regular polygon; Mathematics; Algorithm","score_opus":0.02259576042387802,"score_gpt":0.22935596858760768,"score_spread":0.20676020816372967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147795503","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011255385,0.00042349903,0.9836874,0.0004957376,0.00019360651,0.00014194562,0.00024271054,0.0010168849,0.0025428087],"genre_scores_gemma":[0.22253308,0.00047809217,0.7666935,0.00059517834,0.00043655068,0.00036609505,0.0017158849,0.00018154026,0.007000106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839455,0.00042315194,0.000046204903,0.00024995627,0.00069928495,0.00018688642],"domain_scores_gemma":[0.99711657,0.0011704481,0.00021283359,0.0006670218,0.0007356192,0.000097368385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015906072,0.0010663845,0.0018122671,0.0015694787,0.000858998,0.0010164256,0.0018643191,0.0022306745,0.005889617],"category_scores_gemma":[0.005543702,0.000396017,0.00065952726,0.0021415194,0.00069858815,0.0022813277,0.0017506585,0.0019034125,0.0027551043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055906357,0.00020997376,0.0013734697,0.00016532886,0.00008574498,0.00015856516,0.00018235984,0.07865116,0.007910363,0.022215161,0.0364465,0.8520423],"study_design_scores_gemma":[0.000052780826,0.000101725775,0.00034198113,0.000014192185,0.000018143739,0.0001254631,0.000051863026,0.96475863,0.0041037947,0.022926427,0.007492338,0.00001273902],"about_ca_topic_score_codex":0.0021633347,"about_ca_topic_score_gemma":0.0034638694,"teacher_disagreement_score":0.005889617,"about_ca_system_score_codex":0.0005646042,"about_ca_system_score_gemma":0.0010932294,"threshold_uncertainty_score":0.019702733},"labels":[],"label_agreement":null},{"id":"W2148766464","doi":"10.3997/2214-4609.201405090","title":"Curvelet reconstruction with sparsity-promoting inversion:successes and challenges","year":2007,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; BG Group","keywords":"Inversion (geology); Curvelet; Interpolation (computer graphics); Computer science; Inverse problem; Geology; Artificial intelligence; Seismology; Image (mathematics); Mathematics","score_opus":0.02346338727871091,"score_gpt":0.20824133832860475,"score_spread":0.18477795104989383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148766464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017363923,0.0036676524,0.9704851,0.0027256743,0.00014826549,0.00004258667,0.000070947775,0.0004555732,0.0050403923],"genre_scores_gemma":[0.16072191,0.008281368,0.8253246,0.00038892153,0.00086212804,0.00006531195,0.00034394718,0.0004981342,0.0035136421],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978669,0.00083793653,0.00011038259,0.00021388919,0.0008916641,0.0000791723],"domain_scores_gemma":[0.98472023,0.011541153,0.00036501748,0.0015283019,0.0015612275,0.0002839651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007397148,0.0009304229,0.001455352,0.0008876561,0.00042930973,0.0019821038,0.0015786128,0.0019076557,0.0018766882],"category_scores_gemma":[0.01802203,0.00079066603,0.00075387495,0.0017224064,0.0021768422,0.0027022092,0.002026418,0.0031244028,0.0010124082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004294073,0.0001852816,0.0026302943,0.0009150006,0.00020942723,0.00036441916,0.0005434943,0.16000903,0.018772032,0.0704215,0.012966063,0.732554],"study_design_scores_gemma":[0.00006566728,0.00017304323,0.000531824,0.0001382044,0.00003575532,0.0007912096,0.00018885455,0.90051055,0.023438612,0.053609006,0.02043241,0.00008485157],"about_ca_topic_score_codex":0.0011679282,"about_ca_topic_score_gemma":0.0012846427,"teacher_disagreement_score":0.007397148,"about_ca_system_score_codex":0.00034338053,"about_ca_system_score_gemma":0.0005628915,"threshold_uncertainty_score":0.039120317},"labels":[],"label_agreement":null},{"id":"W2151056446","doi":"10.1109/icassp.2012.6288662","title":"Adaptive compressed sensing for video acquisition","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Weighting; Computer science; Scheme (mathematics); SIGNAL (programming language); Signal recovery; Minification; Adaptive sampling; Signal reconstruction; Focus (optics); Sampling (signal processing); Artificial intelligence; Signal processing; Algorithm; Computer vision; Mathematics; Filter (signal processing); Telecommunications; Statistics","score_opus":0.027551940459687438,"score_gpt":0.24199711005482835,"score_spread":0.21444516959514093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151056446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033773757,0.0012629362,0.9922714,0.00037184684,0.0000794516,0.000033268316,0.00003114261,0.00012349956,0.0024490634],"genre_scores_gemma":[0.24451853,0.004042287,0.74395543,0.00058240554,0.00047057527,0.00017710395,0.00017207232,0.000088905465,0.00599263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996112,0.000087786,0.000012882306,0.00006670094,0.00020572513,0.0000157411],"domain_scores_gemma":[0.9995665,0.00025034562,0.000043578206,0.000054394524,0.00007369117,0.000011537685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035016792,0.0004331409,0.00031660649,0.0003406584,0.00022684885,0.00038372978,0.0006526787,0.0006543545,0.0021003466],"category_scores_gemma":[0.0014522342,0.00013308926,0.00023311119,0.00056064053,0.0006251262,0.00073735375,0.0005810795,0.0009485815,0.00053883775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002364467,0.000070630114,0.0004682886,0.00053977646,0.00007182699,0.0002213136,0.00019060039,0.12486539,0.11235962,0.24137345,0.008733216,0.5108694],"study_design_scores_gemma":[0.00004218263,0.00017449747,0.0004351669,0.00005879181,0.00002865989,0.00047608675,0.00003716414,0.8917052,0.027664969,0.049702574,0.029635454,0.000039274644],"about_ca_topic_score_codex":0.0013558387,"about_ca_topic_score_gemma":0.001210144,"teacher_disagreement_score":0.0021003466,"about_ca_system_score_codex":0.00039874358,"about_ca_system_score_gemma":0.00034622388,"threshold_uncertainty_score":0.0070263743},"labels":[],"label_agreement":null},{"id":"W2151269805","doi":"","title":"Convex Relaxation of Mixture Regression with Efficient Algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semidefinite programming; Relaxation (psychology); Algorithm; Mathematical optimization; Convex optimization; Regular polygon; Matrix (chemical analysis); Mathematics; Maximum a posteriori estimation; Computer science; Matrix completion; Maximum likelihood; Gaussian; Statistics","score_opus":0.007312513597466893,"score_gpt":0.21481978929295334,"score_spread":0.20750727569548644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151269805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004161105,0.0000666053,0.99887305,0.00006339892,0.00000941114,0.000010833819,0.000016943332,0.00010823808,0.00043540873],"genre_scores_gemma":[0.058010127,0.00037942658,0.9361138,0.00016887802,0.00012445849,0.00032704766,0.00032168673,0.0003698914,0.0041846214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974273,0.0013784888,0.00010452388,0.00037554099,0.0005439754,0.00017019767],"domain_scores_gemma":[0.9955586,0.003193667,0.00028194967,0.00040155955,0.00045158563,0.00011255738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041972743,0.0022737342,0.0019395937,0.0010949413,0.00053543336,0.001874743,0.002264392,0.0022891369,0.0055868276],"category_scores_gemma":[0.01275708,0.0016552245,0.0019886827,0.0013692237,0.0015497523,0.0026605166,0.0034150518,0.0041421033,0.0026605267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012238635,0.000069795184,0.00022832531,0.00019063381,0.000090148795,0.000076378165,0.00009688199,0.8315748,0.002291793,0.09520222,0.0038011677,0.06625551],"study_design_scores_gemma":[0.00000874304,0.0000107255255,0.000019174095,0.000008249696,0.0000047195986,0.000013892403,0.000004554846,0.98482656,0.00038652166,0.013719238,0.0009915641,0.0000060771167],"about_ca_topic_score_codex":0.003203619,"about_ca_topic_score_gemma":0.0033153915,"teacher_disagreement_score":0.0055868276,"about_ca_system_score_codex":0.0012475691,"about_ca_system_score_gemma":0.0017373353,"threshold_uncertainty_score":0.022197545},"labels":[],"label_agreement":null},{"id":"W2152116910","doi":"","title":"Rank-One Matrix Pursuit for Matrix Completion","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matrix completion; Eight-point algorithm; Singular value decomposition; Low-rank approximation; Computer science; Algorithm; Matrix (chemical analysis); Scalability; Rank (graph theory); Matching pursuit; Convergence (economics); Sparse matrix; Matrix decomposition; Mathematical optimization; State-transition matrix; Mathematics; Symmetric matrix; Compressed sensing","score_opus":0.019936823300915816,"score_gpt":0.26220913240082716,"score_spread":0.24227230909991135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152116910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016604892,0.00013979449,0.99717015,0.0000823537,0.000022214439,0.000030314064,0.00002906766,0.00019996543,0.00066563574],"genre_scores_gemma":[0.13054097,0.0008500745,0.8628271,0.0001514635,0.00015854357,0.0003584686,0.0004358233,0.0001743645,0.0045031486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874747,0.00039228893,0.00006678901,0.000224704,0.00048552474,0.00008315777],"domain_scores_gemma":[0.99805284,0.0010035704,0.00017642745,0.00033993175,0.0003509358,0.00007619783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016546833,0.0014523255,0.0011775144,0.0008440643,0.0005702111,0.00083035836,0.0010989986,0.0011312739,0.0028313284],"category_scores_gemma":[0.0063487776,0.0004902785,0.0007535115,0.0015893142,0.0013517006,0.00161774,0.0017694059,0.0028126945,0.0016425906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002487521,0.00017512539,0.0005052764,0.00043710758,0.00010117165,0.00017126116,0.00019155159,0.5109071,0.019593779,0.1505466,0.009734653,0.30738756],"study_design_scores_gemma":[0.000017958251,0.000053721946,0.000066327055,0.000008215922,0.0000044697026,0.00003580633,0.000011696652,0.97444284,0.002390498,0.02083735,0.0021204092,0.0000107064],"about_ca_topic_score_codex":0.0029057192,"about_ca_topic_score_gemma":0.0030648573,"teacher_disagreement_score":0.0029057192,"about_ca_system_score_codex":0.00063646137,"about_ca_system_score_gemma":0.0016234376,"threshold_uncertainty_score":0.009471774},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Minification; Computer science; Algorithm; Extension (predicate logic); Mathematics","score_opus":0.021461781453337735,"score_gpt":0.24830981903981864,"score_spread":0.2268480375864809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152374199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018475212,0.020578634,0.93576235,0.0070241257,0.00043567288,0.00018216555,0.0019717475,0.0009252642,0.014644876],"genre_scores_gemma":[0.598096,0.044417117,0.32186508,0.004094795,0.0057827593,0.002099537,0.010147012,0.0013020412,0.012195653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98732924,0.004722626,0.00062091474,0.0021262816,0.004170786,0.0010301787],"domain_scores_gemma":[0.8242681,0.14606541,0.0075273053,0.013566088,0.0068687955,0.0017042287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021682769,0.0039160713,0.0035543817,0.0069484953,0.0027256163,0.0050785937,0.0058780587,0.0053094192,0.012575815],"category_scores_gemma":[0.15760489,0.0020130235,0.0028997834,0.009966679,0.009375037,0.015338088,0.0069620414,0.009475951,0.0026430453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069752935,0.00044521512,0.010895151,0.0022114206,0.00058319734,0.000516763,0.00068859896,0.32334492,0.0019602417,0.48432872,0.035045978,0.1392824],"study_design_scores_gemma":[0.00010079844,0.0001478688,0.0027817385,0.00040980414,0.00010084382,0.00046694904,0.00021998049,0.512844,0.0012515311,0.47202325,0.009542309,0.00011082173],"about_ca_topic_score_codex":0.00356344,"about_ca_topic_score_gemma":0.0021790692,"teacher_disagreement_score":0.021682769,"about_ca_system_score_codex":0.004693077,"about_ca_system_score_gemma":0.002995468,"threshold_uncertainty_score":0.11467081},"labels":[],"label_agreement":null},{"id":"W2152824512","doi":"10.1109/camsap.2009.5413327","title":"Segmented compressed sampling for analog-to-information conversion","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Innovative Research Group Project of the National Natural Science Foundation of China","keywords":"Compressed sensing; Sampling (signal processing); Computer science; SIGNAL (programming language); Algorithm; Pattern recognition (psychology); Artificial intelligence; Computer vision","score_opus":0.019469833004352677,"score_gpt":0.251926308412333,"score_spread":0.2324564754079803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152824512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073988056,0.00035524697,0.99009526,0.000106867104,0.00006302485,0.00004321636,0.00004648778,0.00017827966,0.001712813],"genre_scores_gemma":[0.2650332,0.0006014565,0.7310364,0.00019639666,0.00017485747,0.00015165926,0.00022030168,0.00004199534,0.0025436748],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.000118560805,0.000018105582,0.00005698601,0.00027439976,0.000027339447],"domain_scores_gemma":[0.99952984,0.00021889816,0.00003939868,0.000083832696,0.00010903293,0.00001898934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003329939,0.0004489438,0.00035305874,0.0005312266,0.00026906453,0.000438155,0.00056238525,0.0004830626,0.0015807027],"category_scores_gemma":[0.0013984691,0.00017011148,0.00026368292,0.00070939626,0.0004789734,0.00070569274,0.000506643,0.00057778246,0.00029498356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065758266,0.00010471028,0.0006843431,0.00037798256,0.00007721219,0.00036898706,0.00026248905,0.08673,0.1754698,0.084710285,0.0056256084,0.644931],"study_design_scores_gemma":[0.000058567584,0.00030520215,0.0006905217,0.000045485638,0.000038958427,0.0007475258,0.000043728844,0.8889874,0.0745288,0.0174933,0.017008606,0.00005188548],"about_ca_topic_score_codex":0.000877743,"about_ca_topic_score_gemma":0.0011661157,"teacher_disagreement_score":0.0015807027,"about_ca_system_score_codex":0.00035211167,"about_ca_system_score_gemma":0.00049046776,"threshold_uncertainty_score":0.005288005},"labels":[],"label_agreement":null},{"id":"W2153233902","doi":"10.1109/mmsp.2006.285271","title":"Adaptive Quantization for Matching Pursuit","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Quantization (signal processing); Matching pursuit; Encoder; Computer science; Algorithm; Matching (statistics); Probability distribution; Constraint (computer-aided design); Vector quantization; Mathematics; Compressed sensing; Statistics","score_opus":0.014564278829394768,"score_gpt":0.21699170947054133,"score_spread":0.20242743064114657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153233902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017230648,0.00024598237,0.9964079,0.00010736852,0.000048598467,0.000029451227,0.00002327381,0.00011599101,0.0012983164],"genre_scores_gemma":[0.25498116,0.00076974934,0.7391064,0.00031213806,0.00018046962,0.00018991751,0.00015306256,0.000075907796,0.0042311815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988024,0.00030970277,0.00006935273,0.00020580896,0.0005330617,0.0000796676],"domain_scores_gemma":[0.9990441,0.00039439896,0.00008239853,0.0001956046,0.00024280114,0.000040555675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011406167,0.00050887367,0.0006053099,0.00059346145,0.00044637767,0.000677868,0.0011431451,0.0009069835,0.0035644835],"category_scores_gemma":[0.00485158,0.00024932332,0.00036287485,0.0009499038,0.0008383132,0.0014694331,0.0014350167,0.0013268301,0.0008168911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003066091,0.00006180639,0.00037559384,0.00019771823,0.00004481467,0.00009051199,0.00010746555,0.1691863,0.029071055,0.41134346,0.00473294,0.3844817],"study_design_scores_gemma":[0.000048929625,0.00011266705,0.00010520399,0.000022381306,0.000011142864,0.00008761767,0.00001119036,0.9163569,0.006893435,0.06930645,0.007020904,0.000023111219],"about_ca_topic_score_codex":0.0012348708,"about_ca_topic_score_gemma":0.00088365487,"teacher_disagreement_score":0.0035644835,"about_ca_system_score_codex":0.0006584803,"about_ca_system_score_gemma":0.00079751346,"threshold_uncertainty_score":0.011924386},"labels":[],"label_agreement":null},{"id":"W2153290280","doi":"10.1109/tsp.2004.830985","title":"The Kernel Recursive Least-Squares Algorithm","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1096,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Algorithm; Kernel (algebra); Mathematics; Representation (politics); Bounded function; Least-squares function approximation; Signal processing; Recursive least squares filter; Nonlinear system; Computer science; Adaptive filter; Digital signal processing","score_opus":0.01365143437247462,"score_gpt":0.23140480291160861,"score_spread":0.217753368539134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153290280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015153766,0.000093392,0.9973341,0.00005329574,0.000018375635,0.000014218453,0.00002108566,0.00042107078,0.0005290806],"genre_scores_gemma":[0.08840895,0.00025028657,0.90622044,0.00008717221,0.000059551196,0.00008659766,0.0002170543,0.00023776403,0.0044322866],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931324,0.00020062063,0.000035464032,0.00013281008,0.00025578338,0.00006206041],"domain_scores_gemma":[0.9990933,0.00036246717,0.000073639705,0.00019179868,0.0002529807,0.000025842031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006720777,0.0007015046,0.000954402,0.00043663458,0.0003044298,0.00088700047,0.0012597266,0.0011025103,0.0032197682],"category_scores_gemma":[0.0031749273,0.0003844284,0.0005815771,0.00062417245,0.00057530164,0.001178191,0.000960481,0.0012577171,0.0030355123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014353915,0.00009886088,0.0008183257,0.00016711526,0.000099908095,0.00012649926,0.00011837041,0.4201665,0.015744315,0.045418154,0.0075378963,0.5095605],"study_design_scores_gemma":[0.000011008294,0.000021000993,0.00010418255,0.000004742711,0.000007949419,0.00005777667,0.000006283257,0.98821867,0.00265091,0.0047941273,0.0041125044,0.000010830104],"about_ca_topic_score_codex":0.0024186864,"about_ca_topic_score_gemma":0.002894219,"teacher_disagreement_score":0.0032197682,"about_ca_system_score_codex":0.00037757005,"about_ca_system_score_gemma":0.0010150379,"threshold_uncertainty_score":0.010771155},"labels":[],"label_agreement":null},{"id":"W2154672679","doi":"10.1109/icassp.2012.6288651","title":"Synthesis and analysis prior algorithms for joint-sparse recovery","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar National Research Fund","keywords":"Algorithm; Majorization; Joint (building); Computer science; Minification; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.03516752458134011,"score_gpt":0.24701305810423752,"score_spread":0.21184553352289742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154672679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053731713,0.00006114469,0.9987783,0.000035442477,0.000009615378,0.000011864024,0.000009096749,0.000119987286,0.00043724402],"genre_scores_gemma":[0.03938538,0.00035483736,0.9573145,0.00007118255,0.000059211856,0.000116372044,0.00016349385,0.00019104927,0.0023439175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992567,0.00021028846,0.00003664239,0.00012809713,0.00032944142,0.000038717695],"domain_scores_gemma":[0.99909616,0.0004238964,0.00007728909,0.00015331228,0.00022133719,0.000028111326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011420312,0.0011155355,0.0008147225,0.0010106864,0.00044127356,0.0007059624,0.00087428733,0.00093860016,0.004828278],"category_scores_gemma":[0.0030029395,0.0005707276,0.0008343259,0.00079912203,0.00091941527,0.0017238435,0.0014317313,0.0021392573,0.0021100843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020877804,0.00008995194,0.00034667755,0.00030561382,0.00007641304,0.000057090187,0.000116572206,0.18271004,0.04384426,0.10319468,0.003994544,0.66505533],"study_design_scores_gemma":[0.000040695955,0.00009224508,0.00020100908,0.000031740685,0.000029698675,0.0001559543,0.000024744932,0.9326448,0.026538013,0.028283125,0.011927882,0.000030068244],"about_ca_topic_score_codex":0.0010857555,"about_ca_topic_score_gemma":0.0015846164,"teacher_disagreement_score":0.004828278,"about_ca_system_score_codex":0.0005221487,"about_ca_system_score_gemma":0.0011316986,"threshold_uncertainty_score":0.016152203},"labels":[],"label_agreement":null},{"id":"W2155325918","doi":"10.1109/icme.2006.262407","title":"Optimization of Matching Pursuit Encoder Based on Analytical Approximation of Matching Pursuit Distortion","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Matching pursuit; Encoder; Distortion (music); Matching (statistics); Computer science; Algorithm; SIGNAL (programming language); Artificial intelligence; Mathematics; Telecommunications; Statistics","score_opus":0.009929863671307528,"score_gpt":0.2187146301667322,"score_spread":0.20878476649542468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155325918","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012673432,0.0001604747,0.9839175,0.000122024394,0.000015478208,0.00002422339,0.000029895296,0.00012144207,0.0029355385],"genre_scores_gemma":[0.683227,0.0004816704,0.31259525,0.00008441691,0.00004335323,0.00011921564,0.00010789255,0.000106642685,0.0032346102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.00021103787,0.00003346034,0.00009686079,0.0003150185,0.0000534369],"domain_scores_gemma":[0.9991955,0.00041390423,0.00010658637,0.00008761921,0.00017090475,0.000025381802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010520448,0.00077359274,0.0007171216,0.00035678386,0.00022762643,0.0007992644,0.00056047004,0.0006185197,0.0012229192],"category_scores_gemma":[0.0041096583,0.00028107225,0.00027578376,0.00050517236,0.0006047716,0.0010449045,0.000675735,0.00057965616,0.0004333418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021182955,0.000039483944,0.00048998697,0.00011301153,0.000040192954,0.00007888769,0.00005065301,0.84042186,0.027908739,0.081715316,0.00091849524,0.048011515],"study_design_scores_gemma":[0.000009827862,0.000035203593,0.000067188994,0.000006145054,0.0000052919045,0.000058912996,0.0000053704284,0.9878632,0.007726864,0.0038811916,0.00033273574,0.00000805489],"about_ca_topic_score_codex":0.0008476522,"about_ca_topic_score_gemma":0.0005930773,"teacher_disagreement_score":0.0012229192,"about_ca_system_score_codex":0.0009437596,"about_ca_system_score_gemma":0.0009634395,"threshold_uncertainty_score":0.006847501},"labels":[],"label_agreement":null},{"id":"W2155390387","doi":"10.1109/crv.2012.8","title":"Multi-Scale Saliency-Guided Compressive Sensing Approach to Efficient Robotic Laser Range Measurements","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Compressed sensing; Computer science; Range (aeronautics); Data acquisition; Laser; Scale (ratio); Artificial intelligence; Computer vision; Signal reconstruction; SIGNAL (programming language); Lidar; Iterative reconstruction; Signal processing; Remote sensing; Engineering; Optics; Physics; Digital signal processing; Geology","score_opus":0.08183042281198222,"score_gpt":0.2725713064898481,"score_spread":0.1907408836778659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155390387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013488128,0.00013919498,0.9855524,0.0000887693,0.0000128969195,0.00001564054,0.000014364685,0.00012893813,0.0005596931],"genre_scores_gemma":[0.46266016,0.00025603166,0.5357384,0.000091067,0.00008905385,0.00007358671,0.000082324674,0.000037077312,0.00097223715],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999726,0.00007124578,0.000010999726,0.00003934963,0.00013385313,0.000018554754],"domain_scores_gemma":[0.9995098,0.00022671209,0.00008198886,0.0000615207,0.00010108943,0.000018961147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031328923,0.00038212904,0.0003573881,0.00042001388,0.00021355193,0.00028088797,0.0005897811,0.00040864162,0.0007867917],"category_scores_gemma":[0.0012843522,0.00021780262,0.00021985378,0.0005184542,0.00039211786,0.00067425054,0.0006296398,0.00040124726,0.00016929109],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035616275,0.000109390545,0.0007998495,0.00024488443,0.00006064521,0.00021237393,0.000268171,0.29632306,0.20328839,0.021341003,0.002341693,0.4746544],"study_design_scores_gemma":[0.00001431565,0.00007917839,0.0003438447,0.0000055557293,0.000007633819,0.0001439557,0.000019321991,0.97511363,0.018972903,0.0038342283,0.0014511719,0.000014266722],"about_ca_topic_score_codex":0.0009367343,"about_ca_topic_score_gemma":0.0015118977,"teacher_disagreement_score":0.0009367343,"about_ca_system_score_codex":0.00026588124,"about_ca_system_score_gemma":0.00041165162,"threshold_uncertainty_score":0.002632022},"labels":[],"label_agreement":null},{"id":"W2155550045","doi":"10.1109/iscas.2011.5937919","title":"Unconstrained regularized &amp;#x2113;&lt;inf&gt;p&lt;/inf&gt;-norm based algorithm for the reconstruction of sparse signals","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Algorithm; Norm (philosophy); Computation; Signal reconstruction; Mathematics; Matrix (chemical analysis); Banach space; Computer science; Signal processing; Discrete mathematics; Telecommunications","score_opus":0.038892517602567206,"score_gpt":0.22697397373613656,"score_spread":0.18808145613356936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155550045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007505346,0.000066137334,0.9983242,0.0000528678,0.00002028048,0.000016218675,0.00002019163,0.00013758989,0.00061190466],"genre_scores_gemma":[0.021633308,0.00018512571,0.9747258,0.000057322366,0.00003639471,0.00011532357,0.0001301422,0.00007878001,0.0030378602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994905,0.000156589,0.000024383718,0.0000863934,0.00021863001,0.00002346946],"domain_scores_gemma":[0.9994006,0.00026957833,0.00006631582,0.00008567602,0.00015080023,0.00002698022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009031571,0.0007947175,0.0007726748,0.00065026537,0.000319308,0.00078996987,0.001077167,0.00093942636,0.0052432716],"category_scores_gemma":[0.002112593,0.0003457138,0.00056570256,0.00083659915,0.00071874354,0.0010954608,0.0008575746,0.0015336878,0.0020229993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025743493,0.00011719114,0.00039014497,0.0002921162,0.000094730305,0.00021176542,0.00016401461,0.34822932,0.033220787,0.08129592,0.010055381,0.5256711],"study_design_scores_gemma":[0.000021284559,0.00006817408,0.000102341124,0.000013006176,0.000008830635,0.00016776749,0.00001057673,0.9815974,0.006195011,0.005655122,0.006138389,0.000022149756],"about_ca_topic_score_codex":0.0013708227,"about_ca_topic_score_gemma":0.0019503235,"teacher_disagreement_score":0.0052432716,"about_ca_system_score_codex":0.0005545246,"about_ca_system_score_gemma":0.0011216283,"threshold_uncertainty_score":0.017540514},"labels":[],"label_agreement":null},{"id":"W2156292736","doi":"10.1109/icip.2010.5653685","title":"Compressive color imaging with group-sparsity on analysis prior","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Constraint (computer-aided design); Group (periodic table); Inverse problem; Inverse; Minification; Mathematical optimization; Algorithm; Computer science; Image (mathematics); Majorization; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.005401746929287178,"score_gpt":0.20245217269481475,"score_spread":0.19705042576552756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156292736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018706653,0.00013204961,0.9770066,0.00024764074,0.00002681579,0.000033403416,0.000041586656,0.00020900505,0.0035963214],"genre_scores_gemma":[0.30536523,0.00045801015,0.6900717,0.00022633008,0.00010764574,0.0001035523,0.00017492266,0.00009473177,0.0033979292],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947566,0.0001742345,0.000013716974,0.0000650283,0.00023748986,0.0000339122],"domain_scores_gemma":[0.9993086,0.0003397577,0.00007797465,0.00011992398,0.00012860628,0.000024990642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005781923,0.0006696041,0.00051660975,0.0003812305,0.00024291349,0.0005266796,0.00042342074,0.000635428,0.0016214565],"category_scores_gemma":[0.0018428091,0.00027492922,0.00044230954,0.0004865461,0.00084134977,0.0009486163,0.0010310841,0.0008601996,0.0006616186],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005756437,0.00018789874,0.00096682383,0.00035695502,0.00007280128,0.00025380426,0.00022419177,0.22382656,0.31899107,0.10900651,0.00463716,0.34090057],"study_design_scores_gemma":[0.0000427105,0.00016466781,0.00045771344,0.000025238734,0.000032409,0.00025634342,0.000037883674,0.9026427,0.074097395,0.016873473,0.005341115,0.000028389963],"about_ca_topic_score_codex":0.0008904787,"about_ca_topic_score_gemma":0.0011779576,"teacher_disagreement_score":0.0016214565,"about_ca_system_score_codex":0.00035423823,"about_ca_system_score_gemma":0.0006532544,"threshold_uncertainty_score":0.0054243207},"labels":[],"label_agreement":null},{"id":"W2156642959","doi":"10.1109/cjece.2009.5599420","title":"Fast group sparse classification","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Classifier (UML); Sparse approximation; Optimization problem; Random projection; Minification; Robustness (evolution); Pattern recognition (psychology); Linear programming; Artificial intelligence; Algorithm; Mathematical optimization; Computer science","score_opus":0.008920718750992356,"score_gpt":0.17366588095031796,"score_spread":0.1647451621993256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156642959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013181187,0.00038314582,0.98211515,0.0005236211,0.000168584,0.0001429315,0.00025091288,0.0010814631,0.002153034],"genre_scores_gemma":[0.25151953,0.0004094734,0.73899025,0.00062733487,0.0004125848,0.00037510498,0.0017363337,0.00018895228,0.0057404195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977482,0.00061228336,0.000070489616,0.0003310975,0.0010031104,0.00023478059],"domain_scores_gemma":[0.9954165,0.0019068663,0.0003407102,0.0010555369,0.0011537928,0.000126607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024085015,0.0010989712,0.0020198855,0.0018461223,0.00088780286,0.0011652169,0.0019630706,0.0024578657,0.0049685827],"category_scores_gemma":[0.0083421115,0.0004166678,0.000870944,0.0021753688,0.0008337144,0.0023466742,0.002050844,0.0021463996,0.002556457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068262144,0.00023438332,0.0022584167,0.00018810449,0.00012569538,0.00017053,0.00022960587,0.114705205,0.007268429,0.023357756,0.031538844,0.8192404],"study_design_scores_gemma":[0.000050522918,0.00009706715,0.0003958469,0.000013887523,0.000018177914,0.0001137911,0.000047240388,0.9705551,0.0034470563,0.020513399,0.0047350246,0.000012891289],"about_ca_topic_score_codex":0.0024329813,"about_ca_topic_score_gemma":0.0032241282,"teacher_disagreement_score":0.0049685827,"about_ca_system_score_codex":0.0007271507,"about_ca_system_score_gemma":0.0012280851,"threshold_uncertainty_score":0.01662159},"labels":[],"label_agreement":null},{"id":"W2157032832","doi":"10.1109/icip.2009.5414417","title":"Compressive-uniform hybrid sensing for image acquisition and communication","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Compressed sensing; Computer science; Sampling (signal processing); Multispectral image; Computer vision; Iterative reconstruction; Artificial intelligence; SIGNAL (programming language); Coding (social sciences); Mathematics; Statistics","score_opus":0.009961581658628819,"score_gpt":0.23625808863333048,"score_spread":0.22629650697470166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157032832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034857143,0.0006165547,0.9931814,0.00018138693,0.0000616271,0.000021281088,0.00001747304,0.00013419734,0.0023003027],"genre_scores_gemma":[0.3805777,0.0016712351,0.6091284,0.0005844328,0.00041874376,0.00022751262,0.00015654894,0.00007362914,0.007161826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933964,0.00020778859,0.000023251774,0.00011417191,0.00027380214,0.00004142267],"domain_scores_gemma":[0.9995425,0.0002199443,0.000034173325,0.000108704146,0.000074179785,0.000020436515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056382176,0.0005612024,0.00046358886,0.000347985,0.00030600347,0.000612301,0.0008835319,0.0006983944,0.0016843715],"category_scores_gemma":[0.0014432356,0.00020705009,0.0002918936,0.00047233616,0.0009004239,0.0011854068,0.0012818878,0.00080158736,0.00048780668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034044738,0.00008424984,0.0005869873,0.00034788362,0.0000899311,0.0002448671,0.0001800066,0.15209338,0.1005039,0.36946747,0.0068714605,0.36918932],"study_design_scores_gemma":[0.000029604955,0.00017011068,0.00027738189,0.000024090015,0.000029838002,0.00031016866,0.000033539516,0.90625656,0.026866617,0.0498619,0.016103044,0.000037196165],"about_ca_topic_score_codex":0.00050238194,"about_ca_topic_score_gemma":0.0005967376,"teacher_disagreement_score":0.0016843715,"about_ca_system_score_codex":0.0003459019,"about_ca_system_score_gemma":0.00034165592,"threshold_uncertainty_score":0.0056347847},"labels":[],"label_agreement":null},{"id":"W2157298651","doi":"10.1109/icapr.2009.11","title":"Classification by Linearity Assumption","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Classifier (UML); Computer science; Artificial intelligence; Margin classifier; Support vector machine; Nearest neighbour; Linear classifier; Machine learning; Pattern recognition (psychology); Quadratic classifier; Generalization; Mathematics","score_opus":0.019204152117172316,"score_gpt":0.2428294563105835,"score_spread":0.2236253041934112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157298651","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012320335,0.0008294709,0.9770091,0.0014443463,0.00014284214,0.000114546805,0.00028739122,0.00044765018,0.007404255],"genre_scores_gemma":[0.5951772,0.0027458826,0.36890918,0.002571832,0.0020740177,0.0011965863,0.0027341433,0.0002329748,0.024358211],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937137,0.0016559499,0.00038310903,0.0016493296,0.0020847789,0.00051315007],"domain_scores_gemma":[0.99052215,0.0048005455,0.00069654884,0.0021494,0.0016982616,0.00013316478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051653855,0.0008611784,0.0016525193,0.001415872,0.0010959223,0.0023990613,0.0026017334,0.0022223028,0.0054250853],"category_scores_gemma":[0.019170327,0.00068100425,0.0018217328,0.0014396152,0.0030442553,0.0054279855,0.0029480457,0.0036686936,0.005930867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007173924,0.00024046644,0.009547078,0.0008494842,0.00034679714,0.0009882855,0.0009560002,0.0822829,0.021698045,0.30320448,0.02858582,0.5505832],"study_design_scores_gemma":[0.00006699565,0.0005278159,0.0033938102,0.00016741431,0.00014471448,0.0020022679,0.00024744947,0.6643108,0.01921313,0.27385786,0.035953224,0.000114398565],"about_ca_topic_score_codex":0.001729537,"about_ca_topic_score_gemma":0.0011246154,"teacher_disagreement_score":0.0054250853,"about_ca_system_score_codex":0.001128817,"about_ca_system_score_gemma":0.0009325432,"threshold_uncertainty_score":0.027317464},"labels":[],"label_agreement":null},{"id":"W2158075440","doi":"10.1049/iet-spr.2012.0386","title":"Adaptive efficient sparse estimator achieving oracle properties","year":2013,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Oracle; Penalty method; Estimator; Algorithm; Context (archaeology); Lasso (programming language); Mathematical optimization; Computer science; SIGNAL (programming language); Mean squared error; Function (biology); Signal reconstruction; Mathematics; Signal processing; Statistics","score_opus":0.02499018661119706,"score_gpt":0.2120527107247888,"score_spread":0.18706252411359173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158075440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049489355,0.00008117886,0.9941626,0.000061125094,0.000010021541,0.000009808195,0.000016252317,0.00008869518,0.0006214244],"genre_scores_gemma":[0.3904966,0.0005672186,0.6041603,0.00018794522,0.00011569575,0.00013381886,0.00024597437,0.00012089157,0.0039714817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994203,0.00021272035,0.000022437542,0.00006927588,0.00023104143,0.000044292232],"domain_scores_gemma":[0.9985921,0.00088520686,0.0001284049,0.00012396887,0.00022531468,0.000044913326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011300547,0.00068691536,0.00074128615,0.0003018461,0.00017263113,0.00058891124,0.0006153677,0.000860037,0.0012600039],"category_scores_gemma":[0.0043543847,0.00022569485,0.0004184842,0.00049595296,0.00051557005,0.00094091066,0.0011364488,0.0012199257,0.00043869705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026733786,0.00008548332,0.0010866794,0.00024427247,0.000061779894,0.00022752916,0.00012620621,0.7238594,0.038904447,0.066702075,0.0034730255,0.16496164],"study_design_scores_gemma":[0.000008009891,0.000032142852,0.00010514851,0.000004389791,0.0000032879582,0.00005846683,0.000005302486,0.9943857,0.0025693278,0.0023099342,0.000513327,0.0000050110993],"about_ca_topic_score_codex":0.0008001408,"about_ca_topic_score_gemma":0.00089033996,"teacher_disagreement_score":0.0012600039,"about_ca_system_score_codex":0.00022517446,"about_ca_system_score_gemma":0.0006756841,"threshold_uncertainty_score":0.005976379},"labels":[],"label_agreement":null},{"id":"W2158469249","doi":"","title":"Sample-based approximate regularization","year":2014,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Parameterized complexity; Regularization (linguistics); Fidelity; Computer science; Applied mathematics; Mathematical optimization; Algorithm; Sampling (signal processing); Sample (material); Mathematics; Artificial intelligence","score_opus":0.009271348263953918,"score_gpt":0.203391210192283,"score_spread":0.19411986192832908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158469249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012418098,0.00007366087,0.9979632,0.00005102709,0.000021215541,0.000011169265,0.000030474434,0.00014000255,0.00046748368],"genre_scores_gemma":[0.11231226,0.00043807246,0.88035214,0.00030987264,0.00015288604,0.00019093067,0.00044621853,0.00033116597,0.0054664277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883264,0.0003635216,0.000043713226,0.00016138327,0.00053919444,0.0000595961],"domain_scores_gemma":[0.99840873,0.0006567115,0.00014916033,0.0004764549,0.00024235161,0.0000667129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015142873,0.0010051276,0.0011263577,0.000893329,0.00037905868,0.0012206377,0.0018045522,0.0017405222,0.003127394],"category_scores_gemma":[0.00544751,0.00051075354,0.0009441053,0.0009971705,0.001183707,0.0018624478,0.001975101,0.002661424,0.0012661545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021564355,0.00011162577,0.0008902304,0.00029658206,0.00015962671,0.00015280033,0.00014606824,0.5902226,0.031545307,0.17919217,0.008989525,0.18807778],"study_design_scores_gemma":[0.0000069405205,0.00002720129,0.00007283067,0.0000079811725,0.000005841618,0.000058747275,0.0000056140425,0.98030955,0.0023969791,0.013720553,0.0033782925,0.000009422252],"about_ca_topic_score_codex":0.0014389922,"about_ca_topic_score_gemma":0.0019452631,"teacher_disagreement_score":0.003127394,"about_ca_system_score_codex":0.0007372006,"about_ca_system_score_gemma":0.00095267856,"threshold_uncertainty_score":0.010462165},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subspace topology; 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","score_opus":0.027349207259148738,"score_gpt":0.24446889904668842,"score_spread":0.21711969178753968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158703881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001306108,0.00011273939,0.99780005,0.00006456217,0.000010080679,0.000014679168,0.000045405406,0.0001463876,0.00049985474],"genre_scores_gemma":[0.19935413,0.000856161,0.7937003,0.00023443002,0.00014142058,0.0002201317,0.0012489663,0.00018627112,0.004058201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989489,0.00040364618,0.000044299086,0.00021968584,0.00031966995,0.00006389492],"domain_scores_gemma":[0.9985921,0.00061967655,0.00012851186,0.00032654003,0.00026840123,0.00006472665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009990551,0.0013539225,0.0017502026,0.0006338611,0.0004093545,0.0010673673,0.0014754751,0.0012130471,0.0027414074],"category_scores_gemma":[0.0041152374,0.00059805455,0.0008036271,0.0013799545,0.0010194863,0.0017279021,0.0017752866,0.0020524208,0.0013883295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014673133,0.000091813374,0.00057154655,0.00021974821,0.00011572477,0.00014257405,0.00009338756,0.65351033,0.008635802,0.050846264,0.01103453,0.27459148],"study_design_scores_gemma":[0.00000571684,0.000019573763,0.0000726527,0.0000053847107,0.0000035317835,0.0000449823,0.000008019171,0.9880477,0.0012089296,0.009498934,0.0010769538,0.0000075516423],"about_ca_topic_score_codex":0.0023947763,"about_ca_topic_score_gemma":0.0024753825,"teacher_disagreement_score":0.0027414074,"about_ca_system_score_codex":0.0005933212,"about_ca_system_score_gemma":0.00078692095,"threshold_uncertainty_score":0.00917089},"labels":[],"label_agreement":null},{"id":"W2158788806","doi":"10.1109/icme.2006.262404","title":"Novel Progressive Region of Interest Image Coding Based on Matching Pursuits","year":2006,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Region of interest; Coding (social sciences); Computer science; Computer vision; Computational complexity theory; Matching (statistics); Artificial intelligence; Image (mathematics); Scalability; Matching pursuit; Transmitter; Image quality; Pattern recognition (psychology); Algorithm; Mathematics; Telecommunications; Statistics; Compressed sensing","score_opus":0.035084625673444676,"score_gpt":0.24633267637828016,"score_spread":0.2112480507048355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158788806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065577216,0.00023328274,0.9915398,0.00006422088,0.000030032455,0.000034644236,0.000028568596,0.00021163639,0.0012999832],"genre_scores_gemma":[0.2092968,0.00067631254,0.78516257,0.00013620111,0.00008496742,0.00014220276,0.00017726437,0.00006952784,0.0042541726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995845,0.00008596886,0.000016315511,0.000052832514,0.00021746337,0.000042966993],"domain_scores_gemma":[0.9996049,0.00014379324,0.000052283285,0.00007867679,0.000092320566,0.000027990885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048484126,0.0004942097,0.0005231271,0.00053577725,0.0002227763,0.0004616776,0.0010999942,0.0005099409,0.001238113],"category_scores_gemma":[0.0014869396,0.00019849435,0.0003432689,0.00079405744,0.00044589606,0.0009923573,0.0011032148,0.00085701136,0.0004954663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048537,0.0001211695,0.00038940867,0.00022384785,0.00006087343,0.00041187552,0.00021477346,0.12940718,0.22090305,0.1027954,0.0048227096,0.5401643],"study_design_scores_gemma":[0.00003842163,0.0001818077,0.00019352885,0.000019898556,0.000016848115,0.00035508152,0.000018860015,0.9511406,0.03271476,0.008756999,0.00653756,0.000025710724],"about_ca_topic_score_codex":0.0010983314,"about_ca_topic_score_gemma":0.0012238486,"teacher_disagreement_score":0.001238113,"about_ca_system_score_codex":0.00026957577,"about_ca_system_score_gemma":0.0005470714,"threshold_uncertainty_score":0.004141867},"labels":[],"label_agreement":null},{"id":"W2158898601","doi":"10.1287/moor.1100.0473","title":"On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Semidefinite programming; Quadratically constrained quadratic program; Mathematics; Semidefinite embedding; Quadratic growth; Quadratic programming; Relaxation (psychology); Equivalence (formal languages); Positive-definite matrix; Mathematical optimization; Second-order cone programming; Matrix (chemical analysis); Quadratic equation; Representation (politics); Applied mathematics; Discrete mathematics; Algorithm; Convex optimization","score_opus":0.22194514997965425,"score_gpt":0.40085174523395956,"score_spread":0.1789065952543053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158898601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01464768,0.0008564943,0.96177715,0.0011626935,0.00013984993,0.00012511916,0.00017452224,0.00016725909,0.020949312],"genre_scores_gemma":[0.51537395,0.0036419395,0.46039626,0.0019820775,0.0010548214,0.0011124185,0.0010547767,0.0008382873,0.014545469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993601,0.0029828926,0.0002555676,0.00077869825,0.0017489,0.00063285924],"domain_scores_gemma":[0.96766204,0.02631798,0.0018116662,0.0013363829,0.002024366,0.00084757607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010540574,0.0030822968,0.0015061314,0.0018042385,0.00094060414,0.0032911394,0.0021762725,0.0019001837,0.0098310765],"category_scores_gemma":[0.038780253,0.000873388,0.0016372621,0.0020421408,0.0044922023,0.006278197,0.0046461066,0.009406665,0.0015631119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025405394,0.0004122444,0.0004779775,0.00043936286,0.00006713532,0.00018477689,0.00048126234,0.16690591,0.0029196606,0.7718031,0.005893407,0.050161052],"study_design_scores_gemma":[0.00005279481,0.00027031638,0.00028414442,0.00011108695,0.00002155672,0.00010465822,0.00013681334,0.5318713,0.001305794,0.46251023,0.0032932484,0.00003802236],"about_ca_topic_score_codex":0.0012244508,"about_ca_topic_score_gemma":0.0010671873,"teacher_disagreement_score":0.010540574,"about_ca_system_score_codex":0.0022206383,"about_ca_system_score_gemma":0.0013540367,"threshold_uncertainty_score":0.05574453},"labels":[],"label_agreement":null},{"id":"W2161950100","doi":"10.1109/tsp.2010.2091411","title":"Segmented Compressed Sampling for Analog-to-Information Conversion: Method and Performance Analysis","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Sampling (signal processing); Compressed sensing; Signal processing; Artificial intelligence; Computer vision; Telecommunications","score_opus":0.019403708358905453,"score_gpt":0.2706925824291812,"score_spread":0.2512888740702758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161950100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037602633,0.00031083846,0.99486864,0.00009090122,0.000024824625,0.00003519942,0.000019378607,0.00012349992,0.0007664531],"genre_scores_gemma":[0.28069007,0.0011583514,0.71570176,0.00014934607,0.00016527085,0.00023966428,0.00019485908,0.000075332915,0.0016253664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988751,0.00030103835,0.00003603691,0.0000859189,0.0006554603,0.000046313497],"domain_scores_gemma":[0.9979532,0.0011694478,0.00014147998,0.0002595689,0.00043158318,0.000044736473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012289006,0.00077807007,0.0004775337,0.00078404706,0.00027665094,0.00068771484,0.00079691486,0.0007459625,0.0016864744],"category_scores_gemma":[0.004220459,0.00022984306,0.0003651269,0.0009592336,0.00084293744,0.0010662052,0.0008197199,0.0009129186,0.0004312515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008219825,0.00015621584,0.0017752826,0.0007564136,0.00019327334,0.0003819906,0.00033463308,0.31115648,0.09010965,0.1328404,0.0044073127,0.4570664],"study_design_scores_gemma":[0.000018123648,0.000093461254,0.0002530368,0.000018744984,0.000017512182,0.00027458317,0.000013814093,0.9782839,0.014909622,0.003989266,0.0021069022,0.000021154972],"about_ca_topic_score_codex":0.0017173543,"about_ca_topic_score_gemma":0.0012727112,"teacher_disagreement_score":0.0017173543,"about_ca_system_score_codex":0.00069323374,"about_ca_system_score_gemma":0.00087985385,"threshold_uncertainty_score":0.0064991117},"labels":[],"label_agreement":null},{"id":"W2161976586","doi":"10.1109/tcsii.2013.2268433","title":"Pilot Allocation for Sparse Channel Estimation in MIMO-OFDM Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Mutual coherence; MIMO; MIMO-OFDM; Channel (broadcasting); Computer science; Algorithm; Bit error rate; Coherence time; Coherence (philosophical gambling strategy); Compressed sensing; Mean squared error; Electronic engineering; Mathematics; Telecommunications; Engineering; Statistics","score_opus":0.03140630475192765,"score_gpt":0.23517978633071493,"score_spread":0.20377348157878727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161976586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028618017,0.00023279582,0.9703043,0.00009225267,0.000019549987,0.000017023222,0.000013854466,0.000088676315,0.0006134629],"genre_scores_gemma":[0.7747277,0.00038095712,0.22413243,0.00005923343,0.000048986585,0.00007187259,0.000042197356,0.000013914998,0.0005227748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997272,0.0001329703,0.000011498049,0.000030343057,0.000075742304,0.000022242048],"domain_scores_gemma":[0.99927074,0.00049260125,0.00007181788,0.0000728038,0.00007504517,0.000016934307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043342737,0.0002736799,0.00028091206,0.00019297088,0.00017419734,0.00024717394,0.00027423914,0.00034869649,0.00044337186],"category_scores_gemma":[0.0023133447,0.00015721575,0.00013090392,0.00029944413,0.00040569654,0.00043727603,0.00038206822,0.0003054686,0.00012382516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037450343,0.0000840576,0.0010552437,0.00017093788,0.000042771288,0.00022432278,0.00018461564,0.67491525,0.04767396,0.029309195,0.0012301344,0.24473502],"study_design_scores_gemma":[0.00001698101,0.000072420364,0.00016935766,0.000008571403,0.000007169041,0.000052245217,0.000012253962,0.9904697,0.004741605,0.0039988677,0.000445065,0.0000056834792],"about_ca_topic_score_codex":0.0005629615,"about_ca_topic_score_gemma":0.0007611978,"teacher_disagreement_score":0.0005629615,"about_ca_system_score_codex":0.00014636372,"about_ca_system_score_gemma":0.00040471827,"threshold_uncertainty_score":0.0022922158},"labels":[],"label_agreement":null},{"id":"W2162368398","doi":"10.1109/isit.1994.394822","title":"On restoration of band-limited signals from noisy observations","year":2002,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Convergence (economics); Computer science; Artificial intelligence; Algorithm","score_opus":0.06334517889178719,"score_gpt":0.22231882499296757,"score_spread":0.15897364610118037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162368398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077915885,0.0007868835,0.9894537,0.00028545887,0.000081269995,0.000017389602,0.00003468145,0.00009208193,0.001456997],"genre_scores_gemma":[0.3574917,0.0069781155,0.6186465,0.00045696588,0.0006960688,0.00020005813,0.00042933662,0.00018673328,0.014914495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952793,0.00018336013,0.000016244983,0.00010025387,0.00013550771,0.00003682658],"domain_scores_gemma":[0.9989813,0.00069103134,0.000115433584,0.00008825458,0.000096256044,0.000027788072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097128184,0.0010300266,0.0009802053,0.0005495389,0.000417994,0.00095152477,0.00076009415,0.0017576355,0.0014762846],"category_scores_gemma":[0.0038492302,0.00029557475,0.00048196226,0.00077743304,0.00218425,0.001514653,0.0012258856,0.0012550977,0.0005395501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034012838,0.00009876462,0.00041925051,0.00089621637,0.000087889995,0.00036657066,0.00036028022,0.59031105,0.026357623,0.19788237,0.0055432054,0.17733666],"study_design_scores_gemma":[0.000022865313,0.00012522665,0.0002084854,0.000033289587,0.000019522537,0.00020442659,0.000052355295,0.8914911,0.006190573,0.096900664,0.0047258604,0.000025598802],"about_ca_topic_score_codex":0.0012049915,"about_ca_topic_score_gemma":0.00076960353,"teacher_disagreement_score":0.0017576355,"about_ca_system_score_codex":0.00029424034,"about_ca_system_score_gemma":0.00044240948,"threshold_uncertainty_score":0.0051367283},"labels":[],"label_agreement":null},{"id":"W2162546528","doi":"10.1080/10556788.2014.968158","title":"A derivative-free comirror algorithm for convex optimization","year":2014,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Mathematical optimization; Convex function; Rate of convergence; Interpolation (computer graphics); Convex optimization; Convex combination; Convergence (economics); Algorithm; Regular polygon; Computer science; Key (lock)","score_opus":0.021308854748996735,"score_gpt":0.3018796195636025,"score_spread":0.28057076481460574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162546528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014571396,0.0001143168,0.99719363,0.0000898091,0.000032527503,0.000022587363,0.000012726857,0.00008388102,0.0009933858],"genre_scores_gemma":[0.07288168,0.00028668658,0.9230063,0.00015620899,0.00007149389,0.0001410169,0.00008692781,0.00012216654,0.0032474946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934655,0.00016036247,0.000035306162,0.00012481601,0.0002890825,0.000043889315],"domain_scores_gemma":[0.999298,0.00036427722,0.00005992051,0.00010341307,0.00012993772,0.00004445849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011975038,0.0008674105,0.00096476125,0.00043318054,0.00036141256,0.0009040802,0.0014863167,0.0014271996,0.0025517386],"category_scores_gemma":[0.0035618541,0.0004212975,0.00070166704,0.00054629234,0.000930931,0.001134007,0.001800405,0.0021561207,0.0008270544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023205948,0.00011159535,0.0006902816,0.00034069974,0.000079823076,0.00020567447,0.00017127016,0.5973629,0.0185251,0.11686431,0.004664265,0.2607521],"study_design_scores_gemma":[0.00001941396,0.00005110874,0.000047280028,0.000014262329,0.0000042378774,0.00006220084,0.000007888245,0.9874326,0.0027576596,0.006860238,0.0027340367,0.000009008109],"about_ca_topic_score_codex":0.0013115465,"about_ca_topic_score_gemma":0.001819621,"teacher_disagreement_score":0.0025517386,"about_ca_system_score_codex":0.00060803565,"about_ca_system_score_gemma":0.0010980311,"threshold_uncertainty_score":0.008536398},"labels":[],"label_agreement":null},{"id":"W2163293561","doi":"10.1109/tsp.2010.2046900","title":"Minimizing Nonconvex Functions for Sparse Vector Reconstruction","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Underdetermined system; Orthant; Algorithm; Iterative method; Mathematics; Convex function; Convergence (economics); Mathematical optimization; Computer science; Function (biology); Regular polygon; Applied mathematics","score_opus":0.0202084291336054,"score_gpt":0.23537793495599832,"score_spread":0.21516950582239291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163293561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010202731,0.00008634395,0.9985556,0.00004720257,0.0000072233497,0.000008648195,0.00000704091,0.0000451403,0.00022247797],"genre_scores_gemma":[0.091215394,0.0010059973,0.90261316,0.00018723651,0.0001437299,0.00018954824,0.0002670699,0.00025360365,0.0041242624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987508,0.00046787225,0.000053574815,0.00023261453,0.00041725923,0.00007777907],"domain_scores_gemma":[0.9983493,0.0008696926,0.00020445389,0.00018414657,0.00034320788,0.000049147377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026561022,0.0017888492,0.0013720172,0.0012032293,0.0004436099,0.0010616053,0.0012460379,0.0013486885,0.0013521622],"category_scores_gemma":[0.0044595837,0.0006571919,0.0009851411,0.0009306711,0.001552561,0.0016694567,0.0013880116,0.0017035827,0.0008357267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071206596,0.000058660153,0.0004217745,0.00028677026,0.00008575412,0.000117889664,0.00015378365,0.7875812,0.0130831525,0.07658122,0.0020278296,0.11953067],"study_design_scores_gemma":[0.0000042814486,0.000032544856,0.000066116525,0.000010750778,0.0000075201406,0.000034208024,0.000010879787,0.98772615,0.0030133727,0.0074120187,0.0016729714,0.0000091630445],"about_ca_topic_score_codex":0.0019575702,"about_ca_topic_score_gemma":0.0019067453,"teacher_disagreement_score":0.0026561022,"about_ca_system_score_codex":0.00097122166,"about_ca_system_score_gemma":0.0012114893,"threshold_uncertainty_score":0.014046967},"labels":[],"label_agreement":null},{"id":"W2164383578","doi":"10.1109/cvpr.2009.5206561","title":"Fast normalized cut with linear constraints","year":2009,"lang":"en","type":"article","venue":"2009 IEEE Conference on Computer Vision and Pattern Recognition","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Computation; Variety (cybernetics); Image segmentation; Segmentation; Linear programming; Algorithm; Image (mathematics); Maximum cut; Artificial intelligence; Mathematics; Theoretical computer science","score_opus":0.030940896597026625,"score_gpt":0.25371802396152515,"score_spread":0.22277712736449853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164383578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024611747,0.00022916782,0.9944384,0.0001647366,0.000041229778,0.00006115185,0.0001256781,0.0005267872,0.001951689],"genre_scores_gemma":[0.07842771,0.00037550053,0.91493857,0.00024829246,0.00008268744,0.0003889495,0.0008554498,0.0004868722,0.004196032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981389,0.00058711553,0.00009333678,0.00031736848,0.0006756782,0.00018759668],"domain_scores_gemma":[0.99597603,0.002649275,0.0002418492,0.00036646385,0.0006440001,0.00012236477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754622,0.0017813848,0.0016925161,0.0013195624,0.0007853066,0.0021384687,0.0018765955,0.0025960847,0.012160303],"category_scores_gemma":[0.009739893,0.0009590521,0.0008760639,0.0024111795,0.0011949344,0.0034344674,0.002473737,0.0028516434,0.0023730688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039111084,0.00011786496,0.0003475286,0.00038269509,0.000065423286,0.00020976852,0.00013974616,0.6076863,0.0064432467,0.087566756,0.02159353,0.2750561],"study_design_scores_gemma":[0.00003577492,0.000041546562,0.00006226727,0.0000261218,0.000006793437,0.00008497155,0.000030293262,0.951818,0.0020555933,0.041291,0.004533487,0.000014141897],"about_ca_topic_score_codex":0.0036840898,"about_ca_topic_score_gemma":0.005237756,"teacher_disagreement_score":0.012160303,"about_ca_system_score_codex":0.0012816357,"about_ca_system_score_gemma":0.0024080628,"threshold_uncertainty_score":0.04068029},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01406182111473949,"score_gpt":0.22057492508954687,"score_spread":0.20651310397480738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166107799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049893344,0.00021589398,0.99274653,0.00019990004,0.00002602489,0.000044392902,0.000031698746,0.00031717357,0.0014290048],"genre_scores_gemma":[0.32039064,0.0007433142,0.6721972,0.0004090204,0.00015652603,0.00072324334,0.0003121126,0.00068934506,0.004378588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999025,0.00048417193,0.000052842184,0.00015672937,0.00021635066,0.00006483479],"domain_scores_gemma":[0.99829537,0.0010336307,0.0001506405,0.00019466925,0.00028270748,0.000042897052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026362373,0.0018364483,0.0013406888,0.00084624876,0.00057763874,0.001361608,0.0011603837,0.0017181336,0.0026881834],"category_scores_gemma":[0.01129065,0.00087743736,0.0005642779,0.00073120574,0.0015821574,0.0023401836,0.0013310063,0.0020908923,0.0014563015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000896578,0.00006528314,0.0005526655,0.00016583894,0.00007661761,0.00004750532,0.00007980233,0.8427498,0.006531926,0.043376215,0.0030166686,0.10324812],"study_design_scores_gemma":[0.000021627367,0.000030421656,0.00015085434,0.00002778442,0.000010748298,0.000022515986,0.000010474192,0.97446465,0.001988996,0.021700807,0.0015566931,0.000014328734],"about_ca_topic_score_codex":0.0016513609,"about_ca_topic_score_gemma":0.0018770188,"teacher_disagreement_score":0.0026881834,"about_ca_system_score_codex":0.0009447302,"about_ca_system_score_gemma":0.0015167097,"threshold_uncertainty_score":0.013941944},"labels":[],"label_agreement":null},{"id":"W2166384681","doi":"10.1109/isic.1994.367842","title":"Target detection in fused X-band radar and IR images using the functional minimization approach to data association","year":2002,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Motorola (Canada)","funders":"","keywords":"Fuse (electrical); Radar; Computer science; Artificial intelligence; Sensor fusion; Computer vision; Process (computing); Image (mathematics); Association (psychology); Image fusion; Minification; Radar imaging; Image sensor; Pattern recognition (psychology); Engineering; Telecommunications","score_opus":0.049292909025617865,"score_gpt":0.22109553412276817,"score_spread":0.1718026250971503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166384681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021993276,0.00009433388,0.97713506,0.00017564022,0.000010358242,0.0000079316305,0.00001387337,0.00009458367,0.00047493557],"genre_scores_gemma":[0.46755555,0.00035820718,0.52959216,0.0001311996,0.00007380534,0.00004238082,0.00013785339,0.000048857124,0.0020600546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993599,0.00026311298,0.000028457369,0.0000981436,0.00021687815,0.000033587046],"domain_scores_gemma":[0.9992637,0.00040525652,0.00011152045,0.00008458911,0.00011155481,0.000023481036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011121337,0.0003378739,0.00038569886,0.000635723,0.0002047465,0.0006775499,0.0004735662,0.0005625471,0.0005522657],"category_scores_gemma":[0.0027952816,0.00023550265,0.0004014433,0.0005229785,0.0006419993,0.0010569451,0.00080761977,0.0005440937,0.00017891091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003712706,0.00012809716,0.0019215803,0.000157676,0.00013146535,0.00018940309,0.0003420922,0.588051,0.044524655,0.04116346,0.0017269468,0.3212923],"study_design_scores_gemma":[0.000006298195,0.0000284643,0.0004542223,0.000004888293,0.000008111132,0.000058832775,0.000016102187,0.98744893,0.00505304,0.006489312,0.00042495772,0.000006820612],"about_ca_topic_score_codex":0.0010998427,"about_ca_topic_score_gemma":0.001422552,"teacher_disagreement_score":0.0011121337,"about_ca_system_score_codex":0.00035165745,"about_ca_system_score_gemma":0.00043533524,"threshold_uncertainty_score":0.0058816075},"labels":[],"label_agreement":null},{"id":"W2166630570","doi":"10.1287/moor.2017.0895","title":"On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Fonds De La Recherche Scientifique - FNRS","keywords":"Robust principal component analysis; Sparse PCA; Principal component analysis; Matrix (chemical analysis); Computation; Bipartite graph; Binary number; Logical matrix; Basis (linear algebra)","score_opus":0.12579522338170646,"score_gpt":0.336740079970483,"score_spread":0.21094485658877654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166630570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085838735,0.005548132,0.8578553,0.013390426,0.0004836624,0.000296588,0.0031941729,0.0013925699,0.03200043],"genre_scores_gemma":[0.6573587,0.005443451,0.31176734,0.0026293918,0.0010529369,0.0008412982,0.0052230996,0.0011869621,0.014496721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995503,0.0015229377,0.00021509445,0.0009295647,0.0012081392,0.0006214264],"domain_scores_gemma":[0.95519525,0.038516663,0.0014984095,0.0023739776,0.001737709,0.00067789404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036778117,0.0019320771,0.0027619123,0.0010986656,0.0014131193,0.0042626304,0.0027982646,0.0022990261,0.008809015],"category_scores_gemma":[0.030229863,0.0008548163,0.0018891492,0.0024745916,0.003139854,0.0072467187,0.0040531578,0.0060567204,0.0013747528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010708899,0.00034680718,0.002762231,0.0011912598,0.0002085691,0.0005241836,0.00049514556,0.56079006,0.003948157,0.28220704,0.038162403,0.10829326],"study_design_scores_gemma":[0.000056472647,0.00005273009,0.00052164024,0.000055499753,0.000034908677,0.00013945652,0.00009826619,0.66913325,0.000774309,0.3271494,0.0019557276,0.00002837376],"about_ca_topic_score_codex":0.0052157845,"about_ca_topic_score_gemma":0.006141223,"teacher_disagreement_score":0.008809015,"about_ca_system_score_codex":0.0032254064,"about_ca_system_score_gemma":0.0029569678,"threshold_uncertainty_score":0.029469013},"labels":[],"label_agreement":null},{"id":"W2167692402","doi":"10.1109/tsp.2012.2189109","title":"Efficient Minimax Estimation of a Class of High-Dimensional Sparse Precision Matrices","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Estimator; Mathematics; Minimax; Mathematical optimization; Algorithm; Rate of convergence; Computer science; Applied mathematics; Statistics","score_opus":0.017750407350118253,"score_gpt":0.24693288956898543,"score_spread":0.22918248221886717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167692402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00819603,0.00012389943,0.99110585,0.00014163206,0.000011087388,0.000015287746,0.00002843039,0.00007881749,0.00029886529],"genre_scores_gemma":[0.5266814,0.0012180848,0.46626425,0.000315118,0.00024217753,0.00031462102,0.0005871239,0.00015743005,0.004219774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983531,0.0005616622,0.00006696759,0.00040363445,0.0005095746,0.000104982006],"domain_scores_gemma":[0.9935762,0.0041454853,0.0009838927,0.0005803506,0.0005981607,0.00011587778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040969593,0.0009819154,0.0014765412,0.0009117294,0.00051260105,0.0015294317,0.0015469902,0.0016565078,0.0009168919],"category_scores_gemma":[0.021512492,0.0007069858,0.0006869828,0.0007646406,0.0019494365,0.0027159308,0.0019890394,0.0020160386,0.00033132444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018050575,0.000105163446,0.0027770326,0.0002934537,0.0001661559,0.00020693154,0.00016713695,0.6964576,0.012260692,0.15917674,0.002570504,0.12563802],"study_design_scores_gemma":[0.0000197295,0.000047858517,0.0005907329,0.000021735963,0.0000122075935,0.000084491374,0.000015980206,0.95159435,0.002289476,0.044631295,0.00067155727,0.000020524512],"about_ca_topic_score_codex":0.0008386177,"about_ca_topic_score_gemma":0.0007961011,"teacher_disagreement_score":0.0040969593,"about_ca_system_score_codex":0.0005471144,"about_ca_system_score_gemma":0.0014914868,"threshold_uncertainty_score":0.021667004},"labels":[],"label_agreement":null},{"id":"W2167828645","doi":"10.1117/12.2189211","title":"Deterministic compressed sensing and quantization","year":2015,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Quantization (signal processing); Computer science; Algorithm; Chirp; Sampling (signal processing); Focus (optics); Sampling theory; Mathematics; Computer vision; Physics; Optics; Sample size determination; Statistics","score_opus":0.021730668170394138,"score_gpt":0.23856920553121844,"score_spread":0.2168385373608243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167828645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015592626,0.008214469,0.93194103,0.0041760597,0.0006369523,0.000060388902,0.00030000962,0.00024407922,0.0388345],"genre_scores_gemma":[0.8002752,0.010350109,0.17319852,0.001834996,0.0013826141,0.00022796498,0.00042157478,0.000115983596,0.0121929785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802244,0.00057726156,0.000074523494,0.00030142866,0.0008821508,0.00014227892],"domain_scores_gemma":[0.9971923,0.0018597171,0.00024599792,0.00031042527,0.00032095096,0.0000706076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272671,0.00043730874,0.0006517336,0.0006271901,0.00046843904,0.0014158046,0.0007061989,0.0011468612,0.0034115806],"category_scores_gemma":[0.007421847,0.00024266697,0.00030238734,0.0008022693,0.0025657094,0.0018640228,0.0015486401,0.0018022062,0.00044046118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003941082,0.000010372921,0.00018371071,0.00010110486,0.000010627004,0.00004942164,0.0000575608,0.05774316,0.0015404252,0.91736275,0.0022218707,0.020679563],"study_design_scores_gemma":[0.000023499106,0.000048307113,0.0002706714,0.000057592395,0.0000058335913,0.00013685232,0.00004075341,0.2861841,0.0016387773,0.7001623,0.011401849,0.000029413912],"about_ca_topic_score_codex":0.0015566293,"about_ca_topic_score_gemma":0.0007384796,"teacher_disagreement_score":0.0034115806,"about_ca_system_score_codex":0.001259447,"about_ca_system_score_gemma":0.0008833315,"threshold_uncertainty_score":0.011412919},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009626347794534085,"score_gpt":0.20430994685841417,"score_spread":0.19468359906388008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167967601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035353135,0.005254569,0.95779794,0.0017886366,0.0003287678,0.000046629943,0.00036617112,0.0001447019,0.030737203],"genre_scores_gemma":[0.5833037,0.028016174,0.32646343,0.00167133,0.0021541375,0.0007695059,0.002242981,0.00051796273,0.054860827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985876,0.0006228008,0.00007560188,0.00023116508,0.00038123658,0.00010160982],"domain_scores_gemma":[0.9976331,0.0014945725,0.00018517264,0.00020410877,0.0004054313,0.00007767187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017425738,0.0014383483,0.0014052009,0.000790274,0.0005673636,0.0020522578,0.0012647128,0.0014488348,0.006293101],"category_scores_gemma":[0.009060871,0.000531687,0.0006126819,0.0012572818,0.0019511414,0.00207622,0.0018826205,0.002896486,0.0016839379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053217413,0.000015654085,0.0004067362,0.0002137081,0.000056975266,0.00011705694,0.000049395054,0.35823166,0.0007778515,0.5751981,0.012571984,0.052307762],"study_design_scores_gemma":[0.0000071348186,0.0000118844655,0.00014959015,0.000045542907,0.000006906629,0.000050875005,0.0000129245645,0.689663,0.00036948133,0.30001336,0.009658405,0.00001097221],"about_ca_topic_score_codex":0.0026213462,"about_ca_topic_score_gemma":0.0026278668,"teacher_disagreement_score":0.006293101,"about_ca_system_score_codex":0.0014561302,"about_ca_system_score_gemma":0.0009583465,"threshold_uncertainty_score":0.02105248},"labels":[],"label_agreement":null},{"id":"W2168034822","doi":"","title":"Spectral Regularization for Max-Margin Sequence Tagging","year":2014,"lang":"en","type":"article","venue":"UPCommons institutional repository (Universitat Politècnica de Catalunya)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation; Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Regularization (linguistics); Margin (machine learning); Latent variable; Operator (biology); Observable; Proximal gradient methods for learning; Mathematical optimization; Computer science; Convex optimization; Structured prediction; Algorithm; Mathematics; Matrix completion; Artificial intelligence; Sequence (biology); Regular polygon; Machine learning; Convex combination","score_opus":0.015116339196789796,"score_gpt":0.21925213932536713,"score_spread":0.20413580012857735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168034822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021323576,0.00008620492,0.9968194,0.00013651527,0.00002125028,0.000014526521,0.00004774433,0.00016218424,0.00057980436],"genre_scores_gemma":[0.37154946,0.0004706362,0.6183463,0.0006101385,0.0002938276,0.00032067185,0.000914912,0.00039607548,0.0070979893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979949,0.0009325583,0.00009236722,0.00040271884,0.00046917298,0.00010833161],"domain_scores_gemma":[0.9942287,0.0036849664,0.00040925192,0.00093175867,0.00057053054,0.000174693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037451393,0.0011679828,0.001133141,0.00074836594,0.00054623536,0.0012391147,0.0020002679,0.0020401138,0.003501553],"category_scores_gemma":[0.012972255,0.0005517046,0.00074458506,0.0009485742,0.002107012,0.0030638217,0.0024653594,0.0027502077,0.0014567343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002561162,0.00013107422,0.00063489494,0.00022126148,0.00007459664,0.00013042407,0.0002009656,0.6528072,0.008166679,0.20687705,0.006766545,0.12373323],"study_design_scores_gemma":[0.0000043701802,0.00001599674,0.000045381166,0.000009964784,0.0000026491118,0.000013617102,0.000005938736,0.9525988,0.0009088035,0.045845903,0.0005419341,0.0000066059474],"about_ca_topic_score_codex":0.0014426715,"about_ca_topic_score_gemma":0.0019216659,"teacher_disagreement_score":0.0037451393,"about_ca_system_score_codex":0.0010822491,"about_ca_system_score_gemma":0.0012897102,"threshold_uncertainty_score":0.019806445},"labels":[],"label_agreement":null},{"id":"W2169483743","doi":"10.1109/icassp.2012.6288623","title":"Support driven reweighted &amp;#x2113;&lt;inf&gt;1&lt;/inf&gt; minimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minification; Intersection (aeronautics); Inverse; Algorithm; Computer science; Mathematics; Mathematical optimization; Engineering","score_opus":0.019354944013895443,"score_gpt":0.2334021753709982,"score_spread":0.21404723135710274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169483743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004695326,0.00025951178,0.9929268,0.00033066477,0.00005549342,0.00006848864,0.00010272973,0.0005323638,0.0010285849],"genre_scores_gemma":[0.076385856,0.0003237063,0.913027,0.00051637035,0.00017231125,0.00033639141,0.000973546,0.0005969847,0.007667844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829346,0.0005251165,0.00010492799,0.00041718886,0.00052105804,0.00013823468],"domain_scores_gemma":[0.9969591,0.0014734695,0.00029761053,0.00043306456,0.0007164727,0.00012024392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026958354,0.0025923883,0.0021749197,0.00089952396,0.0006608035,0.0014817768,0.0036342337,0.0026534721,0.0052302536],"category_scores_gemma":[0.008604469,0.0010991655,0.0012111132,0.0012934654,0.0011398813,0.0026772043,0.0019154731,0.002856162,0.0038830617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073073205,0.0003292656,0.0013813922,0.0007112212,0.00023735594,0.0003304275,0.00018096282,0.5078158,0.012822036,0.03628261,0.022577498,0.4166007],"study_design_scores_gemma":[0.0000365928,0.000068001194,0.00011425304,0.000022133252,0.000016063648,0.00007268857,0.000023921484,0.98366886,0.0024684342,0.010939449,0.002553749,0.00001584111],"about_ca_topic_score_codex":0.004189127,"about_ca_topic_score_gemma":0.0064634895,"teacher_disagreement_score":0.0052302536,"about_ca_system_score_codex":0.0011024536,"about_ca_system_score_gemma":0.0021523968,"threshold_uncertainty_score":0.017496943},"labels":[],"label_agreement":null},{"id":"W2170644494","doi":"10.1109/icip.2009.5413686","title":"A block based encoding algorithm for matching pursuit image coding","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Encoding (memory); Matching pursuit; Coding (social sciences); Computer science; Algorithm; Image compression; Data compression; Context-adaptive binary arithmetic coding; Rate–distortion theory; Bit rate; Block (permutation group theory); JPEG 2000; Matching (statistics); Image (mathematics); Artificial intelligence; Mathematics; Image processing; Compressed sensing; Computer engineering","score_opus":0.014288738952414731,"score_gpt":0.2461230783077323,"score_spread":0.23183433935531758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170644494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020506673,0.00018082939,0.99624157,0.00008175421,0.00007036915,0.000046544,0.000041412688,0.00018643985,0.0011003524],"genre_scores_gemma":[0.053942323,0.0005302434,0.940378,0.000111300295,0.0000920511,0.00019223044,0.00025112688,0.00007650002,0.0044262386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00007426022,0.000021066435,0.000039807164,0.00022183308,0.000031512955],"domain_scores_gemma":[0.99961215,0.000111894224,0.000038724746,0.000074288815,0.00014097312,0.000022023196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360022,0.00049583765,0.00053176406,0.000685525,0.00035399178,0.00064212043,0.000688824,0.0007912468,0.0027607896],"category_scores_gemma":[0.0014635824,0.00023189682,0.0003110998,0.0010071784,0.00039973538,0.0010503078,0.0008023588,0.001231478,0.001818897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023582974,0.00008583224,0.00034264583,0.00017709013,0.000043464857,0.00012872466,0.000092686656,0.05561282,0.11445137,0.11082996,0.00624999,0.7117495],"study_design_scores_gemma":[0.000045341665,0.00020567025,0.0002837792,0.000036140565,0.000024350047,0.00051190227,0.000016782546,0.9101436,0.049097262,0.01609413,0.023497544,0.00004355013],"about_ca_topic_score_codex":0.0010087346,"about_ca_topic_score_gemma":0.0010495781,"teacher_disagreement_score":0.0027607896,"about_ca_system_score_codex":0.00037651832,"about_ca_system_score_gemma":0.00064902456,"threshold_uncertainty_score":0.009235799},"labels":[],"label_agreement":null},{"id":"W2170865247","doi":"10.1145/2487575.2487671","title":"FeaFiner","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Orthogonality; Feature (linguistics); Feature selection; Interpretability; Generalization; Computer science; Smoothness; Convexity; Augmented Lagrangian method; Consistency (knowledge bases); Mathematical optimization; Process (computing); Artificial intelligence; Mathematics; Algorithm","score_opus":0.004797072840860334,"score_gpt":0.1577284605772174,"score_spread":0.15293138773635706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170865247","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019358146,0.00021807622,0.99318284,0.00026697965,0.000029391422,0.000048120746,0.000060307575,0.00015251829,0.00410592],"genre_scores_gemma":[0.18197474,0.0008991573,0.797668,0.0006959606,0.00023751658,0.00052966445,0.00062117603,0.00036303612,0.017010752],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988759,0.00038463055,0.00007901847,0.00022588116,0.00034030393,0.000094193245],"domain_scores_gemma":[0.99732995,0.0017212383,0.00016733538,0.0002457127,0.0004752294,0.000060603707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023585956,0.0015669627,0.0015736312,0.001411127,0.0007190891,0.0014355171,0.0017089775,0.00268909,0.009005186],"category_scores_gemma":[0.008369286,0.00063460914,0.0014184058,0.0011409667,0.0013500629,0.0020721515,0.0021908213,0.0020198885,0.0025614933],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012670345,0.000100864796,0.0009164418,0.00033255765,0.00009892738,0.00028755225,0.00021014732,0.6198387,0.0048751174,0.14297374,0.011643314,0.21859589],"study_design_scores_gemma":[0.000016740558,0.000048293496,0.000094041476,0.00002876296,0.000011385798,0.000113219096,0.00002052043,0.9456753,0.000908152,0.047844216,0.0052296817,0.000009636957],"about_ca_topic_score_codex":0.0015213926,"about_ca_topic_score_gemma":0.0018320124,"teacher_disagreement_score":0.009005186,"about_ca_system_score_codex":0.0007553117,"about_ca_system_score_gemma":0.0010345461,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2171716588","doi":"10.1109/cwit.2009.5069540","title":"Optical communication through time-varying turbulent atmosphere using compressive sensing","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Detector; Channel (broadcasting); Compressed sensing; Turbulence; Atmosphere (unit); Antenna diversity; Computer science; SIGNAL (programming language); Free-space optical communication; Atmospheric turbulence; Electronic engineering; Atmospheric model; Optics; Optical communication; Physics; Telecommunications; Acoustics; Remote sensing; Algorithm; Engineering; Meteorology; Geology","score_opus":0.02271053651060878,"score_gpt":0.25689060526460905,"score_spread":0.23418006875400027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171716588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29645565,0.00029199716,0.70019144,0.00027137974,0.000045242206,0.000014784387,0.000044139626,0.0002874074,0.002397898],"genre_scores_gemma":[0.9397201,0.00013183487,0.059090707,0.00004090099,0.000031555963,0.000008203854,0.00003382182,0.000008782703,0.0009340094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975365,0.00007029469,0.000006169087,0.000025646817,0.0001175672,0.000026669537],"domain_scores_gemma":[0.99965954,0.00018652403,0.000050167084,0.000038017224,0.000051303112,0.000014440324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028036785,0.00025063704,0.00017323862,0.00016686934,0.0001849037,0.00033056593,0.0002636877,0.0003149252,0.00032424042],"category_scores_gemma":[0.00084484526,0.00011440229,0.00014605449,0.0002049096,0.0003826321,0.0006266518,0.0003547785,0.00025976234,0.000055635435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046279663,0.00014774929,0.0032446405,0.000109835666,0.00009271318,0.00019603314,0.00018792809,0.5791175,0.21843457,0.05249456,0.0014368658,0.14407483],"study_design_scores_gemma":[0.000017198929,0.000104070605,0.0003385606,0.0000041396884,0.000008688779,0.000056774148,0.000010416895,0.98130167,0.014786593,0.0027391901,0.0006187427,0.000014014751],"about_ca_topic_score_codex":0.0011306707,"about_ca_topic_score_gemma":0.0015930937,"teacher_disagreement_score":0.0011306707,"about_ca_system_score_codex":0.00023237578,"about_ca_system_score_gemma":0.00033765673,"threshold_uncertainty_score":0.0022482276},"labels":[],"label_agreement":null},{"id":"W2171745019","doi":"10.1190/1.3628174","title":"Sparsity‐promoting recovery from simultaneous data: A compressive sensing approach","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Data acquisition; Computer science; Sampling (signal processing); Inversion (geology); Nyquist rate; Data collection; Data mining; Real-time computing; Artificial intelligence; Computer vision; Geology; Seismology; Mathematics","score_opus":0.06750705369407724,"score_gpt":0.22458751856924636,"score_spread":0.15708046487516913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171745019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034895064,0.000046480494,0.99550676,0.00010528783,0.000007951101,0.000016103753,0.00002449684,0.00011899301,0.0006844823],"genre_scores_gemma":[0.13902614,0.0003822092,0.8558388,0.000117325166,0.00006770027,0.0001647108,0.00020626506,0.00012266105,0.0040742243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996482,0.0000985492,0.000014086,0.00005089072,0.00015776303,0.000030453513],"domain_scores_gemma":[0.9993837,0.0004130625,0.00004515469,0.00006354941,0.00006638575,0.00002813986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006923493,0.000616333,0.00045683532,0.00038972218,0.00020893768,0.0005439581,0.0007269058,0.00081808283,0.0023516216],"category_scores_gemma":[0.0021627026,0.00037370337,0.00044175584,0.00053832185,0.00071267446,0.0011171779,0.0014558502,0.0012118794,0.0006884161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002880509,0.00011294187,0.0005676066,0.0002688686,0.000055853146,0.00022007196,0.0002811776,0.47099417,0.03656961,0.085222475,0.0038750586,0.40154403],"study_design_scores_gemma":[0.000016831124,0.00006490261,0.00006568044,0.0000103891725,0.0000051855204,0.00007163028,0.000017386117,0.9762626,0.0051578153,0.015922988,0.0023960075,0.000008459098],"about_ca_topic_score_codex":0.0010285911,"about_ca_topic_score_gemma":0.0013680547,"teacher_disagreement_score":0.0023516216,"about_ca_system_score_codex":0.00022957631,"about_ca_system_score_gemma":0.0009176181,"threshold_uncertainty_score":0.007866919},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01760172955221883,"score_gpt":0.23801296648202905,"score_spread":0.2204112369298102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171798319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056693107,0.0013958446,0.9911232,0.0004301577,0.00007480725,0.000038774826,0.000049683986,0.00019878637,0.0010194891],"genre_scores_gemma":[0.49994797,0.0030163643,0.4848975,0.00085310236,0.0011448619,0.00060208363,0.00081743667,0.0005700202,0.008150614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98717713,0.005035164,0.00073405163,0.0013322263,0.0052688285,0.00045259704],"domain_scores_gemma":[0.95784533,0.030935917,0.0026453147,0.0029714713,0.005199818,0.000402227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017447757,0.0016455349,0.00243348,0.0023093468,0.00083368935,0.0031293838,0.0023285742,0.0038968115,0.002308176],"category_scores_gemma":[0.0734791,0.0006652767,0.0008301843,0.0021001976,0.002947864,0.0060166167,0.003699851,0.004057595,0.0011174914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005199136,0.00012144946,0.0028761867,0.00054249424,0.00015183774,0.00015333526,0.00017724329,0.5473844,0.0032779644,0.1747184,0.0050885957,0.26498815],"study_design_scores_gemma":[0.0000058390274,0.000050482504,0.00024930842,0.000052062787,0.000008921106,0.000066677014,0.000011100432,0.9587328,0.0015473146,0.03846715,0.0007936667,0.000014822109],"about_ca_topic_score_codex":0.0010591737,"about_ca_topic_score_gemma":0.00050728174,"teacher_disagreement_score":0.017447757,"about_ca_system_score_codex":0.0017723276,"about_ca_system_score_gemma":0.0013718401,"threshold_uncertainty_score":0.09227365},"labels":[],"label_agreement":null},{"id":"W2172740054","doi":"10.48550/arxiv.1511.07293","title":"Sparse Recovery via Partial Regularization: Models, Theory and Algorithms","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Restricted isometry property; Augmented Lagrangian method; Regularization (linguistics); Mathematics; Applied mathematics; Sequence (biology); Mathematical optimization; Compressed sensing; Class (philosophy); Optimization problem; Algorithm; Computer science; Artificial intelligence","score_opus":0.06958833504821786,"score_gpt":0.1781633879175287,"score_spread":0.10857505286931084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172740054","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024028425,0.0013225991,0.99342644,0.00064898835,0.00003903737,0.000024084977,0.00006808699,0.00010346394,0.0019644627],"genre_scores_gemma":[0.472622,0.011817676,0.49253535,0.0010765425,0.0011508965,0.0008782723,0.00096223806,0.0003993266,0.01855763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987374,0.0005686928,0.00004721427,0.00023099016,0.0003141439,0.00010147002],"domain_scores_gemma":[0.99686086,0.0020343093,0.00036915886,0.0003008496,0.0003303248,0.000104515144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022910708,0.0015145448,0.0013543318,0.0012896961,0.00054585177,0.0018501952,0.0018286322,0.0021094398,0.0026010147],"category_scores_gemma":[0.007197835,0.00084442477,0.0013508177,0.0020934567,0.0027508696,0.003419628,0.0029751852,0.0035388244,0.000715824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004573546,0.00006067459,0.00062944804,0.00028403418,0.000074320924,0.0000989656,0.00013317594,0.52686864,0.0012627124,0.41389605,0.0066816853,0.049964577],"study_design_scores_gemma":[0.0000061781857,0.000021083551,0.00007504081,0.000019913874,0.000008879898,0.00003426055,0.000012096866,0.88179785,0.00019288999,0.11616903,0.0016511318,0.0000115836465],"about_ca_topic_score_codex":0.0044852793,"about_ca_topic_score_gemma":0.0032843049,"teacher_disagreement_score":0.0044852793,"about_ca_system_score_codex":0.0014232663,"about_ca_system_score_gemma":0.0014121601,"threshold_uncertainty_score":0.012116492},"labels":[],"label_agreement":null},{"id":"W2173097616","doi":"10.48550/arxiv.1511.05946","title":"ACDC: A Structured Efficient Linear Layer","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Advanced Research","funders":"","keywords":"Initialization; Deep learning; Diagonal; Computer science; Topology (electrical circuits); Differentiable function; Convolutional neural network; Artificial intelligence; Algorithm; Mathematics; Pure mathematics; Geometry; Combinatorics","score_opus":0.0877264488140493,"score_gpt":0.19295039461899502,"score_spread":0.10522394580494572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173097616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012089744,0.00053765054,0.97574526,0.00031660064,0.000116252464,0.00011057283,0.0003639881,0.0052649598,0.0054550287],"genre_scores_gemma":[0.2957877,0.0006106112,0.6871062,0.0006629586,0.00013395389,0.00030802915,0.0016952965,0.000585604,0.01310963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996313,0.000042979736,0.000016386648,0.000086157146,0.00016985335,0.00005326461],"domain_scores_gemma":[0.9995128,0.00010075449,0.000041145835,0.00016887482,0.00012542125,0.00005095905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040109965,0.0010775278,0.0005206969,0.00051518466,0.00040820419,0.0008377311,0.0020037394,0.0009094393,0.0069317454],"category_scores_gemma":[0.0019119076,0.00049981603,0.00048835797,0.0006576837,0.00068409636,0.0017953524,0.0020347193,0.0017754,0.0031152111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004570347,0.00028222046,0.0014013104,0.00035361495,0.0001462106,0.00024245237,0.00013390527,0.24719122,0.040283196,0.058461655,0.04397023,0.60707694],"study_design_scores_gemma":[0.000026777889,0.00009612934,0.00016114226,0.000024916997,0.000021812872,0.00011796977,0.000015283618,0.96541137,0.011727594,0.0120064095,0.010372341,0.000018278879],"about_ca_topic_score_codex":0.005421441,"about_ca_topic_score_gemma":0.010350695,"teacher_disagreement_score":0.0069317454,"about_ca_system_score_codex":0.000817893,"about_ca_system_score_gemma":0.0015052009,"threshold_uncertainty_score":0.023189008},"labels":[],"label_agreement":null},{"id":"W2175055016","doi":"10.1016/j.cpc.2015.10.027","title":"GPU-accelerated adjoint algorithmic differentiation","year":2015,"lang":"en","type":"article","venue":"Computer Physics Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Bundesministerium für Bildung und Forschung","keywords":"Computer science; Parallel computing; Speedup; SIMD; Automatic differentiation; CUDA; Thread (computing); Vectorization (mathematics); Memory bandwidth; Computation; Graphics; Software; Computational science; Algorithm; Computer graphics (images)","score_opus":0.10166043351825071,"score_gpt":0.2736752447108633,"score_spread":0.17201481119261258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175055016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04388093,0.00025809603,0.93445903,0.00023526461,0.00014980978,0.00005834926,0.00023365249,0.0069108987,0.013813938],"genre_scores_gemma":[0.31289837,0.0001679547,0.6775509,0.00017004863,0.000028998764,0.00010575561,0.00065441185,0.0008537948,0.0075697317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997093,0.000041881256,0.000014909855,0.000038713075,0.00016399098,0.000031157513],"domain_scores_gemma":[0.9995363,0.00011466198,0.000023776296,0.000102534934,0.00019523439,0.000027456614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034402785,0.00048545952,0.00038338132,0.00040651925,0.000247565,0.0009350677,0.0008813983,0.000515126,0.0058023646],"category_scores_gemma":[0.0013325511,0.00024167226,0.00036078863,0.00061293185,0.000394036,0.0007166769,0.00074872014,0.0008962892,0.0012043322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039809148,0.0002178553,0.0033598682,0.00033058354,0.00006367745,0.00030541196,0.00036393857,0.35999966,0.11724782,0.09237823,0.022128168,0.40320674],"study_design_scores_gemma":[0.000038086557,0.000042912172,0.00032203994,0.000008885721,0.0000052364394,0.00010019983,0.000013822177,0.96609515,0.017751468,0.005825121,0.009782831,0.000014213337],"about_ca_topic_score_codex":0.002718925,"about_ca_topic_score_gemma":0.002783591,"teacher_disagreement_score":0.0058023646,"about_ca_system_score_codex":0.0005468211,"about_ca_system_score_gemma":0.00095920387,"threshold_uncertainty_score":0.019410849},"labels":[],"label_agreement":null},{"id":"W2176848862","doi":"10.1155/2015/260913","title":"Data Gathering in Wireless Sensor Networks Based on Reshuffling Cluster Compressed Sensing","year":2015,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Wireless sensor network; Energy consumption; Compressed sensing; Real-time computing; Time division multiple access; Raw data; Data transmission; Data collection; Scheduling (production processes); Efficient energy use; Energy (signal processing); Computer network; Algorithm","score_opus":0.04242840671981733,"score_gpt":0.2773457529327808,"score_spread":0.23491734621296345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176848862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027478587,0.00030451728,0.9704671,0.00022632975,0.000041789925,0.00006233049,0.00004135745,0.00022981304,0.0011482409],"genre_scores_gemma":[0.6811084,0.0008731499,0.31556892,0.00018072245,0.00012815287,0.0001684708,0.00016572309,0.000060955706,0.0017455928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994874,0.00012758496,0.000021038002,0.00009108943,0.00023210888,0.000040706025],"domain_scores_gemma":[0.9991781,0.00043639925,0.00010231888,0.00012129805,0.00013495279,0.00002694745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000493705,0.0005288989,0.00045284737,0.00067738723,0.00047827515,0.00033348633,0.0006219681,0.0004294401,0.0005152878],"category_scores_gemma":[0.0019742646,0.00020340389,0.00037880705,0.0010946781,0.0007323651,0.0011309825,0.00091429695,0.00060842984,0.00011562017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003545359,0.00008647448,0.0009211462,0.00024255342,0.00006749878,0.0002697258,0.00042468056,0.7097545,0.07206661,0.023350095,0.0022674904,0.19019467],"study_design_scores_gemma":[0.000013296908,0.000096326155,0.0002457355,0.000008385934,0.000012426083,0.00008466352,0.000052964562,0.98384386,0.009493357,0.004727082,0.0014038563,0.00001805443],"about_ca_topic_score_codex":0.0029950165,"about_ca_topic_score_gemma":0.0027139,"teacher_disagreement_score":0.0029950165,"about_ca_system_score_codex":0.000469409,"about_ca_system_score_gemma":0.00053840806,"threshold_uncertainty_score":0.0059551597},"labels":[],"label_agreement":null},{"id":"W2179924661","doi":"10.1190/tle33040386.1","title":"Increasing the efficiency of seismic data acquisition via compressive sensing","year":2014,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"","keywords":"Compressed sensing; Nyquist–Shannon sampling theorem; Sampling (signal processing); Computer science; Sampling theory; Sample (material); Selection (genetic algorithm); Data acquisition; Data mining; Algorithm; Telecommunications; Sample size determination; Statistics; Mathematics; Artificial intelligence; Computer vision; Physics","score_opus":0.024237827616229272,"score_gpt":0.24878203332763532,"score_spread":0.22454420571140604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179924661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046547275,0.00057016744,0.9450943,0.0010638034,0.0000579019,0.000048807648,0.0001164875,0.0008349212,0.0056662858],"genre_scores_gemma":[0.6014331,0.0007038958,0.39472276,0.0002290538,0.00013068167,0.000077634315,0.0002101611,0.00012389541,0.0023687552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877113,0.00037269254,0.0000659893,0.00016303547,0.00054430374,0.00008282992],"domain_scores_gemma":[0.99538356,0.0028959822,0.00033995535,0.0007296315,0.00056732463,0.00008350182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014262302,0.0005521196,0.0005487072,0.00086159253,0.00023778374,0.0007549479,0.0007602159,0.00069512613,0.0035538208],"category_scores_gemma":[0.007378129,0.00028059943,0.00019953382,0.0010250034,0.0007536052,0.0016922558,0.0017638527,0.00084460696,0.0013586553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010291224,0.00019457923,0.0031232715,0.00033697826,0.00010038514,0.00019791465,0.00018150517,0.20221291,0.18810168,0.041044608,0.0054263063,0.55805075],"study_design_scores_gemma":[0.00005929028,0.0001681851,0.0010056957,0.000058925743,0.00002366766,0.00017715317,0.000058338297,0.9123519,0.063435584,0.017125646,0.005508018,0.000027485146],"about_ca_topic_score_codex":0.0008343991,"about_ca_topic_score_gemma":0.0012342981,"teacher_disagreement_score":0.0035538208,"about_ca_system_score_codex":0.00037746265,"about_ca_system_score_gemma":0.0005753077,"threshold_uncertainty_score":0.011888683},"labels":[],"label_agreement":null},{"id":"W2181767889","doi":"10.1109/mmsp.2015.7340840","title":"Patch-based nonlocal dynamic MRI reconstruction with low-rank prior","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Compressed sensing; Regularization (linguistics); Thresholding; Computer science; Algorithm; Minification; Iterative reconstruction; Rank (graph theory); Dynamic contrast-enhanced MRI; Real-time MRI; Singular value; Mathematical optimization; Artificial intelligence; Mathematics; Magnetic resonance imaging; Image (mathematics); Physics","score_opus":0.008400102635668923,"score_gpt":0.20540212833726357,"score_spread":0.19700202570159464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181767889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046263174,0.00011030438,0.9946563,0.00005884314,0.000011498969,0.000010667424,0.000017445365,0.00010575425,0.00040288724],"genre_scores_gemma":[0.16604926,0.0006103944,0.82939386,0.000121119265,0.000071102186,0.000061920575,0.0002801967,0.00012060301,0.0032915156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996685,0.00007279771,0.000016781662,0.00007227502,0.00014996411,0.000019775669],"domain_scores_gemma":[0.9995203,0.00018428784,0.0000762095,0.000106847896,0.00008085643,0.000031391366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047733553,0.0005944366,0.0008716094,0.0004719428,0.00018934929,0.0005128862,0.00080281694,0.0007630424,0.0013588604],"category_scores_gemma":[0.0013513847,0.00037039915,0.00057167164,0.00062275946,0.0005232824,0.0013095458,0.0009842152,0.0009830901,0.0005351571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026568022,0.00012873039,0.00091310986,0.0004341226,0.00014154472,0.0004134555,0.00022588602,0.37379616,0.18295068,0.02998509,0.0039619966,0.40678358],"study_design_scores_gemma":[0.000013021284,0.00006921269,0.00020537163,0.000007667692,0.000015210288,0.00026314444,0.000014691399,0.98063767,0.013802827,0.0030575083,0.0018974172,0.000016223883],"about_ca_topic_score_codex":0.00090897584,"about_ca_topic_score_gemma":0.0013826361,"teacher_disagreement_score":0.0013588604,"about_ca_system_score_codex":0.0002201865,"about_ca_system_score_gemma":0.00045381923,"threshold_uncertainty_score":0.0045458674},"labels":[],"label_agreement":null},{"id":"W2182574341","doi":"10.1109/sips.2015.7344999","title":"Sparse superposition codes: A practical approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Decoding methods; Computer science; Compressed sensing; Code word; Superposition principle; Quantization (signal processing); Algorithm; Parity-check matrix; Concatenated error correction code; Code (set theory); Sparse matrix; List decoding; Theoretical computer science; Set (abstract data type); Block code; Mathematics","score_opus":0.0715908080532273,"score_gpt":0.28049784379977094,"score_spread":0.20890703574654362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182574341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063223895,0.0006451817,0.9767924,0.0012259574,0.00006722191,0.000041460928,0.000042796088,0.00021625849,0.014646358],"genre_scores_gemma":[0.38708815,0.0033544106,0.59415364,0.00046881728,0.00042102733,0.00021101789,0.00016160149,0.00015366144,0.013987706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902725,0.00029893353,0.000036627305,0.000112879345,0.00046116146,0.00006317488],"domain_scores_gemma":[0.9980736,0.00086873496,0.000093468196,0.0005156385,0.00039506127,0.000053550644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009867981,0.000771316,0.0006029202,0.0007801017,0.0005571696,0.0016763365,0.0010556536,0.0012500488,0.0065557878],"category_scores_gemma":[0.0055153933,0.00041944132,0.00038734556,0.0010928358,0.0015094128,0.0022644019,0.0015236652,0.0016773655,0.0010809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012815806,0.000078096185,0.0006418349,0.00022898735,0.00003803916,0.0002006821,0.00019155587,0.27718318,0.011241905,0.53077185,0.0046056956,0.17469007],"study_design_scores_gemma":[0.000017320383,0.000074750336,0.00014004906,0.000039786704,0.000015412254,0.0002717414,0.00006271205,0.795976,0.004132053,0.18722273,0.012031377,0.000016042353],"about_ca_topic_score_codex":0.0015916463,"about_ca_topic_score_gemma":0.0022939348,"teacher_disagreement_score":0.0065557878,"about_ca_system_score_codex":0.0011952901,"about_ca_system_score_gemma":0.0013009984,"threshold_uncertainty_score":0.02193135},"labels":[],"label_agreement":null},{"id":"W2183737160","doi":"","title":"Optimization by Variational Bounding","year":2013,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Differentiable function; Mathematics; Bounding overwatch; Upper and lower bounds; Convex function; Optimization problem; Applied mathematics; Probability distribution; Distribution (mathematics); Mathematical optimization; Stochastic gradient descent; Combinatorics; Regular polygon; Mathematical analysis; Computer science; Artificial neural network; Geometry","score_opus":0.004430609314108844,"score_gpt":0.155144370784974,"score_spread":0.15071376147086515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183737160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096837996,0.00043953213,0.9929711,0.0004021356,0.000055855202,0.000012650603,0.000038608086,0.00006367036,0.0050481358],"genre_scores_gemma":[0.3063912,0.0037096802,0.65604866,0.0014462844,0.00074047426,0.0004933318,0.00042782223,0.0010612141,0.029681461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821424,0.00071874564,0.00007519223,0.00034577624,0.00050527655,0.0001407337],"domain_scores_gemma":[0.9976712,0.0015715653,0.00013925276,0.00034900883,0.00017879452,0.000090209105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036975243,0.001665744,0.0013397537,0.001032803,0.00055789016,0.0022030817,0.001659729,0.0022305534,0.0049214573],"category_scores_gemma":[0.00970272,0.00075369177,0.0014886042,0.0010753578,0.0033865485,0.0034423904,0.0034992408,0.0040335655,0.001157553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013515276,0.000013240275,0.00011487086,0.000080667276,0.000033370972,0.000038846876,0.00006065763,0.120803766,0.0017616095,0.86211234,0.0019871362,0.012979919],"study_design_scores_gemma":[0.000008778896,0.000020577188,0.000092547874,0.000034761895,0.00001069439,0.00004377839,0.0000108780105,0.6081194,0.0008498455,0.38267767,0.008115952,0.000015013472],"about_ca_topic_score_codex":0.0025584104,"about_ca_topic_score_gemma":0.0022972669,"teacher_disagreement_score":0.0049214573,"about_ca_system_score_codex":0.0019497994,"about_ca_system_score_gemma":0.0013960234,"threshold_uncertainty_score":0.019554615},"labels":[],"label_agreement":null},{"id":"W2187797766","doi":"10.1109/wimob.2015.7347975","title":"Blind deconvolution using compressed sensing in time dispersive MIMO OFDM systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"MIMO; Algorithm; Orthogonal frequency-division multiplexing; Computer science; Compressed sensing; Blind signal separation; Precoding; Deconvolution; Baseband; Subcarrier; QAM; MIMO-OFDM; Channel (broadcasting); Quadrature amplitude modulation; Mathematics; Telecommunications; Decoding methods; Bandwidth (computing); Bit error rate","score_opus":0.05106231080557576,"score_gpt":0.25374815107821036,"score_spread":0.2026858402726346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2187797766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018342927,0.0002998827,0.97989696,0.00012487304,0.00002712204,0.000020735128,0.000019697636,0.00011535901,0.0011524395],"genre_scores_gemma":[0.5456651,0.0007103228,0.4508579,0.00013910011,0.00010857123,0.000072126626,0.0000756733,0.00002524134,0.0023460155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997185,0.00007413931,0.000011902892,0.000037550548,0.0001400363,0.000017829274],"domain_scores_gemma":[0.999577,0.0002487675,0.00006104286,0.000046101693,0.000055525,0.000011651133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038689387,0.0003502467,0.00032465832,0.00030719873,0.00024728003,0.000365685,0.00037676303,0.000592285,0.0005004277],"category_scores_gemma":[0.001160067,0.00013644608,0.00024261701,0.00028745335,0.00059261365,0.0006346947,0.0004828152,0.00049360195,0.00013263559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026794046,0.00009085153,0.0007371502,0.00019116655,0.000061308405,0.0002392519,0.00018823547,0.68631536,0.048914418,0.0482033,0.0011887308,0.2136023],"study_design_scores_gemma":[0.000011310134,0.000033279066,0.0001309443,0.0000070806586,0.0000055138494,0.00007406259,0.00001101446,0.98804456,0.005847857,0.0050874404,0.00073780405,0.000009169933],"about_ca_topic_score_codex":0.001410744,"about_ca_topic_score_gemma":0.0012410453,"teacher_disagreement_score":0.001410744,"about_ca_system_score_codex":0.0003184926,"about_ca_system_score_gemma":0.0004686353,"threshold_uncertainty_score":0.0028049946},"labels":[],"label_agreement":null},{"id":"W2188896417","doi":"10.1016/j.jco.2015.07.002","title":"Stability of the elastic net estimator","year":2015,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Elastic net regularization; Mathematics; Lasso (programming language); Restricted isometry property; Estimator; Applied mathematics; Stability (learning theory); Regularization (linguistics); Compressed sensing; Term (time); Mathematical optimization; Algorithm; Regression; Computer science; Statistics; Artificial intelligence; Machine learning","score_opus":0.09754639743873322,"score_gpt":0.26980664294640816,"score_spread":0.17226024550767494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188896417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060118604,0.00042654708,0.925973,0.0013912568,0.00013545925,0.000036029178,0.00017003527,0.00015578246,0.01159332],"genre_scores_gemma":[0.9119664,0.0005880557,0.06947239,0.0002657449,0.0002326754,0.00011614739,0.00037109508,0.00022831172,0.016759243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991456,0.00027916767,0.000028215214,0.00021332793,0.0002535149,0.000080173566],"domain_scores_gemma":[0.99086034,0.006479355,0.0006411311,0.0005463599,0.001203999,0.00026877996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028266637,0.0007178597,0.0007171862,0.0009545183,0.00063182245,0.0018208997,0.0010169849,0.0011907314,0.003942211],"category_scores_gemma":[0.022387808,0.00051995297,0.00037605074,0.00040946284,0.0025575515,0.0025434655,0.002427406,0.0017508009,0.00074535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054941914,0.000055689445,0.0036531123,0.00017810216,0.00009437961,0.00023108281,0.00022645081,0.44252753,0.014179616,0.4929053,0.003590376,0.041808996],"study_design_scores_gemma":[0.000010969587,0.000026630118,0.00060665066,0.000019222834,0.000006417185,0.0000671042,0.000029172446,0.94466925,0.0016049336,0.052272025,0.00066940155,0.000018277095],"about_ca_topic_score_codex":0.0018671908,"about_ca_topic_score_gemma":0.0013798099,"teacher_disagreement_score":0.003942211,"about_ca_system_score_codex":0.0009391579,"about_ca_system_score_gemma":0.0011896176,"threshold_uncertainty_score":0.014948964},"labels":[],"label_agreement":null},{"id":"W2204293552","doi":"","title":"Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Cancer Agency","funders":"","keywords":"Cluster analysis; Scale (ratio); Sampling (signal processing); Computer science; Statistics; Mathematics; Spectral clustering; Pattern recognition (psychology); Artificial intelligence; Geography","score_opus":0.038972915358201576,"score_gpt":0.25788230968374315,"score_spread":0.21890939432554157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204293552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067265546,0.0001358287,0.9924429,0.00012626214,0.000026148866,0.000033330343,0.00003959647,0.00013215991,0.0003372032],"genre_scores_gemma":[0.29252732,0.00041377664,0.70267147,0.00025092467,0.00019714347,0.00031998934,0.0006576026,0.00018457533,0.0027771425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.00052051333,0.000074581105,0.00024503926,0.00040614585,0.0000759231],"domain_scores_gemma":[0.9966588,0.0021426366,0.0002778285,0.000356869,0.0004252513,0.00013864896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019414112,0.0010209909,0.0020140058,0.0010347841,0.00073716266,0.001107318,0.0021994526,0.002146889,0.0019345199],"category_scores_gemma":[0.011340695,0.00080366805,0.00085489656,0.001610704,0.0012911021,0.0022508705,0.0018444528,0.0018469327,0.0007446635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005090964,0.0002815028,0.0012016201,0.00041644706,0.0001418074,0.00012400185,0.0003807028,0.7031092,0.014172767,0.04541404,0.0062308055,0.22801802],"study_design_scores_gemma":[0.00001107305,0.000028497741,0.000091055816,0.0000070329434,0.00000389592,0.000029002113,0.00002284065,0.9884526,0.0008193749,0.010111483,0.00041485368,0.000008328896],"about_ca_topic_score_codex":0.0032520955,"about_ca_topic_score_gemma":0.0044077146,"teacher_disagreement_score":0.0032520955,"about_ca_system_score_codex":0.00088360225,"about_ca_system_score_gemma":0.0012668456,"threshold_uncertainty_score":0.010267317},"labels":[],"label_agreement":null},{"id":"W2207470643","doi":"10.1109/jsen.2015.2397874","title":"CMOS Image Sensor With Area-Efficient Block-Based Compressive Sensing","year":2015,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; CMC Microsystems","keywords":"Linearity; Integrator; Pixel; CMOS; Image sensor; Block (permutation group theory); Electronic engineering; Scalability; CMOS sensor; Computer science; Compressed sensing; Transistor; Encoding (memory); Materials science; Computer hardware; Electrical engineering; Engineering; Artificial intelligence; Voltage; Mathematics","score_opus":0.02675725627970461,"score_gpt":0.23253448352989317,"score_spread":0.20577722725018857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207470643","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6635037,0.0014744321,0.32323566,0.00056654506,0.00015134034,0.00026404092,0.0006485961,0.0012732879,0.008882444],"genre_scores_gemma":[0.73933667,0.0003126945,0.2568544,0.00014928429,0.000031722953,0.00009653936,0.00022072195,0.00003780377,0.0029601017],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997186,0.000023896759,0.00001182372,0.00004621749,0.00017523415,0.00002431258],"domain_scores_gemma":[0.9996532,0.00006431903,0.000080968886,0.000036007215,0.000142256,0.000023232355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022979749,0.0002486079,0.00026650075,0.00018678114,0.000105727784,0.00022943274,0.0005721113,0.00035524857,0.0010183399],"category_scores_gemma":[0.00040924724,0.00015963025,0.00012105713,0.00024388028,0.0001553893,0.00050734705,0.0002962188,0.0002641998,0.00042606166],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006502805,0.000037450493,0.00039339592,0.000060907343,0.000011309733,0.000028956614,0.000020824391,0.002611883,0.9818252,0.0006769387,0.0003410007,0.013927],"study_design_scores_gemma":[0.00002272832,0.0005508354,0.0015773219,0.000006275966,0.000017504475,0.00013554179,0.000013008321,0.071811534,0.9218879,0.0001582652,0.0038005388,0.000018567836],"about_ca_topic_score_codex":0.0007803239,"about_ca_topic_score_gemma":0.0018427611,"teacher_disagreement_score":0.0010183399,"about_ca_system_score_codex":0.00032584532,"about_ca_system_score_gemma":0.00032490757,"threshold_uncertainty_score":0.0034067035},"labels":[],"label_agreement":null},{"id":"W2208525479","doi":"10.1609/aaai.v25i1.7935","title":"Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs; University of Alberta","keywords":"Subspace topology; A priori and a posteriori; Computer science; Feature (linguistics); Artificial intelligence; Generalization; Machine learning; Neural coding; Semi-supervised learning; Supervised learning; Pattern recognition (psychology); Regular polygon; Mathematics; Artificial neural network","score_opus":0.0905704855965066,"score_gpt":0.2661249136904318,"score_spread":0.17555442809392519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208525479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010238285,0.00056753185,0.9862059,0.00043261403,0.00002563233,0.000023206576,0.00009901061,0.00009624465,0.0023116027],"genre_scores_gemma":[0.6104022,0.0025473025,0.37975058,0.00043455616,0.0005292602,0.00031285523,0.0008223479,0.00013136854,0.0050695986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785066,0.0010088404,0.00008660831,0.00032138897,0.00061127153,0.00012122357],"domain_scores_gemma":[0.99260074,0.0042186747,0.00086203153,0.0013469057,0.00080470834,0.00016692208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025351632,0.0007910719,0.0011006702,0.0008571453,0.00042546724,0.0011203063,0.0014440013,0.00108186,0.0011871703],"category_scores_gemma":[0.009961443,0.0004642035,0.00065420324,0.0016451346,0.0026573401,0.0026987942,0.002250833,0.0022674839,0.00033426838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000124833,0.000092056434,0.0008140428,0.00024641253,0.00006635035,0.00013745307,0.00020677054,0.45187426,0.0024274548,0.42228076,0.0039071445,0.11782235],"study_design_scores_gemma":[0.00000876238,0.00003053088,0.0001637952,0.000014786102,0.0000054767565,0.00005636993,0.000016771011,0.8122677,0.0005088992,0.18587902,0.0010357117,0.00001215016],"about_ca_topic_score_codex":0.0015871903,"about_ca_topic_score_gemma":0.001806571,"teacher_disagreement_score":0.0025351632,"about_ca_system_score_codex":0.0006409376,"about_ca_system_score_gemma":0.0009007714,"threshold_uncertainty_score":0.013407409},"labels":[],"label_agreement":null},{"id":"W2224568587","doi":"10.48550/arxiv.1601.01988","title":"Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; Alfred P. Sloan Foundation","keywords":"Compressed sensing; Restricted isometry property; Corollary; Signal recovery; Property (philosophy); Isometry (Riemannian geometry); Wavelet; Class (philosophy); Algorithm; Mathematics; Inverse; Inverse problem; Computer science; Focus (optics); Current (fluid); Applied mathematics; Mathematical optimization; Pure mathematics; Mathematical analysis; Artificial intelligence; Physics; Geometry","score_opus":0.05838869275282034,"score_gpt":0.1788648547722384,"score_spread":0.12047616201941806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224568587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018035647,0.000627305,0.973868,0.00076196704,0.000059359907,0.000029993247,0.00018293,0.00026855624,0.006166226],"genre_scores_gemma":[0.7890851,0.0023661614,0.19942087,0.0011666926,0.0007600223,0.00019253787,0.00071354304,0.00047383897,0.0058212364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827826,0.0005013455,0.00006610207,0.00027503973,0.0007197383,0.00015957275],"domain_scores_gemma":[0.9903467,0.0061222585,0.0008094277,0.0017126641,0.000715869,0.00029299682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002338492,0.0009306321,0.0008006899,0.00083060603,0.00042168764,0.0013146319,0.001192797,0.0011195947,0.0035632947],"category_scores_gemma":[0.020685498,0.00037320668,0.00063198234,0.0010356525,0.0022420038,0.0045332084,0.0033746006,0.0033942773,0.00090151845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003894523,0.00010113354,0.0017159835,0.00041189394,0.00006757434,0.00029124558,0.00034347567,0.13091174,0.016664231,0.71695906,0.010373041,0.12177112],"study_design_scores_gemma":[0.000032700715,0.00015401896,0.00059409364,0.00006244723,0.000020323398,0.00037086263,0.000097728385,0.62188834,0.0073198844,0.36429718,0.0051314468,0.00003092804],"about_ca_topic_score_codex":0.0005668595,"about_ca_topic_score_gemma":0.00047431278,"teacher_disagreement_score":0.0035632947,"about_ca_system_score_codex":0.0006583795,"about_ca_system_score_gemma":0.0006843533,"threshold_uncertainty_score":0.012367308},"labels":[],"label_agreement":null},{"id":"W2236679046","doi":"10.1109/isit.2016.7541723","title":"Universal compressed sensing","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Compressed sensing; Entropy (arrow of time); Mixing (physics); Algorithm; Heuristic; Stochastic process; Lagrangian; Mathematics; Asymptotically optimal algorithm; Set (abstract data type); Computer science; Stationary process; Mathematical optimization; Applied mathematics","score_opus":0.010473693584334509,"score_gpt":0.1884034965937609,"score_spread":0.1779298030094264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236679046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036398235,0.00070550496,0.99303764,0.00019598454,0.00004425444,0.00003607815,0.000046214456,0.0001434462,0.0021510767],"genre_scores_gemma":[0.3830809,0.002529912,0.60939175,0.0006668037,0.00038622358,0.00027667725,0.000333326,0.0001375263,0.0031969054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976731,0.00075940765,0.00013138198,0.0005355083,0.0007415061,0.00015898341],"domain_scores_gemma":[0.995256,0.0028633287,0.0004190811,0.000973115,0.00035963627,0.00012892348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031738123,0.0008821835,0.0015720587,0.001221485,0.0005870532,0.0012784007,0.0014445322,0.0011726723,0.0019649728],"category_scores_gemma":[0.013376553,0.0005221044,0.00067823246,0.0010829768,0.002539974,0.0028182906,0.0034907565,0.001623998,0.00051694247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014096985,0.000065837754,0.00046509248,0.0003996898,0.00008443398,0.00010399769,0.00016558668,0.16252066,0.006255929,0.6665922,0.0028762633,0.16032931],"study_design_scores_gemma":[0.00002735898,0.0001220904,0.00015820329,0.00009134257,0.000022073176,0.00021752685,0.00004042007,0.7718476,0.004578925,0.21645018,0.006416923,0.000027364873],"about_ca_topic_score_codex":0.00068398786,"about_ca_topic_score_gemma":0.00058145204,"teacher_disagreement_score":0.0031738123,"about_ca_system_score_codex":0.0009674961,"about_ca_system_score_gemma":0.0009928893,"threshold_uncertainty_score":0.016784906},"labels":[],"label_agreement":null},{"id":"W2253497723","doi":"10.1007/s10107-018-1351-8","title":"Level-set methods for convex optimization","year":2018,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Office of Naval Research; U.S. Air Force; Directorate for Mathematical and Physical Sciences; Washington Research Foundation; National Science Foundation","keywords":"Mathematical optimization; Optimization problem; Inference; Set (abstract data type); Convex optimization; Rank (graph theory); Sequence (biology); Computer science; Range (aeronautics); Parametric statistics; Feasible region; Convex function; Regular polygon; Conic optimization; Constraint (computer-aided design); Mathematics; Convex set; Artificial intelligence","score_opus":0.11906332708385735,"score_gpt":0.3848609881634698,"score_spread":0.26579766107961245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253497723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006868956,0.0013709741,0.9920249,0.00081961515,0.00017320005,0.00002382549,0.0001216579,0.00016122694,0.004617688],"genre_scores_gemma":[0.08369111,0.005904313,0.88471806,0.00079315505,0.0011946791,0.00063597894,0.0006964881,0.0013701523,0.020996084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.0007113773,0.000065675544,0.00015458332,0.0004357016,0.000049607796],"domain_scores_gemma":[0.99540234,0.0033479189,0.00022845904,0.00039013068,0.0004860439,0.0001451677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027579842,0.0027143129,0.0022501627,0.0018336471,0.0007311472,0.003460446,0.0022072145,0.0030140108,0.008307155],"category_scores_gemma":[0.014198779,0.0011903101,0.0013760299,0.0025043574,0.002937008,0.0035099403,0.0036984591,0.008664736,0.0029801328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039180304,0.000066411914,0.0001602454,0.00046598926,0.0000970362,0.00006662831,0.00011260605,0.08547754,0.0011799071,0.8376333,0.01703134,0.05766989],"study_design_scores_gemma":[0.000016492426,0.000011296757,0.0000541193,0.000059036192,0.000016967095,0.000029704888,0.000017869284,0.44577786,0.00041047222,0.54445344,0.009138705,0.000014051347],"about_ca_topic_score_codex":0.0023980162,"about_ca_topic_score_gemma":0.0027193697,"teacher_disagreement_score":0.008307155,"about_ca_system_score_codex":0.001562975,"about_ca_system_score_gemma":0.0014902061,"threshold_uncertainty_score":0.027790189},"labels":[],"label_agreement":null},{"id":"W2259686793","doi":"10.1190/geo2015-0216.1","title":"Compressive sensing imaging of microseismic events constrained by the sign-bit","year":2016,"lang":"en","type":"article","venue":"Geophysics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Microseism; Sign (mathematics); Computer science; Compressed sensing; Amplitude; Constraint (computer-aided design); Operator (biology); Algorithm; Reflection (computer programming); Noise (video); Synthetic data; Image (mathematics); Geology; Seismology; Artificial intelligence; Optics; Mathematics; Physics","score_opus":0.005870248908281956,"score_gpt":0.19747446275435807,"score_spread":0.19160421384607612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2259686793","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21589279,0.00009891595,0.78166634,0.0002732819,0.00002519689,0.000022880458,0.00009634888,0.0001593471,0.0017648597],"genre_scores_gemma":[0.825161,0.00010523394,0.17374344,0.000054128373,0.000033684126,0.00002488679,0.00015593946,0.000025445564,0.00069619896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981695,0.00005310382,0.0000122376505,0.000024446294,0.00007389488,0.000019401916],"domain_scores_gemma":[0.9992735,0.00036758458,0.00012704341,0.00008759313,0.00011737824,0.000027013526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005022594,0.0003542882,0.0002973194,0.00021011257,0.000112085436,0.00041947895,0.00032657868,0.00040867142,0.00056891824],"category_scores_gemma":[0.0023643586,0.00014290473,0.00015825307,0.00027348794,0.00043029184,0.0005941698,0.0006007233,0.00047589288,0.00012663617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007327458,0.000080291975,0.002625867,0.00017368638,0.00004258857,0.0003468676,0.00019933848,0.56810796,0.25875503,0.028172914,0.00092779455,0.13983496],"study_design_scores_gemma":[0.000016151982,0.00006320242,0.0011061308,0.000008945324,0.000005560734,0.000092162576,0.000025485288,0.96032196,0.032922946,0.0048556197,0.0005669404,0.000014883877],"about_ca_topic_score_codex":0.0005219787,"about_ca_topic_score_gemma":0.00067522353,"teacher_disagreement_score":0.00056891824,"about_ca_system_score_codex":0.00013266518,"about_ca_system_score_gemma":0.0003280966,"threshold_uncertainty_score":0.0026562214},"labels":[],"label_agreement":null},{"id":"W2261523598","doi":"10.48550/arxiv.1509.08581","title":"Optimization over Sparse Symmetric Sets via a Nonmonotone Projected Gradient Method","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lipschitz continuity; Stationary point; Differentiable function; Point (geometry); Mathematical optimization; Function (biology); Applied mathematics; Gradient method; Constant (computer programming); Variable (mathematics); Optimization problem; Mathematics; Interior point method; Class (philosophy); Computer science; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.07577196718576727,"score_gpt":0.21553543256836444,"score_spread":0.13976346538259715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261523598","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063077156,0.000080543105,0.9927563,0.000112413254,0.000018421237,0.0000226552,0.000020655432,0.000052330386,0.0006289706],"genre_scores_gemma":[0.33112004,0.00041962572,0.66409516,0.00016135487,0.0001003031,0.0001976567,0.000145735,0.00006726162,0.0036927664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996935,0.00012663077,0.000011449953,0.00005321081,0.00009516388,0.000020066149],"domain_scores_gemma":[0.9996424,0.00020789476,0.000038630602,0.000030033942,0.000056276065,0.000024868163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007593025,0.0008245616,0.00091757,0.0003571953,0.00023669846,0.00050591136,0.00093965913,0.0010194193,0.0012572848],"category_scores_gemma":[0.0014864865,0.00035945897,0.00052892615,0.0004997544,0.000781728,0.0009835997,0.000994819,0.0010138168,0.00026759686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008694281,0.00006565999,0.00033113483,0.00017131644,0.000045216064,0.0001391185,0.000057703644,0.90504324,0.007181651,0.039608784,0.0014608675,0.04580836],"study_design_scores_gemma":[0.000005860442,0.000019027695,0.000024175375,0.0000019682377,0.0000017737613,0.000010976557,0.0000021588269,0.9963832,0.0004625119,0.002895205,0.00019069905,0.0000023792707],"about_ca_topic_score_codex":0.0012860739,"about_ca_topic_score_gemma":0.001190097,"teacher_disagreement_score":0.0012860739,"about_ca_system_score_codex":0.00034241026,"about_ca_system_score_gemma":0.0007627023,"threshold_uncertainty_score":0.0042060018},"labels":[],"label_agreement":null},{"id":"W2262590824","doi":"10.1109/wcnc.2015.7127542","title":"An adaptive matching pursuit algorithm for sparse channel estimation","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Matching pursuit; Compressed sensing; A priori and a posteriori; Algorithm; Computer science; Orthogonal frequency-division multiplexing; Channel (broadcasting); Mean squared error; Computational complexity theory; Matching (statistics); Estimation; Mathematics; Statistics; Telecommunications","score_opus":0.048372686307336515,"score_gpt":0.2746841445333013,"score_spread":0.2263114582259648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262590824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019242392,0.00010395411,0.9973802,0.00004611871,0.000022270606,0.000014228877,0.00000978834,0.00007703797,0.00042214754],"genre_scores_gemma":[0.10827417,0.00048466015,0.88914526,0.00008950801,0.00009931321,0.000112736845,0.00011397506,0.00004272109,0.0016377034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994234,0.00014522756,0.00002715306,0.00009031792,0.00028038712,0.000033583347],"domain_scores_gemma":[0.99945265,0.00028331878,0.000050511586,0.000059169197,0.00013656856,0.00001783693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072286156,0.00048260263,0.000591668,0.00065082056,0.00030513096,0.00036955407,0.00083527726,0.00075448223,0.0012817614],"category_scores_gemma":[0.002969767,0.00025105415,0.00044227412,0.0011494888,0.00043507674,0.0010801542,0.0009040663,0.0010930669,0.00053978874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021079202,0.00008980901,0.0005563028,0.0001540316,0.00006965563,0.00010711666,0.000080564714,0.25039953,0.030178104,0.03715884,0.0025869594,0.6784082],"study_design_scores_gemma":[0.000015134105,0.000049234026,0.00009251077,0.000005371381,0.000006567648,0.00007682794,0.000005561619,0.9906963,0.003174905,0.0039343415,0.0019352064,0.000008115719],"about_ca_topic_score_codex":0.001011445,"about_ca_topic_score_gemma":0.0009047239,"teacher_disagreement_score":0.0012817614,"about_ca_system_score_codex":0.00024526168,"about_ca_system_score_gemma":0.00063916034,"threshold_uncertainty_score":0.004287958},"labels":[],"label_agreement":null},{"id":"W2272279111","doi":"10.1109/tit.2015.2448658","title":"Restricted Isometry Property of Random Subdictionaries","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Computing and Communication Foundations","keywords":"Restricted isometry property; Block matrix; Property (philosophy); Isometry (Riemannian geometry); Matrix (chemical analysis); Coherence (philosophical gambling strategy); Row; Random matrix","score_opus":0.01640946113108891,"score_gpt":0.21075955234719673,"score_spread":0.19435009121610783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272279111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16979863,0.00027502916,0.8233191,0.00048321052,0.00003468337,0.00007702691,0.00019332474,0.00022342596,0.0055955504],"genre_scores_gemma":[0.9523198,0.00030592916,0.043396894,0.00019154183,0.00009444915,0.00015701694,0.00027526735,0.00009506917,0.0031639007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818736,0.00050926406,0.00011097289,0.0003824365,0.00054197904,0.00026784837],"domain_scores_gemma":[0.9809996,0.011385253,0.0026625975,0.0029318489,0.0013818302,0.0006388427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020475774,0.00055839,0.0008201513,0.0008851578,0.0005836819,0.0008506658,0.0010869907,0.0008239512,0.0028359985],"category_scores_gemma":[0.02021002,0.00062554906,0.00063779304,0.000669531,0.0024658462,0.0028367282,0.0018869407,0.0015884119,0.00058998034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041914632,0.00013946962,0.005005729,0.00018556292,0.00007846386,0.0007848893,0.0005157021,0.25157475,0.023179939,0.6873345,0.0024553584,0.02832653],"study_design_scores_gemma":[0.000032233947,0.00015849184,0.0010205104,0.000015963553,0.000011407526,0.0003138282,0.00009081305,0.87512493,0.004536941,0.117434025,0.0012353902,0.000025500538],"about_ca_topic_score_codex":0.00073264015,"about_ca_topic_score_gemma":0.00055982993,"teacher_disagreement_score":0.0028359985,"about_ca_system_score_codex":0.0006238584,"about_ca_system_score_gemma":0.00067999156,"threshold_uncertainty_score":0.010828793},"labels":[],"label_agreement":null},{"id":"W2287259016","doi":"10.1007/s10107-015-0965-3","title":"A family of second-order methods for convex $$\\ell _1$$-regularized optimization","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Google; U.S. Department of Energy; National Science Foundation","keywords":"Orthant; Mathematics; Mathematical optimization; Proximal gradient methods for learning; Regularization (linguistics); Convex function; Regular polygon; Convex optimization; Applied mathematics; Algorithm; Subderivative; Computer science; Artificial intelligence","score_opus":0.05664813614882776,"score_gpt":0.3321507346713604,"score_spread":0.27550259852253267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287259016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035405063,0.00034158854,0.99720734,0.00017686178,0.00012692626,0.000027215056,0.00005236762,0.00009645972,0.0016170294],"genre_scores_gemma":[0.027470153,0.0018992446,0.9496026,0.0005458233,0.0004888845,0.00051617663,0.00038062784,0.0007467424,0.018349737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.00070217694,0.000073275114,0.00016555942,0.00049840857,0.00007737136],"domain_scores_gemma":[0.9973168,0.0015265128,0.00017295124,0.00032340497,0.00049048086,0.00016980174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377787,0.0028462533,0.0017903475,0.0017703208,0.0007076579,0.0019298466,0.002805631,0.0028464345,0.005861186],"category_scores_gemma":[0.0082468,0.0011694707,0.002636102,0.001812689,0.0020718588,0.0021590055,0.0033970417,0.0064367875,0.0030356827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014344792,0.00017640089,0.00034655505,0.00076288846,0.00019041006,0.00012596516,0.00019812245,0.2760501,0.0067463596,0.49732828,0.026739992,0.19119148],"study_design_scores_gemma":[0.000014516457,0.000048547703,0.00006107316,0.000046413956,0.000017790107,0.00005858635,0.000015539004,0.9311756,0.0011628021,0.054055694,0.013318009,0.000025516858],"about_ca_topic_score_codex":0.0024614797,"about_ca_topic_score_gemma":0.0040795095,"teacher_disagreement_score":0.005861186,"about_ca_system_score_codex":0.0010554468,"about_ca_system_score_gemma":0.002055346,"threshold_uncertainty_score":0.019607663},"labels":[],"label_agreement":null},{"id":"W2290557898","doi":"10.1109/globalsip.2015.7418305","title":"Single-channel compressive sampling of electrical data for non-intrusive load monitoring","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Sampling (signal processing); Compressed sensing; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering; Artificial intelligence","score_opus":0.15158529326124698,"score_gpt":0.3149665144610331,"score_spread":0.1633812211997861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290557898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07940574,0.00032629535,0.91679657,0.000341117,0.00006578784,0.00009066314,0.00023620317,0.00063589687,0.0021016733],"genre_scores_gemma":[0.69750476,0.00051590096,0.29999146,0.0001938106,0.00012131586,0.0001436125,0.00045067238,0.00005983874,0.0010186259],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957305,0.00013004118,0.000020743148,0.00005729454,0.00019053245,0.000028373377],"domain_scores_gemma":[0.9987974,0.0007021719,0.00013362172,0.00019568036,0.00013559374,0.000035461177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005921064,0.0004885326,0.00039360393,0.00044664886,0.0002674489,0.00033741604,0.00057393487,0.00045080928,0.001074357],"category_scores_gemma":[0.0035445238,0.0001532327,0.00016726233,0.0006491795,0.00044851628,0.00087878655,0.0005535912,0.00047220176,0.0003483327],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080693245,0.0004289904,0.0046504117,0.0005499701,0.00007475809,0.00035967721,0.00034652124,0.29047742,0.18557727,0.015335314,0.004778362,0.49661434],"study_design_scores_gemma":[0.000030440122,0.00020147715,0.00182133,0.000030713527,0.00001366017,0.00024799013,0.000086553475,0.9389319,0.050514616,0.005517674,0.0025756115,0.000028084209],"about_ca_topic_score_codex":0.0007570732,"about_ca_topic_score_gemma":0.0014286531,"teacher_disagreement_score":0.001074357,"about_ca_system_score_codex":0.00021873976,"about_ca_system_score_gemma":0.00032540728,"threshold_uncertainty_score":0.0035940409},"labels":[],"label_agreement":null},{"id":"W2294328226","doi":"10.1109/icip.2015.7350889","title":"Sparse tensor recovery via combined first and second order high-accuracy total variation","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Hessian matrix; ENCODE; Compressed sensing; Regularization (linguistics); Minification; Computer science; Algorithm; Range (aeronautics); Variation (astronomy); Tensor (intrinsic definition); Total variation denoising; Feature (linguistics); Mathematics; Artificial intelligence; Mathematical optimization; Noise reduction; Applied mathematics","score_opus":0.014297945572659856,"score_gpt":0.20103309958274587,"score_spread":0.186735154010086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294328226","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012328902,0.00014509294,0.9862986,0.00011483686,0.000019159692,0.000012000194,0.00001320418,0.000121903264,0.0009462724],"genre_scores_gemma":[0.30831438,0.00038615518,0.68768454,0.00007766733,0.000052934476,0.000057613248,0.00008522874,0.00009590563,0.0032455393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993789,0.00017723595,0.000024718434,0.00007056652,0.00031165947,0.000036908135],"domain_scores_gemma":[0.99932826,0.0002997262,0.00011626564,0.00012395004,0.00009691501,0.000034869914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008623099,0.0006350091,0.00048958615,0.0005480724,0.00025901102,0.0007454516,0.00056527974,0.00074418925,0.0006824665],"category_scores_gemma":[0.0023053512,0.000311074,0.00055044366,0.0006400955,0.00090509374,0.0010313572,0.0012006641,0.0009529332,0.00026965135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001690407,0.00008590052,0.0010776076,0.00020860147,0.000073743344,0.000230152,0.00027247268,0.6233755,0.09473019,0.0915978,0.0017536504,0.18642533],"study_design_scores_gemma":[0.000006095259,0.0000412907,0.000108486776,0.0000055840987,0.000004511669,0.00008070569,0.000007742386,0.9852387,0.008128323,0.0052018734,0.0011660976,0.000010648534],"about_ca_topic_score_codex":0.0014165612,"about_ca_topic_score_gemma":0.0021446121,"teacher_disagreement_score":0.0014165612,"about_ca_system_score_codex":0.00033993155,"about_ca_system_score_gemma":0.00066757685,"threshold_uncertainty_score":0.004560411},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03830852518159136,"score_gpt":0.25052995034117015,"score_spread":0.21222142515957879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294622949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06131441,0.0009149937,0.9339,0.000787013,0.00007371526,0.000035670786,0.00012215412,0.00050003815,0.0023520505],"genre_scores_gemma":[0.6607657,0.0013868699,0.33093664,0.00056340336,0.00009279799,0.0001850318,0.00050932367,0.00042177166,0.0051384484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959259,0.0010284319,0.00028571233,0.00067495985,0.0018012709,0.00028369902],"domain_scores_gemma":[0.9682521,0.024527192,0.001856781,0.0025960987,0.0023283644,0.00043938146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00850475,0.0010569566,0.0011698679,0.00070102804,0.0003492363,0.0012229745,0.0014450282,0.0016884988,0.0017369202],"category_scores_gemma":[0.056453723,0.00060343614,0.0005395848,0.00064523285,0.0024053885,0.0035287582,0.0025927026,0.0028498906,0.0006101575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015883626,0.00017900094,0.005582762,0.0008792722,0.0001574534,0.0004913636,0.0007161848,0.6763823,0.061621405,0.13138446,0.0024802657,0.1185372],"study_design_scores_gemma":[0.000022279906,0.00011228042,0.0010345582,0.000095905445,0.000012959825,0.00013750693,0.00005446043,0.9579249,0.015348808,0.024487263,0.0007373645,0.0000315969],"about_ca_topic_score_codex":0.0013960613,"about_ca_topic_score_gemma":0.0009773653,"teacher_disagreement_score":0.00850475,"about_ca_system_score_codex":0.0012448041,"about_ca_system_score_gemma":0.0010827014,"threshold_uncertainty_score":0.044977963},"labels":[],"label_agreement":null},{"id":"W2294836692","doi":"10.1049/iet-ipr.2015.0103","title":"Robust moving object detection using compressed sensing","year":2015,"lang":"en","type":"article","venue":"IET Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Object detection; Compressed sensing; Computer vision; Artificial intelligence; Object (grammar); Remote sensing; Pattern recognition (psychology); Geology","score_opus":0.05370462129760175,"score_gpt":0.25522128835605995,"score_spread":0.2015166670584582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294836692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034042295,0.00076805975,0.9629574,0.00022058754,0.000081255246,0.000035929108,0.000058616228,0.00052071916,0.0013150465],"genre_scores_gemma":[0.54161274,0.00089059677,0.45409554,0.00030132884,0.00024060643,0.00007321641,0.000420506,0.00007769319,0.0022877248],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993672,0.0001142635,0.000024904695,0.00012209774,0.00032950583,0.00004200722],"domain_scores_gemma":[0.99930286,0.00033839358,0.00009889413,0.000086740474,0.00014537715,0.000027807437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049478526,0.000630151,0.0006506587,0.0011222957,0.00020862752,0.0004821111,0.0007312518,0.0008521829,0.00069046783],"category_scores_gemma":[0.002353179,0.0002341461,0.00040542765,0.00083352294,0.0004534359,0.0010206846,0.0007078423,0.0006077155,0.00025259316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005036143,0.00015556197,0.0012438828,0.00025877642,0.00014923912,0.0003774891,0.00017269117,0.14128485,0.21023166,0.020755854,0.0044040387,0.6204623],"study_design_scores_gemma":[0.000015440786,0.00008334428,0.00062076095,0.00001036594,0.000015174851,0.00017884359,0.000014980033,0.9719972,0.021838987,0.0034493199,0.0017561777,0.000019431931],"about_ca_topic_score_codex":0.0015828393,"about_ca_topic_score_gemma":0.0011299638,"teacher_disagreement_score":0.0015828393,"about_ca_system_score_codex":0.00032431248,"about_ca_system_score_gemma":0.00038966534,"threshold_uncertainty_score":0.003147304},"labels":[],"label_agreement":null},{"id":"W2295664350","doi":"10.1109/icip.2015.7351628","title":"Multi-resolution compressed sensing reconstruction via approximate message passing","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compressed sensing; Signal reconstruction; Computer science; Mean squared error; SIGNAL (programming language); Algorithm; Iterative reconstruction; Message passing; Bounded function; Sampling (signal processing); Resolution (logic); Reconstruction algorithm; Signal processing; Artificial intelligence; Computer vision; Mathematics; Telecommunications; Statistics","score_opus":0.04149110301270191,"score_gpt":0.2403143583607981,"score_spread":0.1988232553480962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295664350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064329705,0.00012612429,0.99263835,0.00014526898,0.000018375518,0.000019374424,0.000016694727,0.00007378222,0.0005289891],"genre_scores_gemma":[0.3619071,0.00055998145,0.6341463,0.00019641267,0.00010563424,0.00013281497,0.00010620597,0.000036200643,0.002809506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936515,0.00024468207,0.000028061353,0.000087346736,0.00023250205,0.00004218969],"domain_scores_gemma":[0.9989549,0.0005748869,0.0001364157,0.0001700294,0.000126988,0.00003674318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011832792,0.0007199463,0.000754158,0.00040789595,0.00030408375,0.0007583177,0.0008106437,0.001211307,0.0009938271],"category_scores_gemma":[0.0034833532,0.000245413,0.0004551395,0.00072973245,0.0008986899,0.0013767843,0.001072646,0.0010074677,0.00027204046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024286102,0.00006788046,0.000520791,0.0002345225,0.00006454931,0.0002924999,0.00021803039,0.76114726,0.023675036,0.095651686,0.0012146005,0.11667028],"study_design_scores_gemma":[0.000009917025,0.00004043617,0.000035157664,0.0000051258435,0.000005479256,0.000058704252,0.000007561935,0.9872313,0.004242284,0.007637948,0.0007176053,0.000008419656],"about_ca_topic_score_codex":0.00091238937,"about_ca_topic_score_gemma":0.00066721207,"teacher_disagreement_score":0.001211307,"about_ca_system_score_codex":0.00044418915,"about_ca_system_score_gemma":0.0004887862,"threshold_uncertainty_score":0.0062578917},"labels":[],"label_agreement":null},{"id":"W2297481121","doi":"10.48550/arxiv.1603.05719","title":"Efficient evaluation of scaled proximal operators","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Office of Naval Research","keywords":"Proximal Gradient Methods; Regularization (linguistics); Convex function; Mathematics; Convex optimization; Quadratic equation; Operator (biology); Mathematical optimization; Range (aeronautics); Regular polygon; Proximal gradient methods for learning; Computer science; Metric (unit); Optimization problem; Quadratic programming; Parametric statistics; Applied mathematics; Algorithm; Artificial intelligence; Convex combination","score_opus":0.07360877037135656,"score_gpt":0.20066324588574758,"score_spread":0.12705447551439103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297481121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008800993,0.000108811844,0.9886989,0.000111485766,0.000064178,0.000036754638,0.000040560484,0.00039311763,0.0017452344],"genre_scores_gemma":[0.277433,0.00023082818,0.71690446,0.000107051565,0.00008477,0.00015748094,0.00028564237,0.0004731537,0.004323606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985273,0.00045220132,0.00007721658,0.00015166824,0.0006910842,0.000100407706],"domain_scores_gemma":[0.99684155,0.0016042341,0.00013528357,0.000378754,0.00086088746,0.00017932008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226874,0.00095243985,0.00125813,0.000813817,0.0004287092,0.0016631925,0.0013840885,0.0014548004,0.007508971],"category_scores_gemma":[0.013001465,0.00046396133,0.0005947259,0.0007184244,0.0010269808,0.0018362219,0.0023315484,0.0016011427,0.0014586861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046759078,0.00014847728,0.001060254,0.00040208336,0.000079306774,0.00030592838,0.0002888307,0.56729865,0.027475784,0.14590979,0.008424959,0.24813825],"study_design_scores_gemma":[0.000012205839,0.000032510434,0.000073657044,0.000009857591,0.000003439638,0.00003221157,0.000015024251,0.9819916,0.0026794868,0.014050839,0.0010930455,0.0000061734368],"about_ca_topic_score_codex":0.0011557654,"about_ca_topic_score_gemma":0.001496813,"teacher_disagreement_score":0.007508971,"about_ca_system_score_codex":0.0008062599,"about_ca_system_score_gemma":0.0016386681,"threshold_uncertainty_score":0.02511996},"labels":[],"label_agreement":null},{"id":"W2312147435","doi":"10.3390/s16020201","title":"Block Sparse Compressed Sensing of Electroencephalogram (EEG) Signals by Exploiting Linear and Non-Linear Dependencies","year":2016,"lang":"en","type":"article","venue":"Sensors","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Qatar National Research Fund; Fonds National de la Recherche Luxembourg; Qatar Foundation","keywords":"Computer science; Compressed sensing; Pattern recognition (psychology); Block (permutation group theory); Artificial intelligence; Dependency (UML); Sparse approximation; Channel (broadcasting); Algorithm; Mathematics","score_opus":0.014975621328907292,"score_gpt":0.2286641557413236,"score_spread":0.2136885344124163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312147435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008472911,0.00041542022,0.9900096,0.00016396979,0.000040124967,0.00001775934,0.00005662981,0.0001226966,0.00070086354],"genre_scores_gemma":[0.34990296,0.00220511,0.64277196,0.0003170822,0.00034654298,0.00013746075,0.00076010404,0.0001121709,0.0034465983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969065,0.00007141509,0.000016821998,0.000056552097,0.00014234397,0.00002236635],"domain_scores_gemma":[0.9995028,0.00026947222,0.00006724321,0.00005113067,0.00009183504,0.00001750788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033585037,0.0006699095,0.0005097754,0.00046107813,0.0001754564,0.0003184452,0.0005919016,0.0005630871,0.00077971857],"category_scores_gemma":[0.0018219816,0.0002634462,0.00045752962,0.00060043996,0.00040140026,0.0010122322,0.0005757245,0.00080733007,0.000246796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023396492,0.00011484986,0.0009286117,0.00038698225,0.00010298277,0.00019090617,0.00016985336,0.3517823,0.072880186,0.02506406,0.0046645575,0.5434808],"study_design_scores_gemma":[0.00000918977,0.000041697775,0.00029781973,0.000010197412,0.0000113175365,0.00007914455,0.000012198211,0.98924667,0.0052017937,0.0035573107,0.0015213327,0.000011256869],"about_ca_topic_score_codex":0.0027130211,"about_ca_topic_score_gemma":0.0030214796,"teacher_disagreement_score":0.0027130211,"about_ca_system_score_codex":0.00020266263,"about_ca_system_score_gemma":0.0005392765,"threshold_uncertainty_score":0.005394459},"labels":[],"label_agreement":null},{"id":"W2313395524","doi":"10.1109/focs.2016.47","title":"Local Search Yields a PTAS for $k$-Means in Doubling Metrics","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Euclidean space; Partition (number theory); Euclidean distance; Simple (philosophy); Approximation algorithm; Metric space; Euclidean geometry; Space (punctuation); Local search (optimization); Heuristic; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","score_opus":0.0647369646453559,"score_gpt":0.3000650282161767,"score_spread":0.2353280635708208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313395524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013910691,0.0014482333,0.96442145,0.0011438939,0.00022012752,0.00015007658,0.00023658255,0.0009931255,0.017475875],"genre_scores_gemma":[0.21712907,0.0018527574,0.74875134,0.0012664843,0.00037895518,0.00078677025,0.0008579985,0.0012255617,0.027751096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978143,0.0006459219,0.00015227942,0.0006051399,0.00060306647,0.00017927898],"domain_scores_gemma":[0.9958009,0.0022373444,0.00025584263,0.0007610741,0.0006808789,0.00026387838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023960355,0.0018959066,0.002237638,0.0017251546,0.0017001057,0.00255525,0.0026888456,0.0031916713,0.01091606],"category_scores_gemma":[0.016907154,0.00069235126,0.0021041217,0.0020550194,0.0021991292,0.0048117456,0.0050106007,0.004494894,0.005268591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029422768,0.0001150891,0.0011036344,0.0004891466,0.00011991319,0.00020499171,0.0004054642,0.13386194,0.0036422452,0.65326506,0.02635734,0.18014094],"study_design_scores_gemma":[0.000048716596,0.00017051358,0.0003896152,0.00008646113,0.00004937304,0.00026738,0.00007377865,0.5230583,0.0015852983,0.45808333,0.016136229,0.00005098921],"about_ca_topic_score_codex":0.0042908965,"about_ca_topic_score_gemma":0.0040678713,"teacher_disagreement_score":0.01091606,"about_ca_system_score_codex":0.0025437037,"about_ca_system_score_gemma":0.0021581664,"threshold_uncertainty_score":0.03651786},"labels":[],"label_agreement":null},{"id":"W2313681348","doi":"10.1190/segam2013-0401.1","title":"Marine towed streamer data reconstruction based on compressive sensing","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"ConocoPhillips","keywords":"Compressed sensing; Bandwidth (computing); Seismic survey; Computer science; High resolution; Image resolution; Geology; Remote sensing; Algorithm; Seismology; Computer vision; Telecommunications","score_opus":0.02508865187649847,"score_gpt":0.22356493674096206,"score_spread":0.1984762848644636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313681348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2846335,0.00010161335,0.71235585,0.0001474655,0.000022901137,0.000030402305,0.00011815514,0.00034970374,0.0022404306],"genre_scores_gemma":[0.60062754,0.00009507662,0.3979801,0.000037464553,0.000015106331,0.000031881504,0.00016233837,0.00003103351,0.0010194223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997876,0.00006476559,0.000010376448,0.000034363205,0.00008798221,0.00001493207],"domain_scores_gemma":[0.9996166,0.00018131813,0.00006184974,0.00006431729,0.00005973857,0.00001612996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003189581,0.0004123466,0.00027895469,0.00034438845,0.00012872326,0.00029734208,0.0002740729,0.0003472392,0.00051403244],"category_scores_gemma":[0.0011035027,0.00018616824,0.00019865244,0.0003884453,0.00036513808,0.00064027944,0.00042737942,0.00037142617,0.000105268344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006269357,0.00015045509,0.0057794563,0.00015931984,0.00006811364,0.00027957236,0.0002638311,0.43239266,0.29507643,0.006809445,0.000832809,0.25756103],"study_design_scores_gemma":[0.000023743294,0.00012922709,0.0022197461,0.000007689604,0.000008661012,0.00012693711,0.00004164488,0.9512086,0.04395544,0.0011816284,0.0010737866,0.00002278059],"about_ca_topic_score_codex":0.0012620131,"about_ca_topic_score_gemma":0.0023779415,"teacher_disagreement_score":0.0012620131,"about_ca_system_score_codex":0.00014593102,"about_ca_system_score_gemma":0.00027451094,"threshold_uncertainty_score":0.0025093555},"labels":[],"label_agreement":null},{"id":"W2317105371","doi":"10.1190/segam2012-1288.1","title":"An efficient variable-splitting multiplier method for compressive sensing seismic data reconstruction","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"","keywords":"Compressed sensing; Computer science; Algorithm; Optimization problem; Multiplier (economics); Variable (mathematics); Computation; Synthetic data; Mathematical optimization; Mathematics","score_opus":0.04451886898009269,"score_gpt":0.31024282238140716,"score_spread":0.2657239534013145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317105371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032736768,0.000071591974,0.99579597,0.000058726404,0.000017258864,0.000017437162,0.000024266426,0.0000855268,0.0006556701],"genre_scores_gemma":[0.04512546,0.00013241946,0.9531389,0.000052841922,0.000023403378,0.0000888267,0.00007813382,0.000044267275,0.0013156815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976367,0.00007083553,0.000011158162,0.000031295094,0.0001102303,0.000012704301],"domain_scores_gemma":[0.99974626,0.00012846153,0.000024686571,0.000029728768,0.00005740117,0.000013381161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007009378,0.0006130984,0.0003749191,0.00049054425,0.00020844341,0.00032238793,0.00059286924,0.00059550215,0.002632525],"category_scores_gemma":[0.0012042382,0.00027594078,0.00042722642,0.0006641444,0.00038978015,0.00056346745,0.0007499119,0.00077425904,0.00057261693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022124343,0.00009109327,0.00065225933,0.0003253281,0.00006220404,0.00013927257,0.0001271442,0.3114064,0.098485075,0.06903785,0.003824835,0.51562726],"study_design_scores_gemma":[0.000022137943,0.0000622127,0.000091126545,0.00001027126,0.0000054455545,0.00006285073,0.000006573117,0.9816777,0.009551566,0.0048983176,0.0036020821,0.000009606042],"about_ca_topic_score_codex":0.0007598211,"about_ca_topic_score_gemma":0.0012125699,"teacher_disagreement_score":0.002632525,"about_ca_system_score_codex":0.00030774807,"about_ca_system_score_gemma":0.0008113477,"threshold_uncertainty_score":0.0088067055},"labels":[],"label_agreement":null},{"id":"W2318237764","doi":"10.1190/segam2012-1335.1","title":"Interpolated compressive sensing for seismic data reconstruction","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"ConocoPhillips","keywords":"Compressed sensing; Grid; Computer science; Data acquisition; Bandwidth (computing); Noise (video); Interpolation (computer graphics); Seismic survey; Algorithm; Data mining; Geology; Seismology; Artificial intelligence; Geodesy; Telecommunications","score_opus":0.05696241386277508,"score_gpt":0.27476707749682067,"score_spread":0.2178046636340456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318237764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002483081,0.00015879265,0.99640095,0.00006796341,0.000020907495,0.000010426443,0.00002677294,0.000088662215,0.00074256177],"genre_scores_gemma":[0.25097054,0.0012796515,0.74486405,0.00011764835,0.00014922282,0.00012090566,0.00023076119,0.000056471938,0.0022107062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993369,0.00022406559,0.000026731486,0.00006344651,0.00031689933,0.000032012627],"domain_scores_gemma":[0.9987717,0.00080574723,0.00008655798,0.00013800382,0.00016682403,0.000031084175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008493727,0.00044919466,0.0003712313,0.00059607363,0.00025346817,0.00045413512,0.0006286719,0.00066519977,0.002023474],"category_scores_gemma":[0.003432516,0.00024191524,0.0004048047,0.00091670186,0.00074569887,0.0008250885,0.0007583928,0.00096170756,0.00036554434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020766626,0.000039497736,0.00067193515,0.00025126853,0.00004651357,0.00018907219,0.00013281708,0.6545082,0.020402594,0.10558237,0.002413874,0.21555422],"study_design_scores_gemma":[0.000008242247,0.000032505242,0.000110621426,0.000013490952,0.000004231245,0.000059443242,0.000012532663,0.9786274,0.0030705426,0.015727859,0.0023228058,0.000010369136],"about_ca_topic_score_codex":0.0016209779,"about_ca_topic_score_gemma":0.0015037046,"teacher_disagreement_score":0.002023474,"about_ca_system_score_codex":0.00041024893,"about_ca_system_score_gemma":0.00052239164,"threshold_uncertainty_score":0.00676924},"labels":[],"label_agreement":null},{"id":"W2321304643","doi":"10.1190/segam2012-1460.1","title":"Compressive Seismic Imaging","year":2012,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"ConocoPhillips","keywords":"Geology; Geophysical imaging; Compressed sensing; Seismology; Computer science; Artificial intelligence","score_opus":0.00971747999577515,"score_gpt":0.21328634363566035,"score_spread":0.2035688636398852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321304643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004442316,0.0009700231,0.9750581,0.00088317855,0.00030416023,0.000071567825,0.00042852294,0.00057222246,0.017269889],"genre_scores_gemma":[0.2494189,0.0065794573,0.71060824,0.0017098745,0.0011229924,0.00034585406,0.002671223,0.00031927146,0.027224213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999087,0.00017545893,0.000045300465,0.00017842745,0.00044806782,0.00006585159],"domain_scores_gemma":[0.9990188,0.0003542825,0.000093891365,0.0001788739,0.00029355453,0.000060624523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000835937,0.0012160335,0.00074515684,0.0009728253,0.00040928138,0.0016711059,0.0010606025,0.0014271247,0.008962478],"category_scores_gemma":[0.0032209589,0.00044924393,0.00063652085,0.0011507323,0.0011985536,0.0025083262,0.0021958046,0.0020821325,0.0031383694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043636715,0.00010389518,0.0025418722,0.0008517406,0.00016314171,0.0003950649,0.00031493508,0.13713528,0.061413888,0.21333049,0.027465355,0.55584794],"study_design_scores_gemma":[0.00006601151,0.00026414276,0.0017700454,0.00022091703,0.000070611415,0.0009702068,0.00024671742,0.7588082,0.025568279,0.12041965,0.09147547,0.00011973527],"about_ca_topic_score_codex":0.0013073537,"about_ca_topic_score_gemma":0.0020129392,"teacher_disagreement_score":0.008962478,"about_ca_system_score_codex":0.00066171546,"about_ca_system_score_gemma":0.0010660528,"threshold_uncertainty_score":0.029982507},"labels":[],"label_agreement":null},{"id":"W2321848620","doi":"10.1109/twc.2015.2505315","title":"Novel Compressed Sensing-Based Channel Estimation Algorithm and Near-Optimal Pilot Placement Scheme","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Compressed sensing; Mutual coherence; Algorithm; Computer science; Orthogonal frequency-division multiplexing; Computational complexity theory; Channel (broadcasting); Matching pursuit; Mean squared error; Coherence (philosophical gambling strategy); Bit error rate; Matrix (chemical analysis); Mathematics; Decoding methods; Telecommunications","score_opus":0.055273551161935316,"score_gpt":0.27056241736923603,"score_spread":0.2152888662073007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321848620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041222684,0.00011316337,0.99487346,0.000073760646,0.00003544638,0.00002770909,0.000016788359,0.00019737492,0.0005399721],"genre_scores_gemma":[0.21671371,0.00025732038,0.7808755,0.00014953403,0.00009932343,0.00014070871,0.00013510008,0.00003098631,0.0015978675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.000125027,0.000030105597,0.000109325076,0.00023464751,0.000050381866],"domain_scores_gemma":[0.9994843,0.00018306155,0.000070378504,0.00008659372,0.00014328313,0.00003230338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044195176,0.00054899574,0.00066255976,0.00053966965,0.00040972308,0.00036922516,0.0009209799,0.0008228614,0.0011866185],"category_scores_gemma":[0.0020581246,0.0002942869,0.00032792395,0.00064791396,0.00041566353,0.0011065761,0.0009836929,0.00084355817,0.00048483408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049768656,0.00014197787,0.0007136588,0.00018735148,0.00006119369,0.00034197536,0.00024105598,0.24375884,0.063996725,0.03500513,0.0050780782,0.6499764],"study_design_scores_gemma":[0.000043769778,0.00011273415,0.00012098439,0.000008754832,0.000011003328,0.00034041255,0.000014628651,0.9871005,0.0071584154,0.0029286072,0.0021413697,0.000018729253],"about_ca_topic_score_codex":0.00103752,"about_ca_topic_score_gemma":0.0010604898,"teacher_disagreement_score":0.0011866185,"about_ca_system_score_codex":0.00027125573,"about_ca_system_score_gemma":0.00085665006,"threshold_uncertainty_score":0.0039696097},"labels":[],"label_agreement":null},{"id":"W2321879172","doi":"10.1109/tbme.2015.2401512","title":"Compressive Sensing of Foot Gait Signals and Its Application for the Estimation of Clinically Relevant Time Series","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Biomedical Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canada Research Chairs","keywords":"Gait; Algorithm; STRIDE; Compressed sensing; Series (stratigraphy); SIGNAL (programming language); Interval (graph theory); Computer science; Swing; Range (aeronautics); Compression ratio; Mathematics; Engineering","score_opus":0.01972298498085701,"score_gpt":0.25637133279297547,"score_spread":0.23664834781211846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321879172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011312075,0.00035571147,0.9872695,0.00015827983,0.00004265235,0.000024531404,0.000020786621,0.00008379877,0.0007326184],"genre_scores_gemma":[0.26871818,0.0011805354,0.7278631,0.00011069885,0.00013739103,0.00011036942,0.00012511863,0.000026055795,0.0017286061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997465,0.00007662543,0.000013636889,0.00003671742,0.00011555274,0.000010919889],"domain_scores_gemma":[0.99952114,0.00029462032,0.000044715922,0.000043297936,0.000082213955,0.000014098777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054984563,0.00038418328,0.0002785117,0.0004190115,0.0001352462,0.00032862564,0.00037361303,0.0005396439,0.00067664264],"category_scores_gemma":[0.0020055291,0.0001438375,0.0002660339,0.00050330703,0.00037607175,0.00041624383,0.00032882276,0.00050798606,0.00015057242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027814347,0.00009923504,0.0015302947,0.00026439407,0.000058917234,0.0002618455,0.00016044608,0.24014689,0.102977194,0.036349855,0.0020901046,0.6157827],"study_design_scores_gemma":[0.000008936931,0.00010548638,0.00049512973,0.000012795046,0.0000080076,0.00019970737,0.000011556516,0.9842002,0.010648643,0.002536964,0.001758804,0.000013787853],"about_ca_topic_score_codex":0.0008308953,"about_ca_topic_score_gemma":0.0010205188,"teacher_disagreement_score":0.0008308953,"about_ca_system_score_codex":0.00019246849,"about_ca_system_score_gemma":0.00034057297,"threshold_uncertainty_score":0.0029079318},"labels":[],"label_agreement":null},{"id":"W2323900248","doi":"10.1190/segam2014-0861.1","title":"A dual domain algorithm for minimum nuclear norm deblending","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algorithm; Dual (grammatical number); Computer science; Norm (philosophy); Domain (mathematical analysis); Mathematics; Mathematical analysis","score_opus":0.009303636269473791,"score_gpt":0.21115764040880206,"score_spread":0.20185400413932827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323900248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002946804,0.00002255479,0.9962639,0.000048429985,0.00001110414,0.000012435251,0.000021578699,0.00009380907,0.00057933596],"genre_scores_gemma":[0.05578226,0.000043625245,0.9416165,0.000049831528,0.000019632052,0.0000897012,0.00017345288,0.00006781043,0.002157157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937207,0.0001540334,0.000031989766,0.00010779478,0.0002812903,0.000052758605],"domain_scores_gemma":[0.9992675,0.000257747,0.000055411812,0.000121506426,0.00025518745,0.00004272165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087618415,0.000558209,0.0006412624,0.0006605296,0.00038967442,0.0008469066,0.000903938,0.00093040423,0.0035715287],"category_scores_gemma":[0.0027050672,0.00034895304,0.0005063115,0.00070832274,0.00072328397,0.0009180304,0.0016544934,0.0012961599,0.0014412414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042078906,0.0001149017,0.00065889437,0.00012802877,0.00004974074,0.00007723433,0.000191056,0.4232796,0.037489664,0.07724987,0.0050108093,0.45532945],"study_design_scores_gemma":[0.000018791272,0.00003216404,0.00008006022,0.0000070524484,0.000003213989,0.00003389934,0.000014882638,0.98532987,0.004846756,0.00766522,0.0019558568,0.000012199503],"about_ca_topic_score_codex":0.0017087741,"about_ca_topic_score_gemma":0.0018828427,"teacher_disagreement_score":0.0035715287,"about_ca_system_score_codex":0.0005347831,"about_ca_system_score_gemma":0.0011288556,"threshold_uncertainty_score":0.011947989},"labels":[],"label_agreement":null},{"id":"W2325917071","doi":"10.1190/segam2015-5850767.1","title":"A fast rank-reduction algorithm for 3D deblending via randomized QR decomposition","year":2015,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rank (graph theory); Algorithm; Singular value decomposition; QR decomposition; Computer science; Inversion (geology); Reduction (mathematics); Matrix decomposition; Set (abstract data type); Constraint (computer-aided design); Mathematics; Eigenvalues and eigenvectors","score_opus":0.017687418561180862,"score_gpt":0.2640345306510104,"score_spread":0.24634711208982954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325917071","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023563511,0.00003595928,0.99695635,0.000046173693,0.000011950399,0.000023236527,0.00002898531,0.00022052134,0.00032049886],"genre_scores_gemma":[0.0365226,0.000055317363,0.96224916,0.00003704875,0.000013964882,0.00006998581,0.00014398099,0.00007019114,0.0008377651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928814,0.00018043794,0.000043308573,0.00011373395,0.0003150163,0.00005940018],"domain_scores_gemma":[0.99908817,0.0003577827,0.00009589982,0.00015667097,0.00025679325,0.000044766344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093840074,0.0008128304,0.00067826867,0.0005380743,0.00040617623,0.0006333735,0.0007689389,0.0006104745,0.003280419],"category_scores_gemma":[0.0026356757,0.00038951286,0.0007142992,0.0006542965,0.0005546105,0.00069528015,0.0013137663,0.0013629483,0.0014379908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031787463,0.00009965103,0.0008493083,0.00024077509,0.00007425491,0.00016357533,0.00024383955,0.46039414,0.05278409,0.042043794,0.0068794764,0.43590924],"study_design_scores_gemma":[0.000019997498,0.000041863685,0.00011996395,0.000007457925,0.0000041565377,0.000044818746,0.000019730736,0.98876745,0.005346288,0.0037134406,0.0019002137,0.000014631097],"about_ca_topic_score_codex":0.0037421251,"about_ca_topic_score_gemma":0.004668084,"teacher_disagreement_score":0.0037421251,"about_ca_system_score_codex":0.00046058637,"about_ca_system_score_gemma":0.0011112283,"threshold_uncertainty_score":0.010974109},"labels":[],"label_agreement":null},{"id":"W2331944129","doi":"10.1109/taes.2015.150456","title":"Recovery probability analysis for sparse signals via OMP","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Royal Military College of Canada; Queen's University; Okanagan College","funders":"","keywords":"Matching pursuit; Mutual coherence; Coherence (philosophical gambling strategy); Computer science; Gaussian; Matrix (chemical analysis); Algorithm; Compressed sensing; Probability distribution; Pattern recognition (psychology); Sparse matrix; Probability density function; Covariance matrix; Basis pursuit; Signal processing; Artificial intelligence; Mathematics; Statistics; Telecommunications; Physics","score_opus":0.029735143682898982,"score_gpt":0.2353021615133449,"score_spread":0.20556701783044593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331944129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011962876,0.0006582516,0.98368996,0.00049600087,0.000027243623,0.00003806746,0.00010604176,0.00019720277,0.0028244588],"genre_scores_gemma":[0.85375166,0.0036909843,0.13385564,0.00038925308,0.00057602837,0.00032627324,0.0006380691,0.0003761145,0.0063959137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99571556,0.0014725581,0.00019224094,0.00048616668,0.0017937078,0.000339742],"domain_scores_gemma":[0.9526904,0.039242253,0.0029898756,0.0019785708,0.0027021377,0.00039674272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070753903,0.0013709017,0.0014764821,0.0024209125,0.0005272572,0.0017510368,0.0014683869,0.0015690386,0.0036719684],"category_scores_gemma":[0.04956771,0.0006589034,0.00090130116,0.0017747106,0.002961974,0.0035197558,0.0028656716,0.002602274,0.0008019201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005574242,0.00009193154,0.0027989796,0.0005513631,0.00012877527,0.00045210283,0.00030327705,0.49896216,0.0092161335,0.4351251,0.0029214337,0.048891332],"study_design_scores_gemma":[0.00001726588,0.00010029506,0.0008460682,0.00005965128,0.000025978028,0.00026319933,0.00004139271,0.9202067,0.0034252238,0.0737839,0.0011982925,0.00003204822],"about_ca_topic_score_codex":0.00078512,"about_ca_topic_score_gemma":0.00031076808,"teacher_disagreement_score":0.0070753903,"about_ca_system_score_codex":0.0010294381,"about_ca_system_score_gemma":0.00083740783,"threshold_uncertainty_score":0.037418664},"labels":[],"label_agreement":null},{"id":"W2332209844","doi":"10.1190/sbgf2011-005","title":"A compressive sensing perspective on simultaneous marine acquisition","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Perspective (graphical); Compressed sensing; Computer science; Remote sensing; Geology; Artificial intelligence","score_opus":0.018851633359614445,"score_gpt":0.22741767882902594,"score_spread":0.2085660454694115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332209844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047781905,0.0051482897,0.9581537,0.0028958204,0.0004186883,0.000023258743,0.00013413424,0.00006861028,0.028379306],"genre_scores_gemma":[0.50247455,0.029525947,0.4301406,0.0017247574,0.0045490297,0.00018524064,0.00047386272,0.000099350844,0.030826671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00019405874,0.000026625261,0.00008210768,0.00021569806,0.000031358886],"domain_scores_gemma":[0.9991111,0.0005951706,0.000054791893,0.00010199511,0.00011459933,0.000022298407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008409863,0.000617672,0.0003705395,0.0006570917,0.00031170962,0.0014343562,0.00064272346,0.0011352077,0.0038551074],"category_scores_gemma":[0.0026170064,0.0003091251,0.00033875444,0.0012631972,0.0018671651,0.0020589982,0.0014058514,0.0017626942,0.0006314053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065801985,0.000019574833,0.0002199755,0.00020169922,0.00003113579,0.0001771821,0.00021087016,0.051970024,0.0056712497,0.8242336,0.0042284867,0.11297045],"study_design_scores_gemma":[0.00001720803,0.00013486062,0.00050105364,0.00014407832,0.000023794779,0.00042149107,0.00011780557,0.30952653,0.002658396,0.65095043,0.0354672,0.000037122376],"about_ca_topic_score_codex":0.0015317395,"about_ca_topic_score_gemma":0.0014885028,"teacher_disagreement_score":0.0038551074,"about_ca_system_score_codex":0.00047879654,"about_ca_system_score_gemma":0.0005722032,"threshold_uncertainty_score":0.012896597},"labels":[],"label_agreement":null},{"id":"W2333262198","doi":"10.82308/15907","title":"Graph spectral compressed sensing","year":2012,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Computer science; Graph; Artificial intelligence; Theoretical computer science","score_opus":0.019803216334427755,"score_gpt":0.21775075830462565,"score_spread":0.1979475419701979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333262198","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030242875,0.00052055717,0.9599204,0.0005577083,0.00018558509,0.00004716184,0.00034618264,0.0006090918,0.0075704954],"genre_scores_gemma":[0.61203074,0.0014505613,0.3701784,0.00055869645,0.0002279178,0.00013007647,0.0009143434,0.00020552638,0.014303721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996331,0.00007582776,0.000012784907,0.00008863776,0.00014675963,0.00004288327],"domain_scores_gemma":[0.99930954,0.00037139896,0.000055134078,0.00010416662,0.00012728776,0.00003240893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035166065,0.0006230417,0.0005298715,0.00065322133,0.00029694152,0.000866019,0.0006212966,0.0007855409,0.0035933906],"category_scores_gemma":[0.0019309114,0.0001969325,0.0004686018,0.00082752306,0.000655215,0.00096140744,0.0006747259,0.00073118834,0.0007099474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061604776,0.000082726874,0.0015661096,0.0004469627,0.0001012954,0.00049041654,0.0003371013,0.49903378,0.070342004,0.09601896,0.008156724,0.3228079],"study_design_scores_gemma":[0.000016750237,0.00006747224,0.00073385885,0.00002747349,0.000020844116,0.00018930637,0.000095810356,0.95710653,0.01091555,0.024220958,0.006582759,0.000022706963],"about_ca_topic_score_codex":0.0050162496,"about_ca_topic_score_gemma":0.0067588976,"teacher_disagreement_score":0.0050162496,"about_ca_system_score_codex":0.0005608326,"about_ca_system_score_gemma":0.00069049705,"threshold_uncertainty_score":0.012021065},"labels":[],"label_agreement":null},{"id":"W2333340505","doi":"10.1190/segam2014-0885.1","title":"Non-uniform optimal sampling for simultaneous source survey design","year":2014,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"University of British Columbia; ConocoPhillips","keywords":"Computer science; Sampling (signal processing); Telecommunications","score_opus":0.0429120746022785,"score_gpt":0.2592156400078007,"score_spread":0.21630356540552217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333340505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046149194,0.00003263993,0.9945201,0.000049778544,0.0000053913723,0.000042534055,0.00002218621,0.000081029655,0.0006314709],"genre_scores_gemma":[0.35229567,0.00012045747,0.6456215,0.00010123512,0.00003220012,0.00034927065,0.00013526113,0.00006224989,0.0012822809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980884,0.0008736565,0.00008724363,0.00027598604,0.00052385085,0.00015079812],"domain_scores_gemma":[0.9972378,0.001616634,0.0002800791,0.00020405669,0.0005606593,0.0001008029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019936715,0.0008330544,0.0007092208,0.0005583237,0.00030096679,0.0007561705,0.0007415211,0.0007149762,0.0021894034],"category_scores_gemma":[0.0069073043,0.0005487886,0.00049146696,0.0004954089,0.0007216684,0.0009679317,0.001264142,0.00087111583,0.0004899279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046783077,0.00012401071,0.0020586948,0.00028569842,0.00005076601,0.00013874863,0.00026107757,0.7839532,0.025429616,0.03445725,0.0017471242,0.15102598],"study_design_scores_gemma":[0.000038561386,0.00016602763,0.00037950085,0.000016679058,0.000011354621,0.00004888993,0.000047173507,0.9836045,0.004935964,0.008974201,0.0017630892,0.00001404034],"about_ca_topic_score_codex":0.0010929789,"about_ca_topic_score_gemma":0.0014498389,"teacher_disagreement_score":0.0021894034,"about_ca_system_score_codex":0.00064857316,"about_ca_system_score_gemma":0.0011718079,"threshold_uncertainty_score":0.010543644},"labels":[],"label_agreement":null},{"id":"W2337036514","doi":"10.14288/1.0051332","title":"Convex optimization for generalized sparse recovery","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Solver; Minification; Mathematical optimization; Linear subspace; Computer science; Focus (optics); Convex optimization; Optimization problem; Regular polygon; Algorithm; Mathematics","score_opus":0.010162375919599575,"score_gpt":0.17219092530384053,"score_spread":0.16202854938424097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337036514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011979364,0.0014067951,0.9915742,0.0007347725,0.000103238846,0.00002763567,0.00010034624,0.000116339856,0.004738719],"genre_scores_gemma":[0.19762851,0.0108649265,0.7661064,0.0013911509,0.0015408845,0.00076734205,0.0013356296,0.0007928482,0.019572167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982931,0.0008527553,0.00006807896,0.00023850001,0.0004546666,0.00009284539],"domain_scores_gemma":[0.9974124,0.001726189,0.0001737432,0.00022665334,0.00039238058,0.00006874945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028306595,0.0017546462,0.0014551219,0.000995302,0.00042935825,0.0015759276,0.0010803054,0.001416574,0.0057415105],"category_scores_gemma":[0.008117023,0.0005340936,0.0013811911,0.0014539534,0.0021649152,0.0018401151,0.002503568,0.0048447247,0.0020437322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054033982,0.000038720336,0.00026731793,0.00042530175,0.00009501237,0.00008860334,0.0000952648,0.33815303,0.0016937305,0.5863981,0.012823013,0.05986784],"study_design_scores_gemma":[0.000013619837,0.00003666011,0.00013829881,0.000057061858,0.000012879578,0.000049831073,0.000022198381,0.75956386,0.00064968894,0.22855361,0.010887909,0.000014378462],"about_ca_topic_score_codex":0.00249111,"about_ca_topic_score_gemma":0.0019113828,"teacher_disagreement_score":0.0057415105,"about_ca_system_score_codex":0.0012233747,"about_ca_system_score_gemma":0.0013772917,"threshold_uncertainty_score":0.01920724},"labels":[],"label_agreement":null},{"id":"W2337464042","doi":"10.48550/arxiv.1604.02723","title":"CaSCADE: Compressed Carrier and DOA Estimation","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Compressed sensing; Computer science; Nyquist rate; Cognitive radio; Sampling (signal processing); Narrowband; SIGNAL (programming language); Algorithm; Joint (building); Wideband; Nyquist–Shannon sampling theorem; Signal reconstruction; Direction of arrival; Context (archaeology); Electronic engineering; Signal processing; Telecommunications; Wireless; Engineering; Detector; Computer vision; Radar","score_opus":0.04711092075033845,"score_gpt":0.18351010554226582,"score_spread":0.13639918479192736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337464042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015549724,0.00035516883,0.98048395,0.00016018975,0.000063977255,0.00007060704,0.000087819106,0.00044240904,0.0027862105],"genre_scores_gemma":[0.5094625,0.000603583,0.4830138,0.0002908783,0.00021978664,0.00016343768,0.00048827322,0.00006521886,0.0056924843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989323,0.00019687714,0.000046569185,0.00024273599,0.00049985247,0.000081586935],"domain_scores_gemma":[0.9991129,0.00036203826,0.000117553835,0.00018865676,0.00018148031,0.000037271857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006197208,0.00094228605,0.0008180743,0.00063283765,0.0003113903,0.00066677254,0.0012323915,0.001255982,0.0029957541],"category_scores_gemma":[0.0031312837,0.0003490274,0.0004847056,0.0008096722,0.00064267265,0.0018211717,0.0016648457,0.00094928633,0.00093394355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009664422,0.00019358084,0.0019450675,0.00032425922,0.00010507126,0.0007322296,0.0003418223,0.22116283,0.08402459,0.028765343,0.0044704503,0.65696836],"study_design_scores_gemma":[0.00003647348,0.00017947075,0.0005980111,0.000024149402,0.000025614061,0.0005127827,0.000030675666,0.9739324,0.015887687,0.005193161,0.0035482063,0.00003132953],"about_ca_topic_score_codex":0.002977816,"about_ca_topic_score_gemma":0.0028198105,"teacher_disagreement_score":0.0029957541,"about_ca_system_score_codex":0.00035244148,"about_ca_system_score_gemma":0.0007078551,"threshold_uncertainty_score":0.010021806},"labels":[],"label_agreement":null},{"id":"W2337742813","doi":"","title":"Towards an Algorithmic Theory of Compressed Sensing","year":2005,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Compressed sensing; Orthonormal basis; Signal reconstruction; SIGNAL (programming language); Computer science; Class (philosophy); Series (stratigraphy); Algorithm; Perspective (graphical); Signal processing; Basis (linear algebra); Artificial intelligence; Theoretical computer science; Mathematics; Telecommunications","score_opus":0.018099816606045302,"score_gpt":0.23978207332599114,"score_spread":0.22168225671994585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337742813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016908546,0.0016944188,0.9864226,0.0027130253,0.0001924759,0.000050922736,0.00010608848,0.000115512245,0.0070140846],"genre_scores_gemma":[0.12912157,0.00648004,0.84927005,0.003209058,0.0028879086,0.000686644,0.0007757582,0.00024635872,0.007322617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953597,0.0020382232,0.00023440403,0.00058274594,0.0015468689,0.00023810375],"domain_scores_gemma":[0.9876537,0.009348312,0.00043259616,0.001351965,0.001008942,0.00020459133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004575901,0.0015781312,0.0014872589,0.0025469577,0.001082313,0.003416326,0.0027050672,0.0026463394,0.00416685],"category_scores_gemma":[0.018928364,0.0008462701,0.0013581507,0.003159396,0.004895454,0.007930637,0.005147165,0.00744844,0.0014055235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020445385,0.000024451165,0.00016722696,0.00012628372,0.000019720761,0.00003985664,0.00009454038,0.017826404,0.00036755163,0.9556373,0.0033683996,0.02230774],"study_design_scores_gemma":[0.000015289603,0.000028822293,0.000066462904,0.000044055752,0.000006975433,0.000048108508,0.00003007615,0.09747857,0.00022142749,0.89428985,0.00775821,0.000012143614],"about_ca_topic_score_codex":0.0009899097,"about_ca_topic_score_gemma":0.00093938794,"teacher_disagreement_score":0.004575901,"about_ca_system_score_codex":0.001976487,"about_ca_system_score_gemma":0.0017361911,"threshold_uncertainty_score":0.024200022},"labels":[],"label_agreement":null},{"id":"W2338019868","doi":"10.1109/jstsp.2016.2555482","title":"Off-the-Grid Low-Rank Matrix Recovery and Seismic Data Reconstruction","year":2016,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Low-rank approximation; Matrix completion; Matrix (chemical analysis); Computer science; Algorithm; Grid; Sparse matrix; Rank (graph theory); Matrix norm; Interpolation (computer graphics); Data recovery; TRACE (psycholinguistics); Regularization (linguistics); Compressed sensing; Mathematical optimization; Data mining; Mathematics; Artificial intelligence; Geometry","score_opus":0.01795903313465918,"score_gpt":0.24721910485984397,"score_spread":0.22926007172518478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338019868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058426685,0.000078809855,0.99276274,0.00014092935,0.000012501263,0.000012325043,0.000020552721,0.00008161337,0.0010477271],"genre_scores_gemma":[0.4638954,0.00065091776,0.5286384,0.00015933487,0.000101326346,0.0001081254,0.00024084556,0.00014550822,0.0060601546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992866,0.00029060556,0.000024199064,0.000092699316,0.00026162795,0.000044378983],"domain_scores_gemma":[0.998256,0.0010867607,0.000188316,0.0002442693,0.00017323684,0.000051355382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011569198,0.00059255917,0.00047732168,0.0004318968,0.00024100773,0.0007543399,0.0006450699,0.0011476759,0.0015556664],"category_scores_gemma":[0.005030273,0.0002941074,0.00036277022,0.0006844863,0.0015454318,0.0015404123,0.0011794228,0.0011883582,0.0005368001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016411836,0.000075184806,0.0005696919,0.00019434043,0.00003003149,0.00020863129,0.00015469217,0.72666836,0.018817134,0.1646561,0.0020961212,0.08636551],"study_design_scores_gemma":[0.000003912851,0.000023538687,0.000062874744,0.000004180968,0.0000015014236,0.000032299064,0.000012987007,0.97934145,0.0019986336,0.017908785,0.00060453766,0.0000052934356],"about_ca_topic_score_codex":0.0013034188,"about_ca_topic_score_gemma":0.0013413522,"teacher_disagreement_score":0.0015556664,"about_ca_system_score_codex":0.00041763834,"about_ca_system_score_gemma":0.0006151584,"threshold_uncertainty_score":0.0061184764},"labels":[],"label_agreement":null},{"id":"W2339655787","doi":"10.4153/cmb-2017-009-6","title":"A Sharp Bound on RIC in Generalized Orthogonal Matching Pursuit","year":2017,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Matching pursuit; Restricted isometry property; Compressed sensing; Upper and lower bounds; Extension (predicate logic); Isometry (Riemannian geometry); Matching (statistics)","score_opus":0.02139777882019857,"score_gpt":0.24022296575896837,"score_spread":0.2188251869387698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339655787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028535934,0.0048329956,0.94678277,0.0013567182,0.0002731696,0.000070438735,0.00018593387,0.0004985824,0.017463583],"genre_scores_gemma":[0.8090938,0.0038088635,0.17857319,0.0012788116,0.00071835256,0.00028197767,0.00040899866,0.00035690796,0.0054791667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953288,0.0014568474,0.00019572033,0.00081343873,0.0016022633,0.00060287665],"domain_scores_gemma":[0.9795248,0.0144596575,0.0012660212,0.0022031718,0.0018705202,0.00067588675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070656817,0.0021683213,0.0013638234,0.0021975301,0.00073240174,0.0021836804,0.002254699,0.0018460057,0.0034061684],"category_scores_gemma":[0.040805932,0.0007186521,0.0011399753,0.0018682255,0.004767241,0.0047864006,0.006383525,0.006045788,0.0008864191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009786164,0.00013300148,0.0023049107,0.000915023,0.000209868,0.00080069905,0.00051746966,0.22911043,0.032332387,0.63820785,0.009955791,0.084533975],"study_design_scores_gemma":[0.000040385654,0.00020499752,0.0009968143,0.0001642204,0.00006621677,0.00037192664,0.00009869433,0.80453706,0.009866709,0.17855166,0.005028948,0.000072374525],"about_ca_topic_score_codex":0.0011959214,"about_ca_topic_score_gemma":0.0007551872,"teacher_disagreement_score":0.0070656817,"about_ca_system_score_codex":0.001612642,"about_ca_system_score_gemma":0.001033177,"threshold_uncertainty_score":0.037367344},"labels":[],"label_agreement":null},{"id":"W2354835911","doi":"","title":"Theory and Applicaton of Compressive Sensing","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Compressed sensing; Orthonormal basis; Computer science; Nyquist–Shannon sampling theorem; SIGNAL (programming language); Nyquist rate; Basis (linear algebra); Algorithm; Sampling (signal processing); Matrix (chemical analysis); Sample (material); Signal reconstruction; Measure (data warehouse); Process (computing); Mathematical optimization; Signal processing; Computer vision; Mathematics; Telecommunications; Data mining; Physics","score_opus":0.0036804876338571695,"score_gpt":0.2081636360753914,"score_spread":0.20448314844153423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354835911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030723582,0.027469961,0.89779395,0.0033930386,0.0014110276,0.00011737355,0.00028258542,0.0003144265,0.066145316],"genre_scores_gemma":[0.32120886,0.105699964,0.5263426,0.0038878429,0.0071212472,0.0010671607,0.0009364247,0.00016009632,0.033575803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984971,0.00032607772,0.0001003015,0.00025230637,0.00075827667,0.00006597433],"domain_scores_gemma":[0.99871075,0.00067795056,0.000092099806,0.00019527675,0.00028483136,0.00003903673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010317066,0.0008838889,0.00079106516,0.0016256595,0.00064244115,0.0016807697,0.0009967795,0.0018766596,0.0041200025],"category_scores_gemma":[0.002966382,0.0005016862,0.0006985894,0.0018510169,0.002714176,0.0019947696,0.0017702753,0.003193626,0.0015217469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035573186,0.00002891307,0.0004352879,0.00065360655,0.000056129527,0.0002613141,0.0001825342,0.030661806,0.0060678753,0.8255758,0.0078144595,0.12822665],"study_design_scores_gemma":[0.000023329172,0.00014959238,0.00077688333,0.00039377518,0.000039773142,0.0011714972,0.0001057809,0.14518377,0.006718769,0.64964336,0.1956939,0.00009961903],"about_ca_topic_score_codex":0.0011309125,"about_ca_topic_score_gemma":0.0005395354,"teacher_disagreement_score":0.0041200025,"about_ca_system_score_codex":0.000912189,"about_ca_system_score_gemma":0.0009677652,"threshold_uncertainty_score":0.01378274},"labels":[],"label_agreement":null},{"id":"W2395397254","doi":"10.1109/tsp.2015.2441032","title":"Iterative Reweighted &lt;formula formulatype=\"inline\"&gt;&lt;tex Notation=\"TeX\"&gt;$\\ell_{2}/\\ell_{1}$&lt;/tex&gt; &lt;/formula&gt; Recovery Algorithms for Compressed Sensing of Block Sparse Signals","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Algorithm; Block (permutation group theory); Computer science; Iterative method; Minification; Mathematics; Combinatorics","score_opus":0.039773057190614906,"score_gpt":0.2679268126032404,"score_spread":0.2281537554126255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395397254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010172505,0.00031178448,0.9878341,0.00033706744,0.00017124963,0.00011159494,0.0005495851,0.0018733704,0.007793987],"genre_scores_gemma":[0.019480295,0.00085733685,0.9403115,0.00038974523,0.00012678686,0.00036777635,0.0024734018,0.0018708307,0.034122467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991233,0.00015615618,0.000055470904,0.00014403653,0.00045873135,0.000062302934],"domain_scores_gemma":[0.99864155,0.00035239026,0.00011602375,0.0002565101,0.00058635784,0.0000472228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576355,0.0017373983,0.00092847995,0.0012151188,0.0006334822,0.0016963829,0.002177814,0.0014185592,0.049848355],"category_scores_gemma":[0.003810365,0.00068759854,0.0012303494,0.0022595474,0.00084798055,0.00189335,0.0017385655,0.0023269276,0.036053054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027583403,0.00011771342,0.000592424,0.00096949603,0.00013512446,0.00037136572,0.00026256836,0.10837262,0.042589568,0.1340875,0.13351327,0.5787125],"study_design_scores_gemma":[0.000053958833,0.00007306584,0.00035945873,0.000098378805,0.000042878175,0.00046534432,0.00006567312,0.7952386,0.038355242,0.03842024,0.1267457,0.00008131581],"about_ca_topic_score_codex":0.006732424,"about_ca_topic_score_gemma":0.015448213,"teacher_disagreement_score":0.049848355,"about_ca_system_score_codex":0.0012387825,"about_ca_system_score_gemma":0.0022123526,"threshold_uncertainty_score":0.16675931},"labels":[],"label_agreement":null},{"id":"W2401963278","doi":"","title":"A novel greedy algorithm for Nyström approximation","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Greedy algorithm; Algorithm; Approximation algorithm; Kernel (algebra); Mathematical optimization; Benchmark (surveying); Sampling (signal processing); Greedy randomized adaptive search procedure; Mathematics; Matrix (chemical analysis); Computer science; Combinatorics; Filter (signal processing)","score_opus":0.050825903698367376,"score_gpt":0.2250647369847518,"score_spread":0.17423883328638443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401963278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012194735,0.00010433128,0.9977908,0.000047783564,0.00004026708,0.000033421544,0.000032994827,0.0002694461,0.00046155768],"genre_scores_gemma":[0.042504176,0.00025630466,0.95404786,0.0001420115,0.00008425586,0.00029386062,0.00037437316,0.00012746872,0.00216967],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989895,0.00024117916,0.000062050436,0.00017284972,0.0004297962,0.00010460495],"domain_scores_gemma":[0.99919504,0.00038556408,0.00006489966,0.00011205488,0.00020210756,0.000040319523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008584122,0.0011537398,0.0014908059,0.0010549442,0.0006247304,0.0010736156,0.0017306851,0.001334333,0.003082814],"category_scores_gemma":[0.0037085179,0.00058002037,0.0007956397,0.0015226883,0.000733178,0.0013147183,0.0014772149,0.0013474188,0.0017526988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025285743,0.00011855858,0.00078511296,0.00020611777,0.00010983117,0.00015145994,0.00013182632,0.36616236,0.016396983,0.048875302,0.013601733,0.55320793],"study_design_scores_gemma":[0.00003353301,0.00004170243,0.00009356929,0.00001131265,0.000008801516,0.00009608263,0.00001797188,0.98155874,0.002398758,0.011037181,0.0046867835,0.000015515412],"about_ca_topic_score_codex":0.0032657988,"about_ca_topic_score_gemma":0.004132616,"teacher_disagreement_score":0.0032657988,"about_ca_system_score_codex":0.0006785529,"about_ca_system_score_gemma":0.0017550781,"threshold_uncertainty_score":0.010313034},"labels":[],"label_agreement":null},{"id":"W2402379528","doi":"10.17615/pa3p-6h95","title":"On Quantile Regression in Reproducing Kernel Hilbert Spaces with Data Sparsity Constraint","year":2020,"lang":"en","type":"article","venue":"PubMed","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reproducing kernel Hilbert space; Mathematics; Smoothing; Kernel (algebra); Kernel embedding of distributions; Mathematical optimization; Kernel method; Quantile regression; Estimator; Hilbert space; Representer theorem; Artificial intelligence; Computer science; Support vector machine; Statistics","score_opus":0.06467697358477825,"score_gpt":0.23452056817458986,"score_spread":0.1698435945898116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402379528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046108044,0.00029018612,0.9942186,0.00016737076,0.000019014225,0.00001691741,0.000027642593,0.00005999625,0.0005894955],"genre_scores_gemma":[0.50122637,0.0036888104,0.4879983,0.00045459272,0.0005424447,0.00032000075,0.00048762167,0.0002024831,0.0050793663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977114,0.0013245009,0.000077814024,0.00027385392,0.00048696468,0.00012552303],"domain_scores_gemma":[0.9917013,0.006537954,0.0004823797,0.0004435536,0.00069983245,0.00013496669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046256785,0.00094937946,0.0012858888,0.0006958204,0.00033800423,0.0009883313,0.0010619846,0.0011610604,0.0018921773],"category_scores_gemma":[0.015821131,0.00040308558,0.00064783037,0.001304111,0.001520428,0.001619106,0.001639788,0.0019899567,0.00051661197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020224774,0.000112058944,0.0016404752,0.00036160654,0.00009026423,0.0002529925,0.00016220297,0.7055705,0.008252746,0.16588487,0.0027752991,0.114694744],"study_design_scores_gemma":[0.0000062924764,0.00003138243,0.00016030938,0.000009655178,0.0000045949764,0.000028176377,0.0000073660362,0.9858037,0.0006337225,0.012885179,0.000421009,0.000008530454],"about_ca_topic_score_codex":0.0022901807,"about_ca_topic_score_gemma":0.0012587161,"teacher_disagreement_score":0.0046256785,"about_ca_system_score_codex":0.00067095965,"about_ca_system_score_gemma":0.000819467,"threshold_uncertainty_score":0.024463236},"labels":[],"label_agreement":null},{"id":"W2409155108","doi":"10.1109/tci.2016.2575741","title":"Multi-Resolution Compressed Sensing Reconstruction Via Approximate Message Passing","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Nebraska-Lincoln","keywords":"Upsampling; Compressed sensing; Signal reconstruction; Iterative reconstruction; Sensitivity (control systems); Thresholding; Computer science; Algorithm; Noise (video); SIGNAL (programming language); Artificial intelligence; Image resolution; Computer vision; Reconstruction algorithm; Signal-to-noise ratio (imaging); Signal processing; Image (mathematics); Telecommunications; Electronic engineering","score_opus":0.016387780578508877,"score_gpt":0.2328780780600692,"score_spread":0.21649029748156032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409155108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006472696,0.00011034626,0.99278647,0.00010594088,0.000011897896,0.000013593747,0.000013126186,0.000095056304,0.000390736],"genre_scores_gemma":[0.4863601,0.00047993613,0.5096279,0.00018236553,0.00008447971,0.00012763747,0.00013871997,0.00005422487,0.002944689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.0002591831,0.0000328323,0.000106798405,0.00025130066,0.00005049685],"domain_scores_gemma":[0.998705,0.0008043687,0.00014084278,0.000179235,0.0001372736,0.00003323577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014440714,0.0006979965,0.00075117603,0.00048601397,0.00027243787,0.0007959259,0.0008344476,0.0011437905,0.00088873255],"category_scores_gemma":[0.004102173,0.00027707356,0.00047817783,0.0006196405,0.00096139923,0.0016398669,0.0010380321,0.0011100185,0.0002501209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020001618,0.000049159513,0.00047602548,0.00015932195,0.000051418152,0.00015869143,0.00017636073,0.785343,0.014174403,0.098247826,0.0008276664,0.10013611],"study_design_scores_gemma":[0.0000053106182,0.000018944778,0.000027759892,0.0000031662862,0.000002898587,0.00002362359,0.000004894625,0.9908708,0.0019573385,0.006741799,0.0003392096,0.0000042463557],"about_ca_topic_score_codex":0.0012024392,"about_ca_topic_score_gemma":0.0007561442,"teacher_disagreement_score":0.0014440714,"about_ca_system_score_codex":0.00055826094,"about_ca_system_score_gemma":0.0005152369,"threshold_uncertainty_score":0.0076370835},"labels":[],"label_agreement":null},{"id":"W2412885812","doi":"","title":"PAC-Bayesian Bounds based on the Rényi Divergence","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Divergence (linguistics); Bayesian probability; Generalization; Kullback–Leibler divergence; Mathematics; Computer science; Applied mathematics; Statistics","score_opus":0.014032816636061242,"score_gpt":0.2112830739709972,"score_spread":0.19725025733493595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412885812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052250307,0.0032832162,0.9671718,0.0021309454,0.0003064448,0.00003825327,0.0002721369,0.0002435124,0.02132864],"genre_scores_gemma":[0.5266101,0.012072696,0.40246898,0.0035627068,0.003604273,0.00096419844,0.0016893346,0.0014765495,0.04755116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922694,0.0034818526,0.00027185882,0.0008933251,0.00250996,0.0005736478],"domain_scores_gemma":[0.9497563,0.04135748,0.0014557644,0.0030298475,0.0033147295,0.0010857651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013341112,0.003202363,0.0036892213,0.0032711425,0.001528876,0.005254934,0.0044450467,0.0041304613,0.011852233],"category_scores_gemma":[0.06191846,0.0016144802,0.0015874555,0.0038075894,0.006067987,0.013962844,0.007101836,0.012299721,0.0024808377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009417904,0.000038920574,0.0002576113,0.0001651841,0.00005215072,0.000060522383,0.00008769658,0.096728906,0.00043418276,0.88221794,0.0038964255,0.015966324],"study_design_scores_gemma":[0.000014005336,0.000024442075,0.0001254355,0.000072025985,0.000017710418,0.000048409023,0.000014601992,0.36393905,0.00031709336,0.6328546,0.002542751,0.000029835513],"about_ca_topic_score_codex":0.0027357086,"about_ca_topic_score_gemma":0.003320264,"teacher_disagreement_score":0.013341112,"about_ca_system_score_codex":0.004545777,"about_ca_system_score_gemma":0.0033560952,"threshold_uncertainty_score":0.07055539},"labels":[],"label_agreement":null},{"id":"W2421965999","doi":"10.1109/radar.2016.7485243","title":"Reduced time-on-target in pulse Doppler radar: Slow time domain compressed sensing","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; European Commission","keywords":"Computer science; Nyquist rate; Doppler effect; Pulse-Doppler radar; Time domain; Radar; Bandwidth (computing); Nyquist–Shannon sampling theorem; Doppler radar; Continuous-wave radar; SIGNAL (programming language); Compressed sensing; Electronic engineering; Sampling (signal processing); Pulse repetition frequency; Real-time computing; Radar imaging; Algorithm; Telecommunications; Physics; Filter (signal processing); Computer vision; Engineering","score_opus":0.008788441656116985,"score_gpt":0.20576874709242415,"score_spread":0.19698030543630718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2421965999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06924619,0.0011522407,0.9252977,0.00044098703,0.000094644565,0.000050589482,0.00009652931,0.0003322617,0.0032888849],"genre_scores_gemma":[0.624907,0.0014023371,0.37028265,0.00020539797,0.00012786649,0.00009845465,0.00024348896,0.00008499535,0.0026479396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00007408052,0.000012163056,0.000043108208,0.00019446753,0.000026178039],"domain_scores_gemma":[0.9992467,0.0004219837,0.000078811296,0.00011515546,0.00010912333,0.000028210025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044221003,0.0004521667,0.00032110483,0.0003680594,0.0001978004,0.00041313708,0.00045685866,0.0005205356,0.0010894747],"category_scores_gemma":[0.001825207,0.00014069006,0.00020421832,0.0005213137,0.00052690227,0.0008426757,0.0005800342,0.000641498,0.00028289447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081562815,0.00018025942,0.0011733375,0.00048435197,0.00007243255,0.0003401262,0.00034220703,0.25437996,0.27585423,0.04720485,0.002633382,0.41651922],"study_design_scores_gemma":[0.00005955369,0.0005786757,0.0010051297,0.000041992465,0.000034498637,0.0006257244,0.00006209346,0.8630565,0.11038273,0.013834428,0.010270603,0.000047983114],"about_ca_topic_score_codex":0.00085121347,"about_ca_topic_score_gemma":0.0008646597,"teacher_disagreement_score":0.0010894747,"about_ca_system_score_codex":0.00021725008,"about_ca_system_score_gemma":0.00041263306,"threshold_uncertainty_score":0.0036447048},"labels":[],"label_agreement":null},{"id":"W2429556411","doi":"10.1007/s10589-016-9854-9","title":"Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization","year":2016,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Simon Fraser University; Shenzhen University; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Smoothing; Stationary point; Mathematical optimization; Convergence (economics); Convex function; Regular polygon; Applied mathematics; Mathematical analysis","score_opus":0.011287877925320957,"score_gpt":0.26499336771498977,"score_spread":0.25370548978966884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429556411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016757305,0.00035510364,0.9966916,0.00010844187,0.000056882178,0.000015571291,0.000036362988,0.00009673576,0.00096359133],"genre_scores_gemma":[0.09173824,0.0010952037,0.8915283,0.00022193785,0.00014740226,0.00032591933,0.00033120086,0.0004443812,0.014167534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995103,0.00021596029,0.000028770875,0.0000840298,0.00013454804,0.000026485088],"domain_scores_gemma":[0.99870396,0.0008813677,0.0000831812,0.00011455339,0.0001711762,0.000045718538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016337663,0.0010485228,0.0014540636,0.00056623766,0.00040608138,0.0010503773,0.001465505,0.0019535136,0.0049137175],"category_scores_gemma":[0.0045166695,0.00074914616,0.0007589875,0.0008749127,0.001066729,0.0012951004,0.0014744482,0.001833469,0.0013446342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031463953,0.00009814264,0.00050500117,0.0008008,0.00019566153,0.00016568153,0.00019785659,0.6430733,0.015122796,0.16902675,0.011177532,0.15932181],"study_design_scores_gemma":[0.0000114047125,0.000017277338,0.000051981588,0.000013325236,0.0000071147806,0.000016793623,0.0000060192683,0.9858957,0.0007247956,0.011017072,0.0022260116,0.000012579952],"about_ca_topic_score_codex":0.0027105259,"about_ca_topic_score_gemma":0.0034660264,"teacher_disagreement_score":0.0049137175,"about_ca_system_score_codex":0.0005144954,"about_ca_system_score_gemma":0.0012351742,"threshold_uncertainty_score":0.016438007},"labels":[],"label_agreement":null},{"id":"W2471497375","doi":"10.1093/imaiai/iax009","title":"One-bit compressive sensing of dictionary-sparse signals","year":2017,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Army Research Office; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Compressed sensing; Computer science; Orthonormal basis; Basis pursuit; Algorithm; Sparse approximation; Sparse matrix; Quantization (signal processing); Basis (linear algebra); Thresholding; Gaussian; Artificial intelligence; Mathematics","score_opus":0.034524037921345015,"score_gpt":0.26906485016661025,"score_spread":0.23454081224526524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471497375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013823056,0.00029184524,0.9822786,0.0004125234,0.000070896545,0.000027981105,0.00009266074,0.00012550574,0.002877035],"genre_scores_gemma":[0.7196495,0.0010688414,0.27261248,0.00057467807,0.00027455942,0.00010511567,0.00030749125,0.00012262669,0.005284752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874383,0.0004413771,0.000058176032,0.00026744694,0.00036112487,0.00012798954],"domain_scores_gemma":[0.99672973,0.0018615972,0.00032807255,0.0006435683,0.0003282478,0.000108770015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001625792,0.00079170876,0.0010999622,0.000577407,0.00036551716,0.0015998847,0.0012397913,0.0013785904,0.003212275],"category_scores_gemma":[0.007125321,0.00034351,0.00042700983,0.0009632619,0.0019655048,0.0026458672,0.0019291642,0.0021406831,0.00059936556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005018155,0.00010520441,0.00069274654,0.00038146492,0.00006497107,0.0002116886,0.0001506498,0.36579943,0.019338591,0.5151324,0.00467219,0.09294878],"study_design_scores_gemma":[0.000012599264,0.00003558688,0.00009294683,0.000026795964,0.000006947928,0.00008811828,0.000018820314,0.8921808,0.0038260361,0.102493145,0.0012041728,0.000013900474],"about_ca_topic_score_codex":0.00070321007,"about_ca_topic_score_gemma":0.00062075024,"teacher_disagreement_score":0.003212275,"about_ca_system_score_codex":0.0006509319,"about_ca_system_score_gemma":0.00076022424,"threshold_uncertainty_score":0.010746121},"labels":[],"label_agreement":null},{"id":"W2477316811","doi":"10.1109/globalsip.2016.7905908","title":"In-network linear regression with arbitrarily split data matrices","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Regularization (linguistics); Computer science; Linear regression; Class (philosophy); Regression; Algorithm; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.02612659629060339,"score_gpt":0.25332786489831355,"score_spread":0.22720126860771017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477316811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015107814,0.000056586992,0.9836053,0.00020528732,0.000014028026,0.000020770589,0.000027712917,0.00007655438,0.00088603096],"genre_scores_gemma":[0.6627835,0.00018359364,0.33266076,0.00023438514,0.000078606354,0.00015315732,0.0002050664,0.000062612264,0.0036383625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810046,0.0010330337,0.00005243687,0.000368838,0.00029129803,0.00015392444],"domain_scores_gemma":[0.99534106,0.0030456167,0.00047049474,0.0006961069,0.00031722191,0.00012947196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030768497,0.0008029688,0.00086188846,0.00034194984,0.00046402263,0.00074748,0.0014690581,0.0012748137,0.0015026118],"category_scores_gemma":[0.009513451,0.00038764405,0.00048003974,0.00062381144,0.0013761825,0.0021805149,0.0022468057,0.0015443565,0.00043927666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001424431,0.000057516114,0.00068807125,0.000049959956,0.000047288053,0.00011905677,0.00011121764,0.94317937,0.0035991003,0.02441306,0.0007909915,0.0268019],"study_design_scores_gemma":[0.00000757186,0.000017396429,0.000054745073,0.0000018978074,0.0000028837965,0.00001727302,0.000012768531,0.99153227,0.00069372816,0.0074256198,0.0002307024,0.0000030117887],"about_ca_topic_score_codex":0.002274945,"about_ca_topic_score_gemma":0.0027004005,"teacher_disagreement_score":0.0030768497,"about_ca_system_score_codex":0.0006573175,"about_ca_system_score_gemma":0.0008620454,"threshold_uncertainty_score":0.016272128},"labels":[],"label_agreement":null},{"id":"W2481752281","doi":"10.1109/access.2016.2598320","title":"Sparse Reconstruction of Compressive Sensing Multi-Spectral Data Using an Inter-Spectral Multi-Layered Conditional Random Field Model","year":2016,"lang":"en","type":"article","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Canada Research Chairs","keywords":"Compressed sensing; Hyperspectral imaging; Spectral imaging; Full spectral imaging; Computer science; Iterative reconstruction; Spectral bands; Detector; Artificial intelligence; Conditional random field; Data acquisition; Computer vision; Remote sensing; Telecommunications; Geology","score_opus":0.16566086745656533,"score_gpt":0.34887818898092454,"score_spread":0.1832173215243592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481752281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010249737,0.0001021223,0.98885053,0.00013108236,0.000013098058,0.000016220716,0.000054391203,0.00011188975,0.00047093286],"genre_scores_gemma":[0.6333566,0.0008301366,0.36184308,0.00020751082,0.000073428884,0.00014028905,0.0005928082,0.00006485813,0.0028913803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994955,0.00017715555,0.00002039434,0.000077486,0.00017922364,0.000050296283],"domain_scores_gemma":[0.9988954,0.00063344167,0.00013822138,0.00010773391,0.00018588142,0.00003926643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013256043,0.00059020927,0.00061111077,0.00046331188,0.00018888352,0.0006243054,0.0008821322,0.00078472914,0.00097523147],"category_scores_gemma":[0.0028587745,0.0003357799,0.0007176378,0.0006209112,0.0007100645,0.0010737216,0.00067958765,0.0011616185,0.00024495108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012209499,0.000058235288,0.00088770146,0.000097224416,0.000052450338,0.00014152033,0.00006190613,0.92812026,0.009374226,0.025164941,0.0010533605,0.03486604],"study_design_scores_gemma":[0.000002623569,0.000011997419,0.000094405,0.0000030009626,0.0000038781527,0.00002021633,0.0000037398838,0.99767786,0.0006026046,0.0014315182,0.00014300084,0.0000052447494],"about_ca_topic_score_codex":0.0044621397,"about_ca_topic_score_gemma":0.004422571,"teacher_disagreement_score":0.0044621397,"about_ca_system_score_codex":0.00049286074,"about_ca_system_score_gemma":0.0008399452,"threshold_uncertainty_score":0.00887239},"labels":[],"label_agreement":null},{"id":"W2490364661","doi":"10.3166/ts.27.53-78","title":"A priori par normes mixtes pour les problèmes inverses. Application à la localisation de sources en M/EEG","year":2010,"lang":"fr","type":"preprint","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Humanities; Philosophy; Physics","score_opus":0.012176517422951703,"score_gpt":0.22690270111302566,"score_spread":0.21472618369007396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490364661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00573057,0.000646158,0.9919084,0.00033262823,0.000057967893,0.00002263175,0.0000929706,0.00013708803,0.0010717227],"genre_scores_gemma":[0.15592095,0.0035676244,0.8221265,0.00026927554,0.0004585824,0.00035320676,0.00060627336,0.00039504445,0.016302535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989231,0.00047756743,0.000054268145,0.00016949071,0.00033980404,0.00003566929],"domain_scores_gemma":[0.9956442,0.0036420724,0.000177758,0.00015356088,0.0002954709,0.00008698833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024633175,0.0014587139,0.00090078946,0.00085142074,0.0003207906,0.0014843231,0.0007096954,0.0019677558,0.0046839872],"category_scores_gemma":[0.011345052,0.0006865714,0.00083768956,0.0010699817,0.0016411461,0.002567404,0.0014931763,0.0035190817,0.001100462],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006889247,0.00012501406,0.0007267933,0.00077555043,0.00021728633,0.00030433634,0.00038763342,0.50516045,0.03445345,0.1852019,0.0052327323,0.266726],"study_design_scores_gemma":[0.000026709436,0.00010755376,0.00033996612,0.000058645688,0.000019510484,0.0001749595,0.000058977334,0.94046474,0.0070936526,0.045895036,0.0057293125,0.000030883864],"about_ca_topic_score_codex":0.002989764,"about_ca_topic_score_gemma":0.0029923439,"teacher_disagreement_score":0.0046839872,"about_ca_system_score_codex":0.00073958817,"about_ca_system_score_gemma":0.0007106176,"threshold_uncertainty_score":0.015669525},"labels":[],"label_agreement":null},{"id":"W2490965848","doi":"10.1109/icc.2016.7511269","title":"On weighting/reweighting schemes for approximate message passing algorithms","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Weighting; Message passing; Block (permutation group theory); Algorithm; Computer science; Cover (algebra); Computational complexity theory; Mathematics; Parallel computing; Engineering","score_opus":0.018658238936210367,"score_gpt":0.24026581483212597,"score_spread":0.22160757589591562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490965848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029541275,0.00020266905,0.99603647,0.00006734757,0.000040399125,0.000033211865,0.000008116516,0.00013458569,0.00052313815],"genre_scores_gemma":[0.1604854,0.00092478644,0.8333897,0.00021229818,0.00025138288,0.0002647885,0.00012226375,0.00015935315,0.0041899905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762625,0.0010518,0.0001625992,0.00023112916,0.0007718653,0.0001564086],"domain_scores_gemma":[0.9941455,0.0032522432,0.00037123158,0.001296495,0.0008285149,0.00010607943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045430916,0.0014713128,0.0011016033,0.0010292439,0.0006149652,0.0010936919,0.0019317891,0.0014044497,0.002429551],"category_scores_gemma":[0.015575318,0.00050490856,0.00067992613,0.0015068486,0.0014128515,0.0036393704,0.00209478,0.0023890461,0.0010992446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035061882,0.00012522606,0.0005907021,0.00028129012,0.00008748851,0.00007594845,0.00028048555,0.44402447,0.017502487,0.13597138,0.002344685,0.39836526],"study_design_scores_gemma":[0.000027428643,0.00011567433,0.000085046784,0.000025037378,0.000016892174,0.00005040624,0.000014026599,0.964984,0.0062193293,0.024608959,0.003829393,0.000023856523],"about_ca_topic_score_codex":0.0012147542,"about_ca_topic_score_gemma":0.0009890468,"teacher_disagreement_score":0.0045430916,"about_ca_system_score_codex":0.0006650393,"about_ca_system_score_gemma":0.00075225095,"threshold_uncertainty_score":0.024026453},"labels":[],"label_agreement":null},{"id":"W2494573628","doi":"10.1109/infocom.2016.7524580","title":"High-precision shortest distance estimation for large-scale social networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Scale (ratio); Estimation; Artificial intelligence; Geography; Cartography; Engineering","score_opus":0.010384100611870693,"score_gpt":0.23781601946222375,"score_spread":0.22743191885035305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494573628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011037103,0.00036655433,0.9872606,0.00016522498,0.00003653752,0.000020741856,0.000084040905,0.0004121582,0.0006170083],"genre_scores_gemma":[0.42990735,0.00095630763,0.5662166,0.000128905,0.00009475724,0.000127539,0.0006749013,0.00008736292,0.00180627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988588,0.00030614814,0.00006463911,0.00022013705,0.00048326782,0.00006694645],"domain_scores_gemma":[0.9975865,0.0013064625,0.0003618765,0.00037740287,0.00028924894,0.00007860865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086560234,0.0009549505,0.00073035475,0.0010673149,0.0005946007,0.0008265947,0.0011724662,0.0009751632,0.0010223015],"category_scores_gemma":[0.0062290975,0.00043865526,0.00043033244,0.0014630946,0.0006096904,0.0019524363,0.0012697799,0.0013352253,0.0005945541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020605563,0.0000785784,0.0019302102,0.00024688762,0.00008936469,0.00020715747,0.00023783947,0.7209599,0.015283814,0.025689617,0.0041722828,0.2308983],"study_design_scores_gemma":[0.000006665629,0.00001789878,0.00020412791,0.0000075122357,0.0000042311412,0.000050207655,0.000032176962,0.9878187,0.0017638443,0.009025243,0.0010619386,0.0000074435957],"about_ca_topic_score_codex":0.0041689277,"about_ca_topic_score_gemma":0.0045786407,"teacher_disagreement_score":0.0041689277,"about_ca_system_score_codex":0.00070341316,"about_ca_system_score_gemma":0.0008746539,"threshold_uncertainty_score":0.008289337},"labels":[],"label_agreement":null},{"id":"W2515000832","doi":"10.1007/s11042-016-3859-3","title":"Adaptive residual-based distributed compressed sensing for soft video multicasting over wireless networks","year":2016,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multicast; Network packet; Unicast; Encoder; Channel (broadcasting); Block (permutation group theory); Uncompressed video; Frame (networking); Real-time computing; Residual; Wireless; Computer network; Reference frame; Computer hardware; Algorithm; Video processing; Telecommunications; Video tracking","score_opus":0.02634435051675777,"score_gpt":0.2460031799858224,"score_spread":0.21965882946906465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515000832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0179032,0.00024466706,0.9806039,0.00017445577,0.000056578974,0.00001911611,0.000028995713,0.00014656769,0.00082252047],"genre_scores_gemma":[0.71703005,0.0004804509,0.27916142,0.00021692358,0.00019920025,0.00007851067,0.00014472996,0.000059552247,0.0026290559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994634,0.0001451139,0.000024638313,0.000079946156,0.0002380418,0.00004887318],"domain_scores_gemma":[0.99890566,0.00064221304,0.000116386174,0.000107849744,0.00019192093,0.00003593019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006856736,0.0005107869,0.00069054635,0.00041969592,0.0002823954,0.00047718678,0.0010462228,0.0008234406,0.0010357501],"category_scores_gemma":[0.0030141654,0.00021263884,0.00025928527,0.00053182995,0.0005575497,0.0010224672,0.0009558899,0.0008557041,0.00017258142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080844975,0.00026245523,0.00056408806,0.00028520846,0.00009259596,0.00017045285,0.0002176164,0.53438103,0.10800661,0.025125243,0.003490174,0.326596],"study_design_scores_gemma":[0.0000103548455,0.000035249795,0.000049713828,0.000003729195,0.0000049831283,0.000020407711,0.0000106610605,0.9946234,0.002970902,0.0020490827,0.00021592437,0.0000056255276],"about_ca_topic_score_codex":0.0015926736,"about_ca_topic_score_gemma":0.0025898917,"teacher_disagreement_score":0.0015926736,"about_ca_system_score_codex":0.00034462806,"about_ca_system_score_gemma":0.00043041492,"threshold_uncertainty_score":0.0036262274},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Convergence (economics); Lagrange multiplier; Multiplier (economics); Mathematics; Acceleration; Applied mathematics; Augmented Lagrangian method; Rate of convergence; Mathematical optimization; Algorithm; Computer science; Key (lock); Physics","score_opus":0.016826412063565294,"score_gpt":0.24674287117333238,"score_spread":0.22991645910976707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2523748411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016777268,0.0015383125,0.972762,0.0009909291,0.00022963442,0.00006807026,0.000060826576,0.00011754198,0.0074553764],"genre_scores_gemma":[0.5297138,0.0041264887,0.45146245,0.0010830151,0.0005149777,0.000436132,0.0005233519,0.00031934463,0.01182043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981918,0.00092217274,0.00009723903,0.00022904247,0.00044036188,0.000119448974],"domain_scores_gemma":[0.9881337,0.007747241,0.00068039354,0.0008304623,0.002312651,0.00029555525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009159404,0.0017884218,0.001369767,0.00094982417,0.00063363276,0.0012686574,0.0016349031,0.0023275467,0.0031156999],"category_scores_gemma":[0.02423681,0.00046884065,0.0018678717,0.000634997,0.0019413558,0.0026040496,0.0022235054,0.0033819007,0.0005914769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034229597,0.00012320364,0.0023588215,0.00070668745,0.00020971542,0.00070834655,0.00030603725,0.6464272,0.0071145203,0.29141152,0.0062485114,0.044043206],"study_design_scores_gemma":[0.000016991951,0.00005630314,0.00017832303,0.000040692128,0.000017133225,0.00009399867,0.000021579524,0.9797555,0.00075250264,0.018176815,0.000877204,0.000012871279],"about_ca_topic_score_codex":0.0026262328,"about_ca_topic_score_gemma":0.001494458,"teacher_disagreement_score":0.009159404,"about_ca_system_score_codex":0.00087198743,"about_ca_system_score_gemma":0.0017163843,"threshold_uncertainty_score":0.0484401},"labels":[],"label_agreement":null},{"id":"W2532464425","doi":"10.1109/embc.2016.7591531","title":"Compressive sensing of foot-gait signals by enhancing group block-sparse structure on the first-order difference","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canada Research Chairs","keywords":"Block (permutation group theory); Compressed sensing; Gait; Computer science; Regularization (linguistics); SIGNAL (programming language); Algorithm; Group structure; Minification; Norm (philosophy); Artificial intelligence; Pattern recognition (psychology); Mathematics; Physical medicine and rehabilitation; Medicine; Combinatorics","score_opus":0.010987745662611296,"score_gpt":0.2031270035094011,"score_spread":0.1921392578467898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532464425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025440974,0.00014172822,0.973225,0.00011451609,0.00003808478,0.000026994,0.000028286096,0.00012611339,0.00085832004],"genre_scores_gemma":[0.30200776,0.00039715483,0.69500107,0.00011294176,0.000077892546,0.00007490746,0.00016016264,0.0000395764,0.0021284528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997024,0.00006468797,0.000010931588,0.00003152009,0.00017332379,0.000017180899],"domain_scores_gemma":[0.9995396,0.00022301642,0.000054258464,0.00005208445,0.00011202715,0.000019124049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752196,0.00040147852,0.00039072582,0.00038440072,0.00016897936,0.0002883012,0.00046380167,0.0003904851,0.0008161418],"category_scores_gemma":[0.0015009465,0.00016463004,0.00028272113,0.00050042506,0.00036586422,0.0006410116,0.00051968143,0.0005204096,0.00024312458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036321307,0.00013844392,0.001226064,0.00030240897,0.00006395672,0.00015176767,0.00022154504,0.14546895,0.36871445,0.02424023,0.0021638044,0.45694524],"study_design_scores_gemma":[0.000018895294,0.00023932828,0.00058102695,0.00001133914,0.000013479951,0.00020505612,0.00002040934,0.94411826,0.0491083,0.0029259927,0.002739363,0.000018589544],"about_ca_topic_score_codex":0.0008140862,"about_ca_topic_score_gemma":0.0013860374,"teacher_disagreement_score":0.0008161418,"about_ca_system_score_codex":0.00018647505,"about_ca_system_score_gemma":0.00039365422,"threshold_uncertainty_score":0.0027302504},"labels":[],"label_agreement":null},{"id":"W2539488803","doi":"10.1109/acssc.2010.5757506","title":"Empirical risk minimization-based analysis of segmented compressed sampling","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Minification; Computer science; Realization (probability); Sampling (signal processing); Compressed sensing; Selection (genetic algorithm); Empirical risk minimization; Operator (biology); Algorithm; Mathematical optimization; Integrator; Shrinkage; SIGNAL (programming language); Quality (philosophy); Artificial intelligence; Mathematics; Statistics; Machine learning; Bandwidth (computing); Computer vision; Telecommunications","score_opus":0.02471463068432771,"score_gpt":0.2846953964339063,"score_spread":0.25998076574957857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539488803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010290517,0.00022392054,0.9879693,0.0001443344,0.000013491082,0.000015136858,0.00002017902,0.0000448566,0.0012783979],"genre_scores_gemma":[0.66657007,0.0017603531,0.3228289,0.00026093883,0.00022618346,0.00019439933,0.0003072386,0.00020372214,0.007648197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906904,0.0003400996,0.000026851236,0.00010491401,0.0004089835,0.00005014706],"domain_scores_gemma":[0.99709475,0.0019003368,0.00026477952,0.00017017272,0.0005065518,0.000063292384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016807402,0.0007800808,0.00065892783,0.0008233748,0.00020254926,0.0006895685,0.00076183234,0.00065094366,0.0019317386],"category_scores_gemma":[0.0069640693,0.0002718056,0.00049339543,0.00046090194,0.0014199818,0.0013397537,0.0008464774,0.0009931745,0.00020084325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016948079,0.00004476521,0.0007724282,0.00025886876,0.00009667164,0.0002448487,0.00021221861,0.5609202,0.022029005,0.36067662,0.0016564835,0.052918486],"study_design_scores_gemma":[0.0000036715494,0.000019527079,0.00015378217,0.000007859912,0.000005028464,0.000040162642,0.0000070167202,0.98304003,0.0013745746,0.01478638,0.00055452227,0.000007505019],"about_ca_topic_score_codex":0.00096456043,"about_ca_topic_score_gemma":0.0006046664,"teacher_disagreement_score":0.0019317386,"about_ca_system_score_codex":0.0007525589,"about_ca_system_score_gemma":0.0006630616,"threshold_uncertainty_score":0.0088887215},"labels":[],"label_agreement":null},{"id":"W2542514574","doi":"10.1109/acssc.2011.6190195","title":"Power-iterative strategy for &amp;#x2113;&lt;inf&gt;p&lt;/inf&gt;&amp;#x2212;&amp;#x2113;&lt;inf&gt;2&lt;/inf&gt; optimization for compressive sensing: Towards global solution","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Institute of Science and Technology Austria","keywords":"Compressed sensing; Minification; Function (biology); Computer science; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Biology","score_opus":0.058766195011143024,"score_gpt":0.28296945904475074,"score_spread":0.2242032640336077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542514574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025708943,0.00009964956,0.9928352,0.00022484084,0.00002309561,0.000051098094,0.000025199224,0.00012788265,0.0040420336],"genre_scores_gemma":[0.19342019,0.00040505262,0.7910836,0.00043906076,0.000089302404,0.0005048688,0.00019127567,0.00027488352,0.013591854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927264,0.0002788176,0.000027853761,0.00012592367,0.00020337485,0.000091388465],"domain_scores_gemma":[0.998955,0.00060494,0.000077044235,0.00012725338,0.00017442711,0.000061270104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015951465,0.0013339499,0.0009828195,0.00072691723,0.0005596339,0.0009556304,0.0016772473,0.001384672,0.0065373075],"category_scores_gemma":[0.0037758674,0.00045100143,0.0009112544,0.00088896084,0.0014593765,0.0016501804,0.0024106908,0.0016368966,0.0019118304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022710553,0.00016566117,0.00069018384,0.00034334927,0.000099545774,0.00028578966,0.0003159458,0.6283834,0.00937783,0.16016753,0.010080583,0.18986313],"study_design_scores_gemma":[0.00002158062,0.00006462499,0.00006870431,0.000017634027,0.000009652002,0.00005322781,0.000024688703,0.97105634,0.002315033,0.023862889,0.002494251,0.000011434108],"about_ca_topic_score_codex":0.0032782305,"about_ca_topic_score_gemma":0.0049259686,"teacher_disagreement_score":0.0065373075,"about_ca_system_score_codex":0.0009749528,"about_ca_system_score_gemma":0.002219414,"threshold_uncertainty_score":0.02186948},"labels":[],"label_agreement":null},{"id":"W2545110099","doi":"10.1109/acssc.2010.5757594","title":"Compressive sensing based multiview image coding with belief propagation","year":2010,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Belief propagation; Compressed sensing; Decoding methods; Computer science; Artificial intelligence; Coding (social sciences); Computer vision; Iterative reconstruction; Image (mathematics); Algorithm; Mathematics","score_opus":0.007876280209772983,"score_gpt":0.21309100041875564,"score_spread":0.20521472020898265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545110099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003365221,0.00011499866,0.9958677,0.00007879568,0.000014436648,0.00000865074,0.0000195675,0.000072597184,0.00045796626],"genre_scores_gemma":[0.37799796,0.0008059093,0.618311,0.00017621799,0.00013059616,0.000114221715,0.00023851833,0.000055551976,0.0021700065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993819,0.00017427748,0.000029620149,0.0000923329,0.00027752208,0.000044346914],"domain_scores_gemma":[0.9987319,0.0007561378,0.00012607849,0.00014466817,0.00020796982,0.000033232893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010500441,0.0007091218,0.0007566787,0.00064964185,0.00023575607,0.0007086921,0.0010992383,0.00086232956,0.0009210649],"category_scores_gemma":[0.004071118,0.0003892651,0.00053913705,0.0012404339,0.0008331823,0.0016432827,0.0012192061,0.0015307377,0.0002713201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017786297,0.00005166225,0.0003756801,0.00012598044,0.00005634441,0.00009289552,0.00010701461,0.76898324,0.011549999,0.047670722,0.0014857346,0.1693229],"study_design_scores_gemma":[0.0000074550317,0.000012929409,0.000037627502,0.0000045792835,0.0000039818224,0.000018564273,0.0000041171265,0.9924946,0.0013490762,0.005807278,0.00025399838,0.0000057332772],"about_ca_topic_score_codex":0.003007291,"about_ca_topic_score_gemma":0.0023016285,"teacher_disagreement_score":0.003007291,"about_ca_system_score_codex":0.00050575077,"about_ca_system_score_gemma":0.0006460219,"threshold_uncertainty_score":0.0059795976},"labels":[],"label_agreement":null},{"id":"W2547076548","doi":"10.1109/ccece.2016.7726836","title":"A low power Dirac basis compressed sensing framework for EEG using a Meyer wavelet function dictionary","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Electroencephalography; Wavelet; Compressed sensing; Basis (linear algebra); Wavelet transform; Pattern recognition (psychology); Computer science; Artificial intelligence; Function (biology); Speech recognition; Mathematics; Psychology","score_opus":0.02015637791753205,"score_gpt":0.2412363981612518,"score_spread":0.22108002024371975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547076548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003893322,0.00015017924,0.9948297,0.000087714725,0.000022052647,0.000018883686,0.000036251477,0.00007441157,0.00088734337],"genre_scores_gemma":[0.164331,0.0010857944,0.82994825,0.00010480387,0.00012171207,0.000116626274,0.00022307447,0.00006216024,0.0040065655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984455,0.000041261956,0.000007973001,0.000021194892,0.00007452461,0.0000105419],"domain_scores_gemma":[0.9998486,0.000060834733,0.000014473237,0.000026441021,0.0000381086,0.000011492714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029742517,0.00042876252,0.0002925302,0.00034210636,0.0001691938,0.0004139857,0.000506016,0.0003996285,0.0015751056],"category_scores_gemma":[0.00081511587,0.00013579903,0.00029544515,0.0004973531,0.00036727777,0.00058577576,0.00043826192,0.0007008286,0.00049460394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023273098,0.000105938336,0.00060261134,0.0002789552,0.0000543447,0.0003326481,0.00019703036,0.24938954,0.11134875,0.20470457,0.004005821,0.4287471],"study_design_scores_gemma":[0.000014198882,0.00011241912,0.00017474794,0.000015875296,0.000009139762,0.00018077953,0.000022872113,0.97363245,0.008485101,0.011737495,0.005598976,0.000015902313],"about_ca_topic_score_codex":0.0015604976,"about_ca_topic_score_gemma":0.0019579104,"teacher_disagreement_score":0.0015751056,"about_ca_system_score_codex":0.00020754957,"about_ca_system_score_gemma":0.0005227886,"threshold_uncertainty_score":0.005269289},"labels":[],"label_agreement":null},{"id":"W2547457306","doi":"10.1109/ccece.2016.7726815","title":"Penalty convex-concave procedure for source localization problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Regular polygon; Focus (optics); Convex optimization; Norm (philosophy); Computer science; Convex function; Residual; Path (computing); Mathematics; Algorithm","score_opus":0.010995197789697668,"score_gpt":0.2139833127232169,"score_spread":0.20298811493351923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547457306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010096346,0.00007770041,0.9978531,0.00014294428,0.000017369197,0.000016068905,0.000019699586,0.00008250085,0.0007808401],"genre_scores_gemma":[0.18358189,0.00080178055,0.80388814,0.00041858986,0.00018181145,0.0004623705,0.00036501582,0.00040891973,0.009891452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940944,0.00027888903,0.000018966206,0.00009692705,0.00014933464,0.0000465841],"domain_scores_gemma":[0.9991208,0.0005722761,0.00006417189,0.00006157317,0.00014143884,0.000039738745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013359116,0.0014271153,0.0007719013,0.00053635665,0.0004372148,0.0007421365,0.0009873892,0.0012450912,0.0033046613],"category_scores_gemma":[0.002944313,0.00038704177,0.00069015427,0.00072960864,0.0010280213,0.00090225146,0.0014318179,0.0020690942,0.0012700362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017596711,0.00006338182,0.00048675173,0.0004436657,0.00005361737,0.00036885202,0.00016705893,0.7840836,0.012719087,0.09991784,0.00866352,0.092856675],"study_design_scores_gemma":[0.000007886141,0.000027082502,0.00004280849,0.000009554161,0.000004091206,0.00006959518,0.000011762201,0.98832977,0.0016691007,0.00802295,0.0017975919,0.000007759866],"about_ca_topic_score_codex":0.0018761205,"about_ca_topic_score_gemma":0.001705078,"teacher_disagreement_score":0.0033046613,"about_ca_system_score_codex":0.00061896024,"about_ca_system_score_gemma":0.0011911943,"threshold_uncertainty_score":0.0110551715},"labels":[],"label_agreement":null},{"id":"W2547486602","doi":"10.1109/ccece.2016.7726862","title":"Hyperspectral classification with adaptively weighted li-norm regularization","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Hyperspectral imaging; Regularization (linguistics); Maxima and minima; Convexity; Pixel; Computer science; Norm (philosophy); Pattern recognition (psychology); Algorithm; Regression; Artificial intelligence; Mathematics; Statistics","score_opus":0.015744866045436127,"score_gpt":0.19566906279542662,"score_spread":0.1799241967499905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547486602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012923807,0.00007930812,0.9854623,0.00010348139,0.000013197829,0.000024803934,0.000033200355,0.00044817917,0.0009116565],"genre_scores_gemma":[0.14237653,0.0001478948,0.85382086,0.00013419232,0.000046685855,0.00008894602,0.0003270363,0.00011993516,0.0029379353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999246,0.00019292293,0.000031061707,0.0001627826,0.00031843214,0.000048774273],"domain_scores_gemma":[0.99926513,0.00025257244,0.00011777307,0.00015664464,0.00018545648,0.000022320677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010402144,0.0005741398,0.0006123561,0.00092619646,0.00034568843,0.0007358245,0.0009912975,0.0008890794,0.0013485998],"category_scores_gemma":[0.0023478377,0.00027524238,0.00070860767,0.0010174129,0.00077092875,0.0013107987,0.001137987,0.001176673,0.0008886483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018325701,0.00014753538,0.001392791,0.00011961893,0.00008415264,0.00005306124,0.00013393798,0.22345416,0.060647134,0.019189099,0.0042165136,0.69037884],"study_design_scores_gemma":[0.000004695868,0.000018165903,0.0002739533,0.00000314985,0.000003560483,0.000024384122,0.000010805623,0.98891723,0.006807853,0.0030622617,0.0008675936,0.0000064390783],"about_ca_topic_score_codex":0.0017090426,"about_ca_topic_score_gemma":0.002858663,"teacher_disagreement_score":0.0017090426,"about_ca_system_score_codex":0.00039055193,"about_ca_system_score_gemma":0.000693501,"threshold_uncertainty_score":0.0055012703},"labels":[],"label_agreement":null},{"id":"W2547763301","doi":"10.1109/tnet.2016.2615889","title":"DISCS: A Distributed Coordinate System Based on Robust Nonnegative Matrix Completion","year":2016,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Convergence (economics); Usability; Distributed computing; Set (abstract data type); Scale (ratio); Matrix (chemical analysis); Matrix completion; Coordinate system; Algorithm; Computer engineering; Data mining; Artificial intelligence; Database","score_opus":0.023738617826167707,"score_gpt":0.2295285528162291,"score_spread":0.2057899349900614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547763301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042916625,0.00012312816,0.9936055,0.000099533136,0.00008009314,0.000042724812,0.00017541161,0.0008554392,0.0007264742],"genre_scores_gemma":[0.2942932,0.0005021415,0.6994698,0.00016214112,0.00022870314,0.00041284753,0.0015571271,0.00019346399,0.0031805374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844235,0.0004975649,0.00007676259,0.00035504988,0.0005266252,0.00010165241],"domain_scores_gemma":[0.99846256,0.00034631358,0.00025842604,0.00038807816,0.0004212842,0.00012346462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012175976,0.001157231,0.0012358769,0.0009836194,0.0006106083,0.0010786251,0.001856163,0.0007013425,0.0018137194],"category_scores_gemma":[0.004871193,0.00036023013,0.00058476557,0.0014928891,0.0011861468,0.001684075,0.002837219,0.0015676171,0.0010733135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006922525,0.00010958029,0.0019569586,0.00020609457,0.00009535567,0.0002116034,0.00025500302,0.5574612,0.018958328,0.0725835,0.019983374,0.32748675],"study_design_scores_gemma":[0.0000465468,0.00010227507,0.00024592,0.000008165374,0.000008540313,0.0000560882,0.000026234065,0.98411036,0.0035178892,0.0067661935,0.0050815293,0.00003028942],"about_ca_topic_score_codex":0.006853342,"about_ca_topic_score_gemma":0.0048155035,"teacher_disagreement_score":0.006853342,"about_ca_system_score_codex":0.0006573046,"about_ca_system_score_gemma":0.001758808,"threshold_uncertainty_score":0.0136268735},"labels":[],"label_agreement":null},{"id":"W2550718412","doi":"10.1109/ijcnn.2016.7727698","title":"Theoretical analysis of the Minimum Sum of Squared Similarities sampling for Nyström-based spectral clustering","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"","keywords":"Cluster analysis; Spectral clustering; Sampling (signal processing); Rank (graph theory); Computer science; Computational complexity theory; Scalability; Algorithm; Matrix (chemical analysis); Mathematics; Artificial intelligence; Pattern recognition (psychology); Combinatorics","score_opus":0.02240390278507257,"score_gpt":0.252384669551163,"score_spread":0.22998076676609044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550718412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036784322,0.00024461249,0.99407804,0.00016305277,0.000024332503,0.000029290904,0.000025415318,0.000059621554,0.0016973038],"genre_scores_gemma":[0.3709736,0.0017565092,0.622095,0.00029902643,0.0002983775,0.000467301,0.0003140033,0.00018127257,0.0036149626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980205,0.0006493524,0.00007035477,0.00023950283,0.00093016186,0.00009014419],"domain_scores_gemma":[0.99406624,0.004095208,0.0003585499,0.00045014155,0.0008961213,0.00013369402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029464683,0.0009424525,0.00090485794,0.0010975532,0.0007205022,0.0012953158,0.0015666246,0.0014432892,0.0026917807],"category_scores_gemma":[0.016391711,0.00042817026,0.00064493925,0.001355412,0.001960635,0.0024414908,0.0015952255,0.0015336806,0.0007478665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010974864,0.00005871106,0.0007240241,0.00023149843,0.00004668812,0.000111627676,0.00015596388,0.57610154,0.0058098845,0.35297027,0.002525384,0.06115471],"study_design_scores_gemma":[0.000005223552,0.000025609814,0.000102446684,0.000014114557,0.00000365346,0.000049809674,0.000014026196,0.96455973,0.0009538587,0.03339789,0.0008640255,0.00000954425],"about_ca_topic_score_codex":0.0013935494,"about_ca_topic_score_gemma":0.0010689436,"teacher_disagreement_score":0.0029464683,"about_ca_system_score_codex":0.0015376814,"about_ca_system_score_gemma":0.001485682,"threshold_uncertainty_score":0.0155825615},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06474276344782105,"score_gpt":0.3797376502487932,"score_spread":0.31499488680097215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551153860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031570941,0.0018818892,0.98755753,0.0013559897,0.00013054293,0.000026926238,0.000020718811,0.00005832932,0.005810951],"genre_scores_gemma":[0.24561852,0.009168378,0.7186879,0.0013876957,0.0008956843,0.00026902297,0.00010376993,0.00041121847,0.02345779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.0006107928,0.000059396323,0.00014188353,0.00041335874,0.00006957344],"domain_scores_gemma":[0.9944066,0.0040310174,0.00033287788,0.00045590874,0.00056370336,0.00020993242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004694218,0.0010483189,0.0011646615,0.0012516225,0.0007901728,0.0019467098,0.0011691132,0.0021017352,0.002786609],"category_scores_gemma":[0.015904795,0.0006285554,0.001333057,0.0010434556,0.0045046085,0.003967588,0.0035231623,0.006036094,0.00092486397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003531395,0.000021477083,0.0002481189,0.00017276616,0.000020794598,0.00010618376,0.00020476476,0.02711306,0.0024713527,0.9452831,0.0017090292,0.02261406],"study_design_scores_gemma":[0.000026505553,0.00011166802,0.00023493067,0.00013818621,0.000022309485,0.00026219283,0.00006457754,0.42341056,0.0032151637,0.5543252,0.01814803,0.000040606763],"about_ca_topic_score_codex":0.0014830261,"about_ca_topic_score_gemma":0.0011101691,"teacher_disagreement_score":0.004694218,"about_ca_system_score_codex":0.0012832438,"about_ca_system_score_gemma":0.0013266203,"threshold_uncertainty_score":0.024825752},"labels":[],"label_agreement":null},{"id":"W2552861514","doi":"10.1109/ijcnn.2016.7727560","title":"Real-time reconstruction of EEG signals from compressive measurements via deep learning","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compressed sensing; Computer science; Base station; Inverse problem; Mobile phone; Wireless; Real-time computing; Signal reconstruction; Computational complexity theory; Latency (audio); Power consumption; Artificial intelligence; Power (physics); Algorithm; Signal processing; Telecommunications; Mathematics","score_opus":0.020160019697432783,"score_gpt":0.22090134497122052,"score_spread":0.20074132527378774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552861514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059004314,0.00026558188,0.938856,0.00024437913,0.00004576783,0.000020635376,0.00007636447,0.00056462956,0.000922381],"genre_scores_gemma":[0.7380992,0.00043463623,0.25903082,0.00010316463,0.0000708792,0.000054303782,0.00029758882,0.000061900995,0.0018475245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985874,0.00003662313,0.000008965969,0.000024769413,0.000051246436,0.000019640485],"domain_scores_gemma":[0.99958795,0.00021656488,0.000051561994,0.00006174742,0.000062698506,0.000019524623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003817256,0.00059392606,0.00034499576,0.0002539481,0.00014457892,0.0003401956,0.00039533107,0.00047383085,0.00095202756],"category_scores_gemma":[0.0019993552,0.00032993214,0.00030844478,0.0003296473,0.00041105913,0.0007382899,0.0006429122,0.0011964057,0.00024692592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031886162,0.00012721731,0.0014909118,0.00014739406,0.000076830176,0.00021132211,0.00013072795,0.6247907,0.0606573,0.0066113723,0.0020899822,0.30334732],"study_design_scores_gemma":[0.000003629918,0.000013244162,0.00019607485,0.0000031287314,0.0000021521796,0.00002197129,0.0000046786627,0.9950636,0.0034588135,0.00105051,0.00017861929,0.0000035375422],"about_ca_topic_score_codex":0.0022657078,"about_ca_topic_score_gemma":0.0030948971,"teacher_disagreement_score":0.0022657078,"about_ca_system_score_codex":0.00021455341,"about_ca_system_score_gemma":0.0004951153,"threshold_uncertainty_score":0.0045049787},"labels":[],"label_agreement":null},{"id":"W2555117105","doi":"10.1109/ijcnn.2016.7727697","title":"Ensemble Minimum Sum of Squared Similarities sampling for Nyström-based spectral clustering","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre","funders":"Genome British Columbia; Genome Canada","keywords":"Cluster analysis; Sampling (signal processing); Computer science; Spectral clustering; Rank (graph theory); Computational complexity theory; Selection (genetic algorithm); Pattern recognition (psychology); Artificial intelligence; Algorithm; Data mining; Mathematics","score_opus":0.03815010857087771,"score_gpt":0.25745423875404966,"score_spread":0.21930413018317196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555117105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004974929,0.00010598783,0.99434376,0.000058356523,0.000017521972,0.000022781456,0.000024085935,0.00009902318,0.00035362074],"genre_scores_gemma":[0.21630612,0.00029719216,0.78107566,0.00012007867,0.00009275625,0.00022836398,0.00034305075,0.00009687463,0.0014399384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838114,0.0006471425,0.000082041595,0.00023808925,0.00058378064,0.000067875946],"domain_scores_gemma":[0.9971777,0.0015218053,0.00025607547,0.00042201637,0.00052560365,0.00009673146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020875956,0.00084485806,0.0011804946,0.00090541545,0.0007264391,0.00096158846,0.0013002849,0.0012063868,0.0014797098],"category_scores_gemma":[0.009523519,0.00039656422,0.00069911894,0.0011987203,0.00090037717,0.0016261549,0.0014887651,0.0014120324,0.00061689306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031940936,0.00012997595,0.0019197286,0.000252737,0.00013152775,0.00013030012,0.00026125603,0.65574723,0.014286883,0.07989302,0.0034456623,0.24348232],"study_design_scores_gemma":[0.000007136175,0.00003056765,0.0001733092,0.0000072296853,0.0000046143605,0.00004335355,0.000016346663,0.98701745,0.002025878,0.00971638,0.00094713946,0.00001066186],"about_ca_topic_score_codex":0.001857006,"about_ca_topic_score_gemma":0.0025318325,"teacher_disagreement_score":0.0020875956,"about_ca_system_score_codex":0.0007454491,"about_ca_system_score_gemma":0.0011824094,"threshold_uncertainty_score":0.01104039},"labels":[],"label_agreement":null},{"id":"W2557873547","doi":"10.1109/tsp.2016.2634550","title":"A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":184,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Université de Lyon; Sichuan Provincial Youth Science and Technology Fund; National Natural Science Foundation of China; Agence Nationale de la Recherche","keywords":"Matching pursuit; Computer science; Mathematics; Mathematical optimization; Algorithm; Compressed sensing","score_opus":0.01733816768298668,"score_gpt":0.24112729761747656,"score_spread":0.22378912993448988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557873547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018116666,0.0008050615,0.9755587,0.0009682519,0.0001168259,0.000061209495,0.0002005618,0.0003100969,0.00386253],"genre_scores_gemma":[0.6496482,0.002667128,0.33934864,0.0014295011,0.00073387625,0.00060774595,0.0011408766,0.00041466104,0.0040094233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953306,0.0010275922,0.00025801646,0.0009829958,0.0018485321,0.0005522801],"domain_scores_gemma":[0.9817908,0.012264561,0.0016515154,0.002100206,0.001592581,0.0006003309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005409121,0.002222508,0.0020428337,0.0015068637,0.0008848934,0.0019460771,0.0023487795,0.003771287,0.0044573764],"category_scores_gemma":[0.046287227,0.0011679995,0.0015274172,0.001414238,0.0041167014,0.008121405,0.006483866,0.0063116183,0.0019786458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013954027,0.00017193751,0.0020721725,0.0012759541,0.0001848075,0.0015055389,0.00078425865,0.23190439,0.07562893,0.58731353,0.009699248,0.08806384],"study_design_scores_gemma":[0.00012589525,0.00039661615,0.00079193746,0.00016493318,0.00004127815,0.0006172328,0.00014715503,0.7703777,0.024827512,0.19723871,0.005175734,0.00009529101],"about_ca_topic_score_codex":0.00079669233,"about_ca_topic_score_gemma":0.00040552873,"teacher_disagreement_score":0.005409121,"about_ca_system_score_codex":0.0007909235,"about_ca_system_score_gemma":0.0017671031,"threshold_uncertainty_score":0.028606534},"labels":[],"label_agreement":null},{"id":"W2558301701","doi":"10.1109/iemcon.2016.7746355","title":"Sparse data reconstruction via adaptive ℓ&lt;inf&gt;p&lt;/inf&gt;-norm and multilayer NMF","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Non-negative matrix factorization; Hyperspectral imaging; Computer science; Norm (philosophy); Minification; Dictionary learning; Sparse matrix; Matrix norm; Signal processing; Algorithm; Image (mathematics); Matrix decomposition; Matrix (chemical analysis); Property (philosophy); Function (biology); Artificial intelligence; Eigenvalues and eigenvectors; Digital signal processing","score_opus":0.03514230840997257,"score_gpt":0.2303255988112925,"score_spread":0.19518329040131993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558301701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015293654,0.000044302677,0.9979662,0.0000664402,0.000013608606,0.000009829274,0.000020564104,0.000086635526,0.00026303885],"genre_scores_gemma":[0.086858235,0.00022215571,0.9103769,0.00014951715,0.00008425849,0.00012866032,0.00025041652,0.000094300354,0.0018355746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999209,0.00025923635,0.00004263819,0.00014981629,0.00027597565,0.000063359184],"domain_scores_gemma":[0.99893075,0.00050632725,0.00013607692,0.00016739455,0.00021326865,0.000046145058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014490176,0.00093064725,0.0008564897,0.0006281461,0.00037936447,0.0006013996,0.0009789487,0.0013117815,0.001641332],"category_scores_gemma":[0.0049087396,0.00040316317,0.000984936,0.0008020851,0.00090369774,0.0013806749,0.0012848587,0.0017447552,0.00066824397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018210211,0.000097175696,0.00090916787,0.00022473017,0.00009240437,0.00012632938,0.00013510746,0.6252835,0.025250113,0.04703869,0.0054381234,0.29522258],"study_design_scores_gemma":[0.0000046723453,0.000017342823,0.00009307469,0.000005611586,0.000003829653,0.000034707704,0.0000052391597,0.992519,0.00219483,0.004171742,0.00094165764,0.000008252297],"about_ca_topic_score_codex":0.0032708007,"about_ca_topic_score_gemma":0.0041385605,"teacher_disagreement_score":0.0032708007,"about_ca_system_score_codex":0.0005809482,"about_ca_system_score_gemma":0.0009841692,"threshold_uncertainty_score":0.00766325},"labels":[],"label_agreement":null},{"id":"W2558840726","doi":"10.1109/cosera.2016.7745725","title":"Compressive sensing in pulse radar using prior information","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Nyquist rate; Radar; Signal reconstruction; SIGNAL (programming language); Prior information; Process (computing); Signal processing; Electronic engineering; Artificial intelligence; Computer vision; Telecommunications; Engineering; Sampling (signal processing)","score_opus":0.014400065204646331,"score_gpt":0.22292862852826295,"score_spread":0.20852856332361663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558840726","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009894674,0.0009443915,0.98653257,0.0002663894,0.000053132608,0.000024426821,0.000032251028,0.00007360913,0.0021785905],"genre_scores_gemma":[0.5165771,0.0054794056,0.47259027,0.0004012938,0.00046632963,0.00015514412,0.00022760539,0.00007449812,0.0040282332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993826,0.00018659564,0.00002561298,0.00007359572,0.0002992239,0.000032245094],"domain_scores_gemma":[0.99908805,0.000605852,0.00007898568,0.00008403332,0.00012300012,0.000020091746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010635873,0.000503823,0.00052499655,0.0005730614,0.00020739052,0.0007596948,0.0005621061,0.0008555602,0.0009311594],"category_scores_gemma":[0.003326093,0.00030715507,0.00034553953,0.0006320848,0.0011024731,0.0015749587,0.00093189883,0.0011456895,0.00023041267],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023649576,0.00009008998,0.0008364074,0.0006081779,0.000056321896,0.00045668695,0.00021521954,0.44298226,0.045191888,0.30016404,0.0026400792,0.20652227],"study_design_scores_gemma":[0.000015328911,0.00008028199,0.00030886225,0.000040901545,0.000011006192,0.00018044232,0.00001741357,0.9579585,0.0066847485,0.032659687,0.0020212468,0.000021571512],"about_ca_topic_score_codex":0.0006535168,"about_ca_topic_score_gemma":0.0005626812,"teacher_disagreement_score":0.0010635873,"about_ca_system_score_codex":0.00034069087,"about_ca_system_score_gemma":0.0004353649,"threshold_uncertainty_score":0.0056248307},"labels":[],"label_agreement":null},{"id":"W2559452251","doi":"10.1109/cosera.2016.7745723","title":"Adaptive sub-nyquist sampling based on haar wavelet and compressive sensing in pulsed radar","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nyquist rate; Compressed sensing; Nyquist–Shannon sampling theorem; Algorithm; Computer science; Wavelet; Haar wavelet; Electronic engineering; Sampling (signal processing); SIGNAL (programming language); Wavelet transform; Discrete wavelet transform; Telecommunications; Computer vision; Engineering; Detector","score_opus":0.022173017782945382,"score_gpt":0.22185263920731002,"score_spread":0.19967962142436463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559452251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01725312,0.0008169974,0.9805752,0.000095738695,0.000046764624,0.000022327575,0.000015751462,0.00009553448,0.0010784705],"genre_scores_gemma":[0.35185134,0.0022967022,0.6438903,0.00009618277,0.00014741928,0.000064832726,0.00008561912,0.00003283708,0.0015347735],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00014951806,0.000020806898,0.000059702797,0.00026487286,0.00002777868],"domain_scores_gemma":[0.9994407,0.00032740686,0.00005373042,0.00005790632,0.000101647565,0.000018595938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060904137,0.0003270198,0.00034353262,0.00047927027,0.00017607097,0.00038264797,0.00034524448,0.00051712233,0.0005500459],"category_scores_gemma":[0.0018090128,0.00019222127,0.000284703,0.0007312577,0.00050092756,0.00088052696,0.00039221972,0.00071311713,0.00017396496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044247028,0.00012153043,0.0018013071,0.00036993937,0.00007429169,0.00034692386,0.0002833771,0.24619599,0.12576751,0.071043365,0.0018646932,0.55168855],"study_design_scores_gemma":[0.000009456915,0.00010206126,0.00054878485,0.000011973052,0.000009152008,0.0002198938,0.000019834657,0.97783273,0.014417001,0.004956627,0.0018568791,0.000015486527],"about_ca_topic_score_codex":0.0006415644,"about_ca_topic_score_gemma":0.0006247367,"teacher_disagreement_score":0.0006415644,"about_ca_system_score_codex":0.00020787476,"about_ca_system_score_gemma":0.00030255687,"threshold_uncertainty_score":0.0032209754},"labels":[],"label_agreement":null},{"id":"W2562337126","doi":"","title":"A Scaled Gradient Descent Method for Unconstrained Optimization Problems With A Priori Estimation of the Minimum Value","year":2017,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"A priori and a posteriori; Gradient descent; Mathematical optimization; Mathematics; Value (mathematics); Descent (aeronautics); Computer science; Applied mathematics; Statistics; Artificial intelligence; Engineering; Artificial neural network","score_opus":0.012662514789529336,"score_gpt":0.2195353591680864,"score_spread":0.20687284437855705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562337126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013293736,0.00013563813,0.9963413,0.000105310595,0.00011359706,0.000049593997,0.000024819063,0.00014663754,0.0017537193],"genre_scores_gemma":[0.035403747,0.00022812198,0.9557674,0.00019984537,0.0001498831,0.00030684436,0.00014783685,0.00032896575,0.007467199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993051,0.0002738969,0.000037364094,0.00009487866,0.00025042915,0.000038330425],"domain_scores_gemma":[0.9988887,0.0005629011,0.00004527212,0.00009899276,0.0003229745,0.000081211074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017599871,0.0015484912,0.0011701237,0.0007331116,0.0005487182,0.0009599394,0.0014238763,0.002028522,0.006550845],"category_scores_gemma":[0.0042410493,0.00073889986,0.0010105444,0.00075093773,0.0010459906,0.0013978933,0.0017859983,0.0018414389,0.00172736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026301955,0.00023005351,0.00053384167,0.000514162,0.00019938164,0.00030458413,0.00015372265,0.5755098,0.02499215,0.14148977,0.022525638,0.23328386],"study_design_scores_gemma":[0.000020199455,0.000041321953,0.00006999728,0.000011050205,0.000008026134,0.00002967596,0.0000040696355,0.99081814,0.00091954943,0.005001674,0.0030656196,0.000010635689],"about_ca_topic_score_codex":0.0033078447,"about_ca_topic_score_gemma":0.0043529607,"teacher_disagreement_score":0.006550845,"about_ca_system_score_codex":0.00066185644,"about_ca_system_score_gemma":0.0018660794,"threshold_uncertainty_score":0.02191478},"labels":[],"label_agreement":null},{"id":"W2563280975","doi":"10.1609/aaai.v30i1.10320","title":"Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Online algorithm; Regret; Computer science; Convexity; Reduction (mathematics); Algorithm; Convex optimization; Gradient descent; Convex function; Smoothness; Mathematical optimization; Unification; Regular polygon; Mathematics; Artificial intelligence; Machine learning","score_opus":0.059354583606724874,"score_gpt":0.2635845540217784,"score_spread":0.2042299704150535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563280975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012120052,0.00018368251,0.9970546,0.00016255019,0.000037070953,0.00002881774,0.00002960976,0.00010662691,0.001185077],"genre_scores_gemma":[0.4290037,0.0017932117,0.55653536,0.0006630076,0.0005518445,0.0007993956,0.00032461688,0.0006123389,0.009716479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982951,0.0005272194,0.00007906409,0.00031930968,0.0006130556,0.00016633703],"domain_scores_gemma":[0.99601966,0.0024668947,0.00038019635,0.0004361992,0.00051969156,0.00017740428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033916058,0.0020942478,0.0014090609,0.0009692781,0.00049907033,0.0020242897,0.0029070515,0.001835839,0.0034616431],"category_scores_gemma":[0.01317691,0.00072772894,0.001203569,0.0009842222,0.001994053,0.0033640983,0.0030758125,0.00424649,0.0008655772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008932316,0.00009586469,0.00041818462,0.00023657281,0.00005361386,0.000099829354,0.00009701367,0.6701447,0.0018929066,0.28673458,0.004237187,0.035900164],"study_design_scores_gemma":[0.000006906028,0.000017817327,0.00002941146,0.000009772022,0.0000049680953,0.00001179183,0.0000047451485,0.9591653,0.00034889774,0.039723583,0.0006715227,0.0000052932833],"about_ca_topic_score_codex":0.0019989945,"about_ca_topic_score_gemma":0.0018011582,"teacher_disagreement_score":0.0034616431,"about_ca_system_score_codex":0.0022054194,"about_ca_system_score_gemma":0.0022374378,"threshold_uncertainty_score":0.017936766},"labels":[],"label_agreement":null},{"id":"W2566624937","doi":"10.1109/icip.2016.7533177","title":"A weighted total variation approach for the atlas-based reconstruction of brain MR data","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Atlas (anatomy); Compressed sensing; Artificial intelligence; Probabilistic logic; Iterative reconstruction; Brain atlas; Pattern recognition (psychology); Sampling (signal processing); Noise (video); Computer vision; Data mining; Image (mathematics); Geology","score_opus":0.03129412564884444,"score_gpt":0.2370982591629983,"score_spread":0.20580413351415383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566624937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001005801,0.000116485826,0.99838424,0.000056929082,0.000013993151,0.000012784459,0.000031778163,0.00010680863,0.00027121505],"genre_scores_gemma":[0.11850306,0.0012159924,0.8761126,0.00019110924,0.0001619362,0.0001504954,0.00052656356,0.00021417839,0.0029241692],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992054,0.0002550937,0.000039876242,0.00013127617,0.00033619153,0.0000322253],"domain_scores_gemma":[0.9992508,0.00039334156,0.0000826157,0.00012211404,0.00011811501,0.000032805387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009942685,0.0007527504,0.0006008043,0.000954628,0.00029125312,0.00063369685,0.0010459662,0.0007528978,0.0013093281],"category_scores_gemma":[0.0035049021,0.00035173006,0.00089101045,0.0011498684,0.000699098,0.0010048068,0.0010345008,0.0013187992,0.0005428893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015528698,0.00006256266,0.00052418705,0.00032821033,0.00016350482,0.00018386147,0.00020424668,0.4005275,0.05528991,0.09761163,0.005656423,0.43929267],"study_design_scores_gemma":[0.0000090836675,0.000089066365,0.00023822054,0.00001592352,0.00001922919,0.00026695622,0.000016785725,0.9646347,0.008826938,0.01904499,0.006808445,0.000029776618],"about_ca_topic_score_codex":0.0020478414,"about_ca_topic_score_gemma":0.0025330756,"teacher_disagreement_score":0.0020478414,"about_ca_system_score_codex":0.00039482754,"about_ca_system_score_gemma":0.0007561496,"threshold_uncertainty_score":0.005258262},"labels":[],"label_agreement":null},{"id":"W2566674739","doi":"10.1109/lcn.2016.127","title":"Wavelet-Based Analysis of Interference in WSNs","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interference (communication); Thresholding; Computer science; Wavelet; Discrete wavelet transform; Wireless sensor network; Bandwidth (computing); Wavelet transform; Channel (broadcasting); Channel state information; Artificial intelligence; Wireless; Computer network; Telecommunications; Image (mathematics)","score_opus":0.014261179413398708,"score_gpt":0.22242072823564935,"score_spread":0.20815954882225063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566674739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07437237,0.0006030935,0.921567,0.00019314852,0.00005609456,0.000024130411,0.000084624524,0.00009584936,0.0030037125],"genre_scores_gemma":[0.876278,0.0024045485,0.11730602,0.000085496715,0.00015616813,0.000056722503,0.00021914959,0.000070303475,0.0034236868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997764,0.000052694457,0.000011855387,0.000028947517,0.00010126626,0.000028828448],"domain_scores_gemma":[0.99954754,0.00025923934,0.00006986868,0.00003369153,0.00007337924,0.000016234615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054684095,0.0004515697,0.0004306076,0.0006702387,0.00020966408,0.0005217591,0.0004909346,0.00050262484,0.0007554035],"category_scores_gemma":[0.0018287576,0.0001751143,0.0002964397,0.0007518575,0.0006524881,0.0007166096,0.0005539144,0.0005606036,0.00017162472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001615661,0.000060070754,0.0023384418,0.00022981447,0.000059872636,0.00055418914,0.0002869116,0.76662314,0.08407071,0.08058122,0.0009195696,0.0641145],"study_design_scores_gemma":[0.0000033422714,0.000032155942,0.0008689108,0.000009971006,0.0000060657717,0.00009278676,0.000043770502,0.9836595,0.0026385314,0.01193234,0.00070515135,0.000007448692],"about_ca_topic_score_codex":0.0009030381,"about_ca_topic_score_gemma":0.00048524624,"teacher_disagreement_score":0.0009030381,"about_ca_system_score_codex":0.00024042385,"about_ca_system_score_gemma":0.00024496883,"threshold_uncertainty_score":0.0028920174},"labels":[],"label_agreement":null},{"id":"W2571941834","doi":"","title":"Generalized dictionary for multitask learning with boosting","year":2016,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Multi-task learning; Artificial intelligence; Computer science; Boosting (machine learning); Machine learning; Gradient boosting; Feature learning; Task (project management)","score_opus":0.09497000881405422,"score_gpt":0.2954169608255133,"score_spread":0.20044695201145907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571941834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021021902,0.00017532364,0.9968458,0.00008602989,0.000043442145,0.000033237327,0.000040367107,0.00023996673,0.0004336921],"genre_scores_gemma":[0.31924137,0.000712058,0.67388576,0.0005289235,0.00034765177,0.0006738243,0.0008205143,0.00026385539,0.003526034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.0007186025,0.00007923998,0.00026564696,0.00036296062,0.00013071891],"domain_scores_gemma":[0.99795234,0.0008001297,0.00015212745,0.0004957275,0.00046706107,0.00013251518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026070026,0.0011913702,0.0022209415,0.0008245616,0.0005513844,0.0010050965,0.002003214,0.0014285783,0.0028426542],"category_scores_gemma":[0.0070199575,0.000554653,0.0011605285,0.0012839528,0.000901041,0.0016166592,0.0023722087,0.002045176,0.0016848393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029878612,0.0002102345,0.0014139833,0.00038689256,0.00027663808,0.00017524823,0.00021055776,0.50505733,0.0069616456,0.08692726,0.016004877,0.3820766],"study_design_scores_gemma":[0.00001683834,0.00003753727,0.00007938368,0.00000795959,0.000009261772,0.00002731556,0.000008207118,0.9660088,0.00058,0.031478453,0.0017387633,0.00000749798],"about_ca_topic_score_codex":0.001683655,"about_ca_topic_score_gemma":0.001913794,"teacher_disagreement_score":0.0028426542,"about_ca_system_score_codex":0.00068104843,"about_ca_system_score_gemma":0.0011976617,"threshold_uncertainty_score":0.013787329},"labels":[],"label_agreement":null},{"id":"W2572845406","doi":"10.1364/oe.25.019444","title":"WINDOW: wideband demodulator for optical waveforms","year":2017,"lang":"en","type":"article","venue":"Optics Express","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Azrieli Foundation; Israel Science Foundation","keywords":"Nyquist rate; Wideband; Demodulation; Computer science; Electronic engineering; Sampling (signal processing); Jitter; Bandwidth (computing); Anti-aliasing filter; Nyquist–Shannon sampling theorem; Oversampling; Channel (broadcasting); Telecommunications; Low-pass filter; Root-raised-cosine filter; Engineering; Detector","score_opus":0.02265986510286894,"score_gpt":0.25644239916922124,"score_spread":0.2337825340663523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572845406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14121561,0.0015944176,0.84879607,0.00021094728,0.00017486043,0.00018615127,0.00016630998,0.0019029957,0.0057527022],"genre_scores_gemma":[0.6864862,0.0009240865,0.30582872,0.0002128953,0.00017499134,0.000117123745,0.00015631094,0.00013956198,0.005960149],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981326,0.000035537752,0.000015762265,0.00004553496,0.000070203285,0.0000197817],"domain_scores_gemma":[0.99973077,0.00006851261,0.00007767339,0.000056165223,0.00004854154,0.00001838182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035984194,0.0003421913,0.00030470916,0.0003669581,0.00023252713,0.0005851486,0.0006136134,0.00040999035,0.0018642545],"category_scores_gemma":[0.0008745289,0.00013988302,0.00014394616,0.00030557901,0.00024355101,0.0007834459,0.0005348978,0.00038853657,0.00075469725],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063446676,0.00008497589,0.001325581,0.0002305146,0.000036223748,0.0002419977,0.00022778024,0.0041887513,0.621678,0.029869331,0.001812856,0.3396696],"study_design_scores_gemma":[0.000093706454,0.0010472485,0.0017963093,0.00009063893,0.00007092667,0.0015621043,0.0000816769,0.14755121,0.79760987,0.0054090014,0.044622675,0.0000646165],"about_ca_topic_score_codex":0.00013443707,"about_ca_topic_score_gemma":0.00019455659,"teacher_disagreement_score":0.0018642545,"about_ca_system_score_codex":0.00020315638,"about_ca_system_score_gemma":0.00022385156,"threshold_uncertainty_score":0.006236553},"labels":[],"label_agreement":null},{"id":"W2576120132","doi":"10.4230/lipics.isaac.2016.57","title":"Scaling and Proximity Properties of Integrally Convex Functions","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Hausdorff Center for Mathematics; Mitsubishi Foundation","keywords":"Integrally closed; Mathematics; Convex analysis; Scaling; Subderivative; Proper convex function; Convex combination; Convex function; Logarithm; Regular polygon; Dimension (graph theory); Convex optimization; Convex set; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.01748297982224099,"score_gpt":0.20273563698842234,"score_spread":0.18525265716618136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576120132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094303064,0.00056717225,0.8900479,0.0007297719,0.00006744175,0.00004964522,0.00013868388,0.000119532,0.013976847],"genre_scores_gemma":[0.8727473,0.0012340341,0.119142815,0.000352315,0.00034510446,0.00020661893,0.00027510058,0.00013260385,0.0055641397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980933,0.00054512045,0.000106939435,0.00045751562,0.00065018795,0.0001468388],"domain_scores_gemma":[0.9915998,0.0054262863,0.0007317185,0.00074537896,0.0010819539,0.00041487737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002209095,0.0006903911,0.00081544096,0.0012354848,0.00072940387,0.0020095482,0.00073012925,0.00077348953,0.002896785],"category_scores_gemma":[0.018352518,0.00037355017,0.00069536996,0.00102559,0.002965443,0.0041899523,0.0023325488,0.00234742,0.0005251652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012748873,0.00006960914,0.0017195083,0.00017962478,0.00003324715,0.00027530504,0.0004345853,0.061864544,0.008775302,0.8816751,0.0016471142,0.04319866],"study_design_scores_gemma":[0.000018785744,0.00015260043,0.0015521145,0.00003828182,0.000014439013,0.0004419006,0.00013538745,0.43434963,0.0046705394,0.5537047,0.004886983,0.00003459784],"about_ca_topic_score_codex":0.0005043581,"about_ca_topic_score_gemma":0.00022482651,"teacher_disagreement_score":0.002896785,"about_ca_system_score_codex":0.0009833393,"about_ca_system_score_gemma":0.00047954672,"threshold_uncertainty_score":0.011682987},"labels":[],"label_agreement":null},{"id":"W2577660281","doi":"10.1109/mmsp.2016.7813392","title":"Robust MRI reconstruction via re-weighted total variation and non-local sparse regression","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Regularization (linguistics); Computer science; Artificial intelligence; Redundancy (engineering); Iterative reconstruction; Compressed sensing; Pattern recognition (psychology); Imaging phantom; Total variation denoising; Image (mathematics); Regression; Computer vision; Similarity (geometry); Algorithm; Mathematics; Statistics","score_opus":0.012885452322922977,"score_gpt":0.19725304017158893,"score_spread":0.18436758784866594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577660281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049701105,0.00011930057,0.9943944,0.00007562269,0.000013700834,0.000009892896,0.000014732558,0.000100450416,0.0003018516],"genre_scores_gemma":[0.25145885,0.0006819211,0.7435016,0.00016184492,0.00011409606,0.00009548751,0.00027772778,0.00017942076,0.0035290932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.00014218704,0.000020149395,0.00008925526,0.00018339648,0.000025788335],"domain_scores_gemma":[0.999393,0.00031214545,0.00011299382,0.0000790992,0.000075131975,0.000027667387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076470396,0.00074609334,0.00079020095,0.0006465772,0.00020432605,0.00053382077,0.0007995996,0.0008979086,0.0007881754],"category_scores_gemma":[0.002585718,0.00037580114,0.0007611688,0.0007193746,0.00061842514,0.00086033856,0.0010021309,0.0010608172,0.00029809598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016656813,0.00008285994,0.00048462464,0.00022974183,0.00010606704,0.0003745873,0.00016090355,0.6672471,0.08261929,0.037839394,0.002597299,0.20809154],"study_design_scores_gemma":[0.000006295786,0.000031854248,0.000084096304,0.000005053415,0.0000064116257,0.00012568789,0.0000065472436,0.9893133,0.0061720754,0.0033524588,0.00088514027,0.000011051915],"about_ca_topic_score_codex":0.0012023264,"about_ca_topic_score_gemma":0.0011150074,"teacher_disagreement_score":0.0012023264,"about_ca_system_score_codex":0.00026051383,"about_ca_system_score_gemma":0.00043834135,"threshold_uncertainty_score":0.004044175},"labels":[],"label_agreement":null},{"id":"W2586457337","doi":"10.1049/iet-rsn.2016.0433","title":"Efficient local optimisation‐based approach for non‐convex and non‐smooth source localisation problems","year":2017,"lang":"en","type":"article","venue":"IET Radar Sonar & Navigation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Regular polygon; Computer science; Mathematical optimization; Mathematics; Geometry","score_opus":0.017302615816680945,"score_gpt":0.23574080965958988,"score_spread":0.21843819384290894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586457337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012821094,0.000085811924,0.99807954,0.000030006355,0.0000073498045,0.000006837417,0.000004126045,0.00007985617,0.00042438056],"genre_scores_gemma":[0.297536,0.0006765424,0.69483364,0.0001552895,0.000118523516,0.00027145483,0.00013924828,0.00026955188,0.005999721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995559,0.00015659476,0.000020649395,0.000064677195,0.00016229776,0.000039949162],"domain_scores_gemma":[0.99916244,0.0005517817,0.000079636004,0.000057580535,0.00012225227,0.000026340074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093288126,0.0009057588,0.0012391336,0.0005847332,0.00029098944,0.0007019934,0.0011753422,0.0012196125,0.0022221592],"category_scores_gemma":[0.0023557462,0.0005830536,0.0009450403,0.0006503459,0.0007835907,0.0009785071,0.0014893912,0.001443309,0.00092265167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008166091,0.000030170457,0.00019475062,0.00021375224,0.000046040837,0.00012037699,0.00014721171,0.9014042,0.012167551,0.012188845,0.0012407049,0.07216483],"study_design_scores_gemma":[0.0000057617904,0.000020100904,0.000034862525,0.00000509725,0.000004070103,0.000022630293,0.0000072098665,0.9969398,0.00082185894,0.0016578109,0.00047518912,0.0000056071462],"about_ca_topic_score_codex":0.0016853712,"about_ca_topic_score_gemma":0.001566727,"teacher_disagreement_score":0.0022221592,"about_ca_system_score_codex":0.00036891497,"about_ca_system_score_gemma":0.00074306846,"threshold_uncertainty_score":0.0074338317},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05629598084733464,"score_gpt":0.1876238132149216,"score_spread":0.13132783236758697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587753047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025236294,0.00079124264,0.97102994,0.0007970139,0.00004474857,0.000023276281,0.00005476804,0.00017867533,0.0018440671],"genre_scores_gemma":[0.69096327,0.0033052543,0.2971858,0.00058241305,0.00034977373,0.00022143422,0.0004446372,0.00026774997,0.0066796853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905187,0.0004634189,0.000046806257,0.00016114092,0.00020591397,0.000070878916],"domain_scores_gemma":[0.9920969,0.0061869803,0.0006099637,0.00045273747,0.0004996963,0.00015360795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031231777,0.0012712526,0.0008192796,0.00074414205,0.0003908637,0.0009307651,0.0010516249,0.0012111386,0.0017357541],"category_scores_gemma":[0.016672574,0.0007179983,0.00049461314,0.00072930625,0.0022590894,0.0030905027,0.002172516,0.0023610564,0.00033156836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012657237,0.000061302606,0.0010868821,0.00015364865,0.00007589075,0.00012862409,0.00016456119,0.7737119,0.006626414,0.17031127,0.0016757722,0.045877125],"study_design_scores_gemma":[0.0000060131956,0.000027561533,0.000109693545,0.000012090935,0.0000046548516,0.000019041767,0.000008126083,0.9518716,0.0007189088,0.0468829,0.00033227538,0.000007162658],"about_ca_topic_score_codex":0.0032257359,"about_ca_topic_score_gemma":0.0036011229,"teacher_disagreement_score":0.0032257359,"about_ca_system_score_codex":0.0007398027,"about_ca_system_score_gemma":0.0007736643,"threshold_uncertainty_score":0.016517162},"labels":[],"label_agreement":null},{"id":"W2594607718","doi":"10.48550/arxiv.1702.08166","title":"Linear Convergence of the Proximal Incremental Aggregated Gradient Method under Quadratic Growth Condition","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Centre de Recherches Mathématiques; National Science Foundation","keywords":"Mathematics; Rate of convergence; Convex function; Convergence (economics); Applied mathematics; Quadratic equation; Lyapunov function; Function (biology); Regular polygon; Linear growth; Quadratic function; Mathematical analysis; Nonlinear system; Computer science","score_opus":0.06799127060950622,"score_gpt":0.21936226848848095,"score_spread":0.15137099787897473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594607718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007315021,0.0002532568,0.99002737,0.00022498847,0.00004453427,0.000029799123,0.000020753127,0.00011688779,0.0019673293],"genre_scores_gemma":[0.5867798,0.0011471711,0.39905548,0.00040483396,0.00025115517,0.00031435725,0.00024029394,0.00029197425,0.011514914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993661,0.0002659192,0.000026827911,0.00008996614,0.00018504517,0.00006621084],"domain_scores_gemma":[0.9981323,0.0011880584,0.00009594878,0.00010675622,0.00040043017,0.00007663739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019880987,0.0011639955,0.0009245948,0.0006196877,0.00036072344,0.00088560785,0.0010383877,0.0011595654,0.0021263347],"category_scores_gemma":[0.00602652,0.00040516147,0.00069216633,0.00049101113,0.0014886318,0.0016448911,0.0020027566,0.0020335529,0.0005298369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022553738,0.00006619585,0.0008696427,0.00039601323,0.00009547505,0.00019736853,0.0003467133,0.78139544,0.010583738,0.123127535,0.0041608373,0.07853558],"study_design_scores_gemma":[0.000005858497,0.00003098282,0.000045027406,0.00000630077,0.0000044115095,0.000021964808,0.000008775611,0.99195075,0.0008824846,0.0066313283,0.0004072341,0.000004796574],"about_ca_topic_score_codex":0.0023868845,"about_ca_topic_score_gemma":0.0014816597,"teacher_disagreement_score":0.0023868845,"about_ca_system_score_codex":0.0006397332,"about_ca_system_score_gemma":0.0010527687,"threshold_uncertainty_score":0.0105142},"labels":[],"label_agreement":null},{"id":"W2596694088","doi":"","title":"A Branch-and-Cut SDP-Based Algorithm for Minimum Sum-of-Squares Clustering","year":2008,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Mathematics; Explained sum of squares; Cluster analysis; Maximum cut; Semidefinite programming; Algorithm; Combinatorics; Centroid; Branch and cut; Set (abstract data type); Equivalence (formal languages); Discrete mathematics; Mathematical optimization; Linear programming; Computer science; Statistics; Graph","score_opus":0.02480595118024036,"score_gpt":0.23880099968106,"score_spread":0.21399504850081963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596694088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021072836,0.00008089842,0.9966348,0.00013812298,0.000020429565,0.00004506606,0.000042460626,0.00015248428,0.00077855104],"genre_scores_gemma":[0.0635167,0.00013136133,0.9336723,0.0001324799,0.00004272873,0.00027456414,0.00030982302,0.00010567044,0.001814318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988569,0.0004646841,0.00005515106,0.00021929512,0.00032419516,0.00007979042],"domain_scores_gemma":[0.9981363,0.0011539548,0.00012403395,0.00012082389,0.00038665268,0.000078215824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018680291,0.0012899099,0.0018286592,0.0010036272,0.00096277555,0.0011398483,0.0016587868,0.0022775754,0.00359007],"category_scores_gemma":[0.004799456,0.0007501277,0.0007842279,0.0016145939,0.0010751294,0.0014993437,0.0018875404,0.0026706324,0.0010823611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016298484,0.00012966827,0.00043352265,0.00015743102,0.00006536243,0.00009258105,0.0001497877,0.7302438,0.0027812326,0.0395352,0.008207798,0.21804059],"study_design_scores_gemma":[0.000017953147,0.000028422737,0.000036875255,0.0000057532884,0.0000036648612,0.000025536432,0.000009530781,0.9875373,0.00050150626,0.010961386,0.0008659873,0.000006027164],"about_ca_topic_score_codex":0.0026769268,"about_ca_topic_score_gemma":0.0036376384,"teacher_disagreement_score":0.00359007,"about_ca_system_score_codex":0.0009354598,"about_ca_system_score_gemma":0.0018942775,"threshold_uncertainty_score":0.012009978},"labels":[],"label_agreement":null},{"id":"W2599839051","doi":"10.1609/aaai.v31i1.10502","title":"Expectile Matrix Factorization for Skewed Data Analysis","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Alberta","funders":"","keywords":"Matrix decomposition; Matrix (chemical analysis); Factorization; Mathematics; Rank (graph theory); Algorithm; Matrix completion; Least-squares function approximation; Mathematical optimization; Computer science; Statistics; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.17737984857863723,"score_gpt":0.3631672490427594,"score_spread":0.18578740046412215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599839051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001341605,0.000092996845,0.9979153,0.00011171057,0.000017556507,0.000018044,0.000055942743,0.00014041424,0.00030642594],"genre_scores_gemma":[0.14721133,0.00072131783,0.84637463,0.00048980495,0.00022940588,0.00038428168,0.0009898419,0.00023713085,0.0033621676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769706,0.00095464604,0.000094637675,0.0003999215,0.00071626285,0.00013743789],"domain_scores_gemma":[0.9935276,0.0036246832,0.00063675834,0.0011059699,0.0009173894,0.00018754166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003354966,0.0014196578,0.0011704648,0.0009859505,0.000738184,0.0011128141,0.0013337675,0.0014072835,0.0035797546],"category_scores_gemma":[0.015155205,0.0005278524,0.00097308605,0.0011333568,0.0014146899,0.0019987891,0.0022982387,0.0029592714,0.0018267245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032324492,0.00015322222,0.0027675673,0.000472176,0.00017998935,0.0005930904,0.00042128278,0.47683775,0.016026616,0.16715929,0.01962274,0.31544307],"study_design_scores_gemma":[0.000014635062,0.000042533895,0.00032381495,0.000027452179,0.000007861311,0.00013217295,0.0000434182,0.9425847,0.0021099185,0.050114684,0.004577116,0.000021764356],"about_ca_topic_score_codex":0.0022688683,"about_ca_topic_score_gemma":0.0034271423,"teacher_disagreement_score":0.0035797546,"about_ca_system_score_codex":0.00064594037,"about_ca_system_score_gemma":0.0013675992,"threshold_uncertainty_score":0.017742991},"labels":[],"label_agreement":null},{"id":"W2604239885","doi":"10.1609/aaai.v31i1.10873","title":"Adaptive Proximal Average Approximation for Composite Convex Minimization","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Zhejiang University; University of Waterloo; National Science Foundation","keywords":"Minification; Convergence (economics); Regular polygon; Proximal Gradient Methods; Mathematical optimization; Lasso (programming language); Algorithm; Computer science; Mathematics; Convex function; Convex optimization; Graph; Combinatorics","score_opus":0.08504970923303085,"score_gpt":0.2885937885056267,"score_spread":0.20354407927259588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604239885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008283444,0.000057907582,0.998645,0.000033312182,0.000014943636,0.000007255397,0.000007636387,0.00009289079,0.00031274706],"genre_scores_gemma":[0.11121028,0.0003396564,0.8840954,0.00014281282,0.00013530765,0.0001637638,0.00013414487,0.00019386104,0.0035848087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.00019420523,0.000027554774,0.00012416374,0.00033785086,0.00005823885],"domain_scores_gemma":[0.9991524,0.00044596408,0.0000804879,0.000099566605,0.00016565048,0.000055800214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011909764,0.0011409927,0.0013706216,0.00072088855,0.000438778,0.0009281934,0.0015345395,0.0013429903,0.002589469],"category_scores_gemma":[0.0026882016,0.00054655905,0.0011909821,0.0009597446,0.00095733535,0.0011710782,0.0017095626,0.0025406713,0.0010125258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013533019,0.0000705766,0.00044318716,0.00026760623,0.00011016788,0.00013408331,0.0001392209,0.7636189,0.010147398,0.060766324,0.00503011,0.15913707],"study_design_scores_gemma":[0.000004580551,0.000016262324,0.000023733206,0.0000032703895,0.0000038244066,0.000018876162,0.0000033224355,0.9947747,0.0007015087,0.0036063099,0.00083948794,0.000004140907],"about_ca_topic_score_codex":0.0018458571,"about_ca_topic_score_gemma":0.0018767312,"teacher_disagreement_score":0.002589469,"about_ca_system_score_codex":0.0004955688,"about_ca_system_score_gemma":0.0013733356,"threshold_uncertainty_score":0.008662641},"labels":[],"label_agreement":null},{"id":"W2604249670","doi":"10.1609/aaai.v31i1.10788","title":"Convex Co-Embedding for Matrix Completion with Predictive Side Information","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Matrix completion; Embedding; Low-rank approximation; Matrix (chemical analysis); Matrix decomposition; Computer science; Matrix norm; Algorithm; Exploit; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.06051471548726226,"score_gpt":0.3195898642032612,"score_spread":0.2590751487159989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604249670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018757812,0.000097028875,0.99718446,0.000102729406,0.000015784066,0.000023865505,0.000040383093,0.00011003917,0.0005498751],"genre_scores_gemma":[0.25228816,0.0009217338,0.7379088,0.00028534397,0.0002498928,0.0005300199,0.0009959221,0.0004145977,0.006405512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984964,0.00064978004,0.00005907753,0.00029691416,0.00040820058,0.00008975798],"domain_scores_gemma":[0.9951213,0.0029771153,0.00038608885,0.0006311922,0.0006782063,0.00020601285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022789065,0.001781864,0.0015630056,0.00080405106,0.0005612786,0.0011283467,0.0016563005,0.0016357913,0.0038364907],"category_scores_gemma":[0.008794292,0.0005951265,0.0010041422,0.0012274921,0.002056202,0.0024799684,0.0022521333,0.0039228755,0.0014090704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015071825,0.00014104722,0.000498992,0.0003411382,0.00007896488,0.00023184756,0.00016401257,0.76463467,0.0060418244,0.1387806,0.0071665794,0.08176968],"study_design_scores_gemma":[0.0000039739625,0.000017410157,0.00003895588,0.000005077029,0.0000026289092,0.00002309121,0.000007284545,0.9810963,0.0005949642,0.017563231,0.0006405047,0.0000065667064],"about_ca_topic_score_codex":0.0029003227,"about_ca_topic_score_gemma":0.0030388476,"teacher_disagreement_score":0.0038364907,"about_ca_system_score_codex":0.00083269854,"about_ca_system_score_gemma":0.0015583801,"threshold_uncertainty_score":0.0128343105},"labels":[],"label_agreement":null},{"id":"W2607211398","doi":"10.24963/ijcai.2017/213","title":"Projection Free Rank-Drop Steps","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rank (graph theory); Mathematical optimization; Iterated function; Computer science; Minification; Norm (philosophy); Algorithm; Mathematics; Combinatorics","score_opus":0.03346144698602161,"score_gpt":0.26263863954996786,"score_spread":0.22917719256394625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607211398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034218677,0.000092316914,0.9928712,0.00016345993,0.00006306728,0.00009383976,0.0000945606,0.00060880027,0.0025908544],"genre_scores_gemma":[0.10413017,0.00022386595,0.8820567,0.00035471178,0.00010283834,0.00038063165,0.00053716643,0.0005811721,0.011632726],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988236,0.00027527104,0.0000728993,0.00017580036,0.0005044474,0.00014802422],"domain_scores_gemma":[0.997849,0.0008734553,0.00015095457,0.0005338093,0.0004626972,0.00013006758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013490019,0.0017235792,0.0012790273,0.0006628522,0.0007818558,0.0015404797,0.001734923,0.0019327668,0.0131758135],"category_scores_gemma":[0.007000307,0.0005588689,0.0009733555,0.0007238714,0.0012247569,0.0015413272,0.0031673457,0.0031661747,0.0061646053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005695028,0.00034190886,0.000990529,0.00067919213,0.00012812976,0.00077803654,0.0003654637,0.32666054,0.042844508,0.18196574,0.034297593,0.41037893],"study_design_scores_gemma":[0.00008923772,0.00014337602,0.00018107877,0.000043071796,0.000018709901,0.00031580802,0.00006561973,0.9156835,0.02522056,0.04302954,0.01516919,0.000040203686],"about_ca_topic_score_codex":0.0012135556,"about_ca_topic_score_gemma":0.0020123606,"teacher_disagreement_score":0.0131758135,"about_ca_system_score_codex":0.0005073504,"about_ca_system_score_gemma":0.001489321,"threshold_uncertainty_score":0.044077516},"labels":[],"label_agreement":null},{"id":"W2608100259","doi":"10.1109/cvpr.2017.436","title":"DOPE: Distributed Optimization for Pairwise Energies","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Submodular set function; Pairwise comparison; Mathematical optimization; Convergence (economics); Consistency (knowledge bases); Constraint (computer-aided design); Context (archaeology); Computer science; Domain (mathematical analysis); Class (philosophy); Relaxation (psychology); Computation; Set (abstract data type); Optimization problem; Local consistency; Algorithm; Mathematics; Theoretical computer science; Constraint satisfaction problem; Artificial intelligence; Probabilistic logic","score_opus":0.020941739530363407,"score_gpt":0.24611045161257947,"score_spread":0.22516871208221606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608100259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010605438,0.000062704254,0.99730945,0.00009323823,0.000026784066,0.000019310319,0.000028709495,0.0001130647,0.0012862417],"genre_scores_gemma":[0.13184518,0.0002976962,0.85854673,0.00026830746,0.00009214664,0.0003385671,0.00026410515,0.00036724377,0.007980037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.00015625637,0.000017728697,0.000101563695,0.00020004009,0.00004128072],"domain_scores_gemma":[0.9993747,0.00032128027,0.00005302624,0.00011473466,0.000091677066,0.00004455214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011545775,0.0012251314,0.0011036178,0.00054505473,0.00042993575,0.0009238348,0.00214318,0.0015319225,0.0056138765],"category_scores_gemma":[0.0028832352,0.0005422118,0.00062576705,0.00074397644,0.0009576064,0.001812118,0.0025279748,0.002078631,0.0012759933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007116013,0.00007786464,0.00023773353,0.00014572302,0.000053332835,0.00008544144,0.00004492664,0.8145591,0.0033253029,0.08706616,0.00562898,0.08870426],"study_design_scores_gemma":[0.0000156392,0.000026963473,0.00002470193,0.0000068485697,0.000003914404,0.00003071187,0.000006862986,0.9704654,0.00066923734,0.026565047,0.0021794338,0.000005307757],"about_ca_topic_score_codex":0.00085923006,"about_ca_topic_score_gemma":0.0014892061,"teacher_disagreement_score":0.0056138765,"about_ca_system_score_codex":0.00063975854,"about_ca_system_score_gemma":0.0011983926,"threshold_uncertainty_score":0.018780231},"labels":[],"label_agreement":null},{"id":"W2608342387","doi":"10.1090/crmp/045/02","title":"0-1 semidefinite programming for graph-cut clustering: Modelling and approximation","year":2008,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Semidefinite programming; Cluster analysis; Semidefinite embedding; Computer science; Mathematical optimization; Combinatorics; Mathematics; Artificial intelligence; Quadratically constrained quadratic program","score_opus":0.031240533585943527,"score_gpt":0.21793808101768175,"score_spread":0.18669754743173822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608342387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019628587,0.00013686054,0.9958034,0.00020407511,0.000016855893,0.000015008965,0.000035171463,0.000056566154,0.0017691776],"genre_scores_gemma":[0.2105974,0.0012166002,0.77743703,0.0003889287,0.00013911353,0.00033912063,0.0005058485,0.00023784213,0.009138139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990878,0.00046285387,0.000030449768,0.00014164583,0.00021856902,0.000058648362],"domain_scores_gemma":[0.99764144,0.0017564935,0.0001672147,0.00014043246,0.0002330399,0.000061305014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020422225,0.0012620173,0.0008914533,0.0005322445,0.00037492946,0.0014628475,0.0015334937,0.0015624854,0.0025927704],"category_scores_gemma":[0.0048260265,0.00055848603,0.0007935279,0.0013023708,0.0014841578,0.0018857438,0.0013200924,0.0033319169,0.0007359472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032214048,0.000060185022,0.00022977803,0.00016229218,0.000022547869,0.000065430926,0.00010306823,0.6859373,0.0011451851,0.27669,0.004635418,0.030916538],"study_design_scores_gemma":[0.000002664717,0.000008820288,0.000019909321,0.000006979425,0.0000015910992,0.000014516423,0.000011104958,0.93770736,0.00018634133,0.06131428,0.0007225252,0.0000040164755],"about_ca_topic_score_codex":0.0020848818,"about_ca_topic_score_gemma":0.0024359215,"teacher_disagreement_score":0.0025927704,"about_ca_system_score_codex":0.0012759671,"about_ca_system_score_gemma":0.0010247906,"threshold_uncertainty_score":0.010800421},"labels":[],"label_agreement":null},{"id":"W2617877636","doi":"10.1016/j.sigpro.2017.05.019","title":"A projection matrix design method for MSE reduction in adaptive compressive sensing","year":2017,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"China Postdoctoral Science Foundation","keywords":"Compressed sensing; Matrix (chemical analysis); Projection (relational algebra); Algorithm; SIGNAL (programming language); Sparse matrix; Mean squared error; Mathematics; Mathematical optimization; Dykstra's projection algorithm; Reduction (mathematics); Signal reconstruction; Optimization problem; Signal processing; Computer science; Statistics","score_opus":0.05996828308211537,"score_gpt":0.33565830647334516,"score_spread":0.2756900233912298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617877636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034836907,0.0000384514,0.9992587,0.000024799396,0.000020303065,0.0000116156525,0.000009404525,0.00004730934,0.00024103417],"genre_scores_gemma":[0.030645575,0.00025437662,0.96648616,0.00007836985,0.00008727885,0.00015546662,0.000078732795,0.000078391,0.0021357173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993704,0.00020240343,0.000028469012,0.00009519248,0.00028191129,0.000021671824],"domain_scores_gemma":[0.99922717,0.0003664902,0.000043666485,0.00009591453,0.0002361646,0.000030513263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080482714,0.0010546544,0.00066830066,0.00039047597,0.00037220755,0.00055289955,0.00068099133,0.00093118515,0.0044819103],"category_scores_gemma":[0.002611353,0.0004430119,0.0006199622,0.00066253764,0.00055375317,0.00087854284,0.0008813458,0.0016169901,0.0013683178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029364938,0.00019221833,0.00028368583,0.0005040298,0.00010984111,0.00014810536,0.00016459097,0.16379325,0.09655831,0.06022968,0.007911966,0.66981065],"study_design_scores_gemma":[0.000038878283,0.00019771476,0.00016077177,0.000025759102,0.000027316306,0.00020882761,0.000018134633,0.96564376,0.015801575,0.010900883,0.0069477754,0.000028650076],"about_ca_topic_score_codex":0.0007609697,"about_ca_topic_score_gemma":0.0011914723,"teacher_disagreement_score":0.0044819103,"about_ca_system_score_codex":0.00019806935,"about_ca_system_score_gemma":0.00069757627,"threshold_uncertainty_score":0.014993489},"labels":[],"label_agreement":null},{"id":"W2618413983","doi":"10.1109/comst.2017.2705027","title":"A Survey on Compressed Sensing in Vehicular Infotainment Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Vehicular ad hoc network; Computer security; Vehicular communication systems; Telecommunications; Wireless; Wireless ad hoc network","score_opus":0.08981420375412028,"score_gpt":0.3164284527333543,"score_spread":0.22661424897923402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618413983","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076913345,0.6420198,0.30591127,0.0031700213,0.0018237387,0.00012413313,0.00049409375,0.00028517627,0.038480375],"genre_scores_gemma":[0.080502145,0.8296279,0.07369616,0.0013787481,0.004726166,0.00015137611,0.0009391115,0.000094733354,0.008883604],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992181,0.00020137611,0.00008728958,0.00013825114,0.0003048973,0.000050021226],"domain_scores_gemma":[0.99842584,0.0011047602,0.00006831579,0.00009078986,0.00028024486,0.000029976802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008052683,0.0009901758,0.00095099997,0.0017168607,0.00039963386,0.0013764178,0.0008516577,0.0013121795,0.0037950291],"category_scores_gemma":[0.0022155726,0.00048586086,0.00072602415,0.004235598,0.00066501525,0.002170653,0.0008520221,0.0013013732,0.0014637684],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010267884,0.00009342855,0.0016275274,0.0062278397,0.00011771603,0.00031685364,0.00026988928,0.030663872,0.004855696,0.06885563,0.030233566,0.8566353],"study_design_scores_gemma":[0.000030142468,0.0005325188,0.0044837426,0.0031508673,0.00022758121,0.0031388302,0.0005799105,0.18157448,0.0074096527,0.08613164,0.7125567,0.00018385428],"about_ca_topic_score_codex":0.0018730162,"about_ca_topic_score_gemma":0.0010915186,"teacher_disagreement_score":0.0037950291,"about_ca_system_score_codex":0.0005595152,"about_ca_system_score_gemma":0.00075710856,"threshold_uncertainty_score":0.0126956105},"labels":[],"label_agreement":null},{"id":"W2618706285","doi":"10.48550/arxiv.1705.10299","title":"Robustness to unknown error in sparse regularization","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; Alfred P. Sloan Foundation","keywords":"Robustness (evolution); Orthonormal basis; Compressed sensing; Bounded function; Quadratic growth; Mathematics; Regularization (linguistics); Quotient; Computer science; Gaussian; A priori and a posteriori; Algorithm; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.08723646856245536,"score_gpt":0.20167290168296564,"score_spread":0.11443643312051029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618706285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04306062,0.0006107618,0.9509092,0.00070889824,0.000050439725,0.000038623057,0.00014085458,0.00024349328,0.004237138],"genre_scores_gemma":[0.92083764,0.0010002694,0.07496816,0.00029604818,0.00015086208,0.00014363408,0.00028464483,0.00020916919,0.002109631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941993,0.002427949,0.00027269893,0.0010438171,0.0016715991,0.00038468634],"domain_scores_gemma":[0.9604653,0.030743478,0.002483307,0.003185145,0.002629255,0.000493411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069981604,0.001516301,0.001189237,0.0013067257,0.00065320457,0.0021424734,0.001405913,0.0014472062,0.0015264286],"category_scores_gemma":[0.053430554,0.0005698014,0.0012865303,0.00089906296,0.005179096,0.0033708678,0.0045562196,0.0030859609,0.00039286356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006032487,0.000069123496,0.0022073358,0.00033277913,0.00018317782,0.0003480516,0.00038435598,0.50006026,0.022141755,0.43333524,0.0014260184,0.03890859],"study_design_scores_gemma":[0.000016679654,0.00010962925,0.00040265167,0.000035302608,0.00001693095,0.000094346564,0.000041161024,0.8770358,0.0071736355,0.11446586,0.000580251,0.000027777809],"about_ca_topic_score_codex":0.0013835497,"about_ca_topic_score_gemma":0.00041359357,"teacher_disagreement_score":0.0069981604,"about_ca_system_score_codex":0.001679857,"about_ca_system_score_gemma":0.0012910235,"threshold_uncertainty_score":0.037010312},"labels":[],"label_agreement":null},{"id":"W2619018971","doi":"10.1080/10556788.2017.1322080","title":"ARC<sub>q</sub>: a new adaptive regularization by cubics","year":2017,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arc (geometry); Corollary; Regularization (linguistics); Convergence (economics); Factorization; Computer science; Algorithm; Key (lock); Mathematics; Discrete mathematics; Geometry; Artificial intelligence","score_opus":0.02612210389689576,"score_gpt":0.29507553039938456,"score_spread":0.26895342650248877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619018971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019338818,0.00009500008,0.99640465,0.00011884006,0.000049163948,0.000020700167,0.00003197829,0.000224443,0.0011213796],"genre_scores_gemma":[0.08159457,0.00026584076,0.91169345,0.00020246272,0.00009086864,0.000099963516,0.00013492702,0.00038057094,0.005537425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927455,0.00014157695,0.00003028625,0.000097657685,0.00038344736,0.00007255428],"domain_scores_gemma":[0.9989889,0.00034768166,0.00008636923,0.00017681014,0.0003119026,0.00008837561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009118401,0.00057487795,0.0005725512,0.00058589777,0.00044871212,0.0008621151,0.001339926,0.0011008673,0.004945169],"category_scores_gemma":[0.00287073,0.00038071207,0.00075603544,0.00097079936,0.0010124868,0.0010466649,0.0018596991,0.00224519,0.0015990012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035235618,0.00011638727,0.0009473364,0.00043087226,0.000087388864,0.00020363642,0.00026842378,0.38168883,0.043546997,0.12501541,0.019211838,0.42813063],"study_design_scores_gemma":[0.000017609227,0.000046931207,0.00007294145,0.000009743657,0.0000058156515,0.000082261016,0.000013945729,0.98156655,0.0035760782,0.007656818,0.006936251,0.000015078497],"about_ca_topic_score_codex":0.0061559817,"about_ca_topic_score_gemma":0.006214006,"teacher_disagreement_score":0.0061559817,"about_ca_system_score_codex":0.0006597118,"about_ca_system_score_gemma":0.0016746464,"threshold_uncertainty_score":0.01654321},"labels":[],"label_agreement":null},{"id":"W2622252888","doi":"10.48550/arxiv.1706.02353","title":"Sparse Wavelet Estimation in Quantile Regression with Multiple Functional Predictors","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantile; Quantile regression; Lasso (programming language); Wavelet; Mathematics; Scalar (mathematics); Regression; Rate of convergence; Computer science; Algorithm; Mathematical optimization; Applied mathematics; Artificial intelligence; Statistics","score_opus":0.06356959375186136,"score_gpt":0.1894163168738516,"score_spread":0.12584672312199024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622252888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010058634,0.00029763894,0.9889234,0.0002399576,0.000018370565,0.0000100434645,0.00003648371,0.000048825998,0.00036665716],"genre_scores_gemma":[0.6107397,0.0023929684,0.38184664,0.0002709444,0.00026277566,0.00013944057,0.00036029253,0.00011904291,0.0038681594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931014,0.00037966768,0.000021855543,0.0001180496,0.00012143006,0.00004895076],"domain_scores_gemma":[0.9981462,0.0013722472,0.00019095377,0.00009945277,0.00014821274,0.00004293979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022607537,0.0006479708,0.0008146787,0.0003782342,0.00019097843,0.0005887824,0.00084521,0.00086778385,0.0011323721],"category_scores_gemma":[0.0060233762,0.00035645717,0.000592046,0.0007258692,0.00078325294,0.00097213354,0.000827238,0.0014530655,0.00021899163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012350109,0.00006745098,0.0027762703,0.00027425273,0.0000932469,0.0003035597,0.00014651328,0.806181,0.007350613,0.08936308,0.0021549165,0.09116559],"study_design_scores_gemma":[0.000004227329,0.000012118289,0.00017267762,0.0000052126325,0.0000056189288,0.000022702581,0.000008612393,0.99172735,0.00040874662,0.007312363,0.00031629758,0.0000040259592],"about_ca_topic_score_codex":0.0018607351,"about_ca_topic_score_gemma":0.0011377985,"teacher_disagreement_score":0.0022607537,"about_ca_system_score_codex":0.00034501648,"about_ca_system_score_gemma":0.00054157834,"threshold_uncertainty_score":0.011956155},"labels":[],"label_agreement":null},{"id":"W2636499139","doi":"10.1287/mnsc.2017.2992","title":"Inverse Optimization: Closed-Form Solutions, Geometry, and Goodness of Fit","year":2018,"lang":"en","type":"preprint","venue":"Management Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Goodness of fit; Inverse; Applied mathematics; Metric (unit); Geometric programming; Inverse problem; Optimization problem; Mathematical analysis; Geometry; Statistics","score_opus":0.03658550155032685,"score_gpt":0.25561195155447636,"score_spread":0.2190264500041495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2636499139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033102855,0.0004913719,0.99395376,0.00050395355,0.000023263563,0.000019985368,0.00004064456,0.000070027876,0.001586742],"genre_scores_gemma":[0.4829835,0.0035075839,0.50674075,0.00061204477,0.0003968269,0.00050061184,0.00054700807,0.00048067782,0.0042309533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629396,0.0020461665,0.00013495972,0.0005302114,0.0008236538,0.00017103089],"domain_scores_gemma":[0.987153,0.010114341,0.00087302347,0.0007383663,0.0009227186,0.00019856624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00564848,0.0020714584,0.0023750633,0.0019448781,0.00069435243,0.0032207342,0.0015041226,0.0033656943,0.002749546],"category_scores_gemma":[0.03321022,0.0009804982,0.0011525331,0.0018970907,0.0048147356,0.0051114275,0.003976243,0.0038001502,0.0005648338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046679415,0.000050278388,0.0006949726,0.00024539948,0.000054509004,0.000102469945,0.00013601383,0.5477222,0.0011711266,0.4130089,0.0028434657,0.033924013],"study_design_scores_gemma":[0.000008284528,0.00004170729,0.00015804892,0.000043795655,0.000008481168,0.00007311729,0.000035953763,0.7382147,0.0004675111,0.2594082,0.0015174411,0.00002274588],"about_ca_topic_score_codex":0.0016947711,"about_ca_topic_score_gemma":0.0011264596,"teacher_disagreement_score":0.00564848,"about_ca_system_score_codex":0.0018093219,"about_ca_system_score_gemma":0.0014474721,"threshold_uncertainty_score":0.029872358},"labels":[],"label_agreement":null},{"id":"W2639424157","doi":"10.1016/j.jfranklin.2017.06.009","title":"A new sensor selection scheme for Bayesian learning based sparse signal recovery in WSNs","year":2017,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Graduate Research and Innovation Projects of Jiangsu Province; Jiangsu University of Science and Technology; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Compressed sensing; Wireless sensor network; Overhead (engineering); Computer science; Selection (genetic algorithm); Estimator; Reduction (mathematics); Bayesian probability; SIGNAL (programming language); Algorithm; Energy (signal processing); Bayesian inference; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Statistics","score_opus":0.02146587888860297,"score_gpt":0.25196157926871504,"score_spread":0.23049570038011208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2639424157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002159407,0.00010452815,0.9970553,0.00006797886,0.00003943954,0.000022844233,0.000019107707,0.00008476322,0.00044659944],"genre_scores_gemma":[0.17005628,0.0004561814,0.82506377,0.00017314314,0.00014075766,0.00014492018,0.00014243998,0.00006745626,0.0037550689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990004,0.00025517785,0.00006235215,0.0001649517,0.00045580434,0.00006140204],"domain_scores_gemma":[0.9992262,0.0002778284,0.00007892709,0.00016109527,0.00021232195,0.000043616248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011800729,0.0006339312,0.0009896717,0.0005785622,0.0005803677,0.0006463141,0.0013359147,0.0008937007,0.0015481815],"category_scores_gemma":[0.0024776445,0.0004016847,0.00053101545,0.0010628403,0.0006157485,0.0012575304,0.0016928577,0.0011082644,0.0005837765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053203723,0.00020223517,0.00073092576,0.00028764803,0.00013329845,0.00020838714,0.00023465643,0.30280253,0.108108625,0.053277012,0.0063781943,0.52710444],"study_design_scores_gemma":[0.000028511206,0.00008419851,0.00018834452,0.000009214327,0.000020266274,0.00013853764,0.000012025888,0.98548514,0.006159155,0.0050274925,0.0028255305,0.000021535843],"about_ca_topic_score_codex":0.0013818016,"about_ca_topic_score_gemma":0.0031549782,"teacher_disagreement_score":0.0015481815,"about_ca_system_score_codex":0.0005505733,"about_ca_system_score_gemma":0.0009102724,"threshold_uncertainty_score":0.0062408447},"labels":[],"label_agreement":null},{"id":"W2714011371","doi":"10.1109/icassp.2017.7952810","title":"Massive device activity detection by approximate message passing","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Fading; False alarm; Message passing; Channel (broadcasting); Detector; Wireless; Path (computing); Algorithm; Activity detection; Real-time computing; Computer network; Artificial intelligence; Telecommunications; Distributed computing","score_opus":0.018598429894279043,"score_gpt":0.24768895209075767,"score_spread":0.22909052219647863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2714011371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010316021,0.000054030304,0.9890187,0.00006591929,0.0000129811315,0.000015271913,0.000017938391,0.00013369773,0.00036548122],"genre_scores_gemma":[0.7093308,0.00026353373,0.28743476,0.00012081389,0.00006226966,0.00012633072,0.00016418501,0.000035225636,0.0024621366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992865,0.0002088302,0.00003105112,0.00012000748,0.00029913487,0.00005451528],"domain_scores_gemma":[0.99827003,0.0010825844,0.00022178421,0.0002057385,0.00017661047,0.000043165826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087811693,0.00060320465,0.0007688272,0.0005003426,0.00027642635,0.000846838,0.00082307745,0.0007212847,0.0005630393],"category_scores_gemma":[0.004536597,0.00029409115,0.00039132056,0.00064040185,0.0008430467,0.001306269,0.0009565559,0.0008749127,0.00019585183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023042517,0.000047898553,0.0010084446,0.000095251555,0.00005517881,0.00012815616,0.00017976259,0.829333,0.01400335,0.040220037,0.00079279277,0.113905646],"study_design_scores_gemma":[0.0000038076103,0.000019753877,0.00007902599,0.0000024540986,0.0000025848267,0.000024066654,0.0000059838117,0.99402535,0.001379635,0.004248074,0.00020542106,0.0000038000433],"about_ca_topic_score_codex":0.0016386324,"about_ca_topic_score_gemma":0.0014024061,"teacher_disagreement_score":0.0016386324,"about_ca_system_score_codex":0.0005419698,"about_ca_system_score_gemma":0.00055987155,"threshold_uncertainty_score":0.0046439767},"labels":[],"label_agreement":null},{"id":"W2739530248","doi":"10.24963/ijcai.2017/256","title":"Storage Fit Learning with Unlabeled Data","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Machine learning; Learning to rank; Graph; Artificial intelligence; Rank (graph theory); Process (computing); Semi-supervised learning; Focus (optics); Supervised learning; Data mining; Ranking (information retrieval); Artificial neural network; Theoretical computer science; Mathematics","score_opus":0.06929871539289738,"score_gpt":0.2775454216354861,"score_spread":0.20824670624258873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739530248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0570329,0.0001915822,0.94031525,0.00024181289,0.00002998831,0.00007165967,0.00010937428,0.0008713848,0.001136084],"genre_scores_gemma":[0.7682577,0.00020883643,0.22768028,0.00027465407,0.00008210286,0.00023990117,0.00054946454,0.00018555264,0.0025216043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990722,0.00031069887,0.00006133821,0.0002791232,0.00020038124,0.00007629472],"domain_scores_gemma":[0.99434173,0.0029477992,0.0004971487,0.0011026539,0.000956695,0.00015394289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018234929,0.00090236624,0.0012618245,0.0007630083,0.00060349045,0.0009336233,0.0019022595,0.0015300289,0.00160495],"category_scores_gemma":[0.010189197,0.0005515894,0.00054588274,0.0008847146,0.0012058859,0.003757316,0.001595581,0.0013402406,0.00055619754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004410755,0.0003668219,0.003282351,0.0002566889,0.00009475794,0.000209978,0.00026232438,0.73762953,0.0089263385,0.013848656,0.0045049633,0.23017645],"study_design_scores_gemma":[0.0000067529577,0.000023768327,0.00012538074,0.000004063498,0.0000037832501,0.000020620113,0.000013156396,0.994726,0.0011021843,0.003784851,0.00018416386,0.0000052535847],"about_ca_topic_score_codex":0.002165655,"about_ca_topic_score_gemma":0.0032048253,"teacher_disagreement_score":0.002165655,"about_ca_system_score_codex":0.0006320698,"about_ca_system_score_gemma":0.00097085896,"threshold_uncertainty_score":0.0096437335},"labels":[],"label_agreement":null},{"id":"W2740247811","doi":"10.1109/cwit.2017.7994828","title":"Optimality of inference in hierarchical coding for distributed object-based representations","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Inference; ENCODE; Theoretical computer science; Artificial intelligence; Pattern recognition (psychology)","score_opus":0.05024145416431939,"score_gpt":0.33987939241451565,"score_spread":0.28963793825019624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740247811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03744108,0.000101034886,0.9604166,0.00032281573,0.00001019987,0.00003908944,0.00013351036,0.00018281153,0.00135293],"genre_scores_gemma":[0.67543525,0.00023750591,0.32113367,0.0002290815,0.000054905886,0.00021758403,0.000621083,0.00013150001,0.0019394365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752575,0.00086510496,0.00015801228,0.0005775074,0.00058307557,0.00029062186],"domain_scores_gemma":[0.98590046,0.011379521,0.0006495187,0.0010207095,0.0008254039,0.0002244805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053961333,0.0005779303,0.0011859428,0.0011213009,0.00061162416,0.0016934243,0.0015633374,0.0013665785,0.0016724038],"category_scores_gemma":[0.025258081,0.00067922764,0.00081563334,0.0013442008,0.0024689962,0.0035762377,0.0022384513,0.0019876522,0.00028169548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015735197,0.000047501926,0.0008293753,0.00010547411,0.000034666955,0.00007139084,0.00017339448,0.71276903,0.0027730525,0.2367879,0.0012486064,0.045002196],"study_design_scores_gemma":[0.00000957515,0.00001286692,0.00011721001,0.0000056608537,0.0000030419187,0.000006785604,0.00000940707,0.9210166,0.0005963313,0.07810414,0.00011385471,0.000004476985],"about_ca_topic_score_codex":0.0076775234,"about_ca_topic_score_gemma":0.0081963595,"teacher_disagreement_score":0.0076775234,"about_ca_system_score_codex":0.003573374,"about_ca_system_score_gemma":0.0027993652,"threshold_uncertainty_score":0.02853781},"labels":[],"label_agreement":null},{"id":"W2741657757","doi":"10.1190/tle36080661.1","title":"Operational deployment of compressive sensing systems for seismic data acquisition","year":2017,"lang":"en","type":"article","venue":"The Leading Edge","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"ConocoPhillips","keywords":"Seismic vibrator; Sampling (signal processing); Data acquisition; Computer science; Azimuth; Node (physics); Data quality; Compressed sensing; Environmental science; Real-time computing; Geology; Telecommunications; Seismology; Engineering; Algorithm","score_opus":0.07861995691987331,"score_gpt":0.3104657702915029,"score_spread":0.2318458133716296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741657757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3690557,0.00019123234,0.61759037,0.0008046745,0.00008696984,0.00022684553,0.00018753715,0.0016451671,0.010211554],"genre_scores_gemma":[0.9323694,0.00003939648,0.0666464,0.000058826223,0.000015176736,0.00005459601,0.000082551036,0.000017848997,0.0007156431],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99926215,0.00021797618,0.000037184473,0.00013327412,0.0002662222,0.000083228166],"domain_scores_gemma":[0.9987809,0.0003649648,0.00016135276,0.00019205791,0.0003814926,0.000119313234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965844,0.00037874098,0.00023299074,0.00033502802,0.0002836596,0.0006049359,0.00060004776,0.0004096567,0.0019192968],"category_scores_gemma":[0.002423994,0.00016639127,0.00010763749,0.0002753177,0.00046522013,0.00076127716,0.001104009,0.00052178674,0.00040931045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012872742,0.0005108765,0.015337152,0.00021993741,0.000064530934,0.00036102888,0.0004356377,0.22832642,0.28136396,0.016435485,0.004751176,0.45090657],"study_design_scores_gemma":[0.00008840573,0.0009248791,0.004487248,0.0000315488,0.000017869783,0.00013293096,0.00020439965,0.92890126,0.053717047,0.0036325299,0.007832511,0.000029346758],"about_ca_topic_score_codex":0.0017695053,"about_ca_topic_score_gemma":0.0019020847,"teacher_disagreement_score":0.0019192968,"about_ca_system_score_codex":0.00051787385,"about_ca_system_score_gemma":0.00068465207,"threshold_uncertainty_score":0.006420672},"labels":[],"label_agreement":null},{"id":"W2746487015","doi":"10.1190/segam2017-17650683.1","title":"Improving streamer data sampling and resolution via nonuniform optimal design and reconstruction","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"","keywords":"Computer science; Sampling (signal processing); Resolution (logic); Algorithm; Artificial intelligence; Detector; Telecommunications","score_opus":0.06879145257642769,"score_gpt":0.2707337481902705,"score_spread":0.20194229561384283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746487015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019084565,0.000051753537,0.9797579,0.000057886744,0.000009027358,0.000020635154,0.00002712052,0.00010706659,0.0008841068],"genre_scores_gemma":[0.27830857,0.00013070305,0.72013533,0.00007783036,0.000021966882,0.000086750966,0.00012089854,0.000055240806,0.0010627735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999408,0.00019562099,0.000039687406,0.0001312542,0.00017908443,0.000046359426],"domain_scores_gemma":[0.9985197,0.000663389,0.00019849298,0.00023209721,0.00033216915,0.000054066808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010834081,0.00054797315,0.00049336295,0.00042988345,0.0002139316,0.0005156008,0.00041878552,0.00042028705,0.0010390749],"category_scores_gemma":[0.0039869654,0.00028058843,0.00031393176,0.0005706335,0.0006323396,0.00095482805,0.0008886356,0.00053950096,0.0002739368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043715764,0.00014612048,0.0043753553,0.00021693553,0.000057473397,0.00010913234,0.00025622515,0.5310213,0.11902714,0.034700852,0.0020461995,0.30760607],"study_design_scores_gemma":[0.000027038428,0.00017149301,0.0005317616,0.000012233894,0.000012601071,0.0000651214,0.000030858573,0.9644019,0.026666537,0.0053283526,0.0027316273,0.000020501482],"about_ca_topic_score_codex":0.0007277591,"about_ca_topic_score_gemma":0.001160045,"teacher_disagreement_score":0.0010834081,"about_ca_system_score_codex":0.00043646104,"about_ca_system_score_gemma":0.0006768391,"threshold_uncertainty_score":0.0057296753},"labels":[],"label_agreement":null},{"id":"W2746773662","doi":"10.1186/s13634-017-0494-8","title":"A novel aliasing-free subband information fusion approach for wideband sparse spectral estimation","year":2017,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matching pursuit; Aliasing; Computer science; Algorithm; Wideband; Binary number; Property (philosophy); Sparse approximation; Compressed sensing; Artificial intelligence; Mathematics; Arithmetic; Electronic engineering","score_opus":0.02434362569265652,"score_gpt":0.28103750281030815,"score_spread":0.2566938771176516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746773662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011745534,0.00012412654,0.9980531,0.000053270924,0.000018374822,0.000008392558,0.000017126058,0.000050573748,0.0005005178],"genre_scores_gemma":[0.11018689,0.00082343206,0.8854267,0.00020496923,0.00015156684,0.00009758659,0.00019609736,0.000056309913,0.0028564672],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950373,0.00010122328,0.000028702038,0.0001059343,0.00022377732,0.00003663237],"domain_scores_gemma":[0.99963677,0.00011435091,0.00006162706,0.000073607065,0.00009228698,0.000021467322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006172798,0.0008179686,0.0009726482,0.00076835847,0.0003659879,0.0007052745,0.00097523053,0.00113441,0.001471088],"category_scores_gemma":[0.0012203337,0.00034013332,0.0009965977,0.0010922935,0.00048521618,0.0017259151,0.0016122406,0.0013607104,0.0007933707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002153673,0.00013107703,0.0006441678,0.0004162471,0.00018086925,0.00029453493,0.00035505285,0.23379517,0.1051059,0.09859412,0.0046358416,0.5556317],"study_design_scores_gemma":[0.000008639174,0.00007799809,0.00017820175,0.000013185988,0.00002484178,0.00019376943,0.00002563279,0.97341466,0.009094858,0.0124128815,0.0045279097,0.000027373484],"about_ca_topic_score_codex":0.00057525944,"about_ca_topic_score_gemma":0.0006613778,"teacher_disagreement_score":0.001471088,"about_ca_system_score_codex":0.00028304692,"about_ca_system_score_gemma":0.00054966594,"threshold_uncertainty_score":0.004921317},"labels":[],"label_agreement":null},{"id":"W2751966825","doi":"","title":"Robust Estimation of Neural Signals in Calcium Imaging","year":2017,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Calcium imaging; Minimax; Pattern recognition (psychology); Estimation; Convergence (economics); Machine learning; Calcium; Mathematics; Mathematical optimization; Chemistry","score_opus":0.04120609839372435,"score_gpt":0.2724019457842065,"score_spread":0.23119584739048216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751966825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042144996,0.00013493096,0.9950819,0.0001469853,0.000009407404,0.00001289461,0.00003148804,0.000101160054,0.00026679842],"genre_scores_gemma":[0.28469643,0.00089990156,0.7111585,0.00023706658,0.00013550586,0.00021150106,0.00042348064,0.00014197343,0.0020956346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.0003733945,0.00005240739,0.0001719077,0.00025648763,0.00005358853],"domain_scores_gemma":[0.99745256,0.0017450546,0.00032535658,0.00022092779,0.00020888155,0.000047150384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022868544,0.0009018755,0.0008482852,0.00066415896,0.00031073045,0.0007929478,0.0009619036,0.0011891548,0.00080292596],"category_scores_gemma":[0.011077247,0.0004929806,0.00066071126,0.0008258912,0.0012646538,0.001632579,0.0014064106,0.0015548829,0.00039937088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013014939,0.00004805999,0.0006367372,0.00020468599,0.00005162835,0.00012166258,0.000084885425,0.82893693,0.020600075,0.050924994,0.0018702259,0.096390024],"study_design_scores_gemma":[0.0000058937503,0.000028323773,0.00018044742,0.000009553572,0.000004433352,0.000036048994,0.00000629364,0.9833708,0.0032824802,0.012460934,0.0006049246,0.000009953927],"about_ca_topic_score_codex":0.0016910367,"about_ca_topic_score_gemma":0.0015117811,"teacher_disagreement_score":0.0022868544,"about_ca_system_score_codex":0.00066413486,"about_ca_system_score_gemma":0.00097071927,"threshold_uncertainty_score":0.0120942},"labels":[],"label_agreement":null},{"id":"W2753791741","doi":"10.1109/ita.2017.8023482","title":"On the fundamental limits of massive connectivity","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Channel (broadcasting); Base station; Coherence (philosophical gambling strategy); Coherence time; Identification (biology); Transmission (telecommunications); Telecommunications link; Upper and lower bounds; Compressed sensing; Interval (graph theory); Phase (matter); Real-time computing; Computer network; Electronic engineering; Telecommunications; Algorithm; Engineering; Physics","score_opus":0.0406523164402643,"score_gpt":0.26292869362410104,"score_spread":0.22227637718383675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753791741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13100852,0.008759784,0.7201343,0.021821557,0.0004636679,0.00008203009,0.0005119909,0.00035275135,0.11686536],"genre_scores_gemma":[0.96496135,0.004056169,0.026325608,0.0010013022,0.00066794676,0.00016791355,0.00012680786,0.00006644369,0.0026263818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979519,0.00072604854,0.000049965227,0.0002892313,0.0007388824,0.00024395516],"domain_scores_gemma":[0.9820086,0.015124535,0.00058949814,0.0013339242,0.00059012056,0.00035333596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024623042,0.0005702594,0.0008956929,0.00095910975,0.0012204197,0.0027195727,0.0013081097,0.0020859076,0.0039147865],"category_scores_gemma":[0.019116027,0.0005665111,0.00040033486,0.00093238056,0.0050524278,0.007503859,0.0030926734,0.0035194294,0.000420372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006961889,0.000027216489,0.00036014666,0.00009863333,0.000014677435,0.00012540603,0.00014428161,0.044084255,0.0012348877,0.9402886,0.002229512,0.011322709],"study_design_scores_gemma":[0.000018904144,0.000040573537,0.0003512752,0.000058512986,0.0000079639185,0.00021408612,0.0000915611,0.13022763,0.00061737234,0.8646952,0.0036573708,0.000019500545],"about_ca_topic_score_codex":0.00071471464,"about_ca_topic_score_gemma":0.0005007006,"teacher_disagreement_score":0.0039147865,"about_ca_system_score_codex":0.0013475739,"about_ca_system_score_gemma":0.0005725908,"threshold_uncertainty_score":0.013096213},"labels":[],"label_agreement":null},{"id":"W2755606614","doi":"10.1109/embc.2017.8036951","title":"Performance of compressive sensing for the reconstruction of different QRS pulses in ECG signals","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canada Research Chairs","keywords":"QRS complex; Beat (acoustics); Compression ratio; Pattern recognition (psychology); Computer science; Artificial intelligence; Physics; Acoustics; Cardiology; Medicine","score_opus":0.027901618003333142,"score_gpt":0.2512614275596557,"score_spread":0.22335980955632256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755606614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.262177,0.0012303287,0.7324271,0.00040211098,0.000044621127,0.000058325768,0.00007593365,0.00031081663,0.0032737504],"genre_scores_gemma":[0.87914455,0.00067502994,0.11926655,0.00006466363,0.000037071415,0.0000337393,0.00013489429,0.00002526142,0.0006182112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994299,0.00022102358,0.000023217266,0.00006048906,0.00021433928,0.00005095414],"domain_scores_gemma":[0.99645656,0.002895653,0.0001688566,0.00015783869,0.00025553524,0.00006546397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618641,0.0007578618,0.00037454578,0.0003032887,0.0002040628,0.00035613193,0.00030510302,0.0007121796,0.0005758088],"category_scores_gemma":[0.0062287613,0.00017356896,0.00019410539,0.0003357324,0.00061569863,0.00058944244,0.00048191173,0.0004043951,0.0001321595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016020002,0.00016664187,0.0022177265,0.00035064254,0.00010759208,0.00016546401,0.00018831817,0.6758237,0.13559888,0.009282371,0.0007522719,0.17374443],"study_design_scores_gemma":[0.000014011964,0.0002869892,0.0005720218,0.000009877168,0.000009298965,0.000075703116,0.000016968419,0.9766516,0.02121352,0.0009422083,0.00019256376,0.00001522296],"about_ca_topic_score_codex":0.0015004262,"about_ca_topic_score_gemma":0.0014179791,"teacher_disagreement_score":0.0015004262,"about_ca_system_score_codex":0.00024727106,"about_ca_system_score_gemma":0.00036858683,"threshold_uncertainty_score":0.006144583},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0211540683367614,"score_gpt":0.25889890688657935,"score_spread":0.23774483854981796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758000438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037281564,0.00019973089,0.99533206,0.000062898056,0.000039792452,0.000023427336,0.00001751973,0.00018352701,0.00041282276],"genre_scores_gemma":[0.13413781,0.0005923701,0.86082447,0.00020838396,0.00015389232,0.00023524193,0.00020384348,0.00016865827,0.003475434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918526,0.00018982767,0.000061029463,0.000107972155,0.00039444285,0.00006148449],"domain_scores_gemma":[0.998887,0.0005105575,0.00012264357,0.00013280433,0.00030624087,0.000040677693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322452,0.00073825865,0.0012319819,0.00093852996,0.00054445217,0.0007243034,0.0014481678,0.0013409479,0.0015075756],"category_scores_gemma":[0.0032987094,0.00041862004,0.0007635112,0.00088694465,0.00058450113,0.0013121227,0.00089900265,0.0016209757,0.0005197424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024232222,0.000114913026,0.0011792539,0.00023555045,0.0001680976,0.00024269967,0.00017224597,0.38788638,0.019547772,0.026044719,0.0053964183,0.55876964],"study_design_scores_gemma":[0.000018604913,0.000037792888,0.00020567901,0.000013679118,0.000018559367,0.00006120659,0.000007580776,0.9906703,0.0025266837,0.004182462,0.002246461,0.000010889845],"about_ca_topic_score_codex":0.0016800419,"about_ca_topic_score_gemma":0.0023867073,"teacher_disagreement_score":0.0017322452,"about_ca_system_score_codex":0.0003540458,"about_ca_system_score_gemma":0.0008157989,"threshold_uncertainty_score":0.009161115},"labels":[],"label_agreement":null},{"id":"W2758633371","doi":"10.1109/iscas.2017.8050535","title":"Two-pass ℓp-regularized least-squares algorithm for compressive sensing","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canada Research Chairs","keywords":"Compressed sensing; Regularization (linguistics); Algorithm; Signal reconstruction; Function (biology); Mathematical optimization; Reconstruction algorithm; Mathematics; Computer science; SIGNAL (programming language); Iterative reconstruction; Signal processing; Artificial intelligence; Telecommunications","score_opus":0.022859450588113523,"score_gpt":0.2764794985219358,"score_spread":0.2536200479338223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758633371","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020648674,0.00006814159,0.99713445,0.00005168429,0.00001616046,0.000017751605,0.000016812397,0.00018826594,0.00044195904],"genre_scores_gemma":[0.0581843,0.0002220622,0.9374092,0.00008500001,0.000043194384,0.00015402072,0.00017225122,0.000073826755,0.0036561503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955803,0.000109586224,0.000021154878,0.00006987521,0.0002133588,0.000027922602],"domain_scores_gemma":[0.9994804,0.00021240716,0.00007314306,0.00007455488,0.00013942362,0.000020060013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067881186,0.000744545,0.0007651278,0.00041650023,0.00029136892,0.00061494386,0.0008890697,0.0011261683,0.001503315],"category_scores_gemma":[0.0015571587,0.00042756175,0.00055669877,0.0005358865,0.00050968747,0.0006790328,0.0007162099,0.0011480952,0.0009447613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030500398,0.00013758702,0.0007420094,0.0002832598,0.00012573137,0.00018685959,0.00021756136,0.45322093,0.06201021,0.039446674,0.00669484,0.43662933],"study_design_scores_gemma":[0.000011139528,0.00007677681,0.0001356022,0.0000069697685,0.000008055949,0.000084430656,0.000007151183,0.9871492,0.0074323644,0.0018203217,0.0032518434,0.000016082002],"about_ca_topic_score_codex":0.0012735807,"about_ca_topic_score_gemma":0.0016442861,"teacher_disagreement_score":0.001503315,"about_ca_system_score_codex":0.00038112365,"about_ca_system_score_gemma":0.00095736916,"threshold_uncertainty_score":0.0050290823},"labels":[],"label_agreement":null},{"id":"W2759481519","doi":"10.1016/j.laa.2018.03.031","title":"On the error of a priori sampling: Zero forcing sets and propagation time","year":2018,"lang":"en","type":"preprint","venue":"Linear Algebra and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Zero (linguistics); Adjacency matrix; Algebraic number; Propagation of uncertainty; Colored; Discrete mathematics; Graph; Algorithm; Mathematical analysis","score_opus":0.03215067452838113,"score_gpt":0.2734594082190159,"score_spread":0.24130873369063474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759481519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01036953,0.0008377755,0.9830988,0.0014687027,0.00023035047,0.000017306678,0.00012214096,0.00008471026,0.0037707826],"genre_scores_gemma":[0.5957551,0.006595206,0.3689221,0.0014678111,0.0015932431,0.00024716943,0.0008172759,0.0006482512,0.023953794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970197,0.001238379,0.00015834352,0.00047649269,0.000948438,0.00015867184],"domain_scores_gemma":[0.9663409,0.026712801,0.001749691,0.002265666,0.0022325022,0.00069846184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008861286,0.0018746182,0.0014722856,0.002123915,0.0008096139,0.0030186581,0.0023646296,0.003722032,0.0033853226],"category_scores_gemma":[0.046346813,0.000891125,0.0008422141,0.0019125439,0.007875928,0.007548591,0.004760655,0.0056242193,0.00058871956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002200563,0.00007155528,0.00053328794,0.00021360627,0.00005631499,0.00009833411,0.00020586679,0.18129967,0.002484766,0.78685164,0.0031174226,0.0248475],"study_design_scores_gemma":[0.000012777401,0.000028238515,0.00019121509,0.00007374418,0.00001647421,0.000056021257,0.000039678678,0.6264118,0.0012404685,0.37049323,0.0013972443,0.00003916251],"about_ca_topic_score_codex":0.0028706957,"about_ca_topic_score_gemma":0.00213969,"teacher_disagreement_score":0.008861286,"about_ca_system_score_codex":0.0015981087,"about_ca_system_score_gemma":0.0020095464,"threshold_uncertainty_score":0.046863556},"labels":[],"label_agreement":null},{"id":"W2765442055","doi":"10.1088/1742-6596/904/1/012015","title":"A low-rank approach to off-the-grid sparse deconvolution","year":2017,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Nautical Research Society","funders":"","keywords":"Deconvolution; Mathematics; Dimension (graph theory); Solver; Convex optimization; Algorithm; Rank (graph theory); Blind deconvolution; Measure (data warehouse); Mathematical optimization; Regular polygon; Combinatorics; Computer science","score_opus":0.03489179683849968,"score_gpt":0.24648250838754185,"score_spread":0.21159071154904216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765442055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022892558,0.00010312901,0.9948572,0.00013475415,0.000032368116,0.000015844496,0.00003871449,0.00021475962,0.0023140353],"genre_scores_gemma":[0.11819336,0.00058299897,0.8641856,0.00026437995,0.00015934142,0.00011081174,0.0002810989,0.00031686513,0.01590549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993901,0.00017286414,0.00002140904,0.00007967755,0.00027185414,0.0000639479],"domain_scores_gemma":[0.99914277,0.00036138814,0.00006652525,0.00017694212,0.00019287577,0.000059496862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001008911,0.000702247,0.0008851624,0.0006911386,0.00052344205,0.0014711686,0.001190097,0.0014021873,0.0060577253],"category_scores_gemma":[0.0031893812,0.00034809433,0.00068011315,0.00084505294,0.0011213254,0.0015852223,0.0019955044,0.0020362602,0.0021388237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002450449,0.00012508826,0.0004885425,0.00031409692,0.000059076978,0.00017940644,0.00024874246,0.529009,0.016793646,0.20321073,0.0074068466,0.24191983],"study_design_scores_gemma":[0.000012018605,0.000033951426,0.00006442044,0.000015134171,0.0000045309384,0.000055896584,0.0000193933,0.96930647,0.0024104458,0.023081494,0.0049829795,0.000013335088],"about_ca_topic_score_codex":0.0025211952,"about_ca_topic_score_gemma":0.0038821378,"teacher_disagreement_score":0.0060577253,"about_ca_system_score_codex":0.0006612287,"about_ca_system_score_gemma":0.0013048241,"threshold_uncertainty_score":0.020265162},"labels":[],"label_agreement":null},{"id":"W2766370222","doi":"10.1109/tsp.2017.8076034","title":"Compressive Sensing using S-transform in Pulse Radar","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Radar; Pulse-Doppler radar; Nyquist rate; Algorithm; Nyquist–Shannon sampling theorem; Pulse repetition frequency; Range (aeronautics); Artificial intelligence; Radar imaging; Computer vision; Engineering; Sampling (signal processing); Telecommunications; Filter (signal processing)","score_opus":0.030813814070604552,"score_gpt":0.27139802049397893,"score_spread":0.24058420642337439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766370222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01270262,0.0010550009,0.9832661,0.00024575353,0.00006154277,0.000023044538,0.000031680196,0.00017626793,0.0024379422],"genre_scores_gemma":[0.3643588,0.0029188918,0.62953085,0.0002699244,0.00020583448,0.00008171009,0.00015149316,0.00004439824,0.002438092],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959034,0.00013237595,0.000016659153,0.000054998407,0.00018766963,0.00001798102],"domain_scores_gemma":[0.9995055,0.00031242482,0.00004930096,0.000049332284,0.00006869257,0.000014639028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043720083,0.00037576177,0.00034176148,0.00037634413,0.00016953373,0.0004579744,0.00036372078,0.0006816608,0.00077191344],"category_scores_gemma":[0.0015652991,0.00017298888,0.00026854326,0.0007368869,0.0007656588,0.0007780074,0.000504316,0.00075622526,0.00032574654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036511215,0.00012462815,0.0013506801,0.00045386388,0.00006694349,0.00036536745,0.0002123019,0.24060017,0.13437937,0.103969775,0.0031387259,0.51497304],"study_design_scores_gemma":[0.000020842896,0.00021482023,0.0006373675,0.000038418297,0.000013036634,0.00039174408,0.000034040815,0.9441934,0.030917164,0.0172193,0.006289959,0.00002990223],"about_ca_topic_score_codex":0.00070994435,"about_ca_topic_score_gemma":0.0006961315,"teacher_disagreement_score":0.00077191344,"about_ca_system_score_codex":0.00022592436,"about_ca_system_score_gemma":0.00036409963,"threshold_uncertainty_score":0.0025823116},"labels":[],"label_agreement":null},{"id":"W2767642227","doi":"10.1007/s11228-021-00603-2","title":"On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals","year":2021,"lang":"en","type":"preprint","venue":"Set-Valued and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Oak Ridge National Laboratory; Advanced Scientific Computing Research; Office of Science; UT-Battelle; Battelle; Division of Mathematical Sciences; U.S. Department of Energy","keywords":"Convergence (economics); Computation; Norm (philosophy); Relaxation (psychology); Set (abstract data type); Regular polygon; Mathematical optimization; Algorithm; Mathematics; Sparse approximation; Inverse; Computer science; Applied mathematics","score_opus":0.03225607835430253,"score_gpt":0.2567377612541529,"score_spread":0.22448168289985035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767642227","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011920496,0.00065621035,0.9814038,0.0008807084,0.00012044481,0.00005651098,0.00008533708,0.000063875035,0.004812677],"genre_scores_gemma":[0.46799383,0.0035228604,0.50240564,0.0012069446,0.00071987516,0.00056981336,0.00070064946,0.0006291351,0.022251243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968156,0.001971867,0.0001143199,0.00028610093,0.0006765892,0.0001355228],"domain_scores_gemma":[0.9683049,0.027098544,0.0007947344,0.00086340687,0.0020901891,0.0008482633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013225068,0.0024858934,0.0019097715,0.0019336959,0.0009510665,0.0022021008,0.0022556665,0.003068976,0.0035548324],"category_scores_gemma":[0.04217623,0.0014279732,0.0017789835,0.001346556,0.0068948045,0.0055134925,0.006818344,0.0066096983,0.0005464988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044773726,0.0001324101,0.00093310315,0.00050902605,0.00017964804,0.00024872893,0.00059817726,0.2694821,0.009798185,0.6803719,0.0040552416,0.03324372],"study_design_scores_gemma":[0.000018993622,0.00005841744,0.0001424322,0.0000465593,0.000015067076,0.00006390399,0.00005359858,0.8355219,0.0010855637,0.16211623,0.0008577241,0.000019542718],"about_ca_topic_score_codex":0.00399839,"about_ca_topic_score_gemma":0.0025831773,"teacher_disagreement_score":0.013225068,"about_ca_system_score_codex":0.0015493644,"about_ca_system_score_gemma":0.0018146081,"threshold_uncertainty_score":0.06994164},"labels":[],"label_agreement":null},{"id":"W2768140828","doi":"10.1007/s10107-017-1209-5","title":"Robust multicategory support vector machines using difference convex algorithm","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Information and Intelligent Systems; National Science Foundation; National Institutes of Health; National Cancer Institute; Division of Mathematical Sciences; National Institute of General Medical Sciences","keywords":"Support vector machine; Outlier; Mathematics; Hinge loss; Consistency (knowledge bases); Algorithm; Generalization; Binary classification; Convex optimization; Mathematical optimization; Robustness (evolution); Artificial intelligence; Regular polygon; Machine learning; Computer science","score_opus":0.06823648029563915,"score_gpt":0.28592084729032474,"score_spread":0.21768436699468557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768140828","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005208254,0.0001173942,0.99399996,0.000089755275,0.000024695039,0.000013451168,0.000026251706,0.00015412469,0.00036610145],"genre_scores_gemma":[0.37961623,0.00022504998,0.6163678,0.00017644491,0.00012233948,0.00018266361,0.00040849362,0.00021925726,0.0026818423],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978435,0.000706561,0.00013395243,0.00044573317,0.0007306657,0.000139502],"domain_scores_gemma":[0.99528897,0.002582968,0.00042816205,0.0006087076,0.00097077515,0.00012035416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022081356,0.0009285538,0.0024422004,0.0009064042,0.00046380612,0.0017424154,0.0023785334,0.001459271,0.0019051752],"category_scores_gemma":[0.009981053,0.00075215026,0.0010039213,0.0014154905,0.0010992446,0.0022464038,0.0025423768,0.0023580033,0.0006843047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053845404,0.0001621799,0.0013717674,0.00035336427,0.00022585053,0.00011489227,0.00012653176,0.4224332,0.011159555,0.06954772,0.005324883,0.4886416],"study_design_scores_gemma":[0.00000525157,0.000026899927,0.00010533746,0.000004925106,0.0000062158083,0.000025634306,0.000007194596,0.98695755,0.0009885225,0.0114653725,0.0003986942,0.000008395371],"about_ca_topic_score_codex":0.0013712589,"about_ca_topic_score_gemma":0.0013142745,"teacher_disagreement_score":0.0024422004,"about_ca_system_score_codex":0.00070235675,"about_ca_system_score_gemma":0.0012129431,"threshold_uncertainty_score":0.011677861},"labels":[],"label_agreement":null},{"id":"W2768739050","doi":"10.1093/imaiai/iay019","title":"Near-optimal sample complexity for convex tensor completion","year":2018,"lang":"en","type":"preprint","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tensor (intrinsic definition); Minimax; Combinatorics; Matrix norm; Rank (graph theory); Norm (philosophy); Matrix completion; Regular polygon; Low-rank approximation; Mathematical optimization; Pure mathematics; Physics; Geometry","score_opus":0.049308365212291816,"score_gpt":0.28183863281078586,"score_spread":0.23253026759849404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768739050","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034329433,0.00052328536,0.9608089,0.0012491957,0.000061406194,0.000069285015,0.00029809817,0.00057312706,0.0020872678],"genre_scores_gemma":[0.54170394,0.0005177882,0.4509336,0.00048051082,0.00023184609,0.00025815878,0.0012171419,0.00049929944,0.0041576973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959204,0.0019173931,0.00020026106,0.0007349235,0.0009003664,0.00032650607],"domain_scores_gemma":[0.9739379,0.020347012,0.0012103126,0.002511021,0.0014059475,0.0005877244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051655523,0.001482724,0.0018688828,0.0007051139,0.0006689197,0.0019162428,0.0019649775,0.0017480346,0.003962801],"category_scores_gemma":[0.029826509,0.00075190404,0.00077996746,0.0011440193,0.002594152,0.0043124473,0.0024313233,0.0031055566,0.0007883447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001067238,0.00019183711,0.0016406265,0.00046450226,0.00012088139,0.00021934116,0.00019999524,0.8309928,0.007490658,0.09003337,0.0056376536,0.061941095],"study_design_scores_gemma":[0.000014824818,0.00004381584,0.00014825053,0.000009285784,0.00000515248,0.000027008162,0.000017945682,0.96842635,0.0011291931,0.0298378,0.00033182692,0.000008501568],"about_ca_topic_score_codex":0.004242481,"about_ca_topic_score_gemma":0.005022215,"teacher_disagreement_score":0.0051655523,"about_ca_system_score_codex":0.0021732026,"about_ca_system_score_gemma":0.0025977867,"threshold_uncertainty_score":0.027318358},"labels":[],"label_agreement":null},{"id":"W2769009861","doi":"10.1007/s10898-017-0590-1","title":"Low-rank matrix completion using nuclear norm minimization and facial reduction","year":2017,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix completion; Mathematics; Mathematical optimization; Semidefinite programming; Low-rank approximation; Matrix norm; Norm (philosophy); Rank (graph theory); Embedding; Minification; Matrix (chemical analysis); Linear programming; Algorithm; Computer science; Artificial intelligence; Combinatorics","score_opus":0.016098218260028923,"score_gpt":0.26614184618651243,"score_spread":0.2500436279264835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769009861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00391498,0.000055088287,0.9947083,0.00012006459,0.000023999068,0.000020077363,0.000053122934,0.00013714095,0.0009671643],"genre_scores_gemma":[0.12353359,0.00030402545,0.86811113,0.000119778066,0.00008611548,0.00012018128,0.0004355464,0.00019262712,0.0070969337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944323,0.00015024349,0.000018612913,0.000093644325,0.0002473841,0.000046883622],"domain_scores_gemma":[0.99935144,0.00024858187,0.00006183209,0.00014016361,0.00015794557,0.00004002923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006484054,0.0008557588,0.0008790026,0.000523731,0.00036089373,0.0008577372,0.00091315346,0.000953118,0.0036930707],"category_scores_gemma":[0.0024268113,0.0003709207,0.00081250246,0.00061861024,0.0010299295,0.0011280333,0.0013551047,0.0018299705,0.001340759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003378271,0.00024475742,0.00058800436,0.00031520377,0.00009296086,0.00017663228,0.0002687104,0.35241923,0.06064099,0.096937336,0.0135468235,0.47443154],"study_design_scores_gemma":[0.000013267908,0.00006212133,0.00015737899,0.000008939481,0.00001018441,0.00010059478,0.000043096596,0.97473323,0.0077136015,0.014501129,0.0026423659,0.000014124801],"about_ca_topic_score_codex":0.0022835536,"about_ca_topic_score_gemma":0.003995789,"teacher_disagreement_score":0.0036930707,"about_ca_system_score_codex":0.00030578533,"about_ca_system_score_gemma":0.0011640105,"threshold_uncertainty_score":0.012354553},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"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","score_opus":0.05182652129691619,"score_gpt":0.2948478148856421,"score_spread":0.2430212935887259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770113520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010818075,0.000052537773,0.9871553,0.00015303683,0.000015348223,0.000015042078,0.000062493884,0.00031745853,0.0014107445],"genre_scores_gemma":[0.1532189,0.0001805181,0.84346527,0.00012751146,0.00004080104,0.00004241411,0.00029137227,0.00011224143,0.0025209435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997683,0.00003758105,0.000008042979,0.000050542716,0.00011537258,0.000020261452],"domain_scores_gemma":[0.9996414,0.00009040761,0.000051595496,0.000112977716,0.00007558508,0.000028002643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004024931,0.00053668494,0.00033342018,0.00030387827,0.00022515921,0.00056272733,0.00059708435,0.0007402608,0.0017513369],"category_scores_gemma":[0.0010901308,0.00030428008,0.00034972554,0.00033100837,0.00059926964,0.0011131449,0.0011905682,0.0012289241,0.00081856706],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024704137,0.00013953295,0.0013353307,0.0002087122,0.00007206527,0.0002022557,0.00017536561,0.44494182,0.20579353,0.034724317,0.005277567,0.30688247],"study_design_scores_gemma":[0.000012420908,0.000025995212,0.0002727107,0.00000878449,0.0000063868133,0.00011292667,0.000012606095,0.96382076,0.029661113,0.003388508,0.002664385,0.0000133667],"about_ca_topic_score_codex":0.0014432913,"about_ca_topic_score_gemma":0.0026726376,"teacher_disagreement_score":0.0017513369,"about_ca_system_score_codex":0.0002928109,"about_ca_system_score_gemma":0.00069542695,"threshold_uncertainty_score":0.005858779},"labels":[],"label_agreement":null},{"id":"W2770340319","doi":"10.1109/lsp.2018.2801836","title":"Feedback Acquisition and Reconstruction of Spectrum-Sparse Signals by Predictive Level Comparisons","year":2018,"lang":"en","type":"preprint","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Iran National Science Foundation; Sharif University of Technology","keywords":"Algorithm; Sliding window protocol; Compressed sensing; Computer science; Sign (mathematics); Signal reconstruction; Encoding (memory); SIGNAL (programming language); Binary number; Scheme (mathematics); Sequence (biology); Window (computing); Mathematics; Artificial intelligence; Signal processing; Telecommunications","score_opus":0.02852711670992096,"score_gpt":0.240023447183673,"score_spread":0.21149633047375205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770340319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02368247,0.00009878353,0.9747342,0.00008237874,0.000026965923,0.00003410883,0.00003217171,0.00033223483,0.0009767446],"genre_scores_gemma":[0.5540747,0.00012300808,0.44323206,0.00012687249,0.000054596636,0.00007277257,0.00013296097,0.000072099116,0.0021109933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994849,0.00009847889,0.000027059157,0.00009822415,0.00024731326,0.0000440235],"domain_scores_gemma":[0.99882823,0.0004908314,0.0001578367,0.00025983367,0.00022423065,0.00003897087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071682513,0.00043899828,0.0005108217,0.0003781819,0.00035848038,0.0006768465,0.0011134932,0.00064396206,0.0018549442],"category_scores_gemma":[0.0035924006,0.0002882781,0.00026211035,0.00047632333,0.00063419616,0.0015454884,0.0010244075,0.00084623264,0.00035547538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083025196,0.00020429016,0.0018190863,0.00017747124,0.000046059213,0.00023199276,0.00030998947,0.35496047,0.09525359,0.038787838,0.002781245,0.5045978],"study_design_scores_gemma":[0.000013946823,0.000090286725,0.00016489929,0.0000067692704,0.000007586749,0.00005368123,0.00001226643,0.9776748,0.017702581,0.0035354095,0.00072899123,0.000008682786],"about_ca_topic_score_codex":0.0010595472,"about_ca_topic_score_gemma":0.0018261637,"teacher_disagreement_score":0.0018549442,"about_ca_system_score_codex":0.0003568893,"about_ca_system_score_gemma":0.0006838477,"threshold_uncertainty_score":0.0062054396},"labels":[],"label_agreement":null},{"id":"W2770590313","doi":"10.1007/s11277-017-5056-8","title":"Link State Routing Based on Compressed Sensing","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Routing table; Network packet; Overhead (engineering); Node (physics); Static routing; Routing (electronic design automation); Link-state routing protocol; Distance-vector routing protocol; Routing protocol; Destination-Sequenced Distance Vector routing; Distributed computing","score_opus":0.04789928507914449,"score_gpt":0.2867679655104028,"score_spread":0.2388686804312583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770590313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015883408,0.0003597102,0.97833997,0.00064768124,0.00018074397,0.00006993433,0.00013491538,0.00040580067,0.003977754],"genre_scores_gemma":[0.7578584,0.0007847035,0.23486441,0.00031144914,0.0002885527,0.0001840485,0.000402951,0.00007657956,0.005228893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935585,0.00017134771,0.000026096914,0.00010535608,0.00027048867,0.00007090089],"domain_scores_gemma":[0.9976248,0.0015702032,0.0001978647,0.000250254,0.0002834822,0.00007337518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060707645,0.00068227464,0.000986161,0.00091387326,0.00067913736,0.0011433221,0.0010577918,0.00089126296,0.0019961428],"category_scores_gemma":[0.004227707,0.00037715922,0.0003702768,0.0012984711,0.0008765074,0.0017552577,0.0012766613,0.0013141292,0.00030650917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022810609,0.00013861193,0.00042281608,0.00010611267,0.000054638953,0.00008904236,0.00013783551,0.7990649,0.008956529,0.05456391,0.006193224,0.13004422],"study_design_scores_gemma":[0.0000064168426,0.000019191091,0.000036011515,0.0000030975068,0.000004941755,0.000014627043,0.000008391069,0.993404,0.00046860744,0.00576967,0.00025941944,0.000005663178],"about_ca_topic_score_codex":0.004192683,"about_ca_topic_score_gemma":0.008322977,"teacher_disagreement_score":0.004192683,"about_ca_system_score_codex":0.0008907931,"about_ca_system_score_gemma":0.0011803557,"threshold_uncertainty_score":0.008336544},"labels":[],"label_agreement":null},{"id":"W2771375885","doi":"10.1016/j.patcog.2017.11.025","title":"Atlas-based reconstruction of high performance brain MR data","year":2017,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fonds de recherche du Québec – Nature et technologies; National Natural Science Foundation of China","keywords":"Computer science; Atlas (anatomy); Prior probability; Regularization (linguistics); Artificial intelligence; Redundancy (engineering); Pattern recognition (psychology); Computer vision; Compressed sensing; Iterative reconstruction; Bayesian probability","score_opus":0.0575449526263376,"score_gpt":0.2589975659622039,"score_spread":0.2014526133358663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771375885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040406562,0.00026577603,0.9563678,0.00031148733,0.000050554103,0.000023061122,0.00044926823,0.0005875298,0.0015379054],"genre_scores_gemma":[0.6820671,0.0012143983,0.30990925,0.00022645999,0.00011535996,0.000074535565,0.0016716731,0.0002786527,0.0044425614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999775,0.000070630645,0.000010790876,0.000029986808,0.0000887434,0.000024749937],"domain_scores_gemma":[0.99946564,0.0002091413,0.00006829699,0.00011397894,0.000102338956,0.00004061731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045147975,0.00049466145,0.00048310158,0.0006610558,0.00017672627,0.0008773918,0.00056561927,0.0006692966,0.0013602478],"category_scores_gemma":[0.0025868397,0.0003106401,0.00039004794,0.0010706455,0.00047598657,0.00077305443,0.00081631134,0.00094070623,0.0008375887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074399327,0.00010334048,0.0030891409,0.0003297866,0.0001425711,0.00064029585,0.0002395451,0.6641349,0.08700713,0.029452808,0.0071363235,0.20698006],"study_design_scores_gemma":[0.000011963154,0.000066854795,0.0010108284,0.000010884622,0.000020245365,0.00040673208,0.000039934494,0.9662266,0.01971625,0.010130124,0.002338537,0.00002105281],"about_ca_topic_score_codex":0.0014102061,"about_ca_topic_score_gemma":0.0026071735,"teacher_disagreement_score":0.0014102061,"about_ca_system_score_codex":0.00023588624,"about_ca_system_score_gemma":0.0009144869,"threshold_uncertainty_score":0.004550457},"labels":[],"label_agreement":null},{"id":"W2771920568","doi":"10.1109/icrc.2017.8123653","title":"Generating Sparse Representations Using Quantum Annealing: Comparison to Classical Algorithms","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Qubit; Maxima and minima; Simulated annealing; Quadratic unconstrained binary optimization; Algorithm; Wave function; Quantum; Computer science; Quantum computer; Mathematics; Artificial intelligence; Quantum mechanics; Physics","score_opus":0.11520832694537193,"score_gpt":0.363526196525562,"score_spread":0.2483178695801901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771920568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06967386,0.0006844001,0.9173663,0.0008385145,0.0001290395,0.00011546669,0.00010820384,0.0026383484,0.008445916],"genre_scores_gemma":[0.5365978,0.0003499208,0.45894992,0.00049225125,0.000097706004,0.00023532822,0.00037924838,0.00032680796,0.002571086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938107,0.000212218,0.000024785928,0.00008844572,0.00023877088,0.0000547686],"domain_scores_gemma":[0.99802303,0.0011519189,0.00008239317,0.00042339164,0.0002452177,0.00007402896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470798,0.00052389904,0.00073235715,0.00040408684,0.00043157744,0.00076654437,0.0016924025,0.0012363171,0.003946977],"category_scores_gemma":[0.0041100057,0.00032407755,0.00054802274,0.00054961775,0.00084345933,0.0015522423,0.0010607874,0.001270487,0.0007479884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002743852,0.00021073224,0.0006735083,0.00017100465,0.00007715976,0.000060183505,0.00007872303,0.7851117,0.004855551,0.033714313,0.003463845,0.17130879],"study_design_scores_gemma":[0.000019757608,0.000020295009,0.00004342168,0.0000025782233,0.0000032383907,0.0000080260315,0.000005600952,0.99418074,0.00054709404,0.004850908,0.0003157246,0.000002487838],"about_ca_topic_score_codex":0.0030248885,"about_ca_topic_score_gemma":0.003664149,"teacher_disagreement_score":0.003946977,"about_ca_system_score_codex":0.0006501916,"about_ca_system_score_gemma":0.00087423314,"threshold_uncertainty_score":0.013203979},"labels":[],"label_agreement":null},{"id":"W2772226559","doi":"10.1109/jstars.2017.2775567","title":"Sparse Hyperspectral Unmixing via Heuristic $\\ell _p$ -Norm Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Norm (philosophy); Heuristic; Computer science; Compressed sensing; Combinatorics; Algorithm; Mathematics; Artificial intelligence; Philosophy","score_opus":0.03056353078921072,"score_gpt":0.23221541792481779,"score_spread":0.20165188713560706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772226559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014520863,0.00007760044,0.9974126,0.000070472495,0.000014334542,0.000017150149,0.000019016226,0.00018065353,0.00075606164],"genre_scores_gemma":[0.057677466,0.00031911326,0.93772715,0.00020487643,0.00008028808,0.00015988068,0.00030948396,0.0001993894,0.00332229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992373,0.00021039612,0.000032109965,0.00015194218,0.00031025332,0.0000579574],"domain_scores_gemma":[0.99946505,0.0002302669,0.000064511405,0.00006816005,0.00014067239,0.000031383224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011689067,0.0013460456,0.0010289963,0.0009446227,0.00053347566,0.0010548286,0.0018131775,0.0014387374,0.0029124082],"category_scores_gemma":[0.0022038082,0.000580553,0.001083014,0.0012127241,0.0010500042,0.001962134,0.0017616273,0.0019443376,0.0013408803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016803382,0.000119181546,0.00042352936,0.000275471,0.00011250797,0.00011742113,0.00017567891,0.62419736,0.0189892,0.04217205,0.0046408526,0.30860874],"study_design_scores_gemma":[0.000006582427,0.000016985461,0.000046610407,0.000006507756,0.000006400585,0.000025128415,0.0000125529805,0.99032027,0.0028034728,0.005325953,0.0014202574,0.000009192008],"about_ca_topic_score_codex":0.0029594754,"about_ca_topic_score_gemma":0.0038117913,"teacher_disagreement_score":0.0029594754,"about_ca_system_score_codex":0.0006726281,"about_ca_system_score_gemma":0.0012291407,"threshold_uncertainty_score":0.009742975},"labels":[],"label_agreement":null},{"id":"W2772732314","doi":"10.1016/j.neunet.2017.11.015","title":"Manifold optimization-based analysis dictionary learning with an<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml16\" display=\"inline\" overflow=\"scroll\" altimg=\"si7.gif\"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>∕</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>-norm regularizer","year":2017,"lang":"lv","type":"article","venue":"Neural Networks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Pearl River S and T Nova Program of Guangzhou; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Dictionary learning; Algorithm; Compressed sensing; K-SVD; Norm (philosophy); Manifold (fluid mechanics); Artificial intelligence; Minification; Sparse approximation","score_opus":0.0143136511395196,"score_gpt":0.22753476495374494,"score_spread":0.21322111381422534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772732314","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016399642,0.00008686424,0.99496573,0.00019800598,0.00005900831,0.000028517388,0.0001883498,0.00082128984,0.0020121527],"genre_scores_gemma":[0.053881157,0.00031985054,0.934207,0.0002210442,0.00012610342,0.00014442904,0.0013345497,0.000602769,0.00916322],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994326,0.00017608699,0.000032075837,0.00011745124,0.00020218012,0.000039554885],"domain_scores_gemma":[0.99922466,0.00025338924,0.000050579154,0.00020724304,0.00021593481,0.000048080998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080336025,0.00073243777,0.0006717431,0.0006893809,0.00036295425,0.00087160734,0.0010097366,0.00092325365,0.009447381],"category_scores_gemma":[0.003456157,0.00036261237,0.0006872192,0.0011353105,0.000622666,0.0012081884,0.001954864,0.0018075161,0.005602976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031317826,0.00014385379,0.00068312365,0.00030539732,0.00010930426,0.00017083254,0.00020627436,0.19961426,0.021671183,0.11374248,0.069517575,0.59352267],"study_design_scores_gemma":[0.000020246684,0.000054991277,0.00013940186,0.000020406433,0.000010997678,0.000100164085,0.000026073827,0.9546494,0.0062593636,0.021017974,0.017683838,0.000017193233],"about_ca_topic_score_codex":0.0027314266,"about_ca_topic_score_gemma":0.0049265623,"teacher_disagreement_score":0.009447381,"about_ca_system_score_codex":0.00039643663,"about_ca_system_score_gemma":0.0011524716,"threshold_uncertainty_score":0.031604588},"labels":[],"label_agreement":null},{"id":"W2773854377","doi":"10.1109/globalsip.2017.8309173","title":"A fast Bayesian algorithmic enhancement for real time bit error ratio test (BERT)","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"A priori and a posteriori; Reduction (mathematics); Computer science; Bit error rate; Algorithm; Bit (key); Bayesian probability; Regular polygon; Space (punctuation); Mathematics; Artificial intelligence","score_opus":0.016047827696684055,"score_gpt":0.26084912702019997,"score_spread":0.2448012993235159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773854377","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018464085,0.00015593707,0.9955686,0.00017970409,0.00003818845,0.000049846232,0.00005413498,0.00044477463,0.0016623882],"genre_scores_gemma":[0.11389688,0.0004766856,0.8796583,0.00042656332,0.00017465185,0.00022258738,0.0005194333,0.00017450233,0.0044504865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721366,0.00094427104,0.00009112887,0.0002665492,0.0013380478,0.00014624478],"domain_scores_gemma":[0.99594504,0.002115167,0.00029303756,0.00047561247,0.001003994,0.0001672347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020609049,0.0010671604,0.0009782931,0.0010714214,0.00044989513,0.0009714133,0.0014387313,0.0011234002,0.004952996],"category_scores_gemma":[0.010933052,0.00053262536,0.00062038563,0.000984474,0.0009448423,0.0016723879,0.0024775972,0.0019527939,0.0027549919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081049715,0.00028051747,0.0019111878,0.00033201932,0.00009926385,0.00032331145,0.00019672619,0.16406642,0.0401539,0.12570919,0.012476689,0.65364033],"study_design_scores_gemma":[0.000034688885,0.00015322775,0.0005224779,0.000033775555,0.000020935611,0.00049835304,0.000024341314,0.9609622,0.008404111,0.02137434,0.007927155,0.000044343946],"about_ca_topic_score_codex":0.0023691028,"about_ca_topic_score_gemma":0.0043791025,"teacher_disagreement_score":0.004952996,"about_ca_system_score_codex":0.0006404912,"about_ca_system_score_gemma":0.0018323428,"threshold_uncertainty_score":0.016569436},"labels":[],"label_agreement":null},{"id":"W2779968414","doi":"10.1109/globalsip.2017.8309025","title":"A theory of generalized proximity for ADMM","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Theoretical computer science","score_opus":0.041763682306350365,"score_gpt":0.2738300300705743,"score_spread":0.23206634776422397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779968414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071288185,0.0005397808,0.99429435,0.00033953285,0.00010173277,0.000018858123,0.0000284807,0.000048569807,0.0039158524],"genre_scores_gemma":[0.13696657,0.0041074394,0.8419906,0.0015196578,0.0014658542,0.000438475,0.00026596594,0.0002209705,0.013024448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690706,0.0014010556,0.00017286124,0.000530331,0.0008912721,0.00009729743],"domain_scores_gemma":[0.9970692,0.0017205912,0.0002718339,0.00040883938,0.00040424816,0.00012535613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037869215,0.0012423717,0.0013384841,0.001509512,0.0010334157,0.0025186446,0.0016374564,0.0023435995,0.00510626],"category_scores_gemma":[0.010282738,0.00065801636,0.0014622952,0.0017335403,0.0037160746,0.0040144096,0.004467534,0.0053844065,0.0013979032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001596753,0.000012723992,0.00010522843,0.00015377915,0.000035514746,0.000070113565,0.00012700867,0.027247366,0.00063589663,0.94730765,0.0020793525,0.02220945],"study_design_scores_gemma":[0.000019388775,0.000111747744,0.00010482113,0.00008092321,0.000025932433,0.00031604225,0.00004893705,0.17346175,0.00075438403,0.7990359,0.026013363,0.00002685306],"about_ca_topic_score_codex":0.00063952105,"about_ca_topic_score_gemma":0.0005142895,"teacher_disagreement_score":0.00510626,"about_ca_system_score_codex":0.000966437,"about_ca_system_score_gemma":0.0009666188,"threshold_uncertainty_score":0.020027399},"labels":[],"label_agreement":null},{"id":"W2784331297","doi":"10.1109/tsp.2018.2795540","title":"Sparse Activity Detection for Massive Connectivity","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":389,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fading; Computer science; Channel (broadcasting); Base station; False alarm; Algorithm; Compressed sensing; Wireless; Signature (topology); Mathematics; Telecommunications; Artificial intelligence","score_opus":0.027961805528940026,"score_gpt":0.25902858534250167,"score_spread":0.23106677981356163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784331297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019283673,0.00016460069,0.97914004,0.00021322923,0.000024140558,0.000023830726,0.000044966502,0.0001466676,0.000958829],"genre_scores_gemma":[0.8454943,0.00048404763,0.15134132,0.00017251287,0.00012134196,0.000101507874,0.00021152447,0.000039093888,0.002034405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995252,0.00015550373,0.000013569454,0.00008900784,0.00016617819,0.00005052214],"domain_scores_gemma":[0.9978744,0.0014995917,0.00022922308,0.00018025811,0.00015572138,0.000060798684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006092187,0.000498008,0.0005054291,0.0005296506,0.00024129974,0.0006256057,0.0006320441,0.0007135189,0.0007983225],"category_scores_gemma":[0.0054251933,0.00027332685,0.00028505066,0.0006858275,0.00082257885,0.0011318771,0.0009145601,0.0007947175,0.00018947445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014691766,0.000051408937,0.0014826221,0.000098592776,0.00003865385,0.00027524165,0.00012082767,0.8373162,0.009059177,0.045569684,0.0013828924,0.10445778],"study_design_scores_gemma":[0.0000054573534,0.000027259615,0.00025649605,0.0000042154834,0.0000035424443,0.00006191614,0.00001238638,0.9878342,0.00077881775,0.010587155,0.00042428373,0.0000042208176],"about_ca_topic_score_codex":0.0014737549,"about_ca_topic_score_gemma":0.0014301975,"teacher_disagreement_score":0.0014737549,"about_ca_system_score_codex":0.00048613234,"about_ca_system_score_gemma":0.0004738439,"threshold_uncertainty_score":0.0035271645},"labels":[],"label_agreement":null},{"id":"W2787899424","doi":"10.1137/17m1136225","title":"Learning Theory of Randomized Sparse Kaczmarz Method","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Mathematics; Bregman divergence; Compressed sensing; Convergence (economics); Convexity; Thresholding; Sequence (biology); Generalization; Combinatorics; Function (biology); Applied mathematics; Algorithm; Discrete mathematics; Mathematical analysis; Artificial intelligence; Computer science; Image (mathematics)","score_opus":0.018312166251398275,"score_gpt":0.29598742234672093,"score_spread":0.2776752560953227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787899424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045901323,0.00025298595,0.9922202,0.00039151814,0.000037047925,0.00003876891,0.00004655127,0.00009810765,0.0023246345],"genre_scores_gemma":[0.50478894,0.0013753944,0.47560513,0.000852053,0.00035413392,0.0007516424,0.00037606477,0.00022442687,0.015672244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984548,0.0006090075,0.000054641605,0.00024754566,0.00050084153,0.00013313166],"domain_scores_gemma":[0.9971578,0.0017706701,0.00026776583,0.00025846768,0.00045701623,0.000088171895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029212227,0.0007363026,0.0010187222,0.0010050385,0.0005326924,0.0012865455,0.001718577,0.0016230729,0.003812246],"category_scores_gemma":[0.009001527,0.00049304846,0.00073637033,0.00069187966,0.002036179,0.0022205748,0.0018183802,0.0021057925,0.000861597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008895881,0.000044762626,0.0004074646,0.00015405308,0.000038757746,0.00007302467,0.00006547212,0.38823745,0.002097105,0.57439977,0.002165678,0.032227527],"study_design_scores_gemma":[0.000014497438,0.00002055932,0.000060180657,0.000010176767,0.0000040925456,0.000022555028,0.0000059401777,0.94479316,0.00044056555,0.053750094,0.00086975674,0.000008443275],"about_ca_topic_score_codex":0.0019310694,"about_ca_topic_score_gemma":0.0014620717,"teacher_disagreement_score":0.003812246,"about_ca_system_score_codex":0.0014580659,"about_ca_system_score_gemma":0.0018957765,"threshold_uncertainty_score":0.015449107},"labels":[],"label_agreement":null},{"id":"W2788193492","doi":"10.1007/s13534-018-0057-4","title":"Increasing the quality of reconstructed signal in compressive sensing utilizing Kronecker technique","year":2018,"lang":"en","type":"article","venue":"Biomedical Engineering Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Mutual coherence; Kronecker product; Kronecker delta; Algorithm; Computer science; Signal reconstruction; Dimension (graph theory); Projection (relational algebra); Coherence (philosophical gambling strategy); SIGNAL (programming language); Matrix (chemical analysis); Computation; Basis (linear algebra); Signal processing; Reconstruction algorithm; Pattern recognition (psychology); Iterative reconstruction; Artificial intelligence; Mathematics; Digital signal processing","score_opus":0.01869927732432641,"score_gpt":0.24907960567906395,"score_spread":0.23038032835473754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788193492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08254626,0.0005425788,0.91259176,0.0004341017,0.000096608645,0.00002590074,0.00006166394,0.0002088638,0.003492216],"genre_scores_gemma":[0.64058465,0.0012162906,0.3548043,0.00021735871,0.00010779757,0.000027464941,0.00013199198,0.00006376157,0.002846301],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993376,0.00021931656,0.000037359147,0.00007091786,0.00029795634,0.000036781177],"domain_scores_gemma":[0.99760395,0.0012191447,0.00021843097,0.0003266179,0.000549985,0.000081787824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011563072,0.00053917733,0.00034608383,0.0004047818,0.00016466585,0.0005642809,0.00032082453,0.0007382808,0.0015766728],"category_scores_gemma":[0.004913298,0.0002203831,0.00023009129,0.000490314,0.0006722961,0.0013251272,0.0008377889,0.00073970936,0.00030284375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010549554,0.00022145768,0.0029398664,0.00057855295,0.00010783714,0.00038836835,0.00034427716,0.16937475,0.42210037,0.056353234,0.002400676,0.34413564],"study_design_scores_gemma":[0.000038214766,0.0004416662,0.0017844205,0.00005917747,0.000042262796,0.0005625638,0.00009464996,0.8902352,0.09309611,0.011570055,0.0020209474,0.000054850287],"about_ca_topic_score_codex":0.00037463557,"about_ca_topic_score_gemma":0.00063017017,"teacher_disagreement_score":0.0015766728,"about_ca_system_score_codex":0.0001615261,"about_ca_system_score_gemma":0.00034761743,"threshold_uncertainty_score":0.006115198},"labels":[],"label_agreement":null},{"id":"W2788739123","doi":"10.48550/arxiv.1802.06967","title":"Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Booth University College","funders":"","keywords":"Minimax; Iterated function; Rate of convergence; Rank (graph theory); Computer science; Thresholding; Convergence (economics); Convex function; Word error rate; Algorithm; Gradient descent; Function (biology); Column (typography); Set (abstract data type); Applied mathematics; Mathematical optimization; Task (project management); Regular polygon; Mathematics; Image (mathematics); Artificial intelligence; Combinatorics; Artificial neural network","score_opus":0.03300666322999803,"score_gpt":0.17588242102319554,"score_spread":0.1428757577931975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788739123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009327023,0.0001175597,0.9894198,0.00029117844,0.000017108938,0.000018660807,0.00004965236,0.0000771474,0.0006818543],"genre_scores_gemma":[0.4326308,0.000621663,0.55960673,0.00032623703,0.0002341901,0.0001651882,0.00055461907,0.00015508408,0.0057054213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992023,0.0002658863,0.000034170625,0.00017588565,0.00025849472,0.00006328774],"domain_scores_gemma":[0.99667585,0.0021287887,0.00042365806,0.0003236064,0.00033025813,0.00011771943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018208799,0.001211022,0.001168039,0.00087705866,0.0004261043,0.0010613222,0.0011082366,0.001534891,0.0011711256],"category_scores_gemma":[0.008727359,0.0007197044,0.0006648752,0.0011581536,0.001870303,0.0016375266,0.0017257944,0.0014698362,0.00041367285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105619714,0.00007235824,0.0006750868,0.00017703397,0.00007324127,0.00028783394,0.00013666331,0.9083759,0.012823212,0.028977307,0.0018591109,0.046436615],"study_design_scores_gemma":[0.000007482405,0.00002146858,0.00009750631,0.0000043016544,0.0000043375435,0.000044260963,0.000010834292,0.9900793,0.0015763097,0.0077481167,0.0003998599,0.000006349211],"about_ca_topic_score_codex":0.0029915585,"about_ca_topic_score_gemma":0.0024627915,"teacher_disagreement_score":0.0029915585,"about_ca_system_score_codex":0.0005001108,"about_ca_system_score_gemma":0.001046155,"threshold_uncertainty_score":0.009629846},"labels":[],"label_agreement":null},{"id":"W2788799302","doi":"10.1109/globalsip.2017.8309162","title":"A new weighted ℓ&lt;inf&gt;p&lt;/inf&gt;-norm for sparse hyperspectral unmixing","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Norm (philosophy); Algorithm; Computer science; Mathematics; Combinatorics; Philosophy","score_opus":0.0226862597405886,"score_gpt":0.24920551922608475,"score_spread":0.22651925948549614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788799302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00065193395,0.000117604504,0.99850416,0.00009345601,0.00003647191,0.000015555144,0.000038321807,0.00007291645,0.00046962462],"genre_scores_gemma":[0.02963047,0.0006782603,0.96411043,0.0003282318,0.000226314,0.00022862693,0.0006095009,0.00034882728,0.0038394067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973368,0.00079809944,0.00015599145,0.00053702085,0.0010508402,0.000121185185],"domain_scores_gemma":[0.99825174,0.00057124457,0.00014169191,0.0001985389,0.0007155963,0.00012112296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003532279,0.0022046473,0.001479477,0.001451176,0.00064977905,0.0018518268,0.0032283126,0.0024320243,0.003349879],"category_scores_gemma":[0.0061247693,0.00080400123,0.001601617,0.001805357,0.0017702811,0.005313148,0.003555586,0.0040380163,0.0018750947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003727474,0.0002494523,0.0009602963,0.00083894725,0.00022915131,0.00021697904,0.0002441718,0.40022087,0.044210255,0.14047597,0.012941298,0.39903986],"study_design_scores_gemma":[0.000011789879,0.000057493464,0.00011625136,0.000031558484,0.000017415457,0.000095509095,0.000021783548,0.9703306,0.006954584,0.016294437,0.006039548,0.000029068771],"about_ca_topic_score_codex":0.0016830941,"about_ca_topic_score_gemma":0.0016552048,"teacher_disagreement_score":0.003532279,"about_ca_system_score_codex":0.0010357216,"about_ca_system_score_gemma":0.0017239567,"threshold_uncertainty_score":0.018680692},"labels":[],"label_agreement":null},{"id":"W2788976390","doi":"10.1287/moor.2021.1129","title":"Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Matching (statistics); Approximation algorithm; Constant (computer programming); Set (abstract data type); Variance (accounting); Optimal design; Sampling (signal processing); Combinatorics; Mathematical optimization; Algorithm; Applied mathematics; Statistics; Computer science","score_opus":0.22246836699537323,"score_gpt":0.38686376411829076,"score_spread":0.16439539712291754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788976390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002736141,0.000385245,0.9944265,0.00019140996,0.000035063524,0.000041726264,0.00002745237,0.00012484324,0.0020314725],"genre_scores_gemma":[0.28271028,0.0011487288,0.71042985,0.00046869493,0.00022747109,0.0005921425,0.00028394378,0.0002230712,0.003915811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610776,0.001979956,0.0001631148,0.0004663178,0.0010353964,0.00024751763],"domain_scores_gemma":[0.98479164,0.012425541,0.00074745744,0.0010445582,0.00072472106,0.0002660403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053331563,0.0023160062,0.0018610955,0.0015325813,0.0006431393,0.0018390416,0.0016074796,0.0019809862,0.0033970047],"category_scores_gemma":[0.02867828,0.0010615876,0.0011004516,0.0017839218,0.0024250953,0.00302161,0.0027813665,0.0028961748,0.00075945305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019566216,0.00011369006,0.00065322244,0.00025266435,0.00008102174,0.00006844625,0.00010929807,0.75004804,0.0016604784,0.17440984,0.002410492,0.06999712],"study_design_scores_gemma":[0.000025559206,0.000047017522,0.000052941978,0.000024434486,0.000008474085,0.000028486422,0.000010990403,0.9224225,0.00050277537,0.07596937,0.00089926244,0.0000082387505],"about_ca_topic_score_codex":0.0024626323,"about_ca_topic_score_gemma":0.0017817594,"teacher_disagreement_score":0.0053331563,"about_ca_system_score_codex":0.0019505213,"about_ca_system_score_gemma":0.001853032,"threshold_uncertainty_score":0.02820474},"labels":[],"label_agreement":null},{"id":"W2790032758","doi":"10.1137/18m1173629","title":"Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Imaging Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua","funders":"Engineering and Physical Sciences Research Council","keywords":"Bayesian probability; Uncertainty quantification; Computer science; Inverse problem; Bayesian inference; Convex optimization; Artificial intelligence; Algorithm; Mathematical optimization; Machine learning; Mathematics; Regular polygon","score_opus":0.021335211758195857,"score_gpt":0.2621108739035189,"score_spread":0.24077566214532303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790032758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037068766,0.000083459825,0.9989722,0.00010511274,0.0000074923823,0.000011758487,0.000021609105,0.000065295004,0.0003624699],"genre_scores_gemma":[0.09163868,0.0007673908,0.9040217,0.0002861337,0.00017303077,0.00032104092,0.00033037094,0.00032560033,0.0021360866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752,0.0009213113,0.000106495354,0.0003298482,0.0010000835,0.00012219023],"domain_scores_gemma":[0.99568474,0.0030084925,0.00037145583,0.00032567568,0.00046398316,0.00014557868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033534453,0.0015379912,0.0016954246,0.0012172445,0.0007262639,0.0023670269,0.0019092796,0.0017450267,0.002697424],"category_scores_gemma":[0.011800225,0.000992809,0.0015130694,0.0012825595,0.0022330722,0.002824624,0.0044656615,0.0033584263,0.00082126696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047819558,0.000035049958,0.00029220432,0.00020928239,0.00008437511,0.0000923232,0.0001125356,0.80697334,0.0035154386,0.109312706,0.0031966623,0.07612822],"study_design_scores_gemma":[0.000005568941,0.000009811741,0.000063322695,0.000017216562,0.0000070465785,0.000023994573,0.000007979765,0.952414,0.00068449,0.04525698,0.0014974086,0.0000121541425],"about_ca_topic_score_codex":0.003904065,"about_ca_topic_score_gemma":0.0037050066,"teacher_disagreement_score":0.003904065,"about_ca_system_score_codex":0.0013835516,"about_ca_system_score_gemma":0.0021941043,"threshold_uncertainty_score":0.017734945},"labels":[],"label_agreement":null},{"id":"W2792285932","doi":"10.1137/18m1177019","title":"Large-Scale and Global Maximization of the Distance to Instability","year":2018,"lang":"en","type":"preprint","venue":"SIAM Journal on Matrix Analysis and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"École Polytechnique Fédérale de Lausanne; York University","keywords":"Subspace topology; Linear subspace; Instability; Maximization; Matrix (chemical analysis); Convergence (economics); Dimension (graph theory); Mathematical optimization; Rate of convergence; Mathematics; Scale (ratio); Computer science; Applied mathematics; Mathematical analysis; Physics; Key (lock); Combinatorics; Pure mathematics","score_opus":0.008253515633085217,"score_gpt":0.26758897461548176,"score_spread":0.2593354589823965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792285932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054781258,0.0001661785,0.9398754,0.00037947908,0.000020712465,0.000030100122,0.00004492906,0.000084964035,0.004617021],"genre_scores_gemma":[0.8699923,0.0002522349,0.12450134,0.00009273975,0.000050580853,0.00013299643,0.000115280294,0.000111521214,0.004750902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995043,0.00018796655,0.00002172632,0.00012330829,0.00011637532,0.00004626941],"domain_scores_gemma":[0.99708074,0.0018434236,0.00034698664,0.00015745856,0.00038565928,0.00018568711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014001802,0.00070906803,0.00057125743,0.00038909612,0.000320528,0.0009437779,0.00058520463,0.0008506747,0.0015516593],"category_scores_gemma":[0.008055131,0.00028635896,0.00039849008,0.0002715968,0.0011052792,0.0011846845,0.0017756739,0.0011277099,0.0002978883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011853039,0.000036190086,0.00088903646,0.00013208098,0.000035638084,0.00012444834,0.0001320082,0.88789743,0.019435892,0.068806164,0.0012442206,0.021148441],"study_design_scores_gemma":[0.0000039132074,0.00003709736,0.00020915271,0.000008719528,0.0000031461263,0.000030810686,0.000021036547,0.9820347,0.0032107527,0.014076496,0.00035521374,0.000009111149],"about_ca_topic_score_codex":0.0006554452,"about_ca_topic_score_gemma":0.00065236806,"teacher_disagreement_score":0.0015516593,"about_ca_system_score_codex":0.0006159695,"about_ca_system_score_gemma":0.0006964742,"threshold_uncertainty_score":0.007404983},"labels":[],"label_agreement":null},{"id":"W2792680995","doi":"10.1109/globalsip.2017.8309143","title":"Joint-sparse dictionary learning: Denoising multiple measurement vectors","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Noise reduction; Joint (building); Computer science; Artificial intelligence; Pattern recognition (psychology); Exploit; Dictionary learning; Channel (broadcasting); Sparse approximation; Engineering","score_opus":0.06480208209402416,"score_gpt":0.23207101135388353,"score_spread":0.16726892925985937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792680995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002251567,0.00019091899,0.99694175,0.00006267324,0.000029679546,0.0000099809395,0.000020060708,0.00011065909,0.00038264232],"genre_scores_gemma":[0.1446362,0.0009869116,0.84948325,0.00023293124,0.00019375002,0.00009566027,0.00040534805,0.0001583572,0.0038075822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999153,0.0002433715,0.000040479295,0.00019641386,0.00030971697,0.000057015208],"domain_scores_gemma":[0.99875855,0.00052971416,0.00013282172,0.00027879456,0.00024430398,0.000055750774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012883001,0.0009059168,0.0013816837,0.0007344406,0.0003280603,0.0007872363,0.0014373084,0.0014433173,0.0013957608],"category_scores_gemma":[0.0036613597,0.00043454705,0.00079695164,0.0012659613,0.0009533632,0.0017665798,0.0015940593,0.0016612705,0.0008411137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024652184,0.00015339814,0.0010491362,0.00044013414,0.00020042571,0.00014741381,0.00019888951,0.3085462,0.03762739,0.0572377,0.0064508882,0.587702],"study_design_scores_gemma":[0.000011823059,0.00005469936,0.0001499075,0.000017140092,0.00001927215,0.00012630859,0.000020469992,0.9777916,0.006479686,0.011931248,0.0033836265,0.000014190891],"about_ca_topic_score_codex":0.0012271759,"about_ca_topic_score_gemma":0.0013428433,"teacher_disagreement_score":0.0014433173,"about_ca_system_score_codex":0.00030759085,"about_ca_system_score_gemma":0.0008381846,"threshold_uncertainty_score":0.006813228},"labels":[],"label_agreement":null},{"id":"W2795416201","doi":"10.1016/j.chemolab.2018.04.001","title":"Noisy matrix completion on a novel neural network framework","year":2018,"lang":"en","type":"article","venue":"Chemometrics and Intelligent Laboratory Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Florida","keywords":"Overfitting; Early stopping; Missing data; Computer science; Artificial neural network; Matrix completion; Regularization (linguistics); Bayesian probability; Generalization; Algorithm; Artificial intelligence; Iterative method; Data mining; Machine learning; Pattern recognition (psychology); Mathematics","score_opus":0.028626079747988694,"score_gpt":0.26314970220467576,"score_spread":0.23452362245668706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795416201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003983194,0.00013835252,0.99434304,0.00018979023,0.000043598993,0.000013018259,0.0000685239,0.000090284266,0.001130171],"genre_scores_gemma":[0.3235759,0.0010032707,0.6594169,0.00024490143,0.0005605668,0.00017792406,0.0005753974,0.00019332473,0.0142518245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994006,0.00021916625,0.000024471747,0.00011417256,0.00020111614,0.00004054342],"domain_scores_gemma":[0.9989366,0.00048558172,0.000112265356,0.00015052264,0.0002505441,0.00006449421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011351359,0.0008028119,0.0008697009,0.0006046428,0.00036594548,0.0009122012,0.0016755523,0.0012582833,0.002605691],"category_scores_gemma":[0.0030378466,0.00040245205,0.00054399436,0.0009376321,0.0011073938,0.0018989524,0.0016632479,0.0015139888,0.0005950139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001164876,0.00008891538,0.0002803647,0.00012403139,0.000049607566,0.00009680546,0.000056713245,0.7671203,0.0062957527,0.14973204,0.0036436762,0.072395295],"study_design_scores_gemma":[0.0000029096377,0.000008678732,0.000027990027,0.0000021881813,0.000002629421,0.000009467672,0.0000020758557,0.98849714,0.00029658148,0.010770541,0.0003758782,0.0000038867583],"about_ca_topic_score_codex":0.0047495435,"about_ca_topic_score_gemma":0.0056318725,"teacher_disagreement_score":0.0047495435,"about_ca_system_score_codex":0.0005919887,"about_ca_system_score_gemma":0.0010103903,"threshold_uncertainty_score":0.00944376},"labels":[],"label_agreement":null},{"id":"W2796099568","doi":"10.1007/s43670-021-00012-4","title":"Memoryless scalar quantization for random frames","year":2021,"lang":"en","type":"preprint","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Applied mathematics; Quantization (signal processing); Invertible matrix; Gaussian; Algorithm; Physics; Pure mathematics; Quantum mechanics","score_opus":0.06026650454885625,"score_gpt":0.3222777198996381,"score_spread":0.26201121535078187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796099568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063395784,0.0013871033,0.9872557,0.0005012727,0.00015361566,0.000017360275,0.000135258,0.000098995944,0.0041111135],"genre_scores_gemma":[0.50523746,0.0065871878,0.4607329,0.00073582376,0.0010265886,0.00022314854,0.00087463483,0.00020622245,0.024375986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991936,0.00031153605,0.000047193604,0.00012716101,0.0002715926,0.000048959337],"domain_scores_gemma":[0.9985921,0.00077954686,0.00012933934,0.00024505655,0.00020488037,0.000048985235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011346731,0.00065239856,0.0006509825,0.000768558,0.00027724824,0.0013576794,0.0007055091,0.0010496401,0.0034104702],"category_scores_gemma":[0.006292424,0.00031445114,0.00025527278,0.0011292262,0.0011288996,0.0021907508,0.0009881058,0.0015023799,0.0007103708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082585546,0.000019568943,0.00008574853,0.00012410134,0.0000124664,0.00004380371,0.00006170301,0.06115612,0.0034582985,0.87161297,0.0037973234,0.05954526],"study_design_scores_gemma":[0.000018328143,0.000036654626,0.00009530809,0.000037329486,0.0000065143804,0.00005955929,0.000021763424,0.49748334,0.001674488,0.4956492,0.004899784,0.000017789236],"about_ca_topic_score_codex":0.001076772,"about_ca_topic_score_gemma":0.0009831523,"teacher_disagreement_score":0.0034104702,"about_ca_system_score_codex":0.0006561427,"about_ca_system_score_gemma":0.00050218066,"threshold_uncertainty_score":0.011409104},"labels":[],"label_agreement":null},{"id":"W2796118676","doi":"10.1007/978-3-319-89656-4_20","title":"Accelerated Gradient and Block-Wise Gradient Methods for Big Data Factorization","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Block (permutation group theory); Stochastic gradient descent; Computer science; Gradient descent; Big data; Algorithm; Factorization; Convergence (economics); Gradient method; Mathematics; Combinatorics; Data mining; Artificial intelligence","score_opus":0.09292500798450563,"score_gpt":0.3193265258625638,"score_spread":0.22640151787805818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796118676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009016689,0.00096289936,0.9960471,0.00015517838,0.00016781456,0.000021614633,0.00006969594,0.00026448135,0.0014095372],"genre_scores_gemma":[0.03539461,0.002496859,0.9485053,0.00023186965,0.0003604745,0.00019852049,0.000505453,0.00044986283,0.011857196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00014869579,0.000022749391,0.00008215295,0.00018637188,0.000033659275],"domain_scores_gemma":[0.99904794,0.00046623798,0.000048374273,0.00017607883,0.00021256304,0.00004880052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086134,0.0014526471,0.0011435671,0.00060285034,0.00031834625,0.0010123305,0.001213385,0.0013373959,0.0065961615],"category_scores_gemma":[0.0033891615,0.00057137746,0.0008440756,0.0011557516,0.00096282974,0.0016410775,0.0015514931,0.002766125,0.0035509076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028965645,0.00014277778,0.0003292577,0.0008684486,0.00015544402,0.0001740331,0.00019424426,0.21292102,0.019844135,0.21998489,0.05964699,0.48544917],"study_design_scores_gemma":[0.000021038246,0.00004431443,0.00013000883,0.000032990534,0.000012337636,0.00010477333,0.000016141446,0.91520303,0.0026140555,0.06633085,0.015467611,0.000022842027],"about_ca_topic_score_codex":0.0017906757,"about_ca_topic_score_gemma":0.0029907508,"teacher_disagreement_score":0.0065961615,"about_ca_system_score_codex":0.00044921713,"about_ca_system_score_gemma":0.00083925243,"threshold_uncertainty_score":0.022066295},"labels":[],"label_agreement":null},{"id":"W2800412484","doi":"10.1016/j.neucom.2018.04.046","title":"MF-LRTC: Multi-filters guided low-rank tensor coding for image restoration","year":2018,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Deblurring; Artificial intelligence; Computer science; Pattern recognition (psychology); Rank (graph theory); Neural coding; Redundancy (engineering); Coding (social sciences); Tensor (intrinsic definition); Image restoration; Structure tensor; Image (mathematics); Mathematics; Computer vision; Image processing","score_opus":0.04025375119954876,"score_gpt":0.2883419456752768,"score_spread":0.24808819447572805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800412484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029635946,0.00017672735,0.9945838,0.00015751079,0.0000669889,0.00002864985,0.00013693392,0.0007877741,0.0010980873],"genre_scores_gemma":[0.056181345,0.00035286977,0.9379011,0.00017720138,0.00009552781,0.000093095536,0.00044037227,0.0002706114,0.004487834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960905,0.00009694733,0.000017749288,0.000054928256,0.00018461065,0.00003673451],"domain_scores_gemma":[0.9993042,0.0001849686,0.00007342073,0.00017050492,0.00020317655,0.000063705505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006399997,0.0009794477,0.0007320686,0.0008789628,0.00034567146,0.00078521005,0.0010589089,0.0011333514,0.0043484764],"category_scores_gemma":[0.0020060511,0.0002501567,0.0005560589,0.0010007137,0.00071434316,0.001203071,0.001164322,0.001751046,0.0018110133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035195868,0.00024821964,0.000338682,0.00031287095,0.000066499655,0.00014312963,0.00015358819,0.10240368,0.07085027,0.06844833,0.029275471,0.72740734],"study_design_scores_gemma":[0.000015907033,0.0000781824,0.000121062294,0.000019478332,0.000009688165,0.00011446687,0.000017127957,0.9680599,0.013321515,0.011740689,0.006480004,0.000022003685],"about_ca_topic_score_codex":0.003343085,"about_ca_topic_score_gemma":0.005653399,"teacher_disagreement_score":0.0043484764,"about_ca_system_score_codex":0.00037641605,"about_ca_system_score_gemma":0.0010403185,"threshold_uncertainty_score":0.01454711},"labels":[],"label_agreement":null},{"id":"W2802077215","doi":"10.1109/iscas.2018.8351059","title":"Sparse Signal Reconstruction Using Multi-Sequential Lp Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Algorithm; Compressed sensing; Set (abstract data type); Computer science; Signal reconstruction; Reduction (mathematics); SIGNAL (programming language); Mathematical optimization; Signal processing; Mathematics; Digital signal processing","score_opus":0.05114845646620255,"score_gpt":0.2643107427727926,"score_spread":0.21316228630659004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802077215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024243894,0.000048454247,0.99672973,0.00004863169,0.000011282792,0.000012344119,0.0000109812745,0.000140485,0.0005737322],"genre_scores_gemma":[0.12754495,0.00018461641,0.8686085,0.000094848576,0.000053507898,0.00014462696,0.00019849789,0.00012683285,0.0030436183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993777,0.00019361709,0.000028242175,0.00009146103,0.00026413336,0.00004485018],"domain_scores_gemma":[0.9993255,0.0003320051,0.00007702152,0.000079995974,0.00015716258,0.000028348257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082491117,0.00094968977,0.00086662034,0.00045841295,0.00032015998,0.00078298873,0.0008475835,0.0008395507,0.0015742615],"category_scores_gemma":[0.0018375794,0.00044435708,0.0007741215,0.0006689679,0.000597605,0.00092903076,0.0010725117,0.0012678058,0.0005305778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013352194,0.00006376074,0.00036671624,0.0001135345,0.000054853554,0.00010173014,0.00006790636,0.8325429,0.01635456,0.01140296,0.0017131212,0.13708447],"study_design_scores_gemma":[0.0000038019152,0.000020818827,0.000026749014,0.0000017592314,0.0000022065242,0.000015769143,0.000002661759,0.9975594,0.001308007,0.00067509856,0.000380888,0.0000027441317],"about_ca_topic_score_codex":0.0023096676,"about_ca_topic_score_gemma":0.0031093748,"teacher_disagreement_score":0.0023096676,"about_ca_system_score_codex":0.00051826244,"about_ca_system_score_gemma":0.0010881973,"threshold_uncertainty_score":0.0052663684},"labels":[],"label_agreement":null},{"id":"W2805637342","doi":"10.1007/978-981-10-8660-1_7","title":"Sparse Channel Estimation Based on Compressive Sensing with Overcomplete Dictionaries in OFDM Communication Systems","year":2018,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Compressed sensing; Channel (broadcasting); Computer science; Orthogonal frequency-division multiplexing; Baseband; Algorithm; Signal recovery; Multipath propagation; SIGNAL (programming language); Telecommunications; Bandwidth (computing)","score_opus":0.032081127489619325,"score_gpt":0.2499525097593168,"score_spread":0.21787138226969746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805637342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060521145,0.0068397215,0.97747576,0.00040125946,0.0002738461,0.000015588175,0.00006959954,0.00015574602,0.008716432],"genre_scores_gemma":[0.32500947,0.030571058,0.61064667,0.00035641497,0.0019543308,0.00009928508,0.00045002,0.00012563396,0.030787127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998727,0.000032867687,0.0000061974383,0.00002325641,0.000057463203,0.000007531755],"domain_scores_gemma":[0.9997156,0.00019889034,0.000015950402,0.00002954319,0.000034252633,0.0000057923435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023840119,0.00039035894,0.00046414154,0.00022679371,0.00012168453,0.00057229097,0.00034248616,0.0005101375,0.0017266299],"category_scores_gemma":[0.00091300986,0.00021957998,0.00025020633,0.0007651417,0.0004730659,0.00076218933,0.00047713058,0.0012022314,0.0005523747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117752126,0.00006048904,0.00030266395,0.00053141697,0.000058590093,0.00015105633,0.00017065501,0.25448906,0.024453307,0.20520094,0.014722316,0.49974173],"study_design_scores_gemma":[0.000007728832,0.000050910763,0.00029766033,0.000046152574,0.000018003471,0.00017859663,0.000026929596,0.92792416,0.003645027,0.052631103,0.015152546,0.000021130229],"about_ca_topic_score_codex":0.00060215493,"about_ca_topic_score_gemma":0.00059802097,"teacher_disagreement_score":0.0017266299,"about_ca_system_score_codex":0.00020866015,"about_ca_system_score_gemma":0.00022412684,"threshold_uncertainty_score":0.005776167},"labels":[],"label_agreement":null},{"id":"W2806337688","doi":"10.1093/imaiai/iaaa007","title":"On oracle-type local recovery guarantees in compressed sensing","year":2020,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Minification; Sampling (signal processing); Nyquist–Shannon sampling theorem; Coherence (philosophical gambling strategy); Wavelet; Oracle; Dimension (graph theory); Haar wavelet; SIGNAL (programming language)","score_opus":0.015683203423382395,"score_gpt":0.2246411339346488,"score_spread":0.2089579305112664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806337688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010488396,0.00046418366,0.98491514,0.00046734515,0.00003884246,0.000039580584,0.00010981318,0.00020898349,0.0032677797],"genre_scores_gemma":[0.6836421,0.0014416869,0.30775994,0.00066014135,0.00039687846,0.00036262634,0.00053763733,0.0004401484,0.0047587077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523526,0.001931065,0.00016163722,0.00050826155,0.0017796083,0.0003841797],"domain_scores_gemma":[0.95468324,0.0379633,0.0016025065,0.0031656758,0.001962785,0.0006223921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071928753,0.0015663092,0.0016273096,0.0013977041,0.0005970906,0.001850013,0.0022762117,0.0015686211,0.0044969027],"category_scores_gemma":[0.04688422,0.0006178113,0.00087299116,0.0014236674,0.0032308365,0.00477155,0.00416226,0.0042674458,0.0007397894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006056078,0.00012478155,0.000829318,0.00037619346,0.00006866267,0.00021562775,0.0002501327,0.4898891,0.01129681,0.43426752,0.003794301,0.058282033],"study_design_scores_gemma":[0.00001891456,0.000066338085,0.00015577154,0.000021944894,0.000007937089,0.000035926303,0.000016557009,0.9363964,0.0020000013,0.060664997,0.0006016839,0.0000135001565],"about_ca_topic_score_codex":0.0018385777,"about_ca_topic_score_gemma":0.0018343009,"teacher_disagreement_score":0.0071928753,"about_ca_system_score_codex":0.0017714133,"about_ca_system_score_gemma":0.0014022874,"threshold_uncertainty_score":0.038040042},"labels":[],"label_agreement":null},{"id":"W2807041493","doi":"10.1007/978-3-319-93000-8_33","title":"Lp Norm Relaxation Approach for Large Scale Data Analysis: A Review","year":2018,"lang":"en","type":"review","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Signal processing; Artificial intelligence; Sparse approximation; Representation (politics); Scale (ratio); Relaxation (psychology); Image processing; Artificial neural network; Theoretical computer science; Machine learning; Pattern recognition (psychology); Algorithm; Image (mathematics)","score_opus":0.061612878194012635,"score_gpt":0.33194990885863646,"score_spread":0.27033703066462383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807041493","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006257912,0.9127807,0.082620904,0.0012197562,0.0005002171,0.000032099168,0.0001289131,0.00012006813,0.0019715936],"genre_scores_gemma":[0.006188024,0.94828266,0.042299647,0.0005611445,0.0013568786,0.000057409376,0.00025518695,0.000060426377,0.0009386958],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992735,0.0001556494,0.00008927783,0.00018262194,0.00026283992,0.000036224737],"domain_scores_gemma":[0.99668485,0.0024214543,0.00016986513,0.00014769261,0.0005026112,0.00007351853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021956563,0.0015093718,0.002149308,0.0017120342,0.00029336667,0.0019052831,0.0018852807,0.0016766893,0.0036254076],"category_scores_gemma":[0.0053087617,0.0007335631,0.0010240322,0.004575421,0.0011399172,0.0026737067,0.001498814,0.0024117678,0.0019361997],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078754296,0.0001062693,0.0002934587,0.010732441,0.00019378388,0.00013649804,0.00006541488,0.0062710163,0.0017557235,0.01525119,0.022079295,0.943036],"study_design_scores_gemma":[0.00013199942,0.00056122337,0.0026019511,0.008928127,0.0007346773,0.0034504868,0.00042606928,0.07277844,0.006135144,0.11308161,0.79086643,0.0003038672],"about_ca_topic_score_codex":0.0011823649,"about_ca_topic_score_gemma":0.001157311,"teacher_disagreement_score":0.0036254076,"about_ca_system_score_codex":0.00041224502,"about_ca_system_score_gemma":0.0013793468,"threshold_uncertainty_score":0.012128174},"labels":[],"label_agreement":null},{"id":"W2807765696","doi":"10.24963/ijcai.2018/281","title":"Solving Separable Nonsmooth Problems Using Frank-Wolfe with Uniform Affine Approximations","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Affine transformation; Context (archaeology); Low-rank approximation; Mathematical optimization; Curvature; Mathematics; Approximation algorithm; Approximation theory; Rank (graph theory); Measure (data warehouse); Computer science; Applied mathematics; Function approximation; Separable space; Algorithm; Artificial intelligence; Artificial neural network; Hankel matrix; Combinatorics; Mathematical analysis; Pure mathematics","score_opus":0.01945058706035365,"score_gpt":0.22428154393277738,"score_spread":0.20483095687242373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807765696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024829097,0.00008871639,0.99679023,0.000059739763,0.000011097912,0.000012295169,0.000007683408,0.0000570477,0.00049016817],"genre_scores_gemma":[0.1760325,0.0004528892,0.819693,0.00012787528,0.0000934104,0.00013908888,0.00009516387,0.0000873501,0.003278728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960345,0.00012420016,0.00002527306,0.00006179462,0.00015351365,0.00003180781],"domain_scores_gemma":[0.99875546,0.0008723282,0.00011811794,0.00009958449,0.00010886849,0.000045743793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010197272,0.0009560948,0.00092594227,0.0005016804,0.0002767285,0.0008640984,0.0008282607,0.0014253204,0.0014186355],"category_scores_gemma":[0.0036948747,0.00041772475,0.00057559786,0.0005461255,0.0010007995,0.001170771,0.001238283,0.0014620828,0.00046187037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008011145,0.00005809963,0.00041972598,0.0002187563,0.000046741032,0.00018167992,0.00015198598,0.80996764,0.010786567,0.08168149,0.0019640108,0.09444317],"study_design_scores_gemma":[0.0000035872727,0.000013542835,0.00002183354,0.000004229772,0.000001441716,0.000018144608,0.0000056099,0.9941427,0.00063857296,0.0047476874,0.00039959123,0.0000030520605],"about_ca_topic_score_codex":0.0014986963,"about_ca_topic_score_gemma":0.0017849054,"teacher_disagreement_score":0.0014986963,"about_ca_system_score_codex":0.00037595417,"about_ca_system_score_gemma":0.0006923078,"threshold_uncertainty_score":0.005392909},"labels":[],"label_agreement":null},{"id":"W2808092577","doi":"10.24963/ijcai.2018/299","title":"Faster Training Algorithms for Structured Sparsity-Inducing Norm","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Institutes of Health; National Science Foundation","keywords":"Algorithm; Regularization (linguistics); Computer science; Operator (biology); Norm (philosophy); Rate of convergence; Generalization; Convergence (economics); Mathematics; Key (lock); Artificial intelligence","score_opus":0.0571724760049361,"score_gpt":0.26648968885111907,"score_spread":0.20931721284618296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808092577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016294634,0.000089496854,0.9969797,0.00009502572,0.00003383151,0.000031770494,0.000026321313,0.00034199216,0.00077252387],"genre_scores_gemma":[0.0691222,0.0003405211,0.9257035,0.00023415458,0.00015389395,0.0002958919,0.00042373524,0.0002718944,0.0034540703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987741,0.00033321272,0.00007154176,0.00024228546,0.00047939137,0.0000995102],"domain_scores_gemma":[0.997633,0.0011549247,0.00016949666,0.00037761382,0.0005687922,0.00009620381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018579608,0.0013073158,0.0012207552,0.0010136724,0.0005070831,0.0009246154,0.0016589438,0.0014808372,0.006635183],"category_scores_gemma":[0.008144819,0.0005406373,0.0008855458,0.0012644912,0.0009682836,0.0024556324,0.0018557875,0.0032852243,0.0020740072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002180283,0.00018833218,0.00087515934,0.00031317538,0.00007867703,0.000119468416,0.00022940154,0.41035601,0.010979821,0.09996436,0.0129603855,0.46371716],"study_design_scores_gemma":[0.00001697815,0.000021205595,0.00006876119,0.000009608047,0.0000043465657,0.000027938715,0.00001134505,0.9848038,0.0013896171,0.011909762,0.0017302338,0.00000630072],"about_ca_topic_score_codex":0.0029054016,"about_ca_topic_score_gemma":0.004133022,"teacher_disagreement_score":0.006635183,"about_ca_system_score_codex":0.0008038902,"about_ca_system_score_gemma":0.0017710429,"threshold_uncertainty_score":0.022196889},"labels":[],"label_agreement":null},{"id":"W2808234661","doi":"10.1109/radar.2018.8378777","title":"Information-theoretic compressive measurement for frequency hopping pattern recognition","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Defense Advanced Research Projects Agency; Federation for the Humanities and Social Sciences","keywords":"Compressed sensing; Frequency-hopping spread spectrum; Gaussian; Mutual information; Algorithm; Computer science; Mathematics; Electronic engineering; Telecommunications; Artificial intelligence; Physics; Engineering","score_opus":0.03463166364753648,"score_gpt":0.22737947086279384,"score_spread":0.19274780721525736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808234661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00590461,0.00021711904,0.9926634,0.00012678279,0.000021354213,0.000016137417,0.000016181646,0.000064508626,0.0009698624],"genre_scores_gemma":[0.6373868,0.0007945758,0.35956168,0.00023260701,0.00017581128,0.0001122547,0.00014615551,0.00003269145,0.0015574138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991835,0.0002708558,0.00003279764,0.00009251975,0.0003866057,0.00003370419],"domain_scores_gemma":[0.9989141,0.0006456664,0.00011242729,0.00016033665,0.00013646374,0.000031041207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076551735,0.0005009842,0.00046790237,0.00043829702,0.00021875666,0.0004881132,0.0007040295,0.000649182,0.0009047959],"category_scores_gemma":[0.003692481,0.00019313305,0.00027070826,0.0005116511,0.0010179722,0.0013886278,0.0007856412,0.0007994015,0.00028247325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025855732,0.0000827788,0.000670258,0.00024325887,0.000060862414,0.00015824886,0.00013553414,0.53965414,0.047051582,0.14779074,0.001947299,0.26194674],"study_design_scores_gemma":[0.0000069538723,0.000056356428,0.00012181177,0.000009688455,0.000005823536,0.00006733388,0.000011270834,0.97804433,0.0056543024,0.015173996,0.0008356266,0.000012429623],"about_ca_topic_score_codex":0.0005673168,"about_ca_topic_score_gemma":0.00055335165,"teacher_disagreement_score":0.0009047959,"about_ca_system_score_codex":0.00038512843,"about_ca_system_score_gemma":0.00047925333,"threshold_uncertainty_score":0.0040484667},"labels":[],"label_agreement":null},{"id":"W2886428232","doi":"10.3390/s18082568","title":"Bayesian Compressive Sensing Based Optimized Node Selection Scheme in Underwater Sensor Networks","year":2018,"lang":"en","type":"article","venue":"Sensors","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Compressed sensing; Mathematical optimization; Wireless sensor network; Convex optimization; Computer science; Node (physics); Covariance matrix; Optimization problem; Algorithm; Sensor node; Semidefinite programming; Mathematics; Regular polygon; Engineering; Key distribution in wireless sensor networks","score_opus":0.012478161608082735,"score_gpt":0.23025736135881203,"score_spread":0.2177791997507293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886428232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020863017,0.00032643453,0.97707134,0.00021993244,0.000022999107,0.000034233326,0.0000325716,0.000110975765,0.0013183934],"genre_scores_gemma":[0.83096313,0.00077940535,0.16527312,0.00015418818,0.00006104076,0.00015463184,0.00015338563,0.000031776373,0.0024294015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.00023745395,0.00002500902,0.00009420428,0.00025478392,0.000048742302],"domain_scores_gemma":[0.99960667,0.0001937274,0.00007499469,0.000027366945,0.00008057166,0.000016792535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070408516,0.0004755353,0.00056917773,0.00030324332,0.00026761444,0.00031398502,0.0007840758,0.00049658096,0.0005138252],"category_scores_gemma":[0.0015772721,0.00028148043,0.00021573705,0.00055479154,0.00046172776,0.0007543388,0.0005836594,0.00044960916,0.00011013923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016713834,0.00005645566,0.0005816993,0.00011046242,0.000033346983,0.000114497576,0.000111134774,0.8716717,0.016952608,0.017865526,0.0017804301,0.09055503],"study_design_scores_gemma":[0.0000086314585,0.00002751679,0.000108970075,0.000003884967,0.0000049809432,0.000020533103,0.000006774567,0.99604356,0.0011381739,0.002341946,0.00028864352,0.00000648198],"about_ca_topic_score_codex":0.0034709265,"about_ca_topic_score_gemma":0.0039736284,"teacher_disagreement_score":0.0034709265,"about_ca_system_score_codex":0.00047230034,"about_ca_system_score_gemma":0.000760841,"threshold_uncertainty_score":0.006901443},"labels":[],"label_agreement":null},{"id":"W2887030119","doi":"","title":"Graphical nonconvex optimization via an adaptive convex relaxation","year":2018,"lang":"en","type":"article","venue":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relaxation (psychology); Regular polygon; Mathematical optimization; Computer science; Convex optimization; Mathematics; Geometry","score_opus":0.007343508668599138,"score_gpt":0.1852213831503373,"score_spread":0.17787787448173814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887030119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025560458,0.00009172811,0.9960223,0.00024943583,0.000015087299,0.000015660624,0.000026361018,0.000049545648,0.00097399234],"genre_scores_gemma":[0.45301378,0.00092904235,0.5371171,0.0005951425,0.00018562711,0.00040524662,0.00036651312,0.0001993315,0.0071881195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989176,0.0005982443,0.000028497529,0.00018707174,0.00019267328,0.000075950375],"domain_scores_gemma":[0.9980798,0.0013741793,0.00020892064,0.0001464602,0.00011529863,0.0000753071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971132,0.0012658433,0.000988375,0.00066333974,0.00029230327,0.0009792695,0.0012422043,0.0014492687,0.0024915577],"category_scores_gemma":[0.0065056593,0.0006147042,0.0009997074,0.00089356693,0.0016974388,0.0013274363,0.0020964316,0.0021677085,0.00044661414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040602437,0.000036231424,0.0003486222,0.00009262358,0.00004063548,0.000096433956,0.000051937153,0.8878968,0.0010916556,0.09101213,0.001483687,0.017808726],"study_design_scores_gemma":[0.000004016107,0.00001057723,0.000034252742,0.0000053846416,0.0000029519754,0.000012549491,0.000004187584,0.9855957,0.00012692729,0.013864466,0.00033609415,0.0000029625965],"about_ca_topic_score_codex":0.002433478,"about_ca_topic_score_gemma":0.0022095658,"teacher_disagreement_score":0.0024915577,"about_ca_system_score_codex":0.0008042721,"about_ca_system_score_gemma":0.0012174352,"threshold_uncertainty_score":0.010424435},"labels":[],"label_agreement":null},{"id":"W2888044338","doi":"10.1109/tvt.2018.2866911","title":"Adaptive Channelized Greedy Algorithm for Analog Signal Compressive Sensing","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Matching pursuit; Algorithm; Noise (video); Compressed sensing; Signal reconstruction; Computer science; Channelized; Signal-to-noise ratio (imaging); Channel (broadcasting); SIGNAL (programming language); Noise measurement; Electronic engineering; Signal processing; Engineering; Artificial intelligence; Noise reduction; Telecommunications; Image (mathematics)","score_opus":0.016820419561586888,"score_gpt":0.2360399587092677,"score_spread":0.2192195391476808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888044338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004641855,0.00016403076,0.9938834,0.00009158334,0.000026876629,0.000028720797,0.000022903041,0.00016503074,0.00097564684],"genre_scores_gemma":[0.35756567,0.00065538904,0.63733935,0.00025480005,0.00011821097,0.00031073418,0.00021956561,0.00008853567,0.0034476947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.00020597884,0.000029952755,0.000109069304,0.00022641191,0.00007630838],"domain_scores_gemma":[0.9994112,0.00032737252,0.000050257473,0.000058415222,0.00012614163,0.000026542943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503778,0.00068937865,0.00066772895,0.0005949158,0.000385439,0.0005740807,0.0007914154,0.0008248161,0.0016548014],"category_scores_gemma":[0.0020358476,0.00028820444,0.00046233975,0.00096537266,0.00075665343,0.0009650016,0.001218346,0.00093343784,0.00047879262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035106757,0.00008620676,0.0007324032,0.00017206963,0.00006847395,0.00015910379,0.00009889489,0.696731,0.015228273,0.056081958,0.003535825,0.22675475],"study_design_scores_gemma":[0.000018649745,0.000043321572,0.000057796176,0.0000052359774,0.000004974098,0.000050992592,0.000009105584,0.99096024,0.0018781746,0.005970218,0.0009908703,0.000010421559],"about_ca_topic_score_codex":0.002017892,"about_ca_topic_score_gemma":0.0018688241,"teacher_disagreement_score":0.002017892,"about_ca_system_score_codex":0.00046926938,"about_ca_system_score_gemma":0.0015572394,"threshold_uncertainty_score":0.005535841},"labels":[],"label_agreement":null},{"id":"W2889201621","doi":"10.1109/ccece.2018.8447886","title":"Estimation of Frequency of a Sinusoid from Compressive Sensing Measurements","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Royal Military College of Canada","funders":"","keywords":"Additive white Gaussian noise; Sinusoid; Noise (video); Gaussian noise; Mathematics; Least-squares function approximation; Gaussian; White noise; Estimation theory; Algorithm; Statistics; Computer science; Physics","score_opus":0.03405515208163872,"score_gpt":0.2514242502382866,"score_spread":0.21736909815664784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889201621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027601384,0.0002293313,0.9704011,0.00014188996,0.000049668935,0.000023988157,0.000057386544,0.00016807785,0.0013272741],"genre_scores_gemma":[0.5086297,0.0009341788,0.48781425,0.00011319179,0.0001462379,0.0000678294,0.0002901934,0.0000881906,0.0019162521],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995981,0.00008643262,0.000022020073,0.00008252139,0.00018397521,0.000026907763],"domain_scores_gemma":[0.999383,0.00035189683,0.00008973339,0.000062475454,0.00009161315,0.000021266404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047997342,0.00059153297,0.0005388452,0.00049157516,0.0002617924,0.000496285,0.00031155214,0.000719244,0.0009505294],"category_scores_gemma":[0.0030904117,0.00025208842,0.0002885173,0.00038122488,0.0005648289,0.0009805734,0.0007185829,0.000810728,0.00043063427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041178823,0.00006189765,0.0024295172,0.00044569455,0.000057482295,0.00032984902,0.0003615166,0.36250466,0.21606006,0.02755049,0.001718893,0.38806814],"study_design_scores_gemma":[0.0000216998,0.00015230232,0.0012051548,0.00007502516,0.000017381657,0.00039273055,0.000106596664,0.9387337,0.038986396,0.015811004,0.0044515505,0.000046341094],"about_ca_topic_score_codex":0.00056515983,"about_ca_topic_score_gemma":0.0006376429,"teacher_disagreement_score":0.0009505294,"about_ca_system_score_codex":0.00017796629,"about_ca_system_score_gemma":0.0005019397,"threshold_uncertainty_score":0.0031797886},"labels":[],"label_agreement":null},{"id":"W2889565628","doi":"10.1109/icassp.2018.8461416","title":"Learning-Based Design of Measurement Matrix with Inter-Column Correlation for Compressive Sensing","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compressed sensing; Independent and identically distributed random variables; Context (archaeology); Computer science; Random matrix; Matrix (chemical analysis); Correlation; Algorithm; Random variable; Theoretical computer science; Computer engineering; Data mining; Mathematics; Statistics; Physics; Eigenvalues and eigenvectors","score_opus":0.03162103068899274,"score_gpt":0.24388974353501972,"score_spread":0.21226871284602697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889565628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009668626,0.000081604405,0.9985594,0.000050583338,0.000013091103,0.000017902546,0.000015143542,0.00006197233,0.00023346618],"genre_scores_gemma":[0.22219391,0.0007235251,0.7748865,0.00028479792,0.00016860054,0.0002918651,0.00026087425,0.00009902548,0.0010909619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998621,0.0005350641,0.00006317761,0.00032032694,0.00038587104,0.000074639756],"domain_scores_gemma":[0.9983944,0.0007715739,0.00025418538,0.00018405323,0.00031988736,0.000075797965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337996,0.0012756828,0.0009004184,0.0005083471,0.00032940856,0.0006682968,0.0011461186,0.0010180121,0.0012288936],"category_scores_gemma":[0.0056625335,0.00046449437,0.0005087478,0.0008316811,0.001054687,0.0013787656,0.0012821766,0.0015442182,0.00073590694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029137704,0.00015855907,0.0009947695,0.00067130674,0.0001353065,0.000251411,0.00021579338,0.510576,0.08167947,0.124375194,0.005069032,0.27558175],"study_design_scores_gemma":[0.000019836809,0.000117002746,0.00015655742,0.000023461194,0.00002055893,0.00014276088,0.00001584652,0.97795004,0.0066124685,0.012031668,0.0028834147,0.000026312078],"about_ca_topic_score_codex":0.00071460084,"about_ca_topic_score_gemma":0.0010475143,"teacher_disagreement_score":0.001337996,"about_ca_system_score_codex":0.00044411383,"about_ca_system_score_gemma":0.0011661435,"threshold_uncertainty_score":0.007076025},"labels":[],"label_agreement":null},{"id":"W2890713331","doi":"10.1109/icassp.2018.8462561","title":"First-Order Difference Energy Regularization for Enhancing Reconstruction Performance in Compressive Sensing of Foot-Gait Signals","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Regularization (linguistics); Computer science; Norm (philosophy); Compressed sensing; Algorithm; Gait; Signal reconstruction; Signal-to-noise ratio (imaging); Mathematical optimization; Signal processing; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.012859716137165477,"score_gpt":0.21199944640956483,"score_spread":0.19913973027239937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890713331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010997109,0.00016301624,0.9881159,0.00007272691,0.000019297524,0.000014097799,0.000011581072,0.000084482876,0.00052183034],"genre_scores_gemma":[0.23563541,0.0004507557,0.76173496,0.00006433994,0.000045995454,0.00007158956,0.0000887655,0.00006779806,0.0018404034],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969375,0.00007971499,0.000014305622,0.000030564912,0.00016502717,0.000016694752],"domain_scores_gemma":[0.9996791,0.00016840496,0.00003508189,0.000032886088,0.00006950979,0.0000150803335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032196,0.0004746927,0.0003807596,0.00038378304,0.00017412611,0.00034627423,0.00051418017,0.0005683253,0.00068257377],"category_scores_gemma":[0.0012015479,0.0002053438,0.00039775498,0.00034834116,0.00041320364,0.00052165095,0.0005022472,0.00063351024,0.00019339859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034351423,0.00017095018,0.0010558777,0.0004564494,0.00009408184,0.00018820685,0.00020924868,0.2617692,0.36016336,0.03540031,0.0019812149,0.33816764],"study_design_scores_gemma":[0.000008168918,0.00006145825,0.00024931028,0.000007748571,0.000006772516,0.00010690914,0.0000067948163,0.97237056,0.024882948,0.0012551331,0.0010310608,0.000013151673],"about_ca_topic_score_codex":0.00066943245,"about_ca_topic_score_gemma":0.0010245045,"teacher_disagreement_score":0.00068257377,"about_ca_system_score_codex":0.00024301242,"about_ca_system_score_gemma":0.00043405915,"threshold_uncertainty_score":0.0031901598},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; 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","score_opus":0.03694521481188713,"score_gpt":0.2967682471009871,"score_spread":0.2598230322891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890736047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005379848,0.0042873197,0.97577477,0.0061423215,0.00035349297,0.00006730754,0.000026372974,0.00019333865,0.0077751963],"genre_scores_gemma":[0.4515925,0.019119672,0.51432115,0.0028134158,0.00312192,0.00048555725,0.00011822656,0.00012506449,0.008302499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986297,0.00056812976,0.000051935946,0.0001283281,0.0005401419,0.000081823986],"domain_scores_gemma":[0.9961796,0.0025339904,0.00023601443,0.0005784801,0.0003628964,0.0001090412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002780309,0.0006820731,0.0006857021,0.0005538883,0.000522832,0.0019201072,0.001303929,0.0016769185,0.0014016205],"category_scores_gemma":[0.0064222426,0.00032663907,0.00038385435,0.0008314779,0.0030017947,0.00437183,0.0016312832,0.004085467,0.0005174374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052518215,0.0000426966,0.00015387092,0.0001560413,0.000018122066,0.0001089165,0.00021513645,0.02296641,0.0067351754,0.88316256,0.0043619904,0.08202649],"study_design_scores_gemma":[0.00003445633,0.00017218853,0.00014956918,0.00011301589,0.000015991793,0.00026696819,0.000116331394,0.36477548,0.0031431322,0.60585266,0.025308516,0.000051736333],"about_ca_topic_score_codex":0.00037708695,"about_ca_topic_score_gemma":0.00048139546,"teacher_disagreement_score":0.002780309,"about_ca_system_score_codex":0.0007270922,"about_ca_system_score_gemma":0.0007563665,"threshold_uncertainty_score":0.01470381},"labels":[],"label_agreement":null},{"id":"W2891863817","doi":"10.1016/j.bspc.2020.102243","title":"Localization of brain activity from EEG/MEG using MV-PURE framework","year":2020,"lang":"en","type":"preprint","venue":"Biomedical Signal Processing and Control","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Narodowym Centrum Nauki","keywords":"Electroencephalography; Rank (graph theory); Magnetoencephalography; Key (lock); Computer science; Noise (video); Variance (accounting); Property (philosophy); Task (project management); SIGNAL (programming language); Minimum-variance unbiased estimator; Spatial filter; Pattern recognition (psychology); Artificial intelligence; Brain activity and meditation; Algorithm; Image (mathematics); Mathematics; Statistics; Mean squared error; Neuroscience; Psychology","score_opus":0.019708498667140476,"score_gpt":0.25780683775911617,"score_spread":0.2380983390919757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891863817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006239383,0.00016330254,0.99274313,0.00006623861,0.000016834085,0.000010438715,0.00010307409,0.00019025478,0.00046742562],"genre_scores_gemma":[0.29379416,0.0009513271,0.70037115,0.00010328537,0.00013611025,0.00010995541,0.000968741,0.00017755391,0.00338776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99989724,0.000028805549,0.000005957948,0.000024536923,0.000033671025,0.000009890902],"domain_scores_gemma":[0.9998553,0.000051017265,0.00002008496,0.000025969473,0.000035533078,0.00001208385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001992215,0.0005084681,0.00035546554,0.00036380748,0.00015713317,0.00044017576,0.0004161768,0.0004827632,0.0017291311],"category_scores_gemma":[0.0010343308,0.0001954623,0.00041246237,0.0005391455,0.0002655101,0.0005192583,0.0006506829,0.000557474,0.00064535363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040823309,0.00009693557,0.0010866394,0.00049405626,0.00016436989,0.00026699057,0.00018521148,0.24459453,0.256369,0.039877877,0.0048506237,0.4516056],"study_design_scores_gemma":[0.000015500347,0.000074512296,0.0009905337,0.000023487646,0.000021973528,0.00022385336,0.000028858083,0.9610643,0.021483203,0.012841389,0.0032155688,0.000016874079],"about_ca_topic_score_codex":0.001193323,"about_ca_topic_score_gemma":0.0015269563,"teacher_disagreement_score":0.0017291311,"about_ca_system_score_codex":0.00010092242,"about_ca_system_score_gemma":0.00033816652,"threshold_uncertainty_score":0.0057845116},"labels":[],"label_agreement":null},{"id":"W2897954142","doi":"10.1109/pst.2017.00052","title":"An Analysis of the Security of Compressed Sensing Using an Artificial Neural Network","year":2017,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Encryption; Computer science; Plaintext; Artificial neural network; Compressed sensing; Key (lock); Security analysis; Theoretical computer science; Data mining; Artificial intelligence; Computer security","score_opus":0.04449119652056463,"score_gpt":0.29092790914030153,"score_spread":0.2464367126197369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897954142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38998312,0.0027542193,0.57291055,0.006460366,0.00010261433,0.00013986071,0.00024379794,0.00021084127,0.02719461],"genre_scores_gemma":[0.98218095,0.00086284406,0.014640956,0.00012567508,0.00006371035,0.000039873972,0.00005988094,0.000023033905,0.0020031403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980849,0.00069217145,0.000059038764,0.0002094218,0.00065541477,0.00029898982],"domain_scores_gemma":[0.9801292,0.015839804,0.0016742377,0.0010170174,0.0010752304,0.0002644895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038678017,0.0008767099,0.00066793675,0.0013962035,0.00070691307,0.0012299827,0.0011525188,0.0017030191,0.0027436635],"category_scores_gemma":[0.017943004,0.0003606387,0.0005870163,0.00061333826,0.0038988262,0.0037747822,0.001517872,0.0019680266,0.0001760918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033749716,0.00012054019,0.0028669017,0.00018600443,0.00010091546,0.0002552447,0.000111871355,0.6162642,0.01105935,0.34797525,0.0011533346,0.019568963],"study_design_scores_gemma":[0.000006717371,0.000056090452,0.00050116127,0.000018524224,0.000008519204,0.000069794245,0.000019062261,0.97230667,0.0011588339,0.025617188,0.00022425313,0.000013262637],"about_ca_topic_score_codex":0.0015493998,"about_ca_topic_score_gemma":0.0009993188,"teacher_disagreement_score":0.0038678017,"about_ca_system_score_codex":0.0024558813,"about_ca_system_score_gemma":0.0011728979,"threshold_uncertainty_score":0.020455182},"labels":[],"label_agreement":null},{"id":"W2898428916","doi":"10.1137/17m114741x","title":"Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Office of Science; Advanced Scientific Computing Research; U.S. Department of Energy","keywords":"Mathematics; Manifold (fluid mechanics); Piecewise; Iterated function; Subgradient method; Piecewise linear function; Sampling (signal processing); Sequence (biology); Differentiable function; Function (biology); Stationary point; Combinatorics; Algorithm; Mathematical optimization; Applied mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.050675731834091915,"score_gpt":0.26990745417082995,"score_spread":0.21923172233673804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898428916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009102214,0.0001463105,0.990099,0.000060200524,0.000009948022,0.000018738036,0.000016033928,0.00014299103,0.0004045326],"genre_scores_gemma":[0.42574137,0.00042797578,0.57101095,0.00008940936,0.000058139074,0.000166544,0.00024544366,0.0002149943,0.0020451434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996251,0.00013632562,0.000014983573,0.00006691607,0.00012592148,0.000030697596],"domain_scores_gemma":[0.9990464,0.000581858,0.000101427286,0.00009622818,0.00013753127,0.000036505327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010642877,0.0010100728,0.0009839095,0.00069757923,0.0003225469,0.00054473506,0.00078281865,0.00074698793,0.001275053],"category_scores_gemma":[0.004290654,0.0004335974,0.0007428798,0.0006601954,0.0009637383,0.0009950498,0.00078906066,0.001153175,0.0003926872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009966579,0.000038836242,0.0008352653,0.00010750471,0.000040472245,0.00006941655,0.000079001315,0.9139754,0.005036036,0.025871595,0.0010383695,0.05280845],"study_design_scores_gemma":[0.0000021875035,0.000016125203,0.0000400251,0.0000025304385,0.0000015415555,0.000007650145,0.000003087058,0.99700195,0.00045890827,0.0022433985,0.00022053458,0.000002000627],"about_ca_topic_score_codex":0.0032203314,"about_ca_topic_score_gemma":0.0029814963,"teacher_disagreement_score":0.0032203314,"about_ca_system_score_codex":0.00078261574,"about_ca_system_score_gemma":0.0008375803,"threshold_uncertainty_score":0.006403148},"labels":[],"label_agreement":null},{"id":"W2898564319","doi":"10.1109/sampta45681.2019.9030982","title":"Parameter Instability Regimes in Sparse Proximal Denoising Programs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minimax; Lasso (programming language); Instability; Computer science; Applied mathematics; Function (biology); Mathematical optimization; Matrix (chemical analysis); Stability (learning theory); Noise reduction; Algorithm; Mathematics; Artificial intelligence; Machine learning; Physics","score_opus":0.03520387429283356,"score_gpt":0.253450608466696,"score_spread":0.21824673417386242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898564319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12258829,0.0004987177,0.86546093,0.0020299149,0.00004474951,0.00006644609,0.00010716733,0.00039234443,0.008811479],"genre_scores_gemma":[0.93548393,0.0004814634,0.06023081,0.00042227993,0.00007013255,0.00020842881,0.0001217985,0.0002836795,0.0026973938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982589,0.00075393857,0.00008137517,0.0002439062,0.00051709404,0.00014475445],"domain_scores_gemma":[0.98031425,0.0150309885,0.0019628927,0.0009700678,0.0012387243,0.00048297405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065217,0.0009049877,0.0009876484,0.0013719707,0.0009707189,0.0019338221,0.0009829547,0.0018824368,0.0016617831],"category_scores_gemma":[0.0439052,0.0005981854,0.0009072972,0.00064167444,0.0044359337,0.0026965751,0.00303866,0.0033782576,0.00031158808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002745553,0.00007312001,0.004770555,0.00023064135,0.00008450823,0.000694062,0.0010332045,0.5038183,0.010725635,0.45473483,0.0026090287,0.020951563],"study_design_scores_gemma":[0.000013104639,0.000037607762,0.000532117,0.000043145643,0.000009284157,0.00009714614,0.00007450101,0.86747056,0.0018945063,0.12909651,0.0007020753,0.000029421148],"about_ca_topic_score_codex":0.0012171193,"about_ca_topic_score_gemma":0.00071763195,"teacher_disagreement_score":0.005065217,"about_ca_system_score_codex":0.0012395172,"about_ca_system_score_gemma":0.0008369827,"threshold_uncertainty_score":0.026787758},"labels":[],"label_agreement":null},{"id":"W2898585087","doi":"10.1007/978-3-030-39647-3_49","title":"Sparse Approximation of Multivariate Functions from Small Datasets Via Weighted Orthogonal Matching Pursuit","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matching pursuit; Pointwise; Greedy algorithm; Multivariate statistics; Extension (predicate logic); Matching (statistics); Mathematics; Pattern recognition (psychology); Algorithm; Minification; Computer science; Selection (genetic algorithm); Mathematical optimization; Artificial intelligence; Compressed sensing; Statistics","score_opus":0.01678031587194484,"score_gpt":0.21557491627617908,"score_spread":0.19879460040423425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898585087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008294629,0.00010047936,0.99099964,0.00006672763,0.000010442846,0.000012446791,0.000027045382,0.000059202488,0.00042932483],"genre_scores_gemma":[0.36274767,0.00069983973,0.63338697,0.00011612408,0.00008564135,0.00012989934,0.00031739214,0.00009702373,0.0024194259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.00022989507,0.000023962972,0.00008085205,0.00019177336,0.0000347092],"domain_scores_gemma":[0.9992083,0.00052267034,0.00007406332,0.00010347787,0.000070778886,0.000020759004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302279,0.0006234566,0.0007785291,0.0005195074,0.00017242008,0.0007434874,0.00088014617,0.0004991,0.00087917806],"category_scores_gemma":[0.0032109607,0.00026771115,0.0004891155,0.0011680017,0.00062390603,0.0011115766,0.0013817108,0.0010449572,0.0002791508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020569538,0.000072155075,0.0005313752,0.00018131084,0.000082301114,0.00014196264,0.00007579555,0.70394677,0.029535664,0.070370235,0.0021768487,0.19267984],"study_design_scores_gemma":[0.0000032439093,0.000016776949,0.00005371215,0.0000030580495,0.0000028804914,0.000016792603,0.0000038741364,0.99100155,0.0016068191,0.006955968,0.0003322769,0.0000030503163],"about_ca_topic_score_codex":0.00068420457,"about_ca_topic_score_gemma":0.0006387241,"teacher_disagreement_score":0.001302279,"about_ca_system_score_codex":0.00031581667,"about_ca_system_score_gemma":0.0004390305,"threshold_uncertainty_score":0.006887138},"labels":[],"label_agreement":null},{"id":"W2900532891","doi":"10.1186/s12918-018-0631-5","title":"Novel EM based ML Kalman estimation framework for superresolution of stochastic three-states microtubule signal","year":2018,"lang":"en","type":"article","venue":"BMC Systems Biology","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Computer science; Kalman filter; Sampling (signal processing); Missing data; Algorithm; SIGNAL (programming language); Expectation–maximization algorithm; Data mining; Pattern recognition (psychology); Artificial intelligence; Machine learning; Statistics; Filter (signal processing); Mathematics; Computer vision; Maximum likelihood","score_opus":0.035285455354374676,"score_gpt":0.2733813971916016,"score_spread":0.23809594183722693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900532891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022712701,0.00013713792,0.99712425,0.000052761214,0.000009047503,0.0000073648475,0.00002427369,0.00007593942,0.00029800157],"genre_scores_gemma":[0.4234251,0.0011601403,0.5690895,0.00017429203,0.00012694752,0.00020365865,0.00056419236,0.00014069791,0.0051155416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996315,0.00009737037,0.000024109338,0.000100187026,0.00010887974,0.000037935355],"domain_scores_gemma":[0.999353,0.0003311509,0.0001011561,0.000042058975,0.0001475271,0.00002519637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009153255,0.00077381614,0.0008280129,0.00048661986,0.00027340165,0.00076371647,0.0011367677,0.0010091715,0.0014276678],"category_scores_gemma":[0.0023373798,0.0004848583,0.001057075,0.0005502003,0.00054203457,0.0008612424,0.0009136952,0.001286901,0.00043052447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009296271,0.000031160325,0.0010094858,0.00017172896,0.00008196056,0.00013970897,0.00012047376,0.87536114,0.0084745055,0.020289497,0.0011742492,0.09305315],"study_design_scores_gemma":[0.0000017507685,0.000008498688,0.00009386986,0.000004190362,0.0000047137232,0.000012933912,0.000003874109,0.9976447,0.00052312255,0.0013316872,0.00036559795,0.0000050002964],"about_ca_topic_score_codex":0.006575004,"about_ca_topic_score_gemma":0.0057510915,"teacher_disagreement_score":0.006575004,"about_ca_system_score_codex":0.00060244306,"about_ca_system_score_gemma":0.0008515473,"threshold_uncertainty_score":0.013073504},"labels":[],"label_agreement":null},{"id":"W2901078087","doi":"10.1109/iccce.2018.8539329","title":"Boolean Compressive Sensing: An Approximate Trust Region Reconstruction","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Workspace; Nonlinear system; Boolean algebra; Computer science; Compressed sensing; Optimization problem; Mathematical optimization; Trust region; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.02442965382523504,"score_gpt":0.23396244572661876,"score_spread":0.2095327919013837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901078087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014847708,0.00007713641,0.9975552,0.0000985261,0.00001664997,0.00001176096,0.000014893941,0.00004785239,0.0006933239],"genre_scores_gemma":[0.3011801,0.00093410676,0.6924981,0.0003008893,0.00018383673,0.00021560705,0.00018595408,0.0001285401,0.004372867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990693,0.00037761978,0.000035571167,0.00014128299,0.00032714132,0.00004905138],"domain_scores_gemma":[0.9989549,0.0006165308,0.00011526069,0.00011876091,0.00014778948,0.00004669984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011683151,0.00074514904,0.0008300917,0.00038640323,0.00025694421,0.0009866599,0.001150837,0.0010992006,0.0020973394],"category_scores_gemma":[0.004610629,0.00037556977,0.0005551716,0.0005399609,0.0010965227,0.0017544173,0.0014963171,0.0012773289,0.0006410265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026381327,0.000081383056,0.0007309232,0.00037530737,0.00007279389,0.00025509097,0.00021912759,0.6105841,0.028433908,0.21387903,0.0039491276,0.14115536],"study_design_scores_gemma":[0.000008417867,0.00002938811,0.000034535282,0.000007224794,0.0000046143396,0.00005154386,0.000008703229,0.98916245,0.0016727332,0.008032068,0.0009814159,0.0000069675643],"about_ca_topic_score_codex":0.0012647989,"about_ca_topic_score_gemma":0.0008874806,"teacher_disagreement_score":0.0020973394,"about_ca_system_score_codex":0.00059227005,"about_ca_system_score_gemma":0.0008418122,"threshold_uncertainty_score":0.007016301},"labels":[],"label_agreement":null},{"id":"W2901255831","doi":"10.1002/hbm.24449","title":"Supervised machine learning quality control for magnetic resonance artifacts in neonatal data sets","year":2018,"lang":"en","type":"article","venue":"Human Brain Mapping","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Canadian Apheresis Group; Institut Universitaire de Gériatrie de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"Fondation Brain Canada","keywords":"Artificial intelligence; Undersampling; Computer science; Machine learning; Pattern recognition (psychology); Random forest; AdaBoost; Image quality; Gold standard (test); Support vector machine; Statistics; Mathematics; Image (mathematics)","score_opus":0.07531463197982859,"score_gpt":0.30642133296653684,"score_spread":0.23110670098670827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901255831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42335293,0.0036068768,0.56304705,0.000707758,0.000389601,0.00075921795,0.0016215133,0.004935845,0.0015792178],"genre_scores_gemma":[0.8492802,0.00031511125,0.14413874,0.0002373701,0.00011843218,0.00056644995,0.004332454,0.00026227912,0.00074890145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935075,0.0028145425,0.0008546956,0.0014652474,0.0010867422,0.00027120588],"domain_scores_gemma":[0.9834909,0.008283331,0.0020718009,0.0020434554,0.003775378,0.00033509245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0149644995,0.0011167168,0.0012099808,0.0014223028,0.000815793,0.0011319035,0.0015103064,0.0009710676,0.00063825515],"category_scores_gemma":[0.029374417,0.00021741752,0.0010753071,0.0007916028,0.00089756685,0.0008656931,0.0011529543,0.0016967262,0.000316325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001885315,0.0011606618,0.08859326,0.0011529454,0.001190694,0.00042165426,0.0007639055,0.19245021,0.028668957,0.002230985,0.011583282,0.66989815],"study_design_scores_gemma":[0.00007495763,0.0005710658,0.023559388,0.000093599774,0.00012020971,0.00018690084,0.00016345696,0.9495218,0.020030979,0.0031618876,0.0024629526,0.000052869098],"about_ca_topic_score_codex":0.0029213699,"about_ca_topic_score_gemma":0.0035131674,"teacher_disagreement_score":0.0149644995,"about_ca_system_score_codex":0.0009268409,"about_ca_system_score_gemma":0.0014485036,"threshold_uncertainty_score":0.07914084},"labels":[],"label_agreement":null},{"id":"W2903103184","doi":"10.23919/eusipco.2018.8553367","title":"Iterative Reconstruction of Spectrally Sparse Signals from Level Crossings","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Signal reconstruction; Compressed sensing; Algorithm; A priori and a posteriori; Iterative reconstruction; Computer science; Iterative method; Thresholding; Binary number; Sparse matrix; SIGNAL (programming language); Signal processing; Artificial intelligence; Mathematics; Image (mathematics); Physics","score_opus":0.037592505147120606,"score_gpt":0.2499130441852858,"score_spread":0.21232053903816517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903103184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03022992,0.00009441243,0.96865094,0.000086904176,0.000012594196,0.000011769796,0.000019104082,0.00010503329,0.00078931235],"genre_scores_gemma":[0.6142465,0.00026590045,0.38304242,0.00011646925,0.000040058687,0.00003874513,0.00014444796,0.00006823108,0.0020372525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.000089427114,0.000020810112,0.00007144413,0.00015058831,0.000044444132],"domain_scores_gemma":[0.9989784,0.00053120236,0.0001736309,0.0001176028,0.00014629445,0.000053018055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783585,0.00040778378,0.0005506628,0.00042401793,0.00022511781,0.0007408363,0.0005027477,0.0006287927,0.0007792632],"category_scores_gemma":[0.0031185376,0.0002469763,0.00042824398,0.00058075116,0.0007850582,0.0010920074,0.0008445035,0.00091393595,0.00021231409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039912682,0.00007542298,0.0030045398,0.00019189711,0.00006668673,0.0004224228,0.00036308242,0.6273985,0.065104894,0.071558364,0.0014669802,0.2299481],"study_design_scores_gemma":[0.0000075117446,0.000039957613,0.0002379639,0.0000065779864,0.000005529735,0.00009060526,0.000023172117,0.983603,0.008357065,0.007159361,0.00045990534,0.00000938909],"about_ca_topic_score_codex":0.0009158228,"about_ca_topic_score_gemma":0.00076948764,"teacher_disagreement_score":0.0009158228,"about_ca_system_score_codex":0.00031845705,"about_ca_system_score_gemma":0.000606067,"threshold_uncertainty_score":0.004116416},"labels":[],"label_agreement":null},{"id":"W2907116373","doi":"10.1007/s11004-018-09777-2","title":"Sampling Strategies for Uncertainty Reduction in Categorical Random Fields: Formulation, Mathematical Analysis and Application to Multiple-Point Simulations","year":2019,"lang":"en","type":"article","venue":"Mathematical Geosciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Sampling (signal processing); Categorical variable; Random field; Uncertainty reduction theory; Entropy (arrow of time); Computer science; Importance sampling; Information theory; Point process; Mathematics; Parametric statistics; Mathematical optimization; Algorithm; Data mining; Statistics; Monte Carlo method","score_opus":0.021281146772687352,"score_gpt":0.28611323160902424,"score_spread":0.2648320848363369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907116373","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020654371,0.00015516461,0.9970392,0.00014928867,0.000014473355,0.000021661206,0.000020220486,0.00002795493,0.0005066792],"genre_scores_gemma":[0.35320112,0.0018815001,0.6375331,0.00037263846,0.0002854158,0.00065310276,0.00033848386,0.00022723952,0.0055073397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982256,0.0009103216,0.000082732506,0.00018029663,0.0005184984,0.00008262962],"domain_scores_gemma":[0.98300225,0.014310707,0.000766681,0.0005706984,0.0010451586,0.00030445177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061940555,0.0009819841,0.0013949071,0.0019036244,0.00064776797,0.0018103549,0.0024161579,0.0019312791,0.0018095425],"category_scores_gemma":[0.0209706,0.00080064795,0.001415442,0.001837933,0.0027133361,0.0027961484,0.0029737472,0.002362173,0.0003197305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002936463,0.000036621663,0.00043149904,0.00011997926,0.000036216312,0.000049140308,0.00009496374,0.70300364,0.0008016208,0.27861837,0.00072552916,0.016053064],"study_design_scores_gemma":[0.00000348355,0.000008303733,0.000036001416,0.000007894679,0.0000034110153,0.000011378175,0.0000072755975,0.95935524,0.00016967174,0.040133446,0.00025806524,0.0000058246865],"about_ca_topic_score_codex":0.0036809738,"about_ca_topic_score_gemma":0.003533535,"teacher_disagreement_score":0.0061940555,"about_ca_system_score_codex":0.0015428646,"about_ca_system_score_gemma":0.0014676703,"threshold_uncertainty_score":0.0327577},"labels":[],"label_agreement":null},{"id":"W2908999823","doi":"10.1098/rspa.2018.0490","title":"Sparse low-rank separated representation models for learning from data","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Canada Research Chairs","keywords":"Coordinate descent; Convergence (economics); Representation (politics); Rank (graph theory); Algorithm; Convexity; Computer science; Mathematical optimization; Gradient descent; Sparse approximation; Stationary point; Least-squares function approximation; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.03271240151248105,"score_gpt":0.2511551335887598,"score_spread":0.21844273207627873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908999823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032239514,0.00021181637,0.9957228,0.00022834787,0.000018183744,0.00001586677,0.00005716683,0.00007750799,0.00044427055],"genre_scores_gemma":[0.42688888,0.0018980134,0.56224304,0.0003863858,0.0003127753,0.0004019708,0.00088758365,0.00011232645,0.006868992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991968,0.00037583735,0.000027198577,0.00015342984,0.00019367733,0.00005303784],"domain_scores_gemma":[0.9983152,0.0010768468,0.00020087359,0.00019542052,0.00016558952,0.00004611091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015331067,0.000988992,0.0011181042,0.00057659,0.0002766354,0.0010004668,0.0015010358,0.001516288,0.0016559473],"category_scores_gemma":[0.0049785716,0.00044338938,0.0008015781,0.0011720513,0.0012414941,0.0017097864,0.0011946002,0.0021517498,0.0006877217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067290246,0.00005777081,0.000386723,0.00019026053,0.00005776122,0.00008071241,0.000086212414,0.85020113,0.0028779693,0.1039781,0.0019146187,0.040101446],"study_design_scores_gemma":[0.000004732198,0.000022171973,0.00004165405,0.0000060540046,0.00000415519,0.000013134305,0.0000058549476,0.9788391,0.00029808137,0.02018468,0.0005750978,0.0000054394177],"about_ca_topic_score_codex":0.0023009465,"about_ca_topic_score_gemma":0.0022137065,"teacher_disagreement_score":0.0023009465,"about_ca_system_score_codex":0.0006709961,"about_ca_system_score_gemma":0.00095598097,"threshold_uncertainty_score":0.00810796},"labels":[],"label_agreement":null},{"id":"W2912649304","doi":"10.48550/arxiv.1901.06764","title":"Iterative Refinement for $\\ell_p$-norm Regression","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Inverse; Omega; Norm (philosophy); Bounded function; Dimension (graph theory); Regular polygon; Graph; Discrete mathematics; Algorithm; Physics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.07907266538738619,"score_gpt":0.1954417377210566,"score_spread":0.11636907233367041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912649304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076854,0.000098858545,0.99660337,0.00013276078,0.000055027365,0.00002750517,0.00005180714,0.0007267285,0.001535377],"genre_scores_gemma":[0.028210549,0.00017727537,0.9641653,0.0002660891,0.00008992442,0.00027923772,0.00043349832,0.0010664684,0.005311624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974934,0.00079764036,0.0001158044,0.00044182458,0.0008764251,0.0002749695],"domain_scores_gemma":[0.99614125,0.0020101294,0.00018681849,0.00059624255,0.0009041606,0.00016144851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035281747,0.0024639491,0.0016546461,0.0011755386,0.000768817,0.0015870446,0.003703792,0.0026324738,0.013109336],"category_scores_gemma":[0.015593225,0.00083952036,0.0022090436,0.0012754587,0.0018656105,0.00260626,0.0041092266,0.006538032,0.0076207994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043857837,0.00019170908,0.0013048736,0.00055634393,0.00013936522,0.00025563146,0.000340613,0.48655567,0.009530267,0.1561901,0.034509886,0.30998692],"study_design_scores_gemma":[0.000026772595,0.000024501183,0.00006490128,0.000025500827,0.000007731773,0.000032445394,0.000021308344,0.9707927,0.0021642903,0.021052191,0.005771658,0.000015918946],"about_ca_topic_score_codex":0.009365946,"about_ca_topic_score_gemma":0.012576679,"teacher_disagreement_score":0.013109336,"about_ca_system_score_codex":0.0014024536,"about_ca_system_score_gemma":0.0025917669,"threshold_uncertainty_score":0.04385507},"labels":[],"label_agreement":null},{"id":"W2912745458","doi":"10.1137/19m130858x","title":"Dual Space Preconditioning for Gradient Descent","year":2021,"lang":"en","type":"preprint","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Laboratory; Army Research Office; Engineering and Physical Sciences Research Council; Ministry of Defence; Natural Sciences and Engineering Research Council of Canada; European Commission; Institute for Advanced Studies in the Humanities, University of Edinburgh; DeepMind; Seventh Framework Programme","keywords":"Convexity; Lipschitz continuity; Mathematics; Smoothness; Stochastic gradient descent; Gradient descent; Applied mathematics; Convex function; Gradient method; Nonlinear conjugate gradient method; Bregman divergence; Norm (philosophy); Proximal Gradient Methods; Mathematical analysis; Mathematical optimization; Regular polygon; Computer science; Geometry","score_opus":0.020903183592654785,"score_gpt":0.24351017904979919,"score_spread":0.2226069954571444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912745458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027518105,0.00008777287,0.9943817,0.00012782,0.000051497387,0.000019674066,0.000032464442,0.00018395812,0.0023632525],"genre_scores_gemma":[0.24169056,0.000509805,0.74357337,0.0004539288,0.00022975642,0.0003166529,0.0003287326,0.00064194686,0.012255195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.00026137824,0.000030176989,0.000099221135,0.00025763802,0.00006924757],"domain_scores_gemma":[0.99918073,0.00026172525,0.000073964155,0.00019782718,0.0002093309,0.00007641865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010348024,0.00081913284,0.0008250181,0.0005108307,0.0004798355,0.0009081197,0.00060518534,0.00091434666,0.005052785],"category_scores_gemma":[0.0040929243,0.00034795085,0.00057792815,0.00052415853,0.0012766777,0.0010431758,0.002138655,0.0024670276,0.0015318394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027504406,0.00009395497,0.000699453,0.00029686958,0.00006595174,0.00023974114,0.00020859476,0.25501946,0.03477192,0.5544465,0.010352537,0.1435299],"study_design_scores_gemma":[0.00002527362,0.00005714819,0.00013979447,0.00002208592,0.0000074821346,0.00006885773,0.000014146302,0.9226864,0.0072493446,0.061532497,0.008182159,0.000014757447],"about_ca_topic_score_codex":0.0011434784,"about_ca_topic_score_gemma":0.0013857142,"teacher_disagreement_score":0.005052785,"about_ca_system_score_codex":0.0005620768,"about_ca_system_score_gemma":0.0010961916,"threshold_uncertainty_score":0.016903222},"labels":[],"label_agreement":null},{"id":"W2913966198","doi":"10.1016/j.sigpro.2019.02.010","title":"Accelerated stochastic gradient descent with step size selection rules","year":2019,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Stochastic gradient descent; PROX; Computer science; Gradient descent; Gradient method; Convergence (economics); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Artificial neural network; Chemistry","score_opus":0.013422164220208008,"score_gpt":0.215019254110561,"score_spread":0.201597089890353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913966198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036506613,0.00008931842,0.99465513,0.00012141177,0.00009179047,0.00004381177,0.000028024351,0.00030265693,0.0010172438],"genre_scores_gemma":[0.16383074,0.00025717364,0.8242891,0.00032591994,0.0002938242,0.00050187926,0.00028434373,0.00040964404,0.009807413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.00037406757,0.00004988766,0.000111830326,0.0004315131,0.00006099071],"domain_scores_gemma":[0.9964592,0.0020859744,0.00017478563,0.0003441118,0.00077765406,0.00015824393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022288605,0.0010135198,0.0014771221,0.00070117373,0.00042627595,0.00084202114,0.0017414511,0.0019907325,0.00446333],"category_scores_gemma":[0.009086574,0.0008505856,0.00064375676,0.00073166407,0.0008906378,0.0010136869,0.0013251164,0.0021627953,0.0015734342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023963596,0.00020786961,0.0006165532,0.00015391692,0.0001015674,0.00014603126,0.000047671096,0.7672255,0.0059845243,0.05892291,0.009463331,0.1568905],"study_design_scores_gemma":[0.000016166387,0.000015935919,0.000031153297,0.0000032856321,0.0000032052137,0.0000114366585,8.177665e-7,0.99670225,0.00038403648,0.0024101199,0.0004187286,0.0000028618515],"about_ca_topic_score_codex":0.0021104529,"about_ca_topic_score_gemma":0.003872563,"teacher_disagreement_score":0.00446333,"about_ca_system_score_codex":0.0004400025,"about_ca_system_score_gemma":0.0014610105,"threshold_uncertainty_score":0.014931381},"labels":[],"label_agreement":null},{"id":"W2914773211","doi":"10.1093/imanum/dry069","title":"An exact penalty method for semidefinite-box-constrained low-rank matrix optimization problems","year":2018,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Penalty method; Mathematics; Mathematical optimization; Rank (graph theory); Lipschitz continuity; Matrix (chemical analysis); Constraint (computer-aided design); Convergence (economics); Differentiable function; Positive-definite matrix; Hessian matrix; Constrained optimization; Stationary point; Optimization problem; Semidefinite programming; Applied mathematics; Eigenvalues and eigenvectors; Combinatorics; Mathematical analysis","score_opus":0.014904344742179368,"score_gpt":0.3048581835835562,"score_spread":0.2899538388413768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914773211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033285436,0.000062506035,0.9952524,0.00010420151,0.000026678395,0.000020852867,0.000016871552,0.00007720762,0.0011107272],"genre_scores_gemma":[0.22135134,0.00022344968,0.771838,0.00019875639,0.000079459685,0.000250813,0.00016540158,0.0002148065,0.005677975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993736,0.00029493638,0.000020877702,0.000064351596,0.0002063086,0.000039965955],"domain_scores_gemma":[0.99866056,0.0008630467,0.000086873,0.00011139257,0.0002050811,0.00007301563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015083611,0.0008557575,0.0009312868,0.00044375623,0.000319234,0.00067504693,0.00086352474,0.00123619,0.0034008455],"category_scores_gemma":[0.0034106257,0.00031533136,0.00040633752,0.0004905134,0.0010382843,0.0011393017,0.0012303647,0.0015560694,0.0007032084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012449035,0.00008026105,0.00025471053,0.00018750198,0.000028453911,0.000115273964,0.00005829212,0.86559236,0.0058930335,0.07868994,0.0027447918,0.04623087],"study_design_scores_gemma":[0.0000057175575,0.000014043739,0.000014589689,0.0000032541893,7.9290425e-7,0.000009282114,0.0000025135826,0.99587655,0.0003078834,0.00332798,0.0004352031,0.000002261214],"about_ca_topic_score_codex":0.0012602468,"about_ca_topic_score_gemma":0.0014231062,"teacher_disagreement_score":0.0034008455,"about_ca_system_score_codex":0.00047354,"about_ca_system_score_gemma":0.0011064232,"threshold_uncertainty_score":0.011376917},"labels":[],"label_agreement":null},{"id":"W2915360983","doi":"10.1109/isspit.2018.8642662","title":"Improvement of Recovery in Segmentation-Based Parallel Compressive Sensing","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Kronecker delta; Kronecker product; Compressed sensing; Segmentation; Computer science; Computational complexity theory; Reduction (mathematics); Similarity (geometry); Algorithm; Artificial intelligence; SIGNAL (programming language); Pattern recognition (psychology); Mathematics; Image (mathematics); Physics; Geometry","score_opus":0.012400880473334265,"score_gpt":0.23565570563863153,"score_spread":0.22325482516529727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915360983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046705298,0.00036951996,0.9500428,0.00017220054,0.000048057,0.000040992472,0.000053050935,0.00066241267,0.0019057001],"genre_scores_gemma":[0.426829,0.00056930893,0.5692491,0.0001375349,0.00005124836,0.00005211581,0.0003029572,0.00010667313,0.00270211],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994143,0.0001179361,0.000032954413,0.00012266934,0.0002680201,0.000044025768],"domain_scores_gemma":[0.99891627,0.00038487135,0.00013838336,0.000259472,0.00026688538,0.0000341714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076095626,0.0006467745,0.0005165654,0.0006146286,0.00025468812,0.00040583254,0.0005584893,0.00071549014,0.0010907245],"category_scores_gemma":[0.0025982426,0.00029863362,0.0004084732,0.00066966924,0.0006486449,0.0012127709,0.00073013274,0.0005801951,0.0004797374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006886173,0.00018801769,0.0010215981,0.000264935,0.000072153955,0.00029423778,0.00025910945,0.23468082,0.32736582,0.011045738,0.0017678243,0.42235118],"study_design_scores_gemma":[0.000021257856,0.0002613107,0.0007821227,0.000014766003,0.00002607343,0.00042568578,0.000041301373,0.90025395,0.09170155,0.0031634248,0.0032685525,0.00003994242],"about_ca_topic_score_codex":0.0016157759,"about_ca_topic_score_gemma":0.0016907952,"teacher_disagreement_score":0.0016157759,"about_ca_system_score_codex":0.0002916249,"about_ca_system_score_gemma":0.0005784012,"threshold_uncertainty_score":0.0040243864},"labels":[],"label_agreement":null},{"id":"W2915516423","doi":"10.1080/03155986.2018.1533774","title":"Generalized maximum-entropy sampling","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bounding overwatch; Mathematics; Principle of maximum entropy; Upper and lower bounds; Entropy (arrow of time); Mathematical optimization; Sampling (signal processing); Applied mathematics; Computer science; Statistics; Artificial intelligence; Mathematical analysis; Physics","score_opus":0.06374247505956429,"score_gpt":0.32921781729106125,"score_spread":0.26547534223149694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915516423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051409667,0.00049705344,0.9896678,0.00023571013,0.0000784262,0.0000769338,0.00018268038,0.00012173758,0.003998775],"genre_scores_gemma":[0.5101573,0.001793165,0.47683263,0.0008222887,0.00053238415,0.000586878,0.0011149204,0.00024212518,0.007918292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980071,0.0009619415,0.00008449321,0.0002891469,0.00047333993,0.0001839127],"domain_scores_gemma":[0.99701834,0.0019318903,0.00016817535,0.00043148414,0.00030213041,0.00014802834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327211,0.0012272466,0.0016525367,0.0009809966,0.00050255033,0.0015937323,0.001588725,0.0013808373,0.0045531476],"category_scores_gemma":[0.009975608,0.0004989797,0.0008012723,0.0014956055,0.0014959496,0.0023414432,0.0027769606,0.0013869136,0.00061305834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022644634,0.000064460124,0.0007326464,0.00036494152,0.00010387291,0.00022776469,0.00009596803,0.54006594,0.0029525005,0.35507452,0.006236472,0.09385444],"study_design_scores_gemma":[0.00002765472,0.000033323842,0.00013264698,0.00003238855,0.000009982442,0.000056499994,0.0000133778985,0.85169554,0.00079121295,0.14443123,0.0027611475,0.000014987965],"about_ca_topic_score_codex":0.0015662281,"about_ca_topic_score_gemma":0.0015779751,"teacher_disagreement_score":0.0045531476,"about_ca_system_score_codex":0.00080087996,"about_ca_system_score_gemma":0.0014137318,"threshold_uncertainty_score":0.015231788},"labels":[],"label_agreement":null},{"id":"W2915691082","doi":"10.1109/tpami.2019.2901688","title":"Logistic Regression Confined by Cardinality-Constrained Sample and Feature Selection","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); Simon Fraser University","funders":"National Heart, Lung, and Blood Institute; National Institute of Mental Health; National Institute on Alcohol Abuse and Alcoholism; National Institute on Aging; National Institutes of Health","keywords":"Artificial intelligence; Computer science; Coordinate descent; Machine learning; Feature selection; Pattern recognition (psychology); Cardinality (data modeling); Overfitting; Data mining; Artificial neural network","score_opus":0.017573317862849845,"score_gpt":0.25874784369549,"score_spread":0.24117452583264012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915691082","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009910046,0.00045136054,0.9869784,0.00075372786,0.000048938055,0.00006451216,0.00026585613,0.0006106107,0.000916484],"genre_scores_gemma":[0.5468833,0.0014738897,0.4331962,0.0011532519,0.0007334906,0.0011419475,0.0031132633,0.00074342743,0.011561293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941533,0.0032695816,0.00025052665,0.0010038456,0.0008847816,0.0004379032],"domain_scores_gemma":[0.9854219,0.010305359,0.0009649966,0.0017969994,0.001155612,0.0003550962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008479552,0.0017771858,0.003282008,0.0011777349,0.000659371,0.0016671718,0.0038300902,0.0025262523,0.003764176],"category_scores_gemma":[0.030034136,0.0014889607,0.0020580315,0.0018946806,0.0020386113,0.0036100706,0.0039117346,0.0041128597,0.0018483688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009001334,0.00018354098,0.0036083024,0.0003281124,0.0002468773,0.00052862446,0.00018246988,0.7815795,0.0035736351,0.06902,0.0113960905,0.1284528],"study_design_scores_gemma":[0.00002313953,0.00002153288,0.00014193023,0.00001153543,0.000010106618,0.000035919686,0.0000056096496,0.9867931,0.00052611664,0.011745028,0.0006754148,0.000010536697],"about_ca_topic_score_codex":0.003843922,"about_ca_topic_score_gemma":0.0027789883,"teacher_disagreement_score":0.008479552,"about_ca_system_score_codex":0.0017419378,"about_ca_system_score_gemma":0.0018791497,"threshold_uncertainty_score":0.044844687},"labels":[],"label_agreement":null},{"id":"W2918348138","doi":"10.1109/isit.2019.8849316","title":"Asymptotics of MAP Inference in Deep Networks","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; York University; National Science Foundation","keywords":"Inference; Computer science; Maximum a posteriori estimation; A priori and a posteriori; Prior probability; Limit (mathematics); Algorithm; Generative grammar; Artificial intelligence; Mathematics; Bayesian probability; Maximum likelihood; Statistics","score_opus":0.014727006213552966,"score_gpt":0.2396521619738337,"score_spread":0.22492515576028074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918348138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018321835,0.0015703154,0.971512,0.0016379299,0.000100942845,0.000035246747,0.00023217598,0.00044725998,0.0061422703],"genre_scores_gemma":[0.7886316,0.005806055,0.18722115,0.0012943364,0.0008687975,0.00063136045,0.0012942537,0.0007998845,0.013452637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978599,0.000904745,0.00008876265,0.0003364122,0.0006054551,0.00020468971],"domain_scores_gemma":[0.96526384,0.028278459,0.0016792415,0.0019238779,0.0022762904,0.0005783038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008072717,0.0015547089,0.001293973,0.0017714031,0.00076141505,0.0019350188,0.002475989,0.0017949415,0.004629002],"category_scores_gemma":[0.06520455,0.0011156241,0.0010649186,0.001190906,0.0046960805,0.005876866,0.0043678284,0.0047711087,0.00082295475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017104263,0.00005638204,0.0022938645,0.00042594704,0.00010983098,0.00019030982,0.00021293199,0.4264033,0.0024262664,0.5391241,0.0044188034,0.024167294],"study_design_scores_gemma":[0.000011514661,0.000022827291,0.0004829564,0.00007378431,0.000013873552,0.000051851348,0.000031104355,0.77679044,0.0006082145,0.22100659,0.00088833895,0.000018567804],"about_ca_topic_score_codex":0.003644075,"about_ca_topic_score_gemma":0.002851981,"teacher_disagreement_score":0.008072717,"about_ca_system_score_codex":0.0022768788,"about_ca_system_score_gemma":0.0016713452,"threshold_uncertainty_score":0.042693138},"labels":[],"label_agreement":null},{"id":"W2921108005","doi":"10.1371/journal.pone.0211463","title":"A constrained singular value decomposition method that integrates sparsity and orthogonality","year":2019,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Baycrest Hospital","funders":"H2020 Marie Skłodowska-Curie Actions; Agence Nationale de la Recherche; European Commission","keywords":"Orthogonality; Singular value decomposition; Projection (relational algebra); Intersection (aeronautics); Convergence (economics); Singular value; Mathematics; Algorithm; Constraint (computer-aided design); Set (abstract data type); Computer science; Regular polygon; Mathematical optimization","score_opus":0.03608948695112748,"score_gpt":0.24882926531208985,"score_spread":0.21273977836096236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921108005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007628715,0.000040594838,0.9987269,0.00003778795,0.000021594902,0.000012057189,0.000016088821,0.00007560932,0.00030649532],"genre_scores_gemma":[0.031057801,0.0001880385,0.96668667,0.00008175832,0.00006863258,0.000085773725,0.0001825419,0.00012165632,0.0015271568],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991066,0.00022804957,0.000049326423,0.00017583156,0.00039154518,0.00004876133],"domain_scores_gemma":[0.99899024,0.00039325794,0.00009501371,0.0001781215,0.00027260554,0.00007070745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011364325,0.0008216579,0.00090958056,0.00095073227,0.00038937197,0.0009619595,0.0010681215,0.0010142762,0.0024515593],"category_scores_gemma":[0.003317256,0.00047024718,0.0009011423,0.0010747965,0.000898431,0.001132178,0.0012432815,0.0017280811,0.0012573944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001244805,0.00013656655,0.0010736107,0.00033968175,0.00017681488,0.00020356101,0.00014516417,0.30098814,0.06972465,0.111172855,0.008259626,0.5076549],"study_design_scores_gemma":[0.000015672484,0.000045826062,0.00018572906,0.000019349369,0.000015183035,0.0001508628,0.000014256939,0.9705868,0.00795832,0.014484224,0.006498939,0.000024744682],"about_ca_topic_score_codex":0.0015644983,"about_ca_topic_score_gemma":0.0019083305,"teacher_disagreement_score":0.0024515593,"about_ca_system_score_codex":0.00039148418,"about_ca_system_score_gemma":0.001158452,"threshold_uncertainty_score":0.008201301},"labels":[],"label_agreement":null},{"id":"W2921619216","doi":"10.1109/siva.2018.8660985","title":"Compressive Sensing-Based Underground Channel Estimation Operating in Millimetter-Wave Band","year":2018,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Channel (broadcasting); Compressed sensing; MIMO; Computer science; Estimator; Benchmark (surveying); Bit error rate; Extremely high frequency; Electronic engineering; Frame (networking); Telecommunications; Engineering; Algorithm; Geology; Mathematics","score_opus":0.025277151251450292,"score_gpt":0.2382991501228806,"score_spread":0.2130219988714303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921619216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22311048,0.0001662689,0.77389807,0.00016323903,0.000030047784,0.000029345907,0.00010156876,0.00035246857,0.0021485584],"genre_scores_gemma":[0.8883522,0.0001668331,0.110235274,0.000043883523,0.00002392906,0.000026762396,0.00014218534,0.000018728619,0.0009901177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998217,0.00004561636,0.000007035733,0.000029726645,0.00007438593,0.000021594939],"domain_scores_gemma":[0.9995554,0.00022110637,0.00007891132,0.00006004791,0.000069262394,0.000015264837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027012764,0.00029919017,0.00027677283,0.00022362544,0.00013268302,0.00022519442,0.00028431538,0.0003167436,0.0004928612],"category_scores_gemma":[0.0011641702,0.0001085761,0.00015657365,0.0002643603,0.00032992178,0.0005314355,0.00034437663,0.0003052459,0.00013996614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000477758,0.00011673279,0.0038239378,0.00016398828,0.000058985308,0.00019324903,0.0002137724,0.6395436,0.1549205,0.008703898,0.00096137676,0.19082224],"study_design_scores_gemma":[0.000008224344,0.00008316027,0.0010129524,0.0000059163654,0.0000062495355,0.000070891554,0.000027626465,0.97287107,0.024599643,0.0009252658,0.00037683357,0.0000122058445],"about_ca_topic_score_codex":0.0015762676,"about_ca_topic_score_gemma":0.0019390122,"teacher_disagreement_score":0.0015762676,"about_ca_system_score_codex":0.00012761819,"about_ca_system_score_gemma":0.00034262435,"threshold_uncertainty_score":0.0031341314},"labels":[],"label_agreement":null},{"id":"W2925265835","doi":"10.1093/gji/ggz156","title":"Inversion using spatially variable mixed ℓp norms","year":2019,"lang":"en","type":"article","venue":"Geophysical Journal International","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Inverse theory; Geology; Inversion (geology); Variable (mathematics); Geodesy; Seismology; Geophysics; Mathematics; Mathematical analysis; Tectonics","score_opus":0.010196777169685643,"score_gpt":0.21730147082870593,"score_spread":0.2071046936590203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925265835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054416326,0.00005649144,0.9926224,0.00011391817,0.000025532741,0.000018970995,0.000025698566,0.00019458577,0.001500783],"genre_scores_gemma":[0.100759715,0.00012570835,0.8963185,0.000117042386,0.000032587286,0.00012262264,0.00014541122,0.00021608308,0.0021622821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990403,0.00032947218,0.00006248781,0.00014100714,0.00037885687,0.000047822505],"domain_scores_gemma":[0.9981172,0.0009092146,0.00017124554,0.00019374354,0.0005524669,0.00005624328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021318782,0.00085436064,0.00053539634,0.00087715144,0.00044260794,0.0017364027,0.0012302961,0.0011861026,0.0018457131],"category_scores_gemma":[0.005785466,0.0004918414,0.0008442517,0.000790093,0.0011738223,0.0019421921,0.0018069475,0.0012991248,0.0006329969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088659486,0.000051277148,0.00085205154,0.0001704368,0.00006431165,0.00012921794,0.000278908,0.75125027,0.025613567,0.12332168,0.001850989,0.09632859],"study_design_scores_gemma":[0.000008946933,0.000018163602,0.00007678644,0.000012952943,0.0000037245852,0.000037308942,0.000016700747,0.9730204,0.0044965167,0.020159079,0.0021333953,0.00001605014],"about_ca_topic_score_codex":0.0022454113,"about_ca_topic_score_gemma":0.0031185613,"teacher_disagreement_score":0.0022454113,"about_ca_system_score_codex":0.00075291004,"about_ca_system_score_gemma":0.0011012204,"threshold_uncertainty_score":0.011274576},"labels":[],"label_agreement":null},{"id":"W2925318425","doi":"10.4153/s0008439519000134","title":"Perturbation Analysis of Orthogonal Least Squares","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Safety Academic Fund","keywords":"Mathematics; Unicode; Restricted isometry property; Combinatorics; Isometry (Riemannian geometry); Algorithm; Discrete mathematics; Compressed sensing; Mathematical analysis","score_opus":0.005490893238237236,"score_gpt":0.1798597274770891,"score_spread":0.17436883423885186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925318425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012911542,0.00031608326,0.9825302,0.00031800292,0.00006852391,0.000025373127,0.000059564136,0.0001656601,0.0036050142],"genre_scores_gemma":[0.8564456,0.0010399106,0.13427046,0.0003177602,0.00025244788,0.0001568301,0.00035353974,0.0002168195,0.006946497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981522,0.00074645283,0.0000496409,0.00022823579,0.0007196104,0.00010385911],"domain_scores_gemma":[0.9959785,0.002451939,0.00037287455,0.00032714132,0.00077312335,0.00009628115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630402,0.0009851251,0.0008568354,0.000912136,0.00043873827,0.0008159276,0.0008087372,0.0010182962,0.0020129087],"category_scores_gemma":[0.008904888,0.00049021916,0.0006785551,0.00076191046,0.0016510503,0.0013539161,0.0016022109,0.001774664,0.00050222204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015139919,0.00002486522,0.00094937964,0.00011360316,0.000087205044,0.00017233961,0.00007819299,0.8480521,0.005636224,0.119279616,0.0018673592,0.02358782],"study_design_scores_gemma":[0.0000024025899,0.000010322394,0.000091578724,0.000005141068,0.0000028227123,0.000015607844,0.000005034976,0.9888915,0.0005736455,0.010025864,0.0003706571,0.0000055123796],"about_ca_topic_score_codex":0.0024729148,"about_ca_topic_score_gemma":0.0007848439,"teacher_disagreement_score":0.0024729148,"about_ca_system_score_codex":0.000995808,"about_ca_system_score_gemma":0.0005952474,"threshold_uncertainty_score":0.0086224675},"labels":[],"label_agreement":null},{"id":"W2927405063","doi":"10.3390/e21040348","title":"Robust Inference after Random Projections via Hellinger Distance for Location-Scale Family","year":2019,"lang":"en","type":"article","venue":"Entropy","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Hellinger distance; Outlier; Robustness (evolution); Computer science; Inference; Data mining; Random projection; Dimension (graph theory); Artificial intelligence; Mathematics; Statistics","score_opus":0.013199983004612175,"score_gpt":0.21985154719817201,"score_spread":0.20665156419355984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2927405063","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007297478,0.00020376618,0.99156404,0.00017938898,0.000019310204,0.000018995479,0.00007137711,0.00007708092,0.00056857674],"genre_scores_gemma":[0.5799667,0.0022412888,0.40959355,0.00035739958,0.00033072033,0.0002774751,0.0011034345,0.00022764696,0.0059017125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982322,0.0007652714,0.00007570026,0.00038626153,0.00043067624,0.0001100204],"domain_scores_gemma":[0.9902805,0.0075509152,0.00068120356,0.0006808132,0.0005675105,0.00023906543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004609622,0.0010529867,0.0011831687,0.0013234579,0.0005020543,0.0013318666,0.0012853949,0.0011217193,0.0019740486],"category_scores_gemma":[0.017946728,0.00061264366,0.0010339145,0.0009704655,0.002630544,0.0032701462,0.0024337382,0.0025440594,0.0003662137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016650761,0.00006132551,0.0016163788,0.00025916498,0.00016756183,0.00023031427,0.00020464523,0.6676093,0.0041999486,0.28500995,0.0021215563,0.03835333],"study_design_scores_gemma":[0.0000054343427,0.000023974195,0.00023353189,0.000011466593,0.000007483938,0.000039240193,0.0000148402605,0.9341807,0.00091359956,0.06410938,0.00044270686,0.000017747618],"about_ca_topic_score_codex":0.002304338,"about_ca_topic_score_gemma":0.0015686444,"teacher_disagreement_score":0.004609622,"about_ca_system_score_codex":0.0012153907,"about_ca_system_score_gemma":0.001557387,"threshold_uncertainty_score":0.02437836},"labels":[],"label_agreement":null},{"id":"W2928097142","doi":"10.48550/arxiv.1810.11968","title":"Sensitivity of $\\ell_{1}$ minimization to parameter choice","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Minimax; Lasso (programming language); Regularization (linguistics); Stability (learning theory); Sensitivity (control systems); Minification; Computer science; Algorithm; Mathematical optimization; Value (mathematics); Mathematics; Applied mathematics; Machine learning; Artificial intelligence","score_opus":0.06164107708511789,"score_gpt":0.19195092259161559,"score_spread":0.1303098455064977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928097142","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31292805,0.0031576564,0.64232045,0.0108573185,0.00033508625,0.00029859293,0.00097042206,0.001451934,0.027680427],"genre_scores_gemma":[0.91245943,0.00093552086,0.08098688,0.0013441048,0.00008089262,0.00029708497,0.0006957066,0.0005801922,0.0026201825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396014,0.0033046561,0.00027808826,0.00090697344,0.0010470933,0.000503057],"domain_scores_gemma":[0.923884,0.0644356,0.0033603031,0.0046677087,0.0026564219,0.0009958985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016371973,0.0013834521,0.0013469536,0.0011947413,0.0010283167,0.0024020793,0.0015367519,0.002891908,0.002525111],"category_scores_gemma":[0.103856064,0.00077259744,0.00084586703,0.00080209196,0.0036962316,0.0029273261,0.0029552951,0.0041610976,0.00055680034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072267855,0.00019891426,0.008264968,0.00048280563,0.00023403097,0.0003411207,0.0002940999,0.8601535,0.0068717804,0.084456295,0.0072563644,0.03072346],"study_design_scores_gemma":[0.000050758696,0.0001291847,0.0018254503,0.00020376629,0.000027867636,0.00017105088,0.0002080152,0.9270673,0.005213355,0.063205026,0.0018417557,0.000056448782],"about_ca_topic_score_codex":0.0036488324,"about_ca_topic_score_gemma":0.0024222028,"teacher_disagreement_score":0.016371973,"about_ca_system_score_codex":0.00159633,"about_ca_system_score_gemma":0.0017105833,"threshold_uncertainty_score":0.08658433},"labels":[],"label_agreement":null},{"id":"W2936210465","doi":"10.1049/el.2014.3788","title":"interview","year":2014,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"MIMO; Duplex (building); Computer science; Multi-user MIMO; Telecommunications link; Wireless; Base station; Telecommunications; 3G MIMO; Antenna array; Signal processing; Antenna (radio); Electronic engineering; Channel (broadcasting); Real-time computing; Engineering","score_opus":0.007097359320599576,"score_gpt":0.1884096548654168,"score_spread":0.18131229554481723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936210465","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081734,0.006097809,0.001492609,0.5404071,0.04031466,0.00050007395,0.008090169,0.00046470962,0.39445943],"genre_scores_gemma":[0.025079038,0.0039030435,0.000708594,0.31632712,0.004022865,0.0006597526,0.002115475,0.00025297052,0.6469312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983038,0.0005169447,0.00006442128,0.00020885117,0.00035752635,0.0005485237],"domain_scores_gemma":[0.9953561,0.0007860644,0.00021554582,0.00014852895,0.0018039345,0.0016898593],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020978246,0.00057185395,0.0005874321,0.0008209,0.0049307533,0.003197856,0.0011320512,0.0047479477,0.32007876],"category_scores_gemma":[0.011215461,0.00032262286,0.00043415037,0.0012113693,0.00093774474,0.004043036,0.0025634384,0.0068331873,0.15202759],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011973263,0.00001386013,0.00036629062,0.000034022298,0.0000011569186,0.00009915072,0.00041077475,0.000008508666,0.00002573166,0.0015089381,0.98831743,0.009202085],"study_design_scores_gemma":[0.0000055708515,0.000010868178,0.0006018925,0.00008481603,0.0000010425379,0.00022824867,0.0030393724,0.000023428318,0.000024389354,0.0005076652,0.9954659,0.0000068479526],"about_ca_topic_score_codex":0.0059499945,"about_ca_topic_score_gemma":0.010001457,"teacher_disagreement_score":0.67992127,"about_ca_system_score_codex":0.0028285729,"about_ca_system_score_gemma":0.0043024407,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2937874362","doi":"10.1007/978-3-030-21803-4_32","title":"Low-Rank Matrix Recovery with Ky Fan 2-k-Norm","year":2019,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matrix norm; Rank (graph theory); Mathematics; Matrix (chemical analysis); Norm (philosophy); Combinatorics; Philosophy; Materials science; Epistemology; Physics; Composite material; Eigenvalues and eigenvectors","score_opus":0.009048074065528535,"score_gpt":0.23017219768121133,"score_spread":0.2211241236156828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937874362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012826928,0.00078328274,0.9873745,0.0002561997,0.00015372018,0.000022145217,0.00016850609,0.00041821753,0.009540681],"genre_scores_gemma":[0.057329565,0.0026391395,0.897638,0.00028638632,0.00032062386,0.00009624455,0.0010241867,0.0003812184,0.040284585],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996105,0.0000837645,0.00002134342,0.00006502454,0.00020005413,0.000019301197],"domain_scores_gemma":[0.9996518,0.00013417061,0.00002702705,0.00007639564,0.000096824064,0.000013701138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944133,0.00101953,0.00060865254,0.00067846687,0.00031261134,0.0012236341,0.0006374926,0.00093690795,0.009333994],"category_scores_gemma":[0.0017502751,0.00028832728,0.00036298903,0.0011006949,0.0008357872,0.0017208626,0.0011444412,0.0016499198,0.00578883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017994338,0.00006490175,0.00018439432,0.0004603033,0.000043007913,0.00012722921,0.00013581324,0.07369065,0.021363182,0.20375249,0.04405676,0.65594137],"study_design_scores_gemma":[0.000026506767,0.00010773506,0.000349392,0.00011592517,0.00001861849,0.00059108954,0.00008759149,0.7097112,0.02429794,0.17377807,0.09085252,0.000063442145],"about_ca_topic_score_codex":0.000890909,"about_ca_topic_score_gemma":0.0014862863,"teacher_disagreement_score":0.009333994,"about_ca_system_score_codex":0.0002749122,"about_ca_system_score_gemma":0.0005800107,"threshold_uncertainty_score":0.031225324},"labels":[],"label_agreement":null},{"id":"W2941487973","doi":"10.1016/j.jat.2019.04.005","title":"On the strong restricted isometry property of Bernoulli random matrices","year":2019,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Restricted isometry property; Bernoulli's principle; Mathematics; Random matrix; Bernoulli process; Gaussian; Combinatorics; Random field; Matrix (chemical analysis); Lemma (botany); Isometry (Riemannian geometry); Discrete mathematics; Compressed sensing; Pure mathematics; Algorithm; Statistics","score_opus":0.010423243067972618,"score_gpt":0.21224626412518505,"score_spread":0.20182302105721242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941487973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05773917,0.0010154074,0.92334735,0.0019416054,0.00026110292,0.000054958768,0.00027630775,0.00014245014,0.015221685],"genre_scores_gemma":[0.85856646,0.004427133,0.11839121,0.0018405207,0.0022715922,0.00035138763,0.00082193513,0.00031254283,0.013017138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554944,0.0021669846,0.00018970488,0.00064673414,0.0011279895,0.0003191389],"domain_scores_gemma":[0.9546304,0.035130113,0.002817528,0.003605189,0.002503828,0.0013130467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072558117,0.0016573172,0.0017229264,0.002481042,0.0008010521,0.0020779823,0.0018881434,0.0019841688,0.004674027],"category_scores_gemma":[0.0470689,0.0011368017,0.0011687875,0.0020312297,0.007832454,0.007202593,0.005214951,0.005369636,0.0009002506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015226298,0.00004359837,0.00070408644,0.00011255835,0.000038009555,0.00019981025,0.00022769657,0.027550245,0.0020546094,0.95739555,0.0017120759,0.0098094],"study_design_scores_gemma":[0.00003209518,0.00006990351,0.00046374527,0.000037832946,0.000014791581,0.00021660727,0.000059152957,0.1677837,0.0007303189,0.8292893,0.0012626008,0.000039958642],"about_ca_topic_score_codex":0.0010083099,"about_ca_topic_score_gemma":0.0006305342,"teacher_disagreement_score":0.0072558117,"about_ca_system_score_codex":0.0008453123,"about_ca_system_score_gemma":0.0011427908,"threshold_uncertainty_score":0.038372815},"labels":[],"label_agreement":null},{"id":"W2942678890","doi":"10.1016/j.image.2019.04.017","title":"DCSN-Cast: Deep compressed sensing network for wireless video multicast","year":2019,"lang":"en","type":"article","venue":"Signal Processing Image Communication","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Multicast; Computer science; Computer network; Convolutional neural network; Wireless network; Source-specific multicast; Network packet; Pragmatic General Multicast; Residual; Channel (broadcasting); Artificial intelligence; Real-time computing; Wireless; Algorithm; Telecommunications","score_opus":0.01615243014612783,"score_gpt":0.2501456071592302,"score_spread":0.23399317701310235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942678890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02514383,0.0007602149,0.9591337,0.0011426597,0.00039148753,0.00015233122,0.0008552912,0.001679947,0.010740551],"genre_scores_gemma":[0.556373,0.0008614338,0.42434773,0.0010774219,0.00029071816,0.00028655128,0.0014748827,0.00016640668,0.015121891],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997429,0.00006090382,0.000008214547,0.000039659153,0.00010174746,0.000046541903],"domain_scores_gemma":[0.99945205,0.00018541068,0.000036399913,0.00011936642,0.00014780353,0.000058888476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004741801,0.00047491968,0.00053778413,0.0005458627,0.0004520215,0.00055585784,0.0009898759,0.00063854177,0.0036650838],"category_scores_gemma":[0.0017417471,0.00020253862,0.00019656331,0.0006839725,0.00047215697,0.0007113822,0.0017247496,0.0012346439,0.0006526803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001417641,0.0003915393,0.0008314666,0.0002731889,0.00008040215,0.00023931418,0.00017635441,0.17094968,0.040246878,0.07851235,0.068853185,0.63802797],"study_design_scores_gemma":[0.00004746988,0.000106889165,0.00015398866,0.000018521678,0.000011587332,0.00008731288,0.00004220162,0.9633187,0.0065911342,0.020877514,0.008727402,0.000017250395],"about_ca_topic_score_codex":0.0033836258,"about_ca_topic_score_gemma":0.01174935,"teacher_disagreement_score":0.0036650838,"about_ca_system_score_codex":0.0006720883,"about_ca_system_score_gemma":0.001124021,"threshold_uncertainty_score":0.012260973},"labels":[],"label_agreement":null},{"id":"W2943463079","doi":"10.48550/arxiv.1904.13262","title":"Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Initialization; Regularization (linguistics); Parameterized complexity; Artificial neural network; Convergence (economics); Computer science; Applied mathematics; Rank (graph theory); Gradient descent; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.026129527770061976,"score_gpt":0.17476042108503817,"score_spread":0.1486308933149762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943463079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03269544,0.00041614033,0.962743,0.0006668051,0.000042023436,0.000022693303,0.0000473034,0.00026944326,0.003097249],"genre_scores_gemma":[0.84924924,0.0007685328,0.14103785,0.00023562663,0.00010946626,0.00014208391,0.00015508785,0.0002469883,0.008055147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953425,0.00022396262,0.00001705516,0.00007116801,0.000116778494,0.000036812944],"domain_scores_gemma":[0.9987318,0.000843796,0.00014102666,0.00012516332,0.00010229074,0.00005594144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010880807,0.00080721895,0.00051026425,0.00033609668,0.00022488931,0.000834531,0.00065221364,0.0010795641,0.0016166806],"category_scores_gemma":[0.006568654,0.0004367364,0.0003020718,0.0002991451,0.0016612166,0.0017012634,0.0013577065,0.001824685,0.00032004158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008103913,0.000042308293,0.00054487196,0.00014027313,0.000027227727,0.000102629536,0.00020381456,0.7670167,0.008916006,0.19681406,0.0015178965,0.024593249],"study_design_scores_gemma":[0.0000029142427,0.0000091059455,0.000042723812,0.000005094103,8.550007e-7,0.000008979171,0.0000044022013,0.9825799,0.00040153778,0.016732154,0.00020942278,0.0000029373182],"about_ca_topic_score_codex":0.0016946283,"about_ca_topic_score_gemma":0.0019226648,"teacher_disagreement_score":0.0016946283,"about_ca_system_score_codex":0.00077173696,"about_ca_system_score_gemma":0.00047563371,"threshold_uncertainty_score":0.005754411},"labels":[],"label_agreement":null},{"id":"W2943886563","doi":"10.1142/s0217595919400086","title":"An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Computation; Convergence (economics); Quadratic equation; Mathematical optimization; Applied mathematics; Regression; Algorithm; Gradient method; Computer science; Quadratic programming; Least-squares function approximation; Mathematics; Proximal Gradient Methods; Gradient descent; Artificial intelligence; Statistics","score_opus":0.12231513977116805,"score_gpt":0.402842736482826,"score_spread":0.28052759671165794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943886563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010834128,0.000099224846,0.99824345,0.000058184993,0.000025716614,0.000012584551,0.000011960124,0.000070561066,0.00039488744],"genre_scores_gemma":[0.11367348,0.0006021018,0.8816842,0.00018693897,0.00013109094,0.0001947021,0.00015744961,0.00012282647,0.003247222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993055,0.00026349942,0.00002543951,0.000106170366,0.00027435113,0.000024961055],"domain_scores_gemma":[0.9995419,0.00021547418,0.000050437582,0.00004483667,0.00012086764,0.000026638116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008474281,0.00092485244,0.0011128872,0.000451889,0.00029784994,0.0006732537,0.00094302243,0.001126993,0.002026387],"category_scores_gemma":[0.0026441037,0.00044200922,0.0005613169,0.00059378706,0.00075033505,0.0013163778,0.0011472749,0.0015525409,0.0006091566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014284538,0.00008326744,0.0004337305,0.0005113424,0.00010306306,0.00024473475,0.00014457454,0.6518097,0.016492253,0.07085271,0.004638794,0.25454298],"study_design_scores_gemma":[0.000007873734,0.00002977064,0.000044065044,0.000008534883,0.000004389892,0.00004367433,0.0000044207254,0.9937802,0.0012138054,0.003585782,0.0012695072,0.000007879915],"about_ca_topic_score_codex":0.0013017074,"about_ca_topic_score_gemma":0.0011691666,"teacher_disagreement_score":0.002026387,"about_ca_system_score_codex":0.0002915101,"about_ca_system_score_gemma":0.0010216341,"threshold_uncertainty_score":0.006778896},"labels":[],"label_agreement":null},{"id":"W2948135333","doi":"10.1080/03155986.2019.1607715","title":"The maximum feasible subset problem (maxFS) and applications","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Hyperplane; Mathematical optimization; Heuristic; Reduction (mathematics); Dimension (graph theory); Computer science; Range (aeronautics); Linear programming; Set (abstract data type); Mathematics; Matrix (chemical analysis); Algorithm; Combinatorics; Data mining","score_opus":0.031473165787052726,"score_gpt":0.2982395335485961,"score_spread":0.2667663677615434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948135333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00751347,0.04467996,0.89340436,0.0052237194,0.00072320935,0.00020305153,0.0005228447,0.00040192783,0.047327496],"genre_scores_gemma":[0.24547726,0.0842845,0.64191127,0.0018555328,0.0029981714,0.0008622316,0.0016838367,0.00048113664,0.020446064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973476,0.00093609816,0.0001429891,0.0005972032,0.00077747274,0.00019855611],"domain_scores_gemma":[0.9958133,0.0032846513,0.00023698706,0.00021079474,0.00032403786,0.00013021039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180713,0.0019451643,0.0017824984,0.0016684064,0.001159323,0.0027690714,0.0018886161,0.0027984362,0.010435967],"category_scores_gemma":[0.008579034,0.0008496111,0.0017806863,0.005617988,0.0021080954,0.0042588757,0.0024711064,0.00444257,0.0020965731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012880036,0.00020824585,0.0006954314,0.0015311043,0.00009586803,0.00030152654,0.00026035067,0.31536224,0.0010430128,0.37044308,0.03691456,0.27301574],"study_design_scores_gemma":[0.00003989472,0.00011319646,0.00035169063,0.00044631478,0.00002891065,0.00043252748,0.00021575326,0.382625,0.00082588015,0.53753793,0.077327594,0.000055286793],"about_ca_topic_score_codex":0.0027562918,"about_ca_topic_score_gemma":0.0023251139,"teacher_disagreement_score":0.010435967,"about_ca_system_score_codex":0.0019503745,"about_ca_system_score_gemma":0.0017888492,"threshold_uncertainty_score":0.03491181},"labels":[],"label_agreement":null},{"id":"W2949066063","doi":"10.48550/arxiv.1008.2814","title":"Convex optimization for the planted k-disjoint-clique problem","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; U.S. Air Force; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Disjoint sets; Combinatorics; Clique; Cluster analysis; Mathematics; Partition (number theory); Discrete mathematics; Clique percolation method; Time complexity; Computer science; Theoretical computer science; Complex network","score_opus":0.053120820317437256,"score_gpt":0.17283252669174326,"score_spread":0.119711706374306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949066063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019363511,0.0006822468,0.9700759,0.0018070795,0.000097657336,0.00013883163,0.00082426635,0.00022431783,0.006786266],"genre_scores_gemma":[0.45034432,0.0015714928,0.5312937,0.0010272091,0.0004405627,0.00079611014,0.0031654362,0.0004802159,0.01088096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806803,0.00093331176,0.000054630123,0.0004630904,0.00027841402,0.00020257098],"domain_scores_gemma":[0.9948096,0.0040965723,0.0003029714,0.00029171284,0.00029757305,0.00020157239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002334615,0.001923744,0.0020086514,0.0007326949,0.00076064165,0.001682953,0.0022618608,0.002247276,0.0059434325],"category_scores_gemma":[0.009179124,0.0008536621,0.00112113,0.0017103342,0.0018416545,0.0034339111,0.0018400407,0.003216342,0.00084502035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018379655,0.00017251339,0.00064071117,0.00031396974,0.00009416712,0.0002118639,0.00010309737,0.8750363,0.0011113771,0.08834797,0.011065318,0.022718923],"study_design_scores_gemma":[0.000036735528,0.000032294938,0.0001766916,0.000016612883,0.000009256177,0.000045169356,0.000034476903,0.9189434,0.00024390768,0.07897663,0.0014754959,0.000009318867],"about_ca_topic_score_codex":0.004249834,"about_ca_topic_score_gemma":0.005102221,"teacher_disagreement_score":0.0059434325,"about_ca_system_score_codex":0.0020843311,"about_ca_system_score_gemma":0.0014801492,"threshold_uncertainty_score":0.019882798},"labels":[],"label_agreement":null},{"id":"W2949257000","doi":"10.48550/arxiv.1809.00020","title":"Performance Analysis of Plug-and-Play ADMM: A Graph Signal Processing Perspective","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Los Alamos National Laboratory; York University; Purdue University; National Science Foundation","keywords":"Smoothing; Maximum a posteriori estimation; Prior probability; Computer science; Image restoration; A priori and a posteriori; Convergence (economics); Graph; Mathematical optimization; Noise reduction; Linearity; Regular polygon; Image (mathematics); Algorithm; Image processing; Artificial intelligence; Theoretical computer science; Mathematics; Computer vision; Maximum likelihood","score_opus":0.04183486849565963,"score_gpt":0.1873469861672062,"score_spread":0.14551211767154656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949257000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018404711,0.00078224874,0.972615,0.0011474607,0.00006426201,0.0000491942,0.00006752157,0.00032200024,0.006547581],"genre_scores_gemma":[0.7973309,0.0011378265,0.19531515,0.00043160634,0.0001257019,0.00014180664,0.00022468404,0.0002647809,0.0050275945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981419,0.0009773906,0.000051163806,0.00021556899,0.000454456,0.00015959844],"domain_scores_gemma":[0.99203897,0.0060293404,0.0004519647,0.00049468956,0.0007785195,0.00020655169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050175614,0.0016401955,0.001119093,0.0008365099,0.00047654545,0.0014938989,0.0014505279,0.0022389435,0.0035275545],"category_scores_gemma":[0.016385563,0.0005024737,0.00047903665,0.00080364157,0.0023716243,0.0025417178,0.0021796187,0.002368854,0.0005778306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030132275,0.00007167657,0.00066646334,0.00024086333,0.000059168295,0.00010594213,0.000080512626,0.87519085,0.0028632595,0.083134115,0.0023123154,0.03497353],"study_design_scores_gemma":[0.00000923172,0.000063558145,0.00008844598,0.000012034302,0.0000073318374,0.00003527188,0.000016972965,0.9790583,0.00077291933,0.019562354,0.00036655905,0.0000069321445],"about_ca_topic_score_codex":0.0019158025,"about_ca_topic_score_gemma":0.0014439436,"teacher_disagreement_score":0.0050175614,"about_ca_system_score_codex":0.0010681765,"about_ca_system_score_gemma":0.0016356222,"threshold_uncertainty_score":0.02653575},"labels":[],"label_agreement":null},{"id":"W2949272583","doi":"10.1007/s10898-021-01031-0","title":"Low-rank matrix recovery with Ky Fan 2-k-norm","year":2021,"lang":"en","type":"preprint","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Alan Turing Institute","keywords":"Mathematics; Rank (graph theory); Norm (philosophy); Regular polygon; Matrix (chemical analysis); Matrix norm; Low-rank approximation; Mathematical optimization; Matrix completion; Combinatorics; Applied mathematics; Algorithm; Pure mathematics; Geometry; Physics; Materials science; Eigenvalues and eigenvectors","score_opus":0.006562845079908549,"score_gpt":0.22858388847026265,"score_spread":0.2220210433903541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949272583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002584886,0.00006865714,0.99638486,0.00009531572,0.000011567786,0.000016192696,0.000029920688,0.00006548318,0.00074311893],"genre_scores_gemma":[0.34001943,0.0005304337,0.6519024,0.00020480694,0.00008550709,0.00020088317,0.00042283148,0.00011955503,0.0065141567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931395,0.00025966443,0.000030837047,0.00012095226,0.00021528683,0.000059287955],"domain_scores_gemma":[0.9990386,0.0004950188,0.00010846879,0.00013622432,0.00017270612,0.00004903229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177122,0.0009530281,0.0009375321,0.00049947674,0.00035451425,0.0009923521,0.0010619906,0.0012850447,0.002216028],"category_scores_gemma":[0.0029307378,0.0003233939,0.00060348125,0.00081617443,0.0011874157,0.002093924,0.0013268668,0.0019727508,0.00059443887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011658964,0.000061673,0.00036572694,0.00014408932,0.000031530326,0.00011266767,0.000067630885,0.8525995,0.0048487997,0.08091772,0.0039397483,0.056794263],"study_design_scores_gemma":[0.0000024698606,0.000009226753,0.000021465778,0.0000027436342,9.540013e-7,0.00001608872,0.0000044802455,0.99399996,0.00052213104,0.0049636355,0.00045383672,0.0000030382093],"about_ca_topic_score_codex":0.003152329,"about_ca_topic_score_gemma":0.002798471,"teacher_disagreement_score":0.003152329,"about_ca_system_score_codex":0.0005709831,"about_ca_system_score_gemma":0.0012412464,"threshold_uncertainty_score":0.0074133873},"labels":[],"label_agreement":null},{"id":"W2949687072","doi":"10.48550/arxiv.1211.0665","title":"Hidden cliques and the certification of the restricted isometry property","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Restricted isometry property; Isometry (Riemannian geometry); Property (philosophy); Underdetermined system; Mathematics; Clique; Matrix (chemical analysis); Time complexity; Compressed sensing; Probabilistic logic; Algorithm; Combinatorics; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.07214962909179184,"score_gpt":0.17773595690101224,"score_spread":0.10558632780922039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949687072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117604405,0.0002593854,0.8694292,0.0027926557,0.00009284745,0.00018764807,0.00058105803,0.00054858497,0.008504299],"genre_scores_gemma":[0.8646586,0.00033002102,0.12974963,0.0005451468,0.00023489243,0.00025947532,0.0009309865,0.00024141978,0.0030498535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99191916,0.003502315,0.0003007019,0.0016984807,0.0018524586,0.000726909],"domain_scores_gemma":[0.9250651,0.052474614,0.0051255836,0.01240095,0.0033985297,0.0015352515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004886354,0.00084555754,0.0014050464,0.0012495731,0.0017672856,0.0028544283,0.0024220403,0.0020072735,0.005674106],"category_scores_gemma":[0.053561367,0.0010086591,0.0014342968,0.0015110148,0.005374212,0.009134627,0.004850519,0.0050631994,0.0008833905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010148404,0.00034276303,0.005726531,0.0003057762,0.00014131023,0.00077311933,0.0010339187,0.1459394,0.011476422,0.7605935,0.007926339,0.06472618],"study_design_scores_gemma":[0.000101556856,0.00008003106,0.0008562313,0.000034579152,0.000019406305,0.00022998475,0.00016124251,0.32602233,0.00442027,0.6658827,0.0021468617,0.000044783883],"about_ca_topic_score_codex":0.0019772209,"about_ca_topic_score_gemma":0.0016357757,"teacher_disagreement_score":0.005674106,"about_ca_system_score_codex":0.0011583412,"about_ca_system_score_gemma":0.0017526144,"threshold_uncertainty_score":0.025841832},"labels":[],"label_agreement":null},{"id":"W2949778424","doi":"10.1109/cleoe-eqec.2019.8871592","title":"Time/Frequency High-Dimensional Entanglement via Engineered Parametric Downconversion","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Engineering and Physical Sciences Research Council","keywords":"Quantum entanglement; Parametric statistics; Spontaneous parametric down-conversion; Physics; Quantum mechanics; Mathematics; Quantum; Statistics","score_opus":0.004320538319527969,"score_gpt":0.17500854070686522,"score_spread":0.17068800238733725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949778424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.570868,0.0024204664,0.33715287,0.00096983014,0.00031782888,0.00015245636,0.0005205463,0.0012819386,0.08631606],"genre_scores_gemma":[0.9625787,0.0007278536,0.032375403,0.0000703746,0.00005766998,0.000042580028,0.00008587616,0.000044656183,0.004016821],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998124,0.000022554279,0.0000074860877,0.000034677105,0.00009776534,0.000025124193],"domain_scores_gemma":[0.9997787,0.00007178322,0.000047964317,0.00006300102,0.000015463273,0.000023162329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019229276,0.00027587265,0.00023321722,0.00029944157,0.0002255733,0.00069386925,0.000546024,0.0003232817,0.0035334728],"category_scores_gemma":[0.00046168265,0.00018503016,0.00015100017,0.00040742007,0.0008447289,0.0010074908,0.0011940371,0.000669937,0.0004819264],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018535175,0.00031736857,0.0008729817,0.00022506368,0.00002984518,0.0005285369,0.00040717522,0.016232818,0.48967975,0.41810805,0.0023068816,0.071106225],"study_design_scores_gemma":[0.00009677998,0.0003084728,0.0021700864,0.000080323676,0.00003198302,0.0008154714,0.000099360615,0.30583364,0.53927654,0.09750194,0.053630438,0.00015505728],"about_ca_topic_score_codex":0.00014845947,"about_ca_topic_score_gemma":0.00029617813,"teacher_disagreement_score":0.0035334728,"about_ca_system_score_codex":0.000265825,"about_ca_system_score_gemma":0.00017642304,"threshold_uncertainty_score":0.011820674},"labels":[],"label_agreement":null},{"id":"W2950009848","doi":"10.1080/00401706.2019.1610069","title":"Matrix Linear Discriminant Analysis","year":2019,"lang":"it","type":"article","venue":"Technometrics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Human Genome Research Institute; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Linear discriminant analysis; Matrix norm; Consistency (knowledge bases); Rank (graph theory); Mathematics; Equivalence (formal languages); Matrix (chemical analysis); Ordinary least squares; Applied mathematics; Pattern recognition (psychology); Algorithm; Artificial intelligence; Statistics; Computer science; Combinatorics; Pure mathematics; Discrete mathematics; Eigenvalues and eigenvectors","score_opus":0.01704058406635746,"score_gpt":0.26555209864218937,"score_spread":0.24851151457583193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950009848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029898686,0.00067317893,0.9940852,0.00027267286,0.0001310384,0.00002663212,0.000104087645,0.00023955609,0.0014778122],"genre_scores_gemma":[0.22362801,0.0027847395,0.7604112,0.00055998896,0.0009474156,0.00025969537,0.00092275214,0.00018505014,0.010301061],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864084,0.00041201944,0.00006543938,0.00030673295,0.0004814118,0.00009353728],"domain_scores_gemma":[0.999012,0.0002782673,0.00013344614,0.00017502412,0.0003483158,0.00005283162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011969774,0.0009859927,0.0010130203,0.0012933582,0.00041801212,0.0014214105,0.0011424659,0.0008325585,0.0026106888],"category_scores_gemma":[0.0029634994,0.00024570752,0.00088156044,0.0016707575,0.00076122425,0.001152251,0.001371007,0.0013415854,0.0024430137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001311321,0.00011644758,0.0021010728,0.00035133288,0.00018611856,0.00018961844,0.0001284934,0.08213189,0.02725172,0.13961555,0.013923176,0.7338734],"study_design_scores_gemma":[0.000025057981,0.00015997964,0.0012865567,0.00003584232,0.000058926402,0.0003208416,0.00005034684,0.90029603,0.0068842988,0.06412485,0.026705863,0.00005142407],"about_ca_topic_score_codex":0.0006955161,"about_ca_topic_score_gemma":0.000776286,"teacher_disagreement_score":0.0026106888,"about_ca_system_score_codex":0.00036872004,"about_ca_system_score_gemma":0.00075266894,"threshold_uncertainty_score":0.00873363},"labels":[],"label_agreement":null},{"id":"W2950094993","doi":"10.48550/arxiv.1704.03116","title":"DOPE: Distributed Optimization for Pairwise Energies","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Submodular set function; Pairwise comparison; Mathematical optimization; Consistency (knowledge bases); Constraint (computer-aided design); Convergence (economics); Context (archaeology); Domain (mathematical analysis); Relaxation (psychology); Class (philosophy); Set (abstract data type); Computation; Computer science; Local consistency; Mathematics; Algorithm; Constraint satisfaction problem; Artificial intelligence; Probabilistic logic","score_opus":0.07440101924074131,"score_gpt":0.18633240876228938,"score_spread":0.11193138952154806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950094993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009554061,0.00005690127,0.9977271,0.00009325202,0.000024507824,0.00001726083,0.0000311108,0.0001365721,0.0009578183],"genre_scores_gemma":[0.11847182,0.0002686517,0.8725314,0.00023770098,0.000100196215,0.0003162841,0.00032900262,0.0004133739,0.007331565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00021441086,0.000022741497,0.00014514048,0.00026018693,0.000049435894],"domain_scores_gemma":[0.99915135,0.0004398899,0.000070114,0.00016136596,0.0001206362,0.000056549943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013170375,0.0013674716,0.0012820227,0.0006741523,0.00045433975,0.0010656395,0.0024313498,0.0018532262,0.0057383133],"category_scores_gemma":[0.0037688531,0.00060597487,0.0006932413,0.00091601297,0.0010961739,0.0019249566,0.0029013571,0.0023162265,0.001527368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079157406,0.00007903942,0.0002826529,0.00014576515,0.000057605866,0.000084521125,0.000051668205,0.81418025,0.003083239,0.07904576,0.006172385,0.09673801],"study_design_scores_gemma":[0.000014307388,0.000025032205,0.000026433556,0.0000064342,0.0000034233785,0.000029304238,0.000006890708,0.97207063,0.00066016713,0.02524564,0.0019065051,0.0000052717883],"about_ca_topic_score_codex":0.0010672027,"about_ca_topic_score_gemma":0.0018116651,"teacher_disagreement_score":0.0057383133,"about_ca_system_score_codex":0.0007095429,"about_ca_system_score_gemma":0.0012069753,"threshold_uncertainty_score":0.01919657},"labels":[],"label_agreement":null},{"id":"W2950238055","doi":"10.1103/physrevlett.122.100404","title":"Adaptive Compressive Tomography with No <i>a priori</i> Information","year":2019,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Univerzita Palackého v Olomouci; Ministerio de Economía y Competitividad; National Research Foundation of Korea; H2020 European Research Council; Canada Research Chairs; Ministry of Education; Grantová Agentura České Republiky","keywords":"Quantum tomography; A priori and a posteriori; Computer science; Tomography; Compressed sensing; Computation; Dimension (graph theory); Quantum state; Quantum; Rank (graph theory); Algorithm; Component (thermodynamics); Quantum information; Quantum information science; Field (mathematics); Quantum computer; State (computer science); Theoretical computer science; Statistical physics; Physics; Mathematics; Quantum mechanics; Optics; Quantum entanglement","score_opus":0.0058553574181722965,"score_gpt":0.20894309018657312,"score_spread":0.2030877327684008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950238055","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13005278,0.00030268676,0.8519512,0.0009228577,0.00013875215,0.00017661709,0.0002472869,0.0006962679,0.0155114895],"genre_scores_gemma":[0.7607093,0.00028531137,0.23606645,0.00037192795,0.00009375354,0.00017831808,0.00026165808,0.00008107706,0.001952251],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945396,0.000114989256,0.00002510072,0.00012954038,0.00022455394,0.000051837924],"domain_scores_gemma":[0.9989674,0.0004031049,0.00017103039,0.00033694477,0.00007220539,0.00004932529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060905964,0.00054276333,0.0004210209,0.00025250815,0.000300803,0.000669643,0.0011294101,0.0006801873,0.0028794403],"category_scores_gemma":[0.0024990174,0.00024207031,0.00021980831,0.00048198635,0.0016122144,0.0020246694,0.0018683671,0.0012624573,0.00045810893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008495051,0.00030683188,0.0016307675,0.00036313155,0.00006275317,0.00039361772,0.00026680424,0.07498611,0.47753853,0.33936113,0.0032393849,0.10100147],"study_design_scores_gemma":[0.00014850372,0.0005258604,0.00084467285,0.000053064166,0.00003347082,0.00043465185,0.00008672576,0.70018137,0.19791313,0.09221529,0.007470128,0.00009316623],"about_ca_topic_score_codex":0.00037849625,"about_ca_topic_score_gemma":0.0005601814,"teacher_disagreement_score":0.0028794403,"about_ca_system_score_codex":0.00034056974,"about_ca_system_score_gemma":0.0005125585,"threshold_uncertainty_score":0.009632707},"labels":[],"label_agreement":null},{"id":"W2950358183","doi":"10.48550/arxiv.0901.3348","title":"Nuclear norm minimization for the planted clique and biclique problems","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Complete bipartite graph; Bipartite graph; Combinatorics; Clique problem; Mathematics; Clique; Generalization; Matrix norm; Minification; Discrete mathematics; Graph; Mathematical optimization; Chordal graph","score_opus":0.05416914764997338,"score_gpt":0.16605272672140522,"score_spread":0.11188357907143184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950358183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036023486,0.00043844822,0.9532258,0.0016402873,0.00006794462,0.00010425893,0.0003045061,0.00025506428,0.0079402365],"genre_scores_gemma":[0.48816705,0.00071642746,0.49728936,0.0007369582,0.00024014371,0.00052050524,0.00118523,0.0003287551,0.010815603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743015,0.0012400621,0.00007042751,0.0004943528,0.0005224101,0.00024258741],"domain_scores_gemma":[0.9925211,0.0051610675,0.00069378456,0.00061576586,0.00061300094,0.00039520234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025972086,0.0011026039,0.0012440858,0.00082528347,0.0008752221,0.001420564,0.0021878134,0.0022534688,0.004117996],"category_scores_gemma":[0.013500563,0.0005960254,0.0008660152,0.0014408325,0.00236241,0.0042617763,0.0021092873,0.0027172382,0.000629123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038509982,0.00025600792,0.0009637775,0.00029089174,0.00009399673,0.00024584777,0.00027466528,0.548479,0.0039253947,0.38428596,0.010368933,0.050430376],"study_design_scores_gemma":[0.000042795717,0.0000628922,0.00020593748,0.000020678735,0.000010313522,0.00009728113,0.00007318194,0.7999505,0.001399405,0.19603197,0.002084663,0.000020390748],"about_ca_topic_score_codex":0.0021164224,"about_ca_topic_score_gemma":0.002972933,"teacher_disagreement_score":0.004117996,"about_ca_system_score_codex":0.0017228485,"about_ca_system_score_gemma":0.0013917058,"threshold_uncertainty_score":0.013776064},"labels":[],"label_agreement":null},{"id":"W2950616136","doi":"10.48550/arxiv.1311.0576","title":"Approximate Message Passing-based Compressed Sensing Reconstruction with Generalized Elastic Net Prior","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Underdetermined system; Compressed sensing; Elastic net regularization; Lasso (programming language); Message passing; Algorithm; Computer science; Bounded function; SIGNAL (programming language); Scalar (mathematics); Signal reconstruction; Relaxation (psychology); Reconstruction algorithm; Applied mathematics; Mathematics; Signal processing; Iterative reconstruction; Artificial intelligence; Feature selection; Mathematical analysis; Geometry","score_opus":0.03839740439412664,"score_gpt":0.16621464552920698,"score_spread":0.12781724113508033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950616136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010518177,0.00013144988,0.9881264,0.0001842805,0.000017046437,0.000019192381,0.00004361183,0.00008972605,0.00087013224],"genre_scores_gemma":[0.62298936,0.00057709555,0.37005717,0.00031861506,0.00013064276,0.00016632638,0.0004049612,0.000094945426,0.0052609504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990294,0.00042221637,0.000037727983,0.00016711964,0.0002684033,0.00007513008],"domain_scores_gemma":[0.99802375,0.0013894486,0.00021104395,0.00017275708,0.00014817026,0.00005483173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021829356,0.0011295113,0.001120887,0.0005462434,0.00033818424,0.00087510364,0.0012603032,0.0013188801,0.0013108124],"category_scores_gemma":[0.0050216215,0.0004460989,0.0005588548,0.00077176816,0.001556293,0.002182626,0.0018231076,0.0016816773,0.00029544006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002840321,0.000047059875,0.000565627,0.0001453996,0.000055315297,0.00017010482,0.000097427415,0.8962836,0.0033091346,0.052071724,0.00086369057,0.046106722],"study_design_scores_gemma":[0.0000073207184,0.000020907917,0.00005086759,0.0000050891,0.0000041826484,0.000026770467,0.0000065580516,0.9922524,0.00077774667,0.0066274926,0.00021403522,0.0000065941063],"about_ca_topic_score_codex":0.0017694868,"about_ca_topic_score_gemma":0.0015500734,"teacher_disagreement_score":0.0021829356,"about_ca_system_score_codex":0.00066846213,"about_ca_system_score_gemma":0.0007175602,"threshold_uncertainty_score":0.011544585},"labels":[],"label_agreement":null},{"id":"W2951522326","doi":"10.48550/arxiv.1407.8246","title":"Exponential decay of reconstruction error from binary measurements of sparse signals","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Thresholding; Compressed sensing; Quantization (signal processing); Algorithm; Lambda; Binary number; Dither; Mathematics; Normalization (sociology); Oversampling; Exponential function; Polynomial; Computer science; Arithmetic; Physics; Artificial intelligence; Mathematical analysis; Noise shaping","score_opus":0.11916138529467285,"score_gpt":0.19626099590337526,"score_spread":0.0770996106087024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951522326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038701627,0.00033007466,0.9582633,0.0004247857,0.00003306285,0.00002779576,0.000047613863,0.0003253063,0.0018464004],"genre_scores_gemma":[0.62483,0.0007203283,0.36883217,0.00040135614,0.000055822,0.0001686042,0.00019517509,0.0003006308,0.004495895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695873,0.0008695312,0.0001906026,0.0004851109,0.0012541248,0.0002419406],"domain_scores_gemma":[0.9791251,0.016287956,0.0011908412,0.0018316177,0.0013139284,0.00025069254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006277159,0.0008845073,0.0009785808,0.0005475957,0.00032796554,0.0011246706,0.0015162107,0.0015339156,0.0015474049],"category_scores_gemma":[0.04320803,0.00053098757,0.0005028304,0.0005412942,0.002127462,0.0029912659,0.0022474558,0.0024560648,0.0004711526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008375906,0.00014987712,0.0038956725,0.00052063854,0.000096229945,0.000343847,0.00066012074,0.63069445,0.072523765,0.1862365,0.0015513082,0.10249008],"study_design_scores_gemma":[0.000014163311,0.00006362015,0.000506294,0.000039924256,0.000007878785,0.00006978397,0.000024111405,0.9667632,0.013106863,0.018982725,0.0004022889,0.000019041812],"about_ca_topic_score_codex":0.0012801558,"about_ca_topic_score_gemma":0.0011040163,"teacher_disagreement_score":0.006277159,"about_ca_system_score_codex":0.0013514715,"about_ca_system_score_gemma":0.0010306279,"threshold_uncertainty_score":0.033197165},"labels":[],"label_agreement":null},{"id":"W2951689389","doi":"10.48550/arxiv.1010.4612","title":"Recovering Compressively Sampled Signals Using Partial Support Information","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Compressed sensing; Signal reconstruction; SIGNAL (programming language); Noise (video); Signal recovery; Algorithm; Compressibility; Mathematics; Computer science; Signal processing; Mathematical optimization; Artificial intelligence; Image (mathematics); Telecommunications; Physics; Radar","score_opus":0.08599988065342376,"score_gpt":0.19716817286391125,"score_spread":0.11116829221048749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951689389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07080041,0.00050793175,0.9261743,0.00040455433,0.00003117643,0.000029828416,0.00014093326,0.00010773295,0.0018031372],"genre_scores_gemma":[0.76846,0.0011502744,0.22650994,0.0002231966,0.00016032245,0.00010800692,0.0006476356,0.00011534914,0.0026252843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990133,0.00034009956,0.00006161736,0.00016584442,0.00035384903,0.000065323096],"domain_scores_gemma":[0.9954939,0.003247877,0.0004085987,0.00040265123,0.00037122885,0.00007575715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019441821,0.0012782722,0.0010444765,0.00074615236,0.00026705064,0.00093892217,0.0009574781,0.0012623228,0.0013234402],"category_scores_gemma":[0.012362813,0.0004677621,0.0004752435,0.0007944994,0.0014146152,0.0027715573,0.0019158743,0.0010163699,0.00038107185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083384424,0.00011314758,0.0018263776,0.00076159433,0.00017207052,0.0005195946,0.00028338752,0.64632267,0.06878359,0.11279281,0.0016313456,0.16595958],"study_design_scores_gemma":[0.000019075034,0.00010904908,0.00032990056,0.00003500287,0.00001781451,0.00013837464,0.000043638953,0.95457083,0.016431518,0.027452063,0.0008258816,0.000026924079],"about_ca_topic_score_codex":0.00045138184,"about_ca_topic_score_gemma":0.00041575427,"teacher_disagreement_score":0.0019441821,"about_ca_system_score_codex":0.00028030341,"about_ca_system_score_gemma":0.00035539034,"threshold_uncertainty_score":0.01028198},"labels":[],"label_agreement":null},{"id":"W2951709146","doi":"10.48550/arxiv.1205.6845","title":"Weighted-{$\\ell_1$} minimization with multiple weighting sets","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Weighting; Minification; Mathematics; Combinatorics; Computer science; Algorithm; Mathematical optimization; Physics","score_opus":0.04503613515933222,"score_gpt":0.16674715187087566,"score_spread":0.12171101671154344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951709146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016723117,0.000208644,0.98136854,0.00021235716,0.0000232867,0.000030169187,0.000050040187,0.000053067324,0.0013307926],"genre_scores_gemma":[0.45586476,0.0007926704,0.5370082,0.00027529633,0.00016678603,0.00027885547,0.00043640364,0.00021209732,0.004964837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866724,0.00047327374,0.00008196999,0.0002639345,0.00041820944,0.00009536884],"domain_scores_gemma":[0.9955576,0.0031335433,0.00042789697,0.00033265,0.00046067004,0.000087668144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030945027,0.0017714428,0.001186149,0.00077393086,0.00035413253,0.0012124047,0.0013981035,0.0016796364,0.0020915542],"category_scores_gemma":[0.013385039,0.00047763233,0.0006263243,0.00082061137,0.0013979811,0.002598297,0.0024130945,0.0014491031,0.000601448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045477613,0.00013409558,0.0015390337,0.0007014785,0.00017645604,0.00040339146,0.00025080095,0.6749828,0.026666649,0.15002012,0.0027340774,0.14193623],"study_design_scores_gemma":[0.000012424119,0.00007302213,0.0001769074,0.000026855245,0.000012247958,0.00009840869,0.00002908811,0.9746482,0.0053393627,0.018784933,0.0007808517,0.000017616216],"about_ca_topic_score_codex":0.0007407096,"about_ca_topic_score_gemma":0.00056153414,"teacher_disagreement_score":0.0030945027,"about_ca_system_score_codex":0.00056142174,"about_ca_system_score_gemma":0.000541042,"threshold_uncertainty_score":0.016365528},"labels":[],"label_agreement":null},{"id":"W2951721760","doi":"10.48550/arxiv.0907.2079","title":"An Augmented Lagrangian Approach for Sparse Principal Component Analysis","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Augmented Lagrangian method; Sparse PCA; Principal component analysis; Orthogonality; Convergence (economics); Dimension (graph theory); Computer science; Sparse approximation; Dimensionality reduction; Mathematical optimization; Feature (linguistics); Sparse matrix; Algorithm; Mathematics; Artificial intelligence","score_opus":0.0514146644095187,"score_gpt":0.2781653502223928,"score_spread":0.2267506858128741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951721760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008744754,0.00008075841,0.99811256,0.0000871182,0.000020110332,0.00001563344,0.000025901472,0.000063341955,0.0007200554],"genre_scores_gemma":[0.08519529,0.0005846645,0.9086766,0.00021635703,0.00015577803,0.00028083802,0.00039717281,0.00016858857,0.0043246495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.00020296767,0.000022355942,0.0000813497,0.00021022315,0.0000460182],"domain_scores_gemma":[0.9993723,0.00031016034,0.000066363405,0.00005274715,0.00016342774,0.000035033117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010094369,0.0011424398,0.0010821425,0.0008621933,0.0005365336,0.00093291997,0.0012169142,0.0012232659,0.003396953],"category_scores_gemma":[0.0022196188,0.0004909023,0.0010347521,0.001012425,0.00082521106,0.0012849603,0.0014857373,0.001847264,0.00086329115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045380595,0.000065176966,0.00045712906,0.0002522206,0.000068288,0.00017605047,0.000119041986,0.8181942,0.00608467,0.074057244,0.0066231578,0.09385738],"study_design_scores_gemma":[0.0000043082446,0.000010613861,0.000029460381,0.000005534233,0.0000037288087,0.000015915144,0.0000050412787,0.99268407,0.00023992443,0.005475731,0.0015211313,0.0000045980405],"about_ca_topic_score_codex":0.0029669928,"about_ca_topic_score_gemma":0.003414411,"teacher_disagreement_score":0.003396953,"about_ca_system_score_codex":0.0005159321,"about_ca_system_score_gemma":0.0016396194,"threshold_uncertainty_score":0.011363983},"labels":[],"label_agreement":null},{"id":"W2952033563","doi":"10.48550/arxiv.0809.0745","title":"Sparse Recovery by Non-convex Optimization -- Instance Optimality","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regular polygon; Convex optimization; Mathematical optimization; Computer science; Conic optimization; Mathematics; Convex analysis; Geometry","score_opus":0.030059143166084143,"score_gpt":0.23255870141778462,"score_spread":0.20249955825170046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952033563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009376698,0.0005452779,0.97066015,0.0029154131,0.00011170246,0.000089195346,0.0003654915,0.00028283923,0.01565319],"genre_scores_gemma":[0.53573525,0.0019827732,0.4389722,0.0017375086,0.0007141803,0.0006050575,0.0011974359,0.0007222899,0.018333277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696666,0.001509288,0.000093493196,0.00042301585,0.00074167043,0.00026583538],"domain_scores_gemma":[0.9872596,0.010727046,0.00038816192,0.0009936575,0.00044813158,0.00018334264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004120674,0.0017452494,0.0022213748,0.0009763174,0.000743469,0.0029097854,0.0020648167,0.002205264,0.007317813],"category_scores_gemma":[0.024254743,0.00069982954,0.001091015,0.0018990258,0.0025767083,0.0053089308,0.003442034,0.005615801,0.0012262604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013445715,0.000093960625,0.00033954313,0.00017646371,0.000078003286,0.00008335555,0.000084557745,0.20758283,0.0010196727,0.7400419,0.012627016,0.03773829],"study_design_scores_gemma":[0.000030496536,0.00003636539,0.000080549755,0.000027472113,0.000010950216,0.000060263537,0.000019822948,0.6965114,0.0011339205,0.30020326,0.0018755216,0.000010054263],"about_ca_topic_score_codex":0.0014592897,"about_ca_topic_score_gemma":0.0018752784,"teacher_disagreement_score":0.007317813,"about_ca_system_score_codex":0.0023669784,"about_ca_system_score_gemma":0.002353421,"threshold_uncertainty_score":0.024480522},"labels":[],"label_agreement":null},{"id":"W2952157459","doi":"10.48550/arxiv.1512.07947","title":"Sparse Reconstruction of Compressive Sensing MRI using Cross-Domain Stochastically Fully Connected Conditional Random Fields","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sunnybrook Health Science Centre; University of Toronto; University of Waterloo","funders":"","keywords":"Compressed sensing; Computer science; Magnetic resonance imaging; Iterative reconstruction; Data acquisition; Sampling (signal processing); Artificial intelligence; Computer vision; Reconstruction algorithm; Diffusion MRI; Image quality; Process (computing); Image (mathematics); Radiology; Medicine","score_opus":0.07231816761678786,"score_gpt":0.21387664756237698,"score_spread":0.14155847994558912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952157459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012818217,0.00010352401,0.98625374,0.00014426677,0.000014246157,0.000018057552,0.00004445562,0.00011641028,0.0004870829],"genre_scores_gemma":[0.58071405,0.0005810106,0.414894,0.00025631223,0.00009335535,0.00012969416,0.0005714549,0.000073851144,0.0026862263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995222,0.00021705865,0.000018814488,0.000079100595,0.00013359988,0.00002922419],"domain_scores_gemma":[0.9985258,0.0010082746,0.00015131534,0.00010963353,0.00016144359,0.00004363001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957944,0.000667622,0.0005171014,0.0004919146,0.00017412278,0.00042776804,0.00064863684,0.00087622885,0.0009318463],"category_scores_gemma":[0.0034711754,0.000385953,0.0006111175,0.0005184465,0.00073690765,0.00071389164,0.00069544284,0.00084430043,0.00018219803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013914623,0.00005329461,0.0005821051,0.0001248565,0.000056948647,0.00015731224,0.00006707913,0.90597916,0.013912301,0.02438035,0.0011818318,0.053365566],"study_design_scores_gemma":[0.000004361818,0.000015663338,0.00009456883,0.00000387724,0.0000033253007,0.000024471656,0.000002120692,0.9964618,0.0011382097,0.0020633973,0.00018313197,0.000005209412],"about_ca_topic_score_codex":0.0029519913,"about_ca_topic_score_gemma":0.0027129657,"teacher_disagreement_score":0.0029519913,"about_ca_system_score_codex":0.00037070469,"about_ca_system_score_gemma":0.0005901462,"threshold_uncertainty_score":0.0058695674},"labels":[],"label_agreement":null},{"id":"W2952282309","doi":"10.48550/arxiv.1011.4604","title":"An Alternating Direction Method for Finding Dantzig Selectors","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Mathematical optimization; Gradient method; Algorithm; Mathematics; Applied mathematics","score_opus":0.07175317535369091,"score_gpt":0.2330857893940635,"score_spread":0.16133261404037258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952282309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021239063,0.00009993647,0.9967788,0.00004767914,0.000020260444,0.000025453426,0.000012474362,0.0000647542,0.0008268752],"genre_scores_gemma":[0.053073738,0.00027707085,0.94190437,0.000089770896,0.000051089562,0.00022320134,0.00008966335,0.00009775861,0.004193277],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995426,0.00019951166,0.000021050546,0.00005590682,0.0001564437,0.000024482648],"domain_scores_gemma":[0.9994241,0.00033306665,0.00004302775,0.000053993805,0.00011583154,0.000030009634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010542696,0.0008829117,0.0006363195,0.00081263843,0.00036567508,0.0005987866,0.0011789796,0.0012678221,0.0031255318],"category_scores_gemma":[0.0022656485,0.00041159004,0.0004547052,0.0006878469,0.000660943,0.0011411248,0.00076708,0.0012070357,0.001114367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029225764,0.00018210018,0.0007955216,0.00032036385,0.00010518556,0.00013437729,0.00013847626,0.40110952,0.030568775,0.13064481,0.0050668577,0.43064168],"study_design_scores_gemma":[0.000029020803,0.000060648064,0.00006682112,0.000008272806,0.0000054946076,0.00005596312,0.000008832109,0.9822145,0.0028592136,0.0114535885,0.0032240585,0.000013647018],"about_ca_topic_score_codex":0.0011323165,"about_ca_topic_score_gemma":0.0019572806,"teacher_disagreement_score":0.0031255318,"about_ca_system_score_codex":0.00033179985,"about_ca_system_score_gemma":0.0008080481,"threshold_uncertainty_score":0.010455906},"labels":[],"label_agreement":null},{"id":"W2952392021","doi":"","title":"Robustness and Regularization of Support Vector Machines","year":2008,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Support vector machine; Overfitting; Robustness (evolution); Regularization (linguistics); Computer science; Regularization perspectives on support vector machines; Artificial intelligence; Relevance vector machine; Mathematical optimization; Equivalence (formal languages); Mathematics; Machine learning; Algorithm; Pattern recognition (psychology); Tikhonov regularization; Inverse problem; Artificial neural network","score_opus":0.04282337727538829,"score_gpt":0.1672668346155361,"score_spread":0.1244434573401478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952392021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008727361,0.0005256656,0.9876052,0.0006755031,0.000053528882,0.000017773,0.00006423613,0.00014019922,0.0021905845],"genre_scores_gemma":[0.6901513,0.0020857065,0.300089,0.00083486596,0.00083087897,0.00022885167,0.00046737216,0.00036547836,0.0049465895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994635,0.002290828,0.0002534174,0.00095771666,0.0015966626,0.00026650724],"domain_scores_gemma":[0.98808193,0.007606596,0.0015103902,0.0014950932,0.0011193486,0.00018661852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005064701,0.0011725432,0.0011270402,0.001681329,0.0005047962,0.0025699171,0.0014752671,0.0020781325,0.0018033106],"category_scores_gemma":[0.028408868,0.0005711472,0.0012527895,0.0010645767,0.003593717,0.0034516172,0.0025885038,0.0029318584,0.00063494855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013086993,0.000055375036,0.001227749,0.00024826615,0.00019516902,0.00017267848,0.000176464,0.37458545,0.009573723,0.55146015,0.00242105,0.059752982],"study_design_scores_gemma":[0.000011295933,0.00007114198,0.00037919797,0.000037743746,0.000017458417,0.000072238254,0.000020931067,0.6503066,0.0030803806,0.34391505,0.0020636485,0.000024380446],"about_ca_topic_score_codex":0.0006787184,"about_ca_topic_score_gemma":0.000309994,"teacher_disagreement_score":0.005064701,"about_ca_system_score_codex":0.0009514387,"about_ca_system_score_gemma":0.00060277275,"threshold_uncertainty_score":0.026785016},"labels":[],"label_agreement":null},{"id":"W2952450694","doi":"10.48550/arxiv.math/0612388","title":"Sensor Network Localization, Euclidean Distance Matrix Completions, and Graph Realization","year":2006,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Semidefinite programming; Euclidean distance matrix; Clique; Euclidean geometry; Euclidean distance; Relaxation (psychology); Graph; Projection (relational algebra); Matrix (chemical analysis); Reduction (mathematics); Realization (probability); Distance matrix; Mathematical optimization; Combinatorics; Algorithm","score_opus":0.021794665162681942,"score_gpt":0.2463369626370266,"score_spread":0.22454229747434465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952450694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008689774,0.00020710858,0.9862585,0.00046546466,0.000037948656,0.000024509136,0.0001259567,0.00012701204,0.0040638004],"genre_scores_gemma":[0.6116175,0.0014334094,0.3668836,0.00045595225,0.00032458152,0.0003496584,0.0009727166,0.0002993118,0.017663302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989951,0.0004775374,0.000028432278,0.0002394141,0.00016928259,0.00009024788],"domain_scores_gemma":[0.9972414,0.0017545655,0.00037439045,0.00023213588,0.0002443461,0.00015329935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015194801,0.0011558111,0.0008164599,0.00047693052,0.00038229392,0.001179874,0.0011250601,0.00092312036,0.0032268553],"category_scores_gemma":[0.0057507316,0.0005047238,0.00076099543,0.0009546835,0.0018896708,0.0022076028,0.0014738454,0.0029765521,0.0005346523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061681334,0.00007365314,0.00029887352,0.00014597652,0.000025667769,0.00009415717,0.00011920827,0.7794576,0.0011661117,0.19561364,0.0037810316,0.019162314],"study_design_scores_gemma":[0.00000772454,0.000025007468,0.0000718305,0.000008581541,0.0000027793837,0.000020599244,0.000028256702,0.92704266,0.00034489858,0.071350105,0.0010900554,0.000007535016],"about_ca_topic_score_codex":0.003752612,"about_ca_topic_score_gemma":0.0027415259,"teacher_disagreement_score":0.003752612,"about_ca_system_score_codex":0.0013733826,"about_ca_system_score_gemma":0.0011623207,"threshold_uncertainty_score":0.010794878},"labels":[],"label_agreement":null},{"id":"W2952534663","doi":"10.48550/arxiv.1204.5136","title":"Analysis and Design of Irregular Graphs for Node-Based Verification-Based Recovery Algorithms in Compressed Sensing","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Compressed sensing; Node (physics); Computer science; Context (archaeology); Probabilistic analysis of algorithms; Probabilistic logic; Dimension (graph theory); Decoding methods; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.07079817843483065,"score_gpt":0.19259394384916265,"score_spread":0.121795765414332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952534663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008981811,0.00006015427,0.9898998,0.00010485199,0.000011545799,0.000036540983,0.000025347023,0.00009690873,0.0007830534],"genre_scores_gemma":[0.5676257,0.00045648922,0.42994153,0.00015371517,0.00004290215,0.0001813724,0.00015647346,0.0001440693,0.0012976999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985933,0.0004995442,0.000053012525,0.00024101131,0.0005169565,0.00009614381],"domain_scores_gemma":[0.9916306,0.0055914386,0.00075593777,0.0010342767,0.0007971535,0.00019059858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019246276,0.0006414873,0.00055492745,0.0008183975,0.00047349065,0.0008798581,0.0012216438,0.00079479744,0.0015655167],"category_scores_gemma":[0.013416884,0.00047617735,0.00046296354,0.0007186014,0.00175661,0.0017624241,0.0013149857,0.0012559,0.00034544631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008293049,0.000035168872,0.00082224363,0.00012602423,0.000025369578,0.00009475793,0.000109963796,0.83175415,0.009444474,0.11710936,0.0006443711,0.039751224],"study_design_scores_gemma":[0.0000052626306,0.000028460341,0.00010142579,0.000008434517,0.000005187379,0.000046633995,0.000015210393,0.97108656,0.002383428,0.02560225,0.00071004307,0.000007197802],"about_ca_topic_score_codex":0.0011718599,"about_ca_topic_score_gemma":0.0013392543,"teacher_disagreement_score":0.0019246276,"about_ca_system_score_codex":0.0010510344,"about_ca_system_score_gemma":0.0011741733,"threshold_uncertainty_score":0.010178566},"labels":[],"label_agreement":null},{"id":"W2952769495","doi":"10.48550/arxiv.1506.05866","title":"An Efficient Optimization Approach for a Cardinality-Constrained Index Tracking Problem","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Mathematical optimization; Computer science; Tracking error; Tracking (education); Portfolio; Consistency (knowledge bases); Mathematics; Artificial intelligence; Data mining","score_opus":0.08366706494142148,"score_gpt":0.2030191378119439,"score_spread":0.11935207287052241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952769495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028261158,0.00006811394,0.9960408,0.00012930822,0.000011517281,0.000030673586,0.000024505283,0.00005923522,0.00080972514],"genre_scores_gemma":[0.17847703,0.00029668165,0.81697375,0.00018979487,0.00009878539,0.00030950588,0.00023813057,0.00013343427,0.0032829177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999257,0.00027059065,0.000041463474,0.00015877967,0.00021120282,0.000060885894],"domain_scores_gemma":[0.99805284,0.0013311944,0.00016985642,0.00013185169,0.00023351985,0.00008062891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020140535,0.000985281,0.0011006916,0.00088503043,0.00049214106,0.0010923528,0.0011667224,0.001820514,0.0037189745],"category_scores_gemma":[0.005880723,0.000671352,0.00076407567,0.0010765545,0.0009178975,0.0016180559,0.0015902574,0.001955707,0.0006152258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059799786,0.000066325214,0.00048731006,0.00011683781,0.00003098582,0.00009913371,0.00006718241,0.89021605,0.0030706606,0.031233817,0.0020962954,0.072455674],"study_design_scores_gemma":[0.000007557814,0.00001707387,0.00004602174,0.000005584572,0.000003181799,0.000019854828,0.0000053893787,0.9931251,0.0003636584,0.0060662096,0.00033720082,0.0000031750758],"about_ca_topic_score_codex":0.0022854458,"about_ca_topic_score_gemma":0.002402005,"teacher_disagreement_score":0.0037189745,"about_ca_system_score_codex":0.0008360338,"about_ca_system_score_gemma":0.0014653144,"threshold_uncertainty_score":0.012441218},"labels":[],"label_agreement":null},{"id":"W2953163286","doi":"10.48550/arxiv.1704.08908","title":"Unbiased Shape Compactness for Segmentation","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Segmentation; Compact space; Pairwise comparison; Regularization (linguistics); Cut; Computer science; Optimization problem; Algorithm; Artificial intelligence; Mathematics; Mathematical optimization; Image segmentation","score_opus":0.1341992919556988,"score_gpt":0.21949670908706806,"score_spread":0.08529741713136926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953163286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004895788,0.00012054921,0.99316686,0.00017461965,0.00001316128,0.000018323773,0.00005097039,0.0003404421,0.0012193294],"genre_scores_gemma":[0.25067106,0.0005611073,0.7407625,0.00055476755,0.00013483423,0.00020298117,0.0007451563,0.0009402162,0.0054274835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990392,0.00023522634,0.000044317287,0.0002236475,0.0003931051,0.000064524706],"domain_scores_gemma":[0.99839705,0.00064294075,0.00023837022,0.00042261378,0.00021925397,0.0000797705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014884901,0.0010477488,0.0009369008,0.0012495999,0.0004962998,0.0016472725,0.0016994745,0.0019762989,0.0026718953],"category_scores_gemma":[0.0063744243,0.0008730361,0.000846304,0.0009754433,0.0016518255,0.002913875,0.002709384,0.0017078065,0.0016028275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018292424,0.00009022167,0.0015730057,0.0003084284,0.00007802237,0.00022203063,0.000281007,0.5606172,0.06980547,0.1063109,0.0068742046,0.25365657],"study_design_scores_gemma":[0.0000117384825,0.000040558545,0.0004027586,0.000031609296,0.000011163061,0.00023102653,0.000028063343,0.9399798,0.012819066,0.042311322,0.0041139754,0.000018975592],"about_ca_topic_score_codex":0.0012418488,"about_ca_topic_score_gemma":0.0022319877,"teacher_disagreement_score":0.0026718953,"about_ca_system_score_codex":0.0008890417,"about_ca_system_score_gemma":0.0011580669,"threshold_uncertainty_score":0.008938372},"labels":[],"label_agreement":null},{"id":"W2954099021","doi":"10.1016/j.neunet.2019.06.015","title":"Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm","year":2019,"lang":"en","type":"article","venue":"Neural Networks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Algorithm; Regularization (linguistics); Proximal Gradient Methods; Computer science; Operator (biology); Generalization; Norm (philosophy); Rate of convergence; Balanced flow; Convergence (economics); Mathematics; Mathematical optimization; Gradient descent; Key (lock); Artificial neural network; Artificial intelligence","score_opus":0.014757029736206781,"score_gpt":0.2234007007286691,"score_spread":0.20864367099246234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954099021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012013264,0.00009864445,0.9977367,0.00008942117,0.0000328221,0.000022953038,0.000025841373,0.00014251615,0.00064981065],"genre_scores_gemma":[0.07419688,0.00039760186,0.91935945,0.00014149821,0.00012784933,0.00022358217,0.00027749804,0.00027007403,0.0050056037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886835,0.00040628572,0.00005206774,0.00013576458,0.00046836262,0.000069305934],"domain_scores_gemma":[0.9972402,0.0016925026,0.00015006322,0.00028159836,0.0004921919,0.00014345827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019567106,0.0014828064,0.0015151809,0.0008731023,0.0005644705,0.0014234761,0.0021620628,0.0021358868,0.005513887],"category_scores_gemma":[0.009241063,0.0007801065,0.00070935563,0.0013224065,0.0016527899,0.0022127281,0.003036078,0.0041473424,0.0019952508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031418668,0.00022142296,0.00037654236,0.00043526216,0.000079952006,0.00013998586,0.00021691693,0.4851616,0.0071940925,0.17496268,0.014264246,0.31663302],"study_design_scores_gemma":[0.000014592967,0.000029175764,0.00003984239,0.000014272537,0.000004483906,0.00003520823,0.000014905857,0.9720713,0.0010592273,0.025216978,0.0014922171,0.000007697518],"about_ca_topic_score_codex":0.0029184641,"about_ca_topic_score_gemma":0.0050957603,"teacher_disagreement_score":0.005513887,"about_ca_system_score_codex":0.000948614,"about_ca_system_score_gemma":0.002204129,"threshold_uncertainty_score":0.01844573},"labels":[],"label_agreement":null},{"id":"W2957233745","doi":"10.48550/arxiv.1907.07167","title":"Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Mathematics; Norm (philosophy); Computer science; Linear regression; Statistics; Philosophy","score_opus":0.05925893510220099,"score_gpt":0.19617115081238176,"score_spread":0.13691221571018078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957233745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024693685,0.00019778607,0.9928953,0.00026424607,0.000052391995,0.000040495863,0.00005391599,0.002111028,0.0019154275],"genre_scores_gemma":[0.053364743,0.0002517352,0.9393365,0.00034940208,0.000093834155,0.0002904246,0.0005472463,0.0007584763,0.0050077112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980502,0.00045056935,0.00011268069,0.00041497074,0.000824957,0.00014665446],"domain_scores_gemma":[0.9972615,0.0012910543,0.00018993818,0.00039676242,0.0007307206,0.00012987872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023491269,0.001867981,0.0016646152,0.00089808606,0.00090798084,0.001669734,0.0025007094,0.0026322799,0.006105587],"category_scores_gemma":[0.009733485,0.00070624944,0.001008246,0.0011413243,0.0015437484,0.00272237,0.0031533812,0.004767818,0.0052598617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041956382,0.00018387924,0.00074198557,0.0002858674,0.0000683307,0.00020145546,0.00023707563,0.4830498,0.012431505,0.055439737,0.02774797,0.41919285],"study_design_scores_gemma":[0.000043367243,0.000047404923,0.00006991289,0.00001666383,0.0000053810977,0.000067480796,0.000025542642,0.97973824,0.0026709223,0.01405844,0.0032414685,0.000015181317],"about_ca_topic_score_codex":0.003468079,"about_ca_topic_score_gemma":0.0046628937,"teacher_disagreement_score":0.006105587,"about_ca_system_score_codex":0.0011342851,"about_ca_system_score_gemma":0.0029122296,"threshold_uncertainty_score":0.0204252},"labels":[],"label_agreement":null},{"id":"W2962703591","doi":"10.1016/j.acha.2014.01.006","title":"A null space analysis of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-synthesis method in dictionary-based compressed sensing","year":2014,"lang":"lv","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Defense Threat Reduction Agency; Defense Advanced Research Projects Agency","keywords":"Noise (video); Compressed sensing; SPARK (programming language); Algorithm; Property (philosophy); Computer science; Space (punctuation); Focus (optics); Stability (learning theory); Null (SQL); Mathematics; Artificial intelligence; Data mining; Machine learning; Image (mathematics); Programming language","score_opus":0.01520993801406338,"score_gpt":0.234852896131709,"score_spread":0.21964295811764564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962703591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004812328,0.00042683352,0.980803,0.00055462733,0.00014329252,0.000026155476,0.00022370566,0.000110748464,0.012899322],"genre_scores_gemma":[0.40197745,0.0037954622,0.4877181,0.0010822195,0.0008995432,0.00027368902,0.001978582,0.0011125412,0.10116246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995098,0.0001459914,0.000021981978,0.000057620276,0.00021747968,0.00004724416],"domain_scores_gemma":[0.9979037,0.0011809495,0.00013507546,0.00019490805,0.00048684818,0.000098470045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011648934,0.0010279758,0.00046101486,0.001082806,0.0004996501,0.0014490079,0.0007631679,0.0009339637,0.021175332],"category_scores_gemma":[0.0048164604,0.00028257398,0.00080585975,0.0008025981,0.0014077264,0.0019616736,0.0015964304,0.0015625517,0.0035365936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013729995,0.000052705862,0.00063843135,0.00031445452,0.000036852496,0.0002870531,0.0002848752,0.046453204,0.012324326,0.86343163,0.014970952,0.061068166],"study_design_scores_gemma":[0.000014718671,0.00012862982,0.0008198114,0.00009238636,0.000024782972,0.0008200451,0.00019703995,0.6887844,0.0077439332,0.28030738,0.021008553,0.000058254565],"about_ca_topic_score_codex":0.001272075,"about_ca_topic_score_gemma":0.0014156011,"teacher_disagreement_score":0.021175332,"about_ca_system_score_codex":0.00046135357,"about_ca_system_score_gemma":0.00094296533,"threshold_uncertainty_score":0.07083851},"labels":[],"label_agreement":null},{"id":"W2962751476","doi":"10.1109/glocom.2015.7417132","title":"Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undersampling; Compressed sensing; Wideband; Cognitive radio; Nyquist rate; Computer science; Block (permutation group theory); Electronic engineering; Nyquist–Shannon sampling theorem; Signal-to-noise ratio (imaging); Spectrum (functional analysis); Algorithm; Sampling (signal processing); Telecommunications; Mathematics; Wireless; Engineering; Physics; Detector","score_opus":0.08158860634591454,"score_gpt":0.2961147823282241,"score_spread":0.21452617598230955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962751476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053886484,0.00024847375,0.94424134,0.00011740036,0.000029596142,0.000031486397,0.000027899632,0.00012893685,0.0012883147],"genre_scores_gemma":[0.80683386,0.00022169792,0.19168921,0.000116127994,0.000042801807,0.000035936988,0.00004875545,0.000013090765,0.0009985334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995647,0.00011469904,0.00001484332,0.000056525994,0.00021488153,0.00003428955],"domain_scores_gemma":[0.9989962,0.00062957837,0.0001246337,0.00010525099,0.00011225053,0.000032010565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045637094,0.0003244111,0.00036067172,0.00029372517,0.00021357271,0.0003534283,0.00046130168,0.00044029474,0.0005278551],"category_scores_gemma":[0.00234653,0.00014415302,0.000113636335,0.00030061408,0.0007024515,0.00080081465,0.00070943276,0.00050220505,0.00010782005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012903969,0.00019324993,0.0029881825,0.00037810204,0.00006053915,0.00071449246,0.00056840794,0.24386925,0.32837325,0.0818144,0.0024348712,0.3373148],"study_design_scores_gemma":[0.000020015817,0.00020350855,0.00044778158,0.000017849066,0.000010231358,0.0003346499,0.000053570006,0.9612387,0.028106388,0.008509067,0.0010413856,0.000016883128],"about_ca_topic_score_codex":0.0005845457,"about_ca_topic_score_gemma":0.0010599802,"teacher_disagreement_score":0.0005845457,"about_ca_system_score_codex":0.00019027085,"about_ca_system_score_gemma":0.00029466144,"threshold_uncertainty_score":0.0024135709},"labels":[],"label_agreement":null},{"id":"W2962863897","doi":"10.1007/s00365-019-09467-0","title":"Compressive Hermite Interpolation: Sparse, High-Dimensional Approximation from Gradient-Augmented Measurements","year":2019,"lang":"en","type":"article","venue":"Constructive Approximation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hermite interpolation; Tensor product; Applied mathematics; Sobolev space; Interpolation (computer graphics); Curse of dimensionality; Norm (philosophy); Chebyshev polynomials; Mathematical analysis; Hermite polynomials; Pure mathematics","score_opus":0.019236531859252053,"score_gpt":0.21590383913276245,"score_spread":0.1966673072735104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962863897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022140276,0.00010560349,0.9968786,0.00007323791,0.00002900888,0.00001164383,0.000040485564,0.00016862553,0.00047865225],"genre_scores_gemma":[0.15589687,0.0009551285,0.8374963,0.00015942736,0.00020275498,0.00010720885,0.00043975792,0.00015149484,0.004591053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989404,0.00036054273,0.00003683801,0.00011591269,0.0004884693,0.000057926314],"domain_scores_gemma":[0.99855334,0.000832459,0.00011504933,0.00025360665,0.00019360356,0.000051938117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014539901,0.0009119244,0.0010099352,0.00062870345,0.0002840959,0.0010631112,0.0011448385,0.0013809096,0.0016516667],"category_scores_gemma":[0.0056177825,0.0005091689,0.0005368717,0.0014499292,0.0012256567,0.0015086023,0.0015092259,0.0021009783,0.000865545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060120376,0.00021179441,0.0006959415,0.00039402719,0.00010167212,0.00020669118,0.00023772591,0.4576521,0.043316536,0.14304455,0.008085125,0.34545276],"study_design_scores_gemma":[0.000010255007,0.000029972623,0.00006817234,0.000010126953,0.0000055600617,0.00006251277,0.000011562707,0.9838225,0.0057465564,0.008594467,0.0016250627,0.000013180958],"about_ca_topic_score_codex":0.0011336602,"about_ca_topic_score_gemma":0.00208773,"teacher_disagreement_score":0.0016516667,"about_ca_system_score_codex":0.00040749233,"about_ca_system_score_gemma":0.0010970827,"threshold_uncertainty_score":0.0076895356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02681853792031044,"score_gpt":0.2612994784288483,"score_spread":0.23448094050853788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962904605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018918684,0.0025694503,0.9866479,0.001683625,0.00020474546,0.000028571265,0.00007180267,0.000069941576,0.006832035],"genre_scores_gemma":[0.31747305,0.016480543,0.6437445,0.004541475,0.0044985325,0.0005593529,0.0003629789,0.0003465654,0.011992993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997612,0.0007562081,0.00011199007,0.00027621732,0.0011095712,0.00013398344],"domain_scores_gemma":[0.99553525,0.0031821686,0.00031883473,0.0005074247,0.00033431154,0.00012192911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027692532,0.0008588003,0.0011101813,0.0020261728,0.0009098107,0.0027880364,0.0016139614,0.0021977413,0.0031179816],"category_scores_gemma":[0.008536998,0.0005088375,0.00083269057,0.0017714478,0.0052615134,0.005061835,0.0036046272,0.004557918,0.0007847553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024372297,0.000010620674,0.00009153258,0.00012319181,0.000016895048,0.00006283987,0.000112773014,0.012693531,0.0022123568,0.96034545,0.0019347618,0.022371603],"study_design_scores_gemma":[0.000027484757,0.00009370595,0.0001519758,0.00011063035,0.000017997789,0.00021946193,0.0000657627,0.14566547,0.0013928526,0.83018255,0.02202882,0.00004320192],"about_ca_topic_score_codex":0.0010851517,"about_ca_topic_score_gemma":0.00072330324,"teacher_disagreement_score":0.0031179816,"about_ca_system_score_codex":0.0012254752,"about_ca_system_score_gemma":0.0011192178,"threshold_uncertainty_score":0.014645338},"labels":[],"label_agreement":null},{"id":"W2962969822","doi":"","title":"Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima","year":2018,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Nabla symbol; Mathematics; Smoothness; Saddle point; Order (exchange); Combinatorics; Degenerate energy levels; Stochastic optimization; Algorithm; Mathematical optimization; Physics; Mathematical analysis; Omega; Geometry; Quantum mechanics","score_opus":0.028317591042347018,"score_gpt":0.2652874790833885,"score_spread":0.2369698880410415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962969822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003040919,0.00009763503,0.9952864,0.00014852735,0.000026820639,0.000025098769,0.000020385296,0.00038149525,0.00097268715],"genre_scores_gemma":[0.1818602,0.00028815094,0.8125177,0.00042846755,0.0001026112,0.00032270083,0.00021460252,0.00060568214,0.0036599122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991918,0.00021842508,0.00005137113,0.000110434325,0.00034819316,0.000079821366],"domain_scores_gemma":[0.9978136,0.0011860768,0.00022238877,0.00034338146,0.00031988363,0.00011462417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019455253,0.0013271108,0.0013254251,0.0010070258,0.00060190127,0.0012902202,0.0020508675,0.0018015888,0.0042684064],"category_scores_gemma":[0.0072623026,0.00079381943,0.0013098483,0.0009018557,0.0013390438,0.0016968627,0.0023149787,0.0030696765,0.0016046085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019129254,0.00010346093,0.0008886284,0.00017951959,0.00011032113,0.000118736934,0.00013343537,0.7762729,0.008035423,0.075708285,0.005556185,0.1327019],"study_design_scores_gemma":[0.000015154019,0.000018359462,0.000048903265,0.000007692466,0.0000051861252,0.00001781085,0.0000046431146,0.99078596,0.000924224,0.0074313083,0.00073319935,0.000007636244],"about_ca_topic_score_codex":0.0030519858,"about_ca_topic_score_gemma":0.0047957473,"teacher_disagreement_score":0.0042684064,"about_ca_system_score_codex":0.00089407834,"about_ca_system_score_gemma":0.002074398,"threshold_uncertainty_score":0.014279246},"labels":[],"label_agreement":null},{"id":"W2963026027","doi":"10.1109/tsp.2020.2978617","title":"Feature Graph Learning for 3D Point Cloud Denoising","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Algorithm; Laplacian smoothing; Laplacian matrix; Diagonal; Graph; Discrete mathematics; Physics; Geometry","score_opus":0.021195940707353783,"score_gpt":0.2351633007428574,"score_spread":0.21396736003550362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963026027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037974224,0.00011356914,0.99475974,0.00013349211,0.000014414193,0.000016707,0.00009911847,0.0006934114,0.00037210537],"genre_scores_gemma":[0.2749948,0.0007184398,0.7181532,0.0003037908,0.00009982364,0.00021734792,0.0016224921,0.000657714,0.0032324225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.0001371592,0.000021066686,0.00016385729,0.00021147334,0.000049060614],"domain_scores_gemma":[0.9990233,0.000361523,0.000115377465,0.00020531335,0.00023884776,0.000055568704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078503654,0.000858658,0.0010924101,0.0017165019,0.00051790517,0.001023685,0.0017447583,0.0015215223,0.0019777815],"category_scores_gemma":[0.0037133836,0.0007353072,0.0011837955,0.0017864337,0.0011032547,0.0015609894,0.0016334535,0.0017507869,0.0011059406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012233942,0.00007003528,0.00085834553,0.00014268325,0.000089419606,0.00009078949,0.000120917364,0.70018065,0.011507462,0.036098372,0.0077097686,0.2430092],"study_design_scores_gemma":[0.0000039962415,0.000009380655,0.00012005178,0.0000043551813,0.000003937382,0.00001771676,0.000008850522,0.98047364,0.0012182645,0.017199455,0.00093387347,0.000006442424],"about_ca_topic_score_codex":0.006395383,"about_ca_topic_score_gemma":0.007952039,"teacher_disagreement_score":0.006395383,"about_ca_system_score_codex":0.0012800059,"about_ca_system_score_gemma":0.0011693347,"threshold_uncertainty_score":0.012716293},"labels":[],"label_agreement":null},{"id":"W2963026695","doi":"","title":"Frank-Wolfe Splitting via Augmented Lagrangian Method","year":2018,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Augmented Lagrangian method; Sublinear function; Intersection (aeronautics); Rate of convergence; Polytope; Mathematical optimization; Oracle; Mathematics; Convex function; Quadratic equation; Penalty method; Quadratic programming; Feasible region; Computer science; Regular polygon; Combinatorics","score_opus":0.08781745070840186,"score_gpt":0.35371382272008633,"score_spread":0.2658963720116845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963026695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031479977,0.00009039245,0.9949195,0.000095722884,0.00001834517,0.000022880218,0.000027134549,0.000103269624,0.0015746691],"genre_scores_gemma":[0.2257364,0.00030595905,0.7663004,0.00017737213,0.00007900539,0.00024075771,0.00021314129,0.00017099407,0.006776082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934787,0.00023261004,0.000029397836,0.00008744307,0.00024230144,0.00006034858],"domain_scores_gemma":[0.99909556,0.00044987237,0.000083572966,0.00012787462,0.0001823164,0.00006078202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014252451,0.0008187848,0.0010787479,0.0006706617,0.0003743225,0.0009830485,0.0009366076,0.0012457798,0.0028663953],"category_scores_gemma":[0.0029756294,0.0004894515,0.0006630819,0.00053365336,0.0011345451,0.0015480939,0.0016943695,0.0016511031,0.0010402342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013858054,0.00006835965,0.0005597865,0.00018585268,0.000054680157,0.00023142838,0.00016559886,0.65955615,0.0076048747,0.21653706,0.005221856,0.109675825],"study_design_scores_gemma":[0.000007829411,0.00002079574,0.000028779963,0.000007255039,0.000002287886,0.000026607926,0.0000058330133,0.9811002,0.0005873105,0.017236602,0.00097144884,0.0000050302615],"about_ca_topic_score_codex":0.0011863573,"about_ca_topic_score_gemma":0.0012312152,"teacher_disagreement_score":0.0028663953,"about_ca_system_score_codex":0.0005877519,"about_ca_system_score_gemma":0.0010396735,"threshold_uncertainty_score":0.009589016},"labels":[],"label_agreement":null},{"id":"W2963028075","doi":"10.1016/j.csda.2018.12.002","title":"Sparse wavelet estimation in quantile regression with multiple functional predictors","year":2019,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantile; Quantile regression; Mathematics; Lasso (programming language); Wavelet; Scalar (mathematics); Regression; Rate of convergence; Algorithm; Mathematical optimization; Applied mathematics; Pattern recognition (psychology); Computer science; Artificial intelligence; Statistics","score_opus":0.023073793223642988,"score_gpt":0.2575173982541308,"score_spread":0.23444360503048778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963028075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064823353,0.00026507693,0.9927248,0.00019242046,0.000020993333,0.0000069528983,0.000033331162,0.000052104737,0.0002219516],"genre_scores_gemma":[0.60906076,0.00293013,0.38086823,0.0002485715,0.0004823275,0.00016887966,0.00046443657,0.00016962843,0.005606966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989097,0.00060546614,0.000047433743,0.00016942168,0.00018908216,0.00007891451],"domain_scores_gemma":[0.99370414,0.0051502194,0.00034819188,0.00035212078,0.000340497,0.000104924424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039107236,0.00060957245,0.0011862551,0.00067131047,0.00023837073,0.0010045244,0.0011753208,0.0013073642,0.0015064506],"category_scores_gemma":[0.016162908,0.00070651196,0.0005824272,0.0012212582,0.0012482135,0.0017229199,0.0013113638,0.0020321095,0.00029916907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020693544,0.00007715073,0.0018163756,0.00027691125,0.00010537765,0.00015592683,0.00015390107,0.71511304,0.0043186774,0.15949337,0.002566612,0.11571577],"study_design_scores_gemma":[0.0000057248403,0.000010130587,0.00015591597,0.000007508322,0.0000055412124,0.000014190198,0.00000889915,0.98341274,0.00030604404,0.015811067,0.00025750388,0.000004744978],"about_ca_topic_score_codex":0.0023852591,"about_ca_topic_score_gemma":0.0018886406,"teacher_disagreement_score":0.0039107236,"about_ca_system_score_codex":0.00044880947,"about_ca_system_score_gemma":0.00069638196,"threshold_uncertainty_score":0.020682096},"labels":[],"label_agreement":null},{"id":"W2963033110","doi":"","title":"Fast GPU Implementation of Sparse Signal Recovery from Random Projections","year":2009,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"CUDA; Computer science; Matching pursuit; SIGNAL (programming language); Parallel computing; Matching (statistics); Computational science; Algorithm; Compressed sensing; Mathematics","score_opus":0.015728898951755187,"score_gpt":0.25633642217951497,"score_spread":0.24060752322775977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963033110","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07644268,0.0004986588,0.89081746,0.0005338124,0.00023701813,0.00010133925,0.00074991916,0.014296674,0.016322395],"genre_scores_gemma":[0.44572756,0.00023063632,0.54500747,0.00016067509,0.000044375258,0.00018851913,0.0011817197,0.0008053696,0.006653723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996792,0.000087845074,0.000014715947,0.000037905666,0.00013366484,0.000046714715],"domain_scores_gemma":[0.9994685,0.00015015592,0.0000239561,0.00010921471,0.00021510584,0.00003314361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032566924,0.00062706374,0.00060528197,0.00044816412,0.00035377417,0.00085361564,0.0011680413,0.00060522254,0.009110089],"category_scores_gemma":[0.0016340712,0.00020624248,0.00031847833,0.00074338296,0.00022359323,0.0005713032,0.00055228017,0.0006225135,0.0019440223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029911047,0.00035317597,0.005513039,0.0005251202,0.00027725092,0.0014939936,0.000492539,0.27176964,0.08207787,0.045492973,0.064307846,0.5247056],"study_design_scores_gemma":[0.00010795663,0.00007660559,0.00044534297,0.000015154422,0.000014099217,0.000100959995,0.00003145896,0.96614397,0.018842664,0.0030784102,0.011128708,0.000014729312],"about_ca_topic_score_codex":0.0068354923,"about_ca_topic_score_gemma":0.006575397,"teacher_disagreement_score":0.009110089,"about_ca_system_score_codex":0.0005218613,"about_ca_system_score_gemma":0.0006178837,"threshold_uncertainty_score":0.030476272},"labels":[],"label_agreement":null},{"id":"W2963109107","doi":"10.1016/j.laa.2016.03.022","title":"The gap between the null space property and the restricted isometry property","year":2016,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Property (philosophy); Isometry (Riemannian geometry); Null (SQL); Restricted isometry property; Pure mathematics; Space (punctuation); Algorithm; Computer science","score_opus":0.018620150370881414,"score_gpt":0.2288518550243481,"score_spread":0.2102317046534667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963109107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04882422,0.0065952423,0.856317,0.012624707,0.0008808294,0.00004625187,0.0005551945,0.00027203004,0.0738846],"genre_scores_gemma":[0.8680965,0.010592445,0.09276129,0.0053043277,0.004207912,0.00023813745,0.00079714303,0.0004205138,0.017581701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689436,0.0010672458,0.00016645648,0.0006102711,0.0010543183,0.00020730862],"domain_scores_gemma":[0.9846127,0.011361141,0.00075865164,0.0018810558,0.0009788101,0.0004077231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038087238,0.0007936728,0.0017203449,0.0013988607,0.00090142014,0.0028074312,0.0014597679,0.002243377,0.0072504045],"category_scores_gemma":[0.016844613,0.00050506357,0.0008234598,0.0014946131,0.008006454,0.011177768,0.004505868,0.0057341,0.0012352049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047654295,0.000017348488,0.00010723485,0.00009461908,0.000011110191,0.00005612859,0.00008283274,0.0013976374,0.0009133435,0.98554707,0.001587057,0.010137941],"study_design_scores_gemma":[0.000011927798,0.000029062068,0.00011971588,0.000018076842,0.000004391383,0.00014637936,0.00003582152,0.01092327,0.00044608672,0.9859854,0.0022665951,0.000013399407],"about_ca_topic_score_codex":0.0004948364,"about_ca_topic_score_gemma":0.00021658969,"teacher_disagreement_score":0.0072504045,"about_ca_system_score_codex":0.00058188115,"about_ca_system_score_gemma":0.0007858063,"threshold_uncertainty_score":0.024254978},"labels":[],"label_agreement":null},{"id":"W2963117168","doi":"","title":"Negative eigenvalues of the Hessian in deep neural networks","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Hessian matrix; Eigenvalues and eigenvectors; Deep learning; Artificial neural network; Deep neural networks; Function (biology); Computer science; Hessian equation; Artificial intelligence; Matrix (chemical analysis); Work (physics); Applied mathematics; Mathematical optimization; Mathematics; Engineering; Mathematical analysis; Physics","score_opus":0.03369257548278821,"score_gpt":0.3082430648912333,"score_spread":0.2745504894084451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963117168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22615848,0.0018984334,0.75995964,0.0017906461,0.00007732054,0.000034978126,0.00018023486,0.00039050792,0.009509754],"genre_scores_gemma":[0.94989043,0.0012320648,0.042043354,0.0001738196,0.00009297844,0.0000736603,0.00014895976,0.00017736304,0.0061673876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963,0.00014915137,0.0000137028765,0.00005522128,0.000108931185,0.00004306014],"domain_scores_gemma":[0.9974584,0.0017600686,0.00024670616,0.00013493522,0.0002593185,0.00014060515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570358,0.0006195534,0.00047991233,0.00060229586,0.00037604966,0.0011535266,0.00050020043,0.00079080433,0.001863847],"category_scores_gemma":[0.007006197,0.00052127097,0.00026770963,0.00037452005,0.0020507816,0.001948011,0.00096650375,0.0013242591,0.00024256171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013877137,0.00006695759,0.0022597357,0.0001968695,0.00003509232,0.0002891582,0.00023396107,0.60268134,0.009521049,0.35123828,0.004445792,0.028892992],"study_design_scores_gemma":[0.0000076192146,0.0000240153,0.0006697435,0.00002413149,0.0000031556424,0.000051325263,0.000042527052,0.8260779,0.0009053441,0.17168899,0.00048834365,0.000016897906],"about_ca_topic_score_codex":0.002178755,"about_ca_topic_score_gemma":0.0020435085,"teacher_disagreement_score":0.002178755,"about_ca_system_score_codex":0.0006441609,"about_ca_system_score_gemma":0.00049338717,"threshold_uncertainty_score":0.006647885},"labels":[],"label_agreement":null},{"id":"W2963183022","doi":"10.1007/s00211-019-01051-9","title":"Correcting for unknown errors in sparse high-dimensional function approximation","year":2019,"lang":"en","type":"article","venue":"Numerische Mathematik","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Pointwise; Lasso (programming language); Mathematics; A priori and a posteriori; Bounded function; Applied mathematics; Mathematical optimization; Focus (optics); Function approximation; Algorithm; Function (biology); Approximation algorithm; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.013014658915761045,"score_gpt":0.2198687291655071,"score_spread":0.20685407024974606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963183022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0141576715,0.00020903397,0.98473793,0.00022181675,0.000060887374,0.00000712958,0.00002863876,0.0001545453,0.00042238348],"genre_scores_gemma":[0.51772046,0.00087757123,0.47687367,0.00024267739,0.0002460694,0.00006075081,0.00024418405,0.00012734941,0.003607277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986608,0.0004063776,0.00006708144,0.00018850558,0.0005994856,0.00007779282],"domain_scores_gemma":[0.9944798,0.0034770202,0.00041525936,0.0009437519,0.0005811729,0.000103055674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018686007,0.00078963605,0.00091501203,0.0005931833,0.00045147477,0.00093963457,0.00091198954,0.0018600762,0.00083508075],"category_scores_gemma":[0.015900154,0.00050371955,0.0004486589,0.00080941373,0.001502855,0.0018909358,0.0017393354,0.0020874685,0.00031374802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038072214,0.00008016289,0.0013986038,0.00022582052,0.00011844054,0.00015871284,0.00023929866,0.72434413,0.027403744,0.056184713,0.002551389,0.18691419],"study_design_scores_gemma":[0.0000068212794,0.000023361981,0.0001744559,0.000009977897,0.000007025485,0.00005151239,0.000014748036,0.9829678,0.0053721517,0.010899418,0.00046258935,0.000010192],"about_ca_topic_score_codex":0.0018487788,"about_ca_topic_score_gemma":0.0021421837,"teacher_disagreement_score":0.0018686007,"about_ca_system_score_codex":0.00041038293,"about_ca_system_score_gemma":0.00082618167,"threshold_uncertainty_score":0.009882271},"labels":[],"label_agreement":null},{"id":"W2963204788","doi":"10.5555/3310435.3310519","title":"Proportional volume sampling and approximation algorithms for A-optimal design","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Approximation algorithm; Mathematics; Matrix (chemical analysis); Mathematical optimization; Algorithm; Measure (data warehouse); Applied mathematics; Computer science","score_opus":0.02753062799451619,"score_gpt":0.26014384067166735,"score_spread":0.23261321267715115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963204788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017944393,0.00034974038,0.9966666,0.0001283501,0.000035059795,0.00004250132,0.000021892478,0.00013116396,0.00083027774],"genre_scores_gemma":[0.1951407,0.00096593995,0.79880065,0.00049947604,0.00021968408,0.00075290934,0.00035144924,0.00024205314,0.003027038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957159,0.0022320445,0.00022646645,0.00055043714,0.001010548,0.00026445495],"domain_scores_gemma":[0.97708595,0.019267218,0.00087238784,0.0013285025,0.0010932978,0.00035270804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065994025,0.002827501,0.0027913952,0.0019346864,0.00080116163,0.0020282287,0.0021339902,0.0024132289,0.0035708805],"category_scores_gemma":[0.033624023,0.0015578342,0.0016909835,0.0020416346,0.0025143225,0.0027394278,0.0029171547,0.0035848117,0.00086876337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020954925,0.00011120336,0.00084500446,0.0002072852,0.00008981139,0.00006886302,0.00012418722,0.86189926,0.0010009749,0.08159126,0.0016029655,0.052249625],"study_design_scores_gemma":[0.000023768422,0.00004046543,0.00004068646,0.000017162203,0.000008168284,0.000019056999,0.000009136117,0.96422,0.00025498544,0.034706056,0.00065397145,0.0000065099143],"about_ca_topic_score_codex":0.0049750158,"about_ca_topic_score_gemma":0.003372738,"teacher_disagreement_score":0.0065994025,"about_ca_system_score_codex":0.0021869629,"about_ca_system_score_gemma":0.0019755333,"threshold_uncertainty_score":0.03490138},"labels":[],"label_agreement":null},{"id":"W2963237294","doi":"10.1142/s0219199719500275","title":"Random polytopes obtained by matrices with heavy-tailed entries","year":2019,"lang":"en","type":"article","venue":"Communications in Contemporary Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Quotient; Preprint; Combinatorics; Random matrix; Polytope; Matrix (chemical analysis); Ball (mathematics); Discrete mathematics; Geometry; Eigenvalues and eigenvectors","score_opus":0.03328655870174676,"score_gpt":0.26324225578846233,"score_spread":0.22995569708671557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963237294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20156105,0.0016394036,0.76109505,0.0011702481,0.00025067665,0.00033878238,0.003147215,0.00072946295,0.030068127],"genre_scores_gemma":[0.8616097,0.002577648,0.106740184,0.0007906465,0.00050764304,0.0010701313,0.004654254,0.00048084822,0.021569017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975,0.00065745646,0.00012372293,0.00066666893,0.00058647455,0.00046575224],"domain_scores_gemma":[0.9912924,0.004693558,0.0014118109,0.0010884417,0.0007021506,0.0008116178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017743212,0.0019575357,0.0016898843,0.0020335189,0.001078074,0.0029909771,0.0014651442,0.0013815719,0.009732064],"category_scores_gemma":[0.011961678,0.0009752668,0.0018763347,0.0011111653,0.0035564627,0.0039008805,0.002824386,0.0029357474,0.0016770965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005798077,0.00012226518,0.001930455,0.00045253156,0.00013742526,0.0008940476,0.00024977323,0.14752983,0.01003385,0.81495595,0.0071143527,0.015999658],"study_design_scores_gemma":[0.000117669435,0.00027721393,0.0024151353,0.00014178369,0.00005730781,0.0004910947,0.00015424372,0.5917435,0.006371787,0.39184996,0.006266601,0.00011361165],"about_ca_topic_score_codex":0.001957097,"about_ca_topic_score_gemma":0.001187484,"teacher_disagreement_score":0.009732064,"about_ca_system_score_codex":0.0013345667,"about_ca_system_score_gemma":0.0010305807,"threshold_uncertainty_score":0.03255701},"labels":[],"label_agreement":null},{"id":"W2963275613","doi":"10.1049/el.2013.2222","title":"Improved bounds on restricted isometry constant for orthogonal matching pursuit","year":2013,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; National Natural Science Foundation of China","keywords":"Matching pursuit; Isometry (Riemannian geometry); Constant (computer programming); Mathematics; Matching (statistics); Computer science; Combinatorics; Algorithm; Control theory (sociology); Pure mathematics; Artificial intelligence; Statistics; Control (management); Compressed sensing","score_opus":0.007405444504953677,"score_gpt":0.20907164726229713,"score_spread":0.20166620275734345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963275613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017194487,0.0050364775,0.95168775,0.0016891266,0.00040959357,0.00010980213,0.00027049307,0.0010482685,0.02255411],"genre_scores_gemma":[0.54031444,0.0064754765,0.43780798,0.0011859227,0.0011142667,0.00062628713,0.00077971275,0.0008716307,0.010824306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934748,0.0015008238,0.0002831085,0.0012702978,0.0026361814,0.00083483296],"domain_scores_gemma":[0.95742476,0.027855989,0.0020902536,0.008095121,0.0037024051,0.0008315604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007871369,0.0041018827,0.0021818723,0.0033137721,0.0012308436,0.0030024268,0.0034158148,0.002611604,0.0070669632],"category_scores_gemma":[0.06564255,0.0011354651,0.0019872058,0.003164837,0.004685788,0.011187654,0.008557999,0.010927382,0.0025510944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018133819,0.0003643654,0.003053708,0.0009796633,0.000276731,0.00095166266,0.00070547167,0.24505974,0.033195335,0.5042335,0.01810345,0.19126299],"study_design_scores_gemma":[0.000056947236,0.00022874918,0.0007915099,0.00018058122,0.00008921959,0.00062503724,0.00011135668,0.7760462,0.014232412,0.1983639,0.009154319,0.00011980394],"about_ca_topic_score_codex":0.0018902564,"about_ca_topic_score_gemma":0.0015295378,"teacher_disagreement_score":0.007871369,"about_ca_system_score_codex":0.0025948368,"about_ca_system_score_gemma":0.0025537554,"threshold_uncertainty_score":0.0416283},"labels":[],"label_agreement":null},{"id":"W2963292690","doi":"10.1007/s10107-013-0714-4","title":"Iterative hard thresholding methods for $$l_0$$ l 0 regularized convex cone programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Regular polygon; Convex optimization; Relaxation (psychology); Mathematical optimization; Quadratic programming; Sequence (biology); Convex cone; Cone (formal languages); Thresholding; Iterative method; Limit point; Interior point method; Applied mathematics; Algorithm; Convex analysis; Computer science; Mathematical analysis; Geometry; Image (mathematics); Artificial intelligence","score_opus":0.04073664706120077,"score_gpt":0.3230238328338438,"score_spread":0.282287185772643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963292690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010240269,0.00015237044,0.9961748,0.0002063242,0.00005313732,0.000026718204,0.0000318205,0.000064477295,0.0022663502],"genre_scores_gemma":[0.1136646,0.0008745695,0.8681259,0.00044977613,0.00034020017,0.00053130026,0.00032955586,0.00053335505,0.015150739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985337,0.00072096824,0.000061027025,0.00019894037,0.00039212382,0.00009324591],"domain_scores_gemma":[0.9952691,0.0033997514,0.00023903602,0.00023213681,0.0006990158,0.0001607986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031922737,0.0017227837,0.0014565164,0.0010032802,0.0005921718,0.0024964546,0.0025092522,0.0020484896,0.005797528],"category_scores_gemma":[0.013516219,0.0010253349,0.0012412623,0.0012951844,0.002586376,0.0023905197,0.0030996143,0.005043057,0.0012310962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000763504,0.00012935305,0.00025155887,0.00038461515,0.000067286266,0.00010746134,0.00019728641,0.4184717,0.002639299,0.4753771,0.010101274,0.092196666],"study_design_scores_gemma":[0.000007080496,0.000013624761,0.000028081275,0.000018243913,0.000005027791,0.000013158002,0.000013552631,0.943028,0.00037608392,0.055083152,0.0014048474,0.000009225158],"about_ca_topic_score_codex":0.0037015122,"about_ca_topic_score_gemma":0.0037839208,"teacher_disagreement_score":0.005797528,"about_ca_system_score_codex":0.0014301975,"about_ca_system_score_gemma":0.0024454948,"threshold_uncertainty_score":0.019394696},"labels":[],"label_agreement":null},{"id":"W2963378461","doi":"10.1049/iet-spr.2018.5037","title":"Sharp sufficient condition of block signal recovery via <i>l</i> <sub>2</sub> / <i>l</i> <sub>1</sub> ‐minimisation","year":2019,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Minimisation (clinical trials); Signal recovery; Signal processing; Computer science; Mathematics; Minification; Algorithm; Mathematical optimization; Telecommunications; Statistics; Compressed sensing","score_opus":0.008403849006667102,"score_gpt":0.20383061582777035,"score_spread":0.19542676682110324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963378461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021620918,0.00057335256,0.970539,0.00051100407,0.00009593954,0.00007020245,0.0001715412,0.00018310915,0.0062349383],"genre_scores_gemma":[0.7998358,0.0012243742,0.19273233,0.00065112684,0.00025647445,0.0003703418,0.00054113526,0.00018240834,0.0042060884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876887,0.0003052131,0.00010764222,0.0002783944,0.00039848883,0.00014141937],"domain_scores_gemma":[0.9965252,0.0018898832,0.0004541303,0.00027032333,0.0007193273,0.00014111526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015877716,0.001052356,0.00083526096,0.0008742952,0.0003524724,0.0010346047,0.0007607612,0.0013661764,0.0037741994],"category_scores_gemma":[0.010032814,0.00039999495,0.0007231464,0.00044906922,0.0018692039,0.0021859922,0.0017574087,0.0020770086,0.00093430484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008847049,0.00015198819,0.0023601379,0.0017772914,0.00012564582,0.0014301573,0.00095392345,0.16981268,0.29226196,0.42820746,0.010597482,0.09143666],"study_design_scores_gemma":[0.00009389943,0.0005216742,0.0013550202,0.00013737097,0.00003743313,0.0010370912,0.00019716518,0.8167265,0.08431384,0.08789498,0.0075632264,0.00012172739],"about_ca_topic_score_codex":0.0005545137,"about_ca_topic_score_gemma":0.0003366659,"teacher_disagreement_score":0.0037741994,"about_ca_system_score_codex":0.00038160174,"about_ca_system_score_gemma":0.00097319094,"threshold_uncertainty_score":0.012625933},"labels":[],"label_agreement":null},{"id":"W2963397028","doi":"","title":"Dependent Nonparametric Bayesian Group Dictionary Learning for online reconstruction of Dynamic MR images","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta Hospital","funders":"","keywords":"Dictionary learning; Computer science; Artificial intelligence; A priori and a posteriori; Pattern recognition (psychology); Bayesian probability; Iterative reconstruction; Algorithm; Image (mathematics)","score_opus":0.0081986518185435,"score_gpt":0.22803489720436168,"score_spread":0.21983624538581817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963397028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010332069,0.00008695316,0.9985349,0.00005031964,0.000007268725,0.000006841489,0.000010757345,0.00007494916,0.0001948341],"genre_scores_gemma":[0.14534071,0.0006068123,0.85146683,0.0001585096,0.00008939307,0.00011344268,0.00023930447,0.00014570414,0.0018392109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953854,0.00018713553,0.000021808108,0.00007756386,0.00014888163,0.000026139323],"domain_scores_gemma":[0.99889153,0.00061850075,0.00013643412,0.0001666974,0.00013604977,0.00005068753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010111338,0.00057975703,0.0009434233,0.0005495127,0.00023090639,0.0005279807,0.0010130628,0.00089589896,0.0014044945],"category_scores_gemma":[0.0035828026,0.00038285318,0.00050569966,0.000764579,0.00063263293,0.0010557661,0.001035839,0.001376433,0.00066919863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027400983,0.00009770242,0.0007169458,0.0004192688,0.00009425801,0.00015320376,0.00017720582,0.5512991,0.023032736,0.045885276,0.005166445,0.37268376],"study_design_scores_gemma":[0.000009965207,0.000021451158,0.000058525,0.000006893921,0.0000047539597,0.00004254911,0.0000075662942,0.99160695,0.0015716424,0.005304997,0.0013585816,0.0000061134215],"about_ca_topic_score_codex":0.0013514252,"about_ca_topic_score_gemma":0.0014940902,"teacher_disagreement_score":0.0014044945,"about_ca_system_score_codex":0.000355039,"about_ca_system_score_gemma":0.0006935767,"threshold_uncertainty_score":0.0053474307},"labels":[],"label_agreement":null},{"id":"W2963401972","doi":"10.1214/17-ejs1325","title":"Sparse transition matrix estimation for high-dimensional and locally stationary vector autoregressive models","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Estimator; Autoregressive model; Smoothing; Rate of convergence; Smoothness; Applied mathematics; Matrix (chemical analysis); Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.011509019465785093,"score_gpt":0.25471850930579854,"score_spread":0.24320948984001345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963401972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012823216,0.00009524266,0.98666984,0.00009369044,0.000011260724,0.0000083613595,0.000037180933,0.00009359176,0.0001676676],"genre_scores_gemma":[0.678532,0.00083010405,0.31656536,0.00017536897,0.00017163002,0.0001229877,0.0006515549,0.000095992604,0.002854897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993992,0.00023106762,0.000029352952,0.00017382037,0.00012021851,0.00004635729],"domain_scores_gemma":[0.9962775,0.0027253712,0.0004274815,0.00029159768,0.00021706185,0.000060902254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001518688,0.0005985889,0.00072755624,0.0005415556,0.00024179512,0.00065371866,0.0008896637,0.0008681163,0.00087769947],"category_scores_gemma":[0.008076365,0.00035715938,0.0006748385,0.00074846833,0.0008346261,0.0011164108,0.0008460444,0.0016713676,0.00025308615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009547633,0.000061501465,0.0024833784,0.00013888479,0.00009260637,0.00015319945,0.00011221605,0.86339396,0.007887529,0.04793461,0.0008834932,0.07676303],"study_design_scores_gemma":[0.0000029636844,0.000013399425,0.00022963276,0.0000035492214,0.0000051171555,0.000016289014,0.0000052060236,0.99088377,0.00059009565,0.008084634,0.00015947875,0.0000059097956],"about_ca_topic_score_codex":0.0023617405,"about_ca_topic_score_gemma":0.0024045727,"teacher_disagreement_score":0.0023617405,"about_ca_system_score_codex":0.0003248407,"about_ca_system_score_gemma":0.0005764164,"threshold_uncertainty_score":0.008031666},"labels":[],"label_agreement":null},{"id":"W2963414100","doi":"","title":"Side Information-Aided Compressed Sensing Reconstruction via Approximate Message Passing","year":2013,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compressed sensing; Underdetermined system; Lasso (programming language); Message passing; Elastic net regularization; Algorithm; Computer science; Signal reconstruction; Bounded function; Scalar (mathematics); SIGNAL (programming language); Reconstruction algorithm; Relaxation (psychology); Noise reduction; Noise (video); Signal processing; Mathematics; Artificial intelligence; Iterative reconstruction; Feature selection; Telecommunications; Mathematical analysis; Geometry","score_opus":0.025200766722563044,"score_gpt":0.14563013751804604,"score_spread":0.12042937079548299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963414100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008642147,0.00015303014,0.99005556,0.0002009687,0.000018165285,0.000019425082,0.000039512146,0.00010818891,0.0007629189],"genre_scores_gemma":[0.61776227,0.0005823322,0.37574682,0.00032565297,0.00015535412,0.00019753538,0.0003199797,0.00009118403,0.004818837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988416,0.00054588355,0.00004363981,0.00017407829,0.0003112778,0.00008356559],"domain_scores_gemma":[0.99773127,0.0016216371,0.00022197273,0.00020801305,0.00016994652,0.000047221707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021487335,0.00115858,0.0012570507,0.00050549896,0.00034930004,0.0008869962,0.0012234593,0.00134063,0.001284258],"category_scores_gemma":[0.005609063,0.00047867172,0.00053841266,0.00080202165,0.0014107857,0.0020042134,0.0016900597,0.0016646541,0.00032824112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025606636,0.0000428865,0.00038945198,0.00013499089,0.000052119918,0.00014618368,0.000118572534,0.892159,0.0037616156,0.048754223,0.0009573188,0.053227495],"study_design_scores_gemma":[0.000009396822,0.000022085913,0.000030540825,0.0000047946323,0.0000044538738,0.000023458688,0.00000562666,0.9920089,0.0008759332,0.0067491243,0.00026004922,0.0000056104564],"about_ca_topic_score_codex":0.0015994819,"about_ca_topic_score_gemma":0.001453867,"teacher_disagreement_score":0.0021487335,"about_ca_system_score_codex":0.000600786,"about_ca_system_score_gemma":0.0008255753,"threshold_uncertainty_score":0.011363745},"labels":[],"label_agreement":null},{"id":"W2963465316","doi":"10.1109/isit.2011.6034172","title":"Density evolution analysis of node-based verification-based algorithms in compressed sensing","year":2011,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Computer science; Compressed sensing; Node (physics); Context (archaeology); Message passing; Decoding methods; Asymptotic analysis; Dimension (graph theory); Iterative method; Signal processing; Mathematics; Digital signal processing; Parallel computing","score_opus":0.029932507992517114,"score_gpt":0.22311155005054623,"score_spread":0.1931790420580291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963465316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081946,0.00021279708,0.9894796,0.00016627603,0.000013330699,0.000037207246,0.000020505471,0.00007401069,0.0018016151],"genre_scores_gemma":[0.7070294,0.0014093721,0.28389108,0.00028865313,0.00012224073,0.00034234158,0.00021515304,0.0002000301,0.006501872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998531,0.0005052344,0.00004671315,0.00014140067,0.00067036715,0.00010532776],"domain_scores_gemma":[0.9901516,0.0077711237,0.0005379287,0.00047220185,0.0009426729,0.00012453842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033272933,0.0007759938,0.0007880211,0.0009752241,0.0004506157,0.00087939005,0.001429994,0.001016504,0.0016262524],"category_scores_gemma":[0.020575494,0.0004764641,0.00053884654,0.0007675498,0.0022443014,0.0027366155,0.0015611724,0.0014980607,0.00030215533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000721849,0.000028911558,0.0006970796,0.00016308685,0.00003761253,0.00007229699,0.00020880024,0.71604866,0.0049608103,0.25157914,0.0006440535,0.02548731],"study_design_scores_gemma":[0.0000020333223,0.000010741268,0.00006637751,0.000007820813,0.000003023531,0.000017874143,0.000007755053,0.9858986,0.00089100486,0.012850615,0.00023891928,0.000005277554],"about_ca_topic_score_codex":0.0024148284,"about_ca_topic_score_gemma":0.0012343874,"teacher_disagreement_score":0.0033272933,"about_ca_system_score_codex":0.0016730162,"about_ca_system_score_gemma":0.0014631065,"threshold_uncertainty_score":0.017596602},"labels":[],"label_agreement":null},{"id":"W2963527927","doi":"10.1007/s11425-016-9018-x","title":"Robustness properties of dimensionality reduction with Gaussian random matrices","year":2017,"lang":"en","type":"article","venue":"Science China Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Restricted isometry property; Mathematics; Gaussian; Robustness (evolution); Erasure; Combinatorics; Applied mathematics; Compressed sensing; Discrete mathematics; Algorithm; Computer science","score_opus":0.024646579864020173,"score_gpt":0.24513534164376488,"score_spread":0.22048876177974472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963527927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100871444,0.00085309497,0.8908431,0.0009771705,0.000105308856,0.000053328247,0.00028482053,0.0002549103,0.005756862],"genre_scores_gemma":[0.937756,0.0009276031,0.05751864,0.00020232165,0.0002761909,0.00011072164,0.00045303706,0.00010790405,0.0026475994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970798,0.0010506151,0.00012963469,0.00049335376,0.001002621,0.0002439957],"domain_scores_gemma":[0.981948,0.013268255,0.0016288566,0.0015903218,0.0012442666,0.0003202268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003241596,0.0012097014,0.0010377018,0.0014491734,0.0004440558,0.001485409,0.0009664766,0.001197647,0.0017631793],"category_scores_gemma":[0.025477936,0.00047997208,0.00074460026,0.0009956402,0.0022503962,0.0025734713,0.0019365842,0.0015530895,0.00035024638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014129047,0.00014339678,0.00286043,0.000399169,0.0003108466,0.00037073166,0.00027636526,0.6321979,0.030523503,0.24358247,0.0032777227,0.08464456],"study_design_scores_gemma":[0.000025233927,0.00011468676,0.0009653865,0.000018304945,0.000026042735,0.00013074165,0.00003963778,0.9392171,0.00576504,0.053121418,0.0005461088,0.000030410478],"about_ca_topic_score_codex":0.0011020078,"about_ca_topic_score_gemma":0.00053665886,"teacher_disagreement_score":0.003241596,"about_ca_system_score_codex":0.00074239075,"about_ca_system_score_gemma":0.0008511742,"threshold_uncertainty_score":0.017143428},"labels":[],"label_agreement":null},{"id":"W2963547867","doi":"10.1287/moor.2017.0865","title":"Generalized Conjugate Gradient Methods for <i>ℓ</i><sub>1</sub> Regularized Convex Quadratic Programming with Finite Convergence","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hong Kong Polytechnic University","keywords":"Mathematics; Subgradient method; Conjugate gradient method; Line search; Mathematical optimization; Applied mathematics; Convex function; Subroutine; Norm (philosophy); Regular polygon; Computer science","score_opus":0.10755612476807822,"score_gpt":0.4067246504182096,"score_spread":0.2991685256501314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963547867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010331139,0.000114234455,0.9978219,0.00005477204,0.000024481373,0.00002665057,0.000010787703,0.00014015372,0.00077388244],"genre_scores_gemma":[0.06634726,0.00042384735,0.92803925,0.00016686345,0.00008198512,0.00030529074,0.00010683396,0.0003860179,0.0041425917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991641,0.00034119314,0.00003325045,0.00010428853,0.00029768338,0.000059573762],"domain_scores_gemma":[0.9986557,0.0007259819,0.00013076536,0.00015831727,0.0002710943,0.000058176887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016628094,0.0013769357,0.0010645342,0.0006494156,0.00041570058,0.00091345666,0.0014711273,0.0011404749,0.0040415004],"category_scores_gemma":[0.004152277,0.0006119451,0.001158857,0.000765634,0.0015659335,0.001143218,0.0014886666,0.0025621695,0.0013116902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001318745,0.00007171814,0.00046692285,0.00040098943,0.000097150005,0.00014604237,0.00014416125,0.7281699,0.007891969,0.13111265,0.0053255297,0.12604107],"study_design_scores_gemma":[0.000011172115,0.000023439441,0.00004514099,0.000011951023,0.0000050152785,0.000024084105,0.0000064068618,0.98472786,0.0013197964,0.011645375,0.002171446,0.000008409543],"about_ca_topic_score_codex":0.0024833016,"about_ca_topic_score_gemma":0.002586414,"teacher_disagreement_score":0.0040415004,"about_ca_system_score_codex":0.0008559937,"about_ca_system_score_gemma":0.0016024054,"threshold_uncertainty_score":0.013520122},"labels":[],"label_agreement":null},{"id":"W2963548849","doi":"10.1109/tit.2017.2788445","title":"Robustness to Unknown Error in Sparse Regularization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; Alfred P. Sloan Foundation","keywords":"Robustness (evolution); Orthonormal basis; Compressed sensing; Mathematics; Bounded function; Quadratic growth; Quotient; Gaussian; Algorithm; A priori and a posteriori; Computer science; Mathematical optimization; Combinatorics","score_opus":0.01239149005046198,"score_gpt":0.2279077615430635,"score_spread":0.21551627149260152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963548849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04039951,0.00063230726,0.95405525,0.0005970424,0.00004793837,0.000036214333,0.00011542163,0.000230102,0.0038862021],"genre_scores_gemma":[0.92823577,0.0010351307,0.06786454,0.000259242,0.0001338256,0.00013475693,0.00024157487,0.00018326314,0.0019120292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99478626,0.0021204392,0.00024997068,0.0009161751,0.0015455413,0.00038151577],"domain_scores_gemma":[0.9647495,0.027409319,0.002153915,0.0027490426,0.0025190115,0.00041913096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006687455,0.0014023843,0.0011599294,0.0012870608,0.00059454003,0.0019298273,0.0012867515,0.0013477146,0.0014425548],"category_scores_gemma":[0.048880026,0.00053192704,0.001282068,0.0008102603,0.00473303,0.0031943426,0.0042036287,0.002671265,0.0003689475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006446972,0.00006656816,0.0020522168,0.0003508178,0.00017865746,0.0003755198,0.00038556004,0.51657575,0.026134493,0.41106606,0.0013381835,0.040831488],"study_design_scores_gemma":[0.000015749763,0.00012236924,0.00039743882,0.000035721037,0.00001711007,0.00010205803,0.0000418678,0.8992302,0.007681428,0.09175407,0.000572805,0.000029091001],"about_ca_topic_score_codex":0.0013062223,"about_ca_topic_score_gemma":0.0003672277,"teacher_disagreement_score":0.006687455,"about_ca_system_score_codex":0.0015426925,"about_ca_system_score_gemma":0.0012188404,"threshold_uncertainty_score":0.035367012},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00989813726740284,"score_gpt":0.2101253392150519,"score_spread":0.20022720194764904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963586744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042756954,0.00019194464,0.9940329,0.0002940103,0.000026778584,0.00001633156,0.000008502149,0.0000930961,0.0010607865],"genre_scores_gemma":[0.35108194,0.0012481684,0.64111185,0.0004323488,0.00018353056,0.00028374337,0.000107945874,0.00030094045,0.005249548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955684,0.00021909164,0.000021643911,0.00004691964,0.00012566312,0.000029701261],"domain_scores_gemma":[0.9970822,0.0022759284,0.00022014992,0.00018216639,0.00016854706,0.00007099653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021371625,0.0009893855,0.0009811593,0.0006093235,0.00053655735,0.0007838633,0.0009013574,0.0013239534,0.0014709374],"category_scores_gemma":[0.007485571,0.0005727753,0.0007480572,0.00042378274,0.0021159912,0.0012220285,0.0019005501,0.002294962,0.000460157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006670298,0.000033383865,0.00072047324,0.00019953048,0.00008212027,0.00015862373,0.00020497115,0.8331126,0.0041689025,0.1244844,0.0022828924,0.034485437],"study_design_scores_gemma":[0.000007663787,0.000023507144,0.00007056957,0.000013779525,0.0000037460434,0.000027739872,0.000011027836,0.96394104,0.00058145047,0.03450537,0.00080746383,0.0000066188572],"about_ca_topic_score_codex":0.0019210688,"about_ca_topic_score_gemma":0.00224453,"teacher_disagreement_score":0.0021371625,"about_ca_system_score_codex":0.0004612797,"about_ca_system_score_gemma":0.0010109595,"threshold_uncertainty_score":0.01130259},"labels":[],"label_agreement":null},{"id":"W2963598490","doi":"10.1287/moor.2017.0905","title":"Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Restricted isometry property; Augmented Lagrangian method; Regularization (linguistics); Compressed sensing; Mathematical optimization; Sequence (biology); Applied mathematics; Optimization problem; Class (philosophy); Sparse approximation; Algorithm; Computer science; Artificial intelligence","score_opus":0.077372146898713,"score_gpt":0.33510701628345224,"score_spread":0.2577348693847392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963598490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025238825,0.0014462254,0.9936754,0.0005964986,0.0000356976,0.000025292497,0.000060442242,0.00010432354,0.001532261],"genre_scores_gemma":[0.44388452,0.013159691,0.5244912,0.0010370134,0.0011247081,0.0008878618,0.00089111115,0.0003652204,0.0141587285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866056,0.00060226524,0.000051065326,0.00023263923,0.00034279373,0.000110760586],"domain_scores_gemma":[0.99638546,0.0024347645,0.00038703694,0.000322419,0.00035708718,0.00011328078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026224023,0.0015947965,0.0015871124,0.0014081495,0.0005820595,0.0018473328,0.0020696623,0.0022110003,0.0023732316],"category_scores_gemma":[0.007938749,0.00086238666,0.0013858817,0.002337163,0.002951044,0.003549904,0.0030940322,0.0035667974,0.0006256122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005471498,0.00006742823,0.00067340164,0.000335324,0.000078543264,0.000102429185,0.0001367107,0.6046604,0.0013852557,0.33413607,0.005789245,0.05258049],"study_design_scores_gemma":[0.0000069137313,0.000023010038,0.000071879265,0.000021602515,0.000009409913,0.00003397694,0.000011119078,0.91235036,0.00020859121,0.08593245,0.0013184691,0.000012175984],"about_ca_topic_score_codex":0.004560653,"about_ca_topic_score_gemma":0.0033503773,"teacher_disagreement_score":0.004560653,"about_ca_system_score_codex":0.0013552249,"about_ca_system_score_gemma":0.0015477106,"threshold_uncertainty_score":0.013868749},"labels":[],"label_agreement":null},{"id":"W2963789209","doi":"10.1016/j.jmr.2011.02.015","title":"Accelerating multi-echo T2 weighted MR imaging: Analysis prior group-sparse optimization","year":2011,"lang":"en","type":"article","venue":"Journal of Magnetic Resonance","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Dimension (graph theory); Compressed sensing; Mathematics; Gaussian; Block (permutation group theory); Norm (philosophy); Relaxation (psychology); Minification; Discrete mathematics; Algorithm; Physics; Mathematical optimization; Quantum mechanics","score_opus":0.02864258648951848,"score_gpt":0.23204085948775363,"score_spread":0.20339827299823515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963789209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028421564,0.00011410629,0.9959869,0.00023187528,0.000025792411,0.000016915043,0.000030706633,0.00017156685,0.00058003794],"genre_scores_gemma":[0.08521219,0.00059078383,0.90993816,0.00027146825,0.00010733935,0.00012038567,0.00019430197,0.00023357655,0.003331818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968576,0.00010222015,0.000015267862,0.000048319554,0.00012687178,0.00002153773],"domain_scores_gemma":[0.9990945,0.00040168883,0.00010269067,0.0001526935,0.00019661114,0.00005182788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008864069,0.00074076996,0.00056151033,0.00039347805,0.0003022334,0.0007367887,0.00081492204,0.0012611474,0.002012761],"category_scores_gemma":[0.0032412088,0.0004761701,0.00042078877,0.00078911294,0.00048803946,0.0011111902,0.0014598721,0.0014154952,0.0008601537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030646863,0.00013793199,0.0010919255,0.00044986553,0.0001320281,0.0001521885,0.00025261185,0.5103514,0.05563658,0.054256465,0.011191994,0.36604053],"study_design_scores_gemma":[0.000016875423,0.00004660098,0.00027893553,0.000012980437,0.000021329175,0.00008429299,0.00002003475,0.97615564,0.007813926,0.010754139,0.004779072,0.00001606595],"about_ca_topic_score_codex":0.0016383103,"about_ca_topic_score_gemma":0.003187972,"teacher_disagreement_score":0.002012761,"about_ca_system_score_codex":0.00028160604,"about_ca_system_score_gemma":0.0010982805,"threshold_uncertainty_score":0.006733358},"labels":[],"label_agreement":null},{"id":"W2963856360","doi":"","title":"Generalized Conditional Gradient for Sparse Estimation","year":2017,"lang":"en","type":"article","venue":"Figshare","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"","keywords":"Interleaving; Computer science; Proximal Gradient Methods; Matrix completion; Rank (graph theory); Subspace topology; Subroutine; Mathematical optimization; Convex optimization; Operator (biology); Algorithm; Matrix (chemical analysis); Current (fluid); Series (stratigraphy); Regular polygon; Artificial intelligence; Mathematics; Gradient descent","score_opus":0.07134748396555585,"score_gpt":0.29197516931999473,"score_spread":0.22062768535443888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963856360","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009886243,0.0002212768,0.9973405,0.0001819375,0.000029949812,0.000019434743,0.000044014094,0.00023446271,0.0009398521],"genre_scores_gemma":[0.14499277,0.001314825,0.8469302,0.00035175253,0.00018644983,0.00025926044,0.00044206687,0.0004084853,0.0051141363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932826,0.00032274122,0.000020844784,0.00008275774,0.00020068527,0.000044688368],"domain_scores_gemma":[0.99870336,0.00078321254,0.00007357678,0.0001770707,0.00022021469,0.000042544212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015967329,0.0009360112,0.0007847104,0.00071186136,0.0002941548,0.0009164774,0.0008911161,0.0009767537,0.004290057],"category_scores_gemma":[0.0059779384,0.00035394068,0.00061588647,0.0010095128,0.0011947356,0.0011902143,0.0012466302,0.00208458,0.001376338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097272736,0.000050435032,0.00048115235,0.00032135457,0.000081495455,0.000094799376,0.00009239499,0.44892693,0.0054061287,0.3574853,0.011741954,0.17522068],"study_design_scores_gemma":[0.000007541024,0.000017322758,0.000086918124,0.000016097354,0.0000054561006,0.000035707853,0.0000069147677,0.94452107,0.0010850934,0.05057947,0.0036298372,0.000008615027],"about_ca_topic_score_codex":0.0032318835,"about_ca_topic_score_gemma":0.0032083795,"teacher_disagreement_score":0.004290057,"about_ca_system_score_codex":0.0007168036,"about_ca_system_score_gemma":0.001365394,"threshold_uncertainty_score":0.014351606},"labels":[],"label_agreement":null},{"id":"W2964011032","doi":"10.1109/tsp.2017.2664054","title":"CaSCADE: Compressed Carrier and DOA Estimation","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":123,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Israel Science Foundation","keywords":"Compressed sensing; Computer science; Nyquist rate; Cognitive radio; Narrowband; Wideband; Signal reconstruction; Algorithm; Direction of arrival; Nyquist–Shannon sampling theorem; Sampling (signal processing); SIGNAL (programming language); Context (archaeology); Signal processing; Electronic engineering; Telecommunications; Detector; Wireless; Engineering; Computer vision","score_opus":0.02455861300354502,"score_gpt":0.26679636270807466,"score_spread":0.24223774970452966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964011032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015628714,0.00038617436,0.9800094,0.00017470767,0.000067524576,0.00007093807,0.00009899417,0.00048232218,0.0030812458],"genre_scores_gemma":[0.48976624,0.00062620174,0.502466,0.00030606604,0.00025148096,0.00016125992,0.00053457054,0.000078487996,0.0058096633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987637,0.0002326728,0.000054202592,0.000286811,0.0005716481,0.000091034584],"domain_scores_gemma":[0.9989556,0.00042393923,0.00014269433,0.0002205097,0.00021413094,0.000043179778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066475733,0.0010051309,0.0008760076,0.000717448,0.00034707258,0.0007467417,0.001239676,0.0012710056,0.0030963907],"category_scores_gemma":[0.003777376,0.00038682047,0.00047744182,0.00091297034,0.00064204977,0.0019888717,0.0017578454,0.0009973329,0.0010264819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010243813,0.00019426951,0.0022572256,0.00031240104,0.00010461022,0.0007184484,0.00035705144,0.19442908,0.081793346,0.033282824,0.004797654,0.6807287],"study_design_scores_gemma":[0.000037229634,0.00018463704,0.000738707,0.000030443896,0.000027082993,0.0005544095,0.000040665927,0.96906954,0.017977316,0.0068486463,0.004452338,0.00003900241],"about_ca_topic_score_codex":0.0029667881,"about_ca_topic_score_gemma":0.0029461125,"teacher_disagreement_score":0.0030963907,"about_ca_system_score_codex":0.00038353616,"about_ca_system_score_gemma":0.00074901205,"threshold_uncertainty_score":0.010358512},"labels":[],"label_agreement":null},{"id":"W2964023423","doi":"","title":"COMPRESSIVE SAMPLING FOR ENERGY SPECTRUM ESTIMATION OF TURBULENT FLOWS","year":2015,"lang":"en","type":"article","venue":"MacSphere (McMaster University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Nyquist–Shannon sampling theorem; Compressed sensing; Mathematics; Wavelet; Sampling (signal processing); Energy (signal processing); Signal reconstruction; Matching pursuit; Algorithm; Bandlimiting; Spectral density; Fourier transform; Mathematical analysis; Signal processing; Statistics; Computer science; Filter (signal processing)","score_opus":0.028902647181551614,"score_gpt":0.21503178630832412,"score_spread":0.1861291391267725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964023423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02389942,0.00038435453,0.97433317,0.00018523035,0.000028148539,0.000015790049,0.00003485617,0.00014600185,0.0009730915],"genre_scores_gemma":[0.5743572,0.0007789285,0.42342567,0.00009227348,0.00010496038,0.000057910038,0.0001695658,0.000050579925,0.00096287904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971455,0.00010030731,0.000012971542,0.000030595795,0.00012468573,0.000016876022],"domain_scores_gemma":[0.999288,0.0004847495,0.000060243936,0.00005407983,0.00009133987,0.000021554592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067569956,0.0003863484,0.00030721395,0.00059351494,0.00023523447,0.00034117876,0.0003125759,0.00042401164,0.00067445624],"category_scores_gemma":[0.00356511,0.00019048307,0.00019491513,0.0005209886,0.00047914285,0.0006505272,0.0005730335,0.0006136225,0.00016413584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029380212,0.00006853502,0.0013516458,0.0001421222,0.00003500443,0.00009469114,0.000103887935,0.6510244,0.04341615,0.04000964,0.0019065223,0.26155365],"study_design_scores_gemma":[0.000005130382,0.000014593801,0.00018779073,0.0000053515632,0.0000016911233,0.000015987775,0.000005549736,0.991497,0.0028659487,0.004891359,0.00050457317,0.00000500589],"about_ca_topic_score_codex":0.0015222621,"about_ca_topic_score_gemma":0.0015618815,"teacher_disagreement_score":0.0015222621,"about_ca_system_score_codex":0.00026240115,"about_ca_system_score_gemma":0.00042289656,"threshold_uncertainty_score":0.0035734773},"labels":[],"label_agreement":null},{"id":"W2964079700","doi":"10.1007/s10107-019-01415-x","title":"Applying FISTA to optimization problems (with or) without minimizers","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Lipschitz continuity; Mathematics; Optimization problem; Mathematical optimization; Convex optimization; Regular polygon; Convex function; Applied mathematics; Pure mathematics; Geometry","score_opus":0.01672202299360147,"score_gpt":0.23306028219381705,"score_spread":0.21633825920021557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964079700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015998825,0.00015652325,0.9945193,0.00030135532,0.00006457335,0.000016361319,0.00002955366,0.000075587115,0.0032369257],"genre_scores_gemma":[0.097523026,0.0011267676,0.8879059,0.0005173488,0.00038166123,0.00022973202,0.00017090431,0.00039774962,0.011746938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912065,0.00046154385,0.00004557764,0.00010424292,0.00021352126,0.000054428787],"domain_scores_gemma":[0.99731284,0.0019609728,0.0002116916,0.00021324777,0.00023468955,0.000066518136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002245115,0.001321712,0.0012346884,0.0008124232,0.0004967788,0.0018591505,0.00077634695,0.0014062693,0.0050751828],"category_scores_gemma":[0.008773982,0.0006753976,0.0011178992,0.0011964821,0.0013173636,0.0019287934,0.0019125084,0.0029816423,0.0011328591],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011594512,0.00012496668,0.00040885806,0.00073282997,0.00013116219,0.00021818212,0.0001507457,0.43562856,0.00911254,0.39375526,0.008954591,0.15066649],"study_design_scores_gemma":[0.000009334867,0.000050807834,0.000069909765,0.000049169746,0.000018826639,0.00010822973,0.000036742,0.87239176,0.0021212646,0.12018178,0.0049502584,0.000011845807],"about_ca_topic_score_codex":0.0009333899,"about_ca_topic_score_gemma":0.0012934025,"teacher_disagreement_score":0.0050751828,"about_ca_system_score_codex":0.00043734172,"about_ca_system_score_gemma":0.0012864169,"threshold_uncertainty_score":0.016978204},"labels":[],"label_agreement":null},{"id":"W2964108124","doi":"10.1016/j.acha.2017.05.006","title":"Compressed sensing with local structure: Uniform recovery guarantees for the sparsity in levels class","year":2017,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; Alfred P. Sloan Foundation","keywords":"Compressed sensing; Restricted isometry property; Corollary; Mathematics; Property (philosophy); Signal recovery; Isometry (Riemannian geometry); Algorithm; Wavelet; Class (philosophy); Inverse; Focus (optics); Inverse problem; Current (fluid); Mathematical optimization; Computer science; Pure mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.01833619658808609,"score_gpt":0.2309608375085082,"score_spread":0.21262464092042213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964108124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01819465,0.0006353932,0.97195756,0.0011543144,0.000070225455,0.000033541357,0.00028772588,0.00019279953,0.007473761],"genre_scores_gemma":[0.7879863,0.002406327,0.19664977,0.0011754968,0.0009075851,0.0002488286,0.0009262499,0.0004693048,0.009230053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846053,0.00040730732,0.000049348993,0.0002937909,0.00060790643,0.00018109391],"domain_scores_gemma":[0.9915883,0.005392202,0.0006398979,0.0012876891,0.0007168772,0.00037504532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024894078,0.0013310619,0.0011501428,0.0010237752,0.0005042158,0.0017709755,0.0016575892,0.0018098474,0.005306151],"category_scores_gemma":[0.019648463,0.00058458804,0.00067609857,0.0011921001,0.0024592725,0.004372071,0.0037667428,0.0040346906,0.0010283074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054491987,0.00010039518,0.0007840304,0.00043271543,0.00008367717,0.00019219566,0.00028344605,0.14334556,0.0119916955,0.73541045,0.012229108,0.09460184],"study_design_scores_gemma":[0.000053953332,0.00009477453,0.00038376806,0.000049543098,0.00002024406,0.00016845221,0.00006817577,0.6468495,0.0035271826,0.34627336,0.0024842334,0.000026686228],"about_ca_topic_score_codex":0.0010719901,"about_ca_topic_score_gemma":0.00096515473,"teacher_disagreement_score":0.005306151,"about_ca_system_score_codex":0.0008770971,"about_ca_system_score_gemma":0.0010250777,"threshold_uncertainty_score":0.01775086},"labels":[],"label_agreement":null},{"id":"W2964116109","doi":"","title":"Regularizers versus Losses for Nonlinear Dimensionality Reduction: A Factored View with New Convex Relaxations","year":2012,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Dimensionality reduction; Reduction (mathematics); Regular polygon; Nonlinear system; Mathematics; Curse of dimensionality; Mathematical optimization; Computer science; Applied mathematics; Artificial intelligence; Physics; Geometry","score_opus":0.06546883029256352,"score_gpt":0.3103205734802099,"score_spread":0.2448517431876464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964116109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047993013,0.0005323645,0.99201465,0.0007338153,0.00007437913,0.000027117914,0.00005192822,0.000052710515,0.0017136852],"genre_scores_gemma":[0.23230734,0.0039090714,0.74952644,0.00066824874,0.0010721934,0.00031022116,0.00035160308,0.0003900088,0.011464811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864036,0.00071434927,0.0000683433,0.00021184565,0.00027892514,0.00008622127],"domain_scores_gemma":[0.9972881,0.0016947556,0.00021239814,0.00044731118,0.00024872244,0.00010869465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035967473,0.0021986554,0.0016190705,0.0006835558,0.00039660846,0.001921988,0.0015387175,0.0015737121,0.0031455248],"category_scores_gemma":[0.010331141,0.00072167115,0.0010933481,0.0009760565,0.0024531458,0.0051388796,0.002635385,0.0041323705,0.00056602183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040855902,0.00020013141,0.00032597344,0.00043262125,0.00010725316,0.00014569315,0.00019779641,0.4158923,0.0057779592,0.42536107,0.008452359,0.14269829],"study_design_scores_gemma":[0.000031234114,0.000106785774,0.00008390565,0.000037091748,0.000021271435,0.000068297675,0.000031339052,0.86837107,0.0011938785,0.12714311,0.0028899221,0.000021984246],"about_ca_topic_score_codex":0.0009502225,"about_ca_topic_score_gemma":0.0008176309,"teacher_disagreement_score":0.0035967473,"about_ca_system_score_codex":0.00052998896,"about_ca_system_score_gemma":0.00079293153,"threshold_uncertainty_score":0.01902169},"labels":[],"label_agreement":null},{"id":"W2964223166","doi":"","title":"Average-case hardness of RIP certification","year":2016,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Restricted isometry property; Property (philosophy); Matrix (chemical analysis); Property testing; Time complexity; Computer science; Compressed sensing; Algorithm; Computational complexity theory; Polynomial; Mathematics; Theoretical computer science; Discrete mathematics; Mathematical optimization","score_opus":0.013149852875591065,"score_gpt":0.18199109201622815,"score_spread":0.1688412391406371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964223166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16769968,0.0011256281,0.77140695,0.018855745,0.00029855187,0.00036184015,0.0057352884,0.0029122294,0.03160401],"genre_scores_gemma":[0.91461086,0.0009057963,0.07179446,0.0019835436,0.00053959043,0.00046951236,0.0028381983,0.0005141466,0.006343887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9826402,0.0043194145,0.00138842,0.0051623066,0.003800349,0.002689172],"domain_scores_gemma":[0.8357611,0.13051549,0.007683745,0.017618341,0.0054842015,0.0029372794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009154532,0.0014859317,0.0042995494,0.0013552636,0.0023688832,0.0062889336,0.005968267,0.0049848496,0.011180287],"category_scores_gemma":[0.096208975,0.0013737987,0.0034077114,0.0022765181,0.005177662,0.015432129,0.005865172,0.00851551,0.0019948788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019625127,0.0007096137,0.0074029495,0.0015141811,0.00043470477,0.0017206292,0.0012594324,0.39231497,0.010614757,0.4799313,0.036096234,0.0660388],"study_design_scores_gemma":[0.00018811527,0.00011602782,0.0009155883,0.00007071444,0.00008416526,0.00074007496,0.00021963558,0.3431476,0.0046488494,0.64596283,0.0038367023,0.000069743386],"about_ca_topic_score_codex":0.0018970817,"about_ca_topic_score_gemma":0.0015052259,"teacher_disagreement_score":0.011180287,"about_ca_system_score_codex":0.003385324,"about_ca_system_score_gemma":0.0034701233,"threshold_uncertainty_score":0.04841435},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0968039069539006,"score_gpt":0.33505393154267293,"score_spread":0.2382500245887723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964248738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019914042,0.00004428517,0.9974368,0.00009568672,0.0000071011464,0.000015372727,0.0000068954846,0.000088107125,0.00031446453],"genre_scores_gemma":[0.17048097,0.00021876939,0.8268829,0.0002631582,0.000101979495,0.00036530115,0.00009448513,0.00022644608,0.0013659644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837494,0.00078138965,0.00006158344,0.00021925956,0.0004560471,0.00010683789],"domain_scores_gemma":[0.99377704,0.004416327,0.0005474976,0.0006745095,0.00043126056,0.000153322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037796285,0.0013290574,0.0010456792,0.00075178046,0.0005663176,0.0012166215,0.002469123,0.0014197654,0.00143566],"category_scores_gemma":[0.013596545,0.00072149193,0.00080502394,0.0006881206,0.0025438815,0.0019818537,0.0034520747,0.002848601,0.00047874494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011026306,0.000080312864,0.0009751143,0.00021592662,0.0000676935,0.000097057506,0.00014840574,0.77178776,0.007027404,0.1567943,0.0016049555,0.06109087],"study_design_scores_gemma":[0.0000065343474,0.00003441953,0.000036562215,0.0000061039805,0.0000031295385,0.000015296328,0.0000058727783,0.9795726,0.0010771501,0.018869787,0.00036602133,0.000006531295],"about_ca_topic_score_codex":0.0009758003,"about_ca_topic_score_gemma":0.0015226672,"teacher_disagreement_score":0.0037796285,"about_ca_system_score_codex":0.001097021,"about_ca_system_score_gemma":0.0017919571,"threshold_uncertainty_score":0.019988835},"labels":[],"label_agreement":null},{"id":"W2964266252","doi":"10.1109/lsp.2015.2409896","title":"Cramer-Rao Bound for Sparse Signals Fitting the Low-Rank Model with Small Number of Parameters","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Estimator; Rank (graph theory); Cramér–Rao bound; Compressed sensing; Algorithm; Covariance; Upper and lower bounds; Mathematics; Covariance matrix; Estimation theory; Direction of arrival; Representation (politics); Computer science; Applied mathematics; Statistics; Combinatorics; Mathematical analysis","score_opus":0.11825372154074032,"score_gpt":0.19671295060375155,"score_spread":0.07845922906301123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964266252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009016359,0.00080697995,0.9870242,0.0004161078,0.000026157173,0.00002866971,0.00012982379,0.00017472,0.0023771066],"genre_scores_gemma":[0.5695729,0.0045801657,0.4180019,0.0007704303,0.0003551238,0.00057240116,0.0012264239,0.00033615582,0.004584527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99469215,0.0020299002,0.00019476126,0.0006765911,0.0020499711,0.00035665446],"domain_scores_gemma":[0.95523846,0.036449876,0.001761303,0.0037976902,0.0024101792,0.00034255785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006886849,0.0018962261,0.0017548234,0.0015010815,0.0008246931,0.001661265,0.0015092202,0.0022974429,0.0025323948],"category_scores_gemma":[0.054707173,0.0007772749,0.00072729343,0.001962008,0.0037387877,0.004768528,0.0021519933,0.0033110532,0.0011733169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028780653,0.00009205194,0.0018084489,0.00049182115,0.0001299099,0.00033253536,0.000250791,0.6997176,0.009145156,0.23946038,0.003007264,0.045276336],"study_design_scores_gemma":[0.000015504025,0.000055567078,0.0004979704,0.000048137063,0.000020546002,0.00016228994,0.000041881314,0.9235943,0.0022774234,0.071622536,0.0016302709,0.000033511347],"about_ca_topic_score_codex":0.0033372305,"about_ca_topic_score_gemma":0.002442643,"teacher_disagreement_score":0.006886849,"about_ca_system_score_codex":0.0014697732,"about_ca_system_score_gemma":0.0018108668,"threshold_uncertainty_score":0.036421597},"labels":[],"label_agreement":null},{"id":"W2964304579","doi":"","title":"On orthogonality and learning recurrent networks with long term dependencies","year":2017,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Orthogonality; Backpropagation; Artificial neural network; Computer science; Convergence (economics); Term (time); Stability (learning theory); Property (philosophy); Matrix (chemical analysis); Norm (philosophy); Applied mathematics; Mathematical optimization; Gradient method; Mathematics; Algorithm; Artificial intelligence; Machine learning","score_opus":0.032612500154181503,"score_gpt":0.2885483512715729,"score_spread":0.2559358511173914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964304579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026933251,0.00082225277,0.9696591,0.0006507508,0.00004402371,0.000024326488,0.000047634494,0.00019031987,0.001628326],"genre_scores_gemma":[0.72682476,0.0032736396,0.26130202,0.0005583695,0.00031182106,0.00025777853,0.00041774026,0.00031752267,0.006736356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900573,0.0004778117,0.000055493583,0.00017579908,0.00019387293,0.00009131946],"domain_scores_gemma":[0.9914927,0.0065522315,0.00071493443,0.00044396322,0.0006091151,0.0001870776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036049148,0.0013066423,0.0009823715,0.0007559572,0.00044734636,0.0010296798,0.001167747,0.0012604455,0.0016506063],"category_scores_gemma":[0.017209083,0.00084229757,0.0006240071,0.0007398401,0.0022585047,0.0033897352,0.0024345522,0.0025472075,0.0003164541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104918254,0.00005652142,0.0010278764,0.000117924734,0.000068471985,0.00012415547,0.00014197822,0.8271533,0.0048262076,0.13309343,0.0010792721,0.032205917],"study_design_scores_gemma":[0.000004850192,0.00002496609,0.00008593875,0.000010042922,0.000004605964,0.000014556037,0.000006070834,0.9676317,0.00049379974,0.0314903,0.00022648346,0.000006678708],"about_ca_topic_score_codex":0.004057998,"about_ca_topic_score_gemma":0.0047651893,"teacher_disagreement_score":0.004057998,"about_ca_system_score_codex":0.00091260637,"about_ca_system_score_gemma":0.0009300134,"threshold_uncertainty_score":0.019064844},"labels":[],"label_agreement":null},{"id":"W2967097710","doi":"","title":"Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Non-negative matrix factorization; Stochastic gradient descent; Nonnegative matrix; Mathematics; Gradient descent; Matrix decomposition; Applied mathematics; Computer science; Artificial intelligence; Physics; Symmetric matrix","score_opus":0.0074627648950094895,"score_gpt":0.20494548891774747,"score_spread":0.19748272402273798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967097710","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032385096,0.00055004586,0.9940712,0.00032855425,0.00006773999,0.000029913363,0.000026838008,0.00019026126,0.0014969811],"genre_scores_gemma":[0.24592772,0.0014892897,0.7467774,0.0005895622,0.00031736627,0.00021762749,0.0003022052,0.0002322344,0.0041466327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843377,0.0008274341,0.00007145248,0.00025018145,0.0003144146,0.00010279074],"domain_scores_gemma":[0.9954333,0.003309317,0.0002373523,0.00036573675,0.00051482697,0.00013955125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027730034,0.0013347631,0.001502782,0.0010514371,0.0006783669,0.0010884627,0.0011760124,0.0015659052,0.0018421052],"category_scores_gemma":[0.011970332,0.00064333575,0.0009933099,0.0012776216,0.001807862,0.0012885451,0.0019069341,0.0018934942,0.0006284147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065535125,0.00010059749,0.00092800835,0.00021415962,0.000093767805,0.0001939428,0.0001543935,0.7915049,0.0025402766,0.098265804,0.003691496,0.10224715],"study_design_scores_gemma":[0.000006775454,0.000017256247,0.000065561355,0.000009142412,0.0000027124374,0.00002072688,0.0000057232924,0.9631688,0.00034581785,0.035263803,0.0010872482,0.000006410401],"about_ca_topic_score_codex":0.0056790183,"about_ca_topic_score_gemma":0.0055035506,"teacher_disagreement_score":0.0056790183,"about_ca_system_score_codex":0.0011273812,"about_ca_system_score_gemma":0.0014259313,"threshold_uncertainty_score":0.014665186},"labels":[],"label_agreement":null},{"id":"W2970344166","doi":"","title":"Fast, Provably convergent IRLS Algorithm for p-norm Linear Regression","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Algorithm; Iteratively reweighted least squares; Computer science; Norm (philosophy); Linear regression; Matrix norm; Convex optimization; Mathematical optimization; Regular polygon; Mathematics; Non-linear least squares; Machine learning; Estimation theory","score_opus":0.03740094553334738,"score_gpt":0.1773901354801517,"score_spread":0.13998918994680432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970344166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021188753,0.0001651727,0.99446326,0.00022541323,0.000043371187,0.000035521964,0.000051861163,0.0014153708,0.0014812025],"genre_scores_gemma":[0.055207502,0.00020685008,0.93937945,0.0002790039,0.00009056022,0.00023356221,0.00044233075,0.0004940317,0.0036667464],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980488,0.00045430873,0.000113647715,0.00037108007,0.00087782514,0.00013434682],"domain_scores_gemma":[0.9967024,0.0016429464,0.00022524953,0.00045368006,0.0008427599,0.00013297127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023680113,0.0014636395,0.0013915999,0.0009294523,0.0008034272,0.001515536,0.0021132694,0.0023696236,0.0051298533],"category_scores_gemma":[0.010692461,0.00064701086,0.0008370748,0.001189506,0.0014421963,0.0023576242,0.0029292013,0.0041959393,0.004279403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043333528,0.00016955733,0.00082627806,0.00031734793,0.00007759718,0.00023508353,0.00027914892,0.43900263,0.015251202,0.06148651,0.022982664,0.4589386],"study_design_scores_gemma":[0.000050026745,0.000056137098,0.00008784305,0.000022266488,0.0000060685625,0.00009865851,0.000032634525,0.97279793,0.0034567588,0.01952467,0.0038488677,0.000018072926],"about_ca_topic_score_codex":0.0024266392,"about_ca_topic_score_gemma":0.0035961287,"teacher_disagreement_score":0.0051298533,"about_ca_system_score_codex":0.0008845769,"about_ca_system_score_gemma":0.0023697477,"threshold_uncertainty_score":0.017161012},"labels":[],"label_agreement":null},{"id":"W2972860561","doi":"10.1007/978-1-4471-7452-3_18","title":"Compressed Sensing and Dictionary Learning","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Neural coding; Sparse approximation; K-SVD; Compressed sensing; Computer science; Sparse matrix; Pattern recognition (psychology); Artificial intelligence; Dictionary learning; Coding (social sciences); Signal processing; Algorithm; Mathematics; Digital signal processing; Statistics","score_opus":0.011046530332410586,"score_gpt":0.18300048687393744,"score_spread":0.17195395654152684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972860561","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081999507,0.060580596,0.10274975,0.0026389463,0.0052447366,0.000065281354,0.00035298138,0.000606677,0.826941],"genre_scores_gemma":[0.009168607,0.04002039,0.028715268,0.0010220875,0.003358285,0.000079083795,0.0004410982,0.0003421805,0.916853],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965465,0.00004314946,0.000009808649,0.000048782404,0.00022690739,0.000016702954],"domain_scores_gemma":[0.9997024,0.00014581539,0.000011772807,0.000045445406,0.00007376475,0.000020690233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025849664,0.0012779223,0.000763012,0.001733858,0.0005811498,0.0022565974,0.0007098943,0.0012210022,0.055890437],"category_scores_gemma":[0.0010603786,0.0003978054,0.00026618358,0.0027065726,0.0013184582,0.002429446,0.0012235933,0.0022304591,0.03481007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018673796,0.000040120634,0.000042184754,0.00039733187,0.000008313287,0.000046967954,0.000109680426,0.0018154662,0.001586771,0.20790197,0.28645843,0.5015741],"study_design_scores_gemma":[0.0000032651749,0.000021550073,0.00012722022,0.00019598739,0.000004216863,0.00019140191,0.000047965972,0.00219037,0.0008197266,0.093896486,0.902488,0.000013730875],"about_ca_topic_score_codex":0.00094197626,"about_ca_topic_score_gemma":0.0025256912,"teacher_disagreement_score":0.055890437,"about_ca_system_score_codex":0.00068048586,"about_ca_system_score_gemma":0.00072432484,"threshold_uncertainty_score":0.18697214},"labels":[],"label_agreement":null},{"id":"W2972953868","doi":"10.1117/12.2526373","title":"Iterative and greedy algorithms for the sparsity in levels model in compressed sensing","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matching pursuit; Compressed sensing; Piecewise; Greedy algorithm; Algorithm; Thresholding; Computer science; Approximation algorithm; Context (archaeology); Encoder; Basis pursuit; Sampling (signal processing); Artificial intelligence; Mathematics; Image (mathematics); Computer vision","score_opus":0.0495775953521808,"score_gpt":0.2605631832484376,"score_spread":0.21098558789625677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972953868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028188971,0.000080117294,0.99608946,0.00010254264,0.000011572211,0.000022131506,0.000023901719,0.00010979638,0.0007417281],"genre_scores_gemma":[0.24267672,0.00041064923,0.7537235,0.00021887176,0.000081132916,0.00025014541,0.00021003936,0.00015842043,0.0022705288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992211,0.00034991442,0.000030745297,0.0000910775,0.00024045847,0.000066656474],"domain_scores_gemma":[0.9979912,0.0014300408,0.00014811258,0.0002070052,0.0001535402,0.00007004435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014188801,0.00087662967,0.0007690489,0.0007087863,0.00031232924,0.0009545525,0.0013633682,0.0013002829,0.0023373566],"category_scores_gemma":[0.0070964824,0.0004137821,0.0006415164,0.0009920856,0.0012290424,0.0015283856,0.0018404839,0.0017261535,0.00058939273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012813305,0.00007519182,0.00034283972,0.00015727062,0.00004349831,0.00006496898,0.00013394667,0.66007596,0.0044083185,0.23037288,0.0028161514,0.101380914],"study_design_scores_gemma":[0.000009887301,0.000022552642,0.00003006031,0.0000068227473,0.0000033750962,0.000017260621,0.000008326728,0.96944046,0.0005745127,0.029438876,0.0004425384,0.00000534782],"about_ca_topic_score_codex":0.0019641295,"about_ca_topic_score_gemma":0.002266114,"teacher_disagreement_score":0.0023373566,"about_ca_system_score_codex":0.0008566668,"about_ca_system_score_gemma":0.0013840378,"threshold_uncertainty_score":0.007819295},"labels":[],"label_agreement":null},{"id":"W2980241036","doi":"10.1109/lsp.2019.2945683","title":"Joint Design of Measurement Matrix and Sparse Support Recovery Method via Deep Auto-Encoder","year":2019,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Exploit; Encoder; Thresholding; Joint (building); Artificial intelligence; Sparse matrix; Computational complexity theory; Matrix (chemical analysis); Compressed sensing; Algorithm; Computation; Signal processing; Pattern recognition (psychology); Computer engineering; Computer hardware; Digital signal processing; Image (mathematics)","score_opus":0.03331377140293759,"score_gpt":0.24344556806698547,"score_spread":0.21013179666404788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980241036","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004468416,0.000064226486,0.9946666,0.000079608755,0.000012812019,0.000017727136,0.000030303689,0.00021965678,0.0004406231],"genre_scores_gemma":[0.3720317,0.00022975123,0.6244438,0.00022971617,0.000050169052,0.0001681579,0.00030238126,0.0000823524,0.002461918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995159,0.00012118733,0.000027656728,0.00009508148,0.00019256637,0.00004762889],"domain_scores_gemma":[0.999236,0.00030594374,0.00007730529,0.000106397514,0.00022272089,0.0000516553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078031764,0.0007573485,0.00063441566,0.00034621268,0.00025710103,0.0005527402,0.0009417053,0.00077299366,0.0018548099],"category_scores_gemma":[0.0026096175,0.00043723875,0.0004221711,0.0004538188,0.0004959019,0.0011772144,0.0012379964,0.0014101451,0.00059466664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003503671,0.00016632225,0.0017141731,0.00027675074,0.000096025666,0.00022551241,0.00018815316,0.45016336,0.05039511,0.041399613,0.0057453816,0.44927928],"study_design_scores_gemma":[0.00001008355,0.000028554654,0.000064764594,0.000004605864,0.0000053043163,0.00003718384,0.000005203463,0.993306,0.004040427,0.0019517427,0.00053915736,0.0000069774937],"about_ca_topic_score_codex":0.0020524128,"about_ca_topic_score_gemma":0.003144465,"teacher_disagreement_score":0.0020524128,"about_ca_system_score_codex":0.00032020363,"about_ca_system_score_gemma":0.0011485454,"threshold_uncertainty_score":0.0062049627},"labels":[],"label_agreement":null},{"id":"W2981103351","doi":"10.1364/oe.27.031475","title":"CMOS computational camera with a two-tap coded exposure image sensor for single-shot spatial-temporal compressive sensing","year":2019,"lang":"en","type":"article","venue":"Optics Express","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Image sensor; Pixel; Computer science; CMOS sensor; Image resolution; Compressed sensing; CMOS; Artificial intelligence; Chip; Computer vision; Frame rate; Temporal resolution; Frame (networking); Optics; Computer hardware; Physics; Optoelectronics; Telecommunications","score_opus":0.018421607781968254,"score_gpt":0.23838098505306696,"score_spread":0.2199593772710987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981103351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21630591,0.00096170075,0.7718811,0.00057108735,0.00023097177,0.00024451964,0.00031529597,0.00080119184,0.008688263],"genre_scores_gemma":[0.5384143,0.00046759928,0.4569674,0.0002894337,0.00007520073,0.00011764971,0.0001506161,0.00003306985,0.003484744],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998211,0.000013782542,0.0000065124673,0.00004098806,0.00010198411,0.00001554106],"domain_scores_gemma":[0.9998485,0.000032284715,0.000033273474,0.000022432709,0.000043203618,0.000020356589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118464566,0.00024330498,0.00025379367,0.00016282349,0.000117784,0.0003010991,0.00071697915,0.00037467972,0.0014090027],"category_scores_gemma":[0.0003092982,0.00016597769,0.0001545127,0.00018071853,0.00025274494,0.00041406837,0.00040568534,0.00039534768,0.0002536033],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009093303,0.00004912014,0.0003616247,0.0001546655,0.000010658807,0.00011166313,0.000033366687,0.0023230454,0.9572969,0.004732768,0.0010344506,0.03380078],"study_design_scores_gemma":[0.000042829142,0.0005372058,0.0015881,0.000021593884,0.000026043246,0.001151921,0.00002536759,0.099610895,0.8840593,0.00057631626,0.012312271,0.00004819159],"about_ca_topic_score_codex":0.00047745957,"about_ca_topic_score_gemma":0.00090424385,"teacher_disagreement_score":0.0014090027,"about_ca_system_score_codex":0.00031147254,"about_ca_system_score_gemma":0.00051045127,"threshold_uncertainty_score":0.0047135353},"labels":[],"label_agreement":null},{"id":"W2982518953","doi":"10.48550/arxiv.1910.13650","title":"Bundle methods for dual atomic pursuit","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bundle; Duality (order theory); Dual (grammatical number); Set (abstract data type); Sequence (biology); Gauge (firearms); Duality gap; Mathematics; Optimization problem; Algorithm; Mathematical optimization; Computer science; Combinatorics; Chemistry; Materials science","score_opus":0.09574137947842264,"score_gpt":0.2375950047311853,"score_spread":0.14185362525276268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982518953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014411965,0.00016479092,0.99669015,0.00010776983,0.000029042698,0.000017119006,0.000025240724,0.00010354086,0.0014210668],"genre_scores_gemma":[0.10963404,0.00086478336,0.88210946,0.00024212695,0.00020885232,0.00030124793,0.00026993855,0.0003037682,0.0060657547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989613,0.0004934242,0.000033341395,0.00012819126,0.00031790425,0.0000657196],"domain_scores_gemma":[0.99867624,0.0006666064,0.000108935244,0.00025166548,0.00021116521,0.00008536754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018994902,0.0010309755,0.001078714,0.0012049325,0.0006505207,0.0013643561,0.0011468251,0.0014312869,0.005142643],"category_scores_gemma":[0.0050200564,0.0006152089,0.00096442166,0.00129605,0.001864344,0.0019940292,0.0033096012,0.0031168466,0.0018002738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012995275,0.00007380627,0.00044430973,0.00018494033,0.00007577099,0.000073436124,0.00014594743,0.14404324,0.0067611993,0.7219936,0.0051558753,0.1209178],"study_design_scores_gemma":[0.000019227831,0.000055788627,0.00007669686,0.00002298673,0.0000068997947,0.000051595118,0.00002028864,0.74648184,0.001721758,0.24566635,0.005861353,0.00001530693],"about_ca_topic_score_codex":0.0007952069,"about_ca_topic_score_gemma":0.00087834784,"teacher_disagreement_score":0.005142643,"about_ca_system_score_codex":0.00072593003,"about_ca_system_score_gemma":0.00087205425,"threshold_uncertainty_score":0.017203808},"labels":[],"label_agreement":null},{"id":"W2982555860","doi":"10.1109/tit.2020.3039308","title":"Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns","year":2020,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Debiasing; Sampling (signal processing); Matrix (chemical analysis); Algorithm; Metric (unit); Simple (philosophy); Matrix completion; Simple random sample; Matching (statistics); Mathematical optimization; Computer science; Mathematics; Function (biology); Projection (relational algebra); Upper and lower bounds; Statistics; Mathematical analysis; Computer vision","score_opus":0.019417091726446442,"score_gpt":0.24739547555178007,"score_spread":0.22797838382533364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982555860","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02137734,0.00009696342,0.97740626,0.00013199254,0.000015767238,0.00002436002,0.00004705621,0.000060133138,0.00084005814],"genre_scores_gemma":[0.6205992,0.0005236093,0.37323892,0.00016926114,0.000086776825,0.00018704883,0.00034383655,0.000086953274,0.004764403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883014,0.00047813976,0.00005159927,0.00020991384,0.00033045097,0.000099875375],"domain_scores_gemma":[0.99521446,0.0028910742,0.00056782254,0.0008216926,0.00038324224,0.00012178791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024118125,0.00082284055,0.0007036485,0.0004257005,0.00027567256,0.0007863164,0.001157998,0.0009766951,0.0012683239],"category_scores_gemma":[0.010814346,0.00036366374,0.00043798002,0.00078782055,0.0016721745,0.0018706083,0.0015336155,0.0013491182,0.00033352798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002117348,0.0000705374,0.00085261045,0.0001979982,0.000049798986,0.00030634567,0.0001145741,0.8491834,0.011729849,0.1075911,0.0011289471,0.028563011],"study_design_scores_gemma":[0.000011481325,0.000031612402,0.00013467786,0.0000065967233,0.0000030476233,0.000046227175,0.00001508819,0.97605705,0.002620471,0.020757172,0.00030809463,0.000008504161],"about_ca_topic_score_codex":0.001304216,"about_ca_topic_score_gemma":0.0012873411,"teacher_disagreement_score":0.0024118125,"about_ca_system_score_codex":0.0005035179,"about_ca_system_score_gemma":0.00068900525,"threshold_uncertainty_score":0.012755036},"labels":[],"label_agreement":null},{"id":"W2982599477","doi":"10.1109/apusncursinrsm.2019.8888616","title":"RCS of Complex Targets via Compressive Sensing","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Compressed sensing; Thresholding; Computer science; SIGNAL (programming language); Nyquist rate; Sampling (signal processing); Radar; Radar cross-section; Nyquist–Shannon sampling theorem; Algorithm; Electronic engineering; Inverse synthetic aperture radar; Acoustics; Radar imaging; Physics; Engineering; Computer vision; Telecommunications; Detector","score_opus":0.012960476514982005,"score_gpt":0.21448606462454295,"score_spread":0.20152558810956095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982599477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03149108,0.00011563389,0.9632595,0.00019958912,0.000024890736,0.00002205527,0.000036749585,0.0002905406,0.0045600347],"genre_scores_gemma":[0.58493894,0.00053360127,0.4098582,0.00015085188,0.00007635686,0.00006888656,0.00019260422,0.00011146322,0.00406919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997588,0.000053755466,0.000008995356,0.000031022893,0.00013361048,0.000013893429],"domain_scores_gemma":[0.9995239,0.00025227526,0.000054961823,0.00007376713,0.00008049633,0.000014646768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033555095,0.00046854105,0.00029117233,0.00033981717,0.00017225032,0.0005034704,0.0003166729,0.00040113635,0.0010754188],"category_scores_gemma":[0.001741458,0.00020590176,0.0002471063,0.00036170759,0.00061374524,0.0007333663,0.0007660741,0.00060515193,0.00031069075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011968348,0.000051475512,0.0008946017,0.00013616604,0.000030945437,0.00020239246,0.00021965934,0.72019243,0.08848801,0.04514766,0.0020213025,0.14249566],"study_design_scores_gemma":[0.0000059047975,0.000017987031,0.00014290797,0.0000051186144,0.00000276813,0.000059140264,0.000016105843,0.98737365,0.0067954543,0.004548509,0.001025163,0.0000072113576],"about_ca_topic_score_codex":0.0013423484,"about_ca_topic_score_gemma":0.0013397697,"teacher_disagreement_score":0.0013423484,"about_ca_system_score_codex":0.00029833452,"about_ca_system_score_gemma":0.0005149483,"threshold_uncertainty_score":0.0035976171},"labels":[],"label_agreement":null},{"id":"W2984521971","doi":"10.23952/jano.2.2020.1.03","title":"Superiorization vs. accelerated convex optimization: The superiorized / regularized least-squares case","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Least-squares function approximation; Convex optimization; Mathematics; Least trimmed squares; Regular polygon; Conic optimization; Mathematical optimization; Computer science; Non-linear least squares; Convex analysis; Algorithm; Statistics; Estimation theory; Geometry","score_opus":0.016758200204797714,"score_gpt":0.2106089504209564,"score_spread":0.1938507502161587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984521971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012889836,0.0005707216,0.9835157,0.00025683548,0.00004174045,0.000038107133,0.000030156725,0.00018135046,0.0024755825],"genre_scores_gemma":[0.46425518,0.0010344445,0.5307994,0.0002899801,0.00013612119,0.00015956823,0.00016954842,0.00025151015,0.0029042275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982894,0.0007451659,0.00007516634,0.00022904543,0.000517202,0.00014390863],"domain_scores_gemma":[0.9963574,0.002117036,0.0003066436,0.00062638277,0.0004936474,0.00009888043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034052767,0.00097398536,0.0012383542,0.00061787927,0.0002678217,0.001071075,0.0008980197,0.0011369382,0.0025584677],"category_scores_gemma":[0.009040963,0.00041539202,0.00090820406,0.0006659847,0.0015864145,0.0016797899,0.0020909132,0.0018601029,0.00047213133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037712016,0.000103338396,0.00083655596,0.00043631208,0.000117733674,0.00023998297,0.00015779256,0.7824765,0.012835531,0.09561526,0.002999444,0.10380454],"study_design_scores_gemma":[0.000013631716,0.00007592589,0.000090647816,0.000016281034,0.00001205442,0.00006416207,0.000014197606,0.98617315,0.0036166299,0.008636458,0.0012785275,0.000008258818],"about_ca_topic_score_codex":0.0013182655,"about_ca_topic_score_gemma":0.00088025816,"teacher_disagreement_score":0.0034052767,"about_ca_system_score_codex":0.00049083773,"about_ca_system_score_gemma":0.0014104036,"threshold_uncertainty_score":0.018009007},"labels":[],"label_agreement":null},{"id":"W2990488703","doi":"10.22215/etd/2019-13619","title":"Investigation of Kronecker-based Recovery in Compressive Sensing","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Kronecker delta; Matrix (chemical analysis); SIGNAL (programming language); Algorithm; Basis (linear algebra); Mutual coherence; Kronecker product; Computer science; Signal recovery; Coherence (philosophical gambling strategy); Signal processing; Mathematics; Materials science; Statistics; Physics; Telecommunications; Geometry","score_opus":0.017678258436561047,"score_gpt":0.22844408317025044,"score_spread":0.2107658247336894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990488703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023248484,0.0020196447,0.9617666,0.0005731958,0.00013462486,0.000043900167,0.00005956165,0.00014062114,0.012013382],"genre_scores_gemma":[0.6358634,0.0068471557,0.34003204,0.00041697695,0.00023812185,0.00009940805,0.0002734213,0.000106490916,0.016122987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913234,0.00024004534,0.00004570357,0.00012621352,0.00039727933,0.000058355217],"domain_scores_gemma":[0.9975501,0.0013842431,0.00022708687,0.0003008042,0.00048171863,0.000056003177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014849501,0.0004811227,0.00043906795,0.00054819626,0.000255237,0.0010083392,0.00070448656,0.0008315385,0.0019580408],"category_scores_gemma":[0.004354616,0.00032424845,0.00047563305,0.000610487,0.0012137614,0.0018185455,0.00073475385,0.0010094123,0.00041319893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026207324,0.0000941155,0.0019999573,0.0005034319,0.000083120816,0.00054699724,0.00036726406,0.33559543,0.0515491,0.47545692,0.002913625,0.13062797],"study_design_scores_gemma":[0.000008882547,0.00011721883,0.00057155284,0.00004776848,0.00001277976,0.00037388166,0.00007076131,0.95267725,0.009143729,0.032442648,0.004494308,0.000039246395],"about_ca_topic_score_codex":0.0013077571,"about_ca_topic_score_gemma":0.0009828827,"teacher_disagreement_score":0.0019580408,"about_ca_system_score_codex":0.00048147503,"about_ca_system_score_gemma":0.0005749738,"threshold_uncertainty_score":0.00785321},"labels":[],"label_agreement":null},{"id":"W2990689883","doi":"10.1007/s11081-019-09476-9","title":"Robust principal component analysis using facial reduction","year":2019,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of California, Davis; Natural Sciences and Engineering Research Council of Canada; Kungliga Tekniska Högskolan","keywords":"Robust principal component analysis; Outlier; Sparse PCA; Principal component analysis; Computer science; Norm (philosophy); Heuristic; Mathematical optimization; Matrix (chemical analysis); Algorithm; Matrix norm; Reduction (mathematics); Mathematics; Artificial intelligence; Eigenvalues and eigenvectors","score_opus":0.01743263055725297,"score_gpt":0.20196143938077804,"score_spread":0.18452880882352507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990689883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023898378,0.00013656622,0.99567384,0.00011244778,0.00003760327,0.000036841437,0.00007595142,0.00044943436,0.0010874196],"genre_scores_gemma":[0.11467608,0.00057896896,0.8779515,0.00014184133,0.00013069317,0.00023729702,0.0006376299,0.00031789072,0.0053281127],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988668,0.00023853856,0.00004165675,0.0002833553,0.000475986,0.00009369819],"domain_scores_gemma":[0.99961436,0.000074951226,0.000043778487,0.00010502264,0.00014469992,0.000017191252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006963541,0.0013868377,0.0012361724,0.001280876,0.0005015683,0.0011907847,0.001157385,0.0008629527,0.0033037567],"category_scores_gemma":[0.0015844188,0.0005711945,0.0020547514,0.001497428,0.0008893412,0.00094128546,0.0015604204,0.0017603684,0.0019346654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014723763,0.00010289719,0.0005341172,0.00018846928,0.00017555412,0.00015016325,0.000117374184,0.32828012,0.049571298,0.044330947,0.010433411,0.56596845],"study_design_scores_gemma":[0.000007248407,0.000026162528,0.00028450976,0.000009566237,0.00002087132,0.000050369126,0.0000142875115,0.9786509,0.006362095,0.0090834405,0.0054719043,0.000018504972],"about_ca_topic_score_codex":0.003799748,"about_ca_topic_score_gemma":0.00341744,"teacher_disagreement_score":0.003799748,"about_ca_system_score_codex":0.00062389206,"about_ca_system_score_gemma":0.0014048804,"threshold_uncertainty_score":0.011052191},"labels":[],"label_agreement":null},{"id":"W2994638246","doi":"10.4153/s0008439519000730","title":"Non-convex Optimization via Strongly Convex Majorization-minimization","year":2019,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Proper convex function; Convex function; Convex optimization; Convex analysis; Mathematical optimization; Conic optimization; Regular polygon; Subderivative; Majorization; Ball (mathematics); Separable space; Optimization problem; Combinatorics; Mathematical analysis","score_opus":0.0046965739307197486,"score_gpt":0.17686018449261845,"score_spread":0.1721636105618987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994638246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039824178,0.00007905461,0.9947306,0.00015052919,0.000013388642,0.000018326304,0.000012092724,0.00004484067,0.0009687489],"genre_scores_gemma":[0.45647347,0.00046926792,0.534011,0.000302532,0.0001528091,0.00037205615,0.00017854429,0.00024343023,0.0077968915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903995,0.00050285086,0.00003411337,0.00015788927,0.00020280537,0.00006240656],"domain_scores_gemma":[0.9987368,0.00075156766,0.00013226771,0.00011927144,0.00021278519,0.00004739944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016233695,0.0012823757,0.001021025,0.00053503545,0.0003342499,0.00088389864,0.0008263269,0.00085276936,0.0012320359],"category_scores_gemma":[0.0031304206,0.0003766192,0.00081364677,0.00045632437,0.0018697866,0.001069652,0.0016511683,0.0016432459,0.00041176722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082590945,0.00005251943,0.0005030633,0.00017444562,0.000077937046,0.0001244661,0.00009951858,0.8068067,0.0110553745,0.13895445,0.0028475365,0.039221346],"study_design_scores_gemma":[0.000004787142,0.000026314947,0.000047754438,0.000005517886,0.0000025104691,0.0000149120515,0.0000061078654,0.9867953,0.0013184544,0.011196408,0.0005775663,0.0000042161932],"about_ca_topic_score_codex":0.0012302287,"about_ca_topic_score_gemma":0.0009865862,"teacher_disagreement_score":0.0016233695,"about_ca_system_score_codex":0.0009933581,"about_ca_system_score_gemma":0.0011085733,"threshold_uncertainty_score":0.008585274},"labels":[],"label_agreement":null},{"id":"W2994849938","doi":"","title":"Characterizing Generalized Rate-Distortion Performance of Videos","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Codec; Computer science; Distortion (music); Encoder; Lossy compression; Function (biology); Algorithm; Encoding (memory); Artificial intelligence; Mathematics","score_opus":0.05139392238807311,"score_gpt":0.17019202843675246,"score_spread":0.11879810604867935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994849938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08226715,0.00095517794,0.9140787,0.00024067746,0.0000269908,0.00005520972,0.0003279245,0.00030759344,0.0017405935],"genre_scores_gemma":[0.8445491,0.0016026929,0.15088774,0.0001397865,0.00009613435,0.00012914595,0.0010048108,0.00014880791,0.0014417656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854124,0.00048230853,0.00009010714,0.00024355022,0.00054060214,0.000102150545],"domain_scores_gemma":[0.9942842,0.003465152,0.00056424434,0.000901445,0.00067537074,0.00010963849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024041873,0.0010669454,0.00075932354,0.0012372142,0.0001918739,0.0011109657,0.00091289944,0.0008700196,0.00079572917],"category_scores_gemma":[0.015391204,0.000246844,0.0003902618,0.0010211709,0.0010274599,0.0018544146,0.0009518198,0.0009217519,0.0003333255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035815607,0.00011251517,0.0049552754,0.00029255313,0.00012706473,0.00023637139,0.0001723694,0.7749881,0.035290606,0.042627007,0.0016161026,0.13922383],"study_design_scores_gemma":[0.0000050084923,0.0000663099,0.0012513848,0.000011344752,0.0000074499535,0.0001645458,0.000021185226,0.982252,0.00777781,0.0079248585,0.0005009159,0.000017266295],"about_ca_topic_score_codex":0.0018371239,"about_ca_topic_score_gemma":0.00093475945,"teacher_disagreement_score":0.0024041873,"about_ca_system_score_codex":0.00093990937,"about_ca_system_score_gemma":0.0004957204,"threshold_uncertainty_score":0.012714684},"labels":[],"label_agreement":null},{"id":"W2995664737","doi":"10.1109/icocs.2019.8930756","title":"Optimized Implementation of Modified Gram Schmidt Algorithm on VLIW Architecture","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Very long instruction word; Computer science; Loop unrolling; Parallel computing; Algorithm; QR decomposition; Digital signal processing; Implementation; Computer hardware; Programming language","score_opus":0.009221365325473765,"score_gpt":0.250628312931566,"score_spread":0.24140694760609224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995664737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10776304,0.00049718545,0.86786145,0.00027581863,0.00014942151,0.00019556735,0.00043981572,0.008970705,0.013847054],"genre_scores_gemma":[0.3797346,0.00021732274,0.60867167,0.00012903518,0.000044879638,0.00019461836,0.0011298973,0.00025654247,0.009621403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954045,0.00006792716,0.000034800963,0.000070112284,0.00019309684,0.00009354658],"domain_scores_gemma":[0.9996519,0.00004327173,0.00003559724,0.000062310755,0.00018327446,0.000023649933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023623915,0.0005604952,0.00036597968,0.0005555824,0.00031991926,0.00064077304,0.000910599,0.0003512996,0.005723263],"category_scores_gemma":[0.00081505015,0.00020226999,0.00026955857,0.00059504225,0.00020512342,0.00058422267,0.00039658524,0.00037466237,0.0016614437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013781344,0.00022699102,0.0028845684,0.0004466972,0.00011154508,0.00055077946,0.00026841208,0.11488574,0.2669752,0.014291396,0.0180508,0.57992977],"study_design_scores_gemma":[0.00022262943,0.0009886262,0.0021466266,0.00004349768,0.000054899454,0.0005193056,0.00015615419,0.7648898,0.19063438,0.0038177415,0.03645049,0.00007583468],"about_ca_topic_score_codex":0.002990333,"about_ca_topic_score_gemma":0.003853463,"teacher_disagreement_score":0.005723263,"about_ca_system_score_codex":0.0004052221,"about_ca_system_score_gemma":0.0010099482,"threshold_uncertainty_score":0.019146264},"labels":[],"label_agreement":null},{"id":"W2995925786","doi":"10.48550/arxiv.1912.07357","title":"Increasing Energy Efficiency in Sensor Networks: Blue Noise Sampling and Non-Convex Matrix Completion","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Sampling (signal processing); Wireless sensor network; Sample (material); Matrix (chemical analysis); Energy (signal processing); Computer science; Noise (video); Regular polygon; Algorithm; Convex optimization; Mathematical optimization; Grid; Mathematics; Statistics; Telecommunications; Artificial intelligence","score_opus":0.036948419619024266,"score_gpt":0.18754370481731708,"score_spread":0.15059528519829282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995925786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019233517,0.00043670164,0.9783539,0.0004403774,0.000027349846,0.000024564104,0.00002968461,0.00014326128,0.0013105429],"genre_scores_gemma":[0.6845259,0.0011148625,0.3100915,0.0002529019,0.00015768503,0.00010493184,0.000181,0.0001377443,0.003433555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834716,0.00093448674,0.000039633334,0.00017918137,0.00041054038,0.00008891463],"domain_scores_gemma":[0.99578,0.002891593,0.00026612435,0.0005930338,0.00037025064,0.00009895243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023355014,0.0008175186,0.0008819343,0.000576943,0.00032492616,0.00070403784,0.0009480069,0.00081283273,0.0008426969],"category_scores_gemma":[0.009259671,0.00040013762,0.00041457568,0.0009987496,0.0016179996,0.0019598224,0.0013304447,0.0013196913,0.00022897472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031197173,0.00012609427,0.000797017,0.00014287807,0.000052811225,0.00009364848,0.00011431662,0.8571178,0.0067004897,0.048032545,0.0020863255,0.08442416],"study_design_scores_gemma":[0.000009189654,0.000036229714,0.000113069545,0.0000050389253,0.0000033194437,0.000026144906,0.000013635806,0.98469824,0.0015416694,0.013192012,0.00035676736,0.0000046007394],"about_ca_topic_score_codex":0.001623324,"about_ca_topic_score_gemma":0.0017141446,"teacher_disagreement_score":0.0023355014,"about_ca_system_score_codex":0.0006742339,"about_ca_system_score_gemma":0.000654877,"threshold_uncertainty_score":0.012351453},"labels":[],"label_agreement":null},{"id":"W2996477127","doi":"10.1002/cjs.11532","title":"High‐dimensional covariance matrix estimation using a low‐rank and diagonal decomposition","year":2019,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Covariance matrix; Estimator; Estimation of covariance matrices; Covariance; Rank (graph theory); Covariance function; Consistency (knowledge bases); Mathematical optimization; Applied mathematics; Statistics; Algorithm; Combinatorics","score_opus":0.008592731393800289,"score_gpt":0.23065433157880214,"score_spread":0.22206160018500185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996477127","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017111555,0.00014142453,0.9818865,0.00019229388,0.000016018828,0.000016532427,0.000036979163,0.00006729736,0.0005314422],"genre_scores_gemma":[0.5564423,0.000550141,0.43946418,0.00022705969,0.00015164519,0.00010104407,0.0003662278,0.00006784024,0.0026294221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.0007180053,0.000059142305,0.00018222393,0.00037157553,0.00008596673],"domain_scores_gemma":[0.9916089,0.0061859074,0.000646472,0.0006786734,0.000749039,0.0001308584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004532182,0.00067762967,0.00082040805,0.00069216633,0.00034924474,0.0010487206,0.0007936894,0.0009600409,0.0011371986],"category_scores_gemma":[0.018688552,0.0004860895,0.00052573567,0.0008650924,0.0013614115,0.001465701,0.001166733,0.0013019701,0.00034483595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001710774,0.00010050064,0.0030816568,0.00014925761,0.00012748395,0.00017221358,0.00011767893,0.8418449,0.009896324,0.07473533,0.0022767005,0.06732681],"study_design_scores_gemma":[0.00000880897,0.000020033174,0.00030114583,0.000006688678,0.0000053211006,0.000027519121,0.00000556133,0.9920855,0.00106064,0.006246213,0.00022381969,0.000008661398],"about_ca_topic_score_codex":0.0039479374,"about_ca_topic_score_gemma":0.002480866,"teacher_disagreement_score":0.004532182,"about_ca_system_score_codex":0.00056191505,"about_ca_system_score_gemma":0.0012367778,"threshold_uncertainty_score":0.023968816},"labels":[],"label_agreement":null},{"id":"W2997033417","doi":"10.1609/aaai.v34i04.5817","title":"Robust Gradient-Based Markov Subsampling","year":2020,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Minimax; Estimator; Computer science; Markov chain; Sampling (signal processing); Probabilistic logic; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Statistics; Machine learning","score_opus":0.13627175802375874,"score_gpt":0.2615147983450123,"score_spread":0.12524304032125355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997033417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046486855,0.00018997466,0.9942022,0.000093014416,0.00003084756,0.00003459062,0.000047526828,0.00027974226,0.00047340637],"genre_scores_gemma":[0.41533932,0.0005532031,0.5797221,0.00035030395,0.00018184399,0.0002508313,0.0006194514,0.00022852131,0.0027544147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.0005175928,0.000060241386,0.00023464442,0.00042041292,0.00010922577],"domain_scores_gemma":[0.9968227,0.0018464861,0.0002966006,0.00045200533,0.00047000626,0.000112208596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023097433,0.00096470525,0.0016472278,0.00085973827,0.00051221444,0.00093047513,0.0013890736,0.0009967249,0.0015063026],"category_scores_gemma":[0.009869342,0.0005402085,0.00092540996,0.00077079283,0.00095975643,0.0011795615,0.0012507079,0.001404639,0.0005766983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039554495,0.000090435686,0.0021690307,0.00024909707,0.00017220552,0.000221281,0.00013211301,0.7545327,0.014240033,0.07367181,0.004665422,0.14946027],"study_design_scores_gemma":[0.000009724554,0.000027734424,0.0001591733,0.0000071254863,0.0000075080766,0.00003168878,0.000005818559,0.9896785,0.0019882638,0.0074122986,0.0006618198,0.000010363587],"about_ca_topic_score_codex":0.0043461644,"about_ca_topic_score_gemma":0.0042394507,"teacher_disagreement_score":0.0043461644,"about_ca_system_score_codex":0.00081833935,"about_ca_system_score_gemma":0.0015359978,"threshold_uncertainty_score":0.012215197},"labels":[],"label_agreement":null},{"id":"W2997045086","doi":"10.1109/jsyst.2019.2958869","title":"Reweighted Compressed Sensing-Based Smart Grids Topology Reconstruction With Application to Identification of Power Line Outage","year":2019,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; Topology (electrical circuits); Network topology; Leverage (statistics); Compressed sensing; Algorithm; Artificial intelligence; Engineering","score_opus":0.007224921013289398,"score_gpt":0.21859856085943946,"score_spread":0.21137363984615007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997045086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034798495,0.00021286106,0.9631742,0.0002675172,0.000040207546,0.000032996766,0.00006336941,0.00036920156,0.0010410938],"genre_scores_gemma":[0.715556,0.00049791596,0.28165904,0.00015107807,0.000071283415,0.00006565421,0.00036169266,0.000060114817,0.0015771375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997534,0.00007232708,0.000013869818,0.00005301867,0.00008123705,0.000026177202],"domain_scores_gemma":[0.99938035,0.00031326993,0.0000789407,0.000072474955,0.00012436787,0.000030476174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055262295,0.00058192026,0.000528183,0.0005100678,0.0002075387,0.00037142687,0.00054343155,0.0005372021,0.0007631504],"category_scores_gemma":[0.0022137181,0.00022306814,0.0003785042,0.0006296866,0.00035347854,0.0009616512,0.0006131425,0.0007510254,0.00015556156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002639733,0.00009206805,0.0015079057,0.00014577003,0.000054392414,0.00028314095,0.0001649793,0.74173045,0.015430351,0.008534431,0.0024014043,0.22939108],"study_design_scores_gemma":[0.0000041334083,0.000016092225,0.00010923319,0.0000019806794,0.0000027470803,0.000027478338,0.000009373406,0.99784124,0.00096941786,0.00085872115,0.00015657753,0.0000030579333],"about_ca_topic_score_codex":0.0031416544,"about_ca_topic_score_gemma":0.0025072275,"teacher_disagreement_score":0.0031416544,"about_ca_system_score_codex":0.00023895373,"about_ca_system_score_gemma":0.00046145602,"threshold_uncertainty_score":0.006246686},"labels":[],"label_agreement":null},{"id":"W2998308145","doi":"10.1109/sampta45681.2019.9030849","title":"On one-stage recovery for Σ∆-quantized compressed sensing","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Orthonormal basis; Compressed sensing; Quantization (signal processing); Unitary state; Algorithm; Computer science; Bounded function; Dimension (graph theory); Signal reconstruction; Gaussian; Chirp; Focus (optics); Mathematics; Signal processing; Theoretical computer science; Digital signal processing; Pure mathematics; Mathematical analysis","score_opus":0.025232738052190156,"score_gpt":0.23890638203162817,"score_spread":0.21367364397943803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998308145","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039197486,0.0007734196,0.98925054,0.00039187787,0.0000627744,0.0000425826,0.000051764713,0.00008108549,0.0054262797],"genre_scores_gemma":[0.38121533,0.004642851,0.6001576,0.000807472,0.00044908802,0.000262567,0.00027484473,0.00013902089,0.0120512275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900347,0.0003301731,0.000049106467,0.00017410153,0.0003638335,0.000079401834],"domain_scores_gemma":[0.99799985,0.0014101359,0.00011658766,0.00027034665,0.00016446592,0.00003866704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014815961,0.0009266444,0.00070356973,0.00059526914,0.0004704751,0.0009968532,0.0011160265,0.0013722545,0.0043996344],"category_scores_gemma":[0.005258123,0.00040781524,0.00065391493,0.0008083254,0.0023640594,0.002282626,0.0020401545,0.0024529512,0.00072383694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012605597,0.00005936403,0.0001805269,0.00025620827,0.00002327686,0.00013840263,0.000171815,0.14853966,0.009697398,0.7868292,0.0026625358,0.05131549],"study_design_scores_gemma":[0.000020038879,0.00008868465,0.00011045291,0.000054812637,0.000013139185,0.00012110465,0.000023495302,0.85759854,0.004233566,0.13415346,0.0035446857,0.000038014125],"about_ca_topic_score_codex":0.0012028705,"about_ca_topic_score_gemma":0.0012815216,"teacher_disagreement_score":0.0043996344,"about_ca_system_score_codex":0.00091424247,"about_ca_system_score_gemma":0.0009082789,"threshold_uncertainty_score":0.014718235},"labels":[],"label_agreement":null},{"id":"W2998331447","doi":"","title":"The troublesome kernel: why deep learning for inverse problems is typically unstable.","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Phenomenon; Instability; Regularization (linguistics); Inverse problem; Computer science; Artificial neural network; Counterintuitive; Artificial intelligence; Inverse; Stability (learning theory); Machine learning; Mathematics; Physics","score_opus":0.06825107292673985,"score_gpt":0.18152234038781337,"score_spread":0.11327126746107352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998331447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043728925,0.003101557,0.93164647,0.010373303,0.0002442773,0.000047651454,0.00011574352,0.0005605883,0.010181581],"genre_scores_gemma":[0.8504166,0.002526415,0.13705258,0.0016452196,0.00044796625,0.00016445365,0.0001636111,0.00044127373,0.007141869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980883,0.0007638487,0.0000915705,0.00032587178,0.00060772646,0.00012263178],"domain_scores_gemma":[0.9885279,0.007933512,0.0008451121,0.0013348063,0.0010387169,0.000319866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042033433,0.00065866107,0.00071118533,0.0009323228,0.0010193508,0.0018279308,0.001194425,0.0023263067,0.0023563001],"category_scores_gemma":[0.036688354,0.00055191235,0.0005014342,0.00059893244,0.005434781,0.004130054,0.0025793358,0.0036002432,0.00080477045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025625262,0.000061538994,0.0053142775,0.00044421508,0.00012194811,0.00056708604,0.00087711506,0.12531194,0.012603529,0.75302374,0.014744897,0.08667342],"study_design_scores_gemma":[0.000024337192,0.00006243466,0.00097082637,0.00008518641,0.000016156839,0.00032302435,0.00009926189,0.462983,0.0036144855,0.52650076,0.005288692,0.000031713964],"about_ca_topic_score_codex":0.0014321439,"about_ca_topic_score_gemma":0.001154528,"teacher_disagreement_score":0.0042033433,"about_ca_system_score_codex":0.0010073661,"about_ca_system_score_gemma":0.0007289883,"threshold_uncertainty_score":0.022229731},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008073907588942917,"score_gpt":0.21735342161299653,"score_spread":0.20927951402405362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998391154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032300358,0.00026876616,0.99439716,0.00018173199,0.000049416765,0.00002750617,0.00010144082,0.0007029948,0.0010408829],"genre_scores_gemma":[0.18730547,0.0007908698,0.8034573,0.00040633185,0.00011323627,0.0001956857,0.0011113079,0.0001956648,0.0064240266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975413,0.000057300873,0.000017094626,0.00005753628,0.00008579874,0.000028165328],"domain_scores_gemma":[0.9995153,0.000184429,0.0000556892,0.00006900144,0.00014246893,0.000033168846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007176207,0.0013111638,0.0007853605,0.00036980817,0.00030412577,0.0006250312,0.0010489693,0.0010101873,0.0025857768],"category_scores_gemma":[0.0020191483,0.00044388967,0.00056131236,0.0006025907,0.0005892436,0.0011531338,0.0009738986,0.002080809,0.00083368225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002047669,0.0000865638,0.0008641216,0.00024375903,0.0001072799,0.00013492652,0.00007780648,0.63555795,0.011232105,0.018739926,0.011042623,0.3217082],"study_design_scores_gemma":[0.0000075151966,0.000026665217,0.000059809074,0.0000062745307,0.0000057949346,0.000025485437,0.000005103897,0.9940807,0.001791446,0.0027112812,0.0012741467,0.0000058395103],"about_ca_topic_score_codex":0.005014655,"about_ca_topic_score_gemma":0.009007276,"teacher_disagreement_score":0.005014655,"about_ca_system_score_codex":0.0007304459,"about_ca_system_score_gemma":0.0014314558,"threshold_uncertainty_score":0.009970963},"labels":[],"label_agreement":null},{"id":"W2998680080","doi":"10.1109/camsap45676.2019.9022473","title":"All-or-Nothing Phenomena: From Single-Letter to High Dimensions","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; National Science Foundation","keywords":"Limiting; Mathematics; Combinatorics; Zero (linguistics); Scalar (mathematics); Asymptotic distribution; Function (biology); Gaussian; Mean squared error; Linear regression; Sigma; Statistics; Physics; Quantum mechanics; Geometry","score_opus":0.03771431908421078,"score_gpt":0.24180842558876553,"score_spread":0.20409410650455476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998680080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1303702,0.006114424,0.81336915,0.019324608,0.0023873313,0.00021265734,0.0042542224,0.0026858642,0.02128146],"genre_scores_gemma":[0.8269308,0.002603855,0.1412022,0.0041360063,0.002211594,0.00039561364,0.003997887,0.0011821103,0.017339986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98894006,0.0038639584,0.00066511246,0.0043088007,0.0014305705,0.0007914031],"domain_scores_gemma":[0.91604203,0.0578153,0.006613512,0.014442333,0.0035731005,0.0015137591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013468815,0.0014078432,0.0031475704,0.0031026793,0.0037044713,0.008933576,0.0047749546,0.0052354727,0.016424017],"category_scores_gemma":[0.12218913,0.0015771331,0.002213477,0.0047389097,0.0068014474,0.017538553,0.004820062,0.0069031776,0.003305665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010206252,0.00032930446,0.026002673,0.00092642725,0.00047030742,0.0017569002,0.0022588733,0.05774551,0.002340496,0.70982796,0.04075534,0.15656547],"study_design_scores_gemma":[0.00006263055,0.00007545326,0.0041032615,0.00015165725,0.00007953978,0.00045294105,0.00038832327,0.18704313,0.0010822146,0.7971157,0.00929377,0.00015137302],"about_ca_topic_score_codex":0.008760622,"about_ca_topic_score_gemma":0.005739001,"teacher_disagreement_score":0.016424017,"about_ca_system_score_codex":0.0030236146,"about_ca_system_score_gemma":0.0022176648,"threshold_uncertainty_score":0.07123077},"labels":[],"label_agreement":null},{"id":"W3002304143","doi":"10.1007/s11590-020-01609-9","title":"A perturbation view of level-set methods for convex optimization","year":2020,"lang":"en","type":"preprint","venue":"Optimization Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Seikei University","keywords":"Parameterized complexity; Duality (order theory); Mathematics; Mathematical optimization; Set (abstract data type); Regular polygon; Convex set; Convex optimization; Constraint (computer-aided design); Limiting; Perturbation (astronomy); Feasible region; Computer science; Combinatorics; Physics; Engineering; Geometry","score_opus":0.07606464728142957,"score_gpt":0.32535259871411815,"score_spread":0.24928795143268856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002304143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013635001,0.00024143046,0.99384016,0.0004537982,0.000056808713,0.000017052173,0.000028941042,0.000063244705,0.003935151],"genre_scores_gemma":[0.33609277,0.0020117941,0.6451648,0.0010441103,0.00055271684,0.00043066472,0.00024233195,0.0005567316,0.013904133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976745,0.0011406362,0.00008419371,0.0001967178,0.0008064729,0.000097475095],"domain_scores_gemma":[0.9951834,0.0033874377,0.0002634496,0.0004498054,0.00050174876,0.00021413194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045860577,0.00090621813,0.0010781119,0.0014978545,0.00058383856,0.0025646202,0.001731036,0.0014185329,0.0059166863],"category_scores_gemma":[0.008746542,0.00077197485,0.0014880167,0.0011193921,0.0034321002,0.0029984785,0.0033359288,0.005616512,0.001338414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003427015,0.00002728143,0.00014075103,0.00009166655,0.00004255766,0.00005146963,0.00007195703,0.18263848,0.0019033164,0.8017306,0.0017484253,0.011519266],"study_design_scores_gemma":[0.0000075565117,0.000025870211,0.000038465416,0.000027119428,0.0000064561455,0.000021022744,0.0000116064975,0.75802493,0.00082840666,0.23754801,0.0034506856,0.000009905812],"about_ca_topic_score_codex":0.0011451767,"about_ca_topic_score_gemma":0.00071427034,"teacher_disagreement_score":0.0059166863,"about_ca_system_score_codex":0.0017290573,"about_ca_system_score_gemma":0.0010813139,"threshold_uncertainty_score":0.024253666},"labels":[],"label_agreement":null},{"id":"W3003054600","doi":"10.1109/tsg.2020.2968814","title":"Real-Time Processing and Quality Improvement of Synchrophasor Data","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Smart Grid","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Phasor; Data stream mining; Data quality; Missing data; Data processing; Phasor measurement unit; Data stream; Real-time computing; Data modeling; Data mining; Algorithm; Metric (unit); Electric power system; Power (physics); Engineering; Database","score_opus":0.05001737889711238,"score_gpt":0.27819673550167284,"score_spread":0.22817935660456046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003054600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006770765,0.00011173296,0.9921591,0.00008434955,0.000033427692,0.000026927719,0.0000309089,0.0004316961,0.00035116682],"genre_scores_gemma":[0.25109628,0.00039271038,0.7457315,0.00009912423,0.00017398734,0.00009267616,0.00034052788,0.000116536416,0.0019565944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00017266805,0.000057269797,0.00019311883,0.00045060363,0.000053513944],"domain_scores_gemma":[0.9983676,0.0005421227,0.00027630053,0.00029837454,0.0004620571,0.000053574593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009166756,0.00081440696,0.00054656423,0.00069008034,0.00031044855,0.0006730808,0.000775446,0.0005207567,0.00095058547],"category_scores_gemma":[0.0039840066,0.00029305555,0.000429241,0.0008354317,0.00049520563,0.0011448736,0.0007649219,0.0011534024,0.00048638773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043335944,0.00014546904,0.0014652325,0.0001960074,0.000044238757,0.000100776044,0.00019809086,0.15409541,0.05880856,0.007142182,0.004298632,0.773072],"study_design_scores_gemma":[0.000034994388,0.00018788943,0.0010455229,0.000013508636,0.000015343478,0.00016471678,0.000041420593,0.961562,0.029794233,0.002478321,0.0046419185,0.000020170004],"about_ca_topic_score_codex":0.0015193962,"about_ca_topic_score_gemma":0.0015590651,"teacher_disagreement_score":0.0015193962,"about_ca_system_score_codex":0.00030128143,"about_ca_system_score_gemma":0.0008024398,"threshold_uncertainty_score":0.004847884},"labels":[],"label_agreement":null},{"id":"W3004341337","doi":"10.1109/globalsip45357.2019.8969506","title":"An embedding framework for video reconstruction using Gaussian mixture models","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Video denoising; Embedding; Artificial intelligence; Mixture model; Computer vision; Noise reduction; Iterative reconstruction; Gaussian; Block (permutation group theory); Algorithm; Video processing; Video tracking; Multiview Video Coding; Mathematics","score_opus":0.024555824164182106,"score_gpt":0.28148094720789923,"score_spread":0.2569251230437171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004341337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042872698,0.00008964111,0.99920875,0.000022907614,0.0000114681325,0.0000038552853,0.0000066672974,0.000054511096,0.00017345048],"genre_scores_gemma":[0.09328983,0.0010714172,0.90133774,0.0000839668,0.000120009696,0.00007898768,0.00020917272,0.0001114756,0.0036973327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995977,0.00013101312,0.000019771365,0.00008081519,0.00014131608,0.000029386376],"domain_scores_gemma":[0.99972016,0.00010490562,0.00003556211,0.000042553263,0.00007678405,0.0000201236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008099492,0.0008885145,0.00068562233,0.0006298057,0.00022601204,0.0006747915,0.0011208064,0.001065495,0.0015651323],"category_scores_gemma":[0.0013754376,0.00042033312,0.0010309637,0.00067970005,0.0005630637,0.0012793106,0.0009883422,0.0015491962,0.00079331663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010324572,0.00006770071,0.0004814167,0.00023321045,0.00010517319,0.00016044767,0.000150867,0.5456939,0.021496797,0.13889167,0.0027996986,0.2898159],"study_design_scores_gemma":[0.0000037567686,0.00002781717,0.00004401519,0.000007281741,0.000008239397,0.00006555768,0.0000072825055,0.9892735,0.0017260121,0.0065465723,0.0022810185,0.000008893226],"about_ca_topic_score_codex":0.002122561,"about_ca_topic_score_gemma":0.0017890271,"teacher_disagreement_score":0.002122561,"about_ca_system_score_codex":0.0003761777,"about_ca_system_score_gemma":0.0006039088,"threshold_uncertainty_score":0.005235851},"labels":[],"label_agreement":null},{"id":"W3004605579","doi":"10.1109/pacrim47961.2019.8985049","title":"Fast Nonnegative Matrix Factorization Using Nested ADMM Iterations","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Non-negative matrix factorization; Matrix decomposition; Computer science; Decomposition; Rank (graph theory); Variety (cybernetics); Factorization; Matrix (chemical analysis); Scale (ratio); Algorithm; Artificial intelligence; Mathematics","score_opus":0.012216657516349561,"score_gpt":0.24509136389117175,"score_spread":0.2328747063748222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004605579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007474314,0.000044952678,0.99866474,0.000046652895,0.000021660115,0.000014814775,0.000015053757,0.000101986014,0.00034274548],"genre_scores_gemma":[0.0397307,0.00012886037,0.9584981,0.000070841066,0.000044433127,0.000120493336,0.00016209699,0.00006794662,0.0011764157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894243,0.00037902358,0.0000610697,0.00019563637,0.00035445378,0.00006735167],"domain_scores_gemma":[0.9983022,0.0008424833,0.00016006631,0.0002067812,0.00042405765,0.000064452455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020572657,0.0014091831,0.0011132552,0.0005906333,0.00048398718,0.0009471795,0.0010827287,0.0012487676,0.0019973684],"category_scores_gemma":[0.0054346444,0.0005565743,0.00096895214,0.0008351587,0.00085141475,0.0014188442,0.0012547517,0.0020328446,0.0009119022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014812073,0.000075570904,0.0004883752,0.00024007545,0.00010908653,0.00019555706,0.00017230715,0.6844304,0.010626353,0.054846454,0.007875761,0.24079195],"study_design_scores_gemma":[0.000012734612,0.000018350822,0.000034808265,0.000007827168,0.000004003449,0.000044205346,0.000008250887,0.9887418,0.001013983,0.0083483225,0.0017597538,0.000005955447],"about_ca_topic_score_codex":0.0027134973,"about_ca_topic_score_gemma":0.0039257817,"teacher_disagreement_score":0.0027134973,"about_ca_system_score_codex":0.0005967677,"about_ca_system_score_gemma":0.001524925,"threshold_uncertainty_score":0.010879993},"labels":[],"label_agreement":null},{"id":"W3005526145","doi":"10.1109/jsac.2020.3019722","title":"Massive Unsourced Random Access Based on Uncoupled Compressive Sensing: Another Blessing of Massive MIMO","year":2020,"lang":"en","type":"preprint","venue":"IEEE Journal on Selected Areas in Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Compressed sensing; Context (archaeology); Algorithm; MIMO; Constellation; Cluster analysis; Channel (broadcasting); Theoretical computer science; Computer engineering; Computer network; Artificial intelligence","score_opus":0.0619434209928295,"score_gpt":0.3106691160377372,"score_spread":0.2487256950449077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005526145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00951501,0.00027651398,0.9862553,0.0004415572,0.0000717394,0.0000228279,0.000033158347,0.00016284296,0.003221022],"genre_scores_gemma":[0.66399413,0.00095649564,0.32763204,0.0006827814,0.00030549843,0.00015478658,0.00014257676,0.000088074456,0.0060435613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932647,0.00028745277,0.000021080403,0.00009883698,0.00020618792,0.000059982307],"domain_scores_gemma":[0.99857426,0.0007089268,0.00011640738,0.00041564897,0.00011533121,0.00006935812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090798986,0.00055948156,0.00071769045,0.00024255663,0.00032756088,0.00093370874,0.0011274628,0.0007433263,0.0013569562],"category_scores_gemma":[0.0026059067,0.00028095843,0.00042233232,0.00045061015,0.0014225724,0.0015400118,0.0015411502,0.0014648325,0.0005341671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026730954,0.00009479192,0.0006833189,0.00030489493,0.000108949906,0.00043920448,0.00046086055,0.3541959,0.032451864,0.47383022,0.003972558,0.13318999],"study_design_scores_gemma":[0.00002391335,0.00014973637,0.00014529703,0.000031018062,0.000015285683,0.00021652477,0.000053515545,0.9039458,0.0070049567,0.08346831,0.0049169273,0.000028687182],"about_ca_topic_score_codex":0.00034780754,"about_ca_topic_score_gemma":0.0004688882,"teacher_disagreement_score":0.0013569562,"about_ca_system_score_codex":0.00030442167,"about_ca_system_score_gemma":0.0005722872,"threshold_uncertainty_score":0.004801929},"labels":[],"label_agreement":null},{"id":"W3005586683","doi":"10.1109/tbdata.2020.2972887","title":"Least Squares Approximation via Sparse Subsampled Randomized Hadamard Transform","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Big Data","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hadamard transform; Computer science; Algorithm; Subspace topology; Overdetermined system; Randomized algorithm; Embedding; Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.0974922001653938,"score_gpt":0.25270262016454015,"score_spread":0.15521041999914637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005586683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003483697,0.00011004333,0.99558014,0.00009987648,0.000028211916,0.000016123642,0.000036601527,0.00024004062,0.0004052967],"genre_scores_gemma":[0.2019349,0.0003116222,0.7950767,0.00020885242,0.00010462373,0.0001717521,0.0003629581,0.00012836972,0.0017002593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986739,0.0004931153,0.00005989268,0.00020815815,0.00047747995,0.000087457716],"domain_scores_gemma":[0.9972025,0.0017230358,0.00022762713,0.00042998875,0.0003436441,0.000073156276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015489049,0.00084412465,0.0011215621,0.00054484647,0.00036145066,0.00085935777,0.0010963306,0.0011911608,0.001789597],"category_scores_gemma":[0.008678102,0.0004420758,0.0008539578,0.0008760785,0.0010439929,0.0016152266,0.0013528481,0.001991628,0.0006850192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022786869,0.00007952553,0.00087784085,0.00018976585,0.00009948496,0.0001478944,0.00011134926,0.8090063,0.012081444,0.06286389,0.0037600829,0.11055454],"study_design_scores_gemma":[0.000012966755,0.000023958253,0.000049015704,0.0000047306394,0.0000037987295,0.000032693435,0.000008006731,0.99177015,0.0013512487,0.0061240834,0.0006126432,0.0000067445367],"about_ca_topic_score_codex":0.0028879247,"about_ca_topic_score_gemma":0.0033121363,"teacher_disagreement_score":0.0028879247,"about_ca_system_score_codex":0.00047786458,"about_ca_system_score_gemma":0.00141725,"threshold_uncertainty_score":0.008191466},"labels":[],"label_agreement":null},{"id":"W3006358151","doi":"10.1109/icassp40776.2020.9054770","title":"Bit Allocation for Multi-Task Collaborative Intelligence","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Cloud computing; Mobile device; Task (project management); Feature (linguistics); Inference; Constraint (computer-aided design); Artificial intelligence; Deep learning; Software deployment; Tensor (intrinsic definition); Distortion (music); Function (biology); Machine learning; Data mining; Distributed computing; Computer network; Software engineering","score_opus":0.0797103264631187,"score_gpt":0.31527538095597324,"score_spread":0.23556505449285453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006358151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016854133,0.00037066083,0.9805103,0.00023812368,0.000052757016,0.00004516723,0.00004566397,0.00033907342,0.0015440314],"genre_scores_gemma":[0.7510616,0.00040693133,0.24373432,0.00027570032,0.00012009943,0.000147881,0.00013352229,0.0001171903,0.004002795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998594,0.0004523868,0.00007421994,0.00026172854,0.00043461137,0.00018313255],"domain_scores_gemma":[0.9979407,0.0009767934,0.00020392203,0.00046780272,0.00028814524,0.00012260582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582825,0.00088807783,0.000984459,0.0004814893,0.0005133447,0.0011281869,0.0014787215,0.0010732721,0.0033864183],"category_scores_gemma":[0.006275285,0.0003393107,0.0004075098,0.00095622736,0.0010342154,0.0027892005,0.0017254831,0.0015073861,0.0006301846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009679496,0.00024678945,0.0008478007,0.00018409721,0.000071708615,0.0001917875,0.0002957844,0.56341195,0.02015464,0.07310836,0.005504849,0.33501425],"study_design_scores_gemma":[0.000014275103,0.00004273859,0.000075028736,0.0000063112448,0.000006547971,0.000056854806,0.000019004367,0.98276514,0.0033303043,0.012898757,0.0007757495,0.000009316187],"about_ca_topic_score_codex":0.0017068052,"about_ca_topic_score_gemma":0.001937128,"teacher_disagreement_score":0.0033864183,"about_ca_system_score_codex":0.00097344775,"about_ca_system_score_gemma":0.0008877301,"threshold_uncertainty_score":0.011328638},"labels":[],"label_agreement":null},{"id":"W3006474645","doi":"10.1007/s11760-021-01872-y","title":"Utilizing the wavelet transform’s structure in compressed sensing","year":2021,"lang":"en","type":"article","venue":"Signal Image and Video Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials","funders":"National Heart, Lung, and Blood Institute; National Institutes of Health; American Heart Association","keywords":"Compressed sensing; Affine transformation; Wavelet; Transformation (genetics); Wavelet transform; Discrete wavelet transform; Noise reduction; Pattern recognition (psychology); Iterative reconstruction","score_opus":0.012749573847092962,"score_gpt":0.23592813856091321,"score_spread":0.22317856471382025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006474645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012727222,0.0019621968,0.9799227,0.0010461682,0.00025822644,0.00001474813,0.000045739653,0.000060190756,0.0039626183],"genre_scores_gemma":[0.3605536,0.0099188965,0.6203306,0.0007630723,0.001135858,0.000055271816,0.00022077278,0.000082358376,0.0069396575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997907,0.000068235924,0.000009638297,0.000023983943,0.00009561736,0.000011860476],"domain_scores_gemma":[0.9996061,0.0002318057,0.000035432968,0.000051292933,0.000062058716,0.000013356389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048434563,0.00034260048,0.00027636124,0.00052484794,0.00014630861,0.000573991,0.0002998335,0.0006624988,0.0008618203],"category_scores_gemma":[0.0021199782,0.00016794747,0.00019978055,0.00093743834,0.00094477617,0.0010125581,0.00046417385,0.001075966,0.0002751765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012328805,0.000055124154,0.0003818719,0.0002645412,0.000032376654,0.00020059163,0.0001508649,0.04583509,0.06301186,0.6312788,0.0034752893,0.25519025],"study_design_scores_gemma":[0.000023968427,0.00014364498,0.0005079982,0.000061388375,0.000018421202,0.00046605623,0.00005970696,0.6962096,0.021028575,0.2671452,0.014299717,0.000035726953],"about_ca_topic_score_codex":0.0004885454,"about_ca_topic_score_gemma":0.000514855,"teacher_disagreement_score":0.0008618203,"about_ca_system_score_codex":0.000148418,"about_ca_system_score_gemma":0.00030996974,"threshold_uncertainty_score":0.0028830767},"labels":[],"label_agreement":null},{"id":"W3009926847","doi":"10.1109/access.2020.2990155","title":"Maximum Feasible Subsystem Algorithms for Recovery of Compressively Sensed Speech","year":2020,"lang":"en","type":"preprint","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Computer science; Signal recovery; SIGNAL (programming language); Speech recognition; TIMIT; Algorithm; Compression (physics); Quality (philosophy); Hidden Markov model","score_opus":0.10706577367752672,"score_gpt":0.32300703088877863,"score_spread":0.2159412572112519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009926847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041792514,0.000100248086,0.99483055,0.00007235619,0.000008083005,0.00002327609,0.000017510683,0.00012694912,0.0006417866],"genre_scores_gemma":[0.16176406,0.00039279312,0.8338875,0.000074744756,0.000040504456,0.0001671052,0.00019914226,0.00010755929,0.0033666387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957913,0.00016206922,0.00002549749,0.000050774208,0.0001555477,0.000026971224],"domain_scores_gemma":[0.9989754,0.0006395432,0.00010969441,0.000117683805,0.00012549436,0.000032237273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009186342,0.000980464,0.0005377464,0.0005550319,0.0003189599,0.00055125466,0.00073181256,0.0007772971,0.002835892],"category_scores_gemma":[0.0038049459,0.00034451342,0.0004299601,0.00068433373,0.0008268306,0.001185071,0.0011597251,0.0011284568,0.00065077463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000337658,0.0000773889,0.00041405336,0.00029792727,0.000051997882,0.0001271183,0.00031317968,0.50418085,0.034387987,0.08113715,0.0035325345,0.37514216],"study_design_scores_gemma":[0.000015280799,0.00007258234,0.00011956789,0.00001588635,0.000005448521,0.0000598085,0.00003048392,0.9784597,0.006608112,0.01255149,0.0020492012,0.00001240342],"about_ca_topic_score_codex":0.0014514073,"about_ca_topic_score_gemma":0.0023552736,"teacher_disagreement_score":0.002835892,"about_ca_system_score_codex":0.00038087994,"about_ca_system_score_gemma":0.00073357567,"threshold_uncertainty_score":0.009487033},"labels":[],"label_agreement":null},{"id":"W3011628187","doi":"10.1109/sampta45681.2019.9030814","title":"Non-Gaussian Random Matrices on Sets:Optimal Tail Dependence and Applications","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Gaussian; Random matrix; Dimension (graph theory); Dependency (UML); Algorithm; Computer science; Gaussian process; Gaussian random field; Set (abstract data type); Matrix (chemical analysis); Gaussian function; Mathematics; Artificial intelligence; Combinatorics; Physics; Eigenvalues and eigenvectors","score_opus":0.006710938321422676,"score_gpt":0.22130676418681489,"score_spread":0.21459582586539222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011628187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02016492,0.0012542295,0.9614976,0.0017614447,0.00016200045,0.00005560964,0.00014829294,0.0002044521,0.014751434],"genre_scores_gemma":[0.7944309,0.006775404,0.18098262,0.0015200083,0.00095305376,0.00033402635,0.00044355242,0.00047497227,0.014085477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717134,0.0012534691,0.00011163591,0.0003836213,0.0007562122,0.0003236546],"domain_scores_gemma":[0.9757142,0.018887635,0.0013109104,0.0014782897,0.0017025253,0.0009065485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004833677,0.0020003486,0.0013297019,0.0011386008,0.0008846375,0.0017614723,0.0019871793,0.002198326,0.0061371354],"category_scores_gemma":[0.03578217,0.00086270936,0.0010359456,0.0017195359,0.0044285883,0.0053091445,0.0050859884,0.0050488645,0.0012473862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017238698,0.00012550059,0.0007083197,0.0002746007,0.000037661095,0.00033028616,0.00027724577,0.13254732,0.006202311,0.82829815,0.005285385,0.025740884],"study_design_scores_gemma":[0.000018997749,0.00007504003,0.0003073717,0.000058576206,0.000014429809,0.00019730181,0.00007614617,0.5372299,0.002659464,0.456978,0.0023408527,0.00004395292],"about_ca_topic_score_codex":0.001167291,"about_ca_topic_score_gemma":0.0012114639,"teacher_disagreement_score":0.0061371354,"about_ca_system_score_codex":0.0016388764,"about_ca_system_score_gemma":0.0012083845,"threshold_uncertainty_score":0.02556324},"labels":[],"label_agreement":null},{"id":"W3013023228","doi":"10.1109/ieeeconf44664.2019.9048711","title":"Bundle methods for dual atomic pursuit","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bundle; Duality (order theory); Dual (grammatical number); Set (abstract data type); Sequence (biology); Duality gap; Bundle adjustment; Gauge (firearms); Optimization problem; Mathematical optimization; Computer science; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence","score_opus":0.01911122641701402,"score_gpt":0.3117463287089009,"score_spread":0.2926351022918869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013023228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012151415,0.00012700117,0.99720806,0.00007858768,0.00002528869,0.000015582644,0.000020225452,0.00009899129,0.001211145],"genre_scores_gemma":[0.10062545,0.0007144193,0.89213175,0.000208273,0.00017821926,0.00027790095,0.00023595878,0.0002724354,0.005355524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902654,0.00045334912,0.000031601983,0.0001200763,0.00030140922,0.00006706774],"domain_scores_gemma":[0.99873203,0.0006278158,0.000106170366,0.00023052105,0.00021633404,0.00008706809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018614694,0.0010421741,0.001122075,0.0011579071,0.0006411127,0.0012431863,0.0011771511,0.0014004243,0.00494201],"category_scores_gemma":[0.004666121,0.00060403254,0.0009968636,0.0012152542,0.0017485456,0.0018735682,0.003209133,0.002918292,0.0017446164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013490692,0.00007659222,0.00043399318,0.00018664818,0.00007894804,0.00007490664,0.0001478879,0.15986069,0.00735163,0.69878364,0.0051437872,0.12772644],"study_design_scores_gemma":[0.000019146175,0.0000609459,0.000068190646,0.000020086098,0.0000067177666,0.000050917926,0.000018022018,0.8033621,0.0016554059,0.18930346,0.0054196073,0.000015308191],"about_ca_topic_score_codex":0.0007963022,"about_ca_topic_score_gemma":0.0008976801,"teacher_disagreement_score":0.00494201,"about_ca_system_score_codex":0.00069350173,"about_ca_system_score_gemma":0.0008970641,"threshold_uncertainty_score":0.01653266},"labels":[],"label_agreement":null},{"id":"W3013368816","doi":"10.1109/apsar46974.2019.9048389","title":"Design of Adaptive Thresholds For One-Bit Radar Imaging Based on Adversarial Samples","year":2019,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Quantization (signal processing); Robustness (evolution); Thresholding; Radar imaging; Radar; Artificial intelligence; Compressed sensing; Algorithm; Binary number; Computer vision; Mathematics; Image (mathematics); Telecommunications","score_opus":0.03791940044115856,"score_gpt":0.23033115312046246,"score_spread":0.19241175267930388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013368816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079023475,0.00014524414,0.9910452,0.00007247612,0.00003504081,0.00003124731,0.000015764095,0.00012622641,0.0006264768],"genre_scores_gemma":[0.61142075,0.00038853215,0.38584858,0.00023514415,0.00006588187,0.0001335063,0.00007871503,0.00006809464,0.0017607998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00017279905,0.000053761174,0.00017251946,0.0003147422,0.00006557448],"domain_scores_gemma":[0.9987839,0.00047178863,0.00021859341,0.0001672313,0.00027304617,0.00008549668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007165126,0.0005877048,0.0005411769,0.00041016645,0.000275361,0.0006692385,0.0011742819,0.0007103623,0.0013432116],"category_scores_gemma":[0.0036156836,0.00028492865,0.00025429868,0.00038120922,0.00080938137,0.0017224245,0.0013531536,0.0010268531,0.0003911233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007807694,0.0001551453,0.0016454606,0.00032461056,0.00008343007,0.0003517757,0.00042082305,0.28163537,0.23079775,0.094848536,0.0034897325,0.38546664],"study_design_scores_gemma":[0.000023298682,0.00018733153,0.00023601069,0.00002309617,0.000015727182,0.0002627321,0.000030303027,0.9543119,0.032821503,0.009636589,0.0024164082,0.00003507738],"about_ca_topic_score_codex":0.0003760787,"about_ca_topic_score_gemma":0.00033944382,"teacher_disagreement_score":0.0013432116,"about_ca_system_score_codex":0.00041063986,"about_ca_system_score_gemma":0.00043292317,"threshold_uncertainty_score":0.0044935346},"labels":[],"label_agreement":null},{"id":"W3013493556","doi":"10.1109/ieeeconf44664.2019.9048886","title":"Phase Transition Analysis for Covariance Based Massive Random Access with Massive MIMO","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Covariance matrix; Covariance; MIMO; Random matrix; Computer science; Random access; Algorithm; Base station; Fisher information; Matrix (chemical analysis); Mathematical optimization; Mathematics; Statistics; Telecommunications; Eigenvalues and eigenvectors; Computer network","score_opus":0.029538182423788466,"score_gpt":0.2901874422453284,"score_spread":0.2606492598215399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013493556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035809923,0.00044981352,0.95864373,0.0004001928,0.00003818366,0.000039936225,0.00007031119,0.00011668031,0.004431296],"genre_scores_gemma":[0.9344271,0.0009876402,0.058675516,0.00025274412,0.00011372652,0.00014432798,0.00015843334,0.00009058901,0.0051498846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.00018555697,0.000016939723,0.000075406686,0.00020770419,0.000074731295],"domain_scores_gemma":[0.9930709,0.005262578,0.00077731477,0.00023839301,0.00052634353,0.00012452179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202388,0.00058828964,0.0006320535,0.0006622391,0.00032613872,0.00092081836,0.00062890863,0.00066318613,0.0021279824],"category_scores_gemma":[0.009260241,0.00039692884,0.00046473506,0.0005677487,0.0014343788,0.0017188003,0.0011331728,0.0012216694,0.00027369976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012721984,0.000074819436,0.0013801783,0.00020764991,0.000058934205,0.00029634233,0.00026096226,0.48958185,0.0074183405,0.48225456,0.0014173207,0.01692185],"study_design_scores_gemma":[0.0000066750094,0.000021091979,0.00023444006,0.000011167647,0.000004348846,0.000050946957,0.000021341011,0.9555473,0.00068413815,0.04304607,0.000362492,0.000010112893],"about_ca_topic_score_codex":0.00093493407,"about_ca_topic_score_gemma":0.000720881,"teacher_disagreement_score":0.0021279824,"about_ca_system_score_codex":0.00070575794,"about_ca_system_score_gemma":0.0006007943,"threshold_uncertainty_score":0.008568704},"labels":[],"label_agreement":null},{"id":"W3015312777","doi":"10.1109/icassp40776.2020.9053742","title":"A New Multihypothesis Prediction Scheme for Compressed Video Sensing Reconstruction","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Preprocessor; Residual; Artificial intelligence; Scheme (mathematics); Quality (philosophy); Pattern recognition (psychology); Computer vision; Machine learning; Data mining; Algorithm; Mathematics","score_opus":0.033510546001582986,"score_gpt":0.21290932419137357,"score_spread":0.17939877818979058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015312777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005601439,0.0002291408,0.992896,0.00013481648,0.00006272623,0.000043484877,0.000064429594,0.00025059836,0.0007173894],"genre_scores_gemma":[0.28126264,0.0006755629,0.7129446,0.00030903693,0.00018591857,0.00014124825,0.00043125186,0.0000669978,0.003982673],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993667,0.00011138494,0.00004051306,0.00012855907,0.0003046845,0.00004824502],"domain_scores_gemma":[0.99944586,0.00015583773,0.00006803905,0.00012535331,0.00016506479,0.00003990364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006721622,0.00069346203,0.0005472482,0.0004434657,0.000455228,0.00041814146,0.0009836184,0.00076072244,0.0023494654],"category_scores_gemma":[0.0016795116,0.00025995658,0.00039186561,0.0007645065,0.00042258418,0.0016256255,0.001171496,0.0012438892,0.00066501653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000704706,0.00012873046,0.00078879006,0.00026950648,0.000072815725,0.00030469903,0.00023297875,0.08386624,0.1728779,0.03428548,0.007239087,0.69922906],"study_design_scores_gemma":[0.00003676575,0.00019841341,0.00030191918,0.000011680737,0.00001847404,0.00026663137,0.000017849836,0.9698262,0.020940444,0.0041193143,0.0042267484,0.00003544174],"about_ca_topic_score_codex":0.0019783003,"about_ca_topic_score_gemma":0.0026790802,"teacher_disagreement_score":0.0023494654,"about_ca_system_score_codex":0.00031833412,"about_ca_system_score_gemma":0.0007245237,"threshold_uncertainty_score":0.0078597665},"labels":[],"label_agreement":null},{"id":"W3016792721","doi":"10.1553/etna_vol52s214","title":"ADMM-Softmax: an ADMM approach for multinomial logistic regression. ETNA - Electronic Transactions on Numerical Analysis","year":2020,"lang":"en","type":"article","venue":"Oesterreichisches Musiklexikon online (Institut für kunst- und musikhistorische Forschungen der  Österreichischen Akademie der Wissenschaften)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Softmax function; Multinomial logistic regression; Mathematics; Stochastic gradient descent; Convex optimization; Mathematical optimization; Preconditioner; Generalization; Algorithm; Computer science; Applied mathematics; Regular polygon; Artificial intelligence; Iterative method; Statistics; Deep learning","score_opus":0.05686069391170142,"score_gpt":0.3167057231052122,"score_spread":0.2598450291935108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016792721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004972922,0.0004658894,0.99727243,0.00026124882,0.000075858996,0.000017326985,0.000052498952,0.00022292307,0.0011345102],"genre_scores_gemma":[0.06041233,0.0017441371,0.9262465,0.0004453379,0.00023719842,0.00034398804,0.00063752726,0.00036022742,0.009572681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990551,0.00040263604,0.00007149414,0.00014514275,0.00027215254,0.000053573407],"domain_scores_gemma":[0.99838054,0.0008223107,0.00017310155,0.00020970692,0.00033970855,0.00007476025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024046504,0.0014591021,0.0014238593,0.0008060095,0.0005376411,0.0017744048,0.0019265,0.0022516598,0.007830138],"category_scores_gemma":[0.007009884,0.0008073994,0.0012801881,0.0013323227,0.0011404895,0.0016680459,0.0022268242,0.003636935,0.002907755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112066045,0.000077109245,0.0008992037,0.00043284017,0.00022250485,0.00020781055,0.000106521635,0.65462756,0.0035189488,0.07347179,0.029319368,0.23700435],"study_design_scores_gemma":[0.000013054798,0.000016208794,0.00007006879,0.000026702435,0.000008552912,0.000049930983,0.000008095858,0.9759787,0.0005784072,0.01673376,0.0065061073,0.000010570989],"about_ca_topic_score_codex":0.0028939766,"about_ca_topic_score_gemma":0.0039742435,"teacher_disagreement_score":0.007830138,"about_ca_system_score_codex":0.0008641404,"about_ca_system_score_gemma":0.0021877903,"threshold_uncertainty_score":0.026194453},"labels":[],"label_agreement":null},{"id":"W3017511415","doi":"10.1364/oe.402873","title":"100,000 frames-per-second compressive imaging with a conventional rolling-shutter camera by random point-spread-function engineering","year":2020,"lang":"en","type":"article","venue":"Optics Express","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science, Technology and Space; H2020 Excellent Science; Azrieli Foundation; Israel Science Foundation; Human Frontier Science Program","keywords":"Frame rate; Diffuser (optics); Compressed sensing; Iterative reconstruction; Frame (networking); Sampling (signal processing); Pupil; Coded aperture","score_opus":0.007537924490767427,"score_gpt":0.19479092798201042,"score_spread":0.187253003491243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017511415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24128936,0.00048301148,0.7476775,0.0005590712,0.0001537758,0.00015465885,0.00030071574,0.0020075794,0.0073743225],"genre_scores_gemma":[0.42446053,0.0003392331,0.57175326,0.00011939473,0.00005733027,0.0001235068,0.00029500556,0.00007871111,0.0027730367],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981326,0.000018332703,0.000006544892,0.000038896447,0.00010719955,0.000015799862],"domain_scores_gemma":[0.99982554,0.000046842815,0.000026002479,0.000041460084,0.000040571027,0.000019727706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028664165,0.0002948739,0.00025347614,0.00025284712,0.00015892675,0.00033951228,0.00036487746,0.00031956198,0.0015409823],"category_scores_gemma":[0.00054050854,0.00013683604,0.000108581284,0.00023553388,0.00028356118,0.00053222675,0.00036041046,0.00044574478,0.00040182102],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002525659,0.00011009433,0.000639966,0.000098014854,0.000016518048,0.00017342962,0.00013480964,0.011520058,0.84401,0.008792977,0.0028914202,0.13136022],"study_design_scores_gemma":[0.0000580767,0.0005800289,0.00218503,0.00002414055,0.000018329276,0.000541745,0.00006597259,0.43435162,0.5390333,0.003053355,0.020022849,0.0000655504],"about_ca_topic_score_codex":0.00073792104,"about_ca_topic_score_gemma":0.0017596773,"teacher_disagreement_score":0.0015409823,"about_ca_system_score_codex":0.00021509765,"about_ca_system_score_gemma":0.00033249427,"threshold_uncertainty_score":0.005155146},"labels":[],"label_agreement":null},{"id":"W3018454929","doi":"10.1109/taes.2020.2990818","title":"DOA Estimation Using Compressive Sampling-Based Sensors in the Presence of Interference","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Air Canada; Royal Military College of Canada; Canadian Apheresis Group","funders":"","keywords":"Compressed sensing; Nyquist rate; Interference (communication); Computer science; Noise (video); Nyquist–Shannon sampling theorem; Algorithm; Direction of arrival; Covariance matrix; Sampling (signal processing); Electronic engineering; Telecommunications; Engineering; Artificial intelligence; Computer vision; Detector","score_opus":0.03627180382438669,"score_gpt":0.2604830668765754,"score_spread":0.22421126305218872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018454929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01834555,0.0004047322,0.97989696,0.00011358831,0.000041344105,0.000019971512,0.00002516763,0.00012637743,0.0010263874],"genre_scores_gemma":[0.5713979,0.0008667022,0.42597333,0.00015046388,0.0002252807,0.00006626725,0.00015773128,0.00002681663,0.0011355937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944013,0.00013167845,0.000031546067,0.00009104718,0.00026864297,0.000036826576],"domain_scores_gemma":[0.9992077,0.00044416398,0.000105159175,0.00009072795,0.00012574137,0.00002653298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053064455,0.00060285354,0.0006760268,0.00049281423,0.0002706463,0.00043326127,0.00060597697,0.0005218556,0.00041044672],"category_scores_gemma":[0.0025498108,0.0002660897,0.00031214705,0.00058703386,0.00051824097,0.0010726674,0.00080463046,0.0006817663,0.00017017282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062866113,0.00014544884,0.0033935823,0.00028710486,0.00014152048,0.00035625914,0.00027987856,0.44211832,0.09123741,0.022750452,0.001430539,0.4372308],"study_design_scores_gemma":[0.000020199062,0.00007793603,0.00040576473,0.0000117552745,0.000016160868,0.00014129629,0.000022503189,0.98814917,0.0069903196,0.0030959982,0.0010551141,0.000013715224],"about_ca_topic_score_codex":0.0013992625,"about_ca_topic_score_gemma":0.0014967303,"teacher_disagreement_score":0.0013992625,"about_ca_system_score_codex":0.00021720823,"about_ca_system_score_gemma":0.0004099716,"threshold_uncertainty_score":0.0028063655},"labels":[],"label_agreement":null},{"id":"W3020910130","doi":"10.1287/moor.2020.1092","title":"Proximal Gradient Methods with Adaptive Subspace Sampling","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"Agence Nationale de la Recherche","keywords":"Subspace topology; Linear subspace; Proximal Gradient Methods; Sampling (signal processing); Key (lock); Computer science; Algorithm; Artificial intelligence; Mathematical optimization; Identification (biology); Mathematics; Gradient descent; Artificial neural network; Computer vision","score_opus":0.23433405679777014,"score_gpt":0.44618666313800154,"score_spread":0.2118526063402314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020910130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014272413,0.00015284453,0.9975993,0.000066868924,0.00002413817,0.000027444914,0.000011715058,0.00013090864,0.0005594871],"genre_scores_gemma":[0.15257014,0.00068150164,0.8409182,0.0002040684,0.00020234422,0.00042948744,0.00016122813,0.00021070831,0.0046224366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00077215006,0.000042021504,0.00014471664,0.00039015443,0.00006372553],"domain_scores_gemma":[0.99860734,0.00083127833,0.00009901567,0.00017887732,0.00021409201,0.00006940779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017556278,0.0011467349,0.0012976706,0.00074367307,0.00042405835,0.0007476706,0.0012659814,0.0013353544,0.0025344107],"category_scores_gemma":[0.0059482064,0.0006067467,0.0007860584,0.00094598904,0.0014297217,0.0013807695,0.002048009,0.0018056965,0.0011510119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022000205,0.00013145708,0.00046048468,0.0002928172,0.00012459738,0.0001210708,0.00012021411,0.65567935,0.007824914,0.18875551,0.004140147,0.14212951],"study_design_scores_gemma":[0.000029072042,0.00006747717,0.00005321649,0.000010518386,0.0000063022294,0.000041718584,0.0000072042117,0.9702288,0.0013217357,0.025832742,0.0023893586,0.000011920701],"about_ca_topic_score_codex":0.0015269476,"about_ca_topic_score_gemma":0.001240754,"teacher_disagreement_score":0.0025344107,"about_ca_system_score_codex":0.00046914464,"about_ca_system_score_gemma":0.0012822658,"threshold_uncertainty_score":0.009284735},"labels":[],"label_agreement":null},{"id":"W3021704413","doi":"10.5539/mas.v14n5p86","title":"A Spectral Gradient Projection Method for Sparse Signal Reconstruction in Compressive Sensing","year":2020,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Rajamangala University of Technology Phra Nakhon","keywords":"Conjugate gradient method; Jacobian matrix and determinant; Compressed sensing; Proximal Gradient Methods; Gradient method; Algorithm; SIGNAL (programming language); Matrix (chemical analysis); Computer science; Projection (relational algebra); Mathematical optimization; Nonlinear conjugate gradient method; Signal reconstruction; Mathematics; Convex optimization; Sparse matrix; Regular polygon; Signal processing; Gradient descent; Applied mathematics; Physics; Artificial intelligence; Materials science","score_opus":0.03489638008606157,"score_gpt":0.2619194896402945,"score_spread":0.2270231095542329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021704413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010302729,0.00020238887,0.9979765,0.000060953134,0.000035565077,0.000020572399,0.00001087829,0.00008355766,0.0005793317],"genre_scores_gemma":[0.05996148,0.0010507535,0.9359119,0.00013595038,0.00012599642,0.00015166853,0.00011304009,0.0001249978,0.0024243311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961686,0.00012909516,0.000016298696,0.000057863082,0.0001635738,0.000016273365],"domain_scores_gemma":[0.9997851,0.00007835848,0.000018671646,0.000022156935,0.00007841043,0.000017208855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006225224,0.0008029822,0.000641727,0.0006389012,0.0002906027,0.00047526747,0.00066624815,0.00081163703,0.0018131809],"category_scores_gemma":[0.0010761413,0.00031921334,0.00045533932,0.0006526909,0.0006726307,0.0012097337,0.0008840953,0.0012556011,0.0008950117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020882115,0.0001373323,0.00065625884,0.00072356896,0.00010265595,0.0002135854,0.00018882618,0.16033787,0.08111901,0.1504025,0.007820521,0.59808904],"study_design_scores_gemma":[0.0000247175,0.00010434371,0.00016222465,0.000029314655,0.000015959822,0.00022565664,0.000019521049,0.96348697,0.011736693,0.013932325,0.010233177,0.000029136861],"about_ca_topic_score_codex":0.00068213843,"about_ca_topic_score_gemma":0.000781655,"teacher_disagreement_score":0.0018131809,"about_ca_system_score_codex":0.00022885947,"about_ca_system_score_gemma":0.0006929355,"threshold_uncertainty_score":0.0060656667},"labels":[],"label_agreement":null},{"id":"W3023705181","doi":"10.36227/techrxiv.12199026.v1","title":"A non-convex optimization framework for large-scale low-rank matrix factorization","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Non-negative matrix factorization; Dimensionality reduction; Hessian matrix; Matrix decomposition; Rank (graph theory); Matrix (chemical analysis); Mathematics; Factorization; Conjugate gradient method; Low-rank approximation; Algorithm; Mathematical optimization; Convergence (economics); Computer science; Reduction (mathematics); Applied mathematics; Artificial intelligence; Combinatorics","score_opus":0.017002540152311167,"score_gpt":0.26851983528831774,"score_spread":0.25151729513600657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023705181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025087455,0.00013283223,0.9990005,0.000087094806,0.000025491943,0.000015808515,0.000021610276,0.000048456284,0.000417432],"genre_scores_gemma":[0.057978902,0.0014195176,0.93510455,0.00025257742,0.0003931603,0.00038254433,0.0004157704,0.00019016514,0.0038627505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881244,0.0004807269,0.000054067237,0.00020915916,0.00038265696,0.00006097691],"domain_scores_gemma":[0.99873394,0.00065754063,0.0001282676,0.00013663458,0.00028262055,0.000061016908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017204431,0.0019346497,0.0014793272,0.00093957677,0.0005359289,0.0012976341,0.0014978967,0.0014312555,0.002936462],"category_scores_gemma":[0.0041352995,0.0005832804,0.0012210156,0.0015356423,0.0013662701,0.0015787783,0.0015596456,0.0031241595,0.0017056267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006191625,0.00009181136,0.00033363828,0.00052822905,0.0001273802,0.0002197671,0.00011814472,0.69442856,0.007796783,0.16049784,0.011483285,0.12431264],"study_design_scores_gemma":[0.000007598953,0.000028616541,0.00007487213,0.000014959039,0.0000065974523,0.000049575978,0.000012885195,0.96989197,0.0007755206,0.02567041,0.003456284,0.000010669211],"about_ca_topic_score_codex":0.0028932584,"about_ca_topic_score_gemma":0.003130422,"teacher_disagreement_score":0.002936462,"about_ca_system_score_codex":0.00073233614,"about_ca_system_score_gemma":0.0016351311,"threshold_uncertainty_score":0.0098234415},"labels":[],"label_agreement":null},{"id":"W3024984183","doi":"10.1016/j.acha.2021.01.004","title":"Sparse recovery in bounded Riesz systems with applications to numerical methods for PDEs","year":2021,"lang":"en","type":"preprint","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Bounded function; Independent and identically distributed random variables; Bernoulli process; Isometry (Riemannian geometry); Restricted isometry property; Applied mathematics; Infimum and supremum; Bernoulli's principle; Compressed sensing; Discrete mathematics; Pure mathematics; Random variable; Mathematical analysis; Algorithm; Statistics","score_opus":0.026592088587404434,"score_gpt":0.30570873583294533,"score_spread":0.2791166472455409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024984183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075252056,0.0016621264,0.9859657,0.00096314127,0.00015947154,0.00002529509,0.00008015476,0.00009823951,0.003520606],"genre_scores_gemma":[0.37777275,0.009934038,0.5853397,0.0006813472,0.0015787869,0.00034576314,0.0007251195,0.00039578966,0.023226706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993241,0.00032583496,0.00003227831,0.000076194105,0.00020964004,0.000031944757],"domain_scores_gemma":[0.99591273,0.003056374,0.00025421818,0.0002263214,0.00043289398,0.00011752446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531061,0.0012040129,0.000911722,0.0012603939,0.00038394728,0.0013044432,0.0007248862,0.0019415129,0.0032190734],"category_scores_gemma":[0.010162768,0.00050989154,0.00067054474,0.0013871328,0.0022878011,0.0019431296,0.0021136014,0.002893703,0.0005408569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012187001,0.000109445355,0.00036321054,0.0005155684,0.00006635246,0.00014825733,0.0003641831,0.17333815,0.008627332,0.73004997,0.008624363,0.077671215],"study_design_scores_gemma":[0.000013548808,0.000026347865,0.00012284481,0.000030489298,0.000008604217,0.00004870397,0.000046127254,0.74720716,0.0010093118,0.24854533,0.0029259652,0.00001548867],"about_ca_topic_score_codex":0.0014531147,"about_ca_topic_score_gemma":0.0013666585,"teacher_disagreement_score":0.0032190734,"about_ca_system_score_codex":0.00044808895,"about_ca_system_score_gemma":0.00067932246,"threshold_uncertainty_score":0.010768831},"labels":[],"label_agreement":null},{"id":"W3025814822","doi":"10.1088/1361-6560/ab9357","title":"Gaussian position-weighted center of gravity algorithm for multiplexed readout","year":2020,"lang":"en","type":"article","venue":"Physics in Medicine and Biology","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thunder Bay Regional Research Institute; University of Regina; Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gaussian; Position (finance); Center of gravity; Multiplexing; Center (category theory); Computer science; Algorithm; Physics; Optics; Telecommunications; Chemistry","score_opus":0.13271201319842213,"score_gpt":0.34257724594923455,"score_spread":0.20986523275081242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025814822","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058051436,0.00012773862,0.9913197,0.00005744309,0.000032236916,0.000057231526,0.0000656966,0.0018994348,0.00063543353],"genre_scores_gemma":[0.033613436,0.00009431865,0.96425724,0.000054349435,0.000016644852,0.000104332365,0.0002758327,0.00024692327,0.0013369132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.00012531655,0.000038459242,0.00015043725,0.00037629958,0.00008799245],"domain_scores_gemma":[0.9993722,0.00013354582,0.000076352066,0.000103068254,0.00026723114,0.000047624177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009294513,0.0011851139,0.000721624,0.0015561618,0.00057033746,0.0011708373,0.0017658569,0.0011162594,0.0044161873],"category_scores_gemma":[0.001909716,0.0004369425,0.0007773119,0.0019702362,0.0005049538,0.0011746242,0.0012831044,0.0011740454,0.002084092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059195055,0.0001777119,0.0021681716,0.0001728762,0.00015759197,0.00022617517,0.000271679,0.08862236,0.054491222,0.024520067,0.009327613,0.81927264],"study_design_scores_gemma":[0.000035013436,0.00006920796,0.0007514948,0.000011540052,0.00002184523,0.0002114813,0.000036761685,0.9586226,0.028039584,0.0036338735,0.008520841,0.00004583704],"about_ca_topic_score_codex":0.0052779983,"about_ca_topic_score_gemma":0.006241874,"teacher_disagreement_score":0.0052779983,"about_ca_system_score_codex":0.0008992245,"about_ca_system_score_gemma":0.0024644884,"threshold_uncertainty_score":0.014773667},"labels":[],"label_agreement":null},{"id":"W3030755033","doi":"10.1093/imanum/draa089","title":"Error bounds for overdetermined and underdetermined generalized centred simplex gradients","year":2020,"lang":"en","type":"preprint","venue":"IMA Journal of Numerical Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Overdetermined system; Underdetermined system; Simplex; Moore–Penrose pseudoinverse; Mathematics; Applied mathematics; Combinatorics; Simplex algorithm; Rank (graph theory); Calculus (dental); Mathematical optimization; Algorithm; Linear programming; Geometry; Inverse","score_opus":0.051397494082474224,"score_gpt":0.2926067143301956,"score_spread":0.24120922024772135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030755033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011747933,0.00034185726,0.98590773,0.00015986354,0.00004618441,0.00001875521,0.000039862083,0.00010279062,0.0016350726],"genre_scores_gemma":[0.4815165,0.0009496963,0.5127275,0.0002682737,0.00019531582,0.000116727875,0.00021263433,0.00032938493,0.003683951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675363,0.001296067,0.00016030358,0.00037064162,0.0012378043,0.00018155163],"domain_scores_gemma":[0.9882173,0.007521495,0.00071046123,0.0015831066,0.0016782581,0.0002893211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059727435,0.0011275981,0.0010213231,0.0013901143,0.00054435775,0.0024727278,0.0012589925,0.0012578717,0.0019254074],"category_scores_gemma":[0.027368518,0.00041421896,0.0007182621,0.0013334812,0.0030783727,0.0029200062,0.0028668465,0.0023867278,0.00041059148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017574476,0.000037579073,0.0009274139,0.00018309033,0.00008362915,0.00019047281,0.0002109438,0.48606,0.0066218316,0.4380233,0.0016100445,0.065875836],"study_design_scores_gemma":[0.00000564896,0.000024530826,0.0001784704,0.000032694123,0.000007968872,0.00007612508,0.000023388153,0.91217357,0.0029362359,0.08341149,0.0011040346,0.000025797532],"about_ca_topic_score_codex":0.0025862467,"about_ca_topic_score_gemma":0.0020518906,"teacher_disagreement_score":0.0059727435,"about_ca_system_score_codex":0.001131766,"about_ca_system_score_gemma":0.0010886525,"threshold_uncertainty_score":0.031587243},"labels":[],"label_agreement":null},{"id":"W3032977126","doi":"10.1049/iet-spr.2019.0245","title":"Learning‐based design of random measurement matrix for compressed sensing with inter‐column correlation using copula function","year":2020,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Copula (linguistics); Computer science; Correlation; Pattern recognition (psychology); Compressed sensing; Random matrix; Artificial intelligence; Algorithm; Mathematics; Econometrics; Eigenvalues and eigenvectors; Physics","score_opus":0.058812487455528674,"score_gpt":0.2476509266920826,"score_spread":0.18883843923655394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032977126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013085302,0.0000764917,0.998251,0.000041912954,0.000010065787,0.00001910457,0.0000146541,0.00007594726,0.00020223806],"genre_scores_gemma":[0.25209224,0.0005799704,0.74451756,0.0003065664,0.000110721805,0.0003406459,0.00034014758,0.00012744367,0.0015847285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986916,0.0004964899,0.000060823764,0.00029346766,0.0003724199,0.00008522072],"domain_scores_gemma":[0.9980003,0.001099476,0.00024039017,0.00018265784,0.00041080386,0.00006630436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015302021,0.0012003868,0.00096557965,0.0006018534,0.00034857486,0.00069717417,0.0010443124,0.0009448896,0.0015357463],"category_scores_gemma":[0.0058692712,0.0005276501,0.00063137914,0.0007643244,0.0008445583,0.0013506254,0.0010937366,0.0014427966,0.00072204805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002757718,0.00014970834,0.0010644656,0.00046391835,0.00015023339,0.00020034642,0.00017856195,0.6277053,0.035185374,0.055821523,0.0039650155,0.27483976],"study_design_scores_gemma":[0.0000102121485,0.00005167451,0.0001184764,0.000011490591,0.000010860724,0.000059062393,0.0000076332,0.9921645,0.0030985377,0.0035577426,0.0008960201,0.000013853136],"about_ca_topic_score_codex":0.0014283349,"about_ca_topic_score_gemma":0.0018518972,"teacher_disagreement_score":0.0015357463,"about_ca_system_score_codex":0.0005347701,"about_ca_system_score_gemma":0.0013148616,"threshold_uncertainty_score":0.008092582},"labels":[],"label_agreement":null},{"id":"W3035688841","doi":"","title":"Acceleration for Compressed Gradient Descent in Distributed Optimization","year":2020,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Acceleration; Descent (aeronautics); Computer science; Gradient descent; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Aerospace engineering; Engineering; Classical mechanics","score_opus":0.06559826797288805,"score_gpt":0.2811279469838047,"score_spread":0.21552967901091669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035688841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007936827,0.00020845376,0.9874637,0.00032242195,0.00021080377,0.00005260047,0.000058038804,0.0007288954,0.0030182255],"genre_scores_gemma":[0.3838463,0.00027767188,0.60102046,0.0003634265,0.00027337964,0.0003469062,0.0003973415,0.00048053093,0.012993912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993741,0.0001774531,0.000028083452,0.00008458522,0.00025185116,0.00008391505],"domain_scores_gemma":[0.9985191,0.0007994347,0.000057318517,0.00021768534,0.0003140336,0.00009243301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010870689,0.0010797298,0.0010913959,0.0004813427,0.00050166826,0.0007305368,0.0013685739,0.0014240505,0.007990088],"category_scores_gemma":[0.0049538347,0.0004509709,0.0005149382,0.00067133445,0.00094182236,0.0012078622,0.00196699,0.0023629733,0.0015317848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005874361,0.00027547166,0.0006964908,0.00022659604,0.00007708196,0.000187077,0.00016575669,0.64483935,0.0075762584,0.08032183,0.018334739,0.2467119],"study_design_scores_gemma":[0.00001990095,0.000021072621,0.00003655252,0.0000039184533,0.0000020636492,0.000011288099,0.0000050182916,0.9942965,0.00036877327,0.0046018674,0.0006302968,0.000002715916],"about_ca_topic_score_codex":0.0066316854,"about_ca_topic_score_gemma":0.0094195595,"teacher_disagreement_score":0.007990088,"about_ca_system_score_codex":0.00070115767,"about_ca_system_score_gemma":0.001667807,"threshold_uncertainty_score":0.026729524},"labels":[],"label_agreement":null},{"id":"W3035701005","doi":"10.48550/arxiv.2006.05800","title":"On the Optimal Weighted $\\ell_2$ Regularization in Overparameterized Linear Regression","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lambda; Combinatorics; Star (game theory); Physics; Regularization (linguistics); Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.06866529124887134,"score_gpt":0.18767133421964646,"score_spread":0.11900604297077512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035701005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026137494,0.0014117147,0.9653238,0.0027167313,0.000091568356,0.000060640792,0.0003345433,0.00037599314,0.0035474955],"genre_scores_gemma":[0.5105944,0.00317493,0.45775214,0.0030386383,0.0009763543,0.0008638635,0.0022188334,0.0014015966,0.019979257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965257,0.0023623216,0.00009480769,0.0004835552,0.00032597966,0.0002076373],"domain_scores_gemma":[0.9872513,0.009850012,0.00075817807,0.0010473898,0.00072002324,0.00037318567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011348947,0.0023817183,0.0023085547,0.001261029,0.0007412879,0.0020400428,0.0029778033,0.0037023106,0.003746595],"category_scores_gemma":[0.02886683,0.0013086486,0.0012582947,0.0012701851,0.0036251128,0.0035927251,0.0039657513,0.0045841727,0.00088430167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031148497,0.00012840757,0.0023185764,0.00038109143,0.00024386049,0.0003199722,0.00024537777,0.6508162,0.0024768726,0.3028139,0.0069402144,0.033004086],"study_design_scores_gemma":[0.00002577873,0.000030297262,0.00018752915,0.000038285198,0.000015038005,0.000019484303,0.000016299427,0.9247934,0.00025074842,0.07373433,0.00086839835,0.000020410906],"about_ca_topic_score_codex":0.007048544,"about_ca_topic_score_gemma":0.006405302,"teacher_disagreement_score":0.011348947,"about_ca_system_score_codex":0.0019813841,"about_ca_system_score_gemma":0.0025227906,"threshold_uncertainty_score":0.060019672},"labels":[],"label_agreement":null},{"id":"W3037851568","doi":"10.1109/tsp.2021.3080458","title":"The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"","keywords":"Compressed sensing; Matching pursuit; Computer science; Algorithm; Signal reconstruction; Greedy algorithm; Sparse approximation; Convex optimization; Minification; Thresholding; Mathematical optimization; Sparse matrix; Basis pursuit; Signal processing; Regular polygon; Mathematics; Radar; Artificial intelligence; Image (mathematics)","score_opus":0.04222673465321467,"score_gpt":0.241750638166161,"score_spread":0.19952390351294633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037851568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051023145,0.0001005719,0.99263436,0.00018266881,0.000015884887,0.000016981969,0.000021318003,0.000177408,0.0017485888],"genre_scores_gemma":[0.38588423,0.00084828294,0.6060328,0.0005319492,0.00024621794,0.00018522274,0.00022930729,0.0006981067,0.0053438935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00046803456,0.000065878274,0.00018766616,0.00046424702,0.00009042252],"domain_scores_gemma":[0.9948442,0.0027085084,0.0005523823,0.0010911432,0.0006268239,0.00017700203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020061105,0.0011542509,0.0008544693,0.0004989438,0.00044561582,0.0014896394,0.0012905132,0.0014629512,0.0039982474],"category_scores_gemma":[0.012654597,0.00045007694,0.000810845,0.0007823317,0.0016049624,0.0034542326,0.0028381676,0.002554997,0.0018247137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003091998,0.00012575963,0.0013605246,0.00034019246,0.000106460306,0.00021181411,0.0003567166,0.43369004,0.037619613,0.3161853,0.005905292,0.20378903],"study_design_scores_gemma":[0.00001599564,0.000095470205,0.00014326336,0.00001629348,0.000013342532,0.00009354501,0.000033745837,0.94118005,0.0076421923,0.048785403,0.001963841,0.000016966467],"about_ca_topic_score_codex":0.00068776886,"about_ca_topic_score_gemma":0.00085079955,"teacher_disagreement_score":0.0039982474,"about_ca_system_score_codex":0.0005682706,"about_ca_system_score_gemma":0.0008364362,"threshold_uncertainty_score":0.013375461},"labels":[],"label_agreement":null},{"id":"W3038640622","doi":"","title":"Distributed Kernel Ridge Regression with Communications","year":2020,"lang":"en","type":"article","venue":"CityU Scholars","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Generalization; Computer science; Kernel (algebra); Ridge; Regression; Artificial intelligence; Kernel regression; Kernel method; Machine learning; Regression analysis; Mathematical optimization; Mathematics; Support vector machine; Statistics; Discrete mathematics","score_opus":0.037558106532557325,"score_gpt":0.25178891234430334,"score_spread":0.21423080581174603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038640622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018094612,0.00030213257,0.9790092,0.00036978698,0.000043928703,0.00002627597,0.000022859043,0.00027582515,0.0018554016],"genre_scores_gemma":[0.8652473,0.0004168205,0.13030341,0.0002545022,0.00019068005,0.00015015143,0.00007374135,0.000089925314,0.0032734063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627644,0.0016755085,0.000128055,0.0007024391,0.0009243282,0.00029318008],"domain_scores_gemma":[0.987756,0.00778399,0.00096290646,0.0021293135,0.0011972043,0.00017056022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003527836,0.0008147477,0.001129727,0.00045314291,0.0005073601,0.001025868,0.0013497202,0.0013039707,0.0017091752],"category_scores_gemma":[0.01722719,0.00036047128,0.00044609036,0.0009866337,0.0015322127,0.0028570406,0.002040038,0.0020952837,0.0005671392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035251837,0.000113366295,0.0009253954,0.00013702665,0.000059463426,0.00011930871,0.000113444265,0.8057627,0.0066760737,0.076184414,0.0018717378,0.10768452],"study_design_scores_gemma":[0.0000121110725,0.000047719073,0.00007996031,0.0000033592385,0.000004455606,0.000028084452,0.000010312339,0.9872953,0.001546927,0.010618285,0.00034751015,0.000005958582],"about_ca_topic_score_codex":0.0009042266,"about_ca_topic_score_gemma":0.00085107115,"teacher_disagreement_score":0.003527836,"about_ca_system_score_codex":0.00080315355,"about_ca_system_score_gemma":0.0009612591,"threshold_uncertainty_score":0.018657207},"labels":[],"label_agreement":null},{"id":"W3039933499","doi":"10.1109/i2mtc43012.2020.9129262","title":"Improved Recovery of Compressive Sensed Speech","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"TIMIT; Compressed sensing; Computer science; Speech recognition; Kronecker delta; SIGNAL (programming language); Compression (physics); Data compression; Pattern recognition (psychology); Artificial intelligence; Hidden Markov model; Materials science; Physics","score_opus":0.018305658594321473,"score_gpt":0.21131845995634235,"score_spread":0.19301280136202087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039933499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23677507,0.0009826771,0.7568833,0.0003721976,0.00018234388,0.000055431712,0.00023383071,0.0009235439,0.0035915861],"genre_scores_gemma":[0.6731293,0.00070867705,0.3183038,0.00020041532,0.00013894575,0.000041286312,0.00059227657,0.00010084996,0.006784387],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964225,0.00006357554,0.000018518078,0.00006787877,0.0001748205,0.000032963595],"domain_scores_gemma":[0.9994355,0.00018870561,0.00006250901,0.000104228646,0.00018441901,0.000024529381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045239518,0.00055188814,0.0003151153,0.00046369934,0.00013736787,0.00029393053,0.00035789204,0.00049884437,0.0012074773],"category_scores_gemma":[0.0015757385,0.00014817336,0.00026942109,0.00030268732,0.00030690274,0.000655627,0.00053921074,0.0005113861,0.0005049745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007414398,0.00008237033,0.00080641184,0.00019264166,0.000038449965,0.0003688306,0.00016443906,0.031777445,0.5843919,0.002716547,0.0016346488,0.377085],"study_design_scores_gemma":[0.000043271353,0.0006394563,0.004094637,0.000037989306,0.00004843412,0.001317251,0.00015166838,0.52842677,0.45593402,0.0013932735,0.007849169,0.00006404398],"about_ca_topic_score_codex":0.0008940029,"about_ca_topic_score_gemma":0.0013031035,"teacher_disagreement_score":0.0012074773,"about_ca_system_score_codex":0.000119148724,"about_ca_system_score_gemma":0.00028362474,"threshold_uncertainty_score":0.004039407},"labels":[],"label_agreement":null},{"id":"W3040461295","doi":"10.1109/jsen.2020.3007369","title":"WSN Sampling Optimization for Signal Reconstruction Using Spatiotemporal Autoencoder","year":2020,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Autoencoder; Sampling (signal processing); Computer science; Signal reconstruction; SIGNAL (programming language); Artificial intelligence; Signal processing; Pattern recognition (psychology); Computer vision; Telecommunications; Artificial neural network","score_opus":0.08574858529834938,"score_gpt":0.27482108755105056,"score_spread":0.18907250225270117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040461295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011336794,0.00014622258,0.98773426,0.00009143527,0.0000144145115,0.000012549536,0.000030710482,0.00012587864,0.0005077216],"genre_scores_gemma":[0.6615067,0.00063195574,0.33456424,0.0001237455,0.00006198157,0.00011463257,0.0003254174,0.00007575001,0.0025956568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997274,0.00007432488,0.00001759649,0.00007088465,0.000080345584,0.000029333205],"domain_scores_gemma":[0.9995072,0.0002820644,0.000053795164,0.000037345573,0.000104163875,0.000015498297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007205122,0.0007016206,0.00059147296,0.00031027902,0.00020166952,0.00036519588,0.00054609973,0.000598632,0.0007410255],"category_scores_gemma":[0.001795291,0.00037106092,0.00050176267,0.00044246833,0.0004285709,0.0008669519,0.0006221324,0.00092079036,0.00016675911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052610594,0.000025108387,0.00053421996,0.000053851127,0.000024137795,0.000041907795,0.000033900673,0.9490984,0.004333494,0.0038036336,0.00050272164,0.041495897],"study_design_scores_gemma":[0.0000013148308,0.0000076140964,0.00004476487,0.000001733628,0.0000018430156,0.000005447344,0.0000024780534,0.99886096,0.0005755858,0.00041394797,0.0000831045,0.000001227911],"about_ca_topic_score_codex":0.004874057,"about_ca_topic_score_gemma":0.0044870065,"teacher_disagreement_score":0.004874057,"about_ca_system_score_codex":0.0005271165,"about_ca_system_score_gemma":0.0008391596,"threshold_uncertainty_score":0.009691358},"labels":[],"label_agreement":null},{"id":"W3040538438","doi":"10.3390/s20133703","title":"Trends in Compressive Sensing for EEG Signal Processing Applications","year":2020,"lang":"en","type":"review","venue":"Sensors","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Brain–computer interface; Electroencephalography; Computer science; Field (mathematics); Neural engineering; Signal processing; Energy (signal processing); Interface (matter); SIGNAL (programming language); Artificial intelligence; Machine learning; Neuroscience; Digital signal processing; Psychology; Computer hardware","score_opus":0.04805201194775321,"score_gpt":0.31905179200137196,"score_spread":0.27099978005361874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040538438","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066085014,0.9805712,0.009072333,0.002238643,0.0007294769,0.000029213015,0.00006827833,0.00004967368,0.0065803146],"genre_scores_gemma":[0.0045026843,0.9872055,0.005145403,0.00065842224,0.0009158905,0.00003388435,0.00008877297,0.000014311007,0.0014351731],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993445,0.00013455524,0.000082192215,0.00013976915,0.00026583462,0.00003316039],"domain_scores_gemma":[0.99777704,0.0014582688,0.00014156837,0.00007474457,0.0004919982,0.00005641392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013318096,0.001004459,0.00074223406,0.0023944767,0.00029395352,0.0013210451,0.0009373887,0.0017243153,0.0054161907],"category_scores_gemma":[0.002607207,0.0004630121,0.0008178268,0.0032531067,0.0009625656,0.0021596444,0.0008576375,0.0026762036,0.0022052252],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070523216,0.0000912633,0.00036772375,0.015660144,0.00009746331,0.00018503808,0.00014013838,0.0022185275,0.004639144,0.03715097,0.02005116,0.91932803],"study_design_scores_gemma":[0.000022659788,0.00031101503,0.0017878658,0.0061932583,0.0001387093,0.0020057338,0.00015832658,0.0044068806,0.0036064012,0.027348138,0.9539337,0.00008725065],"about_ca_topic_score_codex":0.0011139186,"about_ca_topic_score_gemma":0.0009075531,"teacher_disagreement_score":0.0054161907,"about_ca_system_score_codex":0.0006508038,"about_ca_system_score_gemma":0.0012864684,"threshold_uncertainty_score":0.018118918},"labels":[],"label_agreement":null},{"id":"W3041589471","doi":"10.1109/memea49120.2020.9137337","title":"MAXimum Feasible Subsystem Recovery of Compressed ECG Signals","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Signal recovery; Bandwidth (computing); Data compression; SIGNAL (programming language); Compression (physics); Compression ratio; Signal processing; Algorithm; Artificial intelligence; Pattern recognition (psychology); Computer hardware; Engineering; Telecommunications; Digital signal processing; Materials science","score_opus":0.03383956244052509,"score_gpt":0.21737869307098542,"score_spread":0.18353913063046035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041589471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094345145,0.00014815392,0.9035756,0.0001836377,0.000015534284,0.000035032564,0.00008498868,0.0003014263,0.0013105103],"genre_scores_gemma":[0.6569515,0.00022522965,0.3400442,0.00007396439,0.000026669491,0.000069761714,0.000485158,0.00004989336,0.002073723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964976,0.00011871291,0.000020676147,0.000050735,0.0001290759,0.0000309586],"domain_scores_gemma":[0.999318,0.0003686218,0.000083762025,0.000083192186,0.000119132645,0.000027298107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059657806,0.00075843476,0.0005052386,0.00038867493,0.00021038418,0.00033466858,0.00043893655,0.00054130197,0.0010882663],"category_scores_gemma":[0.0026509154,0.00018352801,0.00035038948,0.00044069428,0.00034373996,0.00071734417,0.0007390784,0.0005037839,0.00023818582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014749035,0.00014719175,0.0017991253,0.0003118184,0.00008472155,0.00038056893,0.0003372654,0.39159432,0.16476907,0.018418172,0.0024330423,0.41824982],"study_design_scores_gemma":[0.000017610842,0.00010655151,0.0005459382,0.0000060967527,0.0000058368955,0.00006760726,0.00002152029,0.97921264,0.017744882,0.0017519717,0.0005091992,0.000010094634],"about_ca_topic_score_codex":0.0012969441,"about_ca_topic_score_gemma":0.0014001989,"teacher_disagreement_score":0.0012969441,"about_ca_system_score_codex":0.00018779474,"about_ca_system_score_gemma":0.0005588244,"threshold_uncertainty_score":0.003640592},"labels":[],"label_agreement":null},{"id":"W3041604473","doi":"10.1109/memea49120.2020.9137252","title":"Deterministic Compressed Domain Analysis of Multi-channel ECG Measurements","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Compression ratio; Data compression; Frequency domain; Pattern recognition (psychology); Bandwidth (computing); Time domain; Artificial intelligence; Compression (physics); Channel (broadcasting); Computer vision; Materials science; Engineering; Telecommunications","score_opus":0.09958182455867351,"score_gpt":0.2668133535864227,"score_spread":0.1672315290277492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041604473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15085398,0.00045358375,0.8450239,0.00044674263,0.00006240162,0.000055432967,0.00028365376,0.0002567728,0.0025635185],"genre_scores_gemma":[0.88138425,0.0007578528,0.1154202,0.00011889514,0.000068924324,0.000052732743,0.0004241935,0.000023285766,0.0017497375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997044,0.00006267897,0.000015434956,0.00005193594,0.00014661091,0.000018810812],"domain_scores_gemma":[0.9993369,0.00039713868,0.000097429074,0.00006618454,0.00009030295,0.000012062138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029499002,0.00030898783,0.00024605144,0.000388735,0.000106762476,0.00035617946,0.00024014711,0.000336347,0.0005984828],"category_scores_gemma":[0.0018071618,0.00009980994,0.00019803157,0.0004006067,0.00032326477,0.00034985744,0.00029290526,0.0003699559,0.0001042525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005190344,0.00013628833,0.0047860146,0.00046183998,0.00010551432,0.0008377773,0.00024951063,0.51284885,0.19984265,0.026313413,0.0017978939,0.2521012],"study_design_scores_gemma":[0.0000060946604,0.000055442717,0.00291824,0.000010858381,0.000008424824,0.00026457934,0.000035381523,0.9777384,0.015032381,0.0031202713,0.00079677475,0.000013225435],"about_ca_topic_score_codex":0.0011788012,"about_ca_topic_score_gemma":0.0011014605,"teacher_disagreement_score":0.0011788012,"about_ca_system_score_codex":0.00018748987,"about_ca_system_score_gemma":0.00031341202,"threshold_uncertainty_score":0.002343893},"labels":[],"label_agreement":null},{"id":"W3042920671","doi":"10.1214/22-aap1784","title":"Fast and memory-optimal dimension reduction using Kac’s walk","year":2022,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Conjecture; Dimension (graph theory); Random walk; Reduction (mathematics); Isometry (Riemannian geometry); Combinatorics; Moment (physics); Connection (principal bundle); Restricted isometry property; Discrete mathematics; Algorithm; Pure mathematics; Statistics; Compressed sensing","score_opus":0.06150951898676622,"score_gpt":0.2700039662539124,"score_spread":0.20849444726714617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042920671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04382491,0.00039518566,0.9520471,0.00024299408,0.000054418644,0.000056772926,0.00006291182,0.0005123812,0.002803311],"genre_scores_gemma":[0.50552374,0.00041560127,0.48901916,0.0002813188,0.00012122372,0.0001942029,0.00031442082,0.00018086447,0.0039494867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990645,0.00026267397,0.000046164445,0.00019312679,0.0003202254,0.00011324845],"domain_scores_gemma":[0.99848795,0.0008081976,0.00013359624,0.00033157974,0.00014847814,0.00009025016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085147505,0.0006275522,0.0008028077,0.000901427,0.000452722,0.0011082967,0.0009440059,0.0009340362,0.0020120123],"category_scores_gemma":[0.005189723,0.0002992772,0.0005813939,0.00093275995,0.0013633481,0.0021738766,0.0013680306,0.0013879468,0.00087186694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063342514,0.00025376724,0.0018442761,0.00023733277,0.00008568938,0.0001900655,0.00028307026,0.35835826,0.03342057,0.3597823,0.0078114974,0.23709969],"study_design_scores_gemma":[0.000045786077,0.00010690499,0.00023836116,0.0000132526775,0.000009144439,0.00012165499,0.00003408144,0.92582923,0.006005036,0.06576135,0.0018127967,0.000022428707],"about_ca_topic_score_codex":0.0008832638,"about_ca_topic_score_gemma":0.0011056666,"teacher_disagreement_score":0.0020120123,"about_ca_system_score_codex":0.00062403624,"about_ca_system_score_gemma":0.000803812,"threshold_uncertainty_score":0.0067308545},"labels":[],"label_agreement":null},{"id":"W3043869225","doi":"10.1007/s10589-022-00377-9","title":"Accelerated inexact composite gradient methods for nonconvex spectral optimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; National Science Foundation of Sri Lanka; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Differentiable function; Composite number; Lipschitz continuity; Gradient method; Singular value; Matrix (chemical analysis); Proximal Gradient Methods; Function (biology); Convex function; Mathematical optimization; Applied mathematics; Optimization problem; Convex optimization; Regular polygon; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors; Geometry","score_opus":0.02793974280159954,"score_gpt":0.3031777671272709,"score_spread":0.27523802432567135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043869225","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002744227,0.00017171392,0.9951633,0.00011859628,0.00008400653,0.00001650361,0.000019693267,0.00010908111,0.0015727931],"genre_scores_gemma":[0.14554746,0.0006859661,0.8418476,0.0001866593,0.00026782398,0.0002435627,0.00019770091,0.00041656927,0.010606663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00027171336,0.000026519407,0.00005542733,0.00030734917,0.000036585647],"domain_scores_gemma":[0.9977464,0.0013950819,0.00014947435,0.0001932428,0.00040930146,0.00010643534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624687,0.001256049,0.0011661362,0.000743027,0.00039112213,0.0011599648,0.001227239,0.0016790648,0.004259224],"category_scores_gemma":[0.0057288883,0.00060560915,0.0006971223,0.0008140047,0.0012451974,0.001559662,0.0020020725,0.0026672552,0.0010010455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024926616,0.00012279782,0.00032428038,0.00040210786,0.000077378725,0.00013737065,0.00016919937,0.74680305,0.006813938,0.111262605,0.007642049,0.12599589],"study_design_scores_gemma":[0.0000089085115,0.000017442284,0.000031901323,0.000008518284,0.0000030380324,0.000015727926,0.0000067004016,0.99075085,0.0005092288,0.007367983,0.0012751947,0.0000045088736],"about_ca_topic_score_codex":0.0018954129,"about_ca_topic_score_gemma":0.003122296,"teacher_disagreement_score":0.004259224,"about_ca_system_score_codex":0.00048313953,"about_ca_system_score_gemma":0.0013231555,"threshold_uncertainty_score":0.01424855},"labels":[],"label_agreement":null},{"id":"W3044554271","doi":"10.1162/neco_a_01304","title":"Tensor Least Angle Regression for Sparse Representations of Multidimensional Signals","year":2020,"lang":"en","type":"article","venue":"Neural Computation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Matching pursuit; Mathematics; Underdetermined system; Sparse approximation; Algorithm; Kronecker product; Regularization (linguistics); Generalization; Basis pursuit; Overdetermined system; Kronecker delta; Applied mathematics; Computer science; Compressed sensing; Artificial intelligence; Mathematical analysis","score_opus":0.057494084565580444,"score_gpt":0.29685098119685094,"score_spread":0.2393568966312705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044554271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003098083,0.001083242,0.99296016,0.00038247404,0.00008133571,0.000022946868,0.000073382645,0.00041916553,0.0018792471],"genre_scores_gemma":[0.14098372,0.005003922,0.8465403,0.00048310752,0.0002938459,0.00015699155,0.00059917755,0.00036419585,0.005574798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993624,0.00016550037,0.000032590975,0.000121924015,0.0002789046,0.00003870219],"domain_scores_gemma":[0.9991623,0.00037122137,0.00013130356,0.00015173879,0.00014874288,0.00003471287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009224521,0.00079864584,0.00065895554,0.00059155613,0.00032446274,0.0008392872,0.0008318293,0.0009199165,0.0035957582],"category_scores_gemma":[0.002913807,0.0003583181,0.00075669633,0.0013472107,0.0009212357,0.0016489413,0.0011214515,0.0022971556,0.0019600014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012539083,0.000081405735,0.0009376984,0.0007895847,0.000102912294,0.00034387867,0.0002323242,0.4157831,0.0444619,0.25819352,0.01636426,0.26258403],"study_design_scores_gemma":[0.000008748077,0.000030249577,0.00015645655,0.00002710334,0.000008174901,0.00008635162,0.00002203194,0.9602659,0.0052363896,0.023237856,0.010901912,0.000018770337],"about_ca_topic_score_codex":0.0016927699,"about_ca_topic_score_gemma":0.0019993095,"teacher_disagreement_score":0.0035957582,"about_ca_system_score_codex":0.00054019253,"about_ca_system_score_gemma":0.00090397545,"threshold_uncertainty_score":0.012029052},"labels":[],"label_agreement":null},{"id":"W3047692571","doi":"10.1007/s10898-022-01151-1","title":"An adaptive high order method for finding third-order critical points of nonconvex optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Chen; Saddle point; Degenerate energy levels; Order (exchange); Saddle; Applied mathematics; Mathematical optimization","score_opus":0.01743535683543204,"score_gpt":0.3069647303921053,"score_spread":0.2895293735566733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047692571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003266828,0.00009612887,0.9953957,0.000052629886,0.00003817632,0.000022652093,0.0000164886,0.00006429662,0.0010471535],"genre_scores_gemma":[0.18701497,0.00038272934,0.8047732,0.00015111643,0.00010410406,0.0002664195,0.00014670892,0.00020986682,0.0069509125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997421,0.000091259004,0.00001242742,0.00003310384,0.000096101794,0.000025048525],"domain_scores_gemma":[0.99847454,0.0010784295,0.00008199897,0.0000716373,0.00022845433,0.000064993845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048618,0.000969647,0.0010557978,0.00096200174,0.0004883173,0.00085743,0.0011314352,0.0014705362,0.0032679571],"category_scores_gemma":[0.003946751,0.00058663846,0.000759258,0.0006792759,0.0013783356,0.0010066183,0.0014371778,0.0022126734,0.0006500581],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018125404,0.00009441274,0.0005667385,0.00027941575,0.00007021862,0.00015723225,0.00016962751,0.82492113,0.010299439,0.082421176,0.0038342583,0.077005155],"study_design_scores_gemma":[0.0000037274863,0.000012346405,0.000023398432,0.000004571526,0.0000019932947,0.000007617622,0.0000046516725,0.99671376,0.00028618035,0.002560235,0.00037787022,0.0000035951339],"about_ca_topic_score_codex":0.0040346156,"about_ca_topic_score_gemma":0.0063403966,"teacher_disagreement_score":0.0040346156,"about_ca_system_score_codex":0.000653723,"about_ca_system_score_gemma":0.0015339807,"threshold_uncertainty_score":0.010932386},"labels":[],"label_agreement":null},{"id":"W3047952687","doi":"10.1007/s10208-021-09531-x","title":"Optimal Combination of Linear and Spectral Estimators for Generalized Linear Models","year":2021,"lang":"en","type":"preprint","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Institute of Science and Technology Austria; Alan Turing Institute; National Science Foundation","keywords":"Combinatorics; Distribution (mathematics); Physics; Order (exchange); Eigenvalues and eigenvectors; Matrix (chemical analysis); Mathematics; Mathematical analysis; Quantum mechanics","score_opus":0.04256090498939697,"score_gpt":0.3015033345632102,"score_spread":0.25894242957381325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047952687","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008299752,0.00032925495,0.98996526,0.00031563503,0.00003534127,0.000023071208,0.000044641223,0.00025388753,0.00073330326],"genre_scores_gemma":[0.49880102,0.00085028604,0.4921257,0.0005165195,0.0003850072,0.00019253124,0.0005945386,0.0002877516,0.006246648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957093,0.0023596773,0.0001613942,0.00078105816,0.0006789178,0.00030953795],"domain_scores_gemma":[0.9929121,0.0054965247,0.00044171626,0.0004273374,0.0005704886,0.0001517343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056532007,0.0017357549,0.0022954773,0.0011849417,0.0004691679,0.0017917337,0.0017796381,0.002103494,0.0022753323],"category_scores_gemma":[0.018084545,0.0013098189,0.0016503951,0.0012712738,0.001725285,0.0028781209,0.002143695,0.0018345201,0.00088776933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047202676,0.00012350212,0.001047444,0.00032563653,0.00030283065,0.000120062265,0.00011797114,0.8144875,0.0047008903,0.028433442,0.002636445,0.14723226],"study_design_scores_gemma":[0.000015246797,0.000032449138,0.00012231704,0.00001368488,0.00002283119,0.000019241106,0.000010907292,0.99193394,0.00073370873,0.006689809,0.00039306303,0.00001268708],"about_ca_topic_score_codex":0.004641987,"about_ca_topic_score_gemma":0.0045033814,"teacher_disagreement_score":0.0056532007,"about_ca_system_score_codex":0.0009311781,"about_ca_system_score_gemma":0.0016428087,"threshold_uncertainty_score":0.029897332},"labels":[],"label_agreement":null},{"id":"W3048518979","doi":"10.1109/tsp.2020.3016571","title":"Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matching pursuit; Upper and lower bounds; Combinatorics; Mathematics; Compressed sensing; Matrix (chemical analysis); Infinity; Matching (statistics); Exact solutions in general relativity; Random matrix; Algorithm; Discrete mathematics; Statistics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.03035995410803876,"score_gpt":0.24290234141169526,"score_spread":0.2125423873036565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048518979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06726864,0.0022997786,0.9163261,0.0012445173,0.000095527204,0.000079680365,0.0003212819,0.0003984759,0.011966026],"genre_scores_gemma":[0.94591117,0.0023113594,0.04609397,0.0003116906,0.00022644011,0.0001519834,0.00061617704,0.00023811973,0.004139126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953092,0.0015874662,0.00016353255,0.0006797222,0.0017549208,0.00050522824],"domain_scores_gemma":[0.97553885,0.017679555,0.0018843682,0.0015358658,0.0029847056,0.00037667295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073052673,0.0019310004,0.0014126336,0.0012974723,0.00059361703,0.0017309923,0.0014434782,0.0015992892,0.0025957797],"category_scores_gemma":[0.034637265,0.0006170474,0.0007895156,0.0013623812,0.0023999494,0.0024480915,0.0029224132,0.0022171796,0.0007766885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006791874,0.00010376465,0.0017451437,0.00030824365,0.000099700264,0.00027353186,0.00018059224,0.8944528,0.013662011,0.050549246,0.0016432662,0.036302336],"study_design_scores_gemma":[0.0000070228757,0.00009135597,0.0006457969,0.00001714236,0.000013925945,0.000066811524,0.000026787107,0.9901196,0.0024547032,0.0061964225,0.0003372146,0.000023190536],"about_ca_topic_score_codex":0.0023697533,"about_ca_topic_score_gemma":0.0010377859,"teacher_disagreement_score":0.0073052673,"about_ca_system_score_codex":0.0018488185,"about_ca_system_score_gemma":0.0021636032,"threshold_uncertainty_score":0.03863442},"labels":[],"label_agreement":null},{"id":"W3048806530","doi":"10.1109/taes.2020.3015322","title":"Efficient Sensing for Compressive Estimation of Frequency of a Real Sinusoid","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Compressed sensing; Estimator; Nyquist rate; Algorithm; Nyquist–Shannon sampling theorem; Signal reconstruction; Mathematics; SIGNAL (programming language); Computer science; Signal processing; Statistics; Sampling (signal processing); Telecommunications; Mathematical analysis","score_opus":0.013430985250400441,"score_gpt":0.22627905126637685,"score_spread":0.21284806601597642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048806530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008829878,0.00026855187,0.9893456,0.000116044284,0.000022899036,0.000013486281,0.000017809243,0.00008198035,0.0013037552],"genre_scores_gemma":[0.31163448,0.000872296,0.68444127,0.00013042318,0.00012482949,0.00007293638,0.00010897088,0.000053686654,0.0025611187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999608,0.000094459996,0.000015320127,0.000056947403,0.00021066656,0.000014633353],"domain_scores_gemma":[0.9994306,0.00032012654,0.00006852503,0.000096263895,0.00007168689,0.000012744085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500806,0.00032207827,0.0003140042,0.00038435875,0.00016613412,0.00030105832,0.0002849409,0.00043953882,0.0012906835],"category_scores_gemma":[0.0016918145,0.00018394444,0.00019870188,0.0003279352,0.0005387982,0.000807967,0.00055746065,0.0004926959,0.00041521722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031963355,0.00008941535,0.00067587645,0.0003535845,0.000037235597,0.00023092442,0.00025764797,0.14195322,0.2952588,0.1284391,0.002881918,0.42950267],"study_design_scores_gemma":[0.000028641485,0.00014788724,0.00068053824,0.00004279551,0.000012570618,0.0004039815,0.000032432094,0.915923,0.048363946,0.025568482,0.00876465,0.000031139887],"about_ca_topic_score_codex":0.00029341227,"about_ca_topic_score_gemma":0.00058570795,"teacher_disagreement_score":0.0012906835,"about_ca_system_score_codex":0.0002540956,"about_ca_system_score_gemma":0.0002787295,"threshold_uncertainty_score":0.0043177605},"labels":[],"label_agreement":null},{"id":"W3049647307","doi":"10.1287/moor.2022.1301","title":"Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Augmented Lagrangian method; Lagrange multiplier; Regular polygon; Mathematics; Lagrangian; Mathematical optimization; Applied mathematics; Geometry","score_opus":0.09276373530409061,"score_gpt":0.35479514559571934,"score_spread":0.26203141029162874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049647307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047646053,0.00011529526,0.99325645,0.0001241626,0.000027953629,0.00003019287,0.000012490052,0.0000898286,0.0015790163],"genre_scores_gemma":[0.21610367,0.00037323992,0.7791459,0.000141335,0.00010694165,0.00032111868,0.00013809047,0.0001837606,0.0034859166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910647,0.00034113706,0.00003482064,0.000096295196,0.00034654423,0.00007469955],"domain_scores_gemma":[0.99773407,0.0015949801,0.00013870075,0.00013155174,0.00028792958,0.000112722155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018581086,0.00080298295,0.0007971996,0.0004849129,0.000471563,0.0010165035,0.0010796043,0.0010750546,0.0025969085],"category_scores_gemma":[0.0044682613,0.00045892777,0.00072888104,0.00042828787,0.0010500601,0.0011735545,0.0016404986,0.0020387473,0.00052413956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018029526,0.00007044867,0.00075045484,0.00021984965,0.00004741451,0.00016578323,0.00012650019,0.89943486,0.0043933718,0.03887656,0.00224719,0.053487297],"study_design_scores_gemma":[0.0000050162425,0.00001649387,0.000034406676,0.0000036607544,0.0000020613138,0.0000140021975,0.0000052214873,0.99693775,0.00032572408,0.0022573234,0.00039556326,0.0000027160966],"about_ca_topic_score_codex":0.0021232036,"about_ca_topic_score_gemma":0.0028541323,"teacher_disagreement_score":0.0025969085,"about_ca_system_score_codex":0.0006298534,"about_ca_system_score_gemma":0.0019657558,"threshold_uncertainty_score":0.009826779},"labels":[],"label_agreement":null},{"id":"W3071135787","doi":"10.1016/j.jat.2020.105472","title":"Recovery guarantees for polynomial coefficients from weakly dependent data with outliers","year":2020,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Concentration inequality; Mixing (physics); Outlier; Ergodic theory; Applied mathematics; Markov chain; Sampling (signal processing); Matrix (chemical analysis); Polynomial; Function space; Algorithm; Mathematical optimization; Computer science; Discrete mathematics; Mathematical analysis; Statistics; Filter (signal processing)","score_opus":0.028637036487235968,"score_gpt":0.23587588778179272,"score_spread":0.20723885129455674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3071135787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02049555,0.00035752586,0.9766831,0.00066879904,0.000043308228,0.000023569324,0.00022650936,0.00017137706,0.00133035],"genre_scores_gemma":[0.7417641,0.001940838,0.24809243,0.00035779426,0.00048341625,0.00018151733,0.0014125473,0.00032849613,0.005438853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974485,0.00062239595,0.000118271455,0.00035201092,0.0011687187,0.0002899969],"domain_scores_gemma":[0.9709383,0.022926832,0.0014723059,0.0022562365,0.0018314196,0.0005748623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035118356,0.0018433331,0.0018457859,0.0011849394,0.0006613586,0.0017468594,0.0021849503,0.0021988342,0.0023207744],"category_scores_gemma":[0.03742428,0.0010270728,0.00077429117,0.0021016502,0.0025767598,0.0044179084,0.004903346,0.0050286786,0.000741732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011605498,0.00013992509,0.0014864334,0.00061489415,0.0001261033,0.0005994816,0.00045079723,0.6954557,0.01795704,0.17997737,0.008610495,0.093421265],"study_design_scores_gemma":[0.000026256614,0.00003900359,0.00013426083,0.000017579609,0.000008585357,0.00007314889,0.000041629166,0.9420782,0.0017157187,0.055390637,0.0004636029,0.000011416306],"about_ca_topic_score_codex":0.0031928942,"about_ca_topic_score_gemma":0.0025387516,"teacher_disagreement_score":0.0035118356,"about_ca_system_score_codex":0.001247388,"about_ca_system_score_gemma":0.0016895586,"threshold_uncertainty_score":0.018572569},"labels":[],"label_agreement":null},{"id":"W3078707548","doi":"10.1093/imaiai/iaaa014","title":"Sensitivity of ℓ1 minimization to parameter choice","year":2020,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Lasso (programming language); Minimax; Regularization (linguistics); Stability (learning theory); Minification; Computer science; Sensitivity (control systems); Value (mathematics); Mathematical optimization; Algorithm; Mathematics; Applied mathematics; Machine learning; Artificial intelligence","score_opus":0.020331169196309222,"score_gpt":0.24109894219256156,"score_spread":0.22076777299625233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3078707548","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5391818,0.0043680095,0.4177056,0.009535948,0.00037944765,0.00033832784,0.0010666879,0.0014509561,0.025973303],"genre_scores_gemma":[0.9711307,0.0005409975,0.025186868,0.00057902007,0.000058647678,0.00016203494,0.0003835374,0.00023386831,0.0017242813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566406,0.0025442997,0.00020879417,0.0006125012,0.00060898584,0.000361329],"domain_scores_gemma":[0.9127157,0.075465284,0.0038686485,0.0043352805,0.002589102,0.0010260748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013079885,0.0012832963,0.0013991465,0.0012208523,0.0009381446,0.002060899,0.0014416216,0.0026451817,0.0025613704],"category_scores_gemma":[0.09558738,0.00084062293,0.00077058794,0.00073121034,0.0029573205,0.002312789,0.00217451,0.0032507605,0.0005255345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007784507,0.00013795828,0.007030178,0.00033780368,0.00023874569,0.00028192592,0.00021009461,0.91470903,0.004176591,0.04607752,0.00548885,0.020532893],"study_design_scores_gemma":[0.000058338628,0.0001325057,0.0016671127,0.00016498119,0.000038889862,0.00014593611,0.00016068305,0.9508716,0.003472257,0.041745868,0.0014789292,0.00006293801],"about_ca_topic_score_codex":0.0033086922,"about_ca_topic_score_gemma":0.0017463472,"teacher_disagreement_score":0.013079885,"about_ca_system_score_codex":0.0014029244,"about_ca_system_score_gemma":0.0013127633,"threshold_uncertainty_score":0.06917387},"labels":[],"label_agreement":null},{"id":"W3081587413","doi":"10.5373/jardcs/v12i2/s20201296","title":"An efficient spectral conjugate gradient parameter with descent condition for unconstrained optimization","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Research in Dynamical and Control Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Conjugate gradient method; Gradient descent; Nonlinear conjugate gradient method; Descent (aeronautics); Gradient method; Mathematics; Applied mathematics; Conjugate; Conjugate residual method; Derivation of the conjugate gradient method; Mathematical optimization; Computer science; Artificial intelligence; Mathematical analysis; Physics; Artificial neural network","score_opus":0.02379082359923642,"score_gpt":0.2920422987984417,"score_spread":0.2682514751992053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081587413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002093715,0.00017101779,0.9934634,0.00021828331,0.00013823104,0.00006235026,0.00010601039,0.00024049137,0.00350657],"genre_scores_gemma":[0.16605638,0.0006745916,0.81645024,0.00053888914,0.0004781696,0.0007095109,0.00079904293,0.001215041,0.013078066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986003,0.0005837381,0.00006738899,0.00017830721,0.00048677353,0.00008356755],"domain_scores_gemma":[0.99617165,0.0025847729,0.00014195617,0.00031630017,0.00064945215,0.00013595249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002854985,0.0021596374,0.0019192529,0.0011872986,0.00072840473,0.0017350107,0.0020207325,0.0028714763,0.01398458],"category_scores_gemma":[0.013965924,0.00082763034,0.0008831675,0.0012849799,0.002146463,0.0041509005,0.0029002235,0.0042474396,0.004145596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005823049,0.00032221142,0.00048236997,0.00075661036,0.00009957095,0.0004300077,0.00023110858,0.3383409,0.01857942,0.44967082,0.029909851,0.16059478],"study_design_scores_gemma":[0.000021832084,0.00005870971,0.00006690136,0.00002694214,0.00000739418,0.0000497182,0.000012148755,0.9603802,0.0017037882,0.034871135,0.0027791,0.000022120845],"about_ca_topic_score_codex":0.001646563,"about_ca_topic_score_gemma":0.002815637,"teacher_disagreement_score":0.01398458,"about_ca_system_score_codex":0.00080532435,"about_ca_system_score_gemma":0.0023993258,"threshold_uncertainty_score":0.04678309},"labels":[],"label_agreement":null},{"id":"W3087686564","doi":"10.48550/arxiv.2009.08555","title":"Improved recovery guarantees and sampling strategies for TV minimization in compressive imaging","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Hadamard transform; Sampling (signal processing); Minification; Binary number; Fourier transform; Binary logarithm; Combinatorics; Mathematics; Image (mathematics); Algorithm; Class (philosophy); Discrete mathematics; Computer science; Mathematical optimization; Mathematical analysis; Computer vision; Artificial intelligence; Telecommunications; Arithmetic; Detector","score_opus":0.07179210884528027,"score_gpt":0.2036310473098688,"score_spread":0.13183893846458855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087686564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070783896,0.000391727,0.990444,0.00021205591,0.00001906924,0.000017261516,0.000032841155,0.00009254121,0.0017121455],"genre_scores_gemma":[0.48816842,0.0018129699,0.5048548,0.00045145952,0.00024300914,0.00020072484,0.00029791557,0.00034378114,0.0036269792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777466,0.0009105653,0.00010232202,0.00028401133,0.0007882593,0.00014026393],"domain_scores_gemma":[0.9935881,0.0047848914,0.00039479835,0.0006679288,0.00044077015,0.00012360507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025328153,0.0012015852,0.0008802804,0.00078132324,0.000381116,0.0011411504,0.0012047006,0.001223641,0.001956085],"category_scores_gemma":[0.016535465,0.0004852187,0.00058636005,0.00077633327,0.0018938376,0.0027232377,0.0025837375,0.00206418,0.00053451984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004191031,0.000094190655,0.00090037606,0.00038204214,0.00009120144,0.00023816433,0.00030305184,0.35383168,0.041785598,0.48052546,0.0027765664,0.118652515],"study_design_scores_gemma":[0.000027403064,0.000116905176,0.00016437058,0.000038921877,0.000014681043,0.00014494934,0.000040526458,0.9029445,0.011778485,0.08280827,0.0018978182,0.000023225119],"about_ca_topic_score_codex":0.00077723525,"about_ca_topic_score_gemma":0.0007040472,"teacher_disagreement_score":0.0025328153,"about_ca_system_score_codex":0.0006986537,"about_ca_system_score_gemma":0.00067440997,"threshold_uncertainty_score":0.013394952},"labels":[],"label_agreement":null},{"id":"W3088343230","doi":"10.1109/tip.2021.3060875","title":"Pareto-Optimal Bit Allocation for Collaborative Intelligence","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Image Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Cloud computing; Pareto principle; Artificial intelligence; Task (project management); Artificial neural network; Enhanced Data Rates for GSM Evolution; Machine learning; Mathematical optimization; Data mining; Mathematics; Engineering","score_opus":0.02317801316667361,"score_gpt":0.2701771222279114,"score_spread":0.2469991090612378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088343230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027568549,0.00051222136,0.9617292,0.00037944622,0.000050955896,0.000078540535,0.00011425804,0.00013142919,0.009435387],"genre_scores_gemma":[0.878031,0.0007063669,0.1104199,0.0003297227,0.00007421843,0.00022486679,0.00016998377,0.00013233503,0.009911677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983012,0.0005739738,0.000068096524,0.00027099912,0.00041931393,0.0003664653],"domain_scores_gemma":[0.9958555,0.0028772834,0.0002781343,0.0002665545,0.0005708377,0.00015165354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025446462,0.0014749167,0.001479842,0.0010097163,0.000948296,0.0023278445,0.0013907618,0.0012687076,0.0061361054],"category_scores_gemma":[0.009399154,0.0005942825,0.00069921085,0.0012124948,0.0017857247,0.0023254326,0.0019849695,0.0016494358,0.000883792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014708652,0.000068498004,0.00026982365,0.00010003233,0.000039169936,0.00009331564,0.00011351288,0.85316294,0.0018006585,0.114752,0.0020034695,0.02744947],"study_design_scores_gemma":[0.0000073114056,0.00002457138,0.00005654013,0.000011329086,0.0000051104917,0.000028852575,0.00002782643,0.9530305,0.0004371592,0.045783494,0.0005789972,0.000008375033],"about_ca_topic_score_codex":0.0025272088,"about_ca_topic_score_gemma":0.002302588,"teacher_disagreement_score":0.0061361054,"about_ca_system_score_codex":0.0027645759,"about_ca_system_score_gemma":0.0018456735,"threshold_uncertainty_score":0.020527363},"labels":[],"label_agreement":null},{"id":"W3088524644","doi":"10.1109/tnet.2020.3022757","title":"Network Latency Estimation With Leverage Sampling for Personal Devices: An Adaptive Tensor Completion Approach","year":2020,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Leverage (statistics); Latency (audio); Adaptive sampling; Estimator; Real-time computing; Artificial intelligence; Telecommunications; Statistics","score_opus":0.11341228068737016,"score_gpt":0.26079468070376877,"score_spread":0.1473824000163986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088524644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01624811,0.00029145126,0.9821957,0.00022601108,0.000037670994,0.000035230823,0.00007530941,0.0003480127,0.00054255675],"genre_scores_gemma":[0.66625774,0.0010183878,0.3290002,0.00022594449,0.00026701845,0.00014565983,0.0006475493,0.00012845098,0.0023090083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989685,0.00035203344,0.00005671143,0.00018256219,0.000303908,0.00013632093],"domain_scores_gemma":[0.99790597,0.00092140026,0.00027471094,0.0003330679,0.0004244877,0.0001404942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015060474,0.0014111552,0.0009676865,0.0006478266,0.00044566256,0.00073426985,0.0012011153,0.0007220326,0.001054253],"category_scores_gemma":[0.0058326097,0.0004376378,0.0006149597,0.000977837,0.00075614854,0.002092215,0.0014380867,0.00170823,0.0003148213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055589684,0.00017932961,0.0048600323,0.00024780596,0.00014987451,0.0003076623,0.00027744562,0.69048125,0.017390072,0.020588635,0.0048783002,0.2600838],"study_design_scores_gemma":[0.0000062234167,0.000030793595,0.00021272193,0.000005018639,0.000006478066,0.000030187193,0.00001643525,0.9956102,0.0010065541,0.002784536,0.00028309188,0.000007762545],"about_ca_topic_score_codex":0.0068506645,"about_ca_topic_score_gemma":0.007631719,"teacher_disagreement_score":0.0068506645,"about_ca_system_score_codex":0.00059480296,"about_ca_system_score_gemma":0.00127147,"threshold_uncertainty_score":0.013621569},"labels":[],"label_agreement":null},{"id":"W3088856854","doi":"","title":"Improving Convergence for Nonconvex Composite Programming","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Algorithm; Mathematical optimization; Computer science; Norm (philosophy); Set (abstract data type); Rate of convergence; Interpretation (philosophy); Mathematics; Key (lock)","score_opus":0.07243016738133704,"score_gpt":0.18727929389860803,"score_spread":0.114849126517271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088856854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005065581,0.00016045899,0.9924976,0.00023892206,0.00003945782,0.000037601174,0.000015148313,0.00014710131,0.0017980996],"genre_scores_gemma":[0.21991107,0.00048949564,0.7741551,0.00034789546,0.00017449545,0.0003889862,0.00013464816,0.0004215202,0.003976827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771523,0.0010472634,0.000089034285,0.00025312326,0.00074745435,0.00014786363],"domain_scores_gemma":[0.98705775,0.010361356,0.0005797313,0.00057900447,0.0011449113,0.00027730854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006028551,0.0018191983,0.0015336943,0.0013131277,0.00081163895,0.0013846891,0.0015431688,0.0018004777,0.0035489255],"category_scores_gemma":[0.025475124,0.000670066,0.0010155767,0.0011690124,0.0024065066,0.0020884632,0.002973333,0.004543286,0.00085545424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015245596,0.0001146822,0.0007182795,0.00022199798,0.00005682208,0.00007941486,0.00017483498,0.84767914,0.0029899315,0.090068154,0.002749449,0.05499486],"study_design_scores_gemma":[0.0000059603585,0.000032914548,0.00004654217,0.000009627961,0.0000024430021,0.000009750226,0.000008632762,0.98821056,0.00045651718,0.010770396,0.00044308667,0.0000035152805],"about_ca_topic_score_codex":0.0015925779,"about_ca_topic_score_gemma":0.0016204679,"teacher_disagreement_score":0.006028551,"about_ca_system_score_codex":0.0011024016,"about_ca_system_score_gemma":0.0014671617,"threshold_uncertainty_score":0.031882405},"labels":[],"label_agreement":null},{"id":"W3089190316","doi":"10.48550/arxiv.2009.11359","title":"A Unified Analysis of First-Order Methods for Smooth Games via Integral Quadratic Constraints","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rate of convergence; Upper and lower bounds; Acceleration; Quadratic equation; Applied mathematics; Convergence (economics); Mathematical optimization; Multiplicative function; Quadratic growth; Monotone polygon; Computer science; Algorithm; Mathematical analysis; Key (lock)","score_opus":0.09099843152611485,"score_gpt":0.24806373977073595,"score_spread":0.15706530824462112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089190316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014529928,0.00019524706,0.9953216,0.00016532568,0.00003411584,0.000032354306,0.000013559684,0.00003543645,0.002749422],"genre_scores_gemma":[0.40656936,0.0016849133,0.57038146,0.0005536485,0.0003511232,0.0006971933,0.0001607087,0.00037071714,0.019230839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813277,0.00061266136,0.000080372796,0.00021963115,0.0007834735,0.00017107518],"domain_scores_gemma":[0.9917583,0.005985869,0.0004283292,0.0003781937,0.0012124516,0.00023688075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004783494,0.001997457,0.0010950784,0.0011118567,0.0006564582,0.0018282196,0.0016313811,0.0017815442,0.0044576344],"category_scores_gemma":[0.01602674,0.0007113429,0.0012668106,0.00072182657,0.0028477532,0.002494584,0.0024927065,0.0054006954,0.00070173293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005364361,0.0000496905,0.00033798593,0.00028748906,0.00004189974,0.00006579012,0.00020711446,0.5965648,0.002847395,0.37315038,0.0014370767,0.024956673],"study_design_scores_gemma":[0.0000045875045,0.000023904675,0.000030239356,0.000016666108,0.0000051595825,0.000009512649,0.000007919727,0.97490215,0.00043415691,0.023805289,0.0007546272,0.0000058168853],"about_ca_topic_score_codex":0.003801752,"about_ca_topic_score_gemma":0.002953618,"teacher_disagreement_score":0.004783494,"about_ca_system_score_codex":0.0022018377,"about_ca_system_score_gemma":0.0027739424,"threshold_uncertainty_score":0.02529782},"labels":[],"label_agreement":null},{"id":"W3090206325","doi":"10.1190/segam2020-3425671.1","title":"Iterative deblending with robust Fourier thresholding","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fourier transform; Computer science; Algorithm; Robustness (evolution); Thresholding; Iterative method; White noise; Gaussian; Computer vision; Mathematics; Telecommunications; Image (mathematics); Physics","score_opus":0.032899372697334166,"score_gpt":0.19646937253419747,"score_spread":0.1635699998368633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090206325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035684293,0.00010824446,0.9943251,0.00011358579,0.000038835817,0.000029839392,0.000037615846,0.00023623627,0.0015421811],"genre_scores_gemma":[0.06721198,0.0002240141,0.92708784,0.00014370617,0.000068498746,0.00010618009,0.00024158949,0.0002544273,0.0046617184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881446,0.0002718979,0.00007382642,0.00027877375,0.00047879253,0.00008233167],"domain_scores_gemma":[0.99855405,0.0005698208,0.00013416358,0.00042357162,0.00026213273,0.000056260596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121233,0.001154594,0.0011063205,0.0009768142,0.00057939655,0.0017745788,0.0015490354,0.0017726809,0.0036732906],"category_scores_gemma":[0.006727188,0.0005426632,0.0011676602,0.0012183691,0.0015059264,0.0021636803,0.0027526086,0.0021275857,0.0014106466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040712088,0.00011266844,0.0011227845,0.00035938094,0.00014157337,0.00028611376,0.0006425372,0.3627536,0.06172648,0.14636122,0.008004775,0.4180817],"study_design_scores_gemma":[0.000019886951,0.00004239063,0.00021979882,0.000026357942,0.000011748036,0.0001451751,0.000044924367,0.94600964,0.018938651,0.028816966,0.005690097,0.00003428494],"about_ca_topic_score_codex":0.0018064153,"about_ca_topic_score_gemma":0.0025780739,"teacher_disagreement_score":0.0036732906,"about_ca_system_score_codex":0.0007618164,"about_ca_system_score_gemma":0.0011280162,"threshold_uncertainty_score":0.012288392},"labels":[],"label_agreement":null},{"id":"W3090751014","doi":"10.1190/segam2020-3422085.1","title":"Learning from migration and demigration: A practical approach for fast denoising","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"ConocoPhillips (Canada)","funders":"","keywords":"Computer science; Noise reduction; Image denoising; Artificial intelligence","score_opus":0.04369237876186773,"score_gpt":0.2520375410958134,"score_spread":0.20834516233394565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090751014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00246921,0.00006473996,0.9965444,0.00011427408,0.000022439648,0.00001892847,0.000024189343,0.000285851,0.00045595976],"genre_scores_gemma":[0.10971706,0.0003738825,0.8834386,0.00027496033,0.00015579055,0.00014547458,0.00045576543,0.00024615147,0.0051922337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946874,0.000109989676,0.00003326963,0.00012852732,0.00019948094,0.000060089562],"domain_scores_gemma":[0.99886763,0.00045182987,0.000103275815,0.00017126938,0.00034235997,0.000063726155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013568695,0.00092659495,0.00074293464,0.0007959006,0.0004759203,0.0008069486,0.0013705747,0.0013017892,0.0021961357],"category_scores_gemma":[0.0036850402,0.00045902882,0.00076715974,0.000915026,0.0009012377,0.0011432595,0.001813671,0.0020799125,0.0012950463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017272927,0.000097283824,0.0013589269,0.0001969989,0.000067956455,0.00017116769,0.0002852901,0.2728244,0.028269712,0.024728801,0.006134028,0.66569275],"study_design_scores_gemma":[0.000011789138,0.00006467296,0.00031705503,0.000017967786,0.000010871658,0.0000998268,0.000049689013,0.975936,0.006012414,0.0131383585,0.0043269843,0.000014320305],"about_ca_topic_score_codex":0.0028265575,"about_ca_topic_score_gemma":0.004429333,"teacher_disagreement_score":0.0028265575,"about_ca_system_score_codex":0.00044663562,"about_ca_system_score_gemma":0.0009889893,"threshold_uncertainty_score":0.007346809},"labels":[],"label_agreement":null},{"id":"W3090916151","doi":"10.1190/segam2020-3418412.1","title":"Separation of simultaneous sources via coherence pass robust Radon operators","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Radon transform; Coherence (philosophical gambling strategy); Computer science; Algorithm; Operator (biology); Iterative method; Source separation; Projection (relational algebra); Noise reduction; Convergence (economics); Mathematical optimization; Mathematics; Artificial intelligence; Statistics","score_opus":0.01902996498573754,"score_gpt":0.22610797004847558,"score_spread":0.20707800506273805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090916151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038565763,0.000041694104,0.99541855,0.000038930764,0.000009978454,0.000011942735,0.000010997956,0.00013642292,0.0004748178],"genre_scores_gemma":[0.12302212,0.00015337468,0.8742762,0.00007123286,0.000031951568,0.000067406865,0.00010076646,0.00011940162,0.0021574611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991762,0.00021603845,0.000047939073,0.00012097435,0.00037363282,0.00006524807],"domain_scores_gemma":[0.99898845,0.00048569517,0.00013030705,0.00014905067,0.00020641935,0.000040138213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013751443,0.00090723933,0.0007573947,0.00083260966,0.00030958847,0.0008830546,0.00093586533,0.000907318,0.0016990176],"category_scores_gemma":[0.003409905,0.000520888,0.0010650682,0.0007487676,0.00087674125,0.0018415283,0.002224919,0.0013704768,0.00059163873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030548035,0.00009809854,0.0009781286,0.0002787591,0.00018599168,0.00032785104,0.00044338364,0.47703212,0.1037039,0.09307457,0.0022732732,0.3212985],"study_design_scores_gemma":[0.00002290537,0.0001017225,0.0001784751,0.000015202273,0.000018518436,0.00016093954,0.000037534133,0.9594775,0.023663843,0.013007573,0.0032880157,0.00002785116],"about_ca_topic_score_codex":0.0008538658,"about_ca_topic_score_gemma":0.0013047627,"teacher_disagreement_score":0.0016990176,"about_ca_system_score_codex":0.0003348291,"about_ca_system_score_gemma":0.0010563909,"threshold_uncertainty_score":0.0072725415},"labels":[],"label_agreement":null},{"id":"W3091153891","doi":"10.1190/segam2020-3416118.1","title":"L<sub>p</sub>-space robust matching pursuit algorithm for time-domain Radon-based deblending","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Matching pursuit; Radon; Computer science; Algorithm; Domain (mathematical analysis); Mathematics; Physics; Mathematical analysis; Compressed sensing","score_opus":0.016067714142185944,"score_gpt":0.20970194856293667,"score_spread":0.19363423442075073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091153891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016177463,0.00009304782,0.9972994,0.00007187278,0.000017172766,0.000014676561,0.000022006361,0.00016773511,0.00069633324],"genre_scores_gemma":[0.056983665,0.0003063755,0.93799967,0.00014296662,0.000045873236,0.00011692633,0.00022607092,0.00012935595,0.00404906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995247,0.000110513465,0.000028928005,0.00007620809,0.00022526845,0.000034325574],"domain_scores_gemma":[0.99942005,0.00023352262,0.00006690031,0.00010008639,0.0001506041,0.000028867327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083107786,0.0006113677,0.000694466,0.0005039957,0.0002983937,0.0007200738,0.001047013,0.0009639922,0.0036297487],"category_scores_gemma":[0.002517059,0.00024022773,0.0005745093,0.00091598846,0.0006655187,0.0011243027,0.0013186478,0.0013951064,0.0021914002],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036666944,0.00009835607,0.0006943513,0.00023918733,0.000074123636,0.00019459243,0.00016845742,0.17509131,0.06564805,0.07523537,0.008749969,0.67343956],"study_design_scores_gemma":[0.000015458058,0.00006602483,0.00018163594,0.00001519236,0.000010079732,0.0001472624,0.00002183581,0.9687335,0.015456254,0.008458859,0.006873896,0.000020069088],"about_ca_topic_score_codex":0.0008888215,"about_ca_topic_score_gemma":0.0011788438,"teacher_disagreement_score":0.0036297487,"about_ca_system_score_codex":0.0004380533,"about_ca_system_score_gemma":0.0007672182,"threshold_uncertainty_score":0.012142718},"labels":[],"label_agreement":null},{"id":"W3091496164","doi":"10.1190/segam2020-3426928.1","title":"Data-driven time-lapse acquisition design via optimal receiver-source placement and reconstruction","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Data acquisition; Geology","score_opus":0.03325765059962949,"score_gpt":0.22598538007705118,"score_spread":0.1927277294774217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091496164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042919316,0.000035230856,0.99453753,0.000043549837,0.000011839105,0.000026588648,0.000039426817,0.00025262,0.00076116505],"genre_scores_gemma":[0.17288654,0.00018373616,0.8233657,0.00008556259,0.000032574007,0.00019938762,0.00039581102,0.00016485294,0.0026857073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961555,0.00006808527,0.000018373144,0.000092341455,0.0001662292,0.000039356917],"domain_scores_gemma":[0.9994073,0.00017075377,0.0000740203,0.00009475109,0.00021214991,0.00004108041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005858109,0.0008533937,0.00059687695,0.0004072558,0.00024139386,0.0008396995,0.00069571234,0.000674518,0.0036542346],"category_scores_gemma":[0.001777085,0.00040496394,0.00043636354,0.00042121115,0.00044848165,0.00072360627,0.0008577053,0.00079213636,0.0012201959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037679946,0.00014737551,0.002181575,0.00031063214,0.00006136458,0.00017558232,0.0002206675,0.6055189,0.11005251,0.016602935,0.0056176297,0.25873408],"study_design_scores_gemma":[0.000013454229,0.0000716487,0.0003646187,0.00001048428,0.000008368017,0.000054588294,0.000024783192,0.9800356,0.015115526,0.0014277359,0.0028570504,0.00001611886],"about_ca_topic_score_codex":0.0019517611,"about_ca_topic_score_gemma":0.002776785,"teacher_disagreement_score":0.0036542346,"about_ca_system_score_codex":0.0004746106,"about_ca_system_score_gemma":0.00114868,"threshold_uncertainty_score":0.012224674},"labels":[],"label_agreement":null},{"id":"W3091718832","doi":"10.48550/arxiv.2010.00848","title":"Nonsmoothness in Machine Learning: specific structure, proximal identification, and applications","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Curse; Leverage (statistics); Computer science; Artificial intelligence; Dimensionality reduction; Presentation (obstetrics); Machine learning; Simple (philosophy); Identification (biology); Blessing; Epistemology; Sociology; Philosophy","score_opus":0.04597765674072485,"score_gpt":0.17727960677129165,"score_spread":0.1313019500305668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091718832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009549677,0.009200618,0.9622567,0.0034832181,0.0002887947,0.000039748993,0.000077415105,0.00012228056,0.014981385],"genre_scores_gemma":[0.45279485,0.03630233,0.4791073,0.002135236,0.003418858,0.00027678572,0.00038504394,0.00029378626,0.025285767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999252,0.00029119028,0.00003565427,0.00013648726,0.00025376037,0.000030927964],"domain_scores_gemma":[0.99849296,0.0010149468,0.00010484622,0.00013077038,0.00018299217,0.00007344667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012770267,0.00087381847,0.00077792554,0.00080744934,0.00047473138,0.0010555363,0.0005658266,0.0020534436,0.0021180927],"category_scores_gemma":[0.0044564833,0.00042686414,0.00059074786,0.001224049,0.002740259,0.001964395,0.001783061,0.0036226937,0.00054992846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014941056,0.000032259326,0.0003177604,0.00031498433,0.000019278858,0.00016656806,0.00016401398,0.03338092,0.0029337122,0.9161923,0.005165981,0.041297328],"study_design_scores_gemma":[0.0000061161913,0.00004013417,0.00029476403,0.000058682042,0.000008470963,0.00019668484,0.000046226098,0.15532559,0.0006934408,0.8311373,0.012174381,0.000018234516],"about_ca_topic_score_codex":0.00063087326,"about_ca_topic_score_gemma":0.00083726185,"teacher_disagreement_score":0.0021180927,"about_ca_system_score_codex":0.0005293609,"about_ca_system_score_gemma":0.00056536216,"threshold_uncertainty_score":0.007085681},"labels":[],"label_agreement":null},{"id":"W3091835776","doi":"10.1109/tsp.2020.3029499","title":"Distributed Coding of Quantized Random Projections","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Mitsubishi Electric Research Laboratories","keywords":"Computer science; Decoding methods; Algorithm; Distributed source coding; Coding (social sciences); Source code; Signal processing; Rate–distortion theory; Computational complexity theory; Multispectral image; Artificial intelligence; Theoretical computer science; Pattern recognition (psychology); Mathematics; Variable-length code; Data compression; Statistics","score_opus":0.03532206475296501,"score_gpt":0.25004410482747047,"score_spread":0.21472204007450546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091835776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038734393,0.000110817244,0.9946583,0.00012346121,0.00003498518,0.00001571213,0.000035296376,0.00008335857,0.0010646651],"genre_scores_gemma":[0.51026565,0.0007597509,0.4812761,0.0003259287,0.00021230713,0.0002619981,0.0003022935,0.00009312893,0.006502849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.00036504326,0.000040179024,0.00018060065,0.00043701543,0.00007870634],"domain_scores_gemma":[0.9983323,0.0008874453,0.00014749031,0.00030577902,0.00027700074,0.000049925486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011575408,0.00061944744,0.00081214256,0.0005936012,0.00032918624,0.0009890816,0.0012202599,0.0008178529,0.0018985586],"category_scores_gemma":[0.0044339085,0.00034502518,0.00043711855,0.0007707832,0.0012746267,0.0018142357,0.0014861391,0.0015642473,0.000421791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015521143,0.00005175987,0.00032342057,0.00010859029,0.000036470137,0.00016068788,0.00013688978,0.53657866,0.011075422,0.37962517,0.0017590823,0.06998863],"study_design_scores_gemma":[0.000022152082,0.000040795196,0.000060781997,0.000012330996,0.0000064461124,0.00004991049,0.000014560049,0.9391299,0.0022365386,0.05680239,0.0016101104,0.000014143489],"about_ca_topic_score_codex":0.0008711369,"about_ca_topic_score_gemma":0.00097426755,"teacher_disagreement_score":0.0018985586,"about_ca_system_score_codex":0.0007767696,"about_ca_system_score_gemma":0.000838533,"threshold_uncertainty_score":0.006351292},"labels":[],"label_agreement":null},{"id":"W3092407891","doi":"10.1109/tmm.2020.3028479","title":"A New Multihypothesis-Based Compressed Video Sensing Reconstruction System","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Multimedia","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Residual; Pattern recognition (psychology); Preprocessor; Set (abstract data type); Decoding methods; Block (permutation group theory); Computer vision; Algorithm; Mathematics","score_opus":0.024228699760776157,"score_gpt":0.21012078754607738,"score_spread":0.18589208778530122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092407891","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019112827,0.0005692542,0.9747082,0.00041959566,0.00016114877,0.00013987676,0.00019310063,0.0014184021,0.0032775349],"genre_scores_gemma":[0.520241,0.00072611094,0.46748438,0.00089326414,0.00030316736,0.0002875347,0.0008292898,0.000087727516,0.009147491],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999258,0.00009677613,0.000048031314,0.00020509852,0.00033428342,0.000057890873],"domain_scores_gemma":[0.99953675,0.00009265252,0.00006296319,0.00008753386,0.00018002557,0.000040098363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046009073,0.00059437397,0.00073942816,0.0004895266,0.0004836524,0.0006337394,0.0011760892,0.0009390581,0.002555658],"category_scores_gemma":[0.0011130346,0.00028872312,0.00036185764,0.0005772347,0.00034884995,0.0014931358,0.0012978337,0.0009113997,0.001126185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009178288,0.00021606241,0.0014703036,0.000335438,0.00010359416,0.0007711816,0.0002596156,0.059888527,0.23093064,0.013989921,0.011278576,0.6798383],"study_design_scores_gemma":[0.000120487035,0.00048184616,0.0008508948,0.000026325963,0.000053175798,0.0010719463,0.000043247328,0.9456011,0.037872538,0.0028179323,0.0109950695,0.00006538079],"about_ca_topic_score_codex":0.0023576443,"about_ca_topic_score_gemma":0.0026435594,"teacher_disagreement_score":0.002555658,"about_ca_system_score_codex":0.00040037034,"about_ca_system_score_gemma":0.00081276346,"threshold_uncertainty_score":0.008549571},"labels":[],"label_agreement":null},{"id":"W3093546888","doi":"10.23952/jano.3.2021.1.08","title":"Extended Gauss-Newton and ADMM-Gauss-Newton algorithms for low-rank matrix optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research","keywords":"Gauss; Rank (graph theory); Matrix (chemical analysis); Algorithm; Mathematics; Newton's method; Applied mathematics; Combinatorics; Physics; Materials science; Nonlinear system","score_opus":0.009184008314072734,"score_gpt":0.24314860746898437,"score_spread":0.23396459915491163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093546888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013193176,0.00032464773,0.99720913,0.00010487091,0.00005007763,0.000017710896,0.000023445811,0.00012100384,0.0008297812],"genre_scores_gemma":[0.08682092,0.0010692371,0.9063255,0.0001988755,0.00020107935,0.00015917553,0.0002674417,0.00015033457,0.004807414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.00027998115,0.00004547176,0.00012172275,0.00027038463,0.000051888055],"domain_scores_gemma":[0.99899024,0.0004633733,0.00011857396,0.00011836302,0.00026349266,0.000045920395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013563496,0.0012963859,0.0011238154,0.0007282853,0.00044602697,0.0006887272,0.001254033,0.0014283498,0.0017730886],"category_scores_gemma":[0.0035694218,0.00050775806,0.00082000124,0.0010249644,0.0009892733,0.0011243273,0.001072833,0.00223818,0.0008560001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096588155,0.000077231845,0.0005586986,0.00033708304,0.00010557489,0.0001320298,0.00011651933,0.7481001,0.0041437214,0.061306123,0.0060578245,0.17896853],"study_design_scores_gemma":[0.000008614017,0.000021461778,0.00005910486,0.000010607545,0.000005702489,0.00004271462,0.0000056240424,0.9894079,0.0007599977,0.0068492945,0.002821657,0.0000073789784],"about_ca_topic_score_codex":0.0026846423,"about_ca_topic_score_gemma":0.0036401798,"teacher_disagreement_score":0.0026846423,"about_ca_system_score_codex":0.0006167752,"about_ca_system_score_gemma":0.00150358,"threshold_uncertainty_score":0.007173121},"labels":[],"label_agreement":null},{"id":"W3094014085","doi":"10.1109/tvlsi.2020.3030906","title":"FPGA Implementation of an Improved OMP for Compressive Sensing Reconstruction","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Field-programmable gate array; Matching pursuit; Orthogonalization; Computer science; SIGNAL (programming language); Gate array; Compressed sensing; Algorithm; High-level synthesis; Signal reconstruction; Matrix (chemical analysis); Parallel computing; Computer hardware; Signal processing; Digital signal processing","score_opus":0.02039039240674553,"score_gpt":0.26162678787714805,"score_spread":0.24123639547040251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094014085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056571037,0.000561528,0.92439926,0.00026629306,0.00022135372,0.0001266818,0.00018160303,0.005640038,0.012032293],"genre_scores_gemma":[0.43742496,0.00033319942,0.5536308,0.00029971564,0.00007848571,0.0001272226,0.0005154304,0.00013842345,0.0074517666],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997807,0.000032630935,0.0000151313825,0.000033453594,0.000104890576,0.000033215674],"domain_scores_gemma":[0.9998242,0.000033243174,0.000020348816,0.000035463116,0.00007676569,0.000010010773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021397955,0.00044228465,0.00023639193,0.0004397392,0.00016319325,0.00034912126,0.00069175474,0.00029313518,0.0039335326],"category_scores_gemma":[0.0004405743,0.00020057819,0.00022132795,0.00028118002,0.000113861934,0.00042477387,0.00025206315,0.00033560887,0.0011008269],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082444295,0.00017628443,0.0019200095,0.00045828425,0.00010336813,0.0006019427,0.00010468988,0.059392978,0.27318627,0.0109892655,0.0106322495,0.6416102],"study_design_scores_gemma":[0.0002734742,0.0015089599,0.0027112535,0.00006599325,0.000097670854,0.00128186,0.000049503367,0.70295775,0.24147344,0.0015278044,0.04798853,0.00006377909],"about_ca_topic_score_codex":0.000802862,"about_ca_topic_score_gemma":0.0011633266,"teacher_disagreement_score":0.0039335326,"about_ca_system_score_codex":0.00022887344,"about_ca_system_score_gemma":0.00042190077,"threshold_uncertainty_score":0.013158917},"labels":[],"label_agreement":null},{"id":"W3094065427","doi":"10.1109/tsp.2022.3178191","title":"Polar Deconvolution of Mixed Signals","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Deconvolution; Algorithm; Sublinear function; Mathematical optimization; Superposition principle; Mathematics; Probabilistic logic; Convex optimization; Convolution (computer science); Computational complexity theory; Noise (video); Computer science; Bounded function; Smoothing; Applied mathematics; Regular polygon; Artificial intelligence; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.018869888920824966,"score_gpt":0.23046536348162874,"score_spread":0.21159547456080377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094065427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010485589,0.00014313754,0.98796064,0.000086832966,0.000014481562,0.000013345546,0.000021133537,0.000069507594,0.0012054201],"genre_scores_gemma":[0.35794133,0.0009390511,0.63724625,0.00014703919,0.00006225437,0.00008290816,0.00017069634,0.00010468067,0.0033057623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995111,0.00016646787,0.000016123828,0.00008919897,0.00017362909,0.000043566648],"domain_scores_gemma":[0.99922025,0.0004603361,0.00007188619,0.000098459954,0.00012219371,0.00002687626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205701,0.0007286581,0.0006293671,0.0008158751,0.00030248478,0.00095269084,0.0005478384,0.000788504,0.0009998773],"category_scores_gemma":[0.0027086588,0.00040154325,0.0005864324,0.0006338693,0.0013273206,0.0015775949,0.0016630327,0.0009669463,0.00036409494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041521474,0.000063111554,0.0012920975,0.0002794994,0.000086485175,0.0002780308,0.0002820418,0.5467709,0.048369404,0.23807772,0.0013332795,0.16275226],"study_design_scores_gemma":[0.000009507808,0.000030894913,0.00017295267,0.000013647779,0.0000072825096,0.000093261915,0.00002762744,0.95591104,0.013383548,0.029040556,0.0012968556,0.000012792213],"about_ca_topic_score_codex":0.0006743187,"about_ca_topic_score_gemma":0.0004919204,"teacher_disagreement_score":0.001205701,"about_ca_system_score_codex":0.00043268385,"about_ca_system_score_gemma":0.00067537953,"threshold_uncertainty_score":0.0063763857},"labels":[],"label_agreement":null},{"id":"W3097005701","doi":"10.5802/ojmo.6","title":"Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses","year":2021,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Centre de Recherches Mathématiques; Simons Foundation","keywords":"Moore–Penrose pseudoinverse; Mathematics; Norm (philosophy); Rank (graph theory); Inverse; Generalized inverse; Computation; Low-rank approximation; Least-squares function approximation; Matrix norm; Applied mathematics; Mathematical optimization; Algorithm; Combinatorics; Pure mathematics; Eigenvalues and eigenvectors; Statistics","score_opus":0.10382142233305668,"score_gpt":0.31539656471465355,"score_spread":0.21157514238159686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097005701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036440727,0.00012231004,0.99492395,0.00024333605,0.000011511346,0.00001485943,0.000025498979,0.00007612117,0.00093836104],"genre_scores_gemma":[0.2796437,0.0006468277,0.71462,0.00037029784,0.00012683518,0.00023116927,0.00018800596,0.00026835338,0.0039048132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991912,0.00043634296,0.00003613636,0.00012638356,0.00015579608,0.000054102187],"domain_scores_gemma":[0.99769336,0.0016153931,0.0002337942,0.00022550597,0.0001510991,0.000080870275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019977458,0.0013792175,0.0013298508,0.0005211912,0.000363966,0.0015648514,0.0013828177,0.0015534497,0.0024969939],"category_scores_gemma":[0.0060665146,0.0007011156,0.0012037444,0.0005153885,0.001964324,0.0023429675,0.002259745,0.002081869,0.00067887135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007949165,0.000078107216,0.00053627405,0.00028990174,0.000074576215,0.00013498511,0.00018962116,0.6525718,0.0050291447,0.28973454,0.0022285453,0.049053017],"study_design_scores_gemma":[0.000006939159,0.00003574118,0.000049451784,0.000017985083,0.0000067084634,0.000022346132,0.000013150176,0.93528074,0.0007900214,0.06307993,0.00068451714,0.000012398734],"about_ca_topic_score_codex":0.0013879495,"about_ca_topic_score_gemma":0.0019381229,"teacher_disagreement_score":0.0024969939,"about_ca_system_score_codex":0.0007257855,"about_ca_system_score_gemma":0.0009677191,"threshold_uncertainty_score":0.010565162},"labels":[],"label_agreement":null},{"id":"W3097786761","doi":"10.1007/978-3-030-89906-6_54","title":"Nonsmooth Low-Rank Matrix Recovery: Methodology, Theory and Algorithm","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in networks and systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Alberta; Queen's University","funders":"","keywords":"Smoothing; Robustness (evolution); Algorithm; Computer science; Mathematical optimization; Rank (graph theory); Matrix (chemical analysis); Tensor (intrinsic definition); Mathematics; Applied mathematics; Combinatorics","score_opus":0.019520310237406413,"score_gpt":0.24861463882880827,"score_spread":0.22909432859140186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097786761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053646613,0.0017515022,0.9935284,0.00017080698,0.00012761561,0.000015677082,0.00006578153,0.00015710838,0.0036466687],"genre_scores_gemma":[0.0452093,0.009765637,0.9093236,0.00035719937,0.00071551115,0.00017783341,0.0006515232,0.00039688154,0.03340264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954224,0.00010306554,0.000021908727,0.0000915576,0.00022081645,0.000020419913],"domain_scores_gemma":[0.9992099,0.00044562793,0.000051624447,0.000107939086,0.00016615493,0.000018789355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340936,0.00092000235,0.00095079694,0.00074962573,0.0003069923,0.0014839796,0.0010142714,0.0009966993,0.0071015977],"category_scores_gemma":[0.0020511162,0.00046688635,0.00043756608,0.0019369997,0.0011109969,0.0013429826,0.0009929494,0.001911633,0.0045246542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000668313,0.000084313724,0.00022794426,0.0008712667,0.000053307915,0.00012482158,0.00012525445,0.079243384,0.012208567,0.23541108,0.04426025,0.6273229],"study_design_scores_gemma":[0.000012425376,0.00007613368,0.00038150063,0.00009242227,0.000028294417,0.0004350563,0.000060012553,0.71827894,0.00783082,0.21164039,0.061113007,0.000051015653],"about_ca_topic_score_codex":0.0008722218,"about_ca_topic_score_gemma":0.0015003027,"teacher_disagreement_score":0.0071015977,"about_ca_system_score_codex":0.00034455842,"about_ca_system_score_gemma":0.00070343824,"threshold_uncertainty_score":0.02375722},"labels":[],"label_agreement":null},{"id":"W3098572035","doi":"10.48550/arxiv.1110.0895","title":"Robust inversion via semistochastic dimensionality reduction","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dimensionality reduction; Curse of dimensionality; Computer science; Inversion (geology); Missing data; Inverse problem; Algorithm; Synthetic data; Mathematical optimization; Robust statistics; Inverse; Data mining; Mathematics; Artificial intelligence; Machine learning","score_opus":0.10482276597958357,"score_gpt":0.16772976110803223,"score_spread":0.06290699512844866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098572035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058807954,0.00008419742,0.99309736,0.00013487574,0.000013716515,0.000018127812,0.000052156913,0.00011087277,0.000607872],"genre_scores_gemma":[0.29324213,0.0006153719,0.70204914,0.00026402908,0.00012013352,0.000344717,0.00044176093,0.00012989716,0.0027928725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982357,0.0006391093,0.00007944159,0.00030650588,0.0006595911,0.00007955409],"domain_scores_gemma":[0.9974126,0.0012582426,0.00041896227,0.00058701687,0.0002653301,0.000057714573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026483901,0.0008478278,0.0010457111,0.0008377706,0.00039802198,0.0010686055,0.0010744439,0.001082626,0.0012029827],"category_scores_gemma":[0.0066856463,0.0005645665,0.0010262815,0.00092235155,0.0021783288,0.0015840032,0.0021098754,0.0013923077,0.0005191675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018376975,0.000081264596,0.00093051593,0.00025402755,0.00015393687,0.00015165005,0.00018732424,0.7061806,0.033383146,0.14754182,0.0016252756,0.109326676],"study_design_scores_gemma":[0.000011018374,0.00005557837,0.00019920015,0.000010676074,0.0000073607716,0.00006278484,0.000015853404,0.94381386,0.005507598,0.049210567,0.0010851637,0.00002041627],"about_ca_topic_score_codex":0.0008357693,"about_ca_topic_score_gemma":0.0007352785,"teacher_disagreement_score":0.0026483901,"about_ca_system_score_codex":0.0005127107,"about_ca_system_score_gemma":0.0011168901,"threshold_uncertainty_score":0.014006138},"labels":[],"label_agreement":null},{"id":"W3100158133","doi":"","title":"Gauge optimization and duality","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Duality (order theory); Generality; Gauge (firearms); Optimization problem; Mathematical optimization; Gauge symmetry; Strong duality; Algebra over a field; Gauge theory; Pure mathematics; Mathematical physics","score_opus":0.008149175049601253,"score_gpt":0.18821458693012677,"score_spread":0.18006541188052552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100158133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02333211,0.0016544858,0.90069515,0.003572812,0.00032613406,0.00004628649,0.00019298402,0.00010046848,0.0700796],"genre_scores_gemma":[0.80667853,0.0023907393,0.16874526,0.001760274,0.0010177982,0.00024648625,0.0003337547,0.00020978552,0.018617364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840504,0.0008415702,0.000051923565,0.00023312576,0.00035404862,0.00011435573],"domain_scores_gemma":[0.9987105,0.00061997975,0.00013608689,0.00019883862,0.00021394083,0.00012067351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029692026,0.00068149413,0.0010125345,0.0010363064,0.0009545553,0.0019737526,0.00066690025,0.0013024799,0.0046714526],"category_scores_gemma":[0.0051202616,0.00026836921,0.00080341497,0.0009817858,0.0046825227,0.0027462963,0.0023168856,0.002743786,0.0007179535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004910773,0.0000049463065,0.00004412313,0.00000981129,0.000004025754,0.000009756202,0.000014470281,0.003408203,0.00014333572,0.99264574,0.0007082724,0.003002497],"study_design_scores_gemma":[0.000004532309,0.000009160407,0.00005143173,0.000009829013,0.0000015405853,0.000020944239,0.000010338084,0.021502338,0.00014285897,0.97573304,0.0025105309,0.000003425734],"about_ca_topic_score_codex":0.0007562757,"about_ca_topic_score_gemma":0.0005013661,"teacher_disagreement_score":0.0046714526,"about_ca_system_score_codex":0.0013701564,"about_ca_system_score_gemma":0.00088307075,"threshold_uncertainty_score":0.015702844},"labels":[],"label_agreement":null},{"id":"W3100735547","doi":"10.1137/20m1339829","title":"Maximum Likelihood Estimation of Regularization Parameters in High-Dimensional Inverse Problems: An Empirical Bayesian Approach Part I: Methodology and Experiments","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Imaging Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua","funders":"Engineering and Physical Sciences Research Council","keywords":"Inverse problem; Regularization (linguistics); Mathematics; Deconvolution; Mathematical optimization; Total variation denoising; Prior probability; Algorithm; Optimization problem; A priori and a posteriori; Convex optimization; Bayesian probability; Applied mathematics; Regular polygon; Computer science; Image (mathematics); Statistics; Artificial intelligence","score_opus":0.07947645664241311,"score_gpt":0.31593221342694344,"score_spread":0.23645575678453035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100735547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031327095,0.0008391832,0.9649997,0.00038346444,0.000023997267,0.00026686906,0.00008344766,0.0003287248,0.0017475941],"genre_scores_gemma":[0.24062774,0.0012142386,0.755264,0.00020769668,0.00003996532,0.0010229186,0.00025167945,0.00019030856,0.0011816331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939837,0.0038437834,0.00021801556,0.0004904382,0.0013333551,0.00013073493],"domain_scores_gemma":[0.98470217,0.010890753,0.00069689023,0.0019600934,0.0015544118,0.00019567194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011623283,0.0011909469,0.0012978795,0.0009729067,0.0008416457,0.0013588573,0.0013444243,0.0029819156,0.0020266427],"category_scores_gemma":[0.029949995,0.0007850388,0.0007413575,0.0010724161,0.0020185537,0.002449021,0.0018717179,0.0021923482,0.00060210354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095358794,0.0011632622,0.0058737732,0.0012176969,0.00029564818,0.00023546974,0.00055312784,0.6299723,0.045326058,0.05684314,0.0026312163,0.25493482],"study_design_scores_gemma":[0.00012667284,0.00044719444,0.002483941,0.000121861194,0.000047877526,0.00018926647,0.0000999135,0.9496827,0.023741024,0.019332526,0.0036168299,0.00011018527],"about_ca_topic_score_codex":0.0029822392,"about_ca_topic_score_gemma":0.0017241094,"teacher_disagreement_score":0.011623283,"about_ca_system_score_codex":0.0010446954,"about_ca_system_score_gemma":0.0010292302,"threshold_uncertainty_score":0.06147051},"labels":[],"label_agreement":null},{"id":"W3111605110","doi":"10.1609/aaai.v35i8.16859","title":"Provable Benefits of Overparameterization in Model Compression: From Double Descent to Pruning Neural Networks","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Pruning; Computer science; Artificial neural network; Feature (linguistics); Deep neural networks; Parameterized complexity; Artificial intelligence; Machine learning; Algorithm","score_opus":0.0892116449821859,"score_gpt":0.275641139043692,"score_spread":0.18642949406150608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111605110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080197185,0.00097115996,0.9116947,0.0025149153,0.00006408146,0.000061259896,0.00012231345,0.0006129516,0.0037614722],"genre_scores_gemma":[0.85557866,0.0010971621,0.13904029,0.0012714881,0.00023512225,0.00025488154,0.0003315711,0.00041440892,0.001776397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622524,0.0019081562,0.00018196643,0.0005469191,0.0008565606,0.0002811602],"domain_scores_gemma":[0.9528137,0.03710758,0.0022112522,0.0057853847,0.0014077575,0.00067432603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007926587,0.0016617981,0.0016947364,0.0010273835,0.0009935806,0.0018727311,0.0022211792,0.002366393,0.0017877563],"category_scores_gemma":[0.08696115,0.0011155832,0.0009989643,0.00083678495,0.004456955,0.0051720818,0.005704106,0.0057996996,0.00039678637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045927253,0.0002415634,0.007393306,0.00035412732,0.00017848845,0.0007538245,0.00063937646,0.67253816,0.008248529,0.23395352,0.005432114,0.069807805],"study_design_scores_gemma":[0.00002683787,0.00009179308,0.000533875,0.00006748719,0.00001802392,0.00015337346,0.00005082661,0.8755259,0.001567796,0.12119982,0.0007447865,0.00001959813],"about_ca_topic_score_codex":0.0015590043,"about_ca_topic_score_gemma":0.0017317646,"teacher_disagreement_score":0.007926587,"about_ca_system_score_codex":0.001392079,"about_ca_system_score_gemma":0.0012639216,"threshold_uncertainty_score":0.041920304},"labels":[],"label_agreement":null},{"id":"W3111656085","doi":"10.18280/ts.370504","title":"Design and Application of a Greedy Pursuit Algorithm Adapted to Overcomplete Dictionary for Sparse Signal Recovery","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Restricted isometry property; Compressed sensing; Matching pursuit; Orthonormal basis; SIGNAL (programming language); Greedy algorithm; Algorithm; Computer science; Signal reconstruction; Signal recovery; Matrix (chemical analysis); K-SVD; Subspace topology; Sparse approximation; Signal subspace; Signal processing; Pattern recognition (psychology); Artificial intelligence; Noise (video); Image (mathematics); Radar","score_opus":0.03293642103163985,"score_gpt":0.22670344267266496,"score_spread":0.1937670216410251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111656085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002184827,0.000058635793,0.99710053,0.00004517927,0.000016867325,0.00003637874,0.0000074292466,0.00008432642,0.00046571626],"genre_scores_gemma":[0.1786102,0.00035183894,0.81902796,0.00010406759,0.00005093395,0.00038205856,0.00007866462,0.00003881445,0.0013554192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939275,0.00015204772,0.000034613295,0.0001310726,0.00024247482,0.00004697282],"domain_scores_gemma":[0.9995172,0.0001413055,0.000065577435,0.00006463912,0.00017027085,0.00004100664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074299274,0.0008125075,0.00080057513,0.0006134906,0.00038183972,0.00055042584,0.0010822512,0.0011522131,0.0013069566],"category_scores_gemma":[0.0017148578,0.0003265958,0.0006036337,0.00089040364,0.0005863358,0.00071151037,0.0012238263,0.0010072739,0.0007160119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031036517,0.00016864866,0.0011317829,0.00031507615,0.000110709385,0.00033631013,0.00018411831,0.43742245,0.08770092,0.04088141,0.0031921333,0.428246],"study_design_scores_gemma":[0.000017784056,0.0001528994,0.00009955599,0.0000068707654,0.0000100397165,0.0001291651,0.000012441941,0.9915767,0.0042866264,0.0021848632,0.001510729,0.000012302067],"about_ca_topic_score_codex":0.0007590106,"about_ca_topic_score_gemma":0.00081364135,"teacher_disagreement_score":0.0013069566,"about_ca_system_score_codex":0.00029522553,"about_ca_system_score_gemma":0.0012237821,"threshold_uncertainty_score":0.0043721795},"labels":[],"label_agreement":null},{"id":"W3112516868","doi":"10.48550/arxiv.2012.05782","title":"A Study of Condition Numbers for First-Order Optimization","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Convexity; Smoothness; Mathematical optimization; Norm (philosophy); Perturbation (astronomy); Gradient descent; Hyperparameter; Mathematics; Convergence (economics); Computer science; Applied mathematics; Optimization problem; Uniform norm; Algorithm; Artificial intelligence; Discrete mathematics; Mathematical analysis; Artificial neural network","score_opus":0.08323042211128721,"score_gpt":0.20112184761392626,"score_spread":0.11789142550263905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112516868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017916767,0.0031065203,0.9362804,0.0033491983,0.0004049526,0.0000834291,0.00018340569,0.00026737797,0.038408022],"genre_scores_gemma":[0.6634173,0.0062969173,0.30671903,0.0015796192,0.001135459,0.0007191514,0.00045978092,0.00087816064,0.01879464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965184,0.0013840226,0.0001566942,0.00052535813,0.0011453987,0.00027009466],"domain_scores_gemma":[0.961371,0.031718217,0.0018797657,0.0016238667,0.0025167444,0.0008904256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008348374,0.0018865202,0.0012383007,0.0018893022,0.0012246083,0.0036197503,0.0016229748,0.0026109458,0.0077205566],"category_scores_gemma":[0.056023065,0.000570945,0.0011630956,0.0014449009,0.00592945,0.006147751,0.0022641143,0.006540303,0.0012085906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038967202,0.000023954237,0.00027375034,0.00017259094,0.00001611383,0.000049249247,0.000092360926,0.048931908,0.0015951074,0.93816227,0.0020727315,0.008571118],"study_design_scores_gemma":[0.000012699805,0.00007619811,0.00023450935,0.00010917394,0.000010355181,0.00006470483,0.000035943904,0.49237055,0.0014499533,0.50116366,0.004441882,0.000030355244],"about_ca_topic_score_codex":0.0018067686,"about_ca_topic_score_gemma":0.0009246044,"teacher_disagreement_score":0.008348374,"about_ca_system_score_codex":0.0028015238,"about_ca_system_score_gemma":0.0022898908,"threshold_uncertainty_score":0.04415095},"labels":[],"label_agreement":null},{"id":"W3113771923","doi":"10.1109/tit.2021.3124598","title":"NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Logarithm; Compressed sensing; Rate of convergence; Algorithm; Inverse; Approximation error; Square root; Mathematics; Convergence (economics); Thresholding; Word error rate; Binary number; Mean squared error; Computer science; Key (lock); Arithmetic; Statistics; Mathematical analysis; Artificial intelligence; Image (mathematics)","score_opus":0.01472685111849848,"score_gpt":0.23878166739774134,"score_spread":0.22405481627924287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113771923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002912538,0.00043749865,0.9926751,0.0003667371,0.00012841831,0.000109432454,0.00020249118,0.0011328311,0.0020349487],"genre_scores_gemma":[0.091585524,0.0007306637,0.9002077,0.0005883199,0.00019044311,0.00048203874,0.0009822493,0.00043752944,0.004795533],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984321,0.0002838588,0.000105917046,0.00023505134,0.00082499254,0.000118150776],"domain_scores_gemma":[0.99801105,0.0010088809,0.00016644565,0.00037061158,0.00033160314,0.00011148001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015216004,0.0014423851,0.0011982768,0.00086902623,0.00063518883,0.0015558173,0.0019197325,0.0017142759,0.006223427],"category_scores_gemma":[0.010248651,0.0004887016,0.0006337249,0.0013377195,0.0013191723,0.0024083056,0.0031167294,0.0028837372,0.003276173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00097370544,0.00019573909,0.0010763638,0.00085841893,0.00010416952,0.00039884858,0.00053801516,0.13466214,0.045607794,0.14169343,0.026323901,0.6475675],"study_design_scores_gemma":[0.000076963006,0.0001077842,0.0001915051,0.00007853299,0.000017142904,0.00043923748,0.000054939384,0.9355137,0.0158415,0.04030301,0.0073279766,0.000047763675],"about_ca_topic_score_codex":0.002421371,"about_ca_topic_score_gemma":0.0034921765,"teacher_disagreement_score":0.006223427,"about_ca_system_score_codex":0.0008287817,"about_ca_system_score_gemma":0.002448485,"threshold_uncertainty_score":0.020819485},"labels":[],"label_agreement":null},{"id":"W3114071090","doi":"10.1109/tsp.2021.3105921","title":"Unambiguous Delay-Doppler Recovery From Random Phase Coded Pulses","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; Horizon 2020 Framework Programme; National Natural Science Foundation of China; Air Force Office of Scientific Research; European Commission","keywords":"Nyquist–Shannon sampling theorem; Doppler effect; Algorithm; Pulse repetition frequency; Computer science; Signal-to-noise ratio (imaging); Mathematics; Upper and lower bounds; Radar; Telecommunications; Physics","score_opus":0.022321892313621163,"score_gpt":0.2554448069034277,"score_spread":0.23312291458980652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114071090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04032901,0.00032106898,0.9571279,0.00013504489,0.000034503224,0.000035067435,0.00007784199,0.00017410133,0.0017654805],"genre_scores_gemma":[0.56018823,0.00052283716,0.43611756,0.00010874443,0.000042074676,0.0000678226,0.0001979123,0.000037085716,0.0027176975],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995141,0.000091003305,0.00002417735,0.00005077633,0.0002784993,0.000041489013],"domain_scores_gemma":[0.9990532,0.00051444967,0.00016050969,0.00013762299,0.00010317164,0.000031123673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354173,0.00045416263,0.00047139183,0.0004340705,0.00016827768,0.00040305313,0.00040178007,0.0006663091,0.0010997038],"category_scores_gemma":[0.0035930648,0.00017611463,0.0002139763,0.00063745846,0.00042296445,0.0009196444,0.00088512356,0.00058230443,0.00033901533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000911824,0.00012269277,0.0011420209,0.0004783016,0.000049196533,0.00043911836,0.00018525598,0.35691223,0.1354945,0.063436605,0.0017654294,0.43906292],"study_design_scores_gemma":[0.000059842612,0.0001783928,0.00051572575,0.00003712945,0.00001234504,0.00045040183,0.000037406,0.91459763,0.06470334,0.017043417,0.0023276783,0.00003665173],"about_ca_topic_score_codex":0.0005680085,"about_ca_topic_score_gemma":0.0006537947,"teacher_disagreement_score":0.0010997038,"about_ca_system_score_codex":0.00021464303,"about_ca_system_score_gemma":0.0006410827,"threshold_uncertainty_score":0.0036788583},"labels":[],"label_agreement":null},{"id":"W3114087131","doi":"10.1109/tim.2020.3047503","title":"Structure-Aware Compressive Sensing for Magnetic Flux Leakage Detectors: Theory and Experimental Validation","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Compressed sensing; Magnetic flux leakage; Detector; Euclidean distance; Gaussian; Leakage (economics); Magnetic flux; Minification; Euclidean geometry; Algorithm; Magnetic field; Computer science; Electronic engineering; Physics; Artificial intelligence; Mathematics; Engineering; Mathematical optimization; Optics; Geometry","score_opus":0.03371289853966196,"score_gpt":0.24286220177993126,"score_spread":0.2091493032402693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114087131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039082248,0.00024523688,0.95816064,0.0004250893,0.000030284029,0.00006477886,0.000039310675,0.00021540218,0.001737064],"genre_scores_gemma":[0.505814,0.00066985405,0.49212205,0.0001688291,0.00005538663,0.00016103948,0.00013414837,0.00003850202,0.0008361621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930644,0.00021843013,0.000024564133,0.00007615484,0.00034211573,0.000032245247],"domain_scores_gemma":[0.99814093,0.0011708067,0.00018410952,0.00019802222,0.00025936682,0.000046777717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013898814,0.0004994255,0.00037264658,0.00031700186,0.00026689743,0.00047973378,0.00058507326,0.000843758,0.00058346783],"category_scores_gemma":[0.004063818,0.00019754276,0.00021614986,0.0003541852,0.001119824,0.0010468015,0.0007778143,0.0008333089,0.00014808564],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045319242,0.00038888791,0.0028525945,0.00075761124,0.00008319367,0.00024242367,0.00041693106,0.40354952,0.30790406,0.04701292,0.0021608975,0.23417766],"study_design_scores_gemma":[0.000024809066,0.00025652687,0.0005965557,0.000026273483,0.000011088879,0.00012541396,0.000054336448,0.8965952,0.09642094,0.003987874,0.0018764685,0.00002463918],"about_ca_topic_score_codex":0.000501353,"about_ca_topic_score_gemma":0.0005322752,"teacher_disagreement_score":0.0013898814,"about_ca_system_score_codex":0.00038783497,"about_ca_system_score_gemma":0.0005295047,"threshold_uncertainty_score":0.007350445},"labels":[],"label_agreement":null},{"id":"W3114746700","doi":"10.1109/ciima50553.2020.9290294","title":"Performance Benchmarking of Stochastic and Deterministic Representation Bases with Compressive Sensing in Computerized Tomography Images","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Compressed sensing; Iterative reconstruction; Computer science; Tomography; Image quality; Artificial intelligence; Block (permutation group theory); Noise (video); Representation (politics); Coded aperture; Computer vision; Algorithm; Image (mathematics); Mathematics; Optics; Physics","score_opus":0.015415558997452412,"score_gpt":0.21084877494678575,"score_spread":0.19543321594933333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114746700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7814034,0.002959837,0.20323896,0.000665214,0.00021200471,0.00013866927,0.0006215244,0.0017094326,0.009050875],"genre_scores_gemma":[0.93543607,0.00071388966,0.061375666,0.000077401986,0.000031730804,0.000056388155,0.00093131495,0.000043423057,0.0013340064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.00022845405,0.000072544644,0.00011964196,0.00034162746,0.000110060515],"domain_scores_gemma":[0.9986039,0.00066493853,0.00011337903,0.00015526959,0.00038052612,0.00008197573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975347,0.0005876808,0.00059532933,0.0007767821,0.00028411785,0.0008968663,0.00053636613,0.00084416405,0.0013104179],"category_scores_gemma":[0.0046743667,0.00014667178,0.00047543264,0.0007165058,0.00041101212,0.0006173336,0.000730091,0.0005248314,0.00034414083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029042226,0.00042570167,0.0061345054,0.0006711493,0.00018037847,0.00026804948,0.00018613091,0.6389258,0.031519312,0.0038935412,0.0027239802,0.31216723],"study_design_scores_gemma":[0.00003788067,0.0008073972,0.0025921126,0.000040813058,0.000038453578,0.0001593013,0.00009824719,0.9765712,0.017809978,0.0008139861,0.0010028208,0.000027801021],"about_ca_topic_score_codex":0.0047869845,"about_ca_topic_score_gemma":0.0028467905,"teacher_disagreement_score":0.0047869845,"about_ca_system_score_codex":0.00040465908,"about_ca_system_score_gemma":0.0006464407,"threshold_uncertainty_score":0.009518266},"labels":[],"label_agreement":null},{"id":"W3115197588","doi":"10.5539/ijsp.v10n1p69","title":"Consistency of Penalized Convex Regression","year":2020,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Subgradient method; Estimator; Convex function; Consistency (knowledge bases); Regular polygon; Convex analysis; Convex optimization; Proper convex function; Applied mathematics; Mathematical optimization; Statistics; Discrete mathematics","score_opus":0.027538739055476633,"score_gpt":0.2705817329783977,"score_spread":0.24304299392292109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115197588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009147228,0.00035573935,0.9875503,0.0008378017,0.00006607235,0.00004975901,0.00014982893,0.0001939855,0.0016491779],"genre_scores_gemma":[0.66241837,0.0014782593,0.32152048,0.0011784318,0.00062621146,0.0006571865,0.0019464088,0.00068751146,0.009487097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98978287,0.0058590695,0.00040425017,0.0019830365,0.0014934737,0.00047731437],"domain_scores_gemma":[0.93016857,0.053727325,0.004044502,0.004530638,0.0066676615,0.00086129823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016028997,0.001519423,0.0026530595,0.0016610206,0.0008491219,0.003051909,0.0038231066,0.0029264856,0.0030955577],"category_scores_gemma":[0.0926048,0.0013796582,0.0013410833,0.0013271916,0.004631663,0.004458654,0.0041396157,0.0044891667,0.00096157874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005238456,0.00008388351,0.0044448837,0.00038037304,0.0002719529,0.00030596234,0.00019387409,0.73244655,0.0020721639,0.2196362,0.0056797843,0.033960495],"study_design_scores_gemma":[0.000027171294,0.00004733663,0.00029609952,0.000030430609,0.000010469525,0.000053677704,0.000012446547,0.9575505,0.00067453244,0.04048051,0.00080079795,0.000016023103],"about_ca_topic_score_codex":0.003332178,"about_ca_topic_score_gemma":0.0014552479,"teacher_disagreement_score":0.016028997,"about_ca_system_score_codex":0.0019922594,"about_ca_system_score_gemma":0.002560989,"threshold_uncertainty_score":0.08477044},"labels":[],"label_agreement":null},{"id":"W3117873759","doi":"10.1002/cjs.11579","title":"Automatic sparse principal component analysis","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Principal component analysis; Dimensionality reduction; Sparse PCA; Singular value decomposition; Computer science; Sparse approximation; Pattern recognition (psychology); Artificial intelligence; Robust principal component analysis; Projection (relational algebra); Sparse matrix; Dimension (graph theory); Feature selection; Regularization (linguistics); Curse of dimensionality; Algorithm; Mathematics","score_opus":0.027615337202723005,"score_gpt":0.21391159678679209,"score_spread":0.1862962595840691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117873759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041557634,0.00015306004,0.9931497,0.000114927745,0.00005063058,0.000057940506,0.00020569412,0.0009837963,0.001128509],"genre_scores_gemma":[0.13249463,0.0006207329,0.85963744,0.0001773144,0.00017230737,0.00036891302,0.0022849266,0.00042675794,0.0038169846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808013,0.00047780533,0.000094228046,0.0004078639,0.000765438,0.0001746144],"domain_scores_gemma":[0.99757344,0.00075762183,0.00020006824,0.0004560292,0.00094506267,0.00006785804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012998718,0.0017686463,0.001298953,0.0024138822,0.0008589473,0.0013141781,0.0010757148,0.0011020524,0.004151618],"category_scores_gemma":[0.0063948254,0.00061214814,0.0014482002,0.0026464954,0.0008603635,0.0016276388,0.0016056318,0.0018934195,0.002782085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002698225,0.00016146892,0.0017414321,0.00036541218,0.00013315186,0.00018735045,0.00021002235,0.13364078,0.042894777,0.02775767,0.020257799,0.77238023],"study_design_scores_gemma":[0.00002285432,0.000059633297,0.0012252296,0.000024271567,0.000025126092,0.00013308546,0.000046171663,0.9610677,0.01215398,0.01608612,0.009110071,0.000045711015],"about_ca_topic_score_codex":0.0033662494,"about_ca_topic_score_gemma":0.0035373112,"teacher_disagreement_score":0.004151618,"about_ca_system_score_codex":0.000442987,"about_ca_system_score_gemma":0.0021549526,"threshold_uncertainty_score":0.013888538},"labels":[],"label_agreement":null},{"id":"W3118068920","doi":"10.48550/arxiv.2005.04798","title":"Fast implementation of partial least squares for function-on-function regression","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Partial least squares regression; Estimator; Applied mathematics; Linear subspace; Function (biology); Mathematics; Least-squares function approximation; Mathematical optimization; Regression; Algorithm; Generalized least squares; Computer science; Statistics","score_opus":0.0815471360866984,"score_gpt":0.2168254715066655,"score_spread":0.1352783354199671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118068920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008370606,0.000055482993,0.9971723,0.000056116347,0.000026077692,0.000014737451,0.00003728243,0.0007802363,0.0010206971],"genre_scores_gemma":[0.06608579,0.00020398447,0.9298052,0.000089787114,0.00006150385,0.00016695744,0.0003495967,0.0004281443,0.0028090284],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920577,0.0002657828,0.000039636147,0.00011192525,0.00031249615,0.00006447923],"domain_scores_gemma":[0.9989594,0.00042664167,0.000053950174,0.0002952947,0.00022585028,0.000038758037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011582534,0.0010259158,0.00066694256,0.00069320993,0.00042757174,0.0010125027,0.0014491935,0.0012214402,0.01118546],"category_scores_gemma":[0.0056085577,0.00032069426,0.0006139954,0.00087899336,0.00058977853,0.0012636959,0.0015477579,0.0020452295,0.0060229423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020607476,0.00012425723,0.0008429499,0.00029910417,0.0000972954,0.00023423764,0.0002448333,0.20509057,0.023874568,0.22580704,0.01394376,0.5292353],"study_design_scores_gemma":[0.00002014142,0.000049352675,0.00014455621,0.00002141005,0.000008147313,0.00011765997,0.000028328537,0.9405271,0.0069230637,0.041623946,0.010518043,0.000018323468],"about_ca_topic_score_codex":0.0019277968,"about_ca_topic_score_gemma":0.0026587294,"teacher_disagreement_score":0.01118546,"about_ca_system_score_codex":0.00040710656,"about_ca_system_score_gemma":0.0011854136,"threshold_uncertainty_score":0.03741914},"labels":[],"label_agreement":null},{"id":"W3119952878","doi":"10.18280/ts.370605","title":"Projected Wirtinger Gradient Descent for Digital Waves Reconstruction","year":2020,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; SIGNAL (programming language); Thresholding; Matrix (chemical analysis); Convergence (economics); Gradient descent; Mathematics; Frequency domain; Stochastic gradient descent; Fist; Low-rank approximation; Domain (mathematical analysis); Compressed sensing; Computer science; Hankel matrix; Artificial intelligence; Computer vision; Mathematical analysis; Artificial neural network","score_opus":0.027432971085536086,"score_gpt":0.20641290533672088,"score_spread":0.1789799342511848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119952878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005170573,0.00045380872,0.9916374,0.00023181488,0.000052251624,0.000024488021,0.00004577627,0.00020813468,0.0021757209],"genre_scores_gemma":[0.33918047,0.0017019934,0.6358482,0.0003672989,0.00016113267,0.00035723983,0.0005681062,0.00024204026,0.02157357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997124,0.00009793808,0.000011320182,0.000056561308,0.00009242926,0.000029306144],"domain_scores_gemma":[0.9996,0.00022192154,0.000030364494,0.00003950522,0.000082689265,0.000025524907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064264383,0.0009188881,0.0008808655,0.000416559,0.00024189564,0.0006574863,0.000649045,0.00093706907,0.0019714085],"category_scores_gemma":[0.002039216,0.00043496065,0.00043408127,0.00065392395,0.0007858973,0.0007584105,0.0010063171,0.0012655545,0.00075078994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010178232,0.00007932804,0.00038267998,0.00021019208,0.000076841345,0.00012719247,0.00009440448,0.7601801,0.0055638924,0.09574203,0.005793959,0.13164759],"study_design_scores_gemma":[0.0000060605767,0.0000152134935,0.000035904563,0.0000043835335,0.0000022395968,0.000008600109,0.0000028591712,0.9905178,0.00033662294,0.008232911,0.000834105,0.0000033663],"about_ca_topic_score_codex":0.003682382,"about_ca_topic_score_gemma":0.0032923676,"teacher_disagreement_score":0.003682382,"about_ca_system_score_codex":0.000602786,"about_ca_system_score_gemma":0.0009641355,"threshold_uncertainty_score":0.007321894},"labels":[],"label_agreement":null},{"id":"W3122339903","doi":"","title":"Fast convergence of stochastic subgradient method under interpolation","year":2021,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgradient method; Interpolation (computer graphics); Mathematical optimization; Parameterized complexity; Mathematics; Stochastic gradient descent; Rate of convergence; Applied mathematics; Convergence (economics); Convex optimization; Convex function; Minification; Regular polygon; Computer science; Algorithm; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.04650407779978084,"score_gpt":0.341509292915698,"score_spread":0.29500521511591715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122339903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013564673,0.0005391845,0.9835739,0.00029366833,0.00006203795,0.00003868819,0.000027717715,0.0002433152,0.0016568557],"genre_scores_gemma":[0.5455841,0.0013267,0.44466585,0.00048510553,0.00019913496,0.000298492,0.00028902266,0.0005387618,0.0066128145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980913,0.0010642741,0.000076587254,0.00016319024,0.00046286054,0.00014178606],"domain_scores_gemma":[0.99303985,0.0052263034,0.00034905295,0.00046198585,0.00070012634,0.00022264308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059108697,0.0013073537,0.0017097399,0.0007457749,0.0004741261,0.00094202615,0.0011876124,0.0014647229,0.0017990909],"category_scores_gemma":[0.018613813,0.0006148284,0.00096390815,0.00066489674,0.0018144612,0.0018918773,0.0021715756,0.0024698796,0.00052745553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023233223,0.00004966686,0.0011815729,0.00025250425,0.00008199059,0.00014520148,0.00014265184,0.8691009,0.0048795347,0.08922384,0.0019904284,0.032719355],"study_design_scores_gemma":[0.0000058811456,0.000023081351,0.000057562585,0.000008236104,0.0000021299895,0.000013149338,0.0000038820135,0.9926311,0.00039670168,0.0065600015,0.00029503583,0.0000032406404],"about_ca_topic_score_codex":0.0038252177,"about_ca_topic_score_gemma":0.0023434456,"teacher_disagreement_score":0.0059108697,"about_ca_system_score_codex":0.001270516,"about_ca_system_score_gemma":0.0018433242,"threshold_uncertainty_score":0.031260073},"labels":[],"label_agreement":null},{"id":"W3123776038","doi":"10.1109/access.2022.3149890","title":"Privacy Assured Recovery of Compressively Sensed ECG Signals","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Encryption; Compressed sensing; Key (lock); SIGNAL (programming language); Wearable computer; Wearable technology; Real-time computing; Computer hardware; Embedded system; Computer security; Artificial intelligence","score_opus":0.036031079747548565,"score_gpt":0.27433930943382306,"score_spread":0.2383082296862745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123776038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03888454,0.00032230272,0.9586311,0.00054195995,0.00007031334,0.00004077707,0.000101418795,0.00024896316,0.0011586731],"genre_scores_gemma":[0.8291432,0.0006613623,0.1660204,0.00025524406,0.00019991011,0.000055377193,0.0002606228,0.0000451091,0.0033587553],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912053,0.00020554356,0.00005543955,0.0001423483,0.00038835427,0.000087847075],"domain_scores_gemma":[0.9989126,0.00038235332,0.00016453299,0.0003549499,0.00014729484,0.0000382718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057101547,0.0004228927,0.00046580014,0.0002776818,0.00034225266,0.0005124493,0.0005409275,0.00057414337,0.00097022514],"category_scores_gemma":[0.0023910461,0.00014958745,0.0003816103,0.0004820916,0.0005308477,0.0010854024,0.0011749666,0.00084517704,0.00031618058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015830017,0.0002800137,0.0027486116,0.00034912466,0.00016038312,0.0016673867,0.0004660683,0.20104265,0.24967417,0.04552431,0.0071523534,0.4893519],"study_design_scores_gemma":[0.000047052312,0.00020468437,0.0010694748,0.000022626533,0.000027287188,0.0012101113,0.00014630547,0.90696675,0.074938364,0.011534334,0.0038050942,0.000027880416],"about_ca_topic_score_codex":0.00069856213,"about_ca_topic_score_gemma":0.0006737977,"teacher_disagreement_score":0.00097022514,"about_ca_system_score_codex":0.00024320063,"about_ca_system_score_gemma":0.00062271435,"threshold_uncertainty_score":0.0032457113},"labels":[],"label_agreement":null},{"id":"W3125995405","doi":"10.1109/globecom42002.2020.9322133","title":"Learning-Based Cooperative Spectrum Sensing in Hybrid Underlay-Interweave Secondary Networks","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Support vector machine; Computer science; Kernel (algebra); Artificial intelligence; Pattern recognition (psychology); Machine learning; Algorithm; Mathematics","score_opus":0.011998718624721723,"score_gpt":0.20286222646116908,"score_spread":0.19086350783644737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125995405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103962,0.0003284548,0.8936128,0.00012594869,0.000043938428,0.000031022224,0.00003221039,0.00023183944,0.0016317978],"genre_scores_gemma":[0.97530156,0.00008574659,0.023689574,0.00004981067,0.000023874452,0.000025059613,0.000017549371,0.000007700563,0.0007990598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990415,0.00029335188,0.000032440374,0.00023888171,0.0002483998,0.00014544507],"domain_scores_gemma":[0.9989304,0.000519951,0.0001504917,0.00012489068,0.00022938929,0.000044931883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009176334,0.0006277945,0.0008252332,0.00036719991,0.00051808194,0.0007490555,0.0011066899,0.00073032867,0.00038655967],"category_scores_gemma":[0.0015295926,0.00024507442,0.00035611814,0.00041856003,0.0008323356,0.0012739102,0.0010375694,0.00054261147,0.0001593041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004187147,0.00016630357,0.0029094515,0.00012319739,0.00012030921,0.0005376655,0.0003460297,0.8442915,0.027339002,0.01275155,0.0010729867,0.10992328],"study_design_scores_gemma":[0.000004694463,0.00006790075,0.00020835189,0.0000031016552,0.000009459682,0.00008237252,0.00002778979,0.9956513,0.0017387132,0.0019177874,0.00028223015,0.0000062273784],"about_ca_topic_score_codex":0.0026619947,"about_ca_topic_score_gemma":0.0036919515,"teacher_disagreement_score":0.0026619947,"about_ca_system_score_codex":0.0004937852,"about_ca_system_score_gemma":0.00048073853,"threshold_uncertainty_score":0.0052930117},"labels":[],"label_agreement":null},{"id":"W312609692","doi":"10.1007/s11128-015-1024-y","title":"Projection methods for quantum channel construction","year":2015,"lang":"en","type":"article","venue":"Quantum Information Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Projection (relational algebra); Semidefinite programming; Heuristics; Rank (graph theory); Quantum; Dimension (graph theory); Set (abstract data type); Linear programming; Mathematics; Computer science; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Quantum mechanics; Physics","score_opus":0.05114541861985054,"score_gpt":0.3287178893151219,"score_spread":0.27757247069527136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W312609692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022095027,0.0007353699,0.9907426,0.0004628111,0.00010916641,0.000023869925,0.00007543973,0.00012372441,0.0055174],"genre_scores_gemma":[0.20869102,0.0054780934,0.7589908,0.00053273916,0.00087805523,0.00045420058,0.0004651555,0.00052760844,0.023982294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990069,0.0005126241,0.000031910327,0.00010327987,0.00029536654,0.000049907932],"domain_scores_gemma":[0.9982337,0.0010674013,0.000075505275,0.00031164038,0.00023008962,0.00008160081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016246042,0.001284885,0.0012090413,0.0011298197,0.0009084611,0.0015472147,0.0013378501,0.0015122744,0.00634488],"category_scores_gemma":[0.0057629347,0.0008554828,0.00092662626,0.0019175657,0.0029519603,0.0034607681,0.0029075507,0.004409416,0.0015149558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002830919,0.000028042956,0.0000486426,0.000085807755,0.000018967883,0.000022276365,0.000061083796,0.02395682,0.0010240166,0.9414026,0.0036162317,0.02970726],"study_design_scores_gemma":[0.000014166997,0.000013443446,0.00005004668,0.00001888251,0.000007856537,0.000028455703,0.0000142385,0.23971307,0.0006619857,0.7549053,0.0045526824,0.000019924288],"about_ca_topic_score_codex":0.0015386555,"about_ca_topic_score_gemma":0.0015379669,"teacher_disagreement_score":0.00634488,"about_ca_system_score_codex":0.00088923064,"about_ca_system_score_gemma":0.0012221093,"threshold_uncertainty_score":0.02122575},"labels":[],"label_agreement":null},{"id":"W3130907527","doi":"10.1109/vtc2020-fall49728.2020.9348852","title":"NN-based Support Detection of Sparse Signals","year":2020,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Compressed sensing; Computer science; Signal recovery; SIGNAL (programming language); Signal reconstruction; Convergence (economics); Sparse approximation; Nyquist rate; Artificial intelligence; Rate of convergence; Sparse matrix; Pattern recognition (psychology); Sampling (signal processing); Signal processing; Algorithm; Computer vision; Digital signal processing; Filter (signal processing); Telecommunications","score_opus":0.026948370399993198,"score_gpt":0.21717162065969878,"score_spread":0.19022325025970557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130907527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035107322,0.0002788401,0.9628365,0.00017009348,0.00004330921,0.00002919925,0.00006007363,0.00023923971,0.0012355007],"genre_scores_gemma":[0.6840397,0.0003586597,0.31319663,0.00014555136,0.00008109262,0.000077831384,0.000264304,0.00004860875,0.0017876475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929535,0.0001780098,0.000044786048,0.00011725807,0.00030434533,0.00006016371],"domain_scores_gemma":[0.9976248,0.0013691866,0.00022529873,0.0002333024,0.00048777252,0.000059788985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011619821,0.0004503257,0.00077329203,0.0005781058,0.00029701428,0.00062114233,0.00083752,0.0010206004,0.001166484],"category_scores_gemma":[0.008123994,0.00023435133,0.0003822669,0.000605207,0.0006488653,0.0013340705,0.0010330077,0.0010355583,0.00035371634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008282087,0.00012201826,0.0033272172,0.00031386787,0.00007613508,0.00022155316,0.00020528048,0.45908585,0.03134622,0.024437137,0.002842715,0.47719386],"study_design_scores_gemma":[0.0000052735227,0.000029607872,0.00021958652,0.000007732394,0.0000037289387,0.000057610232,0.000008477508,0.99306524,0.0036490865,0.0026375384,0.00031002416,0.000006049503],"about_ca_topic_score_codex":0.0014986892,"about_ca_topic_score_gemma":0.001532258,"teacher_disagreement_score":0.0014986892,"about_ca_system_score_codex":0.0003393086,"about_ca_system_score_gemma":0.00046014815,"threshold_uncertainty_score":0.0061451793},"labels":[],"label_agreement":null},{"id":"W3131097734","doi":"10.1007/s10994-022-06265-x","title":"SVRG meets AdaGrad: painless variance reduction","year":2022,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; SAIT Polytechnic; Université de Montréal; Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Minification; Mathematics; Variance reduction; Constant (computer programming); Reduction (mathematics); Heuristic; Variance (accounting); Robustness (evolution); Regular polygon; Algorithm; Mathematical optimization; Computer science; Applied mathematics; Statistics; Geometry","score_opus":0.009090252797299359,"score_gpt":0.20340088466178724,"score_spread":0.19431063186448788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131097734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027571826,0.00015750396,0.99215627,0.00032461752,0.00018303793,0.000028899916,0.00007602585,0.002079921,0.0022365812],"genre_scores_gemma":[0.132837,0.0002974074,0.84731376,0.00043853096,0.00026437335,0.00015083735,0.0005092677,0.0012927304,0.016896054],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989831,0.00030969974,0.000036311427,0.00016627825,0.00042882518,0.00007574774],"domain_scores_gemma":[0.9990804,0.0003769964,0.000054683507,0.00023128049,0.00018762684,0.00006903815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573897,0.0012598448,0.0011797306,0.0006218718,0.00036269517,0.0011796812,0.00138694,0.0019978096,0.007197113],"category_scores_gemma":[0.0052180663,0.0005750418,0.0006088144,0.00067207863,0.0009000988,0.0015673932,0.0020392945,0.0033303273,0.004302539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035011466,0.00027060608,0.0004892026,0.00020817993,0.00006532337,0.0001484552,0.00007684323,0.19341652,0.015543901,0.07968695,0.03725536,0.6724886],"study_design_scores_gemma":[0.000015236296,0.000037538583,0.0000618326,0.000010478837,0.000004407472,0.000045520985,0.000006319074,0.97515905,0.0035818077,0.017154101,0.0039163223,0.0000074658824],"about_ca_topic_score_codex":0.0017054261,"about_ca_topic_score_gemma":0.002415158,"teacher_disagreement_score":0.007197113,"about_ca_system_score_codex":0.00042617598,"about_ca_system_score_gemma":0.0011543065,"threshold_uncertainty_score":0.02407676},"labels":[],"label_agreement":null},{"id":"W3131585465","doi":"10.1002/cjs.11598","title":"Adaptive banding covariance estimation for high‐dimensional multivariate longitudinal data","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cholesky decomposition; Estimator; Univariate; Covariance matrix; Covariance; Algorithm; Mathematics; Mathematical optimization; Matrix norm; Block (permutation group theory); Lasso (programming language); Computer science; Multivariate statistics; Statistics","score_opus":0.0988397467297755,"score_gpt":0.27038017633815414,"score_spread":0.17154042960837865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131585465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011118204,0.00012999923,0.98830426,0.00012561816,0.000012879562,0.000014241074,0.000062447936,0.00007098908,0.00016135091],"genre_scores_gemma":[0.47394523,0.0006522921,0.52246016,0.00017667247,0.00012873537,0.00021919537,0.0005222929,0.00008011562,0.0018151669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879766,0.000622924,0.000054892043,0.0002370259,0.00021872719,0.000068771296],"domain_scores_gemma":[0.9949144,0.0034745894,0.0006858707,0.00047610092,0.00036305268,0.000085967426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038506107,0.0006005441,0.0008431117,0.000625923,0.00029437643,0.000608124,0.00087627355,0.0007394419,0.001054131],"category_scores_gemma":[0.011085258,0.00045043623,0.00060846464,0.0008514188,0.0008105522,0.0009263553,0.0010480124,0.0015160152,0.00022592349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026384997,0.0001231174,0.0057957307,0.00024675138,0.00024154094,0.00017214476,0.00016959879,0.77869433,0.011708368,0.06855908,0.0025963716,0.13142912],"study_design_scores_gemma":[0.000008321694,0.00001806818,0.0008296345,0.000011218287,0.0000084160065,0.000023226281,0.00001007092,0.985606,0.00091520353,0.012075584,0.00048397554,0.000010319209],"about_ca_topic_score_codex":0.0029110322,"about_ca_topic_score_gemma":0.0025347364,"teacher_disagreement_score":0.0038506107,"about_ca_system_score_codex":0.0004378667,"about_ca_system_score_gemma":0.0010708843,"threshold_uncertainty_score":0.020364225},"labels":[],"label_agreement":null},{"id":"W3134997426","doi":"10.1016/j.acha.2021.02.005","title":"Geometric component analysis and its applications to data analysis","year":2021,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Israel Science Foundation; Blavatnik Family Foundation","keywords":"Diffusion map; Dimensionality reduction; Data point; Linear subspace; Principal component analysis; Curse of dimensionality; Mathematics; Anomaly detection; Algorithm; Kernel method; Kernel principal component analysis; Kernel (algebra); Computer science; Nonlinear dimensionality reduction; Pattern recognition (psychology); Artificial intelligence; Support vector machine; Geometry","score_opus":0.02980774195618917,"score_gpt":0.26730979654496695,"score_spread":0.23750205458877777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134997426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002105436,0.011825545,0.98052603,0.0008743649,0.000279038,0.000022861906,0.00008987091,0.00021519656,0.0040616156],"genre_scores_gemma":[0.16439241,0.05666987,0.7625513,0.0005770868,0.0028420421,0.00021333437,0.00039751924,0.00022653495,0.01212989],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999321,0.00020844424,0.00004471767,0.00009652957,0.00030080444,0.000028587747],"domain_scores_gemma":[0.9969518,0.002158383,0.00016373997,0.00023043298,0.00044484183,0.00005076739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010313026,0.0010012244,0.00085183705,0.0028217514,0.00043779262,0.0016927004,0.00069725653,0.0013337238,0.0023895155],"category_scores_gemma":[0.004601104,0.00038520226,0.00068076194,0.0061794347,0.00242231,0.0011372264,0.001051131,0.0018340923,0.0011765234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059813156,0.000049688195,0.0006196166,0.00063282106,0.000090720634,0.00015414228,0.00030281307,0.0697332,0.007440195,0.4011441,0.010995072,0.50877786],"study_design_scores_gemma":[0.000011256883,0.00005691964,0.001193989,0.00010134355,0.000056445784,0.00045864657,0.00014510342,0.43081465,0.003832777,0.5170114,0.046243817,0.00007352418],"about_ca_topic_score_codex":0.0018004907,"about_ca_topic_score_gemma":0.0013908533,"teacher_disagreement_score":0.0028217514,"about_ca_system_score_codex":0.00041939996,"about_ca_system_score_gemma":0.00065825245,"threshold_uncertainty_score":0.007993758},"labels":[],"label_agreement":null},{"id":"W3135167421","doi":"10.48550/arxiv.2008.08170","title":"Accelerated Zeroth-Order and First-Order Momentum Methods from Mini to Minimax Optimization","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Minimax; Order (exchange); Mathematics; Dimension (graph theory); Stationary point; Combinatorics; Momentum (technical analysis); Function (biology); Gradient descent; Zeroth law of thermodynamics; Physics; Algorithm; Applied mathematics; Mathematical analysis; Mathematical optimization; Quantum mechanics; Computer science","score_opus":0.10193287826363119,"score_gpt":0.22805662635936938,"score_spread":0.12612374809573818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135167421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058687716,0.0005320633,0.98967,0.0002685421,0.00009558348,0.00007659808,0.000081067985,0.0012098792,0.0021975837],"genre_scores_gemma":[0.24521258,0.00090683665,0.74037766,0.00068476115,0.00030301302,0.00064640614,0.00074831693,0.00088109396,0.010239298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00016654594,0.000043166914,0.00013075446,0.00023704884,0.00008796902],"domain_scores_gemma":[0.99878937,0.0006312872,0.000089747504,0.00018050688,0.00021923785,0.0000899378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097285,0.0016345364,0.0016640321,0.00076024054,0.00064541236,0.0013086363,0.002457874,0.0017377588,0.006220213],"category_scores_gemma":[0.0046979934,0.0009207561,0.001088553,0.0007836911,0.0011685509,0.0019381349,0.0019372615,0.0032255258,0.0018683118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004899448,0.00018343693,0.0014087504,0.0004928955,0.00013534358,0.00017480887,0.00017908425,0.6310146,0.008342902,0.07658585,0.01366375,0.26732862],"study_design_scores_gemma":[0.000020452546,0.000036922702,0.00008985631,0.000009961084,0.0000065606096,0.000023779801,0.0000063937982,0.98983836,0.00077233167,0.0077974238,0.0013885102,0.000009488252],"about_ca_topic_score_codex":0.0050279177,"about_ca_topic_score_gemma":0.00553023,"teacher_disagreement_score":0.006220213,"about_ca_system_score_codex":0.0010167022,"about_ca_system_score_gemma":0.002563453,"threshold_uncertainty_score":0.020808697},"labels":[],"label_agreement":null},{"id":"W3139627051","doi":"","title":"The Global Convergence of Self-Scaling BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems","year":2007,"lang":"en","type":"article","venue":"数学学报(英文版)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Broyden–Fletcher–Goldfarb–Shanno algorithm; Hessian matrix; Quasi-Newton method; Line search; Mathematical optimization; Mathematics; Convergence (economics); Scaling; Optimization problem; Hessian equation; Applied mathematics; Nonlinear system; Computer science; Newton's method; Mathematical analysis","score_opus":0.011453103442081908,"score_gpt":0.24333729412337254,"score_spread":0.23188419068129063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3139627051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013801026,0.00013062786,0.98361164,0.0001285156,0.000021282762,0.00003879938,0.000010213587,0.00010818313,0.0021496674],"genre_scores_gemma":[0.43689507,0.0003442091,0.5571394,0.00021709339,0.000047306527,0.00037971378,0.000101657526,0.000169887,0.004705636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932265,0.00029663267,0.00003139159,0.000069153735,0.00024006105,0.000040055264],"domain_scores_gemma":[0.99800426,0.0012928041,0.00019780824,0.00013762922,0.00031055626,0.00005696448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019812228,0.0008551258,0.0008295769,0.00066966185,0.0004710392,0.00065499183,0.00080432574,0.001384705,0.0018389804],"category_scores_gemma":[0.006454306,0.00041365315,0.00049265946,0.00056399434,0.0014594627,0.0011065097,0.00093844417,0.00077378924,0.00032484223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098368895,0.000064329004,0.000756975,0.00015817712,0.00005024848,0.00011182911,0.00017641846,0.8824791,0.00413563,0.06303756,0.0012666878,0.047664754],"study_design_scores_gemma":[0.000007650794,0.000015102414,0.0000489624,0.000005183767,0.0000014854078,0.000011676253,0.000004967128,0.99549425,0.00033696115,0.0038282224,0.00024293119,0.0000026777097],"about_ca_topic_score_codex":0.0026477189,"about_ca_topic_score_gemma":0.0023014916,"teacher_disagreement_score":0.0026477189,"about_ca_system_score_codex":0.000525883,"about_ca_system_score_gemma":0.0010884337,"threshold_uncertainty_score":0.010477841},"labels":[],"label_agreement":null},{"id":"W3142207845","doi":"10.13140/rg.2.2.18142.15680","title":"Scalable Adaptive Cubic Regularization Methods","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Lanczos resampling; Cholesky decomposition; Mathematical optimization; Applied mathematics; Computer science; Scalability; Preconditioner; Mathematics; Conjugate gradient method; Line search; Algorithm; Iterative method; Eigenvalues and eigenvectors","score_opus":0.08102400809229682,"score_gpt":0.2105617364831134,"score_spread":0.1295377283908166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142207845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00506033,0.00032098932,0.97995996,0.0002355386,0.00010507089,0.00007306331,0.00022739334,0.0024177795,0.011599837],"genre_scores_gemma":[0.18082026,0.00044233585,0.8006507,0.00032344318,0.0001360003,0.0003756833,0.0009739471,0.0012511961,0.015026547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987348,0.00022868087,0.000047013575,0.00015957541,0.00071592553,0.00011409649],"domain_scores_gemma":[0.99812204,0.0005714182,0.00011783203,0.00042150536,0.0006780836,0.00008907126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088912516,0.0009320838,0.0011198054,0.00057747687,0.0007183884,0.0011401452,0.002462795,0.0012915018,0.010356518],"category_scores_gemma":[0.004190971,0.00043974462,0.0009838284,0.0009116304,0.0007291923,0.0013200244,0.0022278035,0.0019445543,0.0029180548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001725323,0.000083534826,0.00089603936,0.0002872374,0.00010525988,0.00017293045,0.0001537644,0.6261425,0.008726405,0.0739843,0.03619574,0.2530798],"study_design_scores_gemma":[0.000018127994,0.000010267128,0.000074923075,0.000007974496,0.0000040251734,0.000024706298,0.000011245263,0.98657507,0.0008455821,0.007176068,0.0052432385,0.0000087544295],"about_ca_topic_score_codex":0.009193798,"about_ca_topic_score_gemma":0.013397242,"teacher_disagreement_score":0.010356518,"about_ca_system_score_codex":0.0009707698,"about_ca_system_score_gemma":0.0026147983,"threshold_uncertainty_score":0.034645975},"labels":[],"label_agreement":null},{"id":"W3150505447","doi":"10.1109/tmi.2021.3070780","title":"Multi-Resemblance Multi-Target Low-Rank Coding for Prediction of Cognitive Decline With Longitudinal Brain Images","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Medical Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Biomedical Imaging and Bioengineering; DoD Alzheimer's Disease Neuroimaging Initiative; Canadian Institutes of Health Research; National Institute on Aging; National Institutes of Health; Arizona Alzheimer’s Consortium","keywords":"Computer science; Coding (social sciences); Artificial intelligence; Neural coding; Machine learning; Computational complexity theory; Pattern recognition (psychology); Algorithm; Mathematics; Statistics","score_opus":0.023284991937266308,"score_gpt":0.2873013378691414,"score_spread":0.2640163459318751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150505447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081538625,0.0012311969,0.9129638,0.000758691,0.0000984327,0.000100823476,0.00042007622,0.0016793316,0.0012090749],"genre_scores_gemma":[0.7035749,0.0009110184,0.28800336,0.00057688914,0.00019734574,0.00020735888,0.0020428773,0.00020474325,0.004281407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920434,0.00025175198,0.000042339238,0.00019923407,0.00021804133,0.00008437187],"domain_scores_gemma":[0.9970534,0.0015515002,0.0002800954,0.00033155992,0.0006072756,0.00017614759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020703804,0.0009915158,0.0010673297,0.0008123535,0.00042459654,0.0008214708,0.0013704814,0.0012278114,0.0013906016],"category_scores_gemma":[0.007319008,0.00028968597,0.0008946779,0.00080753246,0.00062932965,0.0012369726,0.0011855853,0.0022027977,0.00068557006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010051184,0.00053168857,0.008161839,0.00023620136,0.00017223062,0.00024568872,0.0002838723,0.46978512,0.012609655,0.005976422,0.009860264,0.491132],"study_design_scores_gemma":[0.00001275795,0.000044705394,0.00060953246,0.000005921675,0.000009982526,0.000025889542,0.000012576373,0.9962238,0.0013359963,0.0014492142,0.0002566783,0.000012969256],"about_ca_topic_score_codex":0.009596777,"about_ca_topic_score_gemma":0.00885784,"teacher_disagreement_score":0.009596777,"about_ca_system_score_codex":0.00052339287,"about_ca_system_score_gemma":0.0014016426,"threshold_uncertainty_score":0.019081831},"labels":[],"label_agreement":null},{"id":"W3151137625","doi":"10.1093/imaiai/iaab002","title":"A model of double descent for high-dimensional binary linear classification","year":2021,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Kappa; Gradient descent; Mathematics; Support vector machine; Binary classification; Binary number; Linear classifier; Linear regression; Gaussian; Logistic regression; Applied mathematics; Artificial intelligence; Pattern recognition (psychology); Statistics; Computer science; Physics; Geometry; Artificial neural network","score_opus":0.051562028037794805,"score_gpt":0.268477240208541,"score_spread":0.21691521217074622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151137625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12126844,0.000524746,0.86710405,0.004138412,0.00010624404,0.00008333308,0.00027595478,0.00047747625,0.0060213427],"genre_scores_gemma":[0.9440615,0.00020061915,0.044712063,0.00052294444,0.00010426871,0.00020668785,0.00020555442,0.00009132912,0.009895009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997951,0.0009350509,0.000069669455,0.00036881826,0.00037693063,0.0002986209],"domain_scores_gemma":[0.9911343,0.0061635305,0.00075775315,0.00069969514,0.00086246047,0.00038221793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005570435,0.00066349114,0.0015859054,0.0007643175,0.00074482564,0.0018859663,0.0026097354,0.002750706,0.0038706174],"category_scores_gemma":[0.017866794,0.0007602061,0.0007208851,0.0007930864,0.003223745,0.002932688,0.0017835202,0.0025232201,0.0008620187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027695994,0.000104487655,0.0023221131,0.0001052664,0.00005167347,0.0002931624,0.00022065721,0.6798547,0.0018266228,0.29721978,0.0041436115,0.013581023],"study_design_scores_gemma":[0.000014729977,0.000015531006,0.00011195514,0.000006837675,0.0000021117423,0.0000189185,0.000005817133,0.9760266,0.00012434828,0.023487,0.00017995959,0.00000624675],"about_ca_topic_score_codex":0.0050975834,"about_ca_topic_score_gemma":0.003991141,"teacher_disagreement_score":0.005570435,"about_ca_system_score_codex":0.0021950891,"about_ca_system_score_gemma":0.0010931888,"threshold_uncertainty_score":0.029459655},"labels":[],"label_agreement":null},{"id":"W3155603885","doi":"10.1016/j.acha.2022.08.003","title":"Generalization bounds for sparse random feature expansions","year":2022,"lang":"en","type":"article","venue":"Applied and Computational Harmonic Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Feature (linguistics); Generalization; Leverage (statistics); Mathematics; Computer science; Pattern recognition (psychology); Artificial intelligence; Algorithm; Machine learning","score_opus":0.011917706377773311,"score_gpt":0.22592813371199255,"score_spread":0.21401042733421924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155603885","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013190925,0.0015686376,0.97603184,0.0012270863,0.000109113505,0.000056464894,0.0002625848,0.0004337668,0.0071196053],"genre_scores_gemma":[0.62514925,0.0053927368,0.35025245,0.0017254057,0.0009700494,0.00095767475,0.0016144041,0.0012514119,0.012686621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974483,0.0008607816,0.00011581596,0.0004856962,0.0008085882,0.0002808929],"domain_scores_gemma":[0.9761163,0.017818142,0.0012303706,0.0024182156,0.0018995795,0.0005173046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006472928,0.0020965063,0.0013327219,0.0019330852,0.000850639,0.0014334176,0.0021671155,0.0018358058,0.0046535106],"category_scores_gemma":[0.03797076,0.0006274819,0.0014552273,0.001270519,0.0030959817,0.006093263,0.0041249143,0.005446208,0.0013773305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023054023,0.000086435684,0.0016110742,0.00046141786,0.00009550156,0.0002124924,0.0003017941,0.42297202,0.00837046,0.48613086,0.009442072,0.07008534],"study_design_scores_gemma":[0.000007303771,0.000035449844,0.00030086195,0.000059819762,0.000015685951,0.00006575294,0.000023287854,0.8422516,0.001575732,0.15343799,0.0022037462,0.000022692619],"about_ca_topic_score_codex":0.0021036502,"about_ca_topic_score_gemma":0.0022345495,"teacher_disagreement_score":0.006472928,"about_ca_system_score_codex":0.0023023852,"about_ca_system_score_gemma":0.0010105574,"threshold_uncertainty_score":0.034232557},"labels":[],"label_agreement":null},{"id":"W3156660294","doi":"10.1145/3447431","title":"Compressed Imaging Reconstruction with Sparse Random Projection","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Multimedia Computing Communications and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Program for Professor of Special Appointment (Eastern Scholar) at Shanghai Institutions of Higher Learning; National Natural Science Foundation of China","keywords":"Compressed sensing; Computer science; Iterative reconstruction; Random projection; Projection (relational algebra); Algorithm; Cloud computing; Optimization problem; Point cloud; Artificial intelligence; Computer vision","score_opus":0.017049832876555645,"score_gpt":0.2477829687112261,"score_spread":0.23073313583467045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156660294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018597706,0.00017175969,0.9966092,0.0001653324,0.000025611005,0.000026967491,0.000036191504,0.00021700286,0.00088813575],"genre_scores_gemma":[0.14450791,0.0009185097,0.85028386,0.00025740627,0.0001538294,0.00017864905,0.00038580503,0.00017191657,0.0031420607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.00028777443,0.000037234724,0.00017710577,0.00040482756,0.00006332269],"domain_scores_gemma":[0.9988733,0.0005563499,0.00012794278,0.00019192991,0.00020108711,0.00004935979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009660154,0.0010210478,0.0009396005,0.00067343144,0.00036928078,0.0009656887,0.001100732,0.0010392442,0.0020978355],"category_scores_gemma":[0.0038352679,0.0004822311,0.00083015463,0.0012104909,0.00094854494,0.0015648631,0.0017659705,0.0022979316,0.00081278745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002933034,0.00011732097,0.000812547,0.00038834158,0.00011335873,0.00037704367,0.00019479368,0.6148285,0.01661405,0.10329287,0.008738295,0.25422955],"study_design_scores_gemma":[0.00001944304,0.000026040421,0.00007513397,0.000011324942,0.00000747356,0.00010712872,0.00001527438,0.9832908,0.0027919505,0.0117607685,0.0018819167,0.000012798349],"about_ca_topic_score_codex":0.0030203993,"about_ca_topic_score_gemma":0.00262139,"teacher_disagreement_score":0.0030203993,"about_ca_system_score_codex":0.0005536191,"about_ca_system_score_gemma":0.0012893577,"threshold_uncertainty_score":0.00701797},"labels":[],"label_agreement":null},{"id":"W3157515833","doi":"10.1007/s00138-021-01201-w","title":"Plug-and-Play video reconstruction using sparse 3D transform-domain block matching","year":2021,"lang":"en","type":"article","venue":"Machine Vision and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Artificial intelligence; Mixture model; Embedding; Block (permutation group theory); Computer vision; Matching pursuit; Pattern recognition (psychology); Compressed sensing; Mathematics","score_opus":0.010157287957062599,"score_gpt":0.2522029104045381,"score_spread":0.24204562244747552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157515833","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010617261,0.0001307392,0.9830419,0.00012512469,0.0000622336,0.00008335658,0.00021576785,0.0034534447,0.0022702098],"genre_scores_gemma":[0.2520884,0.00039025216,0.7368542,0.00021748124,0.00006385259,0.0001516478,0.0010726205,0.00072586996,0.008435643],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964905,0.000037050802,0.000009956922,0.000039409395,0.00022009302,0.00004440325],"domain_scores_gemma":[0.9996049,0.00011985148,0.000027434522,0.00010129418,0.000103898834,0.000042736767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044063907,0.0007454562,0.0006539034,0.00070958654,0.00021266601,0.0009102815,0.0010011365,0.00080330437,0.011274065],"category_scores_gemma":[0.0018091,0.0003981609,0.00040218548,0.0005871478,0.00031285256,0.0010556676,0.0013045073,0.00088069314,0.003369324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013888463,0.0003125837,0.0012975463,0.0002420219,0.00012200338,0.0003995133,0.00015637229,0.054459266,0.15112264,0.012532341,0.015365139,0.7626017],"study_design_scores_gemma":[0.000072377545,0.0001522883,0.0005211834,0.000023095403,0.00001950536,0.00039055353,0.000060884162,0.9034995,0.08030609,0.0038331596,0.011090923,0.000030434054],"about_ca_topic_score_codex":0.0022443945,"about_ca_topic_score_gemma":0.004038979,"teacher_disagreement_score":0.011274065,"about_ca_system_score_codex":0.00025078285,"about_ca_system_score_gemma":0.00061810156,"threshold_uncertainty_score":0.037715495},"labels":[],"label_agreement":null},{"id":"W3158619233","doi":"10.1002/mrm.28812","title":"Automatic determination of the regularization weighting for wavelet‐based compressed sensing MRI reconstructions","year":2021,"lang":"en","type":"article","venue":"Magnetic Resonance in Medicine","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Robarts Clinical Trials; Western University","funders":"Canadian Institutes of Health Research","keywords":"Undersampling; Weighting; Compressed sensing; Wavelet; Regularization (linguistics); Computer science; Artificial intelligence; Pattern recognition (psychology); Iterative reconstruction; Correlation coefficient; Image quality; Mathematics; Algorithm; Image (mathematics); Physics; Machine learning","score_opus":0.0145043048780091,"score_gpt":0.23881472838236933,"score_spread":0.22431042350436023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158619233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075031333,0.00003245744,0.99186045,0.000045586403,0.000008217115,0.000021216636,0.00001374505,0.0002974473,0.00021784673],"genre_scores_gemma":[0.06543088,0.000057201465,0.93364024,0.000037736067,0.000013332053,0.000058628924,0.00004437034,0.00023562292,0.0004819574],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994086,0.00015751566,0.00004008829,0.00007556559,0.00028910954,0.000029146917],"domain_scores_gemma":[0.9982326,0.00085077685,0.00030812097,0.00024105066,0.00030309125,0.00006434632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017186014,0.0006868404,0.00044305815,0.00080378866,0.00035750787,0.0006351437,0.0006698323,0.00061081233,0.0013565839],"category_scores_gemma":[0.0075227325,0.0004010073,0.0003078264,0.00035480887,0.0005809499,0.0006988941,0.00067909015,0.0010175753,0.00068075996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029468467,0.00015393463,0.001885514,0.00026870047,0.00005427381,0.00013945668,0.00028351156,0.056984913,0.49883366,0.013058311,0.0020167101,0.42602628],"study_design_scores_gemma":[0.000032602155,0.000102624566,0.0013248507,0.00003518786,0.000021206699,0.00041271694,0.00003856611,0.78240305,0.20809293,0.0041007865,0.0033836553,0.000051819618],"about_ca_topic_score_codex":0.0007864494,"about_ca_topic_score_gemma":0.0015194735,"teacher_disagreement_score":0.0017186014,"about_ca_system_score_codex":0.00030424757,"about_ca_system_score_gemma":0.00087356166,"threshold_uncertainty_score":0.0090889335},"labels":[],"label_agreement":null},{"id":"W3158960540","doi":"10.1007/s10107-022-01839-y","title":"An optimal gradient method for smooth strongly convex minimization","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"H2020 European Research Council; Agence Nationale de la Recherche","keywords":"Mathematics; Constructive; Oracle; Mathematical optimization; Class (philosophy); Minification; Regular polygon; Point (geometry); Convex optimization; Upper and lower bounds; Proximal Gradient Methods; Sequence (biology); Computer science; Mathematical analysis","score_opus":0.0240464595519915,"score_gpt":0.2911768973617581,"score_spread":0.26713043780976664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158960540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006040489,0.00011387375,0.99769235,0.00013497744,0.00005751309,0.000017039649,0.000017861996,0.000060758615,0.0013016622],"genre_scores_gemma":[0.042222474,0.0004712879,0.948484,0.000250568,0.00018951602,0.0002402766,0.00011505432,0.00035585804,0.0076708845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941254,0.00026336935,0.000021829663,0.00007253447,0.00019747512,0.000032217653],"domain_scores_gemma":[0.99915457,0.0005141713,0.00003869369,0.000055234246,0.0001839206,0.00005341054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013024241,0.0012082055,0.0011636944,0.0009110204,0.00043400368,0.0009192331,0.0012507954,0.0015466742,0.0042192647],"category_scores_gemma":[0.004476146,0.00077719416,0.00092951115,0.00084622495,0.0014156138,0.001496005,0.0020033114,0.002805858,0.0014336387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013324416,0.00014742064,0.00023817671,0.00046976478,0.00008537146,0.00014042499,0.00014111126,0.3315929,0.009477506,0.4758441,0.016507404,0.16522256],"study_design_scores_gemma":[0.000015561303,0.00003496869,0.00004595557,0.000021314961,0.000009687921,0.000041084295,0.000008949478,0.9466053,0.0006844667,0.04783397,0.004686657,0.000012119896],"about_ca_topic_score_codex":0.0018228656,"about_ca_topic_score_gemma":0.002393708,"teacher_disagreement_score":0.0042192647,"about_ca_system_score_codex":0.00062384986,"about_ca_system_score_gemma":0.0016274815,"threshold_uncertainty_score":0.014114857},"labels":[],"label_agreement":null},{"id":"W3159383798","doi":"10.48550/arxiv.2104.12608","title":"Generalized ADMM in Distributed Learning via Variational Inequality","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Context (archaeology); Inequality; Variational inequality; Distributed learning; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics","score_opus":0.05994396276439662,"score_gpt":0.18938249100384122,"score_spread":0.1294385282394446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159383798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021777614,0.0002261022,0.9960674,0.00021997577,0.000035307974,0.000013738472,0.000019061652,0.000030064413,0.0012104023],"genre_scores_gemma":[0.6015865,0.0015645933,0.38828185,0.00045209346,0.00037700403,0.000354174,0.0002203216,0.00011792989,0.0070454557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986255,0.00067989464,0.000053201635,0.0002283205,0.0003347984,0.00007828671],"domain_scores_gemma":[0.99834275,0.0011361227,0.0001314436,0.00012443191,0.00021196638,0.000053387404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466293,0.0010234441,0.0011243359,0.00047363486,0.00038973032,0.0010508252,0.0012041074,0.0012487551,0.0015430115],"category_scores_gemma":[0.005263528,0.00039296073,0.0007540036,0.00085448805,0.0017093534,0.0014561524,0.001675188,0.0024449027,0.00025858267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047717418,0.000027525062,0.00026855964,0.00015206765,0.00005161136,0.00011158703,0.00009738141,0.76046133,0.0015988755,0.20593451,0.0016362742,0.02961259],"study_design_scores_gemma":[0.000008554442,0.000017996124,0.000030794006,0.000006799381,0.000003488112,0.000014518618,0.00000699232,0.9535325,0.00019121684,0.045585614,0.0005977319,0.0000038042917],"about_ca_topic_score_codex":0.0023093182,"about_ca_topic_score_gemma":0.0015322339,"teacher_disagreement_score":0.002466293,"about_ca_system_score_codex":0.0009977163,"about_ca_system_score_gemma":0.0012193315,"threshold_uncertainty_score":0.013043165},"labels":[],"label_agreement":null},{"id":"W3159706683","doi":"","title":"Fundamental Limits of Ridge-Regularized Empirical Risk Minimization in High Dimensions","year":2021,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Empirical risk minimization; Regularization (linguistics); Mathematics; Mathematical optimization; Minification; Inference; Computer science; Applied mathematics; Algorithm; Artificial intelligence","score_opus":0.10870192798397085,"score_gpt":0.3430290848900288,"score_spread":0.23432715690605796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159706683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017879883,0.0027619698,0.9696311,0.0023785362,0.000095422314,0.00004164857,0.00018396675,0.00027865818,0.0067488584],"genre_scores_gemma":[0.6944119,0.007449926,0.28733957,0.0020750777,0.0011264103,0.00071221904,0.0007905199,0.00075461075,0.0053398176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98888457,0.004908401,0.0005799577,0.0014991816,0.0034479743,0.00067981717],"domain_scores_gemma":[0.91133815,0.07331554,0.0037421556,0.006474309,0.0041526007,0.0009772903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018730428,0.0022749407,0.0019723536,0.001961825,0.0009131952,0.004071752,0.0027296958,0.0031249896,0.002075005],"category_scores_gemma":[0.099743016,0.0012635033,0.0011648888,0.001358273,0.0068830345,0.008899196,0.005971637,0.0075865444,0.0008248813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014985017,0.000069352915,0.0011406704,0.0003084235,0.00008893497,0.00018143635,0.00027012156,0.28287348,0.0029378885,0.68663627,0.0025930065,0.022750456],"study_design_scores_gemma":[0.000010499129,0.00005026305,0.0003858673,0.0000779754,0.000009129598,0.00006726151,0.000030461988,0.66779983,0.0010104865,0.3294512,0.001078065,0.000028912873],"about_ca_topic_score_codex":0.0012441,"about_ca_topic_score_gemma":0.00077460264,"teacher_disagreement_score":0.018730428,"about_ca_system_score_codex":0.0021912698,"about_ca_system_score_gemma":0.0013196793,"threshold_uncertainty_score":0.0990572},"labels":[],"label_agreement":null},{"id":"W3163146462","doi":"10.1109/tgrs.2021.3073159","title":"1-Bit Radar Imaging Based on Adversarial Samples","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Quantization (signal processing); Computer science; Radar imaging; Algorithm; Radar; Iterative reconstruction; Computer vision; Artificial intelligence; Telecommunications","score_opus":0.013589507168159999,"score_gpt":0.22179096470067416,"score_spread":0.20820145753251418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163146462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0124845235,0.00011251125,0.98613095,0.000115712464,0.000020756015,0.000022122516,0.000016915465,0.00013022861,0.0009663064],"genre_scores_gemma":[0.6758862,0.00040045744,0.3196677,0.00035565117,0.00006611649,0.00010145797,0.000118519136,0.00007984996,0.0033238754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906594,0.00029281652,0.00004102121,0.00015752744,0.00036734913,0.00007542149],"domain_scores_gemma":[0.9976689,0.0012887346,0.00032361728,0.00044186396,0.00021179827,0.000065048196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001121467,0.0006917004,0.00067729456,0.0002745379,0.00026306018,0.00069052336,0.0009627348,0.00079058966,0.0011233771],"category_scores_gemma":[0.00466443,0.00032663284,0.00036818194,0.0003352894,0.0011929777,0.0020681955,0.0015905942,0.0013252269,0.0003155431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046028887,0.000078226,0.0011213211,0.00021633752,0.00007177717,0.00025034018,0.0002736923,0.7030389,0.060378604,0.087604344,0.0019507522,0.1445554],"study_design_scores_gemma":[0.0000080560385,0.00005406122,0.00009252759,0.000008973304,0.0000065712106,0.00012015162,0.000013014932,0.98329663,0.008282761,0.0075006452,0.0006050232,0.0000115666935],"about_ca_topic_score_codex":0.000473862,"about_ca_topic_score_gemma":0.0004983387,"teacher_disagreement_score":0.0011233771,"about_ca_system_score_codex":0.0003653806,"about_ca_system_score_gemma":0.0004141094,"threshold_uncertainty_score":0.0059309006},"labels":[],"label_agreement":null},{"id":"W3163723036","doi":"10.1016/j.physo.2021.100074","title":"Assessing the credibility of the solutions of incomplete-data inverse problems","year":2021,"lang":"en","type":"article","venue":"Physics Open","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Measure (data warehouse); Credibility; Missing data; Computer science; Inverse problem; Fidelity; Set (abstract data type); Residual; Data mining; Mathematical optimization; Data set; Algorithm; Noise (video); Quality (philosophy); Complete information; Solution set; Trustworthiness; Mathematics; Image (mathematics); Artificial intelligence; Machine learning","score_opus":0.24535907008719043,"score_gpt":0.3492184741519134,"score_spread":0.103859404064723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163723036","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0890936,0.0006248986,0.9078528,0.00043671552,0.00004359112,0.000076365344,0.00010262018,0.000131448,0.0016379145],"genre_scores_gemma":[0.7550585,0.0006064513,0.2430447,0.00010725875,0.000113483096,0.00012071933,0.00032622626,0.00009648597,0.00052609044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98973584,0.0035252103,0.00072600035,0.0010297478,0.0046828333,0.00030044836],"domain_scores_gemma":[0.9092016,0.07167698,0.007134234,0.0043740063,0.0066332105,0.0009800039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019162312,0.0011871703,0.001836178,0.0055906675,0.00091099646,0.0026086248,0.0017947553,0.0037060273,0.0011099355],"category_scores_gemma":[0.10852074,0.00067824026,0.00088812516,0.0013163253,0.0044484683,0.004080883,0.0033265185,0.0020605538,0.00022694425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065568223,0.00014124806,0.0117623685,0.0008604141,0.00035700353,0.00036948788,0.00075559126,0.81026447,0.019005777,0.05999916,0.0006901083,0.09513873],"study_design_scores_gemma":[0.000039264643,0.00016298071,0.0035184904,0.00017707053,0.00004770363,0.00029116974,0.00025238635,0.93925756,0.012342769,0.042652983,0.0011644614,0.000093189476],"about_ca_topic_score_codex":0.0013033492,"about_ca_topic_score_gemma":0.0008489273,"teacher_disagreement_score":0.019162312,"about_ca_system_score_codex":0.0011414858,"about_ca_system_score_gemma":0.0015762285,"threshold_uncertainty_score":0.10134119},"labels":[],"label_agreement":null},{"id":"W3165062058","doi":"10.48550/arxiv.2105.10341","title":"Error Resilient Collaborative Intelligence via Low-Rank Tensor Completion","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rank (graph theory); Tensor (intrinsic definition); Computer science; Completion (oil and gas wells); Psychology; Mathematics; Combinatorics; Geology; Pure mathematics","score_opus":0.05890978508170834,"score_gpt":0.19749220981607404,"score_spread":0.13858242473436572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165062058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026292734,0.00039868028,0.96919626,0.00063125096,0.00007769816,0.000052138013,0.00011967016,0.0010365989,0.0021948717],"genre_scores_gemma":[0.6513644,0.0005155916,0.34209448,0.00033205812,0.00019246002,0.00011075346,0.0006899351,0.0002150272,0.004485278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979784,0.00068985054,0.00010099915,0.00036994935,0.0006475579,0.00021324807],"domain_scores_gemma":[0.99476886,0.0024043862,0.00058761134,0.0011267794,0.0008086259,0.00030379076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003224269,0.001924679,0.0014984652,0.00083293504,0.00076268846,0.0015599843,0.0015785001,0.0015705746,0.0022015593],"category_scores_gemma":[0.013204492,0.00062544504,0.00083565427,0.0011622781,0.0021508571,0.0031300427,0.0024291328,0.003010336,0.0008249473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038291205,0.00014449564,0.00094269955,0.00014302511,0.000107364685,0.00013774096,0.00017328997,0.8616571,0.0050371788,0.022466509,0.0052768793,0.103530765],"study_design_scores_gemma":[0.000009903804,0.000028752598,0.00006230714,0.00000373917,0.000004239682,0.000014608161,0.0000114729355,0.9927452,0.0010194833,0.0058193156,0.00027479013,0.0000061865644],"about_ca_topic_score_codex":0.01102764,"about_ca_topic_score_gemma":0.0093799895,"teacher_disagreement_score":0.01102764,"about_ca_system_score_codex":0.0009984509,"about_ca_system_score_gemma":0.002281395,"threshold_uncertainty_score":0.02192688},"labels":[],"label_agreement":null},{"id":"W3166436955","doi":"10.48550/arxiv.2106.01642","title":"Projection-free Graph-based Classifier Learning using Gershgorin Disc Perfect Alignment","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Laplacian matrix; Combinatorics; Spectral graph theory; Mathematics; Laplace operator; Time complexity; Binary number; Discrete mathematics; Algorithm; Graph; Line graph; Mathematical analysis; Voltage graph","score_opus":0.08476641113906055,"score_gpt":0.1886269348445832,"score_spread":0.10386052370552265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166436955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057753655,0.000117243624,0.9919641,0.00021791065,0.00003097482,0.000049160128,0.000054685774,0.0008145278,0.0009760914],"genre_scores_gemma":[0.28137237,0.00023763643,0.7112979,0.0004889902,0.00011913268,0.000427025,0.00087605586,0.0004664649,0.004714363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987587,0.00043697716,0.00004993352,0.00036722954,0.00026122903,0.00012601106],"domain_scores_gemma":[0.99811745,0.0010862182,0.00017182124,0.00022173488,0.00028058907,0.00012227322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014963142,0.0017905844,0.002476935,0.00092281785,0.00081159436,0.0015673566,0.0023284215,0.002359507,0.0047643348],"category_scores_gemma":[0.004893693,0.00096115103,0.001146118,0.0012880898,0.0015819044,0.0027657223,0.0025029238,0.003194303,0.0018792418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019830212,0.00017421221,0.00066938007,0.00022976536,0.000097084354,0.0001886565,0.00021287214,0.6441976,0.0033868307,0.04753676,0.008965273,0.29414326],"study_design_scores_gemma":[0.00000997415,0.000024809577,0.00002686272,0.0000048435204,0.0000037003317,0.000016727485,0.0000098528635,0.9855605,0.00033307815,0.013550267,0.00045465818,0.0000046660602],"about_ca_topic_score_codex":0.004614563,"about_ca_topic_score_gemma":0.0047464855,"teacher_disagreement_score":0.0047643348,"about_ca_system_score_codex":0.0011801275,"about_ca_system_score_gemma":0.0023632005,"threshold_uncertainty_score":0.015938342},"labels":[],"label_agreement":null},{"id":"W3167405701","doi":"10.11159/cdsr21.004","title":"Throughput Optimization for Grant-Free Multiple Access withMultiagent Deep Reinforcement Learning","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Conference of Control, Dynamic systems, and Robotics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reinforcement learning; Throughput; Computer science; Artificial intelligence; Telecommunications; Wireless","score_opus":0.02704061598207945,"score_gpt":0.24928394651158675,"score_spread":0.2222433305295073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167405701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0625272,0.00042516485,0.93287563,0.00063888653,0.000066757646,0.000058701266,0.0000730788,0.00034446365,0.0029901164],"genre_scores_gemma":[0.9785502,0.000086478874,0.019580984,0.00010871715,0.000021467127,0.000054625034,0.00003521366,0.000023305858,0.0015389863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999331,0.0002134483,0.000024532617,0.0001293521,0.0001401129,0.00016156392],"domain_scores_gemma":[0.9979005,0.0014285118,0.00022739836,0.00008293897,0.00023959325,0.00012104074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016069822,0.0008592727,0.0010146087,0.00029823612,0.0004203385,0.00067868934,0.0009326324,0.0008481923,0.0019201564],"category_scores_gemma":[0.004332148,0.0003863867,0.00031115793,0.0003229906,0.0012106022,0.001092369,0.0011179545,0.0014521173,0.0001830661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700211,0.000040087045,0.00035428334,0.000029126673,0.00001675906,0.000039762606,0.000028197444,0.9822655,0.0007433346,0.0050211805,0.00053124997,0.010863524],"study_design_scores_gemma":[0.0000049969976,0.000010447036,0.000026513115,0.0000012081346,0.0000016167614,0.000003076099,0.000002348767,0.9980825,0.000106843174,0.001715181,0.000043839318,0.0000013908104],"about_ca_topic_score_codex":0.0062354654,"about_ca_topic_score_gemma":0.005884641,"teacher_disagreement_score":0.0062354654,"about_ca_system_score_codex":0.001588613,"about_ca_system_score_gemma":0.0016728203,"threshold_uncertainty_score":0.012398362},"labels":[],"label_agreement":null},{"id":"W3167491798","doi":"10.1137/21m142770x","title":"Cardinality Minimization, Constraints, and Regularization: A Survey","year":2024,"lang":"en","type":"article","venue":"SIAM Review","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Heuristics; Mathematical optimization; Computer science; Cardinality (data modeling); Optimization problem; Regularization (linguistics); Heuristic; Artificial intelligence; Mathematics; Data mining","score_opus":0.0255494190593833,"score_gpt":0.2670797596569132,"score_spread":0.24153034059752992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167491798","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003056147,0.25838336,0.7014711,0.005808199,0.00080906955,0.00008786443,0.00037148246,0.00026940517,0.0297434],"genre_scores_gemma":[0.07524259,0.5774056,0.32684988,0.0025281885,0.0059040505,0.0003739816,0.001011358,0.0004851535,0.010199231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774456,0.0007844575,0.00017018265,0.0004220268,0.0007782288,0.00010051326],"domain_scores_gemma":[0.9948119,0.0040655704,0.00024961645,0.00037313142,0.00041130313,0.00008853339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034429333,0.0020064015,0.0020788547,0.0024014441,0.00075672125,0.00332542,0.0017888254,0.0025478788,0.0047442676],"category_scores_gemma":[0.007344032,0.0010729388,0.0016014408,0.0062589375,0.0021542646,0.0040152483,0.0017931517,0.004107859,0.0015780607],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004904988,0.0001772035,0.0011017667,0.0042313086,0.00018259122,0.00014530019,0.00016812254,0.07205589,0.0011693423,0.4679534,0.032752495,0.4200134],"study_design_scores_gemma":[0.000030159727,0.00012537141,0.0010355129,0.0022842332,0.00010867036,0.0008870162,0.00020568314,0.17669591,0.0017004078,0.5501153,0.26669148,0.00012022406],"about_ca_topic_score_codex":0.0019003974,"about_ca_topic_score_gemma":0.0017468352,"teacher_disagreement_score":0.0047442676,"about_ca_system_score_codex":0.0013782063,"about_ca_system_score_gemma":0.0018486134,"threshold_uncertainty_score":0.018208146},"labels":[],"label_agreement":null},{"id":"W3174661081","doi":"10.1007/s11228-021-00591-3","title":"Variational Analysis Perspective on Linear Convergence of Some First Order Methods for Nonsmooth Convex Optimization Problems","year":2021,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Metric (unit); Lasso (programming language); Rate of convergence; Convergence (economics); Calmness; Mathematical optimization; Applied mathematics; Convex function; Convex optimization; Rank (graph theory); Regular polygon; Computer science; Combinatorics","score_opus":0.02273572245229764,"score_gpt":0.31270713313180887,"score_spread":0.2899714106795112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174661081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003288958,0.0024028716,0.97747254,0.002323345,0.0003348641,0.00003410733,0.00007573662,0.000051075775,0.014016442],"genre_scores_gemma":[0.37378663,0.011154657,0.5469011,0.0023522615,0.0026636356,0.0005672784,0.00038765575,0.0006846921,0.061502036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980385,0.0010976135,0.00007368855,0.00021032996,0.0004726599,0.00010730859],"domain_scores_gemma":[0.99349314,0.0047674207,0.00028652998,0.00024342077,0.00095264195,0.00025686264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064568054,0.002026437,0.0014909245,0.002121284,0.0009419471,0.0028505467,0.002325687,0.00229253,0.0042038844],"category_scores_gemma":[0.0112396,0.0008742156,0.0023878373,0.0012062191,0.0049534733,0.0032926274,0.00324801,0.007051108,0.0005017208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017277993,0.00001965162,0.00008726438,0.00014268953,0.000033482862,0.000033038694,0.00012681705,0.032914758,0.0012337614,0.9590401,0.0013527243,0.0049984143],"study_design_scores_gemma":[0.00001118952,0.000056518355,0.00017098297,0.00007064094,0.000025474601,0.00006733994,0.00005588041,0.5151698,0.0008298542,0.47662547,0.0068882187,0.000028529328],"about_ca_topic_score_codex":0.004938203,"about_ca_topic_score_gemma":0.0029285385,"teacher_disagreement_score":0.0064568054,"about_ca_system_score_codex":0.0027383508,"about_ca_system_score_gemma":0.0019846314,"threshold_uncertainty_score":0.034147263},"labels":[],"label_agreement":null},{"id":"W3175766066","doi":"10.1109/i2mtc50364.2021.9459978","title":"Recovery of Noisy Compressively Sensed Speech via Regularized Maximum Feasible Subsystem Algorithm","year":2021,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Algorithm; Computer science; Pipeline (software); Additive white Gaussian noise; Gaussian; Speech recognition; White noise; Telecommunications","score_opus":0.01266091521768447,"score_gpt":0.21096143047208624,"score_spread":0.19830051525440176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175766066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016432358,0.000052841693,0.98237073,0.000069100875,0.000007175585,0.000023963845,0.000034909077,0.00048671744,0.0005222809],"genre_scores_gemma":[0.1832251,0.00010135497,0.8139738,0.000072784394,0.000017544988,0.00008751003,0.00027116673,0.00008009736,0.0021705984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996947,0.000098035394,0.000019735227,0.000048520767,0.00011256913,0.000026349582],"domain_scores_gemma":[0.99948454,0.00025924723,0.00005662607,0.00008198921,0.000098239754,0.000019246161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007248005,0.0007751029,0.00053994596,0.00043428843,0.00027749018,0.00041022841,0.0006817666,0.0007230661,0.0016818782],"category_scores_gemma":[0.0020067778,0.0003339193,0.00045949532,0.0004940529,0.00050679484,0.0009965877,0.0008229931,0.00063861324,0.0005384994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007521825,0.00009371303,0.00086922816,0.0001978152,0.00007035126,0.00017956115,0.00033030257,0.43908903,0.084225625,0.018518172,0.002822653,0.45285133],"study_design_scores_gemma":[0.000012755146,0.000050004466,0.00011971734,0.0000041703684,0.0000043616064,0.00002795684,0.000012406967,0.9889214,0.008586048,0.0016662966,0.0005874652,0.0000074365985],"about_ca_topic_score_codex":0.0021933266,"about_ca_topic_score_gemma":0.0031790046,"teacher_disagreement_score":0.0021933266,"about_ca_system_score_codex":0.00027847028,"about_ca_system_score_gemma":0.0009407883,"threshold_uncertainty_score":0.0056263804},"labels":[],"label_agreement":null},{"id":"W3177126889","doi":"10.1109/cvpr46437.2021.01598","title":"Memory-Efficient Network for Large-scale Video Compressive Sensing","year":2021,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Snapshot (computer storage); Artificial intelligence; Convolutional neural network; Deep learning; Computer vision; Grayscale; Compressed sensing; Pixel","score_opus":0.013304624689560412,"score_gpt":0.2332690153180525,"score_spread":0.21996439062849207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177126889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018077318,0.00040885535,0.97781676,0.00027653418,0.000046607995,0.000031902233,0.00016041077,0.00087352627,0.0023081356],"genre_scores_gemma":[0.6910086,0.0006548189,0.29993337,0.00024803213,0.00008767673,0.00021535209,0.00067205273,0.00013398257,0.0070460853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99987507,0.000020575655,0.0000057996685,0.000034476376,0.000041412546,0.000022638316],"domain_scores_gemma":[0.99973685,0.000113735216,0.00003744967,0.0000442455,0.000052815023,0.000014984562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035085392,0.0006866294,0.00043255006,0.00028319698,0.0002401984,0.00039379532,0.0012375808,0.0006904527,0.0018580173],"category_scores_gemma":[0.0012598754,0.00031113275,0.0003378259,0.0004253148,0.00058528635,0.0009835154,0.0007544678,0.0011143734,0.00046899772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010210386,0.00005131432,0.00049356575,0.00007521361,0.000040756433,0.00007802815,0.000037946662,0.8750716,0.0090899365,0.017436428,0.0028924644,0.09463062],"study_design_scores_gemma":[0.0000022041027,0.0000087837225,0.00003973434,0.0000023404446,0.0000027163926,0.000008042367,0.0000020412185,0.9966338,0.0009909641,0.0020152733,0.00029158546,0.000002559568],"about_ca_topic_score_codex":0.006349668,"about_ca_topic_score_gemma":0.010617525,"teacher_disagreement_score":0.006349668,"about_ca_system_score_codex":0.0008343995,"about_ca_system_score_gemma":0.0007214487,"threshold_uncertainty_score":0.012625456},"labels":[],"label_agreement":null},{"id":"W3178524047","doi":"10.48550/arxiv.2006.11355","title":"Certifying clusters from sum-of-norms clustering","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Multiplicative function; Mathematical optimization; Mathematics; Subgradient method; Algorithm; Computer science; Statistics","score_opus":0.10980248055051443,"score_gpt":0.18776569249779035,"score_spread":0.07796321194727591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178524047","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027744126,0.000089680325,0.9691765,0.00028108628,0.00003540719,0.00005814001,0.0000783699,0.00054031005,0.0019964715],"genre_scores_gemma":[0.5437795,0.00015824528,0.45219842,0.00023116056,0.000058251673,0.00015247063,0.00070949434,0.0004991997,0.0022132953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955611,0.0014116395,0.00023270393,0.0007336778,0.0017664487,0.00029434013],"domain_scores_gemma":[0.98190683,0.007541776,0.0016497585,0.004700707,0.0037202605,0.00048065642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050938,0.0011244976,0.0011384289,0.0013082542,0.0010763264,0.0019685782,0.0021298442,0.0018865417,0.0018175634],"category_scores_gemma":[0.039759856,0.0006795595,0.00078594976,0.0011514818,0.0032549223,0.0030974494,0.0040149298,0.0029983192,0.00082909095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005788747,0.000106976135,0.0036017525,0.00023193876,0.00010154497,0.00023991619,0.0005171299,0.7358361,0.013976206,0.10755067,0.0055865743,0.13167231],"study_design_scores_gemma":[0.000015641992,0.000050198072,0.0003067875,0.000017948996,0.000005700044,0.000075285905,0.000067877445,0.95643365,0.008667595,0.033463303,0.0008757284,0.000020245137],"about_ca_topic_score_codex":0.0022844165,"about_ca_topic_score_gemma":0.0020100225,"teacher_disagreement_score":0.0050938,"about_ca_system_score_codex":0.0011885518,"about_ca_system_score_gemma":0.0022202241,"threshold_uncertainty_score":0.026938915},"labels":[],"label_agreement":null},{"id":"W3181499577","doi":"10.1109/memea52024.2021.9478680","title":"Efficient Compressive Sensing of Biomedical Signals Using A Permuted Kronecker-based Sparse Measurement Matrix","year":2021,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Sparse matrix; Computer science; Kronecker delta; Matrix (chemical analysis); Algorithm; Sparse approximation; SIGNAL (programming language); Signal reconstruction; Gaussian; Signal processing; Computer hardware; Materials science; Physics","score_opus":0.04844993362246254,"score_gpt":0.2720529937628468,"score_spread":0.22360306014038428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181499577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008946116,0.00016617587,0.9896119,0.00014983602,0.000037108104,0.000031396736,0.00007537304,0.00015293648,0.0008291597],"genre_scores_gemma":[0.21259055,0.0008138626,0.7831004,0.00020025867,0.00009911198,0.0001278784,0.0004235605,0.00005536419,0.0025889638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.0002137402,0.000044123306,0.000092892726,0.00024124455,0.000029445486],"domain_scores_gemma":[0.9988391,0.00056383427,0.00011571318,0.00021580188,0.00022493515,0.00004058631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008059826,0.00060417014,0.00047237668,0.00052706554,0.00022229805,0.0006038573,0.00053077785,0.00059129484,0.0015763148],"category_scores_gemma":[0.003199477,0.00025066812,0.00042879724,0.00077570806,0.00069381564,0.0011009806,0.00077586074,0.00077274436,0.0006100482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040952733,0.00014693162,0.001061917,0.0004023052,0.000101560094,0.00035508693,0.00022072652,0.40347463,0.15954964,0.07776862,0.004370202,0.3521388],"study_design_scores_gemma":[0.00001672248,0.00012742745,0.00033879097,0.000016991104,0.000014533359,0.0002670285,0.000026954829,0.9700655,0.017788708,0.008461354,0.002850948,0.000025069925],"about_ca_topic_score_codex":0.0011313274,"about_ca_topic_score_gemma":0.0017035187,"teacher_disagreement_score":0.0015763148,"about_ca_system_score_codex":0.00026613916,"about_ca_system_score_gemma":0.0008381152,"threshold_uncertainty_score":0.0052732825},"labels":[],"label_agreement":null},{"id":"W3186634001","doi":"10.1017/9781108377447","title":"Compressive Imaging: Structure, Sampling, Learning","year":2021,"lang":"en","type":"book","venue":"Cambridge University Press eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compressed sensing; Computer science; Artificial intelligence; Medical imaging; Iterative reconstruction; Wavelet; Data science; Computer vision","score_opus":0.017367355184713256,"score_gpt":0.1993528557156229,"score_spread":0.18198550053090964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186634001","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002118333,0.122318596,0.68859404,0.0066595306,0.0035848725,0.0001209357,0.00091415946,0.0017379657,0.17395161],"genre_scores_gemma":[0.053460144,0.22468786,0.43930814,0.0027798652,0.00893917,0.0004462238,0.0023642061,0.0011971655,0.2668172],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993975,0.00008598418,0.000017847413,0.000081901504,0.00039664665,0.000020135934],"domain_scores_gemma":[0.999388,0.00035151202,0.00002628709,0.00009041693,0.0001136835,0.000030054947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005893661,0.0012424936,0.0009273156,0.001368022,0.00044115726,0.002575853,0.0010969694,0.0014089382,0.016273262],"category_scores_gemma":[0.0019926443,0.00059465814,0.00037406047,0.0026228465,0.0020196722,0.003073512,0.0014411933,0.0024513751,0.010594629],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038916893,0.000027095244,0.00014692657,0.001000423,0.000030583116,0.00010417282,0.0001939819,0.013380103,0.0046345065,0.27165094,0.1480148,0.56077754],"study_design_scores_gemma":[0.000012903328,0.000054928205,0.00037669548,0.0005035073,0.000014412148,0.00064125686,0.0000885835,0.034949604,0.0026282393,0.3106073,0.6500766,0.000046045523],"about_ca_topic_score_codex":0.0009498775,"about_ca_topic_score_gemma":0.001308658,"teacher_disagreement_score":0.016273262,"about_ca_system_score_codex":0.0006619065,"about_ca_system_score_gemma":0.0008569293,"threshold_uncertainty_score":0.054439485},"labels":[],"label_agreement":null},{"id":"W3187500109","doi":"10.1002/cjs.11631","title":"Recovery of sums of sparse and dense signals by incorporating graphical structure among predictors","year":2021,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Information and Intelligent Systems; Division of Mathematical Sciences; National Institute of General Medical Sciences","keywords":"Estimator; Regularization (linguistics); Computer science; Graphical model; Algorithm; SIGNAL (programming language); Sparse matrix; Sparse approximation; Compressed sensing; Artificial intelligence; Mathematics; Statistics","score_opus":0.007944128786387587,"score_gpt":0.18399182492719085,"score_spread":0.17604769614080326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187500109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061945734,0.00008287128,0.99313724,0.00011113053,0.000014362754,0.0000125189845,0.000025645457,0.000091004404,0.00033069385],"genre_scores_gemma":[0.40513548,0.0006089637,0.5905134,0.0002819431,0.00014379193,0.00013103733,0.0004123037,0.0001237989,0.0026492963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903774,0.00045727738,0.000040059735,0.00017225281,0.00022365613,0.00006913087],"domain_scores_gemma":[0.9958935,0.0029672056,0.00043447484,0.00036520543,0.00022557234,0.00011397791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002262726,0.0013054177,0.0010535612,0.0009002185,0.00036793895,0.0010127713,0.0011484677,0.0011014652,0.001031031],"category_scores_gemma":[0.008320385,0.00070462556,0.0010235747,0.0010629522,0.0014245001,0.0017620199,0.0020571786,0.001970675,0.0003506137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001559109,0.0000702661,0.0014477107,0.00018306433,0.00011793961,0.0002225008,0.00015158775,0.83284235,0.009647306,0.073271245,0.0017323795,0.0801578],"study_design_scores_gemma":[0.0000065902123,0.00001771126,0.00012126163,0.0000064064566,0.000007271078,0.000030876643,0.000008037197,0.98698205,0.00064073486,0.011848646,0.00032205455,0.000008259099],"about_ca_topic_score_codex":0.0016558621,"about_ca_topic_score_gemma":0.0021155141,"teacher_disagreement_score":0.002262726,"about_ca_system_score_codex":0.0004097772,"about_ca_system_score_gemma":0.0009346045,"threshold_uncertainty_score":0.011966586},"labels":[],"label_agreement":null},{"id":"W3188492639","doi":"10.1142/9789811266140_0003","title":"Mean-field Particle Swarm Optimization","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes series, Institute For Mathematical Sciences","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Particle swarm optimization; Metaheuristic; Limit (mathematics); Mathematical optimization; Applied mathematics; Mathematics; Inertia; Convergence (economics); Field (mathematics); Computer science; Mathematical analysis; Physics; Classical mechanics","score_opus":0.0444219463271831,"score_gpt":0.25748432792288595,"score_spread":0.21306238159570284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188492639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033498195,0.0049013197,0.9770777,0.00053177576,0.0003455864,0.000028804401,0.00007089785,0.000141587,0.013552461],"genre_scores_gemma":[0.26912594,0.01997199,0.6428106,0.00092678564,0.0012102737,0.00037964628,0.00075948343,0.00029606145,0.064519234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998053,0.000055667595,0.000008200907,0.000039663675,0.000077632074,0.000013567819],"domain_scores_gemma":[0.99981827,0.00010476225,0.000016398591,0.000017431807,0.00003160143,0.000011567984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042915792,0.00081381586,0.0008053991,0.00037674455,0.00027887573,0.00091840397,0.0008402334,0.00113832,0.0029708163],"category_scores_gemma":[0.0010740745,0.0002780686,0.0004974081,0.00065392803,0.00056656136,0.0009466693,0.0007947645,0.0009872048,0.0010223283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003293089,0.000041099047,0.00028929813,0.00034989906,0.00005901608,0.00007410398,0.000060921222,0.6797409,0.0022295038,0.19848008,0.011847934,0.10679421],"study_design_scores_gemma":[0.000008535033,0.000024784189,0.000107032734,0.000030742107,0.000007705885,0.000038109214,0.000008715821,0.921383,0.00038697943,0.06019936,0.017795967,0.000009006997],"about_ca_topic_score_codex":0.000941072,"about_ca_topic_score_gemma":0.00078840903,"teacher_disagreement_score":0.0029708163,"about_ca_system_score_codex":0.000380685,"about_ca_system_score_gemma":0.00047564277,"threshold_uncertainty_score":0.009938359},"labels":[],"label_agreement":null},{"id":"W3191173744","doi":"10.36227/techrxiv.15086277.v1","title":"A Unified Study on L1 over L2 Minimization","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Key Research and Development Program of China; University at Albany; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Convergence (economics); Mathematics; Projection (relational algebra); Applied mathematics; Constraint (computer-aided design); Matrix (chemical analysis); Algorithm; Operator (biology); Minification; Property (philosophy); Mathematical optimization; Set (abstract data type); Computer science; Geometry","score_opus":0.03189273585274311,"score_gpt":0.26697948308106234,"score_spread":0.23508674722831924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191173744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052568032,0.005100684,0.9747959,0.0020351636,0.00026307063,0.000028865514,0.000100810896,0.000068669346,0.012349973],"genre_scores_gemma":[0.47932246,0.03187585,0.44222584,0.0047396403,0.0042468086,0.00045934992,0.0007615567,0.001096925,0.035271622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750274,0.0012992447,0.00011069159,0.00046764867,0.00044039503,0.00017916372],"domain_scores_gemma":[0.9961739,0.002399195,0.0003283164,0.0003541196,0.00054200576,0.0002024592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051742312,0.0020905838,0.0011908659,0.0011723756,0.000681843,0.0019632762,0.0015368016,0.0020011447,0.0039468426],"category_scores_gemma":[0.009923354,0.00067534513,0.0017019412,0.001475284,0.002362517,0.0049064998,0.0035255637,0.0035785337,0.00081434764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089683774,0.00007715197,0.0009818188,0.0008146059,0.00011092701,0.00030641776,0.0002943485,0.119372584,0.004440122,0.8235233,0.009099646,0.04088948],"study_design_scores_gemma":[0.000014195757,0.00016601154,0.00030712254,0.00013530368,0.000052668198,0.00030602526,0.000088293185,0.78413004,0.0018113474,0.19998308,0.012961659,0.000044279008],"about_ca_topic_score_codex":0.0021472096,"about_ca_topic_score_gemma":0.0014386771,"teacher_disagreement_score":0.0051742312,"about_ca_system_score_codex":0.0013525435,"about_ca_system_score_gemma":0.0013310107,"threshold_uncertainty_score":0.027364314},"labels":[],"label_agreement":null},{"id":"W3195752840","doi":"10.1109/tcomm.2021.3107582","title":"Nonconvex Regularized Gradient Projection Sparse Reconstruction for Massive MIMO Channel Estimation","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; MIMO; Stiefel manifold; Benchmark (surveying); Rate of convergence; Convergence (economics); Mathematics; Channel (broadcasting); Norm (philosophy); Projection (relational algebra); Compressed sensing; Computer science; Mathematical optimization","score_opus":0.041401377492737014,"score_gpt":0.2680507651052697,"score_spread":0.2266493876125327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195752840","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021795442,0.00006398038,0.99707913,0.000057068042,0.000013640668,0.000012877682,0.000018421199,0.00015788534,0.0004175014],"genre_scores_gemma":[0.15770435,0.00047163188,0.83817744,0.00014253239,0.00008114616,0.00013696714,0.00027751338,0.00012720803,0.0028811675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961567,0.00012916273,0.000014144205,0.000055471835,0.00014860275,0.000036841477],"domain_scores_gemma":[0.99937207,0.00028199021,0.000080102305,0.000093080926,0.00013919981,0.000033619788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067286624,0.0010263382,0.0007711466,0.00042282254,0.0002688922,0.0006777463,0.00091324915,0.00082493044,0.0014063905],"category_scores_gemma":[0.0021774305,0.0004378185,0.0006193639,0.00077875477,0.0005668419,0.0010235197,0.0010671909,0.0014395501,0.0006013391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015253035,0.00006484685,0.0005642162,0.00016508387,0.000071633876,0.00013343527,0.00011897601,0.73747617,0.012309151,0.03648173,0.0047590267,0.20770317],"study_design_scores_gemma":[0.0000048030174,0.000012640298,0.00003182268,0.000003063375,0.0000023116445,0.000020977157,0.000004738964,0.9960978,0.0012322601,0.0020753362,0.00050986675,0.0000043778664],"about_ca_topic_score_codex":0.0019516319,"about_ca_topic_score_gemma":0.0025671427,"teacher_disagreement_score":0.0019516319,"about_ca_system_score_codex":0.0003463685,"about_ca_system_score_gemma":0.0010707822,"threshold_uncertainty_score":0.0047048926},"labels":[],"label_agreement":null},{"id":"W3196804222","doi":"10.1109/lcomm.2021.3107897","title":"Topological Interference Management With Inaccurate Topology of Network","year":2021,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Topology (electrical circuits); Network topology; Rank (graph theory); Interference (communication); Computer science; Matrix (chemical analysis); Extension topology; Logical topology; Low-rank approximation; General topology; Mathematics; Algorithm; Computer network; Discrete mathematics; Topological space; Combinatorics","score_opus":0.032734349991414315,"score_gpt":0.25835366550823,"score_spread":0.22561931551681572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196804222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05242221,0.00029279938,0.9436114,0.00046378732,0.000047791073,0.000022102615,0.000036744943,0.00014148567,0.0029616593],"genre_scores_gemma":[0.9588311,0.00021127712,0.039957996,0.000096581396,0.000044119028,0.000039081144,0.000052049654,0.000021710524,0.0007461609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990754,0.00036004646,0.0000255047,0.0001089579,0.00029158563,0.00013854814],"domain_scores_gemma":[0.9975852,0.0014184208,0.00038518469,0.00026451616,0.00026175953,0.00008489987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013384115,0.00062510686,0.00053776876,0.00042784202,0.000565809,0.00092443795,0.0010840694,0.00081589684,0.0007045839],"category_scores_gemma":[0.0061559663,0.00021081208,0.00026320218,0.00067468546,0.0011554587,0.002350984,0.0014799619,0.00097435666,0.00016113228],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010197261,0.000025094063,0.0008944144,0.00006898983,0.000025920626,0.00023390297,0.00011880675,0.9281279,0.005230247,0.03816408,0.0007626686,0.026245978],"study_design_scores_gemma":[0.0000047309727,0.000029242523,0.000105944106,0.0000036766298,0.000005061575,0.000051285628,0.00003560864,0.9906234,0.0012605638,0.007597727,0.00027623327,0.000006466837],"about_ca_topic_score_codex":0.0010457459,"about_ca_topic_score_gemma":0.0008785567,"teacher_disagreement_score":0.0013384115,"about_ca_system_score_codex":0.0006837448,"about_ca_system_score_gemma":0.0005049177,"threshold_uncertainty_score":0.0070782304},"labels":[],"label_agreement":null},{"id":"W3196996197","doi":"10.1109/isit45174.2021.9518096","title":"Construction of binary matrices for near-optimal compressed sensing","year":2021,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compressed sensing; Randomness; Binary number; Scheme (mathematics); Computer science; Algorithm; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.0142332588399493,"score_gpt":0.23131317693681253,"score_spread":0.21707991809686322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196996197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008684539,0.00012414267,0.9875437,0.0004939663,0.00007453992,0.00008620098,0.000115203664,0.000311691,0.0025659895],"genre_scores_gemma":[0.32659307,0.00023463341,0.66893107,0.0005670717,0.00013863281,0.00037571465,0.00035133102,0.00012952078,0.002678914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966786,0.0010434501,0.00017771781,0.0005552662,0.0012689435,0.000276076],"domain_scores_gemma":[0.9951197,0.0021185034,0.00052909675,0.0014213447,0.0005543422,0.0002570551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021061662,0.0008291711,0.0007346233,0.0008330065,0.0008131802,0.001142596,0.0010108087,0.001365753,0.0032192522],"category_scores_gemma":[0.01214614,0.0005414689,0.0004989944,0.00096906524,0.0021542574,0.002549241,0.0037295243,0.0026893318,0.0009540347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004459035,0.00013221182,0.0005457406,0.00020728513,0.00003158342,0.00015299821,0.00031748196,0.06537311,0.044831313,0.76182824,0.004987415,0.121146694],"study_design_scores_gemma":[0.00017439348,0.00029824555,0.00041668184,0.00007477273,0.000018333303,0.0003886959,0.00008958209,0.47292882,0.04850841,0.464474,0.012524489,0.00010359783],"about_ca_topic_score_codex":0.00043055054,"about_ca_topic_score_gemma":0.0005399774,"teacher_disagreement_score":0.0032192522,"about_ca_system_score_codex":0.00086306414,"about_ca_system_score_gemma":0.0010907473,"threshold_uncertainty_score":0.011138558},"labels":[],"label_agreement":null},{"id":"W3200188349","doi":"10.1214/21-ejs1895","title":"Reduced rank regression with matrix projections for high-dimensional multivariate linear regression model","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Bayesian multivariate linear regression; Rank (graph theory); Statistics; Estimator; Linear regression; Multivariate statistics; Consistency (knowledge bases); Data Matrix; Proper linear model; Regression analysis; Linear model; Projection (relational algebra); Matrix (chemical analysis); General linear model; Algorithm; Combinatorics","score_opus":0.01504217430550025,"score_gpt":0.28251106188270353,"score_spread":0.2674688875772033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200188349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018729226,0.00016616944,0.9974891,0.000081198814,0.000013183432,0.000010128042,0.000025882111,0.00007829239,0.00026302497],"genre_scores_gemma":[0.23003675,0.002477598,0.7609389,0.00031640654,0.00030085724,0.00023606652,0.0005840134,0.00019648003,0.0049128914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982559,0.00091086986,0.00005450946,0.00026885027,0.0004256558,0.00008423683],"domain_scores_gemma":[0.9973436,0.0015165142,0.000323401,0.0003438058,0.00041469195,0.00005800677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023443822,0.0011770967,0.0010921707,0.00064825587,0.0003859847,0.0009075765,0.0010609829,0.0011194363,0.0017167004],"category_scores_gemma":[0.007621783,0.00047824343,0.0009394219,0.0012455063,0.0009771475,0.0018771295,0.0010123994,0.0024137858,0.0010007699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013485865,0.00011513124,0.0016469877,0.00038118282,0.0001917322,0.0002333028,0.00014256754,0.73397017,0.00944607,0.0923643,0.0046602483,0.15671346],"study_design_scores_gemma":[0.000005864986,0.00002981714,0.00018006802,0.000009357521,0.000012517327,0.000050613107,0.000008234578,0.98785806,0.0010878952,0.009784146,0.0009589611,0.000014575477],"about_ca_topic_score_codex":0.0027378637,"about_ca_topic_score_gemma":0.0023806873,"teacher_disagreement_score":0.0027378637,"about_ca_system_score_codex":0.0004252811,"about_ca_system_score_gemma":0.0010664668,"threshold_uncertainty_score":0.012398422},"labels":[],"label_agreement":null},{"id":"W3200799295","doi":"10.1109/tci.2021.3113113","title":"One-Bit Radar Imaging Via Adaptive Binary Iterative Hard Thresholding","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Computational Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Quantization (signal processing); Computer science; Iterative reconstruction; Thresholding; Algorithm; Image quality; Radar imaging; Compressed sensing; Radar; Binary number; Artificial intelligence; Computer vision; Iterative method; Mathematics; Image (mathematics)","score_opus":0.022736821690244314,"score_gpt":0.24451580415188254,"score_spread":0.2217789824616382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200799295","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013295351,0.00021295524,0.98459435,0.000117976546,0.000030420948,0.000025521518,0.00002245943,0.00016481428,0.0015361516],"genre_scores_gemma":[0.25065938,0.0004145265,0.74565804,0.00019208361,0.000057909518,0.000065106564,0.000108483895,0.00006318438,0.0027813038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.000112028356,0.000037779133,0.000090520065,0.00027412508,0.00003529354],"domain_scores_gemma":[0.99924076,0.00030033232,0.00013211554,0.000119911834,0.00016874484,0.000038106067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000547686,0.0004459556,0.0004959095,0.00040344865,0.0002376935,0.000725503,0.0007084233,0.0006255375,0.0013213948],"category_scores_gemma":[0.0024860885,0.0002746151,0.0003145255,0.00058560044,0.00046013176,0.0012812762,0.0010916964,0.0008060618,0.0004044036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046311633,0.00011541485,0.001530344,0.00040915073,0.0000788969,0.00026381458,0.0004079231,0.14168473,0.17571597,0.036720302,0.0028019904,0.63980836],"study_design_scores_gemma":[0.000030231371,0.000113042195,0.00038963463,0.000026118645,0.000019865718,0.00039501596,0.000031257154,0.9507896,0.038376857,0.007307155,0.0024895687,0.000031697495],"about_ca_topic_score_codex":0.0006697579,"about_ca_topic_score_gemma":0.00093799573,"teacher_disagreement_score":0.0013213948,"about_ca_system_score_codex":0.00022227029,"about_ca_system_score_gemma":0.00054994266,"threshold_uncertainty_score":0.004420519},"labels":[],"label_agreement":null},{"id":"W3204125689","doi":"10.18280/ts.380431","title":"Subsampled Circulant Matrix Based Wideband Spectrum Sensing Using Fusion Based Recovery Algorithm","year":2021,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wideband; Compressed sensing; Cognitive radio; Circulant matrix; Nyquist–Shannon sampling theorem; Computer science; Algorithm; Spectrum (functional analysis); Matrix (chemical analysis); Wireless; Electronic engineering; Telecommunications; Engineering; Computer vision; Physics","score_opus":0.020018359437916685,"score_gpt":0.2323971336567196,"score_spread":0.2123787742188029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204125689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011838081,0.0002080779,0.9866029,0.00009359095,0.000036544498,0.000027986549,0.000024090048,0.00019161028,0.0009771127],"genre_scores_gemma":[0.32932338,0.0004668724,0.66753453,0.00012462884,0.00008128709,0.00008741249,0.00015714348,0.000032226424,0.0021924619],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996216,0.00009504494,0.000019977904,0.00007287577,0.00016177667,0.00002859842],"domain_scores_gemma":[0.9994948,0.00022804596,0.00006568851,0.00006236642,0.00012764713,0.000021483464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047410777,0.0005799676,0.0007086327,0.00044497187,0.00029781362,0.00047091037,0.0005003845,0.0007570563,0.0010323712],"category_scores_gemma":[0.001665564,0.00018556003,0.00045134095,0.00065185415,0.00040315703,0.000783004,0.0005676657,0.0006690526,0.00034860426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051670085,0.00015634547,0.0008258505,0.00025115302,0.00009550801,0.00025446637,0.00022889102,0.38175312,0.09874734,0.028935056,0.0033118497,0.48492366],"study_design_scores_gemma":[0.00000995666,0.00007789152,0.00013889057,0.000007402761,0.000008913387,0.00012328361,0.000010948452,0.99037665,0.0067961365,0.0016009732,0.00083749904,0.0000114501145],"about_ca_topic_score_codex":0.001632035,"about_ca_topic_score_gemma":0.001581838,"teacher_disagreement_score":0.001632035,"about_ca_system_score_codex":0.00027373552,"about_ca_system_score_gemma":0.0006167928,"threshold_uncertainty_score":0.003453672},"labels":[],"label_agreement":null},{"id":"W3204926104","doi":"10.48550/arxiv.2110.01858","title":"KKT Conditions, First-Order and Second-Order Optimization, and Distributed Optimization: Tutorial and Survey","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Proximal Gradient Methods; Mathematical optimization; Subgradient method; Gradient descent; Gradient method; Nonlinear conjugate gradient method; Stochastic gradient descent; Mathematics; Optimization problem; Augmented Lagrangian method; Stochastic optimization; Conjugate gradient method; Constrained optimization; Line search; Lagrange multiplier; Convex optimization; Newton's method in optimization; Computer science; Local convergence; Regular polygon; Iterative method","score_opus":0.034910216003581726,"score_gpt":0.17470914568872006,"score_spread":0.13979892968513835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204926104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020252818,0.35965735,0.58214784,0.0031263528,0.0023826165,0.00007497213,0.0005067813,0.00060499046,0.049473874],"genre_scores_gemma":[0.07195285,0.6549483,0.23118897,0.0027383869,0.011757438,0.00049903605,0.0015447487,0.0009375389,0.02443271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989742,0.00026185764,0.00010072662,0.00025044772,0.00033576117,0.00007705028],"domain_scores_gemma":[0.998611,0.00097527145,0.000088112974,0.000116511175,0.00017296756,0.000036115103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018405523,0.0022719274,0.0022680385,0.0017915709,0.0005669111,0.002504548,0.001253504,0.0019153885,0.008944204],"category_scores_gemma":[0.0032894334,0.0010032277,0.0013250874,0.0043196976,0.0018434208,0.004662075,0.001378123,0.0039852574,0.0050573535],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070106216,0.00016616954,0.00066546246,0.004744511,0.00014119959,0.00026820888,0.00023590364,0.05077256,0.0016332528,0.51341814,0.08993004,0.33795452],"study_design_scores_gemma":[0.000025903482,0.00012856296,0.0010283624,0.0011508345,0.0000880351,0.00072972354,0.00012858048,0.12677151,0.0015084387,0.51522213,0.35310045,0.000117432144],"about_ca_topic_score_codex":0.0019204234,"about_ca_topic_score_gemma":0.0011486525,"teacher_disagreement_score":0.008944204,"about_ca_system_score_codex":0.001405446,"about_ca_system_score_gemma":0.0018935294,"threshold_uncertainty_score":0.029921353},"labels":[],"label_agreement":null},{"id":"W3207184872","doi":"10.1007/978-1-0716-0843-2_14","title":"Algorithms for General Convex Problems","year":2021,"lang":"en","type":"book-chapter","venue":"Texts in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Proper convex function; Variety (cybernetics); Regular polygon; Convex analysis; Mathematical optimization; Convex optimization; Computer science; Mathematics; Conic optimization; Convex function; Subderivative; Algorithm; Artificial intelligence","score_opus":0.036246008214931666,"score_gpt":0.2567250139113038,"score_spread":0.22047900569637213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207184872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073899084,0.009486167,0.84064347,0.0010796282,0.0013420298,0.00007098626,0.00043797411,0.001161594,0.14503913],"genre_scores_gemma":[0.024563877,0.021901246,0.6717662,0.0014727635,0.0023547232,0.0005662651,0.0022025194,0.0022764925,0.2728959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.00012065316,0.000026171228,0.00010179257,0.00027958475,0.000034098284],"domain_scores_gemma":[0.9992518,0.00038341084,0.000024238872,0.00018643995,0.00013244145,0.000021678738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006286015,0.0022564428,0.0013872822,0.0011983133,0.0005563227,0.0021696505,0.0013423439,0.001356737,0.042806838],"category_scores_gemma":[0.0028662495,0.00081467093,0.00086882873,0.0030204668,0.0011823953,0.0025149013,0.0016053856,0.0039555407,0.02805215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026156355,0.000051282175,0.0000554711,0.00039569262,0.000028361386,0.00004017384,0.00006946834,0.020723822,0.0014627348,0.3660694,0.1496731,0.46140435],"study_design_scores_gemma":[0.00002524645,0.00003287998,0.00021000493,0.00019529347,0.000018933384,0.00022086754,0.000036901063,0.09593365,0.0018374131,0.5254126,0.37604734,0.000028809236],"about_ca_topic_score_codex":0.00088553195,"about_ca_topic_score_gemma":0.0016554814,"teacher_disagreement_score":0.042806838,"about_ca_system_score_codex":0.0007608972,"about_ca_system_score_gemma":0.000801574,"threshold_uncertainty_score":0.14320314},"labels":[],"label_agreement":null},{"id":"W3208822704","doi":"10.1016/j.mri.2021.10.031","title":"Robust brain MR image compressive sensing via re-weighted total variation and sparse regression","year":2021,"lang":"en","type":"article","venue":"Magnetic Resonance Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Neurological Institute and Hospital","funders":"","keywords":"Compressed sensing; Computer science; Regularization (linguistics); Redundancy (engineering); Artificial intelligence; Imaging phantom; Similarity (geometry); Pattern recognition (psychology); Total variation denoising; Image (mathematics); Sparse approximation; Computer vision; Algorithm; Physics; Optics","score_opus":0.010963097211867851,"score_gpt":0.21421038601630352,"score_spread":0.20324728880443566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208822704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00337048,0.00023074701,0.9956482,0.0001520561,0.00002783806,0.00001285437,0.00004046013,0.00009819868,0.00041907874],"genre_scores_gemma":[0.26218057,0.001499578,0.7300277,0.0003112045,0.00027677795,0.0001483344,0.00057488127,0.00019281743,0.0047881743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994093,0.00019730524,0.000031825784,0.00011653228,0.00020674987,0.000038381168],"domain_scores_gemma":[0.9985436,0.0008147686,0.0001727874,0.0001911654,0.00023055694,0.00004700341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009789394,0.000974533,0.0009853805,0.00058092416,0.00022750189,0.0007477147,0.00096827204,0.0011142212,0.0011268792],"category_scores_gemma":[0.005539566,0.000501844,0.00065692264,0.00079351355,0.0009045601,0.0013142132,0.0013470671,0.001532571,0.0004273511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024763495,0.0001244646,0.0006296035,0.0003696486,0.00015947147,0.00016666293,0.00016652995,0.6001578,0.037750974,0.05336874,0.006587157,0.30027124],"study_design_scores_gemma":[0.0000059175854,0.000025811112,0.00012119775,0.000008155115,0.000009683922,0.00004961623,0.000009290937,0.98850656,0.0025717989,0.007748818,0.00093116536,0.000011984465],"about_ca_topic_score_codex":0.0022305874,"about_ca_topic_score_gemma":0.0028320167,"teacher_disagreement_score":0.0022305874,"about_ca_system_score_codex":0.00028353633,"about_ca_system_score_gemma":0.0007309316,"threshold_uncertainty_score":0.0051772},"labels":[],"label_agreement":null},{"id":"W3209514728","doi":"10.1002/cpa.22024","title":"<scp>Sub‐Gaussian</scp> Matrices on Sets: Optimal Tail Dependence and Applications","year":2021,"lang":"en","type":"article","venue":"Communications on Pure and Applied Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Restricted isometry property; Gaussian; Mathematics; Compressed sensing; Isometry (Riemannian geometry); Random matrix; Norm (philosophy); Gaussian process; Gaussian random field; Discrete mathematics; Algorithm; Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.02292612616357666,"score_gpt":0.25442813750698773,"score_spread":0.23150201134341106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209514728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08115561,0.0032365213,0.87582153,0.006515539,0.0003501054,0.00011054147,0.00070648413,0.00062903634,0.031474616],"genre_scores_gemma":[0.8850743,0.0043992926,0.09005846,0.0018830161,0.00079342985,0.00030357693,0.000682897,0.00045042217,0.016354522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767965,0.0009392298,0.00008338181,0.00040002685,0.0006126963,0.00028499574],"domain_scores_gemma":[0.9686845,0.022706611,0.0016588838,0.0023261863,0.0032574383,0.0013663876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00422562,0.0014498015,0.0013027807,0.0013909704,0.0009174844,0.0020228385,0.0019554752,0.001741836,0.0069192797],"category_scores_gemma":[0.03706683,0.0007353479,0.0009923186,0.0019102314,0.0039227433,0.0052628936,0.0035498857,0.0053329235,0.0013897662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023515927,0.00019643833,0.0019291493,0.0002967692,0.00006563784,0.00033071626,0.000304561,0.14178634,0.005908026,0.80626374,0.015537529,0.027145846],"study_design_scores_gemma":[0.000018249411,0.00007155803,0.00067058665,0.00006779625,0.000016156862,0.00011002005,0.00007617959,0.6341415,0.0019765082,0.36021644,0.0025862185,0.000048736154],"about_ca_topic_score_codex":0.0038023444,"about_ca_topic_score_gemma":0.0030688157,"teacher_disagreement_score":0.0069192797,"about_ca_system_score_codex":0.0026896093,"about_ca_system_score_gemma":0.0015916745,"threshold_uncertainty_score":0.023147345},"labels":[],"label_agreement":null},{"id":"W3210504361","doi":"10.48550/arxiv.2111.00327","title":"Beyond Independent Measurements: General Compressed Sensing with GNN Application","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Compressed sensing; Gaussian; Physics; Distribution (mathematics); Mathematics; Mathematical analysis; Algorithm; Quantum mechanics","score_opus":0.06026740856675833,"score_gpt":0.1769419397308825,"score_spread":0.11667453116412418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210504361","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015594471,0.0015553567,0.973292,0.0023532468,0.00012766756,0.000059793172,0.00022439477,0.00012411393,0.006668941],"genre_scores_gemma":[0.702951,0.0046675457,0.27596915,0.001898611,0.0009249527,0.00033758362,0.0006539522,0.00012173582,0.012475464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809855,0.00077568507,0.00006782671,0.0004228849,0.0004965118,0.00013859285],"domain_scores_gemma":[0.99380714,0.004715948,0.00039368815,0.00052910234,0.00040879543,0.00014525789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003096922,0.0017474872,0.001552407,0.000785974,0.0005294328,0.0012480702,0.0019439547,0.003099046,0.0020055806],"category_scores_gemma":[0.013881268,0.00061797554,0.0008169603,0.0013726426,0.0032308318,0.0032846625,0.0029571252,0.00363791,0.00044114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022218894,0.0000694159,0.00077705923,0.00038036722,0.00008320508,0.00055616064,0.00020296895,0.62496287,0.0033277052,0.339569,0.002807884,0.027041135],"study_design_scores_gemma":[0.000015114577,0.000027898097,0.00012801563,0.000027699845,0.000009812701,0.00007520026,0.000027739263,0.8834626,0.0005542744,0.11473218,0.00092440186,0.000015074243],"about_ca_topic_score_codex":0.00424059,"about_ca_topic_score_gemma":0.003304399,"teacher_disagreement_score":0.00424059,"about_ca_system_score_codex":0.0013204457,"about_ca_system_score_gemma":0.0009772689,"threshold_uncertainty_score":0.016378284},"labels":[],"label_agreement":null},{"id":"W3212595576","doi":"","title":"Unifying Width-Reduced Methods for Quasi-Self-Concordant Optimization","year":2021,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Oracle; Softmax function; Mathematics; Reduction (mathematics); Computer science; Context (archaeology); Mathematical optimization; Convex optimization; Algorithm; Regular polygon; Artificial intelligence","score_opus":0.026584626937523424,"score_gpt":0.30573841595116885,"score_spread":0.2791537890136454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212595576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001436683,0.00020345487,0.9961855,0.00019057686,0.00003555594,0.00003433979,0.000025357062,0.00015041404,0.0017380957],"genre_scores_gemma":[0.10502834,0.00065244583,0.88248456,0.00063259114,0.00029056612,0.0005118089,0.00027539805,0.0008583194,0.0092659835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971921,0.0013472172,0.000109635264,0.00034961055,0.0008298999,0.0001716027],"domain_scores_gemma":[0.9947977,0.0033628028,0.00033482202,0.00073417515,0.0005825283,0.00018800414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054107504,0.002108292,0.0018052403,0.0017413055,0.00067640253,0.0021686638,0.003283367,0.0027141736,0.005608015],"category_scores_gemma":[0.01732228,0.0011218062,0.0019139843,0.0011112262,0.0023556422,0.003443951,0.0053439583,0.005049694,0.0018831394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001515038,0.00016411554,0.000599383,0.0003589664,0.00010835691,0.0001302589,0.00027063163,0.5324436,0.004366752,0.34215906,0.007448199,0.11179904],"study_design_scores_gemma":[0.0000139517015,0.000032016604,0.000045891768,0.000023710429,0.000007331075,0.000023540837,0.000009159091,0.9492815,0.00056723895,0.04812346,0.0018614097,0.0000108185495],"about_ca_topic_score_codex":0.002130137,"about_ca_topic_score_gemma":0.002798516,"teacher_disagreement_score":0.005608015,"about_ca_system_score_codex":0.0013108461,"about_ca_system_score_gemma":0.0019491712,"threshold_uncertainty_score":0.028615117},"labels":[],"label_agreement":null},{"id":"W4200010839","doi":"10.1017/9781108377447.027","title":"Stable and Accurate Neural Networks for Compressive Imaging","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Artificial neural network; Computer science; Compressed sensing; Content (measure theory); Artificial intelligence; Mathematics","score_opus":0.02088880613957768,"score_gpt":0.19842839969373005,"score_spread":0.1775395935541524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200010839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002713161,0.0331779,0.8996936,0.0019977207,0.0010579856,0.000032745418,0.00045721803,0.0011204012,0.059749246],"genre_scores_gemma":[0.121974826,0.072529264,0.534863,0.00097454275,0.0024428912,0.00023938669,0.0020080423,0.0009868314,0.26398128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.000027430498,0.000008467276,0.000028022807,0.00008015476,0.000011672045],"domain_scores_gemma":[0.99971396,0.00016591154,0.0000136017925,0.000035058398,0.00006196486,0.000009531728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350208,0.00069532095,0.00042160242,0.00049289456,0.00015194694,0.00079480914,0.0005423744,0.00077204837,0.0129857855],"category_scores_gemma":[0.0013396454,0.00034640072,0.00024894657,0.0009384123,0.0005590263,0.0012674181,0.0007017202,0.001575716,0.0051250444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000640819,0.000027320237,0.00016512863,0.0005521582,0.000048089274,0.00007856204,0.00006668269,0.0790489,0.0071373265,0.17265257,0.0898362,0.650323],"study_design_scores_gemma":[0.000011526786,0.00006364855,0.0004617238,0.00021728863,0.00002482185,0.00023003128,0.000035557896,0.5667503,0.0063329046,0.25426707,0.17156729,0.000037814887],"about_ca_topic_score_codex":0.0014241454,"about_ca_topic_score_gemma":0.0030757952,"teacher_disagreement_score":0.0129857855,"about_ca_system_score_codex":0.0004290534,"about_ca_system_score_gemma":0.00037318855,"threshold_uncertainty_score":0.043441832},"labels":[],"label_agreement":null},{"id":"W4200098951","doi":"10.1016/j.ejor.2021.11.054","title":"Parallel subgradient algorithm with block dual decomposition for large-scale optimization","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Institute of Dental and Craniofacial Research","keywords":"Subgradient method; Mathematical optimization; Lagrangian relaxation; Block (permutation group theory); Relaxation (psychology); Optimization problem; Algorithm; Decomposition method (queueing theory); Mathematics; Block matrix; Convergence (economics); Matrix (chemical analysis); Computer science; Discrete mathematics","score_opus":0.03773537911255315,"score_gpt":0.3166255261342679,"score_spread":0.2788901470217148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200098951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028801246,0.00016427554,0.995262,0.00012141172,0.00006388267,0.00003486535,0.0000505446,0.00021616029,0.0012066137],"genre_scores_gemma":[0.11791196,0.00037332147,0.8757258,0.00017353165,0.00013976183,0.00040118367,0.00039912638,0.00025725263,0.0046180566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993899,0.00022081162,0.0000311551,0.00007454835,0.00022175854,0.00006178443],"domain_scores_gemma":[0.99902415,0.0004953313,0.00006255,0.00014010195,0.00021532849,0.00006255871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012500611,0.0013390746,0.0017936263,0.0006099595,0.0005368507,0.0009939276,0.001404189,0.0012992537,0.004009109],"category_scores_gemma":[0.0027338266,0.0007383821,0.00086176244,0.0011348553,0.0007732147,0.0012823585,0.0019795585,0.0024456216,0.0012358932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040161773,0.0002396089,0.00038660754,0.00029295168,0.00014212476,0.0001457835,0.00010665423,0.74267745,0.008718835,0.045923177,0.013567585,0.18739758],"study_design_scores_gemma":[0.00002243868,0.000019756151,0.000031487136,0.0000031900447,0.0000046589557,0.000014165373,0.000004741752,0.99450487,0.00048891077,0.0041472586,0.00075471896,0.0000037728548],"about_ca_topic_score_codex":0.005348631,"about_ca_topic_score_gemma":0.0060423533,"teacher_disagreement_score":0.005348631,"about_ca_system_score_codex":0.00063771405,"about_ca_system_score_gemma":0.002339301,"threshold_uncertainty_score":0.01341176},"labels":[],"label_agreement":null},{"id":"W4200105747","doi":"10.1017/9781108377447.029","title":"Appendices","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; World Wide Web; Database","score_opus":0.0199892516320628,"score_gpt":0.18213257407316594,"score_spread":0.16214332244110313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200105747","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089327205,0.014201977,0.00804361,0.008591218,0.032684393,0.0006799512,0.051065452,0.00446842,0.8793717],"genre_scores_gemma":[0.0018363117,0.0065945014,0.0027651347,0.0020216617,0.0039128684,0.00025154217,0.023559231,0.0012587453,0.9577999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993383,0.000064460924,0.000065032575,0.000116746916,0.00037249937,0.000042841202],"domain_scores_gemma":[0.99564016,0.0009483495,0.0002464209,0.00040936124,0.0023491895,0.0004065288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005892279,0.0012278921,0.0011880113,0.005147927,0.001404512,0.0030860268,0.0012492273,0.0010144723,0.77387506],"category_scores_gemma":[0.00908129,0.00045576098,0.00069964613,0.004453423,0.0003937574,0.0024307997,0.0019545346,0.0019988213,0.66746205],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015041747,0.000018124545,0.00004186843,0.0001787406,0.000001979499,0.000038911876,0.000018444161,0.00009619023,0.00009086088,0.002320932,0.9560521,0.041126765],"study_design_scores_gemma":[0.0000032046253,0.000008229402,0.00011204004,0.00011254176,0.0000016490051,0.000078761936,0.000013956294,0.00002586644,0.00005082877,0.0016417957,0.9979468,0.000004380567],"about_ca_topic_score_codex":0.0030922412,"about_ca_topic_score_gemma":0.004396029,"teacher_disagreement_score":0.22612494,"about_ca_system_score_codex":0.0012774476,"about_ca_system_score_gemma":0.0014911345,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4200172956","doi":"10.1017/9781108377447.002","title":"Introduction","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.015299283476789442,"score_gpt":0.17302857308519326,"score_spread":0.15772928960840382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200172956","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022475522,0.0069902004,0.05266717,0.011847553,0.006002874,0.0006470611,0.009056971,0.0020976511,0.9084429],"genre_scores_gemma":[0.01025034,0.0050499747,0.018172715,0.003761632,0.0014130995,0.00041582942,0.0063499613,0.00073558063,0.953851],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999185,0.00006674503,0.000041243977,0.00020618804,0.000418453,0.000082396],"domain_scores_gemma":[0.9985123,0.00024062365,0.00008971628,0.00016085312,0.00081449136,0.00018183919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011211113,0.0011458811,0.00065890275,0.0010735445,0.0010298912,0.004085194,0.0018412278,0.0023689633,0.37484425],"category_scores_gemma":[0.0032405374,0.00031749698,0.00054026075,0.0009308414,0.0008120923,0.003041374,0.0020841595,0.0019290202,0.22286248],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071884366,0.000052175186,0.00030262803,0.00051520974,0.000006789334,0.00011343628,0.00012044383,0.0012054713,0.0009606265,0.103627026,0.6480589,0.24496542],"study_design_scores_gemma":[0.000005280659,0.00002493421,0.00026105036,0.00021989857,0.0000029432106,0.00016321664,0.00005025161,0.00026766237,0.00040443573,0.017119499,0.9814705,0.000010403447],"about_ca_topic_score_codex":0.0016665411,"about_ca_topic_score_gemma":0.0023686849,"teacher_disagreement_score":0.37484425,"about_ca_system_score_codex":0.001664578,"about_ca_system_score_gemma":0.0023702213,"threshold_uncertainty_score":0.8917088},"labels":[],"label_agreement":null},{"id":"W4200246892","doi":"10.1109/meditcom49071.2021.9647646","title":"Efficient Kronecker-based Sparse One-Time Sensing Matrix For Compressive Sensing Cryptosystem","year":2021,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Computer science; Cryptosystem; Sparse matrix; Matrix (chemical analysis); Algorithm; Encryption; Theoretical computer science; Computer engineering; Cryptography; Computer network","score_opus":0.02114146384672626,"score_gpt":0.24617897587359233,"score_spread":0.22503751202686606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200246892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014981788,0.00021755941,0.98159504,0.00026039866,0.00007180447,0.00007431475,0.0000722194,0.00018741259,0.002539539],"genre_scores_gemma":[0.50627065,0.0005842282,0.48772338,0.00025748275,0.00011312448,0.00017343975,0.00024428597,0.000033721157,0.0045998245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993438,0.00018297859,0.00004074845,0.00008809358,0.0003021036,0.00004227365],"domain_scores_gemma":[0.999052,0.00038232267,0.00011876644,0.0001961361,0.00020784016,0.000042983353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284557,0.0005148565,0.0003798032,0.00037757185,0.00034847666,0.00059960154,0.00045243875,0.0005349388,0.0027025396],"category_scores_gemma":[0.0021195072,0.00018863856,0.00030630236,0.000610341,0.0006531298,0.0010542495,0.00058871316,0.0008760656,0.00070229825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004862361,0.00023991846,0.0009001908,0.00040203848,0.000075634576,0.00049747404,0.00027121737,0.25828996,0.21821123,0.20588861,0.007024096,0.30771336],"study_design_scores_gemma":[0.00003694308,0.00030957,0.00026013824,0.000029860325,0.00001710956,0.000511442,0.000042747248,0.9409193,0.03690922,0.015190523,0.005730994,0.00004214786],"about_ca_topic_score_codex":0.0006243768,"about_ca_topic_score_gemma":0.0012216473,"teacher_disagreement_score":0.0027025396,"about_ca_system_score_codex":0.00036685143,"about_ca_system_score_gemma":0.0008645757,"threshold_uncertainty_score":0.009040892},"labels":[],"label_agreement":null},{"id":"W4200284528","doi":"10.1017/9781108377447.036","title":"Notation","year":2021,"lang":"en","type":"other","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Notation; Programming language; Database; Information retrieval; Arithmetic; Mathematics","score_opus":0.011041692579343447,"score_gpt":0.21279298687392745,"score_spread":0.201751294294584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200284528","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032134566,0.0129913185,0.316984,0.006552198,0.012318506,0.00044487114,0.032790855,0.0039228806,0.6107819],"genre_scores_gemma":[0.10424556,0.024494322,0.26568362,0.008379363,0.008920449,0.002048276,0.068879604,0.0074033635,0.5099455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997334,0.00086105854,0.00029468696,0.0006250403,0.00065341004,0.00023180348],"domain_scores_gemma":[0.9968029,0.00067086355,0.00038512368,0.0007556006,0.0012107627,0.00017469923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026952534,0.002485184,0.0011174494,0.0033215405,0.0018772305,0.0045438097,0.002664239,0.001432976,0.16710594],"category_scores_gemma":[0.009185731,0.00044664158,0.00096082693,0.0034653218,0.001749413,0.004661995,0.0022100843,0.0030345155,0.20062676],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630488,0.00004002708,0.0002701627,0.00052902574,0.000015871854,0.00016210147,0.0002405923,0.000876444,0.0013582399,0.53846,0.40882856,0.04914264],"study_design_scores_gemma":[0.000008889432,0.000036908485,0.00011522814,0.00013241105,0.000010194758,0.00041330082,0.000090930254,0.0014013711,0.0007295353,0.13873899,0.85829544,0.000026745302],"about_ca_topic_score_codex":0.0018635119,"about_ca_topic_score_gemma":0.0013910427,"teacher_disagreement_score":0.8328941,"about_ca_system_score_codex":0.0015657889,"about_ca_system_score_gemma":0.001338154,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4200477146","doi":"10.1017/9781108377447.011","title":"Analysis of Optimization Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Content (measure theory); Algorithm; Mathematics","score_opus":0.018739643084718476,"score_gpt":0.18953927887574337,"score_spread":0.1707996357910249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200477146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018176364,0.012104559,0.93726414,0.001439603,0.00050211034,0.00006605604,0.0003448531,0.00032621477,0.046134874],"genre_scores_gemma":[0.19218862,0.038121138,0.6326245,0.0022165438,0.0030637,0.0013043743,0.0028872413,0.002642715,0.12495114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788874,0.0008013631,0.000104678,0.00029930135,0.0007444294,0.00016150037],"domain_scores_gemma":[0.9951904,0.0034126167,0.00019851455,0.0004288963,0.0006719155,0.00009769406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027203436,0.001958051,0.0015994856,0.0016695013,0.0005931013,0.00291349,0.0015327893,0.0015249243,0.021042842],"category_scores_gemma":[0.0125986375,0.00071055285,0.0016029923,0.0025965157,0.0015935692,0.0024383129,0.0022944151,0.0037883464,0.006953426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007631895,0.00007728274,0.00074172753,0.0008443658,0.00019904194,0.00008668069,0.00011920243,0.19578813,0.0013725475,0.55531543,0.052989297,0.19239011],"study_design_scores_gemma":[0.000012923039,0.000042235275,0.00064137403,0.00019436401,0.00003836452,0.00011024904,0.00004136244,0.49958152,0.0007754101,0.4596314,0.038906783,0.000024036426],"about_ca_topic_score_codex":0.0024754487,"about_ca_topic_score_gemma":0.002320336,"teacher_disagreement_score":0.021042842,"about_ca_system_score_codex":0.0020416686,"about_ca_system_score_gemma":0.0017333225,"threshold_uncertainty_score":0.07039535},"labels":[],"label_agreement":null},{"id":"W4205235265","doi":"10.36227/techrxiv.15086277","title":"Unified Analysis on L1 over L2 Minimization for signal recovery","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convergence (economics); Mathematics; Matrix (chemical analysis); Applied mathematics; Projection (relational algebra); Constraint (computer-aided design); Algorithm; Minification; Mathematical optimization; Property (philosophy); Operator (biology); Computer science","score_opus":0.02305830473153753,"score_gpt":0.25129267012834133,"score_spread":0.2282343653968038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205235265","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020252466,0.0013384346,0.99123085,0.000650099,0.00009762056,0.000019686326,0.00005447598,0.00006024894,0.0045233923],"genre_scores_gemma":[0.3688337,0.012545117,0.5818305,0.002229041,0.0019045954,0.0005237493,0.00077588187,0.00089819,0.030459318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983854,0.00080614985,0.00006632975,0.0002442898,0.00038587823,0.000112051246],"domain_scores_gemma":[0.99765944,0.0014182512,0.0001857451,0.0001958147,0.00043800453,0.00010270809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039021778,0.0019370753,0.0010135734,0.0012319672,0.00046741177,0.0014088523,0.0013389323,0.0015793662,0.004803336],"category_scores_gemma":[0.007001909,0.0005080161,0.0014310197,0.0011866598,0.0017438775,0.0031420577,0.002928767,0.002978749,0.0008954318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011764912,0.00007229044,0.00064218097,0.00063700724,0.00010617477,0.00023516633,0.00023054963,0.28915396,0.006581793,0.62818176,0.011019471,0.06302194],"study_design_scores_gemma":[0.0000051120023,0.000046687146,0.00009273725,0.000031097443,0.000013709108,0.00006276119,0.000020515574,0.942461,0.000792253,0.053118195,0.003342141,0.000013681759],"about_ca_topic_score_codex":0.002409494,"about_ca_topic_score_gemma":0.0018285165,"teacher_disagreement_score":0.004803336,"about_ca_system_score_codex":0.00130379,"about_ca_system_score_gemma":0.0012203495,"threshold_uncertainty_score":0.020636976},"labels":[],"label_agreement":null},{"id":"W4205870215","doi":"10.22215/etd/2021-14748","title":"Sparse Recovery, Classification, and Data Compression via Improved Maximum Feasible Subsystem Algorithms","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Algorithm; Initialization; Computer science; Outlier; Sparse matrix; Data compression; Matrix (chemical analysis); Signal recovery; Compression (physics); Artificial intelligence","score_opus":0.04774648993964516,"score_gpt":0.28657799978327464,"score_spread":0.23883150984362947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205870215","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002811443,0.00012356164,0.99575895,0.00007485536,0.000017744947,0.000028135055,0.000020352249,0.00015008505,0.0010148542],"genre_scores_gemma":[0.06880228,0.00049422577,0.9262371,0.0000830313,0.00007567617,0.00016204853,0.00027072005,0.000085763204,0.0037891658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938965,0.0001557511,0.00004039878,0.00010237608,0.00026687392,0.000044913548],"domain_scores_gemma":[0.9991211,0.00040928693,0.000087961555,0.00013205915,0.00021797266,0.000031487405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095379254,0.0010829825,0.00077350356,0.0009928519,0.00036254185,0.00081727793,0.0009488391,0.0007273884,0.0034106825],"category_scores_gemma":[0.0031912525,0.00037589038,0.00075836136,0.0012502035,0.0006479841,0.0017347604,0.0012308382,0.0014475039,0.0009279131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019408419,0.00011609573,0.00065949897,0.00029440792,0.0000624922,0.00010413316,0.00025700164,0.3178065,0.027799383,0.062047653,0.0053367917,0.585322],"study_design_scores_gemma":[0.000014617927,0.00007363339,0.00019976823,0.000016103906,0.000009941,0.000074623305,0.000023165223,0.9802832,0.0067353277,0.008551526,0.004004837,0.000013228887],"about_ca_topic_score_codex":0.0014759853,"about_ca_topic_score_gemma":0.002255084,"teacher_disagreement_score":0.0034106825,"about_ca_system_score_codex":0.00049344695,"about_ca_system_score_gemma":0.00094283425,"threshold_uncertainty_score":0.011409938},"labels":[],"label_agreement":null},{"id":"W4206411094","doi":"10.22215/etd/2021-14768","title":"Computationally Efficient and Secure Kronecker-based Compressive Sensing","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Computer science; Matrix (chemical analysis); Algorithm; Sparse matrix; Kronecker delta; Block matrix; Block (permutation group theory); Plaintext; Parallel computing; Theoretical computer science; Encryption; Mathematics; Physics","score_opus":0.006966897071289477,"score_gpt":0.22111070635702304,"score_spread":0.21414380928573357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206411094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014689192,0.00012187143,0.9823889,0.00015572707,0.00004959638,0.000049643328,0.000052334435,0.00023859016,0.0022540896],"genre_scores_gemma":[0.46289074,0.00042116965,0.53050804,0.00020187139,0.00010569989,0.0001316552,0.00022870509,0.000059539423,0.0054525523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990226,0.0002560487,0.000056521098,0.000105599334,0.00050197827,0.00005720164],"domain_scores_gemma":[0.9989542,0.00034376138,0.00013561049,0.00033828826,0.00019099301,0.000037083708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005639118,0.00052412425,0.00037672764,0.00037356908,0.00027040852,0.0006801433,0.0005722921,0.0004814627,0.0022503159],"category_scores_gemma":[0.0020283717,0.00027644212,0.00031385545,0.00043930093,0.00082405953,0.0011381443,0.00090027635,0.00080894533,0.00084229396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000418832,0.00019419147,0.00060204376,0.00025139388,0.00006917433,0.00033411072,0.00018233084,0.21856458,0.2369473,0.19404997,0.004034392,0.3443517],"study_design_scores_gemma":[0.000041292093,0.000303299,0.00027570978,0.000025164507,0.000017015715,0.00041193998,0.000036602203,0.90032375,0.06961172,0.022820609,0.0060882266,0.00004474053],"about_ca_topic_score_codex":0.00037132046,"about_ca_topic_score_gemma":0.0007561103,"teacher_disagreement_score":0.0022503159,"about_ca_system_score_codex":0.00026318964,"about_ca_system_score_gemma":0.0006890528,"threshold_uncertainty_score":0.0075280666},"labels":[],"label_agreement":null},{"id":"W4211108041","doi":"10.1007/978-1-4471-7452-3_19","title":"Matrix Completion","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Matrix completion; Matrix (chemical analysis); Extension (predicate logic); Matrix decomposition; Sparse matrix; Incomplete LU factorization; Mathematics; LU decomposition; Computer science; Algebra over a field; Algorithm; Pure mathematics; Physics; Materials science; Programming language","score_opus":0.017949887752703286,"score_gpt":0.21985892782394992,"score_spread":0.20190904007124663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211108041","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001116497,0.01335985,0.377183,0.0018972033,0.00291009,0.00007696824,0.0009966155,0.0022473047,0.60021245],"genre_scores_gemma":[0.013961421,0.011644242,0.11329327,0.0007361749,0.0016774641,0.00010930301,0.0018007789,0.0009564116,0.85582095],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956363,0.000056002344,0.000014486053,0.00008848634,0.00025519976,0.000022129752],"domain_scores_gemma":[0.99963677,0.00010681318,0.000012540613,0.000087430235,0.00013071283,0.0000257893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036098456,0.0013426822,0.0006745993,0.0012522712,0.00056574354,0.0018798116,0.00074278074,0.00081224396,0.08738139],"category_scores_gemma":[0.0012087334,0.00043816085,0.00042798623,0.0018255684,0.0008905576,0.0017947372,0.0014056454,0.0019773883,0.06798277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020627775,0.000041041305,0.00004931612,0.0002560924,0.000011879655,0.00004054004,0.00009072734,0.0029682464,0.0018555963,0.1194944,0.35868788,0.5164837],"study_design_scores_gemma":[0.0000051244724,0.00002310205,0.00016212052,0.000120983765,0.0000071026398,0.00020849965,0.000049922084,0.0065826084,0.0021738668,0.100351624,0.8902971,0.000017948774],"about_ca_topic_score_codex":0.0010831935,"about_ca_topic_score_gemma":0.00252634,"teacher_disagreement_score":0.08738139,"about_ca_system_score_codex":0.00055817794,"about_ca_system_score_gemma":0.00076702517,"threshold_uncertainty_score":0.2923199},"labels":[],"label_agreement":null},{"id":"W4212968861","doi":"10.1137/1.9781611976885.ch6","title":"Chapter 6: Elements of compressed sensing theory","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"","keywords":"Compressed sensing; Computer science; Materials science; Artificial intelligence","score_opus":0.05431466739033393,"score_gpt":0.2276301307052489,"score_spread":0.17331546331491499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212968861","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017650324,0.1170216,0.3878019,0.009268523,0.009532466,0.00022444951,0.0020112752,0.0013644993,0.47101033],"genre_scores_gemma":[0.044136852,0.228796,0.28644362,0.0077984785,0.017172065,0.0005493019,0.004310548,0.0014097013,0.4093834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935013,0.000093039656,0.0000337174,0.00010717657,0.00038102877,0.00003500158],"domain_scores_gemma":[0.99932647,0.00037451743,0.000022951472,0.000074722695,0.00016963581,0.00003166433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005843883,0.000998177,0.0006617236,0.0016441663,0.0008259423,0.0027465865,0.00078882417,0.0012098133,0.04008135],"category_scores_gemma":[0.0021152513,0.0005145207,0.0005145199,0.0026188928,0.0015430048,0.0029091449,0.0011642217,0.0035954777,0.019452149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025802916,0.00003318498,0.00009604792,0.0008579759,0.000018556257,0.00013176308,0.00029344915,0.0029953127,0.002404131,0.5744897,0.20183897,0.21681504],"study_design_scores_gemma":[0.0000037084085,0.000023650091,0.00014550063,0.0003840616,0.0000072374414,0.00037318614,0.000055962442,0.0020767027,0.0008512794,0.19150676,0.80455005,0.000021923839],"about_ca_topic_score_codex":0.00092352985,"about_ca_topic_score_gemma":0.0009601461,"teacher_disagreement_score":0.04008135,"about_ca_system_score_codex":0.00084570586,"about_ca_system_score_gemma":0.0009876253,"threshold_uncertainty_score":0.13408548},"labels":[],"label_agreement":null},{"id":"W4220750582","doi":"10.1080/01621459.2022.2050243","title":"Sparse Reduced Rank Huber Regression in High Dimensions","year":2022,"lang":"en","type":"article","venue":"Journal of the American Statistical Association","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of General Medical Sciences; National Institute of Mental Health; Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Institutes of Health; National Science Foundation","keywords":"Coordinate descent; Mathematics; Rate of convergence; Bounded function; Applied mathematics; Rank (graph theory); Moment (physics); Noise (video); Consistency (knowledge bases); Gaussian; Gaussian noise; Mathematical optimization; Algorithm; Computer science; Combinatorics; Mathematical analysis; Artificial intelligence; Discrete mathematics","score_opus":0.008938009588913798,"score_gpt":0.24666802707774935,"score_spread":0.23773001748883554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220750582","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041969703,0.0001318819,0.994773,0.00019737626,0.000021590155,0.000020355767,0.00007216333,0.0001845379,0.0004021661],"genre_scores_gemma":[0.20221908,0.0008862674,0.79064816,0.00041602718,0.0002732258,0.00021632324,0.0006752073,0.00021038312,0.0044552935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986523,0.0006253483,0.000041339226,0.00022703272,0.00035847924,0.000095585856],"domain_scores_gemma":[0.99687755,0.0015960521,0.00036702372,0.0006049138,0.00044104925,0.00011355073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028915284,0.0011949479,0.0016354751,0.00093442196,0.00048960315,0.0011670814,0.0018782733,0.0015152105,0.001757577],"category_scores_gemma":[0.008335621,0.0005697091,0.00083671673,0.0015527708,0.0015096866,0.0018824885,0.0015338273,0.0023329342,0.0009865462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011258619,0.00009068114,0.001235635,0.00020509482,0.0001147726,0.00017685321,0.00010838869,0.81892043,0.008358469,0.08765677,0.005746415,0.07727397],"study_design_scores_gemma":[0.000006138159,0.000014214298,0.00010073369,0.0000043961295,0.0000043599425,0.000014158207,0.000004930404,0.99043626,0.0007927078,0.007956572,0.0006572518,0.000008409324],"about_ca_topic_score_codex":0.002790648,"about_ca_topic_score_gemma":0.0033403866,"teacher_disagreement_score":0.0028915284,"about_ca_system_score_codex":0.00060502504,"about_ca_system_score_gemma":0.0013518616,"threshold_uncertainty_score":0.015292048},"labels":[],"label_agreement":null},{"id":"W4221160390","doi":"10.1080/02331888.2022.2084544","title":"Refined normal approximations for the central and noncentral chi-square distributions and some applications","year":2022,"lang":"en","type":"article","venue":"Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Noncentral chi-squared distribution; Quantile; Square (algebra); Upper and lower bounds; Chi-square test; Distribution (mathematics); Convergence (economics); Normal distribution; Rate of convergence; Combinatorics; Applied mathematics; Statistics; Mathematical analysis; Ratio distribution; Geometry; Asymptotic distribution","score_opus":0.010029584502562307,"score_gpt":0.22245794187851975,"score_spread":0.21242835737595744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221160390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004325883,0.0010603925,0.9910691,0.0004669842,0.000111308,0.000040573163,0.00007470657,0.00024077749,0.002610388],"genre_scores_gemma":[0.28895113,0.005710827,0.68438566,0.0013458409,0.0010063159,0.0006980822,0.00071626366,0.0010886642,0.016097263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927093,0.0036097323,0.00025378738,0.0009553425,0.0020000534,0.00047177562],"domain_scores_gemma":[0.93648696,0.04754957,0.0024023326,0.00500449,0.0074891374,0.0010674839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017787995,0.002162996,0.0018455524,0.0034680695,0.00094515603,0.0025205298,0.0044718347,0.002080038,0.0056282417],"category_scores_gemma":[0.09255549,0.0009925276,0.0025960589,0.0024546012,0.004560326,0.006582908,0.004016236,0.0086545795,0.0025950614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021979127,0.000088659006,0.0023887702,0.00027617277,0.00009508712,0.00045571182,0.000737201,0.24566467,0.002716374,0.7086778,0.0050138626,0.03366594],"study_design_scores_gemma":[0.000021924456,0.000057599813,0.00041510054,0.00008134582,0.00002196558,0.00024364387,0.000082168546,0.786927,0.0012000209,0.2046905,0.006200367,0.000058306803],"about_ca_topic_score_codex":0.006653859,"about_ca_topic_score_gemma":0.0039158296,"teacher_disagreement_score":0.017787995,"about_ca_system_score_codex":0.0036718496,"about_ca_system_score_gemma":0.0020642655,"threshold_uncertainty_score":0.094073},"labels":[],"label_agreement":null},{"id":"W4224251933","doi":"10.1049/cit2.12092","title":"A robust sparse representation algorithm based on adaptive joint dictionary","year":2022,"lang":"en","type":"article","venue":"CAAI Transactions on Intelligence Technology","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Science Foundation of Jiangsu Province","keywords":"Sparse approximation; K-SVD; Robustness (evolution); Computer science; Artificial intelligence; Pattern recognition (psychology); Subspace topology; Facial recognition system; Neural coding; Face (sociological concept); Dictionary learning; Algorithm","score_opus":0.055061309757106526,"score_gpt":0.2473443290674456,"score_spread":0.1922830193103391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224251933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032330963,0.00007458507,0.9957808,0.00008007215,0.000031798725,0.000021030262,0.00003085926,0.00019197103,0.00055578275],"genre_scores_gemma":[0.17802393,0.00033664607,0.814843,0.00020433012,0.00013832223,0.00021635926,0.0006006676,0.00010670512,0.005530088],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993475,0.00012870012,0.000035977773,0.00013944152,0.00027852593,0.00006981113],"domain_scores_gemma":[0.9994481,0.00014533756,0.000058900154,0.000083259765,0.00023362518,0.000030777428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000573805,0.0005303387,0.0008949848,0.0008495811,0.00035598187,0.00064813974,0.0010105632,0.00082056096,0.002810593],"category_scores_gemma":[0.0017808117,0.00031960645,0.00065944367,0.0013284954,0.00047164553,0.0012139798,0.0012735456,0.0012115719,0.0010211476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026385227,0.00009839657,0.00073778286,0.00012622759,0.00006788169,0.000110822424,0.00012447558,0.30576113,0.0330961,0.041454647,0.010088173,0.60807055],"study_design_scores_gemma":[0.0000193525,0.00004148278,0.00009478846,0.00000522744,0.0000062262607,0.000057005112,0.000010758208,0.99299496,0.0023275292,0.0027196398,0.0017137575,0.000009259644],"about_ca_topic_score_codex":0.00342535,"about_ca_topic_score_gemma":0.0021916379,"teacher_disagreement_score":0.00342535,"about_ca_system_score_codex":0.00039522632,"about_ca_system_score_gemma":0.0010495421,"threshold_uncertainty_score":0.009402394},"labels":[],"label_agreement":null},{"id":"W4224928115","doi":"10.1109/icassp43922.2022.9747338","title":"Massive Unsourced Random Access Based on Bilinear Vector Approximate Message Passing","year":2022,"lang":"en","type":"article","venue":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Bilinear interpolation; Decoding methods; Message passing; Random access; Channel (broadcasting); Scheme (mathematics); Theoretical computer science; Coding (social sciences); Algorithm; Distributed computing; Computer network; Mathematics; Computer vision","score_opus":0.04135109982443126,"score_gpt":0.2879525679200048,"score_spread":0.24660146809557354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224928115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004249086,0.00008351539,0.99426645,0.00009765131,0.000026430793,0.000030889358,0.000028114351,0.00015381737,0.0010640386],"genre_scores_gemma":[0.55901575,0.00039421956,0.4342866,0.00028611813,0.00014776821,0.00030797513,0.0001967478,0.00006935175,0.005295486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829584,0.00074528734,0.00006430611,0.00021144966,0.00053258456,0.00015055985],"domain_scores_gemma":[0.9980837,0.0010433887,0.00021431428,0.00035826472,0.00021698845,0.000083393636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012864597,0.0008788778,0.0010122282,0.00044429337,0.00042240237,0.0010462865,0.0016586612,0.0007406436,0.0023353326],"category_scores_gemma":[0.003915813,0.00032931435,0.00049564533,0.00081196113,0.0012369863,0.0018396972,0.0023974902,0.0013922971,0.0007091187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041756715,0.000123051,0.0004856936,0.00027212224,0.0000902096,0.00024623005,0.00035522465,0.5399268,0.013109315,0.2984264,0.0031052805,0.14344212],"study_design_scores_gemma":[0.00002189362,0.000084247025,0.000034349847,0.000008941793,0.000006920907,0.000078544246,0.000013792195,0.97553784,0.00194306,0.021075197,0.0011827444,0.000012470434],"about_ca_topic_score_codex":0.00078309723,"about_ca_topic_score_gemma":0.00090748223,"teacher_disagreement_score":0.0023353326,"about_ca_system_score_codex":0.0004545841,"about_ca_system_score_gemma":0.00090239244,"threshold_uncertainty_score":0.0078125},"labels":[],"label_agreement":null},{"id":"W4225274980","doi":"10.7717/peerj-cs.951","title":"Deep learning methods for inverse problems","year":2022,"lang":"en","type":"article","venue":"PeerJ Computer Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Inverse problem; Outlier; Computer science; Robustness (evolution); Artificial intelligence; Inverse; Rendering (computer graphics); Machine learning; Pattern recognition (psychology); Mathematical optimization; Mathematics","score_opus":0.02891769631331021,"score_gpt":0.29744979165808216,"score_spread":0.26853209534477196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225274980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012442076,0.0009848211,0.9958049,0.00029404915,0.00003880292,0.00001708665,0.00002844123,0.00011250689,0.0014750313],"genre_scores_gemma":[0.13594067,0.0044925227,0.850158,0.00046931818,0.00033621956,0.00025421914,0.00030406367,0.00021864082,0.007826362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992461,0.00023974186,0.00003934778,0.00010205959,0.0003308409,0.00004202465],"domain_scores_gemma":[0.99852556,0.00095522695,0.0001042522,0.00017518282,0.00019743388,0.00004231455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015605289,0.0010805916,0.0009271345,0.00077907427,0.0003191607,0.0011526368,0.0013345039,0.0014836362,0.0034050243],"category_scores_gemma":[0.005120235,0.0005523507,0.0008324764,0.00088010245,0.0012937395,0.0017657402,0.0020858888,0.0032819533,0.0010835732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000723405,0.00006708082,0.0005959743,0.00062412414,0.00013267873,0.00008158345,0.00012503087,0.50659853,0.006550553,0.22995563,0.0054576355,0.24973884],"study_design_scores_gemma":[0.000010291591,0.000029949508,0.000094991905,0.000045043267,0.000009377403,0.000047766527,0.0000134053535,0.9208962,0.0015673509,0.07189463,0.0053814426,0.000009657604],"about_ca_topic_score_codex":0.001812972,"about_ca_topic_score_gemma":0.0022305176,"teacher_disagreement_score":0.0034050243,"about_ca_system_score_codex":0.000703958,"about_ca_system_score_gemma":0.0008176596,"threshold_uncertainty_score":0.011390984},"labels":[],"label_agreement":null},{"id":"W4226227217","doi":"10.1109/jproc.2022.3155904","title":"Signal Processing Using Dictionaries, Atoms, and Deep Learning: A Common Analysis-Synthesis Framework","year":2022,"lang":"en","type":"article","venue":"Proceedings of the IEEE","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; Microseismic Industry Consortium","keywords":"Artificial intelligence; Computer science; Thresholding; Deep learning; K-SVD; Pattern recognition (psychology); Basis function; Signal processing; Basis (linear algebra); Artificial neural network; SIGNAL (programming language); Feature extraction; Machine learning; Sparse approximation; Image (mathematics); Mathematics; Digital signal processing","score_opus":0.014540253946375283,"score_gpt":0.22330295164450123,"score_spread":0.20876269769812594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226227217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008997058,0.006506638,0.9889789,0.0006518377,0.000099634475,0.00002652313,0.00007264105,0.0001517485,0.0026124243],"genre_scores_gemma":[0.07601993,0.039753266,0.8750688,0.0007664246,0.001237365,0.0002958834,0.00036028883,0.00016439536,0.0063336827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.00016037023,0.000056944606,0.00011928221,0.00021303246,0.000029696534],"domain_scores_gemma":[0.999461,0.00026554987,0.000042716845,0.000105273546,0.00009742426,0.000027986058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996906,0.0012168005,0.0011479066,0.0013788891,0.0003287967,0.0021548008,0.001131503,0.0015522098,0.0018050108],"category_scores_gemma":[0.0015356694,0.00051819504,0.00084924966,0.0019034804,0.0026111994,0.0023849495,0.001769651,0.0028819386,0.0008772873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006594849,0.00004260562,0.00037398655,0.0011915376,0.00010480416,0.00012425274,0.00020824796,0.065668866,0.009272113,0.6547636,0.0052763065,0.26290783],"study_design_scores_gemma":[0.000027114453,0.00015200178,0.0004062059,0.00036091387,0.000054476648,0.00035166313,0.00007610153,0.42420658,0.008063478,0.49539208,0.07084697,0.0000623396],"about_ca_topic_score_codex":0.0010988269,"about_ca_topic_score_gemma":0.0009902659,"teacher_disagreement_score":0.0021548008,"about_ca_system_score_codex":0.00062783004,"about_ca_system_score_gemma":0.0008181768,"threshold_uncertainty_score":0.0060383677},"labels":[],"label_agreement":null},{"id":"W4226307423","doi":"10.48550/arxiv.2202.02877","title":"HARFE: Hard-Ridge Random Feature Expansion","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ridge; Feature (linguistics); Smoothing; Algorithm; Outlier; Random matrix; Sparse approximation; Pattern recognition (psychology); Mathematics; Computer science; Thresholding; Matrix (chemical analysis); Artificial intelligence; Statistics; Geology","score_opus":0.055721299503049056,"score_gpt":0.17539026729365945,"score_spread":0.1196689677906104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226307423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014794612,0.00007945481,0.99783164,0.0000669982,0.000017739874,0.00000957503,0.000023973753,0.00016029555,0.0003308755],"genre_scores_gemma":[0.20286807,0.00049664115,0.78898,0.00036969734,0.00014451511,0.00018277274,0.00048136892,0.00030793276,0.006169057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999119,0.0003095936,0.000029666457,0.00013363032,0.00033870985,0.0000694127],"domain_scores_gemma":[0.9989807,0.0004982229,0.00010727978,0.00021320832,0.00015729349,0.000043252083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804979,0.0008493339,0.0010849523,0.00061875145,0.00030473326,0.0009385604,0.0017928128,0.0015223961,0.0021379367],"category_scores_gemma":[0.0046007372,0.000435627,0.0008904358,0.00078220567,0.0009316773,0.0016584006,0.0014241284,0.0019156629,0.0012105157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014172103,0.00009576247,0.000748442,0.00014513223,0.00008637181,0.0001984903,0.00008104477,0.6769492,0.013087147,0.09521168,0.007587835,0.20566724],"study_design_scores_gemma":[0.0000051583966,0.000019511637,0.000051499694,0.0000056635863,0.0000027768717,0.000048713846,0.0000031474424,0.9915314,0.0010887353,0.0059500355,0.0012862094,0.0000072517378],"about_ca_topic_score_codex":0.0018178921,"about_ca_topic_score_gemma":0.0019485255,"teacher_disagreement_score":0.0021379367,"about_ca_system_score_codex":0.00041439928,"about_ca_system_score_gemma":0.00065816747,"threshold_uncertainty_score":0.0073009133},"labels":[],"label_agreement":null},{"id":"W4230675618","doi":"10.2172/1434573","title":"Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations","year":2018,"lang":"en","type":"report","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Compressed sensing; Algorithm; Parameterized complexity; Computer science; Parametric statistics; Mathematical optimization; Regularization (linguistics); A priori and a posteriori; Applied mathematics; Mathematics; Artificial intelligence","score_opus":0.048275315320668394,"score_gpt":0.2724226235528455,"score_spread":0.22414730823217713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230675618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070810425,0.00010086209,0.99161166,0.00021292637,0.00001742866,0.000018971006,0.000024283434,0.00009389857,0.00083899376],"genre_scores_gemma":[0.5322276,0.0006540519,0.46399248,0.00027619157,0.00012880108,0.00015198592,0.00025538343,0.00013460085,0.0021789446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931514,0.000242054,0.000026536696,0.000082554616,0.0002897731,0.000044016153],"domain_scores_gemma":[0.99782383,0.0014467855,0.00022195523,0.00024384174,0.00021702693,0.00004650172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001254441,0.0007179911,0.0006216339,0.00049277314,0.0003204889,0.00068605796,0.0007888069,0.0011744016,0.0010942406],"category_scores_gemma":[0.0071032117,0.00028357338,0.0004304416,0.00056544726,0.0013709383,0.0012024307,0.0012372077,0.001395693,0.00029361824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013549125,0.00003919786,0.0007209635,0.00013374376,0.000032027132,0.0001492694,0.00016032378,0.8754184,0.011958659,0.06102599,0.001921332,0.048304565],"study_design_scores_gemma":[0.0000041182025,0.000010864669,0.00004788773,0.0000059963277,0.0000017986033,0.000021957765,0.000008355668,0.9925902,0.0013501837,0.005531987,0.00042292304,0.0000038061946],"about_ca_topic_score_codex":0.0023248019,"about_ca_topic_score_gemma":0.0014245184,"teacher_disagreement_score":0.0023248019,"about_ca_system_score_codex":0.00056943414,"about_ca_system_score_gemma":0.0007111704,"threshold_uncertainty_score":0.006634176},"labels":[],"label_agreement":null},{"id":"W4233803653","doi":"10.1002/9783527600441.oe1020","title":"Compressive Sensing","year":2015,"lang":"en","type":"other","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"","keywords":"Compressed sensing; Nyquist–Shannon sampling theorem; Sampling theory; Field (mathematics); Set (abstract data type); Sampling (signal processing); Computer science; Data science; Algorithm; Mathematics; Telecommunications; Computer vision; Statistics; Sample size determination; Pure mathematics","score_opus":0.016702736958089635,"score_gpt":0.2236783270842413,"score_spread":0.20697559012615166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233803653","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062188148,0.009030572,0.81038326,0.0027397801,0.0016258812,0.00025409204,0.0014412575,0.0011880837,0.16711825],"genre_scores_gemma":[0.42149746,0.034861114,0.37245628,0.00302013,0.0051490045,0.0006447286,0.0070303814,0.00044644737,0.15489447],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.00022214615,0.00006715084,0.00032074365,0.0007056983,0.00010121264],"domain_scores_gemma":[0.9988557,0.00037151785,0.00009059226,0.00029816874,0.0003158617,0.00006809654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080114516,0.0010131684,0.0009122704,0.0012700012,0.00055071973,0.0025355418,0.001106399,0.0012272957,0.025179807],"category_scores_gemma":[0.0033578405,0.00024534305,0.00044126326,0.0017031643,0.001241701,0.0018482165,0.0022287364,0.0015203861,0.010251432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017858131,0.0000740409,0.00076743675,0.00072368595,0.000081988714,0.00036900924,0.000113540686,0.04429682,0.015444354,0.37659222,0.074033536,0.48732483],"study_design_scores_gemma":[0.000049896433,0.00018224971,0.0011789076,0.0005184523,0.000045255783,0.0010610877,0.00015444146,0.27012593,0.012482865,0.24805725,0.46606103,0.00008272026],"about_ca_topic_score_codex":0.00087038026,"about_ca_topic_score_gemma":0.0008070901,"teacher_disagreement_score":0.025179807,"about_ca_system_score_codex":0.00057584833,"about_ca_system_score_gemma":0.0008996615,"threshold_uncertainty_score":0.08423483},"labels":[],"label_agreement":null},{"id":"W4234612837","doi":"10.23952/jano.2.2020.3.02","title":"An inertial splitting algorithm for solving inclusion problems and its applications to compressed sensing","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inclusion (mineral); Compressed sensing; Algorithm; Computer science; Inertial frame of reference; Geology; Physics","score_opus":0.016781479031937736,"score_gpt":0.2406739303777423,"score_spread":0.22389245134580454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234612837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006539209,0.00012774364,0.9914779,0.00012113156,0.000027666842,0.000022212706,0.000007657444,0.000045079265,0.0016313952],"genre_scores_gemma":[0.35236442,0.0006695544,0.64172035,0.00019456659,0.00016249779,0.00020888288,0.000083859326,0.00009873686,0.004497056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973875,0.000076710974,0.000012986201,0.000033758024,0.0001217914,0.000016003522],"domain_scores_gemma":[0.9995473,0.00026229164,0.000041375843,0.00004305547,0.000076062635,0.000030007726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030935,0.00044302858,0.00046662652,0.00039623983,0.00037003684,0.00036204173,0.0006028607,0.00075578183,0.0016098206],"category_scores_gemma":[0.0015117474,0.00018745662,0.00033624683,0.0003966395,0.0009867568,0.00091567915,0.0013371463,0.0009987607,0.00029042488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015781967,0.00014853363,0.0008928286,0.00024902506,0.000054356995,0.0002111027,0.0004623465,0.4262122,0.04923315,0.24251673,0.0025752573,0.2772866],"study_design_scores_gemma":[0.0000072121525,0.00005430021,0.000064390246,0.000008067927,0.0000034369587,0.00005905305,0.00001959113,0.97877055,0.0022431633,0.016918896,0.0018444306,0.000006834335],"about_ca_topic_score_codex":0.0009313679,"about_ca_topic_score_gemma":0.00080698245,"teacher_disagreement_score":0.0016098206,"about_ca_system_score_codex":0.00024363042,"about_ca_system_score_gemma":0.00047526273,"threshold_uncertainty_score":0.005385399},"labels":[],"label_agreement":null},{"id":"W4235254860","doi":"10.22215/etd/2017-12154","title":"Low Latency Compressive Sensing using Multi-Resolution Analysis In Radar Signal Processing","year":2017,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Nyquist rate; Nyquist–Shannon sampling theorem; Compressed sensing; Computer science; Bandwidth (computing); Wavelet; Signal processing; SIGNAL (programming language); Algorithm; Electronic engineering; Real-time computing; Radar; Sampling (signal processing); Telecommunications; Computer vision; Engineering","score_opus":0.027188590298590713,"score_gpt":0.2867454646240853,"score_spread":0.25955687432549457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235254860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02657548,0.0791058,0.83863205,0.003653485,0.00096720044,0.00012726511,0.00017349087,0.00039467157,0.05037065],"genre_scores_gemma":[0.400817,0.11392707,0.43063226,0.0011083422,0.0018732371,0.00020774888,0.00037874441,0.00018381227,0.050871685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957925,0.000075825985,0.000015618325,0.00009096273,0.00021309247,0.00002529866],"domain_scores_gemma":[0.99969244,0.00015560524,0.000026462947,0.000037475125,0.000073536095,0.000014552394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003991208,0.00055195024,0.00035605382,0.00051137246,0.0003120444,0.00096482283,0.00036153596,0.0007570317,0.0034543148],"category_scores_gemma":[0.0010978522,0.00028730815,0.000314141,0.0013687551,0.00096068735,0.0012436492,0.0006493367,0.0015637468,0.0014555723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018835551,0.00018652703,0.0006975665,0.0017863499,0.00006935387,0.00031955092,0.00048312635,0.04665437,0.10572822,0.21598275,0.010612118,0.6172917],"study_design_scores_gemma":[0.00005840134,0.00071879383,0.0026351905,0.0010844358,0.00009828416,0.0017956005,0.00037880486,0.3474447,0.1318791,0.24109381,0.2726372,0.00017568062],"about_ca_topic_score_codex":0.0004547102,"about_ca_topic_score_gemma":0.00073636824,"teacher_disagreement_score":0.0034543148,"about_ca_system_score_codex":0.00049229775,"about_ca_system_score_gemma":0.00041882423,"threshold_uncertainty_score":0.0115558505},"labels":[],"label_agreement":null},{"id":"W4243533188","doi":"10.1007/978-1-4471-7452-3_14","title":"Nonnegative Matrix Factorization","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Matrix decomposition; Non-negative matrix factorization; Nonnegative matrix; Factorization; Matrix (chemical analysis); Rank (graph theory); Dimensionality reduction; Dimension (graph theory); Mathematics; Sparse matrix; Computer science; Algorithm; Symmetric matrix; Artificial intelligence; Combinatorics; Physics; Computational chemistry; Chemistry","score_opus":0.01343235923514278,"score_gpt":0.21619603790717243,"score_spread":0.20276367867202966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243533188","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011688283,0.026485125,0.3687569,0.002825792,0.0058329445,0.00009754314,0.0007690651,0.0016503972,0.5924134],"genre_scores_gemma":[0.013479075,0.025459098,0.140854,0.0011624933,0.0030081836,0.00014495655,0.0016315213,0.00082152867,0.81343913],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970967,0.000039871946,0.000009756933,0.000063089385,0.00016034917,0.000017272761],"domain_scores_gemma":[0.99972457,0.0001060045,0.000011367824,0.000049501556,0.00008686004,0.000021744998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003324778,0.0013731355,0.00058630505,0.0010838402,0.0005616993,0.0019203787,0.0005779915,0.00086965243,0.057650957],"category_scores_gemma":[0.0011426356,0.00039277182,0.00036904233,0.0015832876,0.00069237937,0.0020489653,0.0011917384,0.0016807609,0.042476907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014716546,0.000028548448,0.000041820113,0.00025236708,0.000008948606,0.000046352627,0.000081239836,0.0017064282,0.0022600573,0.11665931,0.33418038,0.5447199],"study_design_scores_gemma":[0.0000030086828,0.000016719521,0.00014668898,0.00015023936,0.000005985877,0.00021492963,0.000042650023,0.0055457153,0.0015352538,0.10150518,0.89081585,0.000017790911],"about_ca_topic_score_codex":0.00080907793,"about_ca_topic_score_gemma":0.002381315,"teacher_disagreement_score":0.057650957,"about_ca_system_score_codex":0.00048604546,"about_ca_system_score_gemma":0.0006076999,"threshold_uncertainty_score":0.19286168},"labels":[],"label_agreement":null},{"id":"W4250028000","doi":"10.22215/etd/2012-09703","title":"Node-based verification-based recovery algorithms in compressed sensing : asymptotic analysis and design of irregular sensing matrices (graphs)","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Node (physics); Algorithm; Theoretical computer science; Engineering; Structural engineering","score_opus":0.015446138443340337,"score_gpt":0.23381131700486993,"score_spread":0.2183651785615296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250028000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010370622,0.00014773352,0.987778,0.00022436898,0.000026509471,0.000032647407,0.000038861595,0.0001970478,0.0011841239],"genre_scores_gemma":[0.59305954,0.00064929086,0.40205228,0.00019284702,0.000090719615,0.00014138757,0.0002438239,0.00014002717,0.0034300822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.00036765772,0.000047826856,0.00018433332,0.00040289212,0.00010435274],"domain_scores_gemma":[0.9923524,0.005392165,0.00046545736,0.0007358458,0.00086587237,0.00018820963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019213934,0.000690475,0.0005931663,0.00067541114,0.00032818885,0.0008770094,0.0010827926,0.0007635648,0.0025872753],"category_scores_gemma":[0.013993451,0.00042291466,0.00036279665,0.0006729278,0.0011212432,0.0018788286,0.0015500438,0.0014138522,0.0005539757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045421204,0.00011365648,0.0009254181,0.00023257209,0.00006160014,0.00009879573,0.00022203274,0.673033,0.023652697,0.07853871,0.004508478,0.21815883],"study_design_scores_gemma":[0.000011764809,0.000057997895,0.0000979504,0.00001033017,0.0000053688336,0.000031653337,0.000013892373,0.9856231,0.003408004,0.0103312405,0.00040097724,0.0000075927146],"about_ca_topic_score_codex":0.0018125509,"about_ca_topic_score_gemma":0.002726761,"teacher_disagreement_score":0.0025872753,"about_ca_system_score_codex":0.00070542167,"about_ca_system_score_gemma":0.0014564028,"threshold_uncertainty_score":0.010161459},"labels":[],"label_agreement":null},{"id":"W4281635760","doi":"10.3390/e24060771","title":"Pareto-Optimal Clustering with the Primal Deterministic Information Bottleneck","year":2022,"lang":"en","type":"article","venue":"Entropy","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Foundational Questions Institute; National Science Foundation","keywords":"Cluster analysis; Information bottleneck method; Pareto principle; Mathematical optimization; Computer science; Focus (optics); Mathematics; Algorithm; Artificial intelligence","score_opus":0.005198990602130024,"score_gpt":0.17858149452255487,"score_spread":0.17338250392042484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281635760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023034787,0.00018848287,0.97263926,0.00045636678,0.000020597045,0.00006981593,0.00010182133,0.0002921388,0.0031967978],"genre_scores_gemma":[0.50647986,0.00031678606,0.48527038,0.00042100096,0.00006605981,0.00040195644,0.00055028714,0.00027198237,0.0062216204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923027,0.00026329796,0.000037190803,0.00014189103,0.0002188983,0.000108416585],"domain_scores_gemma":[0.9959974,0.002743837,0.00026252895,0.0003591334,0.0004531547,0.00018391732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027914722,0.0010033179,0.00134617,0.0012777871,0.00086337863,0.0016236517,0.001380684,0.0017410915,0.0030592286],"category_scores_gemma":[0.009695236,0.0006010984,0.0007797817,0.00117722,0.0016698501,0.002016836,0.0026763577,0.0020258354,0.0007031501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011921596,0.00007280259,0.00046734264,0.00010998338,0.00002753368,0.00005735202,0.00009639223,0.8990403,0.0017232309,0.054126877,0.0021912174,0.041967686],"study_design_scores_gemma":[0.000011678594,0.000024523371,0.000062542225,0.0000118694525,0.0000028201566,0.000016173535,0.000016059308,0.9765695,0.0007185322,0.022200674,0.0003594791,0.0000060212988],"about_ca_topic_score_codex":0.0030452178,"about_ca_topic_score_gemma":0.0025316204,"teacher_disagreement_score":0.0030592286,"about_ca_system_score_codex":0.0019495849,"about_ca_system_score_gemma":0.002272603,"threshold_uncertainty_score":0.014762938},"labels":[],"label_agreement":null},{"id":"W4283729979","doi":"10.1145/3529570.3529571","title":"Multilinear Compressed Sensing using Tensor Least Angle Regression (T-LARS)","year":2022,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multilinear map; Kronecker delta; Matching pursuit; Tensor (intrinsic definition); Compressed sensing; Mathematics; Basis pursuit; Kronecker product; Multilinear algebra; Algorithm; Computational complexity theory; Pattern recognition (psychology); Computer science; Artificial intelligence; Algebra over a field; Pure mathematics","score_opus":0.03295716075359058,"score_gpt":0.24977006393301548,"score_spread":0.21681290317942492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283729979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005865561,0.00035184372,0.99186933,0.0002007368,0.000059126978,0.000036312824,0.00009290685,0.00045605056,0.0010681053],"genre_scores_gemma":[0.20671609,0.0011310717,0.78809583,0.0003004653,0.00015010154,0.00012218003,0.0006168523,0.0001938483,0.0026735216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998808,0.000346368,0.0000826917,0.00021255374,0.00046061157,0.000089770234],"domain_scores_gemma":[0.9982816,0.0008474288,0.00019981219,0.00022627763,0.0003797795,0.000065127635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300395,0.001120774,0.0010564286,0.0007131909,0.00044152618,0.0011282939,0.0008350075,0.0010586814,0.0019188519],"category_scores_gemma":[0.004706793,0.000348333,0.0008317299,0.0014038079,0.0008986712,0.0021189859,0.0014415344,0.0019130362,0.0006403219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005177079,0.00016309237,0.0013629339,0.00056089123,0.00020273888,0.00039335762,0.00023394027,0.4684213,0.038273856,0.048789054,0.009030158,0.43205094],"study_design_scores_gemma":[0.00001901903,0.00006820031,0.00017725209,0.0000163838,0.000014870604,0.00012691275,0.000029986606,0.98220545,0.008575738,0.0057017715,0.003036318,0.000028151442],"about_ca_topic_score_codex":0.003959973,"about_ca_topic_score_gemma":0.0039953226,"teacher_disagreement_score":0.003959973,"about_ca_system_score_codex":0.0004024288,"about_ca_system_score_gemma":0.0014129786,"threshold_uncertainty_score":0.007873893},"labels":[],"label_agreement":null},{"id":"W4285028835","doi":"10.1109/tsp.2022.3189173","title":"Novel Recovery Algorithms for Block Sparse Signals With Known and Unknown Borders","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Block (permutation group theory); Iterated function; Bayesian probability; Covariance; Computer science; Gaussian; Mathematics; Artificial intelligence; Statistics","score_opus":0.02557308936222489,"score_gpt":0.2506342416055709,"score_spread":0.22506115224334602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285028835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011973326,0.000061410945,0.99838424,0.00004140048,0.000007750129,0.000011344608,0.000010948599,0.00006479179,0.00022068644],"genre_scores_gemma":[0.054888364,0.00038695033,0.94207436,0.00011966769,0.000059633687,0.0001002565,0.00014225289,0.00008948773,0.0021389502],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992071,0.00015189109,0.000050788236,0.0001319016,0.00039046432,0.00006795568],"domain_scores_gemma":[0.99817026,0.00094861654,0.0002986005,0.00017675641,0.0003417818,0.00006402035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016134161,0.00074218743,0.00087018166,0.00089330436,0.00034997388,0.0008188878,0.0013802437,0.0014236458,0.001618334],"category_scores_gemma":[0.0058224876,0.00059448415,0.00074555026,0.0009303103,0.0007911941,0.0023198458,0.0018344721,0.0018487324,0.00080052787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023630855,0.000095145886,0.0007618399,0.00023290644,0.000076560435,0.00013022586,0.0002741397,0.41201365,0.021403458,0.08527365,0.0034578906,0.47604424],"study_design_scores_gemma":[0.000014419941,0.000023651804,0.000103750936,0.000011013805,0.000008363063,0.00007696671,0.000009367366,0.9883307,0.0026782062,0.0072802478,0.0014510576,0.000012343162],"about_ca_topic_score_codex":0.0015893528,"about_ca_topic_score_gemma":0.0024098584,"teacher_disagreement_score":0.001618334,"about_ca_system_score_codex":0.0006160992,"about_ca_system_score_gemma":0.0011362453,"threshold_uncertainty_score":0.008532703},"labels":[],"label_agreement":null},{"id":"W4285031649","doi":"10.22215/etd/2022-15034","title":"Sparse Signal Recovery with Subbotin Noise","year":2022,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dimension (graph theory); Noise (video); Selection (genetic algorithm); Algorithm; SIGNAL (programming language); Hamming distance; Sequence (biology); Function (biology); Computer science; Variable (mathematics); Model selection; Distribution (mathematics); Mathematics; Pattern recognition (psychology); Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.008562118994801377,"score_gpt":0.21116582900621947,"score_spread":0.20260371001141808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285031649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024412114,0.00077013654,0.9711548,0.0003974779,0.000055096814,0.000021647205,0.000039280498,0.000080935875,0.003068469],"genre_scores_gemma":[0.61863095,0.0032501426,0.36310193,0.00039827867,0.0002628297,0.000097325305,0.00023843942,0.000085428306,0.013934662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956936,0.00010958015,0.000013846015,0.0001175119,0.00015250115,0.000037164842],"domain_scores_gemma":[0.99906415,0.0006239251,0.00009070134,0.00010132661,0.00009102108,0.000028885821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071177044,0.0005388968,0.00082752696,0.00060471566,0.000262513,0.0009885178,0.0005589081,0.00068367535,0.0014172791],"category_scores_gemma":[0.003076642,0.00019718596,0.00032141848,0.00070486794,0.00092498685,0.0013673147,0.0010586159,0.0008431684,0.00041795376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024580225,0.00008189763,0.0012832271,0.00025408735,0.00006580371,0.00027180676,0.000458146,0.5100781,0.027960205,0.298546,0.0024199525,0.15833504],"study_design_scores_gemma":[0.000009080676,0.00007112034,0.00029551832,0.000020114376,0.000008620013,0.000093936884,0.00004670074,0.9407775,0.0066151563,0.048747834,0.0033015478,0.000013003326],"about_ca_topic_score_codex":0.0007606413,"about_ca_topic_score_gemma":0.00077073113,"teacher_disagreement_score":0.0014172791,"about_ca_system_score_codex":0.0004766715,"about_ca_system_score_gemma":0.00046107243,"threshold_uncertainty_score":0.0047412515},"labels":[],"label_agreement":null},{"id":"W4285151347","doi":"10.1109/jstsp.2022.3172592","title":"Deep-Learning Supervised Snapshot Compressive Imaging Enabled by an End-to-End Adaptive Neural Network","year":2022,"lang":"en","type":"article","venue":"IEEE Journal of Selected Topics in Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Fonds de recherche du Québec – Nature et technologies; Fonds de Recherche du Québec - Santé; Natural Sciences and Engineering Research Council of Canada; Sistema General de Regalías de Colombia","keywords":"Computer science; Artificial intelligence; Snapshot (computer storage); Deep learning; Compressed sensing; Convolutional neural network; Iterative reconstruction; Computer vision; End-to-end principle; Hyperspectral imaging; Artificial neural network; Visualization; Pattern recognition (psychology)","score_opus":0.014391634883502221,"score_gpt":0.2349475359821612,"score_spread":0.22055590109865897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285151347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041730955,0.0002419556,0.95275104,0.00027065637,0.00006219898,0.000056631627,0.0001340149,0.0017416035,0.0030109119],"genre_scores_gemma":[0.68671954,0.00025888975,0.30581832,0.00034946104,0.000052479496,0.00013593453,0.00046407944,0.000082210165,0.0061191493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998417,0.000024844743,0.000006041103,0.000040313193,0.00006006396,0.000027033579],"domain_scores_gemma":[0.9997619,0.00007811267,0.000026981403,0.00003319396,0.00007439758,0.000025546917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035443413,0.0006727496,0.0003975438,0.00018043409,0.00023813493,0.0004263562,0.0009157281,0.00056916475,0.0013659839],"category_scores_gemma":[0.0009823405,0.0002654165,0.00020245404,0.00023943401,0.00045301317,0.00082540774,0.00089052616,0.0010782456,0.00037024132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005706244,0.00027406472,0.00241827,0.00014589472,0.00009110724,0.00022399964,0.00013241824,0.53098625,0.06841607,0.0104937805,0.006959263,0.37928835],"study_design_scores_gemma":[0.0000042954307,0.000028730703,0.00009478389,0.000002498504,0.0000028711597,0.000013359043,0.000004004202,0.9939911,0.004540262,0.00092456216,0.00038905776,0.000004510438],"about_ca_topic_score_codex":0.0037472805,"about_ca_topic_score_gemma":0.0097589195,"teacher_disagreement_score":0.0037472805,"about_ca_system_score_codex":0.00048252326,"about_ca_system_score_gemma":0.0008435658,"threshold_uncertainty_score":0.007450938},"labels":[],"label_agreement":null},{"id":"W4285242719","doi":"10.23952/jano.4.2022.2.09","title":"A constrained LiGME model and its proximal splitting algorithm under overall convexity condition","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Algorithm; Mathematics; Computer science; Combinatorics; Applied mathematics; Economics","score_opus":0.011029380757755265,"score_gpt":0.21775269350536228,"score_spread":0.20672331274760702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285242719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025949022,0.00006891742,0.99605113,0.00015441947,0.0000126203495,0.000014993741,0.000027035825,0.000041980744,0.0010339157],"genre_scores_gemma":[0.43371698,0.000526658,0.5520485,0.00049130013,0.00009861959,0.00037829255,0.00035090884,0.00017537338,0.0122134285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994624,0.00020882236,0.00001996659,0.0001151979,0.00014298841,0.000050573537],"domain_scores_gemma":[0.9993741,0.00033823086,0.0000645523,0.000068353154,0.000108682936,0.000046144414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783723,0.0007251142,0.0008882505,0.00044456084,0.00036608978,0.00089222105,0.0015980751,0.0017318529,0.003634113],"category_scores_gemma":[0.0028894905,0.00042451516,0.0008384203,0.00056629244,0.0012621069,0.001780504,0.0020594413,0.0018960959,0.00074904127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009799179,0.000040673236,0.00045130317,0.000100377896,0.000038234266,0.00011267724,0.00011631488,0.78012645,0.0044431863,0.17051955,0.002421717,0.041531473],"study_design_scores_gemma":[0.0000070885535,0.000025302088,0.00004407202,0.000005253397,0.0000037872414,0.000021606633,0.000006542243,0.9851893,0.00039261492,0.0134364925,0.0008601692,0.000007812571],"about_ca_topic_score_codex":0.0016630801,"about_ca_topic_score_gemma":0.0014346697,"teacher_disagreement_score":0.003634113,"about_ca_system_score_codex":0.00057238917,"about_ca_system_score_gemma":0.0008105982,"threshold_uncertainty_score":0.012157381},"labels":[],"label_agreement":null},{"id":"W4285282375","doi":"10.1109/tcomm.2022.3189072","title":"Spectrum Reconstruction via Deep Convolutional Neural Networks for Satellite Communication Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Convolutional neural network; Data transmission; Spectrum (functional analysis); Satellite; Transmission (telecommunications); Artificial neural network; Artificial intelligence; Remote sensing; Algorithm; Telecommunications; Computer network; Engineering; Physics","score_opus":0.024181353669605263,"score_gpt":0.23487012382597253,"score_spread":0.21068877015636728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285282375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061808996,0.0013868589,0.93198687,0.00050231256,0.00006481703,0.000029013692,0.000123259,0.0007443705,0.0033535317],"genre_scores_gemma":[0.91306436,0.00060506,0.08274705,0.00013241392,0.000041716146,0.000032587926,0.00022391108,0.000042127696,0.0031108079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979526,0.000046573157,0.000010329273,0.000041884614,0.00007106092,0.000034859007],"domain_scores_gemma":[0.99964297,0.00018708032,0.00005106489,0.00003082464,0.0000740384,0.000014033446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044849276,0.0006035187,0.00035163297,0.00026691242,0.00019164388,0.00042830623,0.000603813,0.0005922017,0.0009028728],"category_scores_gemma":[0.0014678723,0.0002519767,0.0002842444,0.0003671798,0.00041950832,0.00066789443,0.0006001453,0.0010101858,0.00016500344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098643904,0.000034463857,0.00081588246,0.000056333214,0.000027757029,0.00006671653,0.000030640425,0.93130034,0.0041896263,0.0048914426,0.00078166596,0.057706464],"study_design_scores_gemma":[7.7432503e-7,0.0000048851784,0.000040609455,0.000001589712,0.0000013513395,0.000003991413,0.0000016270044,0.9988998,0.00040976092,0.00056160433,0.00007275019,0.0000011479548],"about_ca_topic_score_codex":0.010299519,"about_ca_topic_score_gemma":0.010697824,"teacher_disagreement_score":0.010299519,"about_ca_system_score_codex":0.0007696394,"about_ca_system_score_gemma":0.0006554161,"threshold_uncertainty_score":0.020479083},"labels":[],"label_agreement":null},{"id":"W4286569393","doi":"10.1109/sam53842.2022.9827860","title":"Sparse Signal Recovery Using a Binary Program","year":2022,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Underdetermined system; Binary number; Compressed sensing; Relaxation (psychology); Norm (philosophy); Computer science; Basis pursuit; Algorithm; Heuristic; Signal recovery; SIGNAL (programming language); Signal reconstruction; Signal processing; Mathematics; Mathematical optimization; Artificial intelligence; Matching pursuit","score_opus":0.030283802927736185,"score_gpt":0.24835609296537361,"score_spread":0.21807229003763742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286569393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004644321,0.000073550495,0.99169075,0.00031803778,0.000014830661,0.000035547637,0.00007991891,0.00016152748,0.0029815803],"genre_scores_gemma":[0.23348549,0.0004250954,0.7515943,0.0003955744,0.00009014348,0.0005647737,0.0006024367,0.00028724552,0.012554885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989222,0.00044340975,0.000039854523,0.00017940703,0.00030328069,0.00011184857],"domain_scores_gemma":[0.997696,0.0017130654,0.00014246072,0.00008784881,0.00029268285,0.000067914865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00195951,0.0008031842,0.00088816916,0.0008038063,0.00039320937,0.0015562115,0.00080105587,0.0013989653,0.0053910734],"category_scores_gemma":[0.0069383034,0.0005129422,0.00071627065,0.0009719326,0.0012665977,0.0014867979,0.0017943854,0.002014905,0.00084223173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019858907,0.00010567868,0.00081380527,0.00018247974,0.000028173416,0.00014961498,0.00015269687,0.744269,0.0026998688,0.17600371,0.003869514,0.07152684],"study_design_scores_gemma":[0.0000118032885,0.000020613314,0.000038939357,0.000010571926,0.0000027468745,0.000014273278,0.000010048119,0.9794136,0.0005317511,0.018933685,0.0010080094,0.0000040255636],"about_ca_topic_score_codex":0.0028083299,"about_ca_topic_score_gemma":0.0021063888,"teacher_disagreement_score":0.0053910734,"about_ca_system_score_codex":0.0009509814,"about_ca_system_score_gemma":0.0017383834,"threshold_uncertainty_score":0.018034875},"labels":[],"label_agreement":null},{"id":"W4287117439","doi":"10.48550/arxiv.2106.09687","title":"Super-Acceleration with Cyclical Step-sizes","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Quadratic equation; Rate of convergence; Minification; Acceleration; Convergence (economics); Momentum (technical analysis); Quadratic programming; Constant (computer programming); Mathematical optimization; Computer science; Ordinary least squares; Applied mathematics; Mathematics; Machine learning; Physics","score_opus":0.05717319929607896,"score_gpt":0.16824997539177597,"score_spread":0.11107677609569701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287117439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008965737,0.0002688468,0.9857385,0.0004332451,0.000105217885,0.000052473777,0.00003792691,0.0004410046,0.0039570304],"genre_scores_gemma":[0.427289,0.0005491947,0.56424814,0.000562374,0.00017630322,0.00041747512,0.00015297184,0.00048089,0.006123684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990476,0.0003109254,0.000047649675,0.00015327429,0.0003419237,0.00009859815],"domain_scores_gemma":[0.9933804,0.0041634818,0.0003966108,0.0011007494,0.0006958274,0.00026286396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026622342,0.0010818301,0.0007410188,0.00071075704,0.00053150917,0.0009795281,0.0016211307,0.0013098596,0.005742654],"category_scores_gemma":[0.02105269,0.00047704807,0.0005333097,0.0005988534,0.0016974887,0.002344987,0.0023964196,0.0026237122,0.0011588152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035192783,0.00015991493,0.0016666675,0.00032324615,0.00007096507,0.0001929695,0.0002711643,0.62371844,0.012937488,0.23595192,0.006906254,0.11744898],"study_design_scores_gemma":[0.000012195933,0.000053408206,0.00008868766,0.000019430363,0.0000043724135,0.000032650743,0.0000111367835,0.9763091,0.0013454668,0.020714799,0.0014004045,0.0000084073445],"about_ca_topic_score_codex":0.0017183456,"about_ca_topic_score_gemma":0.0023751978,"teacher_disagreement_score":0.005742654,"about_ca_system_score_codex":0.00079490425,"about_ca_system_score_gemma":0.0013080804,"threshold_uncertainty_score":0.019211054},"labels":[],"label_agreement":null},{"id":"W4287995735","doi":"10.48550/arxiv.1912.07357","title":"Increasing Energy Efficiency in Sensor Networks: Blue Noise Sampling and\\n Non-Convex Matrix Completion","year":2019,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Sampling (signal processing); Wireless sensor network; Matrix (chemical analysis); Sample (material); Energy (signal processing); Computer science; Noise (video); Convex optimization; Regular polygon; Algorithm; Mathematical optimization; Grid; Mathematics; Statistics; Telecommunications; Artificial intelligence","score_opus":0.0400187804777976,"score_gpt":0.19230713334734156,"score_spread":0.15228835286954395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287995735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027315998,0.0006538625,0.96927947,0.0005950812,0.000038015703,0.000026752617,0.00003315883,0.00016698251,0.0018905806],"genre_scores_gemma":[0.74165434,0.0013242604,0.25233462,0.00025053925,0.00017035619,0.00009680054,0.00014564265,0.00012354026,0.0038999736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988211,0.0006279723,0.000029921193,0.0001279201,0.00031256423,0.00008058608],"domain_scores_gemma":[0.996888,0.0021710645,0.00021937421,0.00037980976,0.00026191358,0.00007990442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017647218,0.0006665299,0.0007034319,0.00050975574,0.00028911623,0.00065866794,0.00085155386,0.00068352744,0.0008445595],"category_scores_gemma":[0.007009465,0.00034227924,0.00036169917,0.0008857943,0.0014861024,0.0016473046,0.0012781944,0.0011077779,0.00017335924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026042073,0.0001136693,0.00085015915,0.00012135187,0.000043467993,0.00009701033,0.00013758,0.8450667,0.0059189554,0.063890405,0.0023607146,0.08113959],"study_design_scores_gemma":[0.0000066001135,0.000026440088,0.00011450327,0.000004080725,0.0000028540894,0.000018418417,0.00001323207,0.9871093,0.0010640899,0.011285156,0.0003516316,0.0000036780664],"about_ca_topic_score_codex":0.0019126293,"about_ca_topic_score_gemma":0.0018050392,"teacher_disagreement_score":0.0019126293,"about_ca_system_score_codex":0.0006718282,"about_ca_system_score_gemma":0.0006573341,"threshold_uncertainty_score":0.009332836},"labels":[],"label_agreement":null},{"id":"W4290103647","doi":"10.48550/arxiv.1501.02414","title":"Convergence Rates and Decoupling in Linear Stochastic Approximation\\n Algorithms","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Positive-definite matrix; Decoupling (probability); Combinatorics; Mathematics; Multivariate random variable; Convergence (economics); Physics; Random variable; Quantum mechanics; Statistics; Eigenvalues and eigenvectors","score_opus":0.08540877926285026,"score_gpt":0.2147011842864278,"score_spread":0.12929240502357753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290103647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021802042,0.0012375293,0.96056956,0.0010129012,0.00013291009,0.000121296325,0.00015200423,0.0004708815,0.0145009635],"genre_scores_gemma":[0.6829905,0.0034390877,0.26788935,0.0015060082,0.0005005948,0.0009870772,0.001198334,0.0010473762,0.04044168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925735,0.003834567,0.00032046615,0.0009857422,0.0016220546,0.0006636481],"domain_scores_gemma":[0.9660098,0.025771702,0.0017034343,0.002360435,0.0031309742,0.0010236222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014055531,0.0025434787,0.0022939665,0.0021095714,0.0013586346,0.0035268692,0.0035057848,0.0020619417,0.005629806],"category_scores_gemma":[0.06666985,0.0014376965,0.0018542618,0.0017630392,0.0047385725,0.005761672,0.0061623156,0.004774402,0.0016079741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004619591,0.00015686026,0.0013674167,0.00045868268,0.00015349001,0.00011151183,0.00032458804,0.3910701,0.0018083706,0.5530481,0.004918681,0.04612031],"study_design_scores_gemma":[0.000024233528,0.000056427714,0.00016831045,0.000041580934,0.000018717239,0.000032245876,0.000027944272,0.8954099,0.00070350885,0.10241106,0.0010908665,0.000015237977],"about_ca_topic_score_codex":0.004031758,"about_ca_topic_score_gemma":0.0026046678,"teacher_disagreement_score":0.014055531,"about_ca_system_score_codex":0.0042814235,"about_ca_system_score_gemma":0.0037184588,"threshold_uncertainty_score":0.07433367},"labels":[],"label_agreement":null},{"id":"W4292736709","doi":"10.48550/arxiv.1306.4549","title":"Sigma-Delta quantization of sub-Gaussian frame expansions and its\\n application to compressed sensing","year":2013,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oversampling; Quantization (signal processing); Mathematics; Gaussian; Compressed sensing; Sigma; Upper and lower bounds; Algorithm; Mathematical analysis; Physics; Quantum mechanics","score_opus":0.04743482278225515,"score_gpt":0.1928588767749472,"score_spread":0.14542405399269204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292736709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019308766,0.00070023246,0.9752377,0.0004356255,0.0000749161,0.00001657201,0.000079434285,0.00008927103,0.0040573576],"genre_scores_gemma":[0.71966904,0.0029255995,0.2672305,0.000498891,0.00029959393,0.00010287017,0.00032436178,0.0000705577,0.008878525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948066,0.00016672956,0.000020620997,0.00006827868,0.00020262241,0.00006106497],"domain_scores_gemma":[0.9984541,0.0009503675,0.00012418909,0.00022002749,0.00019022808,0.00006118404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010571042,0.00049581093,0.00038213105,0.0005778166,0.0002909961,0.0006552975,0.0006106375,0.0006639839,0.0016195015],"category_scores_gemma":[0.0044487217,0.00021825248,0.0003118276,0.00075527205,0.0014956419,0.0010444566,0.0011945985,0.0014163366,0.00029959492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013435283,0.00002829665,0.0005439328,0.00009366931,0.000017087626,0.00021323419,0.00020664508,0.1164453,0.009491398,0.82500345,0.002004563,0.04581807],"study_design_scores_gemma":[0.0000068993436,0.000044157423,0.00021860187,0.000025973815,0.000005353701,0.00009792521,0.00003645342,0.8242247,0.0030849422,0.17038149,0.0018594551,0.0000140513375],"about_ca_topic_score_codex":0.0017005403,"about_ca_topic_score_gemma":0.0015131142,"teacher_disagreement_score":0.0017005403,"about_ca_system_score_codex":0.00056254416,"about_ca_system_score_gemma":0.0005206622,"threshold_uncertainty_score":0.005590558},"labels":[],"label_agreement":null},{"id":"W4298038717","doi":"10.48550/arxiv.1010.4612","title":"Recovering Compressively Sampled Signals Using Partial Support\\n Information","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minification; Compressed sensing; Signal reconstruction; SIGNAL (programming language); Noise (video); Algorithm; Signal recovery; Mathematics; Compressibility; Computer science; Signal processing; Mathematical optimization; Artificial intelligence; Image (mathematics); Telecommunications; Physics","score_opus":0.09296329274702077,"score_gpt":0.20132735648792097,"score_spread":0.1083640637409002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298038717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13783751,0.00046993967,0.85832995,0.00040991954,0.000033483262,0.00003560276,0.00016451564,0.00012007903,0.00259895],"genre_scores_gemma":[0.84771204,0.0007234101,0.1483379,0.00015041328,0.0000933128,0.000070297756,0.000462624,0.00007681926,0.0023731615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928683,0.00022206751,0.0000424366,0.00012799317,0.00026749438,0.00005312539],"domain_scores_gemma":[0.9968522,0.0021482725,0.00036608352,0.00032040855,0.00025427365,0.00005862874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014886842,0.0010823162,0.0008120474,0.0005577655,0.0002416103,0.00082044164,0.0008065562,0.001026304,0.0011747512],"category_scores_gemma":[0.009438822,0.00038727355,0.000408369,0.0005734204,0.0013686487,0.002165219,0.0016120778,0.0007585421,0.00026459154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082231214,0.00011876564,0.001741205,0.00059741014,0.0001481127,0.00045185827,0.00026421246,0.68085444,0.08159795,0.097930856,0.001178192,0.13429464],"study_design_scores_gemma":[0.000016559316,0.00010434526,0.00036360626,0.000026968983,0.000015076291,0.000118955744,0.00004361488,0.962347,0.019749314,0.016586954,0.0006035676,0.000024096991],"about_ca_topic_score_codex":0.0005522689,"about_ca_topic_score_gemma":0.0005393933,"teacher_disagreement_score":0.0014886842,"about_ca_system_score_codex":0.00029765948,"about_ca_system_score_gemma":0.000382068,"threshold_uncertainty_score":0.007872999},"labels":[],"label_agreement":null},{"id":"W4299945949","doi":"10.48550/arxiv.1402.2601","title":"Near Oracle Performance and Block Analysis of Signal Space Greedy\\n Methods","year":2014,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Azrieli Foundation; National Science Foundation","keywords":"Orthonormal basis; Compressed sensing; Oracle; Block (permutation group theory); Algorithm; Computer science; SIGNAL (programming language); Additive white Gaussian noise; Greedy algorithm; Space (punctuation); Basis (linear algebra); Gaussian; Noise (video); Signal recovery; Mathematics; White noise; Artificial intelligence; Telecommunications; Combinatorics; Physics","score_opus":0.054104160905187895,"score_gpt":0.21081882913201894,"score_spread":0.15671466822683106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299945949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05486388,0.0011476506,0.93759423,0.0003996243,0.000051591753,0.00007485431,0.00009446089,0.0003307061,0.005443],"genre_scores_gemma":[0.73322064,0.0012621406,0.2605029,0.00017741238,0.00011944301,0.00015791968,0.00034244158,0.00024388179,0.0039731115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980128,0.0009684234,0.000060164875,0.00011904457,0.00069751125,0.00014199073],"domain_scores_gemma":[0.9862155,0.010935284,0.0005949086,0.000983041,0.0009900889,0.00028109906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036693579,0.0007122366,0.00079187064,0.00069484924,0.0003468448,0.00092048326,0.0007584004,0.0010817446,0.0034264731],"category_scores_gemma":[0.019427912,0.00028849614,0.00029187108,0.0006251512,0.0013502763,0.0019560095,0.0017791376,0.0011434632,0.0005798709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008918699,0.000119279335,0.0016895737,0.00023832411,0.00006890664,0.00011453272,0.00013956301,0.79516006,0.013386831,0.1065419,0.0022029534,0.07944626],"study_design_scores_gemma":[0.000006992226,0.00006575172,0.00013015453,0.000006409504,0.0000033885667,0.000027498103,0.000010349265,0.99329233,0.0014381268,0.0047366153,0.0002767253,0.000005633015],"about_ca_topic_score_codex":0.0013287327,"about_ca_topic_score_gemma":0.0010131587,"teacher_disagreement_score":0.0036693579,"about_ca_system_score_codex":0.0007198598,"about_ca_system_score_gemma":0.0010158641,"threshold_uncertainty_score":0.019405603},"labels":[],"label_agreement":null},{"id":"W4301359116","doi":"10.48550/arxiv.1310.7042","title":"On Convexification of Range Measurement Based Sensor and Source\\n Localization Problems","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex optimization; Convexity; Minification; Proper convex function; Range (aeronautics); Regular polygon; Mathematical optimization; Computer science; Function (biology); Convex set; Convex function; Convex analysis; Noise (video); Set (abstract data type); Optimization problem; Algorithm; Mathematics; Artificial intelligence; Engineering; Geometry","score_opus":0.08262417507978918,"score_gpt":0.16453611369618046,"score_spread":0.08191193861639127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301359116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00388763,0.00044451508,0.989746,0.00063133397,0.0000417337,0.00003407882,0.00007779294,0.00004345122,0.005093565],"genre_scores_gemma":[0.42307055,0.006356994,0.5466777,0.0009836823,0.00078119873,0.0007855213,0.0012862188,0.00060032343,0.01945773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965062,0.0019459195,0.0001307344,0.0005606017,0.00068611826,0.00017039958],"domain_scores_gemma":[0.9896143,0.008107401,0.00060672284,0.0005611909,0.0008861188,0.00022428652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058324714,0.0023216621,0.0015597533,0.0014405772,0.0006205128,0.002438393,0.0017346655,0.0018566665,0.0036038065],"category_scores_gemma":[0.016196724,0.000956149,0.0013986856,0.0014783125,0.003565464,0.0044088676,0.0038953754,0.0037333588,0.00079372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010540823,0.000060829745,0.00058852404,0.00043079394,0.0000650682,0.0002596904,0.00024848292,0.47311774,0.002672975,0.4790007,0.0051155873,0.03833432],"study_design_scores_gemma":[0.000012886288,0.0000516244,0.00026752584,0.000056533743,0.000013317347,0.00010620234,0.00005657819,0.8288404,0.0013762418,0.16610022,0.0030987156,0.000019792438],"about_ca_topic_score_codex":0.001954649,"about_ca_topic_score_gemma":0.0009403026,"teacher_disagreement_score":0.0058324714,"about_ca_system_score_codex":0.0019201161,"about_ca_system_score_gemma":0.0011327184,"threshold_uncertainty_score":0.030845463},"labels":[],"label_agreement":null},{"id":"W4301407104","doi":"10.48550/arxiv.1511.04650","title":"Inverse Optimization: Closed-form Solutions, Geometry and Goodness of\\n fit","year":2015,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Collège de Maisonneuve; University of Toronto","funders":"","keywords":"Mathematics; Mathematical optimization; Goodness of fit; Inverse; Applied mathematics; Metric (unit); Inverse problem; Geometric programming; Mathematical analysis; Statistics; Geometry","score_opus":0.11812987001309548,"score_gpt":0.1958056578865515,"score_spread":0.07767578787345601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301407104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029334954,0.00052299123,0.9936783,0.0004815993,0.000032546155,0.000021420923,0.000059686874,0.00010589043,0.0021642114],"genre_scores_gemma":[0.380725,0.0038408646,0.6059905,0.00059619156,0.00048038358,0.0004951148,0.00083545566,0.00065487233,0.006381667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745566,0.0012174613,0.00010357998,0.0004426416,0.0006561926,0.00012446962],"domain_scores_gemma":[0.9925223,0.00556614,0.0005685609,0.00058531645,0.00061138155,0.000146322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038469816,0.0018948094,0.0015777302,0.0015232495,0.00054454064,0.0027440432,0.0015320531,0.0027478233,0.00353142],"category_scores_gemma":[0.02386088,0.0007725614,0.0009528347,0.0015802905,0.0035509954,0.0038126353,0.003875643,0.003315612,0.0008816628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051662217,0.000050196762,0.0007164818,0.00025320353,0.00004366855,0.00010924986,0.00012940798,0.5417057,0.001549042,0.39595363,0.0051832055,0.05425445],"study_design_scores_gemma":[0.000007251394,0.00003268648,0.00012713499,0.000039013517,0.000006100303,0.00006617079,0.000031664847,0.8144357,0.00055702473,0.18231614,0.0023637298,0.000017297605],"about_ca_topic_score_codex":0.0016813915,"about_ca_topic_score_gemma":0.0014196802,"teacher_disagreement_score":0.0038469816,"about_ca_system_score_codex":0.001539243,"about_ca_system_score_gemma":0.0012419127,"threshold_uncertainty_score":0.020345032},"labels":[],"label_agreement":null},{"id":"W4301865985","doi":"","title":"Ultrafast Vector Doppler Using RF Sub-Nyquist Sampling","year":2017,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Nyquist–Shannon sampling theorem; Doppler effect; Ultrashort pulse; Sampling (signal processing); Computer science; Nyquist frequency; Electronic engineering; Physics; Optics; Telecommunications; Engineering; Bandwidth (computing); Computer vision","score_opus":0.037012228885180805,"score_gpt":0.25625580418919386,"score_spread":0.21924357530401306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301865985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029118575,0.00078016875,0.9605334,0.00037591264,0.00017038845,0.00003554336,0.00012420648,0.0003404071,0.008521348],"genre_scores_gemma":[0.37028039,0.0014202491,0.6128773,0.000267718,0.00029734787,0.000110599896,0.00032043285,0.00012972754,0.014296256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995665,0.00012782477,0.000016911848,0.000062132,0.00019006424,0.00003654304],"domain_scores_gemma":[0.99894375,0.00063159084,0.00008255471,0.00017972944,0.000107817454,0.00005467842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051578286,0.0007177448,0.00052755605,0.00042951666,0.0003278402,0.00083139236,0.00044898468,0.0007959673,0.0046749744],"category_scores_gemma":[0.0021627622,0.00027153234,0.0002189816,0.0007973676,0.00069467974,0.0014810524,0.0011070536,0.0010259458,0.0012147594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013969813,0.00018863195,0.0022494977,0.00044685858,0.000087093445,0.00031974612,0.0006057938,0.06943234,0.2562048,0.18769088,0.0057683075,0.47560894],"study_design_scores_gemma":[0.0000645985,0.0001903469,0.0012382689,0.00007445999,0.000023972143,0.00058294437,0.000081707825,0.8733229,0.053819723,0.051316697,0.019205878,0.000078437115],"about_ca_topic_score_codex":0.0005134663,"about_ca_topic_score_gemma":0.00095582026,"teacher_disagreement_score":0.0046749744,"about_ca_system_score_codex":0.00034707936,"about_ca_system_score_gemma":0.00040939043,"threshold_uncertainty_score":0.015639365},"labels":[],"label_agreement":null},{"id":"W4301913596","doi":"10.48550/arxiv.1403.5901","title":"Finding the largest low-rank clusters with Ky Fan $2$-$k$-norm and\\n $\\\\ell_1$-norm","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Matrix norm; Mathematics; Norm (philosophy); Rank (graph theory); Combinatorics; Diagonal; Regular polygon; Block matrix; Matrix (chemical analysis); Random noise; Low-rank approximation; Random matrix; Discrete mathematics; Pure mathematics; Algorithm; Physics; Geometry; Eigenvalues and eigenvectors","score_opus":0.03364454252789087,"score_gpt":0.15972137778168885,"score_spread":0.12607683525379798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301913596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010073538,0.00014176157,0.98722434,0.00049367564,0.00002647663,0.00004261527,0.00014440806,0.00016822421,0.0016849919],"genre_scores_gemma":[0.27710804,0.00048358543,0.7128168,0.00040992076,0.00020819885,0.00033645894,0.001072742,0.00026605712,0.007298194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882954,0.00041754966,0.000051630246,0.00032061638,0.00026904966,0.00011152665],"domain_scores_gemma":[0.99772626,0.0012298292,0.00029683064,0.0002651618,0.00036496867,0.00011687047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016940049,0.0014548302,0.0013664971,0.0010660097,0.0007641496,0.0018185092,0.0014844184,0.0019030058,0.0032895242],"category_scores_gemma":[0.008665108,0.00059127965,0.00066032226,0.0010869312,0.0020448957,0.002380367,0.0017542229,0.0016200183,0.0011061903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035145276,0.00016419584,0.0012769798,0.00044058246,0.000105643114,0.00023773125,0.0002814942,0.7219057,0.014557827,0.13451469,0.012352286,0.11381142],"study_design_scores_gemma":[0.000017677996,0.000039307444,0.00018698869,0.000016754662,0.000007334936,0.000052922307,0.00005911358,0.95873266,0.0028847475,0.036413155,0.0015683353,0.000020980691],"about_ca_topic_score_codex":0.0037418122,"about_ca_topic_score_gemma":0.0041770064,"teacher_disagreement_score":0.0037418122,"about_ca_system_score_codex":0.00085339654,"about_ca_system_score_gemma":0.0016164983,"threshold_uncertainty_score":0.011004567},"labels":[],"label_agreement":null},{"id":"W4304957737","doi":"10.1007/s10107-022-01899-0","title":"An elementary approach to tight worst case complexity analysis of gradient based methods","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Israel Science Foundation","keywords":"Mathematics; Gradient descent; Gradient method; Proximal Gradient Methods; Convergence (economics); Mathematical optimization; Applied mathematics; Stochastic gradient descent; Algorithm; Convex optimization; Regular polygon; Computer science; Artificial intelligence; Artificial neural network; Geometry","score_opus":0.06827123328029666,"score_gpt":0.34118129193612035,"score_spread":0.2729100586558237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304957737","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012586252,0.0004844172,0.98980474,0.00090005016,0.00016443894,0.000038992355,0.000077052835,0.00012969332,0.00714199],"genre_scores_gemma":[0.2604559,0.004543494,0.6961448,0.0031809458,0.003248433,0.0012224375,0.00059684494,0.0017100025,0.02889706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99133825,0.0030861131,0.00032114453,0.0010312229,0.0034968008,0.00072649645],"domain_scores_gemma":[0.9743561,0.018406862,0.0009671833,0.0031377412,0.0025195654,0.0006125324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009717066,0.0038426188,0.002513623,0.003285435,0.0016997627,0.005291441,0.0052581085,0.0027485788,0.0104993805],"category_scores_gemma":[0.04820067,0.0015918904,0.002755778,0.0030101284,0.005676197,0.010680351,0.007551739,0.014527877,0.0023133326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087531465,0.00011652249,0.0002872094,0.00027681046,0.000078261,0.00009484277,0.00018398976,0.08050092,0.0023023158,0.88101053,0.008336813,0.026724337],"study_design_scores_gemma":[0.000010494983,0.000058148067,0.00019385778,0.00007645322,0.000031114538,0.0000665431,0.000030282552,0.4141352,0.0013084246,0.5788991,0.005162858,0.000027533004],"about_ca_topic_score_codex":0.0015893937,"about_ca_topic_score_gemma":0.0018260715,"teacher_disagreement_score":0.0104993805,"about_ca_system_score_codex":0.0033197794,"about_ca_system_score_gemma":0.0029095418,"threshold_uncertainty_score":0.051389337},"labels":[],"label_agreement":null},{"id":"W4310029390","doi":"10.21203/rs.3.rs-2310550/v1","title":"Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; McGill University Health Centre","funders":"","keywords":"Hyperparameter; Convergence (economics); Lasso (programming language); Mathematical optimization; Computer science; Rate of convergence; Sequence (biology); Function (biology); Algorithm; Mathematics; Key (lock)","score_opus":0.15757840963929254,"score_gpt":0.465271887888403,"score_spread":0.3076934782491105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310029390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027802666,0.00020644227,0.996283,0.0001424167,0.000034309072,0.000021653757,0.000012143471,0.00011269032,0.00040709416],"genre_scores_gemma":[0.26372668,0.0009837521,0.72724956,0.000252167,0.00028173227,0.0003506141,0.00020060017,0.00026527044,0.006689626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989887,0.0004940739,0.00003754304,0.00010956684,0.00031277677,0.00005744411],"domain_scores_gemma":[0.99767154,0.001437639,0.0002128883,0.0002004141,0.00038875453,0.00008877451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021691788,0.0012756761,0.0010443297,0.00092197856,0.00041580084,0.00069236784,0.0010956806,0.0013241689,0.0021715343],"category_scores_gemma":[0.007787626,0.0005192551,0.0006949168,0.00103428,0.0014252003,0.0013124014,0.0017094242,0.0024090768,0.00057220395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012820687,0.00007504066,0.00046558803,0.00020596437,0.00006707844,0.0001285927,0.00010564501,0.78338945,0.0059264842,0.10434414,0.0037273979,0.10143641],"study_design_scores_gemma":[0.000006635681,0.0000133492695,0.000035085883,0.000005150844,0.0000016424634,0.000011508975,0.000002308654,0.9903459,0.00042977754,0.0084492015,0.000696216,0.0000031768222],"about_ca_topic_score_codex":0.0021908798,"about_ca_topic_score_gemma":0.0018859118,"teacher_disagreement_score":0.0021908798,"about_ca_system_score_codex":0.0006997325,"about_ca_system_score_gemma":0.0011330583,"threshold_uncertainty_score":0.011471868},"labels":[],"label_agreement":null},{"id":"W4310352586","doi":"10.21203/rs.3.rs-2310001/v1","title":"ICRICS: Iterative Compensation Recovery for Image Compressive Sensing","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Compressed sensing; Computer science; Compensation (psychology); Noise (video); Similarity (geometry); Image (mathematics); Algorithm; Sampling (signal processing); SIGNAL (programming language); Peak signal-to-noise ratio; Control theory (sociology); Artificial intelligence; Computer vision; Control (management)","score_opus":0.07868981833216729,"score_gpt":0.3829435355090559,"score_spread":0.30425371717688865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310352586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009512413,0.00038163757,0.9862692,0.00016354326,0.00011005679,0.000079633646,0.00004870503,0.0010242653,0.002410581],"genre_scores_gemma":[0.37717047,0.0004506002,0.61379516,0.00025923736,0.00017647288,0.00017674,0.00027127645,0.000108975706,0.007591189],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993586,0.00011408939,0.00002766324,0.000110426634,0.00034470318,0.000044648954],"domain_scores_gemma":[0.9996308,0.00009686996,0.00005841385,0.00006814789,0.00012480412,0.000021038855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005941237,0.00070156704,0.00045844508,0.00062886876,0.00032305773,0.00044609932,0.0008088567,0.00073378294,0.0022548467],"category_scores_gemma":[0.0012315025,0.00019504194,0.00032941953,0.00051705085,0.00075754157,0.00056499854,0.0008411999,0.00075203343,0.00058805256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046756992,0.0001524093,0.00083194836,0.0003476299,0.00008588906,0.00026540883,0.00017455706,0.1667446,0.1717244,0.031073267,0.011240856,0.61689144],"study_design_scores_gemma":[0.000024047002,0.00013692601,0.00030537831,0.000017098497,0.0000095753485,0.00017737462,0.000014146455,0.9580434,0.03312093,0.002421107,0.0057099154,0.000020105092],"about_ca_topic_score_codex":0.0016360211,"about_ca_topic_score_gemma":0.0020042316,"teacher_disagreement_score":0.0022548467,"about_ca_system_score_codex":0.00038235934,"about_ca_system_score_gemma":0.00086870784,"threshold_uncertainty_score":0.007543206},"labels":[],"label_agreement":null},{"id":"W4312042120","doi":"10.48550/arxiv.1810.11115","title":"Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Matching pursuit; Pointwise; Greedy algorithm; Extension (predicate logic); Multivariate statistics; Matching (statistics); Mathematics; Minification; Algorithm; Selection (genetic algorithm); Computer science; Pattern recognition (psychology); Mathematical optimization; Artificial intelligence; Compressed sensing; Statistics","score_opus":0.06162911851215334,"score_gpt":0.1875192144211966,"score_spread":0.12589009590904326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312042120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007943728,0.000056779467,0.99152267,0.00006593572,0.000007988413,0.000015126404,0.00002715619,0.000058108602,0.00030246002],"genre_scores_gemma":[0.4004358,0.0004607453,0.597044,0.00013518461,0.00007683878,0.00017169963,0.0003147228,0.00008204305,0.0012788915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990964,0.00039923014,0.000040775172,0.00013238727,0.00027318476,0.000058092097],"domain_scores_gemma":[0.9983046,0.0011002896,0.00019079547,0.0002319096,0.00013142014,0.000041008054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019444784,0.0008608625,0.0009053421,0.0006658698,0.00024532198,0.0008635992,0.0010912706,0.00070504163,0.0008380365],"category_scores_gemma":[0.006441849,0.00030808037,0.00060148066,0.0013095009,0.0008597656,0.0015442042,0.0017882583,0.0012667677,0.00027968598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022809466,0.00009574536,0.00094477896,0.00019813882,0.00010029406,0.00018682172,0.00010123281,0.77927935,0.020931086,0.06861915,0.001515382,0.12779999],"study_design_scores_gemma":[0.0000048386514,0.000020918282,0.000060828,0.000003305075,0.000003228002,0.000019094325,0.0000053999547,0.9904463,0.0015693583,0.007640812,0.00022212579,0.000003821918],"about_ca_topic_score_codex":0.0009863348,"about_ca_topic_score_gemma":0.0010289145,"teacher_disagreement_score":0.0019444784,"about_ca_system_score_codex":0.00032916965,"about_ca_system_score_gemma":0.00059862423,"threshold_uncertainty_score":0.01028353},"labels":[],"label_agreement":null},{"id":"W4313147713","doi":"10.1109/jsait.2022.3219807","title":"Sparsity-Free Compressed Sensing With Applications to Generative Priors","year":2022,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Notation; Combinatorics; Mathematics; Discrete mathematics; Algebra over a field; Pure mathematics; Arithmetic","score_opus":0.009189985625825691,"score_gpt":0.21449835616617585,"score_spread":0.20530837054035017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313147713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052274233,0.00043793686,0.9915344,0.0008086876,0.00005405767,0.000024423163,0.00014834567,0.00016184429,0.0016028638],"genre_scores_gemma":[0.4632101,0.003465605,0.51691496,0.001030145,0.0008458982,0.00038959624,0.0017292433,0.00041819026,0.011996186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986065,0.0005849929,0.000052900505,0.0002823014,0.0003457922,0.00012755473],"domain_scores_gemma":[0.990991,0.0073274537,0.00051694404,0.0006189518,0.000344446,0.00020117854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033192034,0.0015882711,0.0013985158,0.0010202359,0.0005331559,0.0015895109,0.002383059,0.0024732254,0.0027385578],"category_scores_gemma":[0.014582667,0.0009324214,0.0012858411,0.001640155,0.0027698446,0.0025060794,0.0031681,0.003717104,0.00086230825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022686283,0.00007280226,0.0006779452,0.0002997504,0.00008776748,0.0002970039,0.000202156,0.72673875,0.0032090314,0.22525921,0.00409036,0.03883842],"study_design_scores_gemma":[0.000018138386,0.000020260359,0.00010214891,0.000020342042,0.00000981224,0.000048598693,0.000013714061,0.91639876,0.0007576258,0.08162823,0.0009663552,0.000015963666],"about_ca_topic_score_codex":0.004680116,"about_ca_topic_score_gemma":0.00407216,"teacher_disagreement_score":0.004680116,"about_ca_system_score_codex":0.0011001481,"about_ca_system_score_gemma":0.0014155963,"threshold_uncertainty_score":0.017553866},"labels":[],"label_agreement":null},{"id":"W4313437003","doi":"10.1007/s43670-022-00043-5","title":"NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems","year":2022,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Stability (learning theory); Inverse problem; Artificial neural network; Generalization; Deep learning; Convergence (economics); Key (lock); Artificial intelligence; Inverse; Construct (python library); Mathematical optimization; Algorithm; Theoretical computer science; Machine learning; Mathematics","score_opus":0.055959147669460536,"score_gpt":0.28750844983509677,"score_spread":0.23154930216563624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313437003","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071697454,0.00024307803,0.9883283,0.00017726076,0.00011353671,0.000042168984,0.00026063,0.0017201679,0.0019452039],"genre_scores_gemma":[0.15905291,0.00039125312,0.8282684,0.00019902937,0.00008484973,0.0002376594,0.0008884471,0.00052699674,0.010350442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967515,0.00007181338,0.000013219282,0.000044951536,0.000171584,0.000023234881],"domain_scores_gemma":[0.9994099,0.00027300217,0.000050296054,0.000099072,0.0001310706,0.000036632915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063703186,0.00069427176,0.00061663945,0.00046610014,0.00032517686,0.0007586227,0.0012982967,0.00088403677,0.0033227482],"category_scores_gemma":[0.0034828847,0.00038232727,0.00035165023,0.00047351047,0.00053531525,0.0013752131,0.0016170663,0.0016207943,0.0008700503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057049195,0.0001197714,0.0007857213,0.00029415108,0.00012052628,0.00021655961,0.000099186276,0.45801452,0.019376263,0.055353884,0.02462726,0.4404217],"study_design_scores_gemma":[0.000013986862,0.000025924526,0.00007826364,0.0000064795313,0.0000050132335,0.000027515049,0.0000051562956,0.9862715,0.0030052909,0.007982233,0.0025729125,0.0000057201405],"about_ca_topic_score_codex":0.0019213542,"about_ca_topic_score_gemma":0.0062966803,"teacher_disagreement_score":0.0033227482,"about_ca_system_score_codex":0.0004143076,"about_ca_system_score_gemma":0.00059784454,"threshold_uncertainty_score":0.01111573},"labels":[],"label_agreement":null},{"id":"W4313478437","doi":"10.1016/j.sigpro.2022.108926","title":"Rank minimization via adaptive hybrid norm for image restoration","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Singular value; Minification; Norm (philosophy); Matrix norm; Mathematical optimization; Rank (graph theory); Image restoration; Computer science; Mathematics; Algorithm; Image (mathematics); Singular value decomposition; Artificial intelligence; Image processing","score_opus":0.023121888998113953,"score_gpt":0.249177246283302,"score_spread":0.22605535728518805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313478437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035081632,0.00015099988,0.99476445,0.00012986972,0.00003167319,0.000009382786,0.00003190222,0.000097635115,0.0012759476],"genre_scores_gemma":[0.15509373,0.0006132316,0.8326477,0.00018277143,0.00015773051,0.000101231046,0.000246023,0.0001983318,0.010759302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962735,0.0001382276,0.000013471422,0.000054034666,0.00014324952,0.000023665934],"domain_scores_gemma":[0.9995098,0.0002410299,0.000048418016,0.000072441355,0.00010667136,0.00002171368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006065478,0.00063016894,0.00062306074,0.00052140764,0.0002381949,0.0006771216,0.0006829248,0.00094409403,0.0027999151],"category_scores_gemma":[0.0017160485,0.00026375082,0.0004796473,0.0006820094,0.00088889565,0.0010283059,0.0011850242,0.0013150333,0.0007460912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038160858,0.00017744569,0.00041585922,0.00045978965,0.00013056165,0.000120697754,0.00016369403,0.3353632,0.058065537,0.2071609,0.0142053785,0.38335532],"study_design_scores_gemma":[0.000010164092,0.000049341037,0.000082647864,0.00000780824,0.000008228479,0.00005686299,0.000014429425,0.9678693,0.004682573,0.024718085,0.002489113,0.000011625771],"about_ca_topic_score_codex":0.0010455323,"about_ca_topic_score_gemma":0.0017121074,"teacher_disagreement_score":0.0027999151,"about_ca_system_score_codex":0.0002691687,"about_ca_system_score_gemma":0.000542285,"threshold_uncertainty_score":0.009366691},"labels":[],"label_agreement":null},{"id":"W4313585229","doi":"10.3390/computation11010007","title":"Sparse Reconstruction Using Hyperbolic Tangent as Smooth l1-Norm Approximation","year":2023,"lang":"en","type":"article","venue":"Computation","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Underdetermined system; Compressed sensing; Norm (philosophy); Mathematics; Mathematical optimization; Optimization problem; Tangent; Minification; Differentiable function; Applied mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.04077800226232844,"score_gpt":0.2671237807839386,"score_spread":0.22634577852161017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313585229","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007598988,0.00014114847,0.99124056,0.00012118991,0.000019889685,0.00002060072,0.000030290343,0.00020568576,0.0006217306],"genre_scores_gemma":[0.26202554,0.00078558485,0.7319424,0.00017661936,0.00006135223,0.00010853655,0.00037916392,0.0001930284,0.004327728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945205,0.00014683006,0.00003327551,0.000098872966,0.00023019103,0.00003883666],"domain_scores_gemma":[0.99908304,0.00040333715,0.000103788254,0.00010931584,0.0002557208,0.000044838922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386399,0.0007177852,0.00067454466,0.0006492142,0.0002702982,0.0010198399,0.0008119347,0.0009586032,0.001080252],"category_scores_gemma":[0.0033585986,0.00031410242,0.0007723678,0.00081041164,0.0008527677,0.0013426399,0.0010616629,0.0014013061,0.0005367489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028185648,0.000103046616,0.0016312198,0.000268937,0.00008208419,0.00030367012,0.00032974003,0.68050325,0.038360894,0.064820744,0.0037669546,0.20954756],"study_design_scores_gemma":[0.0000036517993,0.000025426714,0.000084560255,0.000006231821,0.0000037590128,0.000044599958,0.000010548667,0.993138,0.002784076,0.003233549,0.0006569692,0.000008569801],"about_ca_topic_score_codex":0.0024687075,"about_ca_topic_score_gemma":0.0016674878,"teacher_disagreement_score":0.0024687075,"about_ca_system_score_codex":0.0005583418,"about_ca_system_score_gemma":0.0009738161,"threshold_uncertainty_score":0.0060217977},"labels":[],"label_agreement":null},{"id":"W4313913688","doi":"10.13140/rg.2.2.28438.01604","title":"A LEVENBERG-MARQUARDT METHOD FOR NONSMOOTH REGULARIZED LEAST SQUARES","year":2022,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration; Office of Science; Advanced Scientific Computing Research; Sandia National Laboratories; U.S. Department of Energy","keywords":"Levenberg–Marquardt algorithm; Trust region; Mathematics; Jacobian matrix and determinant; Lipschitz continuity; Stationary point; Regularization (linguistics); Nonlinear system; Applied mathematics; Least-squares function approximation; Separable space; Lasso (programming language); Convergence (economics); Algorithm; Non-linear least squares; Mathematical optimization; Computer science; Estimation theory; Artificial neural network; Mathematical analysis; Artificial intelligence","score_opus":0.017738799893753227,"score_gpt":0.2613400141168413,"score_spread":0.2436012142230881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313913688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000222485,0.00005645014,0.9990558,0.000047454523,0.00002109104,0.000018171022,0.000017588594,0.00022459295,0.00033631516],"genre_scores_gemma":[0.015043763,0.00014891764,0.98087287,0.00009168112,0.000051413634,0.00020605326,0.00015106206,0.00037416827,0.0030600342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865496,0.000427905,0.00006633013,0.00023073949,0.00055251434,0.00006753899],"domain_scores_gemma":[0.99883646,0.00048446344,0.000111007575,0.00014372244,0.00036229313,0.00006202388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015912462,0.0016617206,0.0012608098,0.0008086933,0.000575308,0.0010100978,0.0019230135,0.002062047,0.0051165367],"category_scores_gemma":[0.0037842095,0.00080560637,0.0014351802,0.0009748297,0.0010286983,0.0009254986,0.0016049852,0.0036181393,0.004079577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007320686,0.00009915841,0.00039660375,0.0003538191,0.00015251654,0.00015850805,0.00013890896,0.7120385,0.012080296,0.054043896,0.011686029,0.20877853],"study_design_scores_gemma":[0.000008879499,0.000022394082,0.000051427392,0.000009493543,0.0000059979902,0.000027180415,0.000007127159,0.9848016,0.0014990215,0.007292478,0.006259928,0.000014419421],"about_ca_topic_score_codex":0.0044274027,"about_ca_topic_score_gemma":0.005742224,"teacher_disagreement_score":0.0051165367,"about_ca_system_score_codex":0.0008183983,"about_ca_system_score_gemma":0.0019062272,"threshold_uncertainty_score":0.017116487},"labels":[],"label_agreement":null},{"id":"W4315605918","doi":"10.1109/globecom48099.2022.10001115","title":"Joint Low-Rank Factor and Sparsity for Detecting Access Jamming in Massive MTC Networks","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Jamming; Feature (linguistics); Rank (graph theory); Constraint (computer-aided design); Correctness; Telecommunications link; Factor (programming language); Joint (building); Exploit; Data mining; Algorithm; Computer network; Computer security; Engineering; Mathematics","score_opus":0.06556047803158377,"score_gpt":0.2938114253761599,"score_spread":0.22825094734457613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315605918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02763325,0.00021299413,0.97052413,0.00022677756,0.000028741431,0.000025784151,0.000068416106,0.00024951194,0.0010304075],"genre_scores_gemma":[0.6909817,0.0005622815,0.3058282,0.00016792605,0.00015896873,0.000084136926,0.000393814,0.00006975921,0.0017531721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.00014023448,0.000017891254,0.0000614488,0.00017622285,0.000062279374],"domain_scores_gemma":[0.99834406,0.0009821918,0.00023471277,0.00013312996,0.00022133728,0.000084521096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007015213,0.00081409584,0.00054854696,0.0005705299,0.0002725371,0.00048673118,0.00047445815,0.000561744,0.00089622085],"category_scores_gemma":[0.005210987,0.00027501653,0.00042604297,0.00067861524,0.0006806708,0.0010407278,0.000694112,0.000874699,0.00027947244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068040576,0.00013507657,0.005178446,0.0002923556,0.00008758071,0.00046468386,0.0002657578,0.6954772,0.03533622,0.023456555,0.0047076717,0.23391804],"study_design_scores_gemma":[0.000007630784,0.00003311205,0.0004352333,0.00000561124,0.0000049585083,0.000061457,0.000020288144,0.99465805,0.0017064621,0.0026873222,0.00037012756,0.000009653633],"about_ca_topic_score_codex":0.003065809,"about_ca_topic_score_gemma":0.0039993813,"teacher_disagreement_score":0.003065809,"about_ca_system_score_codex":0.00029722505,"about_ca_system_score_gemma":0.0007302855,"threshold_uncertainty_score":0.006095886},"labels":[],"label_agreement":null},{"id":"W4317877647","doi":"10.36227/techrxiv.15086277.v2","title":"Unified Analysis on L1 over L2 Minimization for signal recovery","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Convergence (economics); Mathematics; Applied mathematics; Projection (relational algebra); Matrix (chemical analysis); Constraint (computer-aided design); Algorithm; Minification; Property (philosophy); Operator (biology); Mathematical optimization; Computer science","score_opus":0.04314977878695973,"score_gpt":0.272050155937522,"score_spread":0.22890037715056227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317877647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023957798,0.0012794405,0.9915366,0.0006097905,0.00008037375,0.00001899613,0.000049208582,0.00005384714,0.0039759907],"genre_scores_gemma":[0.40983757,0.013376838,0.54801536,0.0021507484,0.0016792206,0.00047275875,0.0007067316,0.00078622205,0.022974653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800164,0.00097170414,0.00008493288,0.00031688786,0.00047915077,0.00014568577],"domain_scores_gemma":[0.99731964,0.0016391233,0.00023549514,0.0002303745,0.00045590184,0.00011946167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044739028,0.0019970073,0.001092778,0.0012975056,0.00052283145,0.0015545948,0.0014505134,0.001674821,0.0040917387],"category_scores_gemma":[0.0082530035,0.00054213585,0.0014803305,0.0012907049,0.0019515184,0.0037384965,0.0030695933,0.0029579506,0.00081097515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011648803,0.00007221362,0.00074365054,0.00065091724,0.00011011913,0.00023396143,0.00024202136,0.28153685,0.0064708604,0.6490955,0.00783326,0.05289422],"study_design_scores_gemma":[0.000005915965,0.000057094257,0.00010529821,0.000034410823,0.00001638535,0.000077976554,0.000024295392,0.9363419,0.0009230733,0.059460048,0.002937215,0.000016394948],"about_ca_topic_score_codex":0.0020953065,"about_ca_topic_score_gemma":0.0016360461,"teacher_disagreement_score":0.0044739028,"about_ca_system_score_codex":0.001283025,"about_ca_system_score_gemma":0.00131933,"threshold_uncertainty_score":0.0236606},"labels":[],"label_agreement":null},{"id":"W4318774098","doi":"10.1016/j.sigpro.2023.108939","title":"One-bit compressed sensing via total variation minimization method","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","keywords":"Compressed sensing; Piecewise; Algorithm; Thresholding; Minification; Computer science; Series (stratigraphy); Binary number; Bit (key); Total variation denoising; Mathematics; Artificial intelligence; Noise reduction; Image (mathematics); Arithmetic","score_opus":0.024883693560630256,"score_gpt":0.2618927505724298,"score_spread":0.23700905701179953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318774098","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004105591,0.00029735017,0.9925821,0.00023157743,0.00006603583,0.00001881983,0.000076025404,0.00013869618,0.0024837418],"genre_scores_gemma":[0.2693169,0.0012681357,0.7194325,0.00042318198,0.00026144725,0.00013479327,0.00043550614,0.00015647837,0.008571014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.0001623182,0.000024176104,0.000091625596,0.0002331649,0.000035744622],"domain_scores_gemma":[0.99946445,0.0002900492,0.000039650982,0.00009529499,0.00008660546,0.000023922512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046248914,0.0008263214,0.0007998137,0.00036040155,0.0002854695,0.0007553066,0.0007315599,0.00086925353,0.0032624635],"category_scores_gemma":[0.0019643605,0.0002562362,0.00038668644,0.0006974745,0.0006171671,0.0012571806,0.0011754503,0.0010565303,0.0007886761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004599147,0.000112137845,0.00046807507,0.00052036846,0.00011937331,0.00022142925,0.00020795659,0.1930032,0.07288659,0.19829984,0.009264011,0.52443707],"study_design_scores_gemma":[0.000016518743,0.000068642126,0.00014680302,0.000027463333,0.000017835027,0.00020307368,0.000014747932,0.96282774,0.0108759,0.022528363,0.0032481628,0.000024714724],"about_ca_topic_score_codex":0.00093850406,"about_ca_topic_score_gemma":0.0012033301,"teacher_disagreement_score":0.0032624635,"about_ca_system_score_codex":0.00027737278,"about_ca_system_score_gemma":0.00069059717,"threshold_uncertainty_score":0.010914028},"labels":[],"label_agreement":null},{"id":"W4319264759","doi":"10.36227/techrxiv.21976475","title":"Inversion-Free Sparse Bayesian Learning for Temporally Correlated Signal Recovery","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Memorial University of Newfoundland","funders":"","keywords":"Inversion (geology); Computer science; Bayesian inference; Algorithm; Sparse matrix; Compressed sensing; Bayesian probability; Inference; Bottleneck; Maximization; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03337727019387683,"score_gpt":0.23761415195387747,"score_spread":0.20423688176000065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319264759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012959377,0.000066193395,0.9980058,0.000096971824,0.000010814487,0.000010770445,0.000019666031,0.000075477816,0.00041844556],"genre_scores_gemma":[0.23616703,0.00084221794,0.7565851,0.00047026935,0.00019660698,0.00023611274,0.0004967072,0.0001955829,0.004810383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990637,0.00031707354,0.000035445606,0.0001630417,0.0003540046,0.00006678366],"domain_scores_gemma":[0.9984048,0.00093973055,0.00017238747,0.00017459343,0.0002476827,0.000060854796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014324493,0.0007567555,0.0008420985,0.0005769053,0.00041522412,0.00078840036,0.0012007327,0.0010788671,0.0022331965],"category_scores_gemma":[0.007123445,0.00054310303,0.00062200637,0.001021025,0.0011328738,0.0016212263,0.0017630525,0.0023775944,0.0008531221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017659638,0.000120709745,0.00053579215,0.00020231046,0.00007421054,0.00011322827,0.00012708994,0.6077256,0.010336508,0.13296524,0.005961962,0.24166076],"study_design_scores_gemma":[0.000009315183,0.000012978234,0.00005130651,0.0000059101185,0.000003907672,0.00002476253,0.000003833915,0.9826668,0.0012148039,0.015222394,0.00077687076,0.000007120327],"about_ca_topic_score_codex":0.003242756,"about_ca_topic_score_gemma":0.0039188103,"teacher_disagreement_score":0.003242756,"about_ca_system_score_codex":0.00073198974,"about_ca_system_score_gemma":0.001689286,"threshold_uncertainty_score":0.007575631},"labels":[],"label_agreement":null},{"id":"W4319264761","doi":"10.36227/techrxiv.21976475.v1","title":"Inversion-Free Sparse Bayesian Learning for Temporally Correlated Signal Recovery","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Memorial University of Newfoundland","funders":"","keywords":"Inversion (geology); Bayesian inference; Computer science; Algorithm; Sparse matrix; Compressed sensing; Bayesian probability; Inference; Signal recovery; Maximization; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.03337727019387683,"score_gpt":0.23761415195387747,"score_spread":0.20423688176000065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319264761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001291106,0.00007050732,0.99808645,0.00007917703,0.000009256542,0.000010599024,0.000015215158,0.00006967559,0.000367995],"genre_scores_gemma":[0.22342561,0.0008719647,0.7708827,0.0003854055,0.00018058621,0.00024458396,0.000412681,0.00016488806,0.0034315465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990995,0.00029902498,0.000036394704,0.0001501798,0.0003541199,0.000060818205],"domain_scores_gemma":[0.9983474,0.0009924541,0.00018494524,0.00016709176,0.0002476217,0.000060505947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014341725,0.00073609146,0.00082831987,0.0005998585,0.00043025677,0.00075325515,0.0012683456,0.0011235457,0.0019396777],"category_scores_gemma":[0.007520932,0.0005257434,0.0006218028,0.0010480144,0.0010743164,0.0016133884,0.0017849768,0.002352456,0.00075014343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001592247,0.00012849725,0.0005167399,0.00019782582,0.000067135494,0.00010166812,0.0001237829,0.63289094,0.009226221,0.11878774,0.004534986,0.23326522],"study_design_scores_gemma":[0.000009803488,0.000012733868,0.000046146095,0.00000557413,0.0000040233926,0.000025727024,0.0000036800227,0.98399216,0.0010877469,0.014114956,0.000690608,0.000006869472],"about_ca_topic_score_codex":0.0028347,"about_ca_topic_score_gemma":0.00374594,"teacher_disagreement_score":0.0028347,"about_ca_system_score_codex":0.000685218,"about_ca_system_score_gemma":0.0017404591,"threshold_uncertainty_score":0.0075847507},"labels":[],"label_agreement":null},{"id":"W4321375019","doi":"10.3390/math11041022","title":"High-Dimensional Covariance Estimation via Constrained Lq-Type Regularization","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Estimation of covariance matrices; Mathematics; Covariance matrix; Smoothing; Covariance; Mathematical optimization; Estimator; Covariance function; Regularization (linguistics); Rational quadratic covariance function; Rank (graph theory); Matrix (chemical analysis); Applied mathematics; Matérn covariance function; Covariance intersection; Algorithm; Computer science; Statistics; Artificial intelligence; Combinatorics","score_opus":0.016547197946919685,"score_gpt":0.2304819329825737,"score_spread":0.213934735035654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321375019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016750919,0.000034215896,0.9978561,0.000049914946,0.0000075661164,0.0000056647496,0.000009815478,0.000043686818,0.0003178558],"genre_scores_gemma":[0.35738996,0.0004609011,0.6368142,0.00023577969,0.000120881225,0.000190703,0.00030343997,0.00015977108,0.004324471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926525,0.0002767587,0.000028155691,0.00012730117,0.00025846466,0.0000441295],"domain_scores_gemma":[0.9987663,0.00065395166,0.00015742253,0.00010587694,0.00027442203,0.00004207407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013276892,0.0006810335,0.0007976974,0.00049313565,0.0003437403,0.00080393424,0.0007332531,0.0008131399,0.001195856],"category_scores_gemma":[0.00399723,0.00039650055,0.0006755431,0.0007428915,0.00094449706,0.0013530968,0.0013515295,0.001327961,0.00034466898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005352988,0.000047682246,0.0007102999,0.00013746016,0.000067972214,0.00010581312,0.00011596719,0.85523546,0.008404238,0.07128907,0.0027355305,0.061097004],"study_design_scores_gemma":[0.0000031624907,0.000007860475,0.000061829494,0.000002961663,0.000002202918,0.000014347183,0.0000042933034,0.9924069,0.00049683166,0.00665376,0.00034040018,0.000005460038],"about_ca_topic_score_codex":0.0034094544,"about_ca_topic_score_gemma":0.0024578609,"teacher_disagreement_score":0.0034094544,"about_ca_system_score_codex":0.00048170067,"about_ca_system_score_gemma":0.0012441634,"threshold_uncertainty_score":0.007021606},"labels":[],"label_agreement":null},{"id":"W4321454809","doi":"10.1007/s10957-023-02167-7","title":"Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Mathematics; Norm (philosophy); Subderivative; Operator norm; Convex hull; Pure mathematics; Matrix norm; Dual norm; Affine transformation; Subspace topology; Theory of computation; Regular polygon; Applied mathematics; Mathematical analysis; Convex optimization; Operator theory; Geometry; Banach space; Algorithm; Physics","score_opus":0.005006997611517314,"score_gpt":0.2045037808553128,"score_spread":0.19949678324379547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321454809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023631198,0.0007227729,0.96619684,0.0012280165,0.00012718354,0.000029559707,0.00012724978,0.00006183457,0.0078753345],"genre_scores_gemma":[0.72506326,0.0035575444,0.2536291,0.0011024218,0.00096313335,0.00028638513,0.0006307585,0.00051536004,0.014252039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971987,0.0013170812,0.000110748435,0.0006412208,0.00053781207,0.00019442591],"domain_scores_gemma":[0.9909642,0.0059562693,0.00058883225,0.0008211029,0.0011814572,0.00048805203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005087847,0.0011817046,0.0014839767,0.0016254089,0.0011198386,0.0030510458,0.0017228567,0.001767453,0.002532159],"category_scores_gemma":[0.022434097,0.0011000978,0.0012362206,0.0013880004,0.006337973,0.0067900154,0.0055142483,0.0040797517,0.0005121007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010363936,0.000032793894,0.00050522,0.00012762689,0.00003989025,0.00013601717,0.00024391641,0.03222789,0.0030671887,0.9445639,0.002125615,0.016826294],"study_design_scores_gemma":[0.000012642209,0.000049250368,0.00041423854,0.000030802814,0.000013047474,0.00020644238,0.0001398616,0.18311433,0.0019238004,0.81229967,0.0017549492,0.000040916446],"about_ca_topic_score_codex":0.0015709619,"about_ca_topic_score_gemma":0.00091585505,"teacher_disagreement_score":0.005087847,"about_ca_system_score_codex":0.0008041564,"about_ca_system_score_gemma":0.0013885848,"threshold_uncertainty_score":0.026907444},"labels":[],"label_agreement":null},{"id":"W4321488019","doi":"10.1109/tgrs.2023.3247593","title":"Optimal Seismic Sensor Placement Based on Reinforcement Learning Approach: An Example of OBN Acquisition Design","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council","keywords":"Computer science; Reinforcement learning; Wireless sensor network; Node (physics); Detector; Notation; Quality (philosophy); Software deployment; Geophone; Seismic survey; Data mining; Algorithm; Artificial intelligence; Engineering; Mathematics; Geology; Seismology","score_opus":0.04365776794830735,"score_gpt":0.2451782146434696,"score_spread":0.20152044669516223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321488019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010809515,0.00008855512,0.98686904,0.0001402265,0.000014812867,0.00004589883,0.00002120753,0.00015755552,0.001853166],"genre_scores_gemma":[0.6023884,0.00014684533,0.39481243,0.000102873106,0.000027231974,0.00013380738,0.000053340147,0.00005846604,0.0022766646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994524,0.00021061065,0.00002870259,0.00012228693,0.00011999673,0.00006602751],"domain_scores_gemma":[0.99903995,0.0004926592,0.00011600586,0.000085227926,0.00021696053,0.000049180908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932063,0.0007212128,0.000669266,0.0003875138,0.00031788193,0.0005907586,0.0006790992,0.0009176028,0.001994838],"category_scores_gemma":[0.0026232991,0.00035265638,0.00035922704,0.000357984,0.00071318,0.0005807301,0.00086112996,0.0006844916,0.00033148873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000927749,0.000040536266,0.00070192415,0.00007691589,0.000018280554,0.00013639148,0.00007935965,0.929142,0.005707341,0.006937465,0.00068541896,0.056381684],"study_design_scores_gemma":[0.000013831277,0.000041856998,0.000102232356,0.000005967879,0.000004907424,0.000028282348,0.000013430021,0.99568224,0.0012319409,0.00235989,0.00051008293,0.0000053584313],"about_ca_topic_score_codex":0.0032923315,"about_ca_topic_score_gemma":0.0036162848,"teacher_disagreement_score":0.0032923315,"about_ca_system_score_codex":0.0006635554,"about_ca_system_score_gemma":0.00088381395,"threshold_uncertainty_score":0.0066734552},"labels":[],"label_agreement":null},{"id":"W4321636690","doi":"10.1109/sc41404.2022.00052","title":"HyLo: A Hybrid Low-Rank Natural Gradient Descent Method","year":2022,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Kronecker delta; Scalability; Gradient descent; Computer science; Quadratic growth; Computation; Factorization; Algorithm; Stochastic gradient descent; Matrix decomposition; Residual neural network; Rank (graph theory); Artificial neural network; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.009293411424507457,"score_gpt":0.22783657804916585,"score_spread":0.2185431666246584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321636690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01022231,0.00033898404,0.9805439,0.0002573116,0.00010536707,0.0001042337,0.00027281183,0.00535467,0.0028003734],"genre_scores_gemma":[0.14442861,0.00020955545,0.84009826,0.0006638302,0.0000976777,0.00040354408,0.0015749204,0.0011993807,0.011324157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999553,0.000110080495,0.000023872872,0.00008979985,0.0001509235,0.0000722391],"domain_scores_gemma":[0.99935085,0.0002292214,0.00004964821,0.00011790038,0.0001869982,0.00006536356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000806452,0.0009331866,0.0011162657,0.00056886347,0.0004734809,0.0009893615,0.0019264468,0.0012718315,0.007407332],"category_scores_gemma":[0.0024475022,0.00049412827,0.00058395375,0.00048386524,0.0005869343,0.0012987235,0.0012927935,0.0014289069,0.0028912204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057877216,0.0003731405,0.0015067724,0.00034252825,0.00018781786,0.0002098237,0.00014971873,0.47320756,0.012567351,0.023619333,0.044681706,0.44257554],"study_design_scores_gemma":[0.000047538477,0.000034406905,0.00008061803,0.0000062248946,0.000004674715,0.000016965972,0.000007876572,0.99438703,0.001006045,0.0021378028,0.002262603,0.000008248195],"about_ca_topic_score_codex":0.010953976,"about_ca_topic_score_gemma":0.02219677,"teacher_disagreement_score":0.010953976,"about_ca_system_score_codex":0.0007616582,"about_ca_system_score_gemma":0.0024633526,"threshold_uncertainty_score":0.024780035},"labels":[],"label_agreement":null},{"id":"W4322716169","doi":"10.1109/twc.2023.3249103","title":"Uncertainty Injection: A Deep Learning Method for Robust Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robust optimization; Deep learning; Artificial intelligence; Robust control; MIMO; Optimization problem; Wireless; Machine learning; Telecommunications link; Mathematical optimization; Wireless network; Robustness (evolution); Channel (broadcasting); Field (mathematics); Control system; Algorithm; Telecommunications; Engineering; Mathematics","score_opus":0.04345735250651349,"score_gpt":0.2941616621545909,"score_spread":0.2507043096480774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322716169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005884427,0.00009024982,0.998546,0.00007746438,0.000016192571,0.000008257888,0.000009433017,0.00008078169,0.0005831967],"genre_scores_gemma":[0.3862645,0.00089234853,0.6046508,0.0005599002,0.00023059173,0.0003237769,0.00016755488,0.00033502714,0.006575457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.00029532288,0.00003862582,0.00009403004,0.000254318,0.000062104016],"domain_scores_gemma":[0.9987495,0.00081795186,0.00011939086,0.00011124494,0.00015475483,0.000047116606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020559349,0.0011435105,0.0010782065,0.00063938275,0.00032334184,0.0008347501,0.0014489499,0.0013864613,0.0021660062],"category_scores_gemma":[0.00420136,0.0006196925,0.0009937302,0.0005719142,0.001347997,0.0014732063,0.0025289587,0.0029918288,0.00040584122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000592419,0.000031042266,0.00022294465,0.000098037526,0.000057667923,0.00005125375,0.000056820667,0.85310465,0.0028073227,0.08000071,0.0014287275,0.06208153],"study_design_scores_gemma":[0.000002085591,0.000011506885,0.0000083826535,0.0000055815653,0.000002532314,0.0000055704613,0.0000013389894,0.99217767,0.0003356679,0.0070097134,0.0004371299,0.000002869214],"about_ca_topic_score_codex":0.001923138,"about_ca_topic_score_gemma":0.0014905568,"teacher_disagreement_score":0.0021660062,"about_ca_system_score_codex":0.00086220517,"about_ca_system_score_gemma":0.0010438602,"threshold_uncertainty_score":0.0108729005},"labels":[],"label_agreement":null},{"id":"W4323041389","doi":"10.1007/s11760-023-02516-z","title":"ICRICS: iterative compensation recovery for image compressive sensing","year":2023,"lang":"en","type":"article","venue":"Signal Image and Video Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Compressed sensing; Computer science; Compensation (psychology); Noise (video); Image (mathematics); Similarity (geometry); Algorithm; Sampling (signal processing); SIGNAL (programming language); Peak signal-to-noise ratio; Computer vision","score_opus":0.021144538587019465,"score_gpt":0.26958049586234833,"score_spread":0.24843595727532886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323041389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013192175,0.00027332097,0.99105084,0.00014141607,0.0001861338,0.0000620005,0.00019933756,0.0032231677,0.0035446899],"genre_scores_gemma":[0.04521249,0.00050081953,0.9371969,0.0003048242,0.00023764675,0.00023340409,0.0009525662,0.00078889064,0.0145724695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909437,0.00016534745,0.000042987514,0.000122566,0.0005116767,0.000063074905],"domain_scores_gemma":[0.9994543,0.00017420585,0.000041403055,0.00013220654,0.00015861593,0.00003917638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007925349,0.0011917595,0.0007048455,0.0009473464,0.00036044468,0.0009132913,0.0011963996,0.0011353298,0.011201636],"category_scores_gemma":[0.0023684439,0.0003617331,0.0005148383,0.000942876,0.0006666391,0.00093986647,0.0013954339,0.0017579418,0.005265663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004202028,0.00013545885,0.0003587581,0.0003154552,0.000083341314,0.00022941068,0.000119631186,0.045285698,0.036950406,0.07110511,0.05587798,0.7891185],"study_design_scores_gemma":[0.00008009278,0.00015067894,0.00041685364,0.00005971389,0.000024105615,0.00039581684,0.00003120004,0.8819421,0.040265355,0.018417671,0.058162462,0.000053955126],"about_ca_topic_score_codex":0.001868432,"about_ca_topic_score_gemma":0.0032149618,"teacher_disagreement_score":0.011201636,"about_ca_system_score_codex":0.0003349635,"about_ca_system_score_gemma":0.00094542536,"threshold_uncertainty_score":0.03747326},"labels":[],"label_agreement":null},{"id":"W4323793197","doi":"10.1109/access.2023.3247662","title":"Second-Order Statistics-Aided Channel Estimation for Multipath Massive MIMO-OFDM Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Matching pursuit; Signal subspace; Subspace topology; Algorithm; Channel (broadcasting); Lemma (botany); MIMO; Set (abstract data type); Mathematics; Computer science; Applied mathematics; Topology (electrical circuits); Combinatorics; Artificial intelligence; Telecommunications; Compressed sensing","score_opus":0.049536295247366274,"score_gpt":0.3122578213245706,"score_spread":0.26272152607720434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323793197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009618356,0.00015220576,0.9893014,0.00006474015,0.000025597546,0.000010591846,0.0000266825,0.0002544352,0.00054595625],"genre_scores_gemma":[0.42934763,0.0006025559,0.56697476,0.00012076659,0.00009196625,0.00010790949,0.00023255136,0.000061159466,0.0024606974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994635,0.00013798935,0.000025164765,0.000064976,0.00025245617,0.00005589632],"domain_scores_gemma":[0.99902964,0.0005486724,0.00011013466,0.0001127017,0.00017406607,0.00002476552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000520424,0.0006493052,0.0006503766,0.00048740202,0.00030993015,0.0005178482,0.00048774318,0.00051096827,0.00070740905],"category_scores_gemma":[0.0024901372,0.0003728317,0.0005123463,0.0007655089,0.0004206033,0.00090036,0.00068502995,0.0007838857,0.0004374272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020394422,0.00006076077,0.0012699617,0.00012848293,0.00009402307,0.000077287004,0.00012241678,0.73253477,0.02488078,0.020585097,0.0016081196,0.21843432],"study_design_scores_gemma":[0.0000076581,0.00003759278,0.00021910733,0.0000045838497,0.0000065366908,0.0000497156,0.000007806194,0.99194205,0.0046205837,0.0023988711,0.000694691,0.00001075324],"about_ca_topic_score_codex":0.0019307515,"about_ca_topic_score_gemma":0.0024335738,"teacher_disagreement_score":0.0019307515,"about_ca_system_score_codex":0.0003898552,"about_ca_system_score_gemma":0.0013028249,"threshold_uncertainty_score":0.0038390756},"labels":[],"label_agreement":null},{"id":"W4324125340","doi":"10.1109/lwc.2023.3256300","title":"Efficient Massive Machine Type Communication (mMTC) via AMP","year":2023,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decoding methods; Computer science; Algorithm; Upper and lower bounds; Network packet; Separable space; Gaussian; Theoretical computer science; Mathematics","score_opus":0.029974775724644923,"score_gpt":0.2631534754109956,"score_spread":0.2331786996863507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324125340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107266875,0.00017176756,0.9861291,0.00014202572,0.000047001562,0.000027409309,0.00003307424,0.00032184034,0.0024010835],"genre_scores_gemma":[0.51259124,0.0003180607,0.48332664,0.00029734464,0.00012554934,0.00012204979,0.000121274614,0.00004152099,0.0030563502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936825,0.00020242578,0.000025926418,0.000073671836,0.00026623724,0.000063481544],"domain_scores_gemma":[0.9989292,0.0004913713,0.00012622432,0.00022783455,0.00017774207,0.00004751571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054585177,0.00054074865,0.0006614017,0.00044147065,0.00038187887,0.0007237428,0.0008423951,0.0009511128,0.0014066537],"category_scores_gemma":[0.0021693644,0.00018686915,0.00034653416,0.00086730433,0.00078254304,0.0011651947,0.0011921234,0.00090218533,0.0006859246],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035209703,0.00011533598,0.00094636437,0.00027834473,0.00007332292,0.00044015635,0.00024117208,0.55916214,0.04047131,0.1355289,0.005907353,0.2564835],"study_design_scores_gemma":[0.000011003854,0.00007166647,0.000056433593,0.000011065838,0.000004917742,0.000109278524,0.000009209052,0.9831623,0.005408955,0.009511565,0.0016331838,0.000010544384],"about_ca_topic_score_codex":0.0004974408,"about_ca_topic_score_gemma":0.0007467644,"teacher_disagreement_score":0.0014066537,"about_ca_system_score_codex":0.00035412307,"about_ca_system_score_gemma":0.0005846541,"threshold_uncertainty_score":0.0047056675},"labels":[],"label_agreement":null},{"id":"W4360879278","doi":"10.1214/22-aos2246","title":"Sharp global convergence guarantees for iterative nonconvex optimization with random data","year":2023,"lang":"en","type":"article","venue":"The Annals of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Initialization; Subgradient method; Mathematical optimization; Sequence (biology); Rate of convergence; Gaussian; Applied mathematics; Algorithm; Computer science","score_opus":0.1322722702975442,"score_gpt":0.3511768969101887,"score_spread":0.2189046266126445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360879278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031252655,0.0002026918,0.99496424,0.00021586288,0.000017690736,0.000025209947,0.000028311804,0.00014409932,0.0012766658],"genre_scores_gemma":[0.36782938,0.0013220317,0.62302536,0.0007472358,0.00020501575,0.0006679297,0.0004516857,0.0006915713,0.005059808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688894,0.0015114417,0.00015165927,0.0004785244,0.00074978446,0.00021967442],"domain_scores_gemma":[0.9745414,0.019724578,0.0016269926,0.0018172159,0.0018088165,0.00048088536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0111036105,0.0025559221,0.0015685083,0.0017788276,0.000785569,0.001876417,0.0021727795,0.0022348196,0.0024487542],"category_scores_gemma":[0.0542732,0.0010614172,0.0016339063,0.0013244149,0.003933832,0.0036764701,0.0038553213,0.0039664353,0.0009590609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101096615,0.0000640452,0.0011110277,0.0002545961,0.00007987553,0.00012497512,0.00024732854,0.6797192,0.0031798934,0.2885911,0.001926905,0.02459984],"study_design_scores_gemma":[0.00001064847,0.000036023826,0.00010510355,0.000024862402,0.000006427458,0.000031905052,0.000017542636,0.9421477,0.0012225083,0.055745676,0.0006407027,0.000010848752],"about_ca_topic_score_codex":0.0015356826,"about_ca_topic_score_gemma":0.0020149425,"teacher_disagreement_score":0.0111036105,"about_ca_system_score_codex":0.0016754199,"about_ca_system_score_gemma":0.0024797076,"threshold_uncertainty_score":0.058722258},"labels":[],"label_agreement":null},{"id":"W4362496316","doi":"10.1109/tim.2023.3264036","title":"Synergistic Hankel Structured Low-Rank Approximation With Total Variation Regularization for Complex Magnetic Anomaly Detection","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Instrumentation and Measurement","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Regularization (linguistics); Total variation denoising; Algorithm; Signal-to-noise ratio (imaging); Computer science; Inverse problem; Anomaly detection; Noise reduction; Mathematics; Artificial intelligence; Telecommunications; Mathematical analysis","score_opus":0.026355356158308883,"score_gpt":0.21792432114423632,"score_spread":0.19156896498592743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362496316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005684081,0.000252225,0.9929333,0.00010655065,0.000025493044,0.000012534427,0.000035075675,0.00026418737,0.00068662036],"genre_scores_gemma":[0.2720286,0.00073924253,0.7214927,0.00028662776,0.00013160607,0.00010824835,0.0005419256,0.00023654911,0.004434533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999387,0.00018182707,0.000027229762,0.00008351137,0.0002693845,0.00005092441],"domain_scores_gemma":[0.99933666,0.0003107598,0.00008737382,0.00007239379,0.00015264707,0.000040200026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007673198,0.0009166861,0.00083416136,0.0005596309,0.00024320478,0.0007366889,0.0007931427,0.00076196995,0.0013751397],"category_scores_gemma":[0.0023391272,0.00030652087,0.0006590764,0.00068164093,0.0005112967,0.0009421621,0.00084805646,0.0012261921,0.0005319486],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030610044,0.00015473866,0.0012843435,0.00036576882,0.00017996656,0.00016881128,0.00020212033,0.548998,0.04877402,0.023894677,0.0071155657,0.3685559],"study_design_scores_gemma":[0.0000055382698,0.000028670594,0.0001039894,0.000004530437,0.0000063564926,0.000034713266,0.000007572012,0.99516344,0.002147312,0.0016555152,0.00083387666,0.000008483544],"about_ca_topic_score_codex":0.0027025111,"about_ca_topic_score_gemma":0.003923556,"teacher_disagreement_score":0.0027025111,"about_ca_system_score_codex":0.0003173272,"about_ca_system_score_gemma":0.00084695296,"threshold_uncertainty_score":0.005373597},"labels":[],"label_agreement":null},{"id":"W4365802316","doi":"10.1007/978-981-99-1639-9_21","title":"Fast Estimation of Multidimensional Regression Functions by the Parzen Kernel-Based Method","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kernel (algebra); Kernel density estimation; Computer science; Convergence (economics); Kernel regression; Algorithm; Set (abstract data type); Variable kernel density estimation; Parametric statistics; Computational complexity theory; Estimation; Function (biology); Regression; Kernel method; Mathematical optimization; Mathematics; Artificial intelligence; Support vector machine; Statistics","score_opus":0.03961786151655413,"score_gpt":0.30510604741991854,"score_spread":0.2654881859033644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365802316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012562929,0.00017220613,0.9980805,0.00003067946,0.000014826794,0.0000052843875,0.000018597304,0.0002109636,0.0002106781],"genre_scores_gemma":[0.069192864,0.00068883854,0.92627937,0.000066678076,0.00007673926,0.00007703828,0.00024358004,0.00028415892,0.0030907393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936455,0.0002507081,0.000028050901,0.0000945207,0.00021267339,0.000049560524],"domain_scores_gemma":[0.9985954,0.00084231247,0.0000876519,0.0002050687,0.00022989986,0.00003967102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306276,0.00080959,0.0015123766,0.0006487469,0.0003753142,0.0009603067,0.0014988284,0.0010636583,0.0028904248],"category_scores_gemma":[0.00394477,0.00070692075,0.0010396973,0.0012592869,0.00068954023,0.0019026959,0.0012991318,0.002299364,0.0019844442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002737296,0.00009198904,0.0005855329,0.00034405247,0.00018351257,0.00009679909,0.00014709105,0.43274674,0.023864752,0.07972033,0.0077086254,0.45423684],"study_design_scores_gemma":[0.000002947171,0.0000072091716,0.00009785328,0.000004319355,0.0000049577834,0.000024964975,0.0000036330111,0.9945932,0.0010241679,0.0033177882,0.00090998213,0.000008904635],"about_ca_topic_score_codex":0.0044651716,"about_ca_topic_score_gemma":0.0050040153,"teacher_disagreement_score":0.0044651716,"about_ca_system_score_codex":0.00057766296,"about_ca_system_score_gemma":0.00090633554,"threshold_uncertainty_score":0.009669483},"labels":[],"label_agreement":null},{"id":"W4366966573","doi":"10.1109/wi-iat55865.2022.00113","title":"Modified Regularization for High-dimensional Data Decomposition","year":2022,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Queen's University","funders":"","keywords":"Overfitting; Regularization (linguistics); Regression; Computer science; Elastic net regularization; Lasso (programming language); Curse of dimensionality; Artificial intelligence; Term (time); Data mining; Machine learning; Pattern recognition (psychology); Algorithm; Mathematics; Feature selection; Statistics; Artificial neural network","score_opus":0.034198195870586034,"score_gpt":0.265033292918138,"score_spread":0.23083509704755195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366966573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038523686,0.00020285556,0.99506193,0.00014149019,0.000039451937,0.000016647047,0.000050992265,0.00027986112,0.00035428102],"genre_scores_gemma":[0.1846264,0.0006846882,0.8094639,0.0005186388,0.0002610097,0.0002566129,0.0008566066,0.00035290656,0.002979223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973997,0.0009549706,0.00014563985,0.0004554096,0.0008891115,0.0001551223],"domain_scores_gemma":[0.9972542,0.0011880518,0.00024222842,0.0006055165,0.0005896626,0.00012027309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031791755,0.0011391112,0.0012005863,0.0007841722,0.0004196923,0.00086721923,0.0012935373,0.00146686,0.0015325302],"category_scores_gemma":[0.007642015,0.000340969,0.0011812149,0.0013892236,0.0010403428,0.0014385846,0.0018011703,0.0025764767,0.0008097246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044895158,0.000280857,0.002099219,0.00053421914,0.0002947322,0.00034261894,0.00025471018,0.5552202,0.07048439,0.059458025,0.017356906,0.29322517],"study_design_scores_gemma":[0.000011297733,0.000036507947,0.00023447466,0.000013374056,0.000010334235,0.00006825912,0.000011923479,0.9875572,0.0029322517,0.0071151587,0.0019949123,0.000014338158],"about_ca_topic_score_codex":0.0015991208,"about_ca_topic_score_gemma":0.0016167145,"teacher_disagreement_score":0.0031791755,"about_ca_system_score_codex":0.00052259106,"about_ca_system_score_gemma":0.0009969254,"threshold_uncertainty_score":0.016813278},"labels":[],"label_agreement":null},{"id":"W4372266203","doi":"10.1109/icassp49357.2023.10094632","title":"Deep Proximal Gradient Method for Learned Convex Regularizers","year":2023,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Subgradient method; Proximal Gradient Methods; Operator (biology); Penalty method; Mathematical optimization; Computer science; Gaussian; Gradient descent; Convex function; Regular polygon; Function (biology); Convergence (economics); Artificial intelligence; Algorithm; Mathematics; Artificial neural network","score_opus":0.034545238976038097,"score_gpt":0.291548444737975,"score_spread":0.25700320576193686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4372266203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018438603,0.000077973906,0.9973188,0.000098802026,0.00001491608,0.0000132636,0.000013068033,0.00010840544,0.00051097374],"genre_scores_gemma":[0.26609406,0.0005547445,0.7219013,0.00032250737,0.00016055655,0.00031126005,0.00022754796,0.00028472536,0.010143346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918944,0.00030472025,0.000027873175,0.00014236326,0.00025827778,0.0000774187],"domain_scores_gemma":[0.99870825,0.00079275144,0.00010068271,0.000118899174,0.00019275089,0.00008657856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019080071,0.0013689662,0.0014550525,0.0006227158,0.000374122,0.0010344633,0.0015776309,0.0019338774,0.002811848],"category_scores_gemma":[0.0055555175,0.00070561265,0.000721939,0.000715751,0.0019701303,0.0014952888,0.0025189824,0.0029833296,0.0008811488],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012755767,0.00006253841,0.00026857283,0.00019400258,0.00006780263,0.00013294026,0.000102463026,0.8417014,0.0037234644,0.091041036,0.0028931138,0.0596852],"study_design_scores_gemma":[0.0000083135765,0.000021514332,0.00001761223,0.0000069587177,0.000003059934,0.000017850949,0.000004216942,0.98569494,0.0005904056,0.013054835,0.000576383,0.000003917726],"about_ca_topic_score_codex":0.0023171415,"about_ca_topic_score_gemma":0.0025634666,"teacher_disagreement_score":0.002811848,"about_ca_system_score_codex":0.0009857016,"about_ca_system_score_gemma":0.0016950236,"threshold_uncertainty_score":0.0100905895},"labels":[],"label_agreement":null},{"id":"W4376312391","doi":"10.48550/arxiv.2305.06869","title":"An Adaptive Graduated Nonconvexity Loss Function for Robust Nonlinear Least Squares Solutions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Outlier; Mathematical optimization; Cauchy distribution; Least-squares function approximation; Function (biology); Norm (philosophy); Algorithm; Non-linear least squares; Mathematics; Computer science; Gaussian; Applied mathematics; Estimation theory; Artificial intelligence; Statistics","score_opus":0.20820503223900003,"score_gpt":0.20875231652906245,"score_spread":0.0005472842900624275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376312391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017967717,0.000172995,0.99707353,0.00012059457,0.000022711101,0.000017183422,0.000014702976,0.00011278878,0.0006685928],"genre_scores_gemma":[0.3037302,0.0011078599,0.6855862,0.0006687338,0.00025645137,0.00046909583,0.0005364745,0.00056252937,0.007082474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823594,0.0005706654,0.00008250353,0.0003012592,0.00070893165,0.000100742065],"domain_scores_gemma":[0.99856,0.0006327895,0.00016728441,0.00015223605,0.00041973256,0.00006794498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028678689,0.0018012131,0.001242441,0.0009919178,0.000400044,0.0010651113,0.0016787258,0.0017849725,0.0014653876],"category_scores_gemma":[0.00490731,0.0004892587,0.0014723444,0.0011271009,0.0015392026,0.0016508554,0.0022813482,0.0028971017,0.0007715344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040004135,0.000048465798,0.0003726782,0.00012397024,0.000044862365,0.00009580436,0.00005502012,0.9127101,0.0059416294,0.024787726,0.003099475,0.052680187],"study_design_scores_gemma":[0.0000023106327,0.00002211521,0.000054146083,0.0000063998737,0.0000025314148,0.000020402049,0.0000033911795,0.9958222,0.00058191345,0.0026820495,0.0007958363,0.000006771789],"about_ca_topic_score_codex":0.0024452517,"about_ca_topic_score_gemma":0.0016500887,"teacher_disagreement_score":0.0028678689,"about_ca_system_score_codex":0.0012444035,"about_ca_system_score_gemma":0.0012117577,"threshold_uncertainty_score":0.015166879},"labels":[],"label_agreement":null},{"id":"W4376616754","doi":"10.1007/s10915-023-02225-2","title":"Study on $$L_1$$ over $$L_2$$ Minimization for Nonnegative Signal Recovery","year":2023,"lang":"en","type":"article","venue":"Journal of Scientific Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Property (philosophy); Constraint (computer-aided design); Focus (optics); Applied mathematics; Minification; Convergence (economics); Stationary point; Function (biology); Algorithm; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.04188883547963657,"score_gpt":0.2904826107676936,"score_spread":0.24859377528805704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376616754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012088809,0.0038199446,0.97097933,0.002279251,0.00042775308,0.000060125534,0.00012635003,0.00011085905,0.010107507],"genre_scores_gemma":[0.3647824,0.009629981,0.5940492,0.0022609618,0.0019318035,0.0003065085,0.0005908396,0.0007437425,0.025704598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872917,0.00064020074,0.000056581444,0.00022437482,0.0002517847,0.000097915115],"domain_scores_gemma":[0.9964013,0.0027964318,0.00014404072,0.00021086994,0.00034414363,0.00010319555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003155605,0.0016002412,0.0010260713,0.0006835714,0.00050765544,0.0010127597,0.0011008852,0.0014123647,0.0059804884],"category_scores_gemma":[0.009506646,0.00034645072,0.00085043645,0.00095725514,0.0013868985,0.0028730198,0.0017983383,0.0021179738,0.00065582915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005495143,0.00021155895,0.0012069645,0.0015229854,0.00015351565,0.0003295079,0.0002651999,0.15034531,0.019920623,0.53739625,0.026738886,0.26135966],"study_design_scores_gemma":[0.000025946765,0.00021694072,0.00041463468,0.00011099031,0.000054967455,0.00029076647,0.000077678604,0.8914361,0.0039458573,0.09604158,0.0073538315,0.00003067071],"about_ca_topic_score_codex":0.0014720956,"about_ca_topic_score_gemma":0.0015576605,"teacher_disagreement_score":0.0059804884,"about_ca_system_score_codex":0.0006647472,"about_ca_system_score_gemma":0.0010461102,"threshold_uncertainty_score":0.020006716},"labels":[],"label_agreement":null},{"id":"W4377103495","doi":"10.1016/j.memori.2023.100060","title":"Survey on compressed sensing over the past two decades","year":2023,"lang":"en","type":"article","venue":"Memories - Materials Devices Circuits and Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Decoding methods; Compressed sensing; Demodulation; SIGNAL (programming language); Encryption; Encoding (memory); Algorithm; Computer engineering; Block (permutation group theory); Theoretical computer science; Usability; Transmitter; Listing (finance); Nyquist–Shannon sampling theorem; Telecommunications; Artificial intelligence; Computer vision; Mathematics; Human–computer interaction; Computer security","score_opus":0.04371639433080169,"score_gpt":0.2670732861150888,"score_spread":0.2233568917842871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377103495","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033749768,0.9108837,0.046938825,0.0038438623,0.002691478,0.000062811625,0.00052105775,0.00019209232,0.031491198],"genre_scores_gemma":[0.023440858,0.93919766,0.022766052,0.001810783,0.004732137,0.000072900686,0.0009366505,0.00008042473,0.0069625806],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998765,0.00025160718,0.00014219807,0.00023828211,0.0005295552,0.000073443625],"domain_scores_gemma":[0.9960316,0.0025826085,0.00017487281,0.00022869506,0.00089269417,0.0000895318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014116949,0.0009930553,0.0011111436,0.0034060355,0.00056660996,0.0019110761,0.0010060483,0.0014441472,0.008367838],"category_scores_gemma":[0.0055910116,0.0004924412,0.00069915625,0.0063791717,0.00095428753,0.0027966842,0.0013936204,0.0015618376,0.0027435303],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019315639,0.00009031482,0.0009668177,0.0076030595,0.00011909159,0.00018345428,0.00020355398,0.0067971633,0.00208611,0.065165214,0.043536615,0.8730554],"study_design_scores_gemma":[0.000020797122,0.00029382465,0.0017822565,0.004896786,0.00012960807,0.0015957856,0.00030552814,0.01183128,0.0033785517,0.033704896,0.9419546,0.000106121326],"about_ca_topic_score_codex":0.00200114,"about_ca_topic_score_gemma":0.0013277732,"teacher_disagreement_score":0.008367838,"about_ca_system_score_codex":0.001051955,"about_ca_system_score_gemma":0.0015596256,"threshold_uncertainty_score":0.027993202},"labels":[],"label_agreement":null},{"id":"W4380484875","doi":"10.3390/math11122674","title":"Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matrix decomposition; Sparse matrix; Non-negative matrix factorization; Computer science; Sparse approximation; Pattern recognition (psychology); Matrix (chemical analysis); K-SVD; Artificial intelligence; Compressed sensing; Mathematics","score_opus":0.015948170509436692,"score_gpt":0.2604353705775595,"score_spread":0.2444872000681228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380484875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001337707,0.051375132,0.93408984,0.00232981,0.0011449187,0.000093866714,0.00031504504,0.00036446407,0.008949256],"genre_scores_gemma":[0.07928798,0.1610388,0.7386453,0.0015733489,0.007243889,0.00066450244,0.00110757,0.00022635417,0.010212322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976694,0.00081784563,0.00017572705,0.00043298106,0.0007924769,0.00011150202],"domain_scores_gemma":[0.9969117,0.0020872434,0.00024582478,0.0002687885,0.00042992484,0.000056396184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024270157,0.0021582688,0.0019706695,0.0025915415,0.0007652463,0.0021131982,0.0011623728,0.00197666,0.006071983],"category_scores_gemma":[0.006053891,0.0005822767,0.0013662043,0.0056708814,0.0025399015,0.0030180486,0.0014512872,0.0044363737,0.0036460317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006846142,0.00008157972,0.0007657586,0.0024073352,0.00016299324,0.00033818706,0.00046843247,0.04163079,0.0046546175,0.52725005,0.036800142,0.38537163],"study_design_scores_gemma":[0.000036306767,0.0001680977,0.0011422727,0.00062619115,0.00007595025,0.00077720184,0.00015649808,0.19233117,0.0032694282,0.6370622,0.1642252,0.00012959777],"about_ca_topic_score_codex":0.0023027468,"about_ca_topic_score_gemma":0.0016443823,"teacher_disagreement_score":0.006071983,"about_ca_system_score_codex":0.0011156093,"about_ca_system_score_gemma":0.0011988996,"threshold_uncertainty_score":0.020312786},"labels":[],"label_agreement":null},{"id":"W4382360363","doi":"10.1016/j.engappai.2023.106663","title":"Sparse representation learning using ℓ1−2 compressed sensing and rank-revealing QR factorization","year":2023,"lang":"lv","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences Centre; University of Toronto; Sunnybrook Health Science Centre","funders":"","keywords":"Discriminative model; Computer science; Artificial intelligence; Compressed sensing; Pattern recognition (psychology); Context (archaeology); Feature vector; Support vector machine; Feature (linguistics); Algorithm","score_opus":0.060949908061809346,"score_gpt":0.3069883736954304,"score_spread":0.24603846563362108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382360363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022305194,0.0001710844,0.9964972,0.00020020474,0.000042172855,0.000023836457,0.000054038555,0.00009671054,0.0006842308],"genre_scores_gemma":[0.15722455,0.0011928943,0.8363533,0.0003279599,0.00029861173,0.00014684489,0.0004914648,0.00008070636,0.0038836952],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988091,0.00038028578,0.00006716515,0.00018665013,0.0004846787,0.00007211929],"domain_scores_gemma":[0.99748236,0.0013922043,0.0002259831,0.00037966252,0.000436981,0.000082889586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014549133,0.00094170845,0.0010980447,0.0006295155,0.00035052764,0.00115434,0.00095415424,0.0010884855,0.0023647265],"category_scores_gemma":[0.008336472,0.00052308966,0.00069812156,0.0012394965,0.001197408,0.0017447203,0.0014946444,0.002036015,0.0010002241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004972998,0.00016733461,0.0007727773,0.0004988688,0.0001296926,0.00023411083,0.0002768916,0.37372637,0.032067705,0.19801335,0.01036193,0.3832537],"study_design_scores_gemma":[0.000018667313,0.00006329427,0.000121695644,0.000018138488,0.000009852193,0.00009404342,0.00001971857,0.97121,0.00323391,0.023293974,0.0018960732,0.000020666106],"about_ca_topic_score_codex":0.00232163,"about_ca_topic_score_gemma":0.0024714484,"teacher_disagreement_score":0.0023647265,"about_ca_system_score_codex":0.00043948923,"about_ca_system_score_gemma":0.0013412475,"threshold_uncertainty_score":0.007910788},"labels":[],"label_agreement":null},{"id":"W4382394613","doi":"10.18280/ts.400306","title":"Advanced Optimization of Satellite Image Observation Matrices via Orthogonal Trigonometric Decomposition and Karhunen-Loève Transform","year":2023,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Karhunen–Loève theorem; Compressed sensing; Computer science; Discrete cosine transform; Algorithm; Satellite; Remote sensing; Artificial intelligence; Matrix decomposition; Matrix (chemical analysis); Computer vision; Image (mathematics); Geography; Engineering; Materials science","score_opus":0.012911750156757646,"score_gpt":0.23533104041377323,"score_spread":0.2224192902570156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382394613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060228775,0.00018827066,0.9924992,0.0001309429,0.000020296653,0.000016021742,0.000033619297,0.00008722229,0.0010015446],"genre_scores_gemma":[0.31341392,0.0012946952,0.6812244,0.00014022956,0.000092762755,0.00013582471,0.0003043178,0.00010786477,0.003286032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995689,0.00013463154,0.000017779372,0.00006679704,0.00017791781,0.00003407302],"domain_scores_gemma":[0.99957913,0.00021910299,0.00007498412,0.00003624657,0.000072913484,0.000017654977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698052,0.00068116817,0.000578488,0.00041823855,0.00014826508,0.0005623767,0.00044174684,0.00048368718,0.0009048471],"category_scores_gemma":[0.0022911036,0.00025489388,0.0004238979,0.0006921151,0.0006520358,0.00080654386,0.00078104227,0.0010554533,0.00036739232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009408919,0.000054095115,0.0005100252,0.00022139709,0.00003885942,0.00013327903,0.00012195626,0.7461291,0.027747672,0.079253204,0.002607034,0.14308922],"study_design_scores_gemma":[0.000003852707,0.000021750415,0.00009983717,0.000006243692,0.0000027009944,0.000022225478,0.000007993637,0.99204516,0.0017994862,0.005210215,0.0007737819,0.000006776869],"about_ca_topic_score_codex":0.0020263214,"about_ca_topic_score_gemma":0.0021960074,"teacher_disagreement_score":0.0020263214,"about_ca_system_score_codex":0.00039564684,"about_ca_system_score_gemma":0.00091852085,"threshold_uncertainty_score":0.0040290356},"labels":[],"label_agreement":null},{"id":"W4382811464","doi":"10.1093/imaiai/iaad024","title":"Multivariate super-resolution without separation","year":2023,"lang":"en","type":"article","venue":"Information and Inference A Journal of the IMA","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Measure (data warehouse); Point spread function; Point (geometry); Gaussian; Generalization; Function (biology); Point process; Mathematics; Image (mathematics); Resolution (logic); Algorithm; Regular polygon; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Artificial intelligence; Physics; Statistics; Geometry","score_opus":0.01995799000048502,"score_gpt":0.2832194905943124,"score_spread":0.26326150059382736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382811464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011566248,0.00029299973,0.9855795,0.00044472393,0.000024105484,0.000013020116,0.0000658468,0.00006699385,0.0019466635],"genre_scores_gemma":[0.6041136,0.0010241013,0.38442472,0.00057088333,0.00030668124,0.000076173616,0.00032625286,0.00010553,0.00905215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.00023781417,0.000024349032,0.00017755458,0.00022081414,0.000062206615],"domain_scores_gemma":[0.99834394,0.0009712734,0.00021597071,0.00021581136,0.0001768295,0.00007614609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013574337,0.0006590924,0.0009220488,0.00043715455,0.00023585906,0.0009073214,0.00085797184,0.0012772828,0.0017076635],"category_scores_gemma":[0.0032656407,0.0004243576,0.0005560457,0.00079263165,0.0013348267,0.0020075114,0.0016366318,0.0019373298,0.00038026806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002637725,0.00008348342,0.0008608327,0.0003015968,0.00015747442,0.00044005766,0.000116518255,0.6634353,0.023824463,0.24386862,0.004381947,0.06226602],"study_design_scores_gemma":[0.000008446246,0.00001721628,0.0001789685,0.0000065508425,0.0000062743475,0.00008088358,0.00001019566,0.9680075,0.001928097,0.028916985,0.0008317418,0.000007225408],"about_ca_topic_score_codex":0.0019245846,"about_ca_topic_score_gemma":0.0015869751,"teacher_disagreement_score":0.0019245846,"about_ca_system_score_codex":0.00063528056,"about_ca_system_score_gemma":0.0006131548,"threshold_uncertainty_score":0.0071789026},"labels":[],"label_agreement":null},{"id":"W4383822576","doi":"10.1016/j.jmaa.2023.127570","title":"Random points are good for universal discretization","year":2023,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Moscow State University of Geodesy and Cartography; Russian Science Foundation","keywords":"Discretization; Discretization of continuous features; Mathematics; Sampling (signal processing); Discretization error; Applied mathematics; Norm (philosophy); Function (biology); Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.012554849758555725,"score_gpt":0.2487351840674964,"score_spread":0.23618033430894067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383822576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071232505,0.0024556855,0.90178204,0.0044688038,0.00074806274,0.00008221097,0.0005311132,0.0006949993,0.018004626],"genre_scores_gemma":[0.83780515,0.0023459932,0.14472929,0.0027438898,0.0009383816,0.00019499827,0.0006937462,0.0005717337,0.009976682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964384,0.0013647495,0.00020570384,0.0007404024,0.0009044712,0.00034627135],"domain_scores_gemma":[0.97649014,0.013676346,0.0011445741,0.00639647,0.0014181794,0.00087418495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050800345,0.0011785155,0.0026953376,0.0021315182,0.0017015267,0.003113401,0.0013064414,0.0031312346,0.004874749],"category_scores_gemma":[0.035805386,0.0012983413,0.0011892414,0.0013276713,0.008313635,0.007388585,0.0042366837,0.0058637927,0.0009943064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018282616,0.00003106182,0.0005341336,0.00017298906,0.00006328168,0.00008596653,0.00017037193,0.033060446,0.002271994,0.94876486,0.0030897188,0.011572289],"study_design_scores_gemma":[0.000043023643,0.00004917345,0.00030426643,0.000057796227,0.000020357673,0.00012996452,0.000085800435,0.067272216,0.0012601917,0.92780817,0.0029377686,0.00003116487],"about_ca_topic_score_codex":0.0008024525,"about_ca_topic_score_gemma":0.0008090933,"teacher_disagreement_score":0.0050800345,"about_ca_system_score_codex":0.0008271967,"about_ca_system_score_gemma":0.0007949576,"threshold_uncertainty_score":0.026866078},"labels":[],"label_agreement":null},{"id":"W4384574990","doi":"10.23952/jano.5.2023.2.05","title":"The boosted proximal difference-of-convex algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convex function; Proximal Gradient Methods; Lipschitz continuity; Sequence (biology); Convex optimization; Limit point; Convexity; Monotonic function; Function (biology); Logarithmically convex function; Rate of convergence; Regular polygon; Algorithm; Applied mathematics; Combinatorics; Subderivative; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.00873160697592923,"score_gpt":0.20934418763918147,"score_spread":0.20061258066325224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017526788,0.00014592387,0.99696594,0.000089796806,0.00004512017,0.000025275653,0.000015346872,0.00013121375,0.0008287331],"genre_scores_gemma":[0.21295905,0.0004900642,0.7787882,0.00032322918,0.00014604337,0.0002922432,0.00023156314,0.00017033183,0.0065992726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989324,0.0003203428,0.000046799723,0.0001720652,0.00042617752,0.00010215353],"domain_scores_gemma":[0.9989905,0.00044296056,0.000060815048,0.00009863841,0.0003376182,0.000069420516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017527161,0.0008839769,0.0018139939,0.0006525643,0.00043454146,0.0010552694,0.002299318,0.0015592129,0.0029573757],"category_scores_gemma":[0.0034589171,0.00059609895,0.0008780801,0.0008227391,0.0010192513,0.0014051361,0.002024258,0.0023627789,0.0012086504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022135927,0.00008539997,0.0006534559,0.00027135786,0.0000815113,0.00015046766,0.00012765228,0.7787632,0.004753095,0.04763183,0.0048286873,0.16243201],"study_design_scores_gemma":[0.0000143283105,0.000033272347,0.000028473081,0.000006238401,0.000004471879,0.000030446094,0.000004577839,0.9939051,0.00071578455,0.004138185,0.0011127965,0.0000062993154],"about_ca_topic_score_codex":0.0023855155,"about_ca_topic_score_gemma":0.0014967012,"teacher_disagreement_score":0.0029573757,"about_ca_system_score_codex":0.00076071447,"about_ca_system_score_gemma":0.0017522316,"threshold_uncertainty_score":0.009893417},"labels":[],"label_agreement":null},{"id":"W4384575246","doi":"10.23952/asvao.5.2023.2.02","title":"Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Semidefinite programming; Semidefinite embedding; Coordinate descent; Diagonal; Convex optimization; Mathematics; Mathematical optimization; Convergence (economics); Rate of convergence; Quadratically constrained quadratic program; Gauss–Seidel method; Positive-definite matrix; Conic optimization; Regular polygon; Matrix (chemical analysis); Iterative method; Applied mathematics; Computer science; Quadratic programming; Convex analysis","score_opus":0.017757650300981538,"score_gpt":0.25364058758013236,"score_spread":0.23588293727915083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008778866,0.00081759854,0.98522943,0.00043310027,0.000102863116,0.0000672849,0.000064423344,0.00022769788,0.0042786063],"genre_scores_gemma":[0.6276985,0.00253308,0.35910457,0.0008961501,0.00041368912,0.00083290535,0.000611343,0.0011529417,0.0067569423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938128,0.0035787015,0.00020889007,0.0006669063,0.0013124308,0.00042023786],"domain_scores_gemma":[0.9652349,0.026308484,0.001843884,0.002148228,0.003944269,0.00052025553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012839398,0.0025617066,0.0015973685,0.0011190712,0.0007465958,0.0019084776,0.0020543437,0.0018115857,0.0037388855],"category_scores_gemma":[0.043562993,0.00078774255,0.0011551451,0.0010474016,0.003469157,0.003035251,0.002277791,0.004038327,0.00086501817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024781292,0.00010062496,0.00062112394,0.0003052264,0.00009626392,0.00010201082,0.000099530065,0.85705924,0.0027803455,0.11743858,0.002993058,0.018156178],"study_design_scores_gemma":[0.000008684625,0.000048001806,0.000058237492,0.000020084693,0.000007192985,0.000019613088,0.000007778265,0.98895043,0.0009057345,0.0096367,0.00032888638,0.000008639546],"about_ca_topic_score_codex":0.002501509,"about_ca_topic_score_gemma":0.0016282658,"teacher_disagreement_score":0.012839398,"about_ca_system_score_codex":0.0019720336,"about_ca_system_score_gemma":0.0028466498,"threshold_uncertainty_score":0.06790203},"labels":[],"label_agreement":null},{"id":"W4384575262","doi":"10.23952/asvao.5.2023.2.10","title":"Minimum-rank positive semidefinite matrix completion with chordal patterns and applications to semidefinite relaxations","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chordal graph; Mathematics; Semidefinite programming; Rank (graph theory); Positive-definite matrix; Matrix (chemical analysis); Matrix completion; Large margin nearest neighbor; Combinatorics; Mathematical optimization; Computer science; Physics; Artificial intelligence","score_opus":0.011595903624355763,"score_gpt":0.23977247544891442,"score_spread":0.22817657182455867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027465546,0.000043189302,0.99513054,0.00014042729,0.000017302275,0.000045341018,0.000062563086,0.00020428486,0.0016099081],"genre_scores_gemma":[0.091312595,0.00016023008,0.9047504,0.0001304999,0.000048799793,0.00020477641,0.00033248385,0.00031337934,0.0027468046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870217,0.0004955108,0.00007115313,0.00020344551,0.00041145633,0.00011615801],"domain_scores_gemma":[0.9956494,0.00252828,0.00032925198,0.0005945404,0.00069531146,0.00020319883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022640734,0.001200604,0.0010510971,0.0006079939,0.0005043537,0.0015638825,0.0011239862,0.000986355,0.0075714486],"category_scores_gemma":[0.009425252,0.000572834,0.00087252137,0.0009472233,0.0013917345,0.0019542824,0.0018594974,0.003422382,0.0018276986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001880862,0.00028537464,0.0004195184,0.00035184732,0.000040450464,0.00018749395,0.0002388505,0.6440891,0.0068647843,0.19197294,0.012944648,0.14241688],"study_design_scores_gemma":[0.000029719153,0.000043988795,0.00003864176,0.000017134573,0.000002509385,0.00004980654,0.00003453096,0.947188,0.0019925304,0.04867964,0.0019108683,0.000012601055],"about_ca_topic_score_codex":0.00156658,"about_ca_topic_score_gemma":0.0024915757,"teacher_disagreement_score":0.0075714486,"about_ca_system_score_codex":0.0007046588,"about_ca_system_score_gemma":0.0015691455,"threshold_uncertainty_score":0.025329053},"labels":[],"label_agreement":null},{"id":"W4384665814","doi":"10.22215/etd/2023-15607","title":"Reconstruction of Compressive Sensed (CS) Images with Deep Equilibrium Model (DEQ) Based on Iterative Shrinkage-Thresholding Algorithm (ISTA)","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Algorithm; Iterative reconstruction; Computer science; Convolutional neural network; Artificial neural network; Block (permutation group theory); Signal reconstruction; Underdetermined system; Artificial intelligence; Signal processing; Mathematics; Digital signal processing","score_opus":0.013470861843780256,"score_gpt":0.241221864879587,"score_spread":0.22775100303580673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384665814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146883065,0.00016159625,0.98315585,0.00020347926,0.000034332967,0.000020934509,0.000052165225,0.00020266663,0.0014806606],"genre_scores_gemma":[0.504451,0.00091134507,0.48667312,0.00023117468,0.00006843509,0.00013960412,0.0003513964,0.000107565495,0.007066404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998087,0.000032638884,0.000010486025,0.000049296734,0.00007810494,0.000020862008],"domain_scores_gemma":[0.9997774,0.000080886784,0.000033322296,0.00003240154,0.00006023476,0.000015738613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037462788,0.0006382899,0.0005064582,0.00028991807,0.00022861215,0.0005748678,0.0006509052,0.0007242879,0.0010845962],"category_scores_gemma":[0.0009583626,0.00033825648,0.00056001963,0.00034131864,0.0005679276,0.0012688182,0.0007529534,0.0012386693,0.00025092994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016958656,0.00007981861,0.0016508332,0.0002033262,0.000074219264,0.00026298163,0.0001617367,0.7344028,0.051169567,0.06683087,0.0029858625,0.14200844],"study_design_scores_gemma":[0.0000031098198,0.000023960765,0.000071168026,0.000004057889,0.00000318279,0.000030270246,0.000005821955,0.9931539,0.0030653127,0.0030636734,0.00057018286,0.000005439706],"about_ca_topic_score_codex":0.0026794996,"about_ca_topic_score_gemma":0.0025143237,"teacher_disagreement_score":0.0026794996,"about_ca_system_score_codex":0.0005043773,"about_ca_system_score_gemma":0.0008321036,"threshold_uncertainty_score":0.0053278804},"labels":[],"label_agreement":null},{"id":"W4384696546","doi":"10.22215/etd/2023-15600","title":"Compressed Sensing of Block Sparse Signals with Known and Unknown Block Borders","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Compressed sensing; Block (permutation group theory); Computer science; Algorithm; Bayesian probability; Zero (linguistics); Artificial intelligence; Mathematics","score_opus":0.013832239302757099,"score_gpt":0.24699346619891396,"score_spread":0.23316122689615687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384696546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018442526,0.0003106782,0.9802383,0.00014480155,0.000019108695,0.000016724602,0.000059470098,0.00007690544,0.0006914737],"genre_scores_gemma":[0.47244346,0.001417846,0.5223668,0.00022579235,0.0001265262,0.00011801379,0.00044923037,0.000060626928,0.002791662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961555,0.00010459237,0.000018500301,0.00008206896,0.0001378868,0.000041417006],"domain_scores_gemma":[0.9984164,0.00097574806,0.00024235071,0.00013938044,0.00018567467,0.000040420302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006838936,0.0004379713,0.00058017217,0.0004970697,0.00017564857,0.0004973078,0.0005715469,0.000744208,0.00071668025],"category_scores_gemma":[0.004105862,0.00022374168,0.0003217852,0.00063803315,0.000672258,0.0012603062,0.0007837218,0.0008501205,0.00022526016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005793932,0.00008437436,0.0018894384,0.0003659861,0.00007598738,0.0005633646,0.00037443236,0.51297903,0.07134137,0.16808517,0.0029253229,0.24073608],"study_design_scores_gemma":[0.000012477815,0.000046361856,0.00044511224,0.000019437604,0.00000875384,0.000119032644,0.00002715764,0.97552335,0.004730197,0.017653968,0.0014017195,0.00001242771],"about_ca_topic_score_codex":0.0011341529,"about_ca_topic_score_gemma":0.0012026671,"teacher_disagreement_score":0.0011341529,"about_ca_system_score_codex":0.0003039174,"about_ca_system_score_gemma":0.00048072252,"threshold_uncertainty_score":0.0036168098},"labels":[],"label_agreement":null},{"id":"W4385209684","doi":"10.48550/arxiv.2307.11233","title":"Bayesian Linear Regression with Cauchy Prior and Its Application in Sparse MIMO Radar","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Algorithm; MIMO; Bayesian probability; Computer science; Cauchy distribution; Bayesian inference; Convex optimization; Mathematics; Pattern recognition (psychology); Artificial intelligence; Regular polygon; Statistics; Beamforming; Telecommunications","score_opus":0.050846716057173516,"score_gpt":0.19371160860602654,"score_spread":0.14286489254885304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385209684","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019597728,0.0003041684,0.99659556,0.00018081843,0.000013741248,0.000008450234,0.0000142187,0.0000909272,0.00083226897],"genre_scores_gemma":[0.32012847,0.0030888007,0.670748,0.00045208496,0.0002259858,0.0001363355,0.00031653806,0.00016132706,0.0047424524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00039668323,0.000034133627,0.00014132756,0.0003342425,0.00005306991],"domain_scores_gemma":[0.9980368,0.0012804586,0.00015881736,0.00014851724,0.0003051264,0.000070190385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017833292,0.0007412,0.000822972,0.0007413688,0.00033253452,0.0006734549,0.0009536898,0.001387777,0.0013620218],"category_scores_gemma":[0.006560771,0.00051179837,0.0005435352,0.0010943443,0.001190855,0.0013809693,0.001226972,0.0015511304,0.0006371642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109927896,0.00007234869,0.0006055487,0.00019163117,0.000050438593,0.00013572612,0.00011228347,0.74613553,0.009614769,0.1179045,0.0022209487,0.12284639],"study_design_scores_gemma":[0.000004125452,0.00001461738,0.000059131045,0.000006691425,0.000003177358,0.00002968284,0.000003831631,0.98965657,0.0010762188,0.008395766,0.00074157334,0.000008592623],"about_ca_topic_score_codex":0.0024544157,"about_ca_topic_score_gemma":0.0017570372,"teacher_disagreement_score":0.0024544157,"about_ca_system_score_codex":0.00059922907,"about_ca_system_score_gemma":0.00091855763,"threshold_uncertainty_score":0.009431243},"labels":[],"label_agreement":null},{"id":"W4385223333","doi":"10.1109/lsp.2023.3298282","title":"Bounded Projection Matrix Approximation With Applications to Community Detection","year":2023,"lang":"en","type":"article","venue":"IEEE Signal Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Relaxation (psychology); Convergence (economics); Dykstra's projection algorithm; Mathematical optimization; Constraint (computer-aided design); Approximation algorithm; Projection (relational algebra); Symmetric matrix; Mathematics; Matrix (chemical analysis); Matrix decomposition; Differentiable function; Algorithm; Computer science; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.025277830251501224,"score_gpt":0.2632764646525136,"score_spread":0.23799863440101238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385223333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016661226,0.00014223029,0.99748814,0.00013397192,0.00002494688,0.000013937565,0.0000122494175,0.00010449816,0.00041389404],"genre_scores_gemma":[0.20099182,0.0008150335,0.79432756,0.00019815082,0.00017370102,0.00017105631,0.00022313991,0.00013286139,0.0029666636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987675,0.00055185816,0.000035213532,0.00020000269,0.00037451362,0.00007083854],"domain_scores_gemma":[0.9963553,0.0024172142,0.0002565548,0.00032169974,0.00050946116,0.00013979271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908472,0.0011146007,0.0012189889,0.0010768381,0.0006683857,0.00096338073,0.0014449836,0.0014056272,0.0016816958],"category_scores_gemma":[0.009137684,0.00047788615,0.0007167045,0.0017530568,0.0012886083,0.0018772724,0.0020801171,0.0029126657,0.0006111754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012425217,0.000103393984,0.0007290681,0.0002175816,0.00008774297,0.00017652048,0.00014729187,0.68892926,0.006714037,0.11714466,0.0055158027,0.18011041],"study_design_scores_gemma":[0.000004503972,0.000011956046,0.00002981534,0.0000040372306,0.0000023743683,0.000024083725,0.00000590335,0.9828538,0.00045285918,0.015980119,0.0006261599,0.000004398002],"about_ca_topic_score_codex":0.0023419166,"about_ca_topic_score_gemma":0.00193027,"teacher_disagreement_score":0.0023419166,"about_ca_system_score_codex":0.00064894167,"about_ca_system_score_gemma":0.0010787232,"threshold_uncertainty_score":0.010093033},"labels":[],"label_agreement":null},{"id":"W4385358734","doi":"10.1016/j.cam.2023.115460","title":"Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection","year":2023,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Projection (relational algebra); A priori and a posteriori; Inverse; Inverse problem; Applied mathematics; Gradient method; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","score_opus":0.014195065061918765,"score_gpt":0.22284990051297074,"score_spread":0.20865483545105198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385358734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029056037,0.00010662398,0.9962173,0.000065562024,0.0000347732,0.000011728128,0.000018090526,0.00007472466,0.000565562],"genre_scores_gemma":[0.14946416,0.0006175319,0.8463364,0.00012431643,0.00008449467,0.000104366845,0.00020584837,0.00012702006,0.002935942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994123,0.00013964645,0.000035125882,0.00007115342,0.00031163837,0.000030062962],"domain_scores_gemma":[0.9991691,0.0003969228,0.00006861275,0.00014203288,0.00018642737,0.000036929046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008967065,0.0009801866,0.0010889709,0.0005465439,0.00029582708,0.00086708704,0.00087726343,0.0013202211,0.0027876347],"category_scores_gemma":[0.0029679688,0.0007150811,0.0006593796,0.0007927785,0.0008584747,0.0022502365,0.0015552493,0.0019102368,0.0006502477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022925096,0.000132672,0.0005969913,0.00051170617,0.00012626263,0.00029406624,0.00021248999,0.6799807,0.032513827,0.063264884,0.003718982,0.2184183],"study_design_scores_gemma":[0.0000054150323,0.000027653205,0.000062089544,0.00001047779,0.0000074822215,0.000050319737,0.0000084709845,0.9916803,0.0025433272,0.00465639,0.0009393607,0.000008630533],"about_ca_topic_score_codex":0.0018658512,"about_ca_topic_score_gemma":0.0030485187,"teacher_disagreement_score":0.0027876347,"about_ca_system_score_codex":0.0002629827,"about_ca_system_score_gemma":0.0009715613,"threshold_uncertainty_score":0.009325504},"labels":[],"label_agreement":null},{"id":"W4385634287","doi":"10.1007/s43670-023-00065-7","title":"Embracing off-the-grid samples","year":2023,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Petrobras; Natural Sciences and Engineering Research Council of Canada; Hess Corporation; BG Group; ConocoPhillips","keywords":"Algorithm; Undersampling; Computer science; Artificial intelligence; Compressed sensing","score_opus":0.06496448420519808,"score_gpt":0.3055116528807253,"score_spread":0.24054716867552722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385634287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09538897,0.0001890789,0.9009486,0.00034700005,0.000055579454,0.000033081324,0.00011034145,0.0001960672,0.0027313042],"genre_scores_gemma":[0.8769648,0.00019644921,0.12042424,0.00024175884,0.00006164106,0.00004804041,0.0002469563,0.00005728732,0.0017588597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983828,0.0006734621,0.00008216224,0.0003582399,0.00038629,0.00011704992],"domain_scores_gemma":[0.99520975,0.0026804945,0.00048167226,0.0011312679,0.00036048106,0.00013644401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023136244,0.00050352607,0.0007323044,0.00027430817,0.00028784116,0.0008864048,0.00093327294,0.0009400553,0.0013885061],"category_scores_gemma":[0.0127352085,0.00032319204,0.00035463038,0.0005474725,0.0014682966,0.0019594026,0.0017328984,0.0011380623,0.0003651461],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008935529,0.00012666381,0.008461938,0.00020171929,0.00010754361,0.0006623197,0.00033724713,0.7248224,0.019675551,0.13549036,0.0024154235,0.106805235],"study_design_scores_gemma":[0.000024951989,0.000089852474,0.00072672486,0.0000151135055,0.000008852008,0.00014409595,0.000074379226,0.96007466,0.0047121467,0.032692667,0.0014218924,0.000014610731],"about_ca_topic_score_codex":0.0017336467,"about_ca_topic_score_gemma":0.0018805383,"teacher_disagreement_score":0.0023136244,"about_ca_system_score_codex":0.00044503994,"about_ca_system_score_gemma":0.0006849745,"threshold_uncertainty_score":0.012235761},"labels":[],"label_agreement":null},{"id":"W4385705583","doi":"10.1007/s43670-023-00063-9","title":"HARFE: hard-ridge random feature expansion","year":2023,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Directorate for Mathematical and Physical Sciences","keywords":"Ridge; Feature (linguistics); Smoothing; Algorithm; Outlier; Mathematics; Sparse approximation; Random matrix; Pattern recognition (psychology); Computer science; Thresholding; Matrix (chemical analysis); Artificial intelligence; Statistics","score_opus":0.05151404994003881,"score_gpt":0.29819900236181424,"score_spread":0.24668495242177543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385705583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018433419,0.00027334483,0.9918229,0.00025757687,0.00014198806,0.000036975707,0.0002467405,0.003464888,0.0019123235],"genre_scores_gemma":[0.115085445,0.0004937614,0.8595657,0.00070008554,0.0002615592,0.0002569774,0.0018767933,0.001757296,0.020002425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900997,0.00026075804,0.000034713965,0.00013848835,0.00048636127,0.000069759284],"domain_scores_gemma":[0.998722,0.00058433873,0.000064433945,0.00035613362,0.00020532934,0.000067692614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012348437,0.00086669635,0.0008726594,0.00074000756,0.00040624652,0.0010511095,0.001103581,0.0013675094,0.011314437],"category_scores_gemma":[0.005272556,0.00034770265,0.0005191789,0.0008756696,0.00082408,0.0012194691,0.0017328251,0.0023126516,0.0061422475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043630583,0.00018363059,0.0004927807,0.0001691692,0.00007173774,0.00026659257,0.000062381536,0.081097335,0.013211621,0.08800384,0.07304961,0.742955],"study_design_scores_gemma":[0.000043324733,0.000062682644,0.00027252312,0.00002294981,0.000009404509,0.00019865278,0.00001094744,0.920887,0.010108587,0.04868014,0.019677425,0.000026424515],"about_ca_topic_score_codex":0.0011374599,"about_ca_topic_score_gemma":0.0017822694,"teacher_disagreement_score":0.011314437,"about_ca_system_score_codex":0.00031687948,"about_ca_system_score_gemma":0.00056729,"threshold_uncertainty_score":0.0378505},"labels":[],"label_agreement":null},{"id":"W4385807399","doi":"10.1137/22m1508315","title":"Unilateral Orthogonal Nonnegative Matrix Factorization","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Nonnegative matrix; Matrix (chemical analysis); Orthogonal matrix; Combinatorics; Factorization; Matrix decomposition; Pure mathematics; Algebra over a field; Symmetric matrix; Orthogonal basis; Algorithm; Eigenvalues and eigenvectors","score_opus":0.007919085647999972,"score_gpt":0.22573900322419888,"score_spread":0.2178199175761989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385807399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003640984,0.00020885872,0.98593277,0.0002616946,0.00028613152,0.0000411691,0.00017534461,0.00013962397,0.009313352],"genre_scores_gemma":[0.39712712,0.0021357292,0.55347127,0.0008589281,0.00090639596,0.0003096916,0.0012023126,0.00028463872,0.04370385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911207,0.00022365741,0.0000381445,0.0001789348,0.00035506787,0.00009221418],"domain_scores_gemma":[0.9990294,0.0002764771,0.00011046408,0.00024068788,0.00026289956,0.000080023245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007556659,0.0011966462,0.00079986785,0.0005648093,0.0004630498,0.0011785345,0.00060107955,0.00092794484,0.00903658],"category_scores_gemma":[0.0034758416,0.00031625957,0.0006114035,0.0007660529,0.0010768623,0.0015196695,0.0016000965,0.0013400582,0.0022586489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013779185,0.00009932199,0.00031414098,0.0002579823,0.00005483946,0.00024156336,0.000087421766,0.07641268,0.018508201,0.67658514,0.019523988,0.20777692],"study_design_scores_gemma":[0.000022305723,0.00009306814,0.00026504934,0.00004108527,0.00002707358,0.00032223132,0.000059899587,0.72859126,0.0075027556,0.247042,0.0159993,0.000033966753],"about_ca_topic_score_codex":0.0008409923,"about_ca_topic_score_gemma":0.0014817541,"teacher_disagreement_score":0.00903658,"about_ca_system_score_codex":0.00027564782,"about_ca_system_score_gemma":0.001224796,"threshold_uncertainty_score":0.030230343},"labels":[],"label_agreement":null},{"id":"W4386057528","doi":"10.1109/isit54713.2023.10206541","title":"Success Probabilities of L <sub>2</sub> -norm Regularized Babai Detectors and Maximization","year":2023,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Detector; Regularization (linguistics); Maximization; Norm (philosophy); Exponential function; Applied mathematics; Computer science; Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Mathematical analysis","score_opus":0.008738836188729745,"score_gpt":0.18786231579639978,"score_spread":0.17912347960767003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386057528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017159134,0.00029286358,0.9761465,0.0003406533,0.00003333165,0.00006931908,0.0000991299,0.00017995219,0.005679044],"genre_scores_gemma":[0.68469375,0.0010853995,0.30504492,0.00048704646,0.00023631337,0.00045107238,0.00027682586,0.00023527851,0.0074893855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646395,0.0015153688,0.0001670836,0.0005141931,0.0009841697,0.0003552474],"domain_scores_gemma":[0.9801909,0.015388413,0.0013303433,0.0010917743,0.0016139705,0.00038454653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053879498,0.0016310619,0.0012402299,0.0011255848,0.00050291716,0.0020081745,0.0015076172,0.0017011994,0.0039914516],"category_scores_gemma":[0.027958868,0.00072221085,0.0007822534,0.0010335817,0.0035570427,0.0030738234,0.002551746,0.0021905776,0.00080396445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044896858,0.0000854377,0.0022026345,0.00044870254,0.00012507886,0.00033147418,0.00048222498,0.3781758,0.013923966,0.5340869,0.0026193426,0.067069486],"study_design_scores_gemma":[0.00002926703,0.00010282364,0.00058717723,0.0000614935,0.000028459845,0.00028679764,0.000059238588,0.8881232,0.008403305,0.10079008,0.0014672043,0.000060910355],"about_ca_topic_score_codex":0.00051718,"about_ca_topic_score_gemma":0.0005713045,"teacher_disagreement_score":0.0053879498,"about_ca_system_score_codex":0.0009580768,"about_ca_system_score_gemma":0.0012445202,"threshold_uncertainty_score":0.028494537},"labels":[],"label_agreement":null},{"id":"W4386128340","doi":"10.1109/pn58661.2023.10222945","title":"D-HAN: An End-to-End Adaptive Neural Network for Snapshot Compressive Imaging","year":2023,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Snapshot (computer storage); Compressed sensing; Shearing (physics); Convolutional neural network; End-to-end principle; Artificial intelligence; Hyperspectral imaging; Visualization; Computer vision; Physics","score_opus":0.035246603663534395,"score_gpt":0.2710174918533184,"score_spread":0.23577088818978403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386128340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02017211,0.00027487174,0.97335476,0.0002445865,0.00008511524,0.00006980442,0.00024684265,0.002350837,0.0032012048],"genre_scores_gemma":[0.42109567,0.00043423224,0.5617897,0.0005967938,0.000077990284,0.00018060714,0.0011727514,0.00021671543,0.014435603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998615,0.000019877325,0.0000056241365,0.000036457426,0.00005341266,0.00002320524],"domain_scores_gemma":[0.9997857,0.00006719915,0.000020725018,0.000034982226,0.0000644559,0.000026877622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893037,0.00065938337,0.00034702374,0.00022598705,0.00026217182,0.00039975427,0.0010436017,0.00059109594,0.0022997733],"category_scores_gemma":[0.00097123324,0.00024258622,0.00020368201,0.00024959302,0.0003533232,0.0007919857,0.00096757995,0.0010498816,0.00056760426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042993797,0.00023299774,0.0022622407,0.00012904285,0.00013071223,0.00018857562,0.00009225391,0.37063757,0.041085128,0.014296682,0.01409123,0.55642366],"study_design_scores_gemma":[0.000005828436,0.000040235653,0.00013850523,0.0000035676044,0.0000043170776,0.000022054406,0.000004720529,0.99223703,0.0044671106,0.0017981393,0.0012716581,0.0000067648507],"about_ca_topic_score_codex":0.0056180274,"about_ca_topic_score_gemma":0.016284594,"teacher_disagreement_score":0.0056180274,"about_ca_system_score_codex":0.00048409656,"about_ca_system_score_gemma":0.00083287625,"threshold_uncertainty_score":0.011170685},"labels":[],"label_agreement":null},{"id":"W4386597099","doi":"10.1109/icip49359.2023.10222115","title":"Grad-FEC: Unequal Loss Protection of Deep Features in Collaborative Intelligence","year":2023,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Packet loss; Computer science; Network packet; Robustness (evolution); Feature (linguistics); Computer network; Cloud computing; Forward error correction; Resilience (materials science); Reliability (semiconductor); Distributed computing; Real-time computing; Artificial intelligence; Algorithm; Decoding methods; Operating system","score_opus":0.01661557257154969,"score_gpt":0.25623865309619165,"score_spread":0.23962308052464196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386597099","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042608805,0.00035727117,0.9539384,0.00019795827,0.00004905847,0.000045353587,0.00003834783,0.00063648453,0.0021283494],"genre_scores_gemma":[0.8708093,0.00017246511,0.12658508,0.00022106705,0.000054311735,0.000038349328,0.00007118903,0.000039452643,0.0020088158],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993062,0.0001391889,0.00003224678,0.00011650826,0.00030875517,0.00009708151],"domain_scores_gemma":[0.9981077,0.000750165,0.00024300722,0.000594977,0.000237845,0.000066335524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009563244,0.0006988538,0.0004628281,0.0004935076,0.000429513,0.000619644,0.0010946821,0.00074585166,0.0011227807],"category_scores_gemma":[0.003897225,0.00017255016,0.00027461984,0.00039916992,0.00092555024,0.0015089788,0.001462674,0.0008822725,0.00033174382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063818245,0.00024490268,0.0035199458,0.00019862747,0.00011946666,0.0006770649,0.0005425924,0.25518972,0.11542544,0.036382303,0.0044726855,0.5825891],"study_design_scores_gemma":[0.000029456427,0.00027179386,0.0009673606,0.000022970878,0.000024770428,0.00051653804,0.000065339045,0.93306106,0.04860929,0.01318842,0.0032134792,0.000029497107],"about_ca_topic_score_codex":0.00091144803,"about_ca_topic_score_gemma":0.001178012,"teacher_disagreement_score":0.0011227807,"about_ca_system_score_codex":0.00038443625,"about_ca_system_score_gemma":0.00045524864,"threshold_uncertainty_score":0.0050575733},"labels":[],"label_agreement":null},{"id":"W4386760226","doi":"10.1016/j.sigpro.2023.109257","title":"TEFISTA-Net: A learnable method for high-resolution range profile reconstruction with low-frequency ultra-wideband radar","year":2023,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Radar; Algorithm; Convolution (computer science); Artificial intelligence; Computational complexity theory; Range (aeronautics); Thresholding; Signal-to-noise ratio (imaging); Convolutional neural network; Artificial neural network; Image (mathematics); Engineering; Telecommunications","score_opus":0.014448130146273046,"score_gpt":0.24027283596186258,"score_spread":0.22582470581558953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386760226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020531774,0.00015705479,0.995171,0.00008086384,0.00005339114,0.000019161747,0.00011157667,0.0017190862,0.0006346208],"genre_scores_gemma":[0.08282096,0.0002964532,0.9081585,0.00035085573,0.00014147625,0.0001428788,0.0009850471,0.00047044078,0.0066334084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997577,0.000057170946,0.000009728515,0.000053574593,0.00009504264,0.000026810618],"domain_scores_gemma":[0.9996197,0.00016559161,0.00002713988,0.00006742472,0.00009015174,0.000029826522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064510887,0.0008117015,0.000662288,0.00052452134,0.00029483144,0.0006039157,0.0015445711,0.0013319846,0.004583803],"category_scores_gemma":[0.0018998132,0.0003453077,0.00050607795,0.0005083956,0.00040966447,0.00083346147,0.0011363861,0.0016409586,0.0020784747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058823,0.000121813246,0.00056904834,0.00013713371,0.00013141391,0.0001251233,0.000038157214,0.2012037,0.013367313,0.011003509,0.019157816,0.75373906],"study_design_scores_gemma":[0.000013521138,0.000028104732,0.000060688915,0.000006076973,0.00000666984,0.00004025863,0.000003315827,0.9917012,0.0031980292,0.0026519725,0.002283814,0.0000062846275],"about_ca_topic_score_codex":0.0024673361,"about_ca_topic_score_gemma":0.005659321,"teacher_disagreement_score":0.004583803,"about_ca_system_score_codex":0.00035942232,"about_ca_system_score_gemma":0.00077958114,"threshold_uncertainty_score":0.015334368},"labels":[],"label_agreement":null},{"id":"W4386918690","doi":"10.1109/tit.2023.3318152","title":"An Analysis of Transformed Unadjusted Langevin Algorithm for Heavy-Tailed Sampling","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; National Science Foundation","keywords":"Algorithm; Sampling (signal processing); Computer science; Statistical physics; Langevin dynamics; Statistics; Mathematics; Physics; Telecommunications; Detector","score_opus":0.02100305471321971,"score_gpt":0.27133019036829364,"score_spread":0.2503271356550739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386918690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018410334,0.00012807756,0.9790668,0.00033385944,0.000032508735,0.00008042867,0.000063033534,0.0002858575,0.0015991041],"genre_scores_gemma":[0.6301324,0.00043073346,0.3616867,0.00046436128,0.00009929552,0.00053349417,0.00047352066,0.00036267124,0.0058168154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976324,0.0007851955,0.00011760923,0.00036745507,0.00084180676,0.00025555267],"domain_scores_gemma":[0.9804569,0.015265043,0.0008833229,0.0015692081,0.0012405516,0.00058492506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006184265,0.0010385667,0.0012885543,0.00072896545,0.0006648958,0.0018946076,0.0030446127,0.0018101265,0.0054628123],"category_scores_gemma":[0.036859047,0.00060517405,0.000944405,0.00073106465,0.0026884507,0.003767074,0.0031468482,0.00369818,0.0006324331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039982758,0.000091496,0.0022754075,0.0001951788,0.00007166619,0.0002131226,0.00021017573,0.6753014,0.006028784,0.2891962,0.0012100189,0.024806764],"study_design_scores_gemma":[0.000011437164,0.000026317057,0.000088547225,0.000006965124,0.000004602542,0.000022305558,0.000008030705,0.9735694,0.0007794223,0.025312012,0.00016270726,0.000008249216],"about_ca_topic_score_codex":0.0029795081,"about_ca_topic_score_gemma":0.0027022928,"teacher_disagreement_score":0.006184265,"about_ca_system_score_codex":0.0021041988,"about_ca_system_score_gemma":0.0030213457,"threshold_uncertainty_score":0.032705903},"labels":[],"label_agreement":null},{"id":"W4387958289","doi":"10.4153/s0008439523000851","title":"Bregman distance regularization for nonsmooth and nonconvex optimization","year":2023,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Regularization (linguistics); Minification; Quadratic equation; Mathematical optimization; Operator (biology); Bregman divergence; Applied mathematics; Lasso (programming language); Convergence (economics); Artificial intelligence; Computer science","score_opus":0.010180296423894173,"score_gpt":0.20143554845531345,"score_spread":0.19125525203141927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387958289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057135606,0.0002648227,0.99174434,0.0003400858,0.000024248726,0.00001611333,0.000023451847,0.000066191096,0.0018071953],"genre_scores_gemma":[0.35967252,0.0011463051,0.6248068,0.0004345008,0.00020072852,0.00023098501,0.00026067498,0.0002561116,0.012991354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896896,0.0004616824,0.000035534234,0.00015634959,0.0003244091,0.00005316788],"domain_scores_gemma":[0.9985813,0.00086632516,0.0001518504,0.00012160214,0.00022343798,0.00005551028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022726746,0.0008728236,0.00090605667,0.00079965603,0.0004097018,0.000820925,0.0009951006,0.0013269704,0.0013764559],"category_scores_gemma":[0.0049622403,0.0003709764,0.00052234484,0.0007692065,0.0018228906,0.0014124581,0.0017118931,0.0023303085,0.00040725738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059878872,0.00006490375,0.0004592239,0.00024872203,0.0000735829,0.00016902608,0.00016887752,0.6039596,0.012572795,0.32711104,0.0044732345,0.05063908],"study_design_scores_gemma":[0.0000034871966,0.000020325482,0.000098232566,0.000009045963,0.0000022673685,0.000023786955,0.00000968905,0.9642589,0.0008774473,0.03325472,0.0014350939,0.0000070983274],"about_ca_topic_score_codex":0.002028803,"about_ca_topic_score_gemma":0.0020445075,"teacher_disagreement_score":0.0022726746,"about_ca_system_score_codex":0.0009058102,"about_ca_system_score_gemma":0.0012040472,"threshold_uncertainty_score":0.012019217},"labels":[],"label_agreement":null},{"id":"W4388863424","doi":"10.1007/s10489-023-05031-3","title":"Algorithmic generalization ability of PALM for double sparse regularized regression","year":2023,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Robustification; Mathematical optimization; Overfitting; Outlier; Regularization (linguistics); Linearization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Artificial neural network","score_opus":0.03990019454984641,"score_gpt":0.28292464088345526,"score_spread":0.24302444633360884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388863424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025454916,0.00030365633,0.970235,0.00037557085,0.000043593664,0.000026697773,0.00009024043,0.00031878738,0.0031515576],"genre_scores_gemma":[0.6573588,0.0011364669,0.33119938,0.00038849318,0.00023672609,0.00014788512,0.0005470876,0.00024366257,0.008741422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896634,0.0003158057,0.000058042173,0.00027608257,0.00027220833,0.000111527996],"domain_scores_gemma":[0.994921,0.0029834479,0.00034067346,0.0010191088,0.00055876333,0.00017704138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023621148,0.0007658807,0.0010121308,0.0009444702,0.000459226,0.0013395376,0.0011733974,0.0010525751,0.0037757955],"category_scores_gemma":[0.0125584835,0.00042711812,0.00084847765,0.00073279516,0.0013893342,0.0033147975,0.0025318372,0.0020768584,0.0008200114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045044773,0.0001540133,0.002656774,0.00037103737,0.0001452772,0.0002931578,0.00026635994,0.40610847,0.014482068,0.27798513,0.0065085595,0.29057875],"study_design_scores_gemma":[0.000008637674,0.000046204892,0.00027516665,0.00001282853,0.000012239144,0.000089110516,0.000022204811,0.92887324,0.0017285796,0.06795792,0.00096339453,0.000010380859],"about_ca_topic_score_codex":0.0010977612,"about_ca_topic_score_gemma":0.00103455,"teacher_disagreement_score":0.0037757955,"about_ca_system_score_codex":0.0004431082,"about_ca_system_score_gemma":0.00082767085,"threshold_uncertainty_score":0.012631297},"labels":[],"label_agreement":null},{"id":"W4388907377","doi":"10.3390/electronics12234742","title":"Progressive Feature Reconstruction and Fusion to Accelerate MRI Imaging: Exploring Insights across Low, Mid, and High-Order Dimensions","year":2023,"lang":"en","type":"article","venue":"Electronics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Science and Technology Infrastructure Program; Shanghai Institute of Technical Physics, Chinese Academy of Sciences; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Artificial intelligence; Block (permutation group theory); Iterative reconstruction; Feature (linguistics); Compressed sensing; Pattern recognition (psychology); Fidelity; Image fusion; High fidelity; Reconstruction algorithm; Acceleration; Computer vision; Image (mathematics); Algorithm; Mathematics; Telecommunications; Physics","score_opus":0.015165562239271482,"score_gpt":0.24374824681420096,"score_spread":0.22858268457492947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388907377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351553,0.0013779487,0.94125766,0.00044121235,0.00007071003,0.000055941415,0.00014323174,0.0012042375,0.0019336534],"genre_scores_gemma":[0.36325395,0.0014464798,0.6307135,0.00028110694,0.00008344709,0.000084019004,0.00069576094,0.00027639084,0.0031652427],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99963117,0.000050961437,0.000021303638,0.000071104354,0.00017645907,0.000048987877],"domain_scores_gemma":[0.99948704,0.00015158976,0.000079275735,0.000110877205,0.00013018733,0.000040959752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007950463,0.00090079807,0.0006705055,0.0009445403,0.0003004837,0.0008279293,0.00078465923,0.00078487274,0.0013236678],"category_scores_gemma":[0.0026484278,0.00026506826,0.0006671755,0.0007975556,0.0005642688,0.0013084107,0.0010148436,0.0011779896,0.00075189694],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033741604,0.00017594437,0.0034488193,0.00033025016,0.000140427,0.00036176163,0.0003065693,0.16152129,0.12977912,0.013732833,0.0058167637,0.6840487],"study_design_scores_gemma":[0.000026077225,0.00024523595,0.0017124498,0.000045187142,0.000055816454,0.00054573175,0.00008909701,0.93194425,0.04849109,0.009679158,0.007120997,0.00004488555],"about_ca_topic_score_codex":0.0021773237,"about_ca_topic_score_gemma":0.0041643456,"teacher_disagreement_score":0.0021773237,"about_ca_system_score_codex":0.00031162286,"about_ca_system_score_gemma":0.0008055795,"threshold_uncertainty_score":0.0044280887},"labels":[],"label_agreement":null},{"id":"W4388934007","doi":"10.1088/1361-6420/ad0f3b","title":"DRIP: deep regularizers for inverse problems","year":2023,"lang":"en","type":"article","venue":"Inverse Problems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Israeli Centers for Research Excellence; Division of Chemistry; Council for Higher Education; Ben-Gurion University of the Negev; United States-Israel Binational Science Foundation","keywords":"Deblurring; Inverse problem; Regularization (linguistics); Mathematics; Inference; Scalar (mathematics); Applied mathematics; Inverse; Well-posed problem; A priori and a posteriori; Function (biology); Mathematical optimization; Algorithm; Image (mathematics); Calculus (dental); Computer science; Artificial intelligence; Image restoration; Image processing; Mathematical analysis","score_opus":0.03184918215216552,"score_gpt":0.23211343737706808,"score_spread":0.20026425522490254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388934007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037531045,0.00019448709,0.9934928,0.00023943138,0.000035338297,0.000020208334,0.000058783276,0.00042267205,0.0017832415],"genre_scores_gemma":[0.26637074,0.0007009442,0.7191939,0.00061697594,0.00017103238,0.00029084628,0.00050898845,0.00069396256,0.011452661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928623,0.00026870923,0.00003282686,0.000115874995,0.00023913902,0.000057238893],"domain_scores_gemma":[0.9986939,0.0007352331,0.00011949367,0.00019234084,0.00018724042,0.000071739596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018049593,0.0009058719,0.0008341634,0.000663765,0.0003189809,0.0010052449,0.001350005,0.0016514623,0.0030868642],"category_scores_gemma":[0.005137135,0.00059849623,0.0007212472,0.0005423638,0.0014857005,0.0015463488,0.0028373837,0.0032806245,0.001074512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013070402,0.000085793516,0.00050700136,0.00019682148,0.00007288454,0.000118643606,0.00008992112,0.7253259,0.009014699,0.1413839,0.008825139,0.11424857],"study_design_scores_gemma":[0.0000072960365,0.000014797143,0.00003423093,0.000011150408,0.0000027880005,0.000019160141,0.0000049182304,0.9774605,0.0011547586,0.019480871,0.0018049591,0.0000046144814],"about_ca_topic_score_codex":0.0014444104,"about_ca_topic_score_gemma":0.002051616,"teacher_disagreement_score":0.0030868642,"about_ca_system_score_codex":0.00065343897,"about_ca_system_score_gemma":0.00085612584,"threshold_uncertainty_score":0.010326564},"labels":[],"label_agreement":null},{"id":"W4389477517","doi":"10.1007/s10208-023-09637-4","title":"Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Semidefinite programming; Symmetric matrix; Polynomial matrix; Bounded function; Matrix polynomial; Matrix decomposition; Computational complexity theory; Polynomial; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","score_opus":0.03505159384007851,"score_gpt":0.3077297506518258,"score_spread":0.2726781568117473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389477517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1540176,0.0010037993,0.8083563,0.008549064,0.00046750013,0.00030921743,0.0019970357,0.0015071413,0.023792313],"genre_scores_gemma":[0.7211984,0.00075466227,0.26174465,0.00080780423,0.0005734959,0.00043439472,0.00214746,0.00048575772,0.011853339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971263,0.0009265947,0.00014304137,0.00042235313,0.0010598638,0.00032201377],"domain_scores_gemma":[0.9799382,0.017046139,0.0005625089,0.001048647,0.000978875,0.00042557108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022562582,0.001053508,0.0012136353,0.00072510005,0.0007460802,0.0033992378,0.0015372525,0.0011876593,0.011930132],"category_scores_gemma":[0.01575858,0.00063482113,0.0008756162,0.001301892,0.0013925974,0.00486006,0.0025472303,0.0028755164,0.0015905056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018032449,0.00047499998,0.003455086,0.0006289296,0.00016988849,0.00063017115,0.00034291903,0.6392474,0.01117124,0.1000731,0.025585743,0.21641727],"study_design_scores_gemma":[0.00008931882,0.00007921952,0.00048449117,0.000016119799,0.000019956215,0.00012927614,0.00011277472,0.9515569,0.0015070029,0.045257054,0.0007315385,0.000016377287],"about_ca_topic_score_codex":0.004565184,"about_ca_topic_score_gemma":0.008810288,"teacher_disagreement_score":0.011930132,"about_ca_system_score_codex":0.0015996454,"about_ca_system_score_gemma":0.0034616648,"threshold_uncertainty_score":0.039910316},"labels":[],"label_agreement":null},{"id":"W4389833084","doi":"10.1007/s10898-023-01348-y","title":"A Bregman inertial forward-reflected-backward method for nonconvex minimization","year":2023,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bregman divergence; Inertial frame of reference; Mathematics; Convergence (economics); Function (biology); Minification; Applied mathematics; Sequence (biology); Property (philosophy); Work (physics); Mathematical optimization; Rate of convergence; Divergence (linguistics); Computer science; Key (lock)","score_opus":0.014961971923397004,"score_gpt":0.2998619709775416,"score_spread":0.2848999990541446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389833084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006964684,0.0000955554,0.997647,0.00008573213,0.00006543295,0.000025339517,0.000032186606,0.00008735962,0.0012648884],"genre_scores_gemma":[0.025321659,0.00027755435,0.96624625,0.00018285817,0.00009289595,0.00021183942,0.00019814589,0.00019120637,0.007277579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.00014305972,0.000023832508,0.000056332115,0.0001959307,0.000026346768],"domain_scores_gemma":[0.99947923,0.0002536192,0.000032681502,0.000059757025,0.00013390435,0.00004086696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011430514,0.0011162179,0.0011816645,0.00056249136,0.000484813,0.00080874725,0.0016298759,0.002058858,0.0060757766],"category_scores_gemma":[0.0023625293,0.0004998494,0.00076512346,0.00079689856,0.0008033063,0.0011233332,0.0021121176,0.0023779415,0.0026003208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029607056,0.0002473406,0.00045528158,0.00055129913,0.00012388869,0.00027386137,0.0002527566,0.47443068,0.026155435,0.14122649,0.020714555,0.33527243],"study_design_scores_gemma":[0.0000122609445,0.000043522206,0.00003921968,0.000015049638,0.000006230663,0.000047602858,0.000010827739,0.98836666,0.0012113537,0.005854772,0.0043793297,0.0000131438155],"about_ca_topic_score_codex":0.0018673696,"about_ca_topic_score_gemma":0.0034938399,"teacher_disagreement_score":0.0060757766,"about_ca_system_score_codex":0.00035090747,"about_ca_system_score_gemma":0.0015569666,"threshold_uncertainty_score":0.020325482},"labels":[],"label_agreement":null},{"id":"W4389914665","doi":"10.1007/s10994-023-06410-0","title":"Heterogeneous multi-task feature learning with mixed $$\\ell _{2,1}$$ regularization","year":2023,"lang":"en","type":"article","venue":"Machine Learning","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regularization (linguistics); Multi-task learning; Artificial intelligence; Computer science; Pattern recognition (psychology); Task (project management); Machine learning; Feature (linguistics); Feature learning; Mathematics; Engineering","score_opus":0.01001073199106917,"score_gpt":0.21192493207020055,"score_spread":0.20191420007913138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026580193,0.00013546179,0.9959317,0.0002528793,0.000051601222,0.000024270428,0.0001127112,0.00023153362,0.0006018864],"genre_scores_gemma":[0.3160838,0.00052389497,0.6714534,0.0011950644,0.000502224,0.00049001444,0.0016244708,0.00042097992,0.0077061104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998536,0.0006624742,0.00005632325,0.0002982897,0.00030623283,0.00014072134],"domain_scores_gemma":[0.9981001,0.0009963549,0.00014306272,0.00038674817,0.00026481858,0.00010891425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024556466,0.0019042912,0.0017483558,0.00062380376,0.00061453757,0.001269573,0.002448879,0.0028717497,0.0030955193],"category_scores_gemma":[0.0071862587,0.00077148696,0.0013345216,0.0014161761,0.0014887616,0.0020128032,0.002955918,0.0027207641,0.0012175593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077293563,0.00043991534,0.0009194169,0.00033957913,0.00028098642,0.00030963647,0.00016420893,0.5691702,0.014567371,0.07989541,0.03245393,0.3006864],"study_design_scores_gemma":[0.000020192705,0.000032870594,0.00008280012,0.000007222186,0.000011924599,0.000033618537,0.000007854897,0.98388195,0.00100466,0.013915082,0.0009908039,0.000011041753],"about_ca_topic_score_codex":0.0030490812,"about_ca_topic_score_gemma":0.004341001,"teacher_disagreement_score":0.0030955193,"about_ca_system_score_codex":0.0005121202,"about_ca_system_score_gemma":0.0012605373,"threshold_uncertainty_score":0.012986898},"labels":[],"label_agreement":null},{"id":"W4390018121","doi":"10.1137/1.9781611977806.ch30","title":"Chapter 30: The Fast Iterative Soft Thresholding Algorithm (FISTA)","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Thresholding; Norm (philosophy); Euclidean geometry; Algorithm; Euclidean distance; Computer science; Mathematics; Operator (biology); Combinatorics; Artificial intelligence; Image (mathematics); Geometry","score_opus":0.06542053641037388,"score_gpt":0.23591391380543109,"score_spread":0.1704933773950572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018121","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008287902,0.016233062,0.8875902,0.0008299988,0.002937245,0.00011885436,0.0007070842,0.0023226712,0.08843207],"genre_scores_gemma":[0.019425793,0.032819595,0.7029127,0.0012649513,0.0024679198,0.00030122604,0.0025421244,0.0029353276,0.23533028],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995665,0.000042633805,0.000020039352,0.000086469285,0.00026019468,0.000024155572],"domain_scores_gemma":[0.999724,0.000109973815,0.000013825328,0.000037864258,0.00009908877,0.00001530552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044917368,0.0012091639,0.0008125915,0.0010430993,0.0005099934,0.0017062097,0.00091793295,0.0013543572,0.033326738],"category_scores_gemma":[0.0012655383,0.00050171965,0.00073189073,0.0017181892,0.00065777247,0.0014704829,0.0008987538,0.0022866672,0.032770388],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006236596,0.00005769086,0.00008291582,0.00087108393,0.000038034577,0.000110427405,0.00014090704,0.019396756,0.011395542,0.10258404,0.19791776,0.66734254],"study_design_scores_gemma":[0.00001675643,0.000058529764,0.00025585628,0.00035052144,0.000028828748,0.0007216266,0.000045748344,0.06989661,0.011790235,0.1132604,0.8035122,0.000062670275],"about_ca_topic_score_codex":0.0011514445,"about_ca_topic_score_gemma":0.0018677517,"teacher_disagreement_score":0.033326738,"about_ca_system_score_codex":0.00052905595,"about_ca_system_score_gemma":0.0011466908,"threshold_uncertainty_score":0.11148906},"labels":[],"label_agreement":null},{"id":"W4390129274","doi":"10.1016/j.knosys.2023.111327","title":"Sparse smooth group <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si275.svg\" display=\"inline\" id=\"d1e17665\"><mml:mrow><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>∘</mml:mo><mml:msub><mml:mrow><mml:mi>L</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math> regularization method for convolutional neural networks","year":2023,"lang":"lv","type":"article","venue":"Knowledge-Based Systems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Rimouski","funders":"","keywords":"Regularization (linguistics); Convolutional neural network; Benchmark (surveying); Computer science; Algorithm; Function (biology); Group (periodic table); Artificial neural network; Artificial intelligence","score_opus":0.022897000210351258,"score_gpt":0.2510226319587269,"score_spread":0.22812563174837566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390129274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030809902,0.00040378064,0.83402497,0.002362027,0.000709676,0.00021472367,0.01804482,0.040723905,0.10043523],"genre_scores_gemma":[0.07615364,0.0015815034,0.55314416,0.0015245932,0.0005390903,0.00084151607,0.059350643,0.029290797,0.27757397],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995901,0.00006248155,0.000022317845,0.00006959467,0.00021691632,0.000038690225],"domain_scores_gemma":[0.99908745,0.00019344073,0.000051506155,0.00027965367,0.00032939695,0.00005855898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006512077,0.0009319107,0.00065140944,0.0009893709,0.0005037606,0.0016223043,0.0014682987,0.0013580932,0.20936863],"category_scores_gemma":[0.0032429192,0.00050179043,0.0007493443,0.0014490929,0.00056972215,0.0019121605,0.0017451531,0.0015881025,0.12696804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019761191,0.000058982423,0.00033096352,0.0004075909,0.000039283612,0.000117297095,0.00012986243,0.015311946,0.00891707,0.10385281,0.6375984,0.23303817],"study_design_scores_gemma":[0.00012328665,0.0000687575,0.0006507089,0.000108175474,0.000026276164,0.00022392816,0.00009114581,0.18934229,0.01928512,0.09400455,0.6960106,0.0000650128],"about_ca_topic_score_codex":0.0053780493,"about_ca_topic_score_gemma":0.008556547,"teacher_disagreement_score":0.20936863,"about_ca_system_score_codex":0.0007669437,"about_ca_system_score_gemma":0.0013530904,"threshold_uncertainty_score":0.70040786},"labels":[],"label_agreement":null},{"id":"W4390339149","doi":"10.1080/10556788.2023.2285492","title":"An ADMM based method for underdetermined box-constrained integer least squares problems","year":2023,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Underdetermined system; Solver; Integer (computer science); Mathematical optimization; Computer science; Least-squares function approximation; Integer programming; Algorithm; Tree (set theory); Mathematics; Statistics","score_opus":0.03514432945428824,"score_gpt":0.35674848051052077,"score_spread":0.3216041510562325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390339149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055274356,0.000064397405,0.9985526,0.00004582488,0.00002470377,0.000014983765,0.000025753054,0.0001240806,0.00059499335],"genre_scores_gemma":[0.027644342,0.00020366909,0.96956325,0.00014777036,0.0000625646,0.00016650467,0.00021835277,0.00012214022,0.0018714697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921525,0.00031848947,0.000036592155,0.00012846399,0.00025059917,0.000050576076],"domain_scores_gemma":[0.99879223,0.00067928544,0.00012265591,0.00011332096,0.00023838316,0.000054161355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013832301,0.0011428872,0.00096284534,0.0006033398,0.0004764466,0.000904068,0.0010885108,0.0011516677,0.0049588676],"category_scores_gemma":[0.0035158342,0.0005291979,0.0008637955,0.0009634478,0.00067240983,0.0012247517,0.0012248195,0.0024706388,0.0015726665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107925334,0.00008088795,0.00052565994,0.0003269969,0.00008628051,0.00012977784,0.00012355718,0.6892266,0.0076920865,0.04830401,0.011104023,0.24229218],"study_design_scores_gemma":[0.00001102277,0.000020672976,0.000032836622,0.000011524002,0.0000047767917,0.000033591637,0.0000073267574,0.9919228,0.0008375164,0.004320515,0.0027906832,0.0000066549164],"about_ca_topic_score_codex":0.0018229914,"about_ca_topic_score_gemma":0.0024119425,"teacher_disagreement_score":0.0049588676,"about_ca_system_score_codex":0.00037093094,"about_ca_system_score_gemma":0.0015482827,"threshold_uncertainty_score":0.016589046},"labels":[],"label_agreement":null},{"id":"W4390510615","doi":"10.1007/s11222-023-10371-8","title":"Accelerated gradient methods for sparse statistical learning with nonconvex penalties","year":2024,"lang":"en","type":"article","venue":"Statistics and Computing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperparameter; Convergence (economics); Lasso (programming language); Mathematical optimization; Rate of convergence; Algorithm; Computer science; Mathematics; Function (biology); Sequence (biology); Key (lock)","score_opus":0.028779360355939178,"score_gpt":0.330805102783729,"score_spread":0.3020257424277898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390510615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012855355,0.00019464514,0.9977016,0.00014125275,0.00004719851,0.00001535392,0.000022787257,0.00009610808,0.00049550534],"genre_scores_gemma":[0.11481948,0.0013394376,0.86957675,0.00024735197,0.0003903689,0.00036064058,0.0003639391,0.0004947394,0.012407228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990464,0.000450288,0.000034276967,0.00010179891,0.00031396552,0.00005321918],"domain_scores_gemma":[0.9968178,0.0020334353,0.00020488804,0.00030915256,0.00050535845,0.00012928733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018938485,0.0014254969,0.0013655066,0.00091782404,0.00041737946,0.0010695425,0.0016991381,0.0017454437,0.0034391987],"category_scores_gemma":[0.009390266,0.00082847726,0.0007766741,0.0013136851,0.0017068083,0.0019453354,0.002037978,0.0032006023,0.0010795159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015037172,0.000106062085,0.00033431302,0.00030380933,0.000087158296,0.00010441584,0.00013019075,0.59471226,0.004444844,0.28232628,0.00864621,0.10865412],"study_design_scores_gemma":[0.000008457974,0.000013933607,0.00003616175,0.0000075619864,0.0000030110616,0.00001337352,0.0000040216446,0.97077346,0.00031578628,0.027444467,0.0013739034,0.0000058083256],"about_ca_topic_score_codex":0.0037645623,"about_ca_topic_score_gemma":0.0052925507,"teacher_disagreement_score":0.0037645623,"about_ca_system_score_codex":0.00087931205,"about_ca_system_score_gemma":0.0016561175,"threshold_uncertainty_score":0.011505246},"labels":[],"label_agreement":null},{"id":"W4390618652","doi":"10.1016/j.jmva.2024.105294","title":"Estimation of sparse covariance matrix via non-convex regularization","year":2024,"lang":"en","type":"article","venue":"Journal of Multivariate Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Higher Education Discipline Innovation Project; Beijing Jiaotong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Estimator; Mathematics; Convex optimization; Mathematical optimization; Estimation of covariance matrices; Covariance; Covariance matrix; Regularization (linguistics); Applied mathematics; Relaxation (psychology); Matrix (chemical analysis); Regular polygon; Algorithm; Computer science; Statistics; Artificial intelligence","score_opus":0.009385802934811926,"score_gpt":0.268148301101438,"score_spread":0.25876249816662605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390618652","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031300914,0.00005287798,0.99629056,0.00009073421,0.00001310078,0.000008947334,0.000030327585,0.000084866704,0.00029850355],"genre_scores_gemma":[0.24831997,0.00055087986,0.74617094,0.00017884486,0.0001475941,0.00013514551,0.0007088879,0.00019003054,0.0035977715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990938,0.00028742643,0.000041903713,0.00014839618,0.0003572978,0.000071235765],"domain_scores_gemma":[0.9974706,0.0014816455,0.00023250567,0.00030025578,0.0004398264,0.00007524722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001171828,0.00084206805,0.0011147589,0.0006724602,0.00039067445,0.0009989914,0.0009989167,0.0010569124,0.0014072628],"category_scores_gemma":[0.0076230243,0.0007325711,0.00081343786,0.0008716144,0.00086128793,0.0016680205,0.001558821,0.001963666,0.00054222654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002491474,0.0001270689,0.0011006304,0.00024630883,0.00015446266,0.00015327173,0.00017682517,0.70093733,0.02987049,0.067241654,0.0051944056,0.19454838],"study_design_scores_gemma":[0.0000052516307,0.00001084138,0.00013391512,0.0000046591654,0.0000042831093,0.00002654719,0.000005468623,0.9925768,0.0012430575,0.0055964966,0.00038546813,0.000007134505],"about_ca_topic_score_codex":0.0036550176,"about_ca_topic_score_gemma":0.00459777,"teacher_disagreement_score":0.0036550176,"about_ca_system_score_codex":0.000462651,"about_ca_system_score_gemma":0.0017116218,"threshold_uncertainty_score":0.007267475},"labels":[],"label_agreement":null},{"id":"W4390945513","doi":"10.1190/geo2023-0465.1","title":"Robust multidimensional reconstruction via group sparsity with Radon operators","year":2024,"lang":"en","type":"article","venue":"Geophysics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alberta Energy; University of Alberta; University of Calgary","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Radon; Group (periodic table); Radon transform; Computer science; Geology; Artificial intelligence; Physics","score_opus":0.011353258469033557,"score_gpt":0.1802396328837437,"score_spread":0.16888637441471013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390945513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010926663,0.000059641738,0.98816293,0.00009239308,0.0000137705265,0.000010706153,0.00002068244,0.00010737131,0.0006057611],"genre_scores_gemma":[0.2835199,0.00023710764,0.71436393,0.00010299894,0.000045707162,0.00006212593,0.00016558844,0.00007062904,0.0014319961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953973,0.00016396628,0.000021757944,0.000066056324,0.00017828985,0.000030173793],"domain_scores_gemma":[0.9992649,0.00033732102,0.00013168801,0.00012006761,0.000111027446,0.000035051406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010814567,0.0006257494,0.0006041238,0.00063641317,0.00020820941,0.00062391494,0.000622704,0.00083814276,0.0009819275],"category_scores_gemma":[0.0023011127,0.0003329466,0.00076737464,0.00064695324,0.00078060396,0.0010408568,0.0015067066,0.001001408,0.00034229198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026482128,0.00009320131,0.0014211847,0.00023041053,0.00012517232,0.0002486499,0.0002478609,0.6776449,0.08180636,0.08239085,0.002299578,0.15322702],"study_design_scores_gemma":[0.000009033151,0.000034214136,0.000093642855,0.0000072640746,0.0000058186743,0.00004266074,0.000012038891,0.9884322,0.0052456395,0.0052334475,0.00087467476,0.000009280498],"about_ca_topic_score_codex":0.0008303065,"about_ca_topic_score_gemma":0.0006773937,"teacher_disagreement_score":0.0010814567,"about_ca_system_score_codex":0.0002450931,"about_ca_system_score_gemma":0.000629045,"threshold_uncertainty_score":0.005719304},"labels":[],"label_agreement":null},{"id":"W4390966193","doi":"10.1049/2024/6666549","title":"MsDC‐DEQ‐Net: Deep Equilibrium Model (DEQ) with Multiscale Dilated Convolution for Image Compressive Sensing (CS)","year":2024,"lang":"en","type":"article","venue":"IET Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block (permutation group theory); Algorithm; Residual; Compressed sensing; Iterative reconstruction; Iterative method; Sampling (signal processing); Convolution (computer science); Artificial intelligence; Computation; Artificial neural network; Mathematics; Computer vision","score_opus":0.014471770583780349,"score_gpt":0.24269548610896902,"score_spread":0.22822371552518866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390966193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014660868,0.00024951727,0.9811662,0.00023664632,0.00005090873,0.000026952875,0.00012651154,0.00061664777,0.002865706],"genre_scores_gemma":[0.65899014,0.0005892505,0.3224139,0.00045155495,0.000066087676,0.00022408512,0.00069339,0.00023809237,0.016333487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988866,0.000018748327,0.0000055055734,0.000033237706,0.000037239734,0.000016686372],"domain_scores_gemma":[0.9998198,0.00006461997,0.000019781244,0.000027754244,0.000050570008,0.000017489065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032595376,0.00062363676,0.00045873446,0.00020474396,0.00021645735,0.00051527354,0.001335226,0.0008504904,0.0024825896],"category_scores_gemma":[0.00078517385,0.0003061876,0.00040419545,0.0002444068,0.00058808393,0.00092554756,0.0007849707,0.0012240602,0.00059224013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000954077,0.00006536203,0.00055966055,0.000073489915,0.000035742214,0.000089681605,0.000038763043,0.8928958,0.012786213,0.024601618,0.0030777943,0.06568045],"study_design_scores_gemma":[0.0000024494104,0.000011808951,0.000025520401,0.0000018156495,0.0000021684789,0.000010763469,0.0000016098148,0.99652267,0.0012072456,0.0016487349,0.0005629861,0.0000022647662],"about_ca_topic_score_codex":0.0053204913,"about_ca_topic_score_gemma":0.009502399,"teacher_disagreement_score":0.0053204913,"about_ca_system_score_codex":0.0007092059,"about_ca_system_score_gemma":0.0010350711,"threshold_uncertainty_score":0.01057905},"labels":[],"label_agreement":null},{"id":"W4391014774","doi":"10.1002/9781394180523.ch18","title":"Massive Unsourced Random Access","year":2024,"lang":"en","type":"other","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Random access; Computer science; Computer network","score_opus":0.0160109529948762,"score_gpt":0.2588986174354616,"score_spread":0.2428876644405854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391014774","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004395216,0.0007649936,0.9862325,0.0003814906,0.00012380889,0.00003999129,0.00008433729,0.00020166412,0.007775976],"genre_scores_gemma":[0.6260022,0.0040844665,0.34585312,0.00070052635,0.00069584046,0.0002933421,0.00041031418,0.00009466521,0.021865489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987828,0.00041912912,0.000041535353,0.00020234773,0.0004470316,0.00010701903],"domain_scores_gemma":[0.9987307,0.0006908725,0.000104030856,0.00029238765,0.00013954975,0.000042481843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081117346,0.00062904984,0.0007366496,0.00040185553,0.00039017532,0.0011877364,0.0011982745,0.00064591784,0.0030956885],"category_scores_gemma":[0.0031650716,0.00024327065,0.00038377257,0.0008451617,0.0008475835,0.0014837867,0.0017866463,0.0012887599,0.00083672197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016284604,0.000076194156,0.0004459597,0.00029006772,0.00005784391,0.00033797816,0.00016390476,0.20051144,0.011980681,0.6072244,0.00861132,0.17013727],"study_design_scores_gemma":[0.000017521388,0.00007140063,0.00012741363,0.000032687127,0.000010282352,0.00033672457,0.00003994851,0.87819767,0.0019544798,0.10625383,0.012940752,0.000017204613],"about_ca_topic_score_codex":0.0005121954,"about_ca_topic_score_gemma":0.0008283285,"teacher_disagreement_score":0.0030956885,"about_ca_system_score_codex":0.00045760005,"about_ca_system_score_gemma":0.00060261454,"threshold_uncertainty_score":0.010356128},"labels":[],"label_agreement":null},{"id":"W4391021271","doi":"10.1109/cdc49753.2023.10384285","title":"Automated Lyapunov Analysis of Primal-Dual Optimization Algorithms: An Interpolation Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Rate of convergence; Lyapunov function; Linear matrix inequality; Convex optimization; Convergence (economics); Mathematical optimization; Convex function; Interpolation (computer graphics); Mathematics; Algorithm; Computer science; Regular polygon","score_opus":0.023035404596531,"score_gpt":0.26707107525640017,"score_spread":0.24403567065986917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391021271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018452349,0.000083708575,0.996132,0.00009873228,0.000019329542,0.000020073394,0.000013211203,0.00011592384,0.0016717361],"genre_scores_gemma":[0.5612566,0.00076928886,0.42945245,0.00019416853,0.00022466216,0.0003898494,0.00018051267,0.00045371187,0.007078784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982686,0.0006838308,0.00008151484,0.00018481127,0.0006523131,0.00012897539],"domain_scores_gemma":[0.9936195,0.0039530476,0.00055485603,0.0007040026,0.0010416706,0.00012693237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041685854,0.0012504678,0.00092159386,0.0011736283,0.00058042904,0.0015913692,0.0014383285,0.00094280276,0.005473665],"category_scores_gemma":[0.014932195,0.00050663133,0.00089154206,0.0007145045,0.0017655779,0.0018345725,0.0019910242,0.0032020404,0.0010281536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007143283,0.000056473324,0.00039140185,0.00014252022,0.000035985267,0.00010500947,0.00013552752,0.66937613,0.0040713586,0.27894348,0.0014760663,0.04519467],"study_design_scores_gemma":[0.000003280207,0.000017632732,0.000023629567,0.000011307324,0.0000018486445,0.000011565615,0.0000057937673,0.97432446,0.0007554085,0.024188988,0.000651037,0.0000050729263],"about_ca_topic_score_codex":0.0009989176,"about_ca_topic_score_gemma":0.00073567935,"teacher_disagreement_score":0.005473665,"about_ca_system_score_codex":0.0013562287,"about_ca_system_score_gemma":0.002006391,"threshold_uncertainty_score":0.02204585},"labels":[],"label_agreement":null},{"id":"W4391043561","doi":"10.1093/imanum/drad102","title":"Compressive Fourier collocation methods for high-dimensional diffusion equations with periodic boundary conditions","year":2024,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Sparse grid; Collocation (remote sensing); Partial differential equation; Collocation method; Applied mathematics; Fourier series; Fourier transform; Curse of dimensionality; Mathematical analysis; Computer science; Differential equation; Ordinary differential equation","score_opus":0.015114709421600599,"score_gpt":0.3167551756276385,"score_spread":0.3016404662060379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391043561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027299296,0.0002470153,0.97100925,0.0002657399,0.000038121118,0.000020756137,0.000026635731,0.000066407796,0.001026752],"genre_scores_gemma":[0.67762834,0.00067657605,0.31888306,0.00013982349,0.000079446254,0.0001021213,0.00011078535,0.000047447582,0.0023323982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997285,0.000111282425,0.000012390353,0.000030645835,0.00009901601,0.0000181416],"domain_scores_gemma":[0.99851483,0.0010389981,0.00015108369,0.00009939163,0.00015733848,0.00003840354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082151307,0.0004558585,0.00044874934,0.00033561207,0.00027084586,0.00042434988,0.00051512104,0.0010142346,0.00086434383],"category_scores_gemma":[0.0030689219,0.00019125416,0.0003682177,0.00029687048,0.0009753575,0.0006811088,0.00088725484,0.00096409285,0.00017508122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100374156,0.000050067923,0.0007901867,0.00012644223,0.000033630044,0.0001543385,0.00012263935,0.9019124,0.014466704,0.04694737,0.0010874314,0.03420846],"study_design_scores_gemma":[0.0000036494248,0.0000064192614,0.00003296429,0.0000031545271,9.666694e-7,0.00000851287,0.0000052325972,0.99732363,0.00065384584,0.0017753823,0.00018373682,0.0000024673468],"about_ca_topic_score_codex":0.0027751813,"about_ca_topic_score_gemma":0.0018754231,"teacher_disagreement_score":0.0027751813,"about_ca_system_score_codex":0.00034729333,"about_ca_system_score_gemma":0.00050364924,"threshold_uncertainty_score":0.005518079},"labels":[],"label_agreement":null},{"id":"W4391131725","doi":"10.1145/3594234","title":"Optimistic Rates: A Unifying Theory for Interpolation Learning and Regularization in Linear Regression","year":2024,"lang":"en","type":"article","venue":"ACM / IMS Journal of Data Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regularization (linguistics); Linear regression; Mathematics; Interpolation (computer graphics); Econometrics; Applied mathematics; Linear interpolation; Bayesian multivariate linear regression; Regression; Proper linear model; Statistics; Linear model; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.0531062436633936,"score_gpt":0.3582758260044411,"score_spread":0.30516958234104746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391131725","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051800273,0.0012581327,0.9876061,0.0010215333,0.00011741921,0.000051441366,0.000081882594,0.00015610071,0.004527268],"genre_scores_gemma":[0.5662119,0.0075639836,0.4017983,0.0030796984,0.0022353882,0.0010666936,0.00055249844,0.0012613144,0.01623026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887251,0.005737596,0.0004366834,0.0013309761,0.0030001905,0.00076943357],"domain_scores_gemma":[0.93654823,0.04790811,0.00415056,0.006307133,0.003672892,0.0014131538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.027024845,0.0031353782,0.0025926544,0.0030353002,0.0015548274,0.0041731307,0.005226982,0.003304289,0.0053798733],"category_scores_gemma":[0.09292123,0.0014417692,0.0027360325,0.0019248064,0.0066009285,0.009626208,0.009719738,0.011016246,0.0013814212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965316,0.000045938104,0.0011949618,0.00024333471,0.00007606363,0.00014276766,0.00030082243,0.0858565,0.001260253,0.8897017,0.0022088524,0.018829055],"study_design_scores_gemma":[0.000027559581,0.00016367277,0.00034663742,0.0002045939,0.000041553485,0.00018826821,0.00006540381,0.41587627,0.0013810787,0.577021,0.004622264,0.00006169802],"about_ca_topic_score_codex":0.0013123975,"about_ca_topic_score_gemma":0.0008099982,"teacher_disagreement_score":0.027024845,"about_ca_system_score_codex":0.0026972152,"about_ca_system_score_gemma":0.0020914497,"threshold_uncertainty_score":0.14292276},"labels":[],"label_agreement":null},{"id":"W4391532996","doi":"10.1080/10556788.2023.2296443","title":"Near-optimal tensor methods for minimizing the gradient norm of convex functions and accelerated primal–dual tensor methods","year":2024,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Tensor (intrinsic definition); Dual (grammatical number); Norm (philosophy); Regular polygon; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Geometry; Political science","score_opus":0.045805575752337714,"score_gpt":0.37152345829503497,"score_spread":0.32571788254269723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391532996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016176164,0.00037115763,0.9959202,0.00020975908,0.00008049138,0.000024865845,0.000027034539,0.00014353807,0.0016052377],"genre_scores_gemma":[0.082796164,0.0010444482,0.908316,0.00025553376,0.00031551562,0.0002688406,0.00020862822,0.00050828897,0.006286559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984464,0.0006435694,0.000073211915,0.0001896808,0.0005203922,0.00012678582],"domain_scores_gemma":[0.99815136,0.0007052183,0.00020104376,0.00034456566,0.00044757695,0.00015014062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024362877,0.0022823568,0.0015084335,0.0012849359,0.00058051787,0.0018500938,0.002029341,0.0022189643,0.004355402],"category_scores_gemma":[0.0072005372,0.0008724141,0.0016090063,0.001081892,0.0020453997,0.0033169312,0.0028288215,0.004413743,0.0018727419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002068203,0.00010437309,0.00044455967,0.00043211385,0.000094774114,0.00016240998,0.0002261401,0.51431674,0.009858511,0.37794656,0.0066289096,0.08957809],"study_design_scores_gemma":[0.000012725822,0.000031507283,0.000042599768,0.000019457077,0.000007650008,0.00004251981,0.000010779931,0.9656092,0.0012230172,0.029858913,0.0031277663,0.000013802121],"about_ca_topic_score_codex":0.002244102,"about_ca_topic_score_gemma":0.0020561276,"teacher_disagreement_score":0.004355402,"about_ca_system_score_codex":0.0014172831,"about_ca_system_score_gemma":0.0016485018,"threshold_uncertainty_score":0.014570296},"labels":[],"label_agreement":null},{"id":"W4391912729","doi":"10.48550/arxiv.2402.09714","title":"An Accelerated Distributed Stochastic Gradient Method with Momentum","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Momentum (technical analysis); Statistical physics; Computer science; Applied mathematics; Physics; Mathematics; Economics; Financial economics","score_opus":0.06338044126622551,"score_gpt":0.209716975021062,"score_spread":0.14633653375483652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391912729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032320176,0.0000905247,0.9950637,0.00013239688,0.000050927232,0.000024415865,0.000015561982,0.00016508263,0.0012253359],"genre_scores_gemma":[0.287053,0.00036302113,0.70375985,0.00029203543,0.00018868968,0.00032433527,0.00015762304,0.00021325663,0.0076481146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956983,0.0001535858,0.000012947333,0.00006012201,0.00016376932,0.000039725302],"domain_scores_gemma":[0.9995229,0.00022497929,0.00004439494,0.000051782998,0.00011546764,0.000040407485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008585852,0.0008125687,0.0008514411,0.00034635945,0.000371241,0.00066389947,0.0011659879,0.0010862832,0.0021853538],"category_scores_gemma":[0.0020379839,0.0004001626,0.0004895376,0.0004536681,0.00077189575,0.00097642525,0.001120411,0.0012299353,0.00068486156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012806921,0.00006164697,0.0004997585,0.000093827184,0.00004224886,0.000116365954,0.00007242504,0.87631816,0.005460291,0.049547188,0.0030586869,0.06460136],"study_design_scores_gemma":[0.0000119374845,0.000016261429,0.00002219922,0.0000025553059,0.0000016461157,0.000011001922,0.000002049658,0.99637294,0.00027485244,0.002500755,0.0007809481,0.0000029672271],"about_ca_topic_score_codex":0.002824087,"about_ca_topic_score_gemma":0.0025408657,"teacher_disagreement_score":0.002824087,"about_ca_system_score_codex":0.00054698164,"about_ca_system_score_gemma":0.0014890204,"threshold_uncertainty_score":0.0073106885},"labels":[],"label_agreement":null},{"id":"W4391956260","doi":"10.1007/s10957-024-02383-9","title":"A Mirror Inertial Forward–Reflected–Backward Splitting: Convergence Analysis Beyond Convexity and Lipschitz Smoothness","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Smoothness; Inertial frame of reference; Mathematics; Lipschitz continuity; Theory of computation; Applied mathematics; Rate of convergence; Function (biology); Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Key (lock); Algorithm; Classical mechanics","score_opus":0.00657811400616399,"score_gpt":0.2477912233952005,"score_spread":0.2412131093890365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391956260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010852757,0.00021765429,0.98124987,0.0004204819,0.00014842903,0.000045766756,0.00004008346,0.0000788006,0.0069461055],"genre_scores_gemma":[0.4027621,0.00080840976,0.5628521,0.00076273654,0.0004177616,0.0002458789,0.00026219568,0.00056706014,0.03132175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947375,0.00017692141,0.000029566987,0.000105821266,0.00016362431,0.00005038213],"domain_scores_gemma":[0.9982809,0.0006767408,0.00011514668,0.00033542782,0.0004014754,0.00019024841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027754796,0.0013531845,0.00085623714,0.0007803934,0.0005769504,0.0013329606,0.0013868753,0.0017417156,0.0046197306],"category_scores_gemma":[0.0067383293,0.00048476356,0.0009809872,0.00046040484,0.0021383637,0.0032084147,0.0043801693,0.0029440834,0.0010576069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046086343,0.00016826404,0.00093536696,0.00027224133,0.00010565656,0.00031865196,0.00038573277,0.13043685,0.040235236,0.73075354,0.0070627965,0.0888647],"study_design_scores_gemma":[0.000023340357,0.0001380461,0.00019079926,0.0000365343,0.000024281451,0.00019154165,0.000051358264,0.8489962,0.0049632946,0.1417256,0.0036377297,0.00002121472],"about_ca_topic_score_codex":0.0009273699,"about_ca_topic_score_gemma":0.0007031109,"teacher_disagreement_score":0.0046197306,"about_ca_system_score_codex":0.0007197597,"about_ca_system_score_gemma":0.0009550947,"threshold_uncertainty_score":0.015454471},"labels":[],"label_agreement":null},{"id":"W4392082757","doi":"10.3934/ipi.2024005","title":"A preconditioned alternating minimization framework for nonconvex and half quadratic regularization","year":2024,"lang":"en","type":"article","venue":"Inverse Problems and Imaging","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Regularization (linguistics); Minification; Quadratic equation; Computer science; Mathematical optimization; Applied mathematics; Mathematics; Artificial intelligence; Geometry","score_opus":0.014969236503238672,"score_gpt":0.2381613825323262,"score_spread":0.22319214602908752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392082757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005458973,0.000106868894,0.9983676,0.000055935867,0.000020281283,0.000009057386,0.000012823944,0.000039087532,0.0008425389],"genre_scores_gemma":[0.0836616,0.00087826146,0.90871215,0.00019507534,0.00017727457,0.00024439895,0.00020598403,0.00019038765,0.005734824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944264,0.00024258986,0.000027164022,0.00008182658,0.00017230026,0.0000334657],"domain_scores_gemma":[0.9996105,0.00015855949,0.000040228682,0.000060577408,0.000094722185,0.000035359877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010594457,0.0011772172,0.0007224734,0.0005740405,0.00040314917,0.00066753454,0.0010091561,0.0010368905,0.0032046959],"category_scores_gemma":[0.0015626082,0.0003730013,0.00096591975,0.00063683605,0.0013169233,0.0012077942,0.0015659895,0.0022328503,0.0010104496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006562456,0.000055052333,0.00034857617,0.0003673083,0.000074404656,0.00019415455,0.00021544099,0.42731223,0.016176099,0.47030064,0.006405161,0.0784854],"study_design_scores_gemma":[0.000006507411,0.000030046895,0.00004125322,0.000012189557,0.0000072120724,0.0000604548,0.000010021932,0.9468821,0.001345262,0.046778347,0.0048152716,0.000011303372],"about_ca_topic_score_codex":0.0013476016,"about_ca_topic_score_gemma":0.0015758766,"teacher_disagreement_score":0.0032046959,"about_ca_system_score_codex":0.00046765315,"about_ca_system_score_gemma":0.00094287284,"threshold_uncertainty_score":0.010720789},"labels":[],"label_agreement":null},{"id":"W4392903556","doi":"10.1109/icassp48485.2024.10446361","title":"Learned ISTA with Error-Based Thresholding for Adaptive Sparse Coding","year":2024,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Thresholding; Shrinkage; Convergence (economics); Coding (social sciences); Computer science; Algorithm; Function (biology); Error detection and correction; Artificial intelligence; Layer (electronics); Pattern recognition (psychology); Mathematics; Machine learning; Statistics; Materials science","score_opus":0.06024147374047302,"score_gpt":0.27671259234260964,"score_spread":0.21647111860213664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392903556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003602571,0.00008398845,0.9951787,0.00011013857,0.000020848935,0.000012991556,0.000025873038,0.0001083256,0.000856607],"genre_scores_gemma":[0.52953464,0.00051701907,0.46383044,0.000357114,0.00017210653,0.00023930841,0.00024446112,0.00020361177,0.0049012904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905664,0.00029637615,0.00005631474,0.00015461238,0.0003511715,0.00008480305],"domain_scores_gemma":[0.9973477,0.0014747364,0.00029604332,0.00042143388,0.00036675725,0.00009327018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020698425,0.00086412847,0.00081942754,0.000621633,0.0003238376,0.0010693963,0.001587423,0.0013353792,0.0017933847],"category_scores_gemma":[0.0095149595,0.00039174178,0.000616062,0.0008105337,0.0015357769,0.0018527067,0.0021952842,0.0022240947,0.00060327654],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016065723,0.000056784404,0.0008005071,0.00019186444,0.000058552803,0.00010773074,0.00017451688,0.7203294,0.016207062,0.16316976,0.0018456237,0.0968976],"study_design_scores_gemma":[0.000004124657,0.000020097345,0.00005508713,0.000009752133,0.0000050418025,0.000035941488,0.000005758831,0.98028564,0.0016580381,0.017544996,0.0003679471,0.000007490202],"about_ca_topic_score_codex":0.001016613,"about_ca_topic_score_gemma":0.0011393918,"teacher_disagreement_score":0.0020698425,"about_ca_system_score_codex":0.0005500158,"about_ca_system_score_gemma":0.0009343784,"threshold_uncertainty_score":0.010946512},"labels":[],"label_agreement":null},{"id":"W4392904006","doi":"10.1109/icassp48485.2024.10446747","title":"Vector Approximate message Passing with Arbitrary I.I.D. Noise Priors","year":2024,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Prior probability; Noise (video); Gaussian noise; Message passing; Computer science; Algorithm; Independent and identically distributed random variables; Range (aeronautics); Gaussian; Noise measurement; Mathematics; Random variable; Artificial intelligence; Noise reduction; Statistics; Physics","score_opus":0.008186946227050183,"score_gpt":0.20534495530533145,"score_spread":0.19715800907828127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392904006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009882846,0.000066814144,0.99841833,0.00006504493,0.0000200116,0.000012442583,0.000020634041,0.00013225377,0.0002761183],"genre_scores_gemma":[0.20071244,0.0005751425,0.79041624,0.00036832257,0.00018046655,0.00027759103,0.00044718967,0.00013547072,0.00688712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977533,0.0008200936,0.00015467391,0.00045069095,0.0006505088,0.0001708297],"domain_scores_gemma":[0.99577785,0.0023103568,0.00054386776,0.00070976024,0.0005534549,0.00010474686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026449917,0.0015545957,0.0014127829,0.0007841113,0.00052990305,0.0017125403,0.0021307769,0.0017265881,0.0022083288],"category_scores_gemma":[0.012278738,0.0006241832,0.0007965245,0.0015265995,0.0015012209,0.0027213476,0.002111853,0.0022746518,0.0012105261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002999471,0.000058448175,0.0005977632,0.0002475889,0.0000820034,0.0001096128,0.00020041778,0.6785937,0.0054446165,0.12122092,0.0029285299,0.19021653],"study_design_scores_gemma":[0.000014220711,0.00005053715,0.00007777944,0.000014251992,0.0000114894065,0.00006516279,0.000014876184,0.9737632,0.0041116537,0.019914052,0.0019476005,0.000015111731],"about_ca_topic_score_codex":0.0019824235,"about_ca_topic_score_gemma":0.0022160143,"teacher_disagreement_score":0.0026449917,"about_ca_system_score_codex":0.00096162094,"about_ca_system_score_gemma":0.0016375085,"threshold_uncertainty_score":0.013988197},"labels":[],"label_agreement":null},{"id":"W4392911125","doi":"10.1109/icassp48485.2024.10447312","title":"Fast Test Error Rates for Gradient-Based Algorithms on Separable Data","year":2024,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Algorithm; Separable space; Mathematics","score_opus":0.06229428602680143,"score_gpt":0.3325940311993003,"score_spread":0.2702997451724989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392911125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032428212,0.0015005061,0.9619946,0.00081850856,0.000099943005,0.00011993149,0.00011248077,0.00090263475,0.0020232005],"genre_scores_gemma":[0.49390242,0.0010812122,0.49677575,0.00060315226,0.00016502842,0.00053392834,0.0008407148,0.000630531,0.005467342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99543816,0.0019191091,0.000265821,0.0006136954,0.0014821647,0.00028116483],"domain_scores_gemma":[0.948497,0.041308254,0.0022291834,0.0039673396,0.0031172244,0.00088103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012212014,0.0019550035,0.0017115559,0.0014249702,0.00064580067,0.0014127748,0.00253604,0.0025168639,0.0023640944],"category_scores_gemma":[0.0830419,0.00060261623,0.0008429953,0.0009831238,0.0038009738,0.0035314672,0.0037877688,0.0053058495,0.0008678971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009990262,0.00019391892,0.0044086273,0.00058200344,0.0001444687,0.00024216507,0.000432586,0.69156796,0.0072878413,0.10664089,0.0033121181,0.18418841],"study_design_scores_gemma":[0.000021248909,0.0000985599,0.00045777977,0.00005042846,0.000009743353,0.00008288353,0.00002722197,0.9744847,0.0025617015,0.021598818,0.000592595,0.00001430991],"about_ca_topic_score_codex":0.0037098054,"about_ca_topic_score_gemma":0.0032819174,"teacher_disagreement_score":0.012212014,"about_ca_system_score_codex":0.001705975,"about_ca_system_score_gemma":0.0025377509,"threshold_uncertainty_score":0.06458402},"labels":[],"label_agreement":null},{"id":"W4393078796","doi":"10.1109/tpami.2024.3380568","title":"Quadratic Matrix Factorization With Applications to Manifold Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MNIST database; Manifold (fluid mechanics); Nonlinear dimensionality reduction; Matrix decomposition; Artificial intelligence; Computer science; Factorization; Manifold alignment; Pattern recognition (psychology); Quadratic equation; Regularization (linguistics); Principal component analysis; Algorithm; Mathematics; Deep learning; Dimensionality reduction; Eigenvalues and eigenvectors","score_opus":0.014634900600833656,"score_gpt":0.2666958155919614,"score_spread":0.25206091499112776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393078796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086753425,0.001119868,0.99690944,0.0002735701,0.000049625258,0.000026116033,0.000050063245,0.00013675017,0.0005670743],"genre_scores_gemma":[0.109875,0.0058006225,0.87906134,0.00032705546,0.0007446091,0.00037291023,0.0006928388,0.00017437694,0.0029511882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983114,0.0006465698,0.00008924276,0.00032055945,0.000556413,0.000075829405],"domain_scores_gemma":[0.9964328,0.0021250527,0.00028682823,0.00036628838,0.00068791496,0.000101068305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026449703,0.001875755,0.0016880713,0.0017011403,0.0008304066,0.0011447241,0.0012951092,0.0015498564,0.0031792964],"category_scores_gemma":[0.009535195,0.00065525534,0.0011139426,0.00355958,0.0016138778,0.0017287073,0.0021915315,0.0027423722,0.0012218545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010011077,0.00009077695,0.0011371,0.00077133224,0.00020525436,0.0002266354,0.00030137567,0.4357334,0.0055170255,0.18539931,0.014014158,0.35650352],"study_design_scores_gemma":[0.000013940658,0.000050338105,0.00024682004,0.000031521697,0.000013419789,0.0000789463,0.000027865673,0.8803966,0.00091808866,0.111563995,0.006634496,0.000023930936],"about_ca_topic_score_codex":0.0039439267,"about_ca_topic_score_gemma":0.003935531,"teacher_disagreement_score":0.0039439267,"about_ca_system_score_codex":0.00074067496,"about_ca_system_score_gemma":0.0013070008,"threshold_uncertainty_score":0.013988137},"labels":[],"label_agreement":null},{"id":"W4394838699","doi":"10.48550/arxiv.2404.08073","title":"Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious relationship; Bregman divergence; Stationary point; Euclidean geometry; Divergence (linguistics); Coordinate descent; Regular polygon; Point (geometry); Mathematics; Descent (aeronautics); Mathematical optimization; Metric (unit); Algorithm; Type (biology); Computer science; Applied mathematics; Mathematical analysis; Statistics; Physics; Geometry","score_opus":0.0746037854122669,"score_gpt":0.20539200906703312,"score_spread":0.13078822365476622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394838699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024937607,0.00044827932,0.96573037,0.0015219991,0.00009224223,0.00006201254,0.00012888608,0.0002017759,0.0068768193],"genre_scores_gemma":[0.6806518,0.0014186208,0.30189314,0.0012241015,0.00044529443,0.00053724746,0.000676318,0.00069472095,0.012458757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627554,0.0015944936,0.00018235104,0.0006286124,0.0010016757,0.00031745917],"domain_scores_gemma":[0.9738893,0.019460361,0.001674379,0.002443215,0.0017145615,0.0008182403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006679534,0.001593834,0.001906386,0.0018442519,0.0018512637,0.0026365058,0.0031969673,0.0029315588,0.0042079384],"category_scores_gemma":[0.04367813,0.0009910157,0.0018106806,0.0013631482,0.006684006,0.006788765,0.005279676,0.007409636,0.0010553865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022988499,0.00010313421,0.00183063,0.00035809295,0.00011014067,0.00028594633,0.0004968429,0.28412092,0.002690573,0.6853076,0.0052150264,0.019251203],"study_design_scores_gemma":[0.00002698162,0.00008746547,0.00030704733,0.000055496108,0.000012602351,0.00007669703,0.00005751178,0.60274947,0.0010241898,0.39394975,0.0016264046,0.000026397314],"about_ca_topic_score_codex":0.0011300682,"about_ca_topic_score_gemma":0.001138783,"teacher_disagreement_score":0.006679534,"about_ca_system_score_codex":0.001685838,"about_ca_system_score_gemma":0.001988801,"threshold_uncertainty_score":0.03532517},"labels":[],"label_agreement":null},{"id":"W4396934691","doi":"10.3150/23-bej1675","title":"Low-rank matrix recovery under heavy-tailed errors","year":2024,"lang":"en","type":"article","venue":"Bernoulli","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Rank (graph theory); Statistics; Matrix (chemical analysis); Econometrics; Combinatorics","score_opus":0.012952568046425885,"score_gpt":0.2513047869075873,"score_spread":0.2383522188611614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396934691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004556329,0.00010639526,0.99474984,0.00011577414,0.000014498049,0.000012957034,0.000031229592,0.00010411017,0.00030890157],"genre_scores_gemma":[0.40494058,0.0010676571,0.5879277,0.00040783614,0.00037281442,0.00016730872,0.0006078746,0.00023587079,0.0042724214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755895,0.0008731693,0.000111464804,0.00052858394,0.00076873536,0.00015913117],"domain_scores_gemma":[0.99037814,0.006056456,0.0013729197,0.001227242,0.00080139603,0.0001638329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035892036,0.0015526481,0.0017123064,0.0008794839,0.0004472082,0.0011757324,0.0015754228,0.0014914598,0.000926286],"category_scores_gemma":[0.020556897,0.0006756551,0.0008482574,0.001171337,0.002005867,0.002406375,0.0018628654,0.0028040346,0.000618742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020285786,0.0000637562,0.00096314115,0.00023100997,0.00011918929,0.00021192762,0.00015565107,0.851767,0.01009153,0.052011807,0.0020052195,0.08217686],"study_design_scores_gemma":[0.0000095311125,0.000028766155,0.00014715656,0.000008919204,0.000006471049,0.000041552565,0.000011727069,0.98539287,0.002018339,0.011839957,0.00048165314,0.0000130933995],"about_ca_topic_score_codex":0.0022870991,"about_ca_topic_score_gemma":0.0020194184,"teacher_disagreement_score":0.0035892036,"about_ca_system_score_codex":0.0005539474,"about_ca_system_score_gemma":0.0012515063,"threshold_uncertainty_score":0.018981695},"labels":[],"label_agreement":null},{"id":"W4396986625","doi":"10.48550/arxiv.2405.08938","title":"Pointwise Lipschitz Continuous Graph Algorithms","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pointwise; Lipschitz continuity; Algorithm; Graph; Computer science; Mathematics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.04261213156111543,"score_gpt":0.17256006028671586,"score_spread":0.12994792872560043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396986625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00778267,0.00032322385,0.98437655,0.0006347825,0.00003734098,0.000077702774,0.00017082137,0.0006122983,0.0059845885],"genre_scores_gemma":[0.31804106,0.00115702,0.66020375,0.00082493946,0.00018979867,0.00055693794,0.0010423389,0.0007610639,0.017223107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816895,0.000550618,0.00008356571,0.00062297797,0.00039067515,0.00018327677],"domain_scores_gemma":[0.9939275,0.004385187,0.00037582646,0.0006093509,0.0004835898,0.00021858489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021674,0.0016719851,0.0016580336,0.0012184381,0.0007292642,0.0027046106,0.0022903201,0.0027907437,0.007661588],"category_scores_gemma":[0.01309829,0.00078008237,0.0014410877,0.0012641401,0.0019187588,0.0037178597,0.0026414972,0.0051479223,0.0021568544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028954053,0.00013405255,0.00069374277,0.00039361758,0.00006862554,0.00012020381,0.00022931337,0.5763457,0.004773364,0.2895648,0.010635533,0.116751544],"study_design_scores_gemma":[0.00002843252,0.000050025945,0.00007719663,0.000030196086,0.000010424866,0.000036330184,0.000023316066,0.85838413,0.0014224995,0.13708241,0.0028438708,0.000011181613],"about_ca_topic_score_codex":0.0019743764,"about_ca_topic_score_gemma":0.001577308,"teacher_disagreement_score":0.007661588,"about_ca_system_score_codex":0.0023725575,"about_ca_system_score_gemma":0.0017130508,"threshold_uncertainty_score":0.025630534},"labels":[],"label_agreement":null},{"id":"W4398151476","doi":"10.1109/lcomm.2024.3403501","title":"Dynamic Compressed Sensing Approach for Unsourced Random Access","year":2024,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Compressed sensing; Algorithm","score_opus":0.04118370713950655,"score_gpt":0.3001159809567612,"score_spread":0.25893227381725464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398151476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046004704,0.00043138466,0.99218154,0.0002762298,0.00005728718,0.000032819265,0.00004612646,0.00010940485,0.0022647302],"genre_scores_gemma":[0.6591395,0.0019615164,0.32972872,0.0005388774,0.00033073846,0.00026653707,0.00025537994,0.00007674949,0.007702024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00023419481,0.000024409175,0.00010817854,0.00033381797,0.0000699898],"domain_scores_gemma":[0.99871755,0.0008006813,0.00010154669,0.000113069604,0.00023220674,0.000035039124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778021,0.00067504693,0.00046547878,0.0004994386,0.0003241548,0.0007211943,0.00097232114,0.0006484576,0.0024761446],"category_scores_gemma":[0.0029058824,0.00022655012,0.00038346046,0.0008001614,0.00076357345,0.0012827152,0.0008771201,0.0012673693,0.00039069695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023456464,0.00007672335,0.0006044026,0.0002959296,0.00007411573,0.00028306796,0.00022403777,0.5535967,0.017854536,0.28871703,0.0045113782,0.13352762],"study_design_scores_gemma":[0.000006339434,0.00004111228,0.00006317571,0.00001021662,0.0000058878177,0.00007869156,0.000013705053,0.9844893,0.0016819622,0.012098192,0.0015015039,0.00000981034],"about_ca_topic_score_codex":0.002092207,"about_ca_topic_score_gemma":0.0019714378,"teacher_disagreement_score":0.0024761446,"about_ca_system_score_codex":0.00076224445,"about_ca_system_score_gemma":0.001009573,"threshold_uncertainty_score":0.0082835555},"labels":[],"label_agreement":null},{"id":"W4400128579","doi":"10.1007/978-981-97-0109-4_3","title":"Weighted Tensor Least Angle Regression for Solving Sparse Weighted Multilinear Least Squares Problems","year":2024,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multilinear map; Tensor (intrinsic definition); Mathematics; Least-squares function approximation; Total least squares; Regression; Applied mathematics; Statistics; Pure mathematics","score_opus":0.030671835848349465,"score_gpt":0.23740334220040463,"score_spread":0.20673150635205517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400128579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039789302,0.0009923453,0.99268955,0.00010358873,0.0001787843,0.0000124284015,0.00005950353,0.00022102258,0.0053448845],"genre_scores_gemma":[0.019228103,0.004414888,0.9369595,0.00023735552,0.0004052015,0.00012785944,0.00045955912,0.00046946944,0.037698198],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996885,0.000080684375,0.000013938477,0.00004667881,0.00015852076,0.000011731599],"domain_scores_gemma":[0.9997347,0.00012959556,0.000018636814,0.000041757925,0.000067777924,0.000007519663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044648562,0.001207838,0.0005832182,0.0005004875,0.00023663345,0.0007131854,0.0008156594,0.0007181858,0.008975922],"category_scores_gemma":[0.0013411152,0.00032536045,0.00046950165,0.0015082023,0.00052307645,0.0011436113,0.00077704457,0.0018319861,0.0049466006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041159383,0.000056884564,0.00016358845,0.0005639564,0.00006514276,0.000099769466,0.000088196764,0.137215,0.016851308,0.19307236,0.051477715,0.60030484],"study_design_scores_gemma":[0.0000088255365,0.00005719458,0.00019255148,0.000082598606,0.000025890611,0.00018991566,0.00003250853,0.7916162,0.0078014294,0.0897383,0.110222585,0.000032066273],"about_ca_topic_score_codex":0.0012599617,"about_ca_topic_score_gemma":0.002859169,"teacher_disagreement_score":0.008975922,"about_ca_system_score_codex":0.00028649523,"about_ca_system_score_gemma":0.00037190254,"threshold_uncertainty_score":0.03002745},"labels":[],"label_agreement":null},{"id":"W4401180739","doi":"10.18280/mmep.110714","title":"Enhanced Cyclostationary Detector Complexity Based on Haar Wavelet and Signed Correlator","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cyclostationary process; Haar wavelet; Wavelet; Detector; Haar; Computer science; Speech recognition; Wavelet transform; Artificial intelligence; Algorithm; Pattern recognition (psychology); Discrete wavelet transform; Telecommunications","score_opus":0.025148957775610853,"score_gpt":0.2105571889762206,"score_spread":0.18540823120060976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401180739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020968886,0.0003484275,0.97676575,0.00010425138,0.00008331294,0.000028880955,0.00003945797,0.00019318778,0.0014678286],"genre_scores_gemma":[0.5127186,0.0009801796,0.48189342,0.00014660011,0.00013445357,0.00010957821,0.00021305957,0.00003572978,0.0037682678],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948895,0.00009111338,0.000026893435,0.00007201347,0.0002913994,0.00002952255],"domain_scores_gemma":[0.9993622,0.00026828612,0.00006128443,0.00006459889,0.00022274858,0.000020914908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004598145,0.0003917386,0.00046406282,0.0005933393,0.00020267423,0.0006082916,0.00045299873,0.00045959276,0.0011086689],"category_scores_gemma":[0.0017764424,0.00018610418,0.00038022024,0.0007038909,0.0002932031,0.0008307402,0.0003861199,0.00058971724,0.0003017566],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058481726,0.00022987463,0.0033475393,0.00030162252,0.00014484384,0.0004196147,0.00014050922,0.19633524,0.1531031,0.05322708,0.0039101727,0.5882555],"study_design_scores_gemma":[0.00001583386,0.00013180454,0.00060057826,0.000010003171,0.000018596274,0.00028974374,0.000011771856,0.9731774,0.021738645,0.0019063026,0.0020795206,0.000019777044],"about_ca_topic_score_codex":0.0009835557,"about_ca_topic_score_gemma":0.0011774747,"teacher_disagreement_score":0.0011086689,"about_ca_system_score_codex":0.00037196936,"about_ca_system_score_gemma":0.00066590635,"threshold_uncertainty_score":0.003708899},"labels":[],"label_agreement":null},{"id":"W4401396978","doi":"10.1145/3686794","title":"Fast Algorithms for <i> ℓ <sub>p</sub> </i> -Regression","year":2024,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Georgia Institute of Technology","keywords":"Star (game theory); Combinatorics; Algorithm; Inverse; Omega; Physics; Mathematics; Mathematical analysis; Geometry; Quantum mechanics","score_opus":0.021637927470085843,"score_gpt":0.26180285410958687,"score_spread":0.24016492663950104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401396978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017136233,0.0005690796,0.99060655,0.00060593314,0.00019775439,0.000060023176,0.00020917067,0.0023908883,0.0036470117],"genre_scores_gemma":[0.08049955,0.0011493682,0.89402044,0.0008262617,0.000615621,0.00050767907,0.002365429,0.0020408472,0.01797487],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809355,0.0004088498,0.00010282404,0.0005224062,0.0005935902,0.00027879525],"domain_scores_gemma":[0.99678016,0.0017576318,0.00025288312,0.000524503,0.0005414383,0.00014330925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021622088,0.0024718023,0.0017398413,0.0011735986,0.0009517455,0.0027203797,0.0033596617,0.0023886429,0.018463999],"category_scores_gemma":[0.011234327,0.00088943023,0.0016585932,0.0019754234,0.0014641358,0.003294105,0.0035068963,0.00512942,0.015271558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003756258,0.00021760014,0.0014180038,0.0005109292,0.00013740921,0.00022141398,0.00014659001,0.19035408,0.0047103604,0.1142273,0.082692266,0.6049885],"study_design_scores_gemma":[0.000045553305,0.000044109398,0.0002315458,0.000046461333,0.000017148825,0.0001027202,0.000043884873,0.921212,0.0022419484,0.064576715,0.0114168115,0.000021149292],"about_ca_topic_score_codex":0.0050086416,"about_ca_topic_score_gemma":0.008237753,"teacher_disagreement_score":0.018463999,"about_ca_system_score_codex":0.0016657036,"about_ca_system_score_gemma":0.0027760882,"threshold_uncertainty_score":0.061768234},"labels":[],"label_agreement":null},{"id":"W4401477174","doi":"10.1016/j.jspi.2024.106221","title":"A graph decomposition-based approach for the graph-fused lasso","year":2024,"lang":"en","type":"article","venue":"Journal of Statistical Planning and Inference","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Lasso (programming language); Rate of convergence; Graph; Algorithm; Mathematical optimization; Convergence (economics); Penalty method; Applied mathematics; Computer science; Key (lock); Combinatorics","score_opus":0.02833459730021566,"score_gpt":0.310985428997932,"score_spread":0.2826508316977164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401477174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051078614,0.000079069265,0.99846613,0.000105953986,0.000035029603,0.000016741637,0.00006502615,0.00016077574,0.00056058983],"genre_scores_gemma":[0.06782657,0.0005257819,0.9243823,0.00042225712,0.000276498,0.00026565813,0.0010288432,0.000519044,0.004752985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987612,0.00049475813,0.0000513973,0.00024769508,0.0003470173,0.00009789193],"domain_scores_gemma":[0.99795747,0.0010868005,0.00015249877,0.00031120313,0.00037016816,0.00012175726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013658486,0.0017543999,0.0017716029,0.0015334008,0.00073139917,0.0012820611,0.0023421615,0.0020134787,0.0067245625],"category_scores_gemma":[0.005161834,0.0008265353,0.0015985128,0.002092882,0.0011948972,0.0020555055,0.0027210359,0.003719029,0.0026881236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019899332,0.00017949368,0.00047617234,0.0003062138,0.00020771891,0.00019567352,0.0001471068,0.60045683,0.010627608,0.12735334,0.017968364,0.24188244],"study_design_scores_gemma":[0.000007666593,0.00002197057,0.000057296304,0.000011436247,0.000013313834,0.000033093333,0.000012011012,0.9694797,0.00056525785,0.027947566,0.0018393461,0.000011297698],"about_ca_topic_score_codex":0.0038325926,"about_ca_topic_score_gemma":0.0064346353,"teacher_disagreement_score":0.0067245625,"about_ca_system_score_codex":0.00065207685,"about_ca_system_score_gemma":0.0017114335,"threshold_uncertainty_score":0.022495925},"labels":[],"label_agreement":null},{"id":"W4401550494","doi":"10.1137/23m1552140","title":"MGProx: A Nonsmooth Multigrid Proximal Gradient Method with Adaptive Restriction for Strongly Convex Optimization","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Division of Mathematical Sciences; University of Waterloo; Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Multigrid method; Regular polygon; Mathematical optimization; Convex optimization; Proximal Gradient Methods; Applied mathematics; Mathematical analysis; Geometry; Partial differential equation","score_opus":0.016791898185659324,"score_gpt":0.2575591347630491,"score_spread":0.24076723657738977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401550494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033703505,0.00013224468,0.9954443,0.00012493216,0.000031102525,0.000029558867,0.000014046977,0.00015713552,0.0006962694],"genre_scores_gemma":[0.16946368,0.00035382767,0.8256542,0.0002313741,0.00008520304,0.000248648,0.00011135445,0.0002243115,0.0036274083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959785,0.00015564277,0.000014219095,0.000052034957,0.00015049923,0.000029768838],"domain_scores_gemma":[0.9994692,0.00028614208,0.000047547655,0.00007129034,0.000081001635,0.000044802553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094943185,0.00070801406,0.00092692964,0.00047137451,0.00034738338,0.0006246265,0.0012144829,0.0011416341,0.0015405532],"category_scores_gemma":[0.0017746531,0.00044963896,0.0006946877,0.0005023733,0.000932432,0.0008883889,0.0017841392,0.0014937951,0.0005643793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011543334,0.00008838579,0.00069809577,0.00024198902,0.00008746718,0.00017630144,0.00011393139,0.84658647,0.010802281,0.040131066,0.003740911,0.0972177],"study_design_scores_gemma":[0.000008456958,0.000023965255,0.000038831546,0.0000049911528,0.000002344937,0.000016322325,0.000003456301,0.99462354,0.00081911474,0.003343284,0.0011118726,0.000003827189],"about_ca_topic_score_codex":0.0017552284,"about_ca_topic_score_gemma":0.0018287218,"teacher_disagreement_score":0.0017552284,"about_ca_system_score_codex":0.00036637156,"about_ca_system_score_gemma":0.0010418235,"threshold_uncertainty_score":0.0051535964},"labels":[],"label_agreement":null},{"id":"W4401641666","doi":"10.3934/fods.2024036","title":"An over complete deep learning method for inverse problems","year":2024,"lang":"en","type":"article","venue":"Foundations of Data Science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Artificial intelligence; Inverse; Calculus (dental); Machine learning; Applied mathematics; Mathematics; Medicine; Geometry; Orthodontics","score_opus":0.0965615545278299,"score_gpt":0.37875734463474137,"score_spread":0.2821957901069115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401641666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014131586,0.00019394072,0.99691725,0.00016599517,0.00002577016,0.000008930721,0.00003029317,0.00007680924,0.0011678718],"genre_scores_gemma":[0.16469455,0.0013239719,0.8183477,0.0006014737,0.00024787153,0.00020716505,0.0003862897,0.00020994477,0.01398097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.00011787621,0.000013687284,0.000055432818,0.00013284205,0.000027132193],"domain_scores_gemma":[0.9995048,0.0002435034,0.00004171302,0.00008252848,0.00009172346,0.000035695102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089458755,0.0007650564,0.00071694877,0.00050553464,0.00031218512,0.0007909419,0.00085605925,0.0010960773,0.0033048026],"category_scores_gemma":[0.0021954316,0.0003815719,0.00061842334,0.00061856187,0.0009818475,0.0013483558,0.0019137493,0.0022787212,0.00083069626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100933976,0.00008144889,0.0004360957,0.00029164882,0.00008930784,0.00012565737,0.00012824663,0.5208248,0.014954638,0.22114968,0.008185546,0.23363197],"study_design_scores_gemma":[0.0000063785224,0.00002327626,0.00004039937,0.000015207083,0.000005682337,0.000037294707,0.000006781929,0.96941996,0.0008523055,0.026131192,0.0034550584,0.00000646872],"about_ca_topic_score_codex":0.0015861237,"about_ca_topic_score_gemma":0.0028278385,"teacher_disagreement_score":0.0033048026,"about_ca_system_score_codex":0.000512069,"about_ca_system_score_gemma":0.0009282394,"threshold_uncertainty_score":0.011055708},"labels":[],"label_agreement":null},{"id":"W4402982000","doi":"10.1109/otcon60325.2024.10688297","title":"Spatial Modulation Techniques for Improved ISAC Throughputs","year":2024,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Modulation (music); Throughput; Computer architecture; Spatial modulation; Computer network; Telecommunications; Physics; MIMO","score_opus":0.014262284833388079,"score_gpt":0.25417796788975044,"score_spread":0.23991568305636238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402982000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15778773,0.0037577313,0.8126038,0.0011921272,0.00034162853,0.00011738163,0.00016238833,0.001320036,0.022717193],"genre_scores_gemma":[0.8890169,0.0010409367,0.1066167,0.00022183292,0.00022008286,0.000050103572,0.00013692128,0.000047829275,0.0026487343],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994167,0.00009301046,0.000030568714,0.000070990594,0.0003081451,0.000080563106],"domain_scores_gemma":[0.99890256,0.00040519584,0.00014735335,0.00015894846,0.00035170218,0.00003425452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004897859,0.00048372758,0.0003102024,0.00074020575,0.00035694073,0.00044748516,0.000469184,0.00039479704,0.0023821024],"category_scores_gemma":[0.0018365372,0.000128295,0.00019349321,0.0009369472,0.0004559105,0.0010377023,0.00051723374,0.00068934675,0.0005199356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064089725,0.00016866258,0.0034275686,0.00038067775,0.000055849057,0.00020156105,0.00026719898,0.0732267,0.37135747,0.04449856,0.0041827024,0.5015922],"study_design_scores_gemma":[0.00009479022,0.0012753844,0.0043340577,0.00009536901,0.00009392089,0.0010143331,0.00019427466,0.6746984,0.2710563,0.01525989,0.03180422,0.000079080724],"about_ca_topic_score_codex":0.00060200744,"about_ca_topic_score_gemma":0.0010236591,"teacher_disagreement_score":0.0023821024,"about_ca_system_score_codex":0.0004295734,"about_ca_system_score_gemma":0.000427156,"threshold_uncertainty_score":0.007968903},"labels":[],"label_agreement":null},{"id":"W4403150381","doi":"10.1007/978-3-031-72111-3_6","title":"Class and Region-Adaptive Constraints for Network Calibration","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Class (philosophy); Calibration; Artificial intelligence; Real-time computing; Mathematics; Statistics","score_opus":0.021275321304055086,"score_gpt":0.22840229397426504,"score_spread":0.20712697267020996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403150381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064682186,0.00037021562,0.99197245,0.00010040118,0.00005955896,0.00001253158,0.000077848024,0.00009542333,0.0066647143],"genre_scores_gemma":[0.1597078,0.003941427,0.7817554,0.00047450524,0.0006817365,0.00030810037,0.00078692206,0.0007311541,0.051612955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.00021825153,0.00002207799,0.00016784015,0.0002578616,0.000040666113],"domain_scores_gemma":[0.9987286,0.000643453,0.00011851464,0.0002490501,0.00021945858,0.000041036226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784625,0.0010222651,0.0008368495,0.00067342503,0.0003631065,0.0013141694,0.0016094913,0.0012496213,0.009513315],"category_scores_gemma":[0.004572601,0.0005515855,0.0005676099,0.0014686798,0.0010969213,0.0022890368,0.0020124824,0.0030973726,0.002387341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009257485,0.00003398228,0.0001594241,0.00019657865,0.000038466304,0.00005988944,0.0000808713,0.18919452,0.008045222,0.52105606,0.019132892,0.26190948],"study_design_scores_gemma":[0.000013765365,0.00003709563,0.0002304622,0.000052114145,0.000014013282,0.00015012044,0.000030279805,0.67546546,0.0040614554,0.2856607,0.03425145,0.00003311496],"about_ca_topic_score_codex":0.0016131089,"about_ca_topic_score_gemma":0.0018403927,"teacher_disagreement_score":0.009513315,"about_ca_system_score_codex":0.0008007865,"about_ca_system_score_gemma":0.00052680087,"threshold_uncertainty_score":0.031825244},"labels":[],"label_agreement":null},{"id":"W4403160022","doi":"10.48550/arxiv.2409.02342","title":"Optimal sampling for least-squares approximation","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Least-squares function approximation; Sampling (signal processing); Mathematics; Applied mathematics; Statistics; Mathematical optimization; Computer science","score_opus":0.10314180258831004,"score_gpt":0.2067531655685957,"score_spread":0.10361136298028564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403160022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009996478,0.0010572,0.99618894,0.00021605747,0.000049673217,0.000015784077,0.000030058362,0.000053916225,0.0013887326],"genre_scores_gemma":[0.22044696,0.009868465,0.76134175,0.00066593336,0.0009551613,0.00039906285,0.0004325458,0.00026915022,0.005620922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99693847,0.0013653256,0.0001443339,0.00046613332,0.00096298475,0.00012278723],"domain_scores_gemma":[0.995624,0.003286303,0.00023292779,0.0003895338,0.00039908726,0.0000681003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003282927,0.0011371451,0.0012513835,0.0010518047,0.00046219278,0.0016175691,0.0011696706,0.0015970767,0.0022370366],"category_scores_gemma":[0.014204486,0.0004912452,0.00083457836,0.0013704012,0.002389128,0.002728791,0.0017227713,0.0029283648,0.0008088498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006023138,0.000031173513,0.00039706033,0.00039912754,0.00006018608,0.00006882721,0.00008726003,0.18718494,0.0026523997,0.74707973,0.003189008,0.058790024],"study_design_scores_gemma":[0.00001208685,0.000043188153,0.00015175215,0.00006891765,0.000014426899,0.00007086602,0.000024325122,0.66047925,0.001598929,0.33096904,0.006547124,0.000020208936],"about_ca_topic_score_codex":0.001383699,"about_ca_topic_score_gemma":0.0008794617,"teacher_disagreement_score":0.003282927,"about_ca_system_score_codex":0.0014130473,"about_ca_system_score_gemma":0.0009842598,"threshold_uncertainty_score":0.017361939},"labels":[],"label_agreement":null},{"id":"W4403569925","doi":"10.48550/arxiv.2410.09615","title":"SLiM: One-shot Quantization and Sparsity with Low-rank Approximation for LLM Weight Compression","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; DeepMind","keywords":"Shot (pellet); Rank (graph theory); One shot; Mathematics; Physics; Econometrics; Combinatorics; Chemistry; Engineering","score_opus":0.08459366769301566,"score_gpt":0.19570243866429093,"score_spread":0.11110877097127528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403569925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008699992,0.00026651588,0.9876357,0.00017088001,0.000064517946,0.00005414041,0.00020943287,0.0019062072,0.0009925673],"genre_scores_gemma":[0.28812188,0.00046593574,0.70341426,0.00046066925,0.00011921181,0.00027480064,0.0019838219,0.0007249484,0.0044345628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994617,0.00008360902,0.000032469987,0.000085286934,0.00028853354,0.000048317943],"domain_scores_gemma":[0.99918324,0.00028074003,0.000079985046,0.00020210902,0.0002021497,0.000051769348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067454943,0.0011366719,0.000890721,0.0009013785,0.00039382966,0.0010113554,0.0015619106,0.0010402327,0.0036326456],"category_scores_gemma":[0.0049536354,0.00039416808,0.00065534306,0.00088604336,0.0006070741,0.0017674698,0.0016425912,0.0018610691,0.0012219545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033147092,0.00018616421,0.001169541,0.0002877168,0.00009897163,0.00023348909,0.00021162105,0.32320958,0.028364604,0.025617125,0.014476422,0.6058133],"study_design_scores_gemma":[0.000008246718,0.000031844407,0.00012138137,0.000011306216,0.0000052531273,0.000038013597,0.000015855916,0.9882327,0.0042490643,0.005978947,0.0012978462,0.00000972192],"about_ca_topic_score_codex":0.005885693,"about_ca_topic_score_gemma":0.010489245,"teacher_disagreement_score":0.005885693,"about_ca_system_score_codex":0.0006892785,"about_ca_system_score_gemma":0.0010686615,"threshold_uncertainty_score":0.012152374},"labels":[],"label_agreement":null},{"id":"W4405269953","doi":"10.1088/1361-6420/ad9d72","title":"A Stochastic iteratively regularized Gauss–Newton method","year":2024,"lang":"en","type":"article","venue":"Inverse Problems","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Engineering and Physical Sciences Research Council; UK Research and Innovation; City University of Hong Kong","keywords":"Mathematics; Gauss; Convergence (economics); Mathematical optimization; Newton's method; Inverse problem; Inverse; Applied mathematics; Algorithm; Nonlinear system","score_opus":0.020650277853291488,"score_gpt":0.2583995538893351,"score_spread":0.23774927603604362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405269953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002566685,0.000066245564,0.99622947,0.00008563791,0.000024413323,0.000019578752,0.000024801064,0.00013140347,0.0008516923],"genre_scores_gemma":[0.18327187,0.00024295437,0.8108446,0.00019771142,0.00012521828,0.00017158342,0.00021818597,0.00015496423,0.0047729774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931514,0.00023791254,0.000028103897,0.00010244872,0.00027239168,0.000043917367],"domain_scores_gemma":[0.9990728,0.00045054432,0.000099535886,0.00009461772,0.00023917803,0.0000432845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010412247,0.00056544464,0.0008341634,0.00042158418,0.00025514408,0.0006082179,0.0011081838,0.0010262076,0.0019419683],"category_scores_gemma":[0.0029860623,0.00042110978,0.00065278134,0.00041747373,0.0007676409,0.0005941321,0.0009256564,0.0011612732,0.0005955305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068284484,0.00002754502,0.000433948,0.000109684195,0.000043037868,0.00008136615,0.00007165044,0.91447896,0.0072618895,0.030971222,0.0018678554,0.044584613],"study_design_scores_gemma":[0.0000039925117,0.000008435365,0.00003061826,0.000004126773,0.0000016285159,0.000012958038,0.0000018893476,0.99727565,0.00048557573,0.0014867348,0.0006846073,0.0000037590255],"about_ca_topic_score_codex":0.003872817,"about_ca_topic_score_gemma":0.0029266651,"teacher_disagreement_score":0.003872817,"about_ca_system_score_codex":0.000513981,"about_ca_system_score_gemma":0.0013492364,"threshold_uncertainty_score":0.0077005625},"labels":[],"label_agreement":null},{"id":"W4405848166","doi":"10.23952/jnva.9.2025.2.02","title":"Bregman ADMM: A new algorithm for nonconvex optimization with linear constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Fundamental Research Funds of China West Normal University; China West Normal University; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Mathematical optimization; Computer science; Algorithm; Linear programming; Optimization problem; Optimization algorithm; Mathematics","score_opus":0.01105046593844212,"score_gpt":0.24865108029362482,"score_spread":0.2376006143551827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405848166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005459626,0.00023435631,0.9982949,0.0001323954,0.00004757379,0.000020131009,0.000020959047,0.000100838086,0.0006029037],"genre_scores_gemma":[0.035900682,0.0007952838,0.9585032,0.0002951119,0.00013009211,0.00017899067,0.00024814514,0.00011582699,0.0038326504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988084,0.000399967,0.00007548594,0.0001889568,0.00046167427,0.00006558657],"domain_scores_gemma":[0.99882203,0.0005245354,0.00015845634,0.00014374353,0.00028638088,0.000064816246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024145031,0.0013383108,0.0015159646,0.0008282311,0.0005088222,0.0012075756,0.002227492,0.0025417095,0.0022443742],"category_scores_gemma":[0.0040646233,0.00067581487,0.0010412079,0.0013753918,0.0014042886,0.0023357868,0.0021028116,0.004471185,0.0010119573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010748027,0.00010018789,0.00036221292,0.00041039597,0.00013604881,0.00018037774,0.00014225738,0.6754125,0.0076623056,0.099270575,0.012832108,0.2033836],"study_design_scores_gemma":[0.000020773563,0.00004536563,0.000046625966,0.000022713932,0.000008428444,0.00008192061,0.000006918537,0.98228836,0.0011313353,0.010515605,0.0058190105,0.000012925406],"about_ca_topic_score_codex":0.0021958328,"about_ca_topic_score_gemma":0.0027470877,"teacher_disagreement_score":0.0025417095,"about_ca_system_score_codex":0.00073085603,"about_ca_system_score_gemma":0.0022394687,"threshold_uncertainty_score":0.012769282},"labels":[],"label_agreement":null},{"id":"W4406090099","doi":"10.1109/ojcoms.2025.3526759","title":"Active RIS-NOMA Uplink in URLLC, Jamming Mitigation via Surrogate and Deep Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Noma; Telecommunications link; Jamming; Computer science; Computer network; Physics","score_opus":0.01676295254077728,"score_gpt":0.2831495680726141,"score_spread":0.26638661553183685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406090099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11849925,0.0004881735,0.8746196,0.00036633134,0.000041719926,0.000022447437,0.000049783914,0.00047724304,0.0054354854],"genre_scores_gemma":[0.94697624,0.00017823171,0.049744662,0.00011485959,0.000026621068,0.000038364404,0.00008865662,0.00003036165,0.0028020523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997849,0.00009281597,0.000006794607,0.000031504715,0.00004682189,0.000037140784],"domain_scores_gemma":[0.99953806,0.00026123002,0.00006216259,0.00003132965,0.000079195306,0.000028015935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463548,0.00053779,0.0005083854,0.00022698687,0.0002039183,0.00060333376,0.0005504256,0.00069209863,0.00064074155],"category_scores_gemma":[0.0017292291,0.00026111514,0.0003594115,0.00026200915,0.0004837607,0.0005918595,0.00066626247,0.00077561045,0.00021358451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007062988,0.00003881209,0.00057903497,0.000034172266,0.000022369552,0.00005414157,0.00002645995,0.9682721,0.00293093,0.00333302,0.00045733326,0.024180882],"study_design_scores_gemma":[0.0000010684745,0.0000131611805,0.000047795937,0.0000016887037,0.0000017230387,0.0000050862573,0.000002479262,0.99895954,0.00038814676,0.0005027773,0.00007490463,0.000001632517],"about_ca_topic_score_codex":0.0018416292,"about_ca_topic_score_gemma":0.0022603646,"teacher_disagreement_score":0.0018416292,"about_ca_system_score_codex":0.00034312462,"about_ca_system_score_gemma":0.00054081384,"threshold_uncertainty_score":0.0036617517},"labels":[],"label_agreement":null},{"id":"W4407287089","doi":"10.1007/s43670-025-00098-0","title":"The greedy side of the LASSO: new algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit","year":2025,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Matching pursuit; Lasso (programming language); Greedy algorithm; Algorithm; Computer science; Mathematics; Function (biology); Matching (statistics); Mathematical optimization; Compressed sensing; Statistics; Biology","score_opus":0.029611984638783583,"score_gpt":0.28073824218313737,"score_spread":0.2511262575443538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407287089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009833912,0.00024287563,0.99786025,0.00018527557,0.00005986027,0.000011196726,0.000025957776,0.000115400195,0.0005157781],"genre_scores_gemma":[0.06421984,0.001403354,0.9272134,0.00054853346,0.0005120482,0.00020528205,0.00025230146,0.0003774766,0.005267742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781114,0.0009141408,0.00008438209,0.0002613558,0.0008199871,0.00010902383],"domain_scores_gemma":[0.9981748,0.0010063266,0.00018258441,0.00028085875,0.00025606572,0.000099476674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031099808,0.0018053736,0.001539106,0.0009437784,0.0004897815,0.0014676745,0.001974381,0.0019879437,0.0020083915],"category_scores_gemma":[0.0077099563,0.0008814928,0.0009051511,0.001803071,0.0019296261,0.0032475127,0.0037404383,0.0040403986,0.0014514669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053221773,0.00017953246,0.00054524693,0.00041765388,0.00021107002,0.00014677655,0.00020619138,0.21537094,0.021821827,0.24218109,0.019863188,0.49852428],"study_design_scores_gemma":[0.00002947406,0.00008146249,0.00009460021,0.000023842498,0.000014069503,0.00008680929,0.00001584034,0.9337825,0.002778447,0.058685128,0.0043798694,0.000027939193],"about_ca_topic_score_codex":0.0006645493,"about_ca_topic_score_gemma":0.0007335225,"teacher_disagreement_score":0.0031099808,"about_ca_system_score_codex":0.00041463575,"about_ca_system_score_gemma":0.0009771334,"threshold_uncertainty_score":0.016447306},"labels":[],"label_agreement":null},{"id":"W4408019337","doi":"10.1103/physrevlett.134.080802","title":"Enhancing Interferometry Using Weak Value Amplification with Real Weak Values","year":2025,"lang":"en","type":"article","venue":"Physical Review Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Engineering and Physical Sciences Research Council; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Interferometry; Value (mathematics); Physics; Optics; Statistics; Mathematics","score_opus":0.017389589959349083,"score_gpt":0.2922917768653485,"score_spread":0.27490218690599943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408019337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42784056,0.0009459666,0.5530105,0.0006079843,0.00026336598,0.00043002726,0.00017915247,0.0012024249,0.015519967],"genre_scores_gemma":[0.80849767,0.0005217123,0.18660277,0.00031162254,0.00007215959,0.00036908573,0.00012523854,0.00012419569,0.0033755044],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892825,0.00020381864,0.000056408062,0.00028673658,0.00038405615,0.00014073285],"domain_scores_gemma":[0.9988594,0.00040171863,0.000313966,0.0002172739,0.00013582269,0.000071773116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010782182,0.0008275495,0.00037868356,0.00053774257,0.00039990444,0.00091260107,0.0011128051,0.00064562616,0.0015490981],"category_scores_gemma":[0.0016777505,0.00049273204,0.00035144415,0.0004757407,0.00148965,0.0014315424,0.0019397046,0.0013132859,0.00056957605],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008634832,0.000054935765,0.00048344373,0.00011468557,0.000013386387,0.00012177041,0.000106584055,0.0009040579,0.96792465,0.016847828,0.00018936081,0.013152893],"study_design_scores_gemma":[0.000018295821,0.000292612,0.00030625056,0.000010230114,0.000013195592,0.00017342722,0.000024780698,0.008871162,0.98224616,0.003273117,0.0047454666,0.000025319245],"about_ca_topic_score_codex":0.0001977689,"about_ca_topic_score_gemma":0.00028887542,"teacher_disagreement_score":0.0015490981,"about_ca_system_score_codex":0.0005740014,"about_ca_system_score_gemma":0.00055898534,"threshold_uncertainty_score":0.005702257},"labels":[],"label_agreement":null},{"id":"W4408368945","doi":"10.1002/cjs.70002","title":"Noisy matrix completion for longitudinal data with subject‐ and time‐specific covariates","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Covariate; Subject (documents); Computer science; Longitudinal data; Matrix completion; Matrix (chemical analysis); Statistics; Mathematics; Data mining; Machine learning; World Wide Web; Physics","score_opus":0.027974628484490595,"score_gpt":0.2494557573966668,"score_spread":0.22148112891217622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408368945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01424708,0.0002941836,0.98430425,0.00045319155,0.000040026232,0.00004117474,0.00024331204,0.00011810477,0.00025860374],"genre_scores_gemma":[0.5026153,0.0013589772,0.4880393,0.00045582152,0.00051196513,0.0006390516,0.0020534832,0.00012629431,0.004199868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956155,0.0030495026,0.0001336986,0.0006379572,0.00037800125,0.00018536225],"domain_scores_gemma":[0.9803798,0.014715874,0.0018345612,0.0016298046,0.0010986147,0.00034139157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010650767,0.0009114389,0.0014573794,0.0007666105,0.00054582313,0.00086440437,0.0020389054,0.001251138,0.0017637064],"category_scores_gemma":[0.025147349,0.00079748797,0.00095432333,0.0015214571,0.0016840966,0.001580222,0.0013772518,0.0022893439,0.00041708254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004008911,0.00022796668,0.0064957244,0.00039648818,0.00027864735,0.0002780217,0.0002810008,0.8462365,0.002260638,0.07615031,0.004179674,0.062814035],"study_design_scores_gemma":[0.000027211303,0.00006083344,0.00086123607,0.000022266202,0.000016191902,0.000035714962,0.000029940542,0.9704689,0.00050825696,0.02701373,0.0009370283,0.000018634828],"about_ca_topic_score_codex":0.0067201117,"about_ca_topic_score_gemma":0.0053482987,"teacher_disagreement_score":0.010650767,"about_ca_system_score_codex":0.0009489793,"about_ca_system_score_gemma":0.0020123636,"threshold_uncertainty_score":0.056327343},"labels":[],"label_agreement":null},{"id":"W4408757431","doi":"10.1002/wics.70013","title":"Nuclear Norm Regularization","year":2025,"lang":"en","type":"review","venue":"Wiley Interdisciplinary Reviews Computational Statistics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Regularization (linguistics); Norm (philosophy); Computer science; Applied mathematics; Econometrics; Artificial intelligence; Philosophy; Epistemology","score_opus":0.031436503882291904,"score_gpt":0.3316734558952978,"score_spread":0.3002369520130059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408757431","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002765229,0.056883868,0.89560115,0.0027134104,0.0008916428,0.00007876247,0.00036253547,0.00046617314,0.040237192],"genre_scores_gemma":[0.22257203,0.23652543,0.48379788,0.003743366,0.0036021404,0.00075658935,0.0025958426,0.0010104737,0.045396324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981433,0.0006008349,0.000098646175,0.000309579,0.00075818406,0.00008946409],"domain_scores_gemma":[0.9974782,0.0012767784,0.00022067045,0.00028424256,0.00066243927,0.00007770011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002569302,0.0012402814,0.0016311177,0.0016959009,0.0005303318,0.0024943608,0.001564373,0.001678113,0.007187698],"category_scores_gemma":[0.0058020093,0.00048705025,0.0009299997,0.0024441076,0.0027331482,0.0023779403,0.0019379955,0.0027606823,0.003341395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058879512,0.000041420113,0.00034684804,0.0019878822,0.00012445253,0.00018081302,0.00011958523,0.04242876,0.0045570824,0.63447624,0.030629901,0.28504804],"study_design_scores_gemma":[0.00003590727,0.000108714376,0.000766538,0.0011096844,0.000066780165,0.00078142557,0.00012448532,0.17528297,0.006117494,0.529957,0.2855426,0.00010643488],"about_ca_topic_score_codex":0.0015991697,"about_ca_topic_score_gemma":0.0012713325,"teacher_disagreement_score":0.007187698,"about_ca_system_score_codex":0.0010314751,"about_ca_system_score_gemma":0.0016255226,"threshold_uncertainty_score":0.024045229},"labels":[],"label_agreement":null},{"id":"W4409606439","doi":"10.3390/electronics14081671","title":"Depth Upsampling with Local and Nonlocal Models Using Adaptive Bandwidth","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upsampling; Bandwidth (computing); Computer science; Geology; Telecommunications; Artificial intelligence","score_opus":0.01668713078471975,"score_gpt":0.22979736720995783,"score_spread":0.21311023642523808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409606439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011515034,0.00032236433,0.9870734,0.00008129934,0.000017906026,0.000024340283,0.000033447406,0.00034240674,0.00058981485],"genre_scores_gemma":[0.26648858,0.0010229658,0.7290933,0.00020058545,0.00006743948,0.00010685655,0.0003001717,0.00020418537,0.002515827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954754,0.00007528174,0.000018899884,0.00007294985,0.0002494781,0.000035757617],"domain_scores_gemma":[0.99955386,0.00015492644,0.000067238885,0.00009485251,0.0001006864,0.000028406053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252831,0.00088086136,0.0006210867,0.000862148,0.00023068105,0.00060650444,0.0010142226,0.0006802525,0.0010943334],"category_scores_gemma":[0.0017558694,0.00044248666,0.0008252092,0.000659356,0.00040955204,0.001513385,0.0013888287,0.0010692262,0.00043300775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037656658,0.0001235438,0.0017869419,0.00035151016,0.00016266466,0.00029392497,0.0004899525,0.31621596,0.15036736,0.017595591,0.0033101756,0.50892574],"study_design_scores_gemma":[0.000012642757,0.000038102273,0.00029272886,0.000015729844,0.000026347632,0.00014951783,0.000032146956,0.9806051,0.013127076,0.00336287,0.0023176821,0.000020055619],"about_ca_topic_score_codex":0.0040842295,"about_ca_topic_score_gemma":0.006225398,"teacher_disagreement_score":0.0040842295,"about_ca_system_score_codex":0.0004875703,"about_ca_system_score_gemma":0.00077694684,"threshold_uncertainty_score":0.008120894},"labels":[],"label_agreement":null},{"id":"W4410315374","doi":"10.1016/j.jat.2025.106199","title":"Universal discretization and sparse recovery","year":2025,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Lomonosov Moscow State University; Russian Science Foundation","keywords":"Mathematics; Discretization; Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.004952967054561926,"score_gpt":0.2042627730815323,"score_spread":0.19930980602697038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410315374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012614702,0.0027640471,0.96823555,0.0015439363,0.000434053,0.000016254719,0.00011868997,0.00015416917,0.014118649],"genre_scores_gemma":[0.65518165,0.0066758255,0.30494878,0.0012445587,0.0011876607,0.00007919762,0.0004928838,0.00022090224,0.029968604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940073,0.00021487947,0.000033401993,0.000119421326,0.00018733079,0.000044342167],"domain_scores_gemma":[0.9983748,0.0008891664,0.00011469992,0.0003771346,0.00018085627,0.000063264946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091282284,0.00048041766,0.00095808273,0.0009867394,0.00047551267,0.0012640186,0.00060455006,0.0010181391,0.0029510313],"category_scores_gemma":[0.0050329487,0.00040538903,0.0004473048,0.0012607223,0.002636551,0.002489159,0.002027565,0.002578151,0.0004932412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002976797,0.000013153129,0.00011253392,0.00006020675,0.00001452586,0.000038376165,0.00007365037,0.01680579,0.0013278363,0.94859827,0.0026959493,0.030230084],"study_design_scores_gemma":[0.000006603027,0.000013406738,0.00010752955,0.00002046628,0.0000072193393,0.00008950094,0.000030371666,0.12347344,0.0007178977,0.8702464,0.0052780486,0.000009072395],"about_ca_topic_score_codex":0.0011075437,"about_ca_topic_score_gemma":0.0010982283,"teacher_disagreement_score":0.0029510313,"about_ca_system_score_codex":0.0005416372,"about_ca_system_score_gemma":0.00038581065,"threshold_uncertainty_score":0.0098721385},"labels":[],"label_agreement":null},{"id":"W4411140844","doi":"10.1007/s10957-025-02713-5","title":"Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Theory of computation; Regular polygon; Convex optimization; Proximal Gradient Methods; Convex analysis; Proper convex function; Convex function; Mathematical optimization; Subderivative; Conic optimization; Applied mathematics; Combinatorics; Geometry; Algorithm","score_opus":0.016976661332291414,"score_gpt":0.308990695650776,"score_spread":0.2920140343184846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411140844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003029483,0.00019787677,0.9948144,0.00010498037,0.000063539446,0.000036500584,0.000035773,0.00046704395,0.0012504271],"genre_scores_gemma":[0.14035453,0.00033724707,0.84925663,0.00018966947,0.0001492036,0.00037717004,0.0003290699,0.00083540095,0.00817115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989342,0.00040501033,0.000055673016,0.00010331648,0.0004219449,0.0000798154],"domain_scores_gemma":[0.9978168,0.0012274653,0.00011448744,0.00030067758,0.0004343044,0.000106303465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015365903,0.0018443264,0.0016665404,0.00064286595,0.00046414445,0.0012444835,0.0023501497,0.0019702774,0.0061031883],"category_scores_gemma":[0.008826155,0.00086590555,0.000995092,0.0007758426,0.0012506775,0.0016986091,0.0030024997,0.003179996,0.0028300511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054767396,0.00019067149,0.00048061647,0.000350265,0.00012347267,0.00021328406,0.000247896,0.6538564,0.009297525,0.070971034,0.013735561,0.24998564],"study_design_scores_gemma":[0.000016821163,0.000022445198,0.000028725617,0.0000065638405,0.0000036340696,0.000017210592,0.000005154239,0.99353844,0.0005974502,0.0048884857,0.0008684476,0.0000065550644],"about_ca_topic_score_codex":0.003852528,"about_ca_topic_score_gemma":0.0065830178,"teacher_disagreement_score":0.0061031883,"about_ca_system_score_codex":0.00074362213,"about_ca_system_score_gemma":0.0019203365,"threshold_uncertainty_score":0.020417213},"labels":[],"label_agreement":null},{"id":"W4411144663","doi":"10.21105/joss.08264","title":"DiRe - JAX: A JAX based Dimensionality Reduction Algorithm for Large-scale Data","year":2025,"lang":"en","type":"article","venue":"The Journal of Open Source Software","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Dimensionality reduction; Scale (ratio); Computer science; Algorithm; Artificial intelligence; Geography; Cartography","score_opus":0.033745488472000394,"score_gpt":0.3103964914525433,"score_spread":0.2766510029805429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411144663","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003692505,0.00032995094,0.9861238,0.0002621305,0.00017586262,0.00012802052,0.0005164406,0.007856588,0.0009146741],"genre_scores_gemma":[0.022078501,0.00029281664,0.97066283,0.00023895736,0.00007403098,0.00042677193,0.0023116607,0.0011400105,0.0027744083],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825877,0.00039651015,0.00019658348,0.00025805735,0.000783668,0.000106483196],"domain_scores_gemma":[0.996968,0.00095345,0.00026361283,0.00087281724,0.00073450437,0.00020775263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025226898,0.0014881166,0.0013947603,0.0018269054,0.0013829542,0.0032705457,0.0021994463,0.0013098445,0.007786288],"category_scores_gemma":[0.009503032,0.00077711046,0.0014362637,0.0021269124,0.0011931862,0.00302054,0.0043055466,0.0044237175,0.0067792544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052068394,0.00036601588,0.002961054,0.000965242,0.00033821422,0.00046308487,0.00092491554,0.051719148,0.03634399,0.04764921,0.12270782,0.7350406],"study_design_scores_gemma":[0.00020988839,0.00034191215,0.0020558934,0.0001410946,0.000043427775,0.0010793246,0.0004254459,0.80273014,0.030660618,0.07680816,0.08532723,0.0001767921],"about_ca_topic_score_codex":0.0014461605,"about_ca_topic_score_gemma":0.0036794788,"teacher_disagreement_score":0.007786288,"about_ca_system_score_codex":0.0004435678,"about_ca_system_score_gemma":0.0020612874,"threshold_uncertainty_score":0.026047707},"labels":[],"label_agreement":null},{"id":"W4412006979","doi":"10.2139/ssrn.5337603","title":"Ayla: Amplifying Gradient Sensitivity Via Loss Transformation in Non-Convex Optimization","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sensitivity (control systems); Transformation (genetics); Regular polygon; Convex optimization; Mathematics; Mathematical optimization; Computer science; Geometry; Chemistry; Electronic engineering; Engineering","score_opus":0.007461821204500602,"score_gpt":0.2276346138058728,"score_spread":0.2201727926013722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412006979","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041143424,0.00025639063,0.99259466,0.00032508787,0.000095202864,0.000036894326,0.00007031141,0.0005794981,0.0019276715],"genre_scores_gemma":[0.26401615,0.0008380725,0.7123118,0.0008888875,0.000446777,0.0003695588,0.00041582165,0.0010288575,0.019684168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985104,0.0006521768,0.00004893043,0.00017800946,0.0005309396,0.00007956248],"domain_scores_gemma":[0.9975231,0.0016473475,0.00015035208,0.00033882205,0.0002244538,0.00011591216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019311862,0.0016587947,0.0011157284,0.0006696743,0.00041288274,0.0015957936,0.0013454285,0.0016270602,0.005022742],"category_scores_gemma":[0.008636368,0.0007003389,0.0006525494,0.00087442016,0.0019703873,0.0025416368,0.003974359,0.004374465,0.0020697874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095670857,0.0003175113,0.0006751434,0.00070923584,0.00019210781,0.00034928476,0.00040754527,0.31948897,0.051319245,0.27119738,0.023431472,0.33095542],"study_design_scores_gemma":[0.00002519971,0.000085767344,0.00008844138,0.00002177399,0.000011597765,0.00006846027,0.000015784364,0.9410741,0.0061557484,0.049741603,0.0026940387,0.000017497829],"about_ca_topic_score_codex":0.00087961624,"about_ca_topic_score_gemma":0.0010580054,"teacher_disagreement_score":0.005022742,"about_ca_system_score_codex":0.000540017,"about_ca_system_score_gemma":0.0008176277,"threshold_uncertainty_score":0.016802728},"labels":[],"label_agreement":null},{"id":"W4413104756","doi":"10.1109/lra.2025.3597866","title":"Globally Optimal Data-Association-Free Landmark-Based Localization Using Semidefinite Relaxations","year":2025,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Landmark; Association (psychology); Data association; Computer science; Mathematics; Artificial intelligence; Psychology","score_opus":0.018585317525305182,"score_gpt":0.24701985287310607,"score_spread":0.2284345353478009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413104756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021763959,0.00003624681,0.99700004,0.000060880317,0.0000071976265,0.000010912054,0.0000265685,0.00011360606,0.0005680924],"genre_scores_gemma":[0.26744163,0.00023419649,0.7275732,0.00018586282,0.0000642975,0.0002576933,0.0004975449,0.00025599133,0.0034895493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988819,0.00048375415,0.000046879104,0.00022607217,0.0002683877,0.00009297353],"domain_scores_gemma":[0.99786526,0.0013556135,0.00023446823,0.00019114214,0.0002714155,0.00008205928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018862878,0.001322853,0.0012673319,0.00047114896,0.0003486292,0.0009888889,0.0013402011,0.0010321253,0.0022760492],"category_scores_gemma":[0.004660659,0.00079495646,0.0008315222,0.00077453477,0.0011698975,0.0016080339,0.0017800217,0.002104987,0.0008432089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106568245,0.000038102222,0.00020712175,0.00010638272,0.000030419225,0.00006046863,0.00009680097,0.9441461,0.0026562363,0.015627015,0.001663932,0.035260774],"study_design_scores_gemma":[0.000012212186,0.000030460773,0.0000275806,0.000007512568,0.0000028325635,0.000019150764,0.000015596375,0.99356246,0.00075124035,0.0051069804,0.00045724856,0.000006668671],"about_ca_topic_score_codex":0.0021033068,"about_ca_topic_score_gemma":0.001973157,"teacher_disagreement_score":0.0022760492,"about_ca_system_score_codex":0.00060875877,"about_ca_system_score_gemma":0.0013726988,"threshold_uncertainty_score":0.009975791},"labels":[],"label_agreement":null},{"id":"W4414856525","doi":"10.1109/lcomm.2025.3617905","title":"Unsourced Random Access With Unequal Power Dynamic Compressed Sensing","year":2025,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Compressed sensing; Encoding (memory); Power (physics); Random access; State (computer science); Range (aeronautics); Code (set theory); Distribution (mathematics)","score_opus":0.01635150211349717,"score_gpt":0.2750482620863227,"score_spread":0.25869675997282554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414856525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015388213,0.00034625246,0.9805095,0.0002941243,0.00005781161,0.00004339691,0.000064253225,0.00015794802,0.0031384632],"genre_scores_gemma":[0.8058445,0.000596011,0.18864311,0.00047439267,0.00014090826,0.00014626927,0.00015181252,0.000048439204,0.00395462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985447,0.00054221647,0.00004870454,0.00023528395,0.0005039652,0.00012517032],"domain_scores_gemma":[0.9980666,0.0012309451,0.0001767721,0.00022476978,0.00024620324,0.00005466554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009528029,0.000724066,0.00049180415,0.0003761804,0.0002945359,0.0008157266,0.001147425,0.0006369963,0.0014926767],"category_scores_gemma":[0.003847473,0.00025858785,0.00033968178,0.0007173448,0.0011393005,0.001512021,0.0013379998,0.0010892329,0.00033398456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010563061,0.00021175803,0.001198345,0.0004284276,0.00012543291,0.00055620703,0.0003672698,0.51168734,0.052105393,0.2244683,0.003494729,0.20430048],"study_design_scores_gemma":[0.000030508854,0.00013521338,0.00012888231,0.000021985794,0.000015839427,0.00017628324,0.000026206011,0.9750507,0.0076540513,0.015279698,0.0014565091,0.000024208994],"about_ca_topic_score_codex":0.001167747,"about_ca_topic_score_gemma":0.001691853,"teacher_disagreement_score":0.0014926767,"about_ca_system_score_codex":0.0005366351,"about_ca_system_score_gemma":0.0008072462,"threshold_uncertainty_score":0.0050389767},"labels":[],"label_agreement":null},{"id":"W4414891634","doi":"10.48550/arxiv.2506.00648","title":"A Framework for Nonlinearly-Constrained Gradient-Enhanced Local Bayesian Optimization with Comparisons to Quasi-Newton Optimizers","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Bayesian optimization; Bayesian probability; Leverage (statistics); Convergence (economics); Minification; Function (biology); Optimization problem; Constrained optimization","score_opus":0.02994577679562404,"score_gpt":0.2812068564628057,"score_spread":0.25126107966718164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414891634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021929838,0.00021203076,0.9982242,0.00012258264,0.00002859834,0.000018843206,0.000015308844,0.00010432425,0.001054757],"genre_scores_gemma":[0.039871816,0.00122667,0.9524475,0.000403261,0.00026193116,0.0003419567,0.00014693495,0.00061773695,0.00468223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984301,0.00077102036,0.000074899064,0.00015776716,0.00050296483,0.000063317406],"domain_scores_gemma":[0.9980317,0.0010959522,0.00017492326,0.00020859762,0.00039180633,0.000097109456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003313687,0.0015420428,0.0013008119,0.0011835367,0.0005811119,0.0017398562,0.0022677688,0.0018394127,0.0053709964],"category_scores_gemma":[0.0074187946,0.00090404827,0.0012999653,0.0010889766,0.0022015267,0.0021335282,0.002948528,0.0036076445,0.0022546593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057496327,0.000063197724,0.00030548114,0.0003486436,0.000098499935,0.00009971455,0.00018026894,0.46188462,0.0045917844,0.43661627,0.00733594,0.08841812],"study_design_scores_gemma":[0.000013596403,0.00003114819,0.00006828755,0.000045017692,0.000012184448,0.00004607001,0.000012903112,0.9335734,0.0006835547,0.05734207,0.008151213,0.000020488882],"about_ca_topic_score_codex":0.004329323,"about_ca_topic_score_gemma":0.0051489356,"teacher_disagreement_score":0.0053709964,"about_ca_system_score_codex":0.0011030455,"about_ca_system_score_gemma":0.002230786,"threshold_uncertainty_score":0.01796782},"labels":[],"label_agreement":null},{"id":"W4416875646","doi":"10.1007/s10208-025-09738-2","title":"Optimal sampling for least-squares approximation","year":2025,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Pointwise; Christoffel symbols; Sampling (signal processing); Function approximation; Generalization; Function (biology); Dimension (graph theory); Space (punctuation)","score_opus":0.03518016164055663,"score_gpt":0.310050986311757,"score_spread":0.27487082467120033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416875646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011746744,0.0006464382,0.99644095,0.00024835195,0.00007689565,0.000011598729,0.000043378186,0.00008917534,0.0012685515],"genre_scores_gemma":[0.23711231,0.0035660595,0.7472402,0.00052069465,0.00085441774,0.0003841601,0.0005578718,0.0003949878,0.00936934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754626,0.0011575285,0.00011006586,0.000359771,0.00071778736,0.00010856281],"domain_scores_gemma":[0.9917337,0.0066878935,0.00023548177,0.0006082577,0.0006160894,0.00011861461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021473945,0.0015545409,0.0020989787,0.00096772553,0.0005241687,0.0017376746,0.0017581744,0.0021389276,0.003980203],"category_scores_gemma":[0.020323418,0.0010134474,0.0007870747,0.001689647,0.0021930167,0.0026736902,0.0023605824,0.003985765,0.0010673607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002116932,0.00009504234,0.00038800007,0.00044425664,0.000079726444,0.00008114314,0.0001312882,0.38639602,0.0029225326,0.48648277,0.008752101,0.11401545],"study_design_scores_gemma":[0.000016016942,0.000015667485,0.000058349833,0.000021677495,0.000009044603,0.000023303823,0.000011312667,0.8092194,0.0004564689,0.18821786,0.0019418624,0.000009015994],"about_ca_topic_score_codex":0.003301683,"about_ca_topic_score_gemma":0.0025300293,"teacher_disagreement_score":0.003980203,"about_ca_system_score_codex":0.0011989076,"about_ca_system_score_gemma":0.0011929002,"threshold_uncertainty_score":0.013315082},"labels":[],"label_agreement":null},{"id":"W4417282135","doi":"10.1109/pimrc62392.2025.11275520","title":"Conditional Denoising Diffusion for ISAC Enhanced Channel Estimation in Cell-Free 6G","year":2025,"lang":"","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"","keywords":"Robustness (evolution); Channel (broadcasting); Mean squared error; Key (lock); Encoder; Noise reduction; Decoding methods","score_opus":0.010578166747983805,"score_gpt":0.25389167430058723,"score_spread":0.24331350755260342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417282135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019791692,0.00044783557,0.9775168,0.0002750729,0.00004567707,0.00001656047,0.00007546347,0.0002558807,0.0015749522],"genre_scores_gemma":[0.87744284,0.0010638833,0.11532826,0.0002777641,0.000068099864,0.000060559963,0.0002673387,0.00009242539,0.005398877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969566,0.00008472031,0.00001145024,0.00006292614,0.00010417001,0.000041111784],"domain_scores_gemma":[0.9994049,0.00030609153,0.00006497386,0.000044707565,0.0001519997,0.000027373164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007196036,0.0007249767,0.0005472831,0.00032430905,0.00027378302,0.0005844095,0.0007618528,0.0007670859,0.00082676363],"category_scores_gemma":[0.0021914535,0.0003763556,0.0005305206,0.00039647124,0.0006399994,0.0009782,0.00078990817,0.0010863458,0.00028578946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016502354,0.00002815385,0.0014371614,0.000105840714,0.000050292583,0.0001731199,0.00012860836,0.9116666,0.012121507,0.02132602,0.0014602711,0.051337376],"study_design_scores_gemma":[0.0000029199286,0.000012041761,0.000094691124,0.0000042978045,0.00000653628,0.0000296979,0.0000055398464,0.9972767,0.00093493075,0.0012872118,0.00033809466,0.0000072937505],"about_ca_topic_score_codex":0.0075076744,"about_ca_topic_score_gemma":0.0081170155,"teacher_disagreement_score":0.0075076744,"about_ca_system_score_codex":0.0007295179,"about_ca_system_score_gemma":0.00078442856,"threshold_uncertainty_score":0.014927983},"labels":[],"label_agreement":null},{"id":"W59337188","doi":"10.1007/978-3-642-30615-0_24","title":"Partial Fourier Codebooks Associated with Multiplied Golay Complementary Sequences for Compressed Sensing","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Codebook; Binary Golay code; Binary number; Complementary sequences; Ternary Golay code; Algorithm; Integer (computer science); Sequence (biology); Bounded function; Mathematics; Matrix (chemical analysis); Fast Fourier transform; Binary code; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Mathematical analysis; Hamming code; Block code; Decoding methods; Materials science","score_opus":0.03059745839473943,"score_gpt":0.24381262231764275,"score_spread":0.21321516392290332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W59337188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01260586,0.0013926679,0.97046185,0.00020802711,0.00029138778,0.000076055396,0.00029583427,0.00022350172,0.014444765],"genre_scores_gemma":[0.27296337,0.003396939,0.6967801,0.00032167198,0.0005222957,0.000374693,0.0013677677,0.00031220703,0.023960954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994943,0.0001285403,0.000024867586,0.000049705464,0.000266591,0.00003600166],"domain_scores_gemma":[0.9988537,0.0005547794,0.000072064606,0.00019723373,0.00027171546,0.0000505475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062838744,0.00059064256,0.0006282027,0.00087226735,0.00036991673,0.0011409036,0.0007596014,0.0008547141,0.007061444],"category_scores_gemma":[0.0038532142,0.00031277144,0.00034745247,0.0017618749,0.0007529548,0.0011721418,0.0009182815,0.0010772799,0.0016519647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021162824,0.000037813203,0.00023126359,0.00019992563,0.000028284292,0.00016180267,0.00012328013,0.042637736,0.025151178,0.739077,0.007800302,0.18433991],"study_design_scores_gemma":[0.000055792716,0.00014872084,0.00047140065,0.0001228949,0.000025887939,0.0010172126,0.00008388028,0.64099556,0.015888391,0.31186023,0.029243113,0.00008683211],"about_ca_topic_score_codex":0.00055040856,"about_ca_topic_score_gemma":0.00083714176,"teacher_disagreement_score":0.007061444,"about_ca_system_score_codex":0.00044426898,"about_ca_system_score_gemma":0.00062024023,"threshold_uncertainty_score":0.02362293},"labels":[],"label_agreement":null},{"id":"W645359941","doi":"10.1016/j.sigpro.2015.05.014","title":"Theoretical results for sparse signal recovery with noises using generalized OMP algorithm","year":2015,"lang":"en","type":"article","venue":"Signal Processing","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University","funders":"","keywords":"Matching pursuit; Iterated function; Algorithm; Stopping rule; Isometry (Riemannian geometry); SIGNAL (programming language); Signal reconstruction; Mathematics; Sparse approximation; Signal recovery; Constant (computer programming); Signal processing; Computer science; Compressed sensing; Mathematical optimization; Mathematical analysis","score_opus":0.04054572021444735,"score_gpt":0.26355870922858504,"score_spread":0.22301298901413769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W645359941","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038666169,0.0014928078,0.9818672,0.00079281896,0.00017843438,0.000020315374,0.00009024583,0.000073092284,0.011618551],"genre_scores_gemma":[0.33678943,0.014376357,0.62108624,0.0018392163,0.0022619006,0.00046206926,0.000815032,0.00042406996,0.021945726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989792,0.0002998159,0.000053423173,0.00013248945,0.0004419867,0.00009307708],"domain_scores_gemma":[0.9963799,0.002417405,0.00017661581,0.00028152642,0.00064858026,0.00009597702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199393,0.0017986197,0.0010429268,0.0025365648,0.00066177285,0.0017617808,0.001498219,0.0019872559,0.004522849],"category_scores_gemma":[0.0093716765,0.00050658936,0.0012864021,0.0023960024,0.002839947,0.0035545893,0.0029873303,0.003965727,0.001322402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008004021,0.000050093426,0.00022019699,0.00044066855,0.00004833208,0.00018394884,0.000188996,0.09826552,0.004493627,0.8508156,0.0042451955,0.040967833],"study_design_scores_gemma":[0.000012297691,0.000043055585,0.00017298874,0.0000741551,0.000026833643,0.0001934312,0.00006200199,0.46446323,0.0016682463,0.52817553,0.0050772657,0.000031015028],"about_ca_topic_score_codex":0.0011368283,"about_ca_topic_score_gemma":0.000786349,"teacher_disagreement_score":0.004522849,"about_ca_system_score_codex":0.0008409166,"about_ca_system_score_gemma":0.00090275495,"threshold_uncertainty_score":0.01513046},"labels":[],"label_agreement":null},{"id":"W6893300131","doi":"10.5281/zenodo.15235997","title":"Energy Harvesting for Slender Active Civil Foundations - Defense","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Energy harvesting; Energy (signal processing); Work (physics); Field (mathematics); Renewable energy","score_opus":0.03436483165987432,"score_gpt":0.24882768636120012,"score_spread":0.2144628547013258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893300131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056862112,0.005116263,0.8929647,0.0014363488,0.00032912122,0.00003060586,0.00036606097,0.00021525956,0.04267942],"genre_scores_gemma":[0.93162906,0.0028155425,0.04311306,0.00020621993,0.00011998866,0.000040487084,0.00027414077,0.00011631686,0.021685136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999026,0.00001660181,0.0000027146953,0.00003103665,0.000034306147,0.000012670564],"domain_scores_gemma":[0.9998093,0.0000976182,0.000023189386,0.00003183743,0.000024241202,0.000013747723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018355463,0.00034447518,0.00038636752,0.00035166903,0.00029372968,0.0006418778,0.00037790695,0.0005215582,0.0040142206],"category_scores_gemma":[0.0007228233,0.00022326858,0.0002037121,0.0003709688,0.0011731655,0.001064987,0.001115206,0.0007255964,0.0005238029],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010814904,0.000036605874,0.0010056522,0.00025838384,0.000038099828,0.00019174728,0.00013183967,0.22950058,0.044753946,0.6187965,0.008974605,0.096203916],"study_design_scores_gemma":[0.000008806353,0.00005232294,0.0019439302,0.00004549005,0.000008873662,0.00026808394,0.00012826441,0.5019397,0.007079395,0.47609544,0.012395406,0.000034288183],"about_ca_topic_score_codex":0.00042432704,"about_ca_topic_score_gemma":0.00089397747,"teacher_disagreement_score":0.0040142206,"about_ca_system_score_codex":0.00035590975,"about_ca_system_score_gemma":0.00021609526,"threshold_uncertainty_score":0.0134289265},"labels":[],"label_agreement":null},{"id":"W6930270717","doi":"10.5281/zenodo.12072944","title":"principles of electronic materials and devices 4th edition pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interchangeability; Subpoena; Ferroresonance in electricity networks; Work (physics); Electronics","score_opus":0.021027597303941648,"score_gpt":0.22350046503765983,"score_spread":0.20247286773371817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930270717","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087256706,0.010067631,0.018863257,0.0025167624,0.0063513434,0.00033501573,0.0021686228,0.0026611576,0.95616364],"genre_scores_gemma":[0.0033420841,0.0060534063,0.00605239,0.0005230742,0.00036604618,0.00013146503,0.0010502293,0.00049432076,0.981987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983546,0.00007665541,0.000061794104,0.00012059151,0.0012730457,0.000113242466],"domain_scores_gemma":[0.99845207,0.00020131578,0.000050886814,0.00021941686,0.000966419,0.000109908186],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011594158,0.0013074601,0.00089054194,0.0025957737,0.001313129,0.0043073418,0.0024842976,0.0022984685,0.39081937],"category_scores_gemma":[0.0024883137,0.0009800055,0.00086374895,0.0018274185,0.0009920658,0.0047871843,0.0022217066,0.002805247,0.33385143],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044255874,0.000072662566,0.00009179174,0.0006973614,0.000008026565,0.00009657656,0.00010856406,0.00042201477,0.005080377,0.021884277,0.7257823,0.24571182],"study_design_scores_gemma":[0.0000035410587,0.00001580525,0.000094318035,0.000097303375,0.0000020524353,0.000114406736,0.000023949598,0.0001506863,0.0013639759,0.0020255093,0.99609935,0.000009034411],"about_ca_topic_score_codex":0.0012393526,"about_ca_topic_score_gemma":0.0026832726,"teacher_disagreement_score":0.6091806,"about_ca_system_score_codex":0.0016317236,"about_ca_system_score_gemma":0.0015305971,"threshold_uncertainty_score":0.86892223},"labels":[],"label_agreement":null},{"id":"W6968677176","doi":"10.5281/zenodo.4323246","title":"Improving Performance of Low-Rank Matrix Completion Algorithms Through Debiasing of Sampling Patterns","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matrix completion; Sampling (signal processing); Debiasing; Matrix (chemical analysis); Simple (philosophy); State (computer science); Work (physics); Low-rank approximation","score_opus":0.053302812934681636,"score_gpt":0.25086176294349743,"score_spread":0.1975589500088158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968677176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03589509,0.00046967712,0.95975786,0.00038793974,0.00007620352,0.000056836325,0.00008259154,0.0016460306,0.0016278563],"genre_scores_gemma":[0.296529,0.0004597685,0.69838643,0.00027503245,0.00010830237,0.00011142921,0.00047688436,0.0003376295,0.0033155207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997678,0.0008728468,0.00014022573,0.00035323604,0.00076172303,0.00019395698],"domain_scores_gemma":[0.9896965,0.005512187,0.00062076806,0.002560744,0.0012410147,0.00036876329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037800956,0.0016575846,0.0013954478,0.00078382966,0.00059381366,0.0013665694,0.0017040587,0.0016298572,0.0036645895],"category_scores_gemma":[0.024174478,0.0004964302,0.0006172118,0.0009995064,0.0016431388,0.0031213032,0.0021624095,0.0025856283,0.0019876086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015316326,0.0005107217,0.0024170256,0.00042375055,0.00018158335,0.00022443742,0.00054025697,0.5244915,0.03784938,0.04835354,0.01029247,0.37318376],"study_design_scores_gemma":[0.000051749448,0.00012986593,0.00018751697,0.000013400319,0.0000071723734,0.00007551685,0.00004007149,0.97963387,0.007979925,0.010790667,0.0010709654,0.000019241772],"about_ca_topic_score_codex":0.0027145066,"about_ca_topic_score_gemma":0.0033199766,"teacher_disagreement_score":0.0037800956,"about_ca_system_score_codex":0.0005792445,"about_ca_system_score_gemma":0.0014817986,"threshold_uncertainty_score":0.019991279},"labels":[],"label_agreement":null},{"id":"W6977520011","doi":"10.6084/m9.figshare.5793396.v1","title":"MOESM2 of Nonmedical prescription opioid use and illegal drug use: initiation trajectory and related risks among people who use illegal drugs in Vancouver, Canada","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Medical prescription; Drug; Prescription drug; Opioid; Prescription Drug Misuse; Opioid abuse; Poison control; Opioid-Related Disorders","score_opus":0.021477741493985975,"score_gpt":0.21710343477746266,"score_spread":0.19562569328347668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977520011","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028639227,0.0001899531,0.0005208745,0.00031804878,0.00004327384,0.00008924974,0.96757454,0.00011722565,0.0025076286],"genre_scores_gemma":[0.35584897,0.0010651853,0.0048006033,0.0003674544,0.00007027304,0.0010695772,0.60498446,0.0003680362,0.03142555],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9994288,0.000054614065,0.000066885324,0.00012569736,0.00016035303,0.00016369812],"domain_scores_gemma":[0.9961825,0.0010146137,0.00037606966,0.00027208627,0.0017506877,0.00040402252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008033637,0.0005910694,0.00095018215,0.0018339125,0.0016316854,0.0012346026,0.0017165478,0.0006297421,0.11924154],"category_scores_gemma":[0.009920716,0.0003925603,0.0013846846,0.0039286,0.00033773834,0.0005640873,0.0009040896,0.0012130465,0.0057209223],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000645176,0.00007106679,0.47917575,0.00079308375,0.00042609178,0.00012528569,0.0003748401,0.0016353766,0.00011920496,0.0008322078,0.48790237,0.027899528],"study_design_scores_gemma":[0.00038042667,0.00010857297,0.9071232,0.0013241479,0.0005515857,0.00034298777,0.002238536,0.005725179,0.00035235862,0.0008720868,0.080846585,0.00013431748],"about_ca_topic_score_codex":0.9416407,"about_ca_topic_score_gemma":0.9588928,"teacher_disagreement_score":0.11924154,"about_ca_system_score_codex":0.003980695,"about_ca_system_score_gemma":0.0149583295,"threshold_uncertainty_score":0.39890265},"labels":[],"label_agreement":null},{"id":"W7015315355","doi":"","title":"Sparse estimation of structured inverse covariance matrices","year":2016,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; McGill University","keywords":"Estimation of covariance matrices; Covariance; Covariance matrix; Inverse; Inverse problem; Regularization (linguistics); Sparse matrix; Covariance intersection","score_opus":0.013177315678763507,"score_gpt":0.22998754915508868,"score_spread":0.21681023347632516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015315355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006420002,0.0013734797,0.9876088,0.0006954714,0.0000858899,0.000016141128,0.00007546247,0.00009809664,0.003626651],"genre_scores_gemma":[0.29725072,0.010733526,0.6651696,0.00070005294,0.0007667749,0.00013754755,0.0010158716,0.00018727152,0.024038708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.00023159274,0.000027336833,0.00022825264,0.0002764645,0.000045505738],"domain_scores_gemma":[0.99756,0.0015120165,0.00023239371,0.00018111395,0.0004426411,0.00007182496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014128609,0.00073152327,0.0006970782,0.00074414385,0.00027024638,0.0011645445,0.000525783,0.0011007137,0.002524105],"category_scores_gemma":[0.0079489965,0.00041120258,0.0005277266,0.0009846503,0.0011936289,0.0013152832,0.0013008831,0.0019511442,0.00090676744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009823776,0.00007384746,0.0015792417,0.00045967932,0.00009144427,0.00023029867,0.00046209194,0.30428287,0.020092541,0.3568852,0.013327585,0.302417],"study_design_scores_gemma":[0.000018212393,0.00008326445,0.0011391824,0.000115635085,0.000026848924,0.00019194643,0.00009873508,0.79573137,0.0059253685,0.17331542,0.023309879,0.000044168224],"about_ca_topic_score_codex":0.0012531793,"about_ca_topic_score_gemma":0.0012978214,"teacher_disagreement_score":0.002524105,"about_ca_system_score_codex":0.00046889426,"about_ca_system_score_gemma":0.0007904175,"threshold_uncertainty_score":0.008444011},"labels":[],"label_agreement":null},{"id":"W7016129801","doi":"","title":"What does migration control mean? The link between migration and labour market regulations in Norway, Switzerland and Canada","year":2017,"lang":"en","type":"other","venue":"Econstor (Econstor)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Liquation; Diafiltration; Demotion; Dysgeusia; Hyporeflexia; Hemopericardium","score_opus":0.00655926635268209,"score_gpt":0.20122845207520798,"score_spread":0.1946691857225259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7016129801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475331,0.0064820596,0.008511942,0.030799769,0.0002860972,0.00003476789,0.00103074,0.00006150728,0.10526009],"genre_scores_gemma":[0.994966,0.0012619189,0.0004584555,0.00034277787,0.000029132701,0.000007787186,0.00010762065,0.00001420145,0.0028120452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986608,0.00037042054,0.000037222075,0.0001271241,0.00036794666,0.000436445],"domain_scores_gemma":[0.9977284,0.0008073121,0.000554557,0.00016089185,0.0005509808,0.0001979181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015749952,0.00015895722,0.0002024164,0.00058081036,0.001286486,0.0020933752,0.0004882214,0.00050872454,0.0024938877],"category_scores_gemma":[0.009357185,0.000081547936,0.00015545687,0.001291214,0.003857168,0.0006844678,0.0009115343,0.00073067116,0.00013179744],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053288986,0.00012960516,0.21127188,0.0003923255,0.00013827485,0.000623138,0.009591121,0.07071535,0.0018692561,0.4838108,0.036944386,0.18398093],"study_design_scores_gemma":[0.00007500993,0.00013828684,0.64708203,0.0010974176,0.00009890222,0.00025023325,0.03905695,0.05023613,0.0027418854,0.1175584,0.14137915,0.00028562438],"about_ca_topic_score_codex":0.88093424,"about_ca_topic_score_gemma":0.88867354,"teacher_disagreement_score":0.11906576,"about_ca_system_score_codex":0.011073665,"about_ca_system_score_gemma":0.015326756,"threshold_uncertainty_score":0.2395339},"labels":[],"label_agreement":null},{"id":"W7024469899","doi":"","title":"The seacoast resorts of eastern Maine, New Brunswick, Nova Scotia, Prince Edward Island &amp; Cape Breton.","year":2014,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cape; Nova scotia; Nova (rocket); Period (music)","score_opus":0.007091715398462928,"score_gpt":0.1795878577340245,"score_spread":0.17249614233556157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024469899","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69518745,0.010844205,0.003274819,0.00402671,0.0006274265,0.0008010028,0.053865675,0.00022222818,0.23115043],"genre_scores_gemma":[0.7057461,0.003261426,0.0043523684,0.00045051266,0.000030683073,0.00019163483,0.0060088374,0.00006853966,0.27988988],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998857,0.000010292751,0.0000045837132,0.000022063366,0.000029149987,0.000048205853],"domain_scores_gemma":[0.99958664,0.000053594194,0.000056976554,0.00002287368,0.00015855102,0.00012128829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009934324,0.000294228,0.00020177418,0.0007778692,0.001675672,0.0011099286,0.00038032283,0.00020771073,0.016431969],"category_scores_gemma":[0.0006347353,0.00020864801,0.00011500134,0.0017513703,0.00061557424,0.00023761713,0.0006846103,0.00032977178,0.0015051722],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090072775,0.00013356822,0.30027512,0.0016012791,0.00015046736,0.0058291503,0.0069301846,0.0064578466,0.012211452,0.0067421678,0.28633413,0.372434],"study_design_scores_gemma":[0.00003786314,0.00003121373,0.7955413,0.0003749767,0.0000166525,0.0005955541,0.011336012,0.0012184635,0.00081473356,0.0005850354,0.18940364,0.000044591947],"about_ca_topic_score_codex":0.94286877,"about_ca_topic_score_gemma":0.9928663,"teacher_disagreement_score":0.05713123,"about_ca_system_score_codex":0.0055097598,"about_ca_system_score_gemma":0.011741978,"threshold_uncertainty_score":0.11493534},"labels":[],"label_agreement":null},{"id":"W7024532432","doi":"","title":"Ryman Hospitality Properties, Inc. Reports Third Quarter 2017 Results","year":2017,"lang":"en","type":"other","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Hospitality; Tourism","score_opus":0.024470290039994957,"score_gpt":0.23547163383498587,"score_spread":0.21100134379499091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024532432","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027319544,0.0049596657,0.033309802,0.01915795,0.012888893,0.00047252647,0.014587477,0.005093994,0.9067977],"genre_scores_gemma":[0.029102013,0.009934761,0.021659113,0.0029519792,0.0036882749,0.00046191012,0.024261279,0.0036464387,0.9042944],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934269,0.00080500456,0.00027751556,0.00064084196,0.004097784,0.0007520589],"domain_scores_gemma":[0.9847985,0.0031590804,0.00052987016,0.0038647547,0.0060415654,0.0016062155],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008478778,0.0027131797,0.0012443666,0.0052961847,0.0019173322,0.006727802,0.00254404,0.0020799944,0.37894094],"category_scores_gemma":[0.022768369,0.000508951,0.0015603431,0.0039902367,0.0016441153,0.004032183,0.0048145894,0.0039624507,0.27761018],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014956028,0.00023385228,0.00044443816,0.0002692496,0.000039690614,0.00010046941,0.000030290668,0.0014617705,0.00073441264,0.030999208,0.8424024,0.12313454],"study_design_scores_gemma":[0.000046584904,0.00006188259,0.0005932867,0.00022631977,0.00003442085,0.00015415765,0.000090846304,0.0031843705,0.004632039,0.02148,0.9694678,0.000028271184],"about_ca_topic_score_codex":0.0043426375,"about_ca_topic_score_gemma":0.009395927,"teacher_disagreement_score":0.37894094,"about_ca_system_score_codex":0.0034782272,"about_ca_system_score_gemma":0.005495661,"threshold_uncertainty_score":0.8858654},"labels":[],"label_agreement":null},{"id":"W7028315897","doi":"","title":"Estimation of sparse channels in IR-UWB systems","year":2014,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Compressed sensing; Ultra-wideband; Nyquist rate; Wireless; Channel (broadcasting); Bandwidth (computing); Multipath propagation; Pulse-position modulation; Filter (signal processing); Orthogonal frequency-division multiplexing","score_opus":0.015840310967447455,"score_gpt":0.23059830470991055,"score_spread":0.2147579937424631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028315897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019220239,0.0006250571,0.9769701,0.00017852102,0.000051616167,0.000018626602,0.000083903724,0.00012202031,0.0027300501],"genre_scores_gemma":[0.73663586,0.003355492,0.24969566,0.00015478178,0.00033130214,0.00010777065,0.00058714015,0.000072949435,0.009059017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996618,0.00007436176,0.000011698686,0.000063125,0.0001564337,0.000032625125],"domain_scores_gemma":[0.9993351,0.0004220792,0.00007639198,0.000042211483,0.00010104612,0.000023167911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003564245,0.0004926487,0.00052409706,0.00040893073,0.00020174589,0.0005314299,0.00046031072,0.0005816266,0.0012239721],"category_scores_gemma":[0.0018984347,0.0003214819,0.0002049096,0.0005974729,0.0006525441,0.00070148084,0.0006014233,0.00073535176,0.00032190912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009690078,0.000040704974,0.0010138359,0.0001774512,0.000032977223,0.00019849499,0.00015748436,0.83597386,0.011474219,0.030517107,0.0019790328,0.118338],"study_design_scores_gemma":[0.0000063232733,0.000028872591,0.00051032193,0.000021762191,0.0000056604586,0.00007685089,0.000038241033,0.9834041,0.0022695677,0.01220146,0.0014217119,0.000015141513],"about_ca_topic_score_codex":0.0016862032,"about_ca_topic_score_gemma":0.0016017671,"teacher_disagreement_score":0.0016862032,"about_ca_system_score_codex":0.00029311673,"about_ca_system_score_gemma":0.000349914,"threshold_uncertainty_score":0.0040946007},"labels":[],"label_agreement":null},{"id":"W7096307319","doi":"","title":"Canada (2013)&amp;quot; DICTIONARY LEARNING FOR SPARSE DECOMPOSITION: A NEW CRITERION AND ALGORITHM","year":2013,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"K-SVD; Dictionary learning; Set (abstract data type); Decomposition; Sparse approximation; Function (biology); Task (project management); Sparse matrix; Matrix (chemical analysis)","score_opus":0.012272633021833904,"score_gpt":0.2242650541206799,"score_spread":0.211992421098846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096307319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043599685,0.0067916284,0.7738323,0.016967364,0.0040923306,0.00021634468,0.0029325036,0.0018827091,0.18892483],"genre_scores_gemma":[0.061636698,0.0064770295,0.5277925,0.0022318766,0.000845303,0.00016443623,0.0027271549,0.0007567718,0.3973682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991763,0.00008537918,0.00003839997,0.0001435954,0.0004918506,0.00006448632],"domain_scores_gemma":[0.9991628,0.00008923815,0.000040380597,0.00011424013,0.0005149661,0.00007842308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010650723,0.0005766703,0.00059839553,0.0014223143,0.0012630161,0.0029973397,0.0011192433,0.0017576279,0.034198835],"category_scores_gemma":[0.0022112222,0.00039140062,0.00040687068,0.0032040258,0.0019875425,0.0017618194,0.0013826624,0.0015344446,0.012910753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013347664,0.000032913977,0.00084276777,0.00016741708,0.00002794007,0.00019405688,0.000119949436,0.02226885,0.0034356276,0.1733251,0.28036508,0.5190868],"study_design_scores_gemma":[0.000045628614,0.00003230112,0.00110135,0.00012435336,0.000014109349,0.00023796066,0.00014979021,0.17817976,0.0062292567,0.071119145,0.74268466,0.00008159758],"about_ca_topic_score_codex":0.235786,"about_ca_topic_score_gemma":0.33697492,"teacher_disagreement_score":0.235786,"about_ca_system_score_codex":0.006552456,"about_ca_system_score_gemma":0.0076596593,"threshold_uncertainty_score":0.4688272},"labels":[],"label_agreement":null},{"id":"W70998339","doi":"10.1007/978-3-642-31295-3_9","title":"Max and Min Values of the Structural Similarity Function S(x,a) on the L 2 Sphere S R (a), a ∈ ℝ N","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Similarity (geometry); Function (biology); RADIUS; Lagrange multiplier; Computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization; Image (mathematics); Artificial intelligence","score_opus":0.016521054682169793,"score_gpt":0.212262273264803,"score_spread":0.1957412185826332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70998339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1655052,0.0015101524,0.8004264,0.0010046012,0.0001886581,0.000086124,0.0013486779,0.00083669706,0.02909359],"genre_scores_gemma":[0.6718714,0.0014063471,0.30705902,0.00016498953,0.00026903418,0.00024233232,0.0011350898,0.00052151,0.017330194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952614,0.00012566969,0.00003401828,0.00012405832,0.00015228528,0.00003778535],"domain_scores_gemma":[0.9989385,0.0005117835,0.000114258066,0.00014443904,0.00018085969,0.00011023619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011311565,0.000712684,0.0008247037,0.0009582923,0.00035390642,0.0016966664,0.00073097897,0.00076708733,0.004242983],"category_scores_gemma":[0.005149305,0.00026862035,0.000385729,0.0006067074,0.0013639228,0.0021239503,0.0011077669,0.00084697315,0.0010405796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013351255,0.00013959134,0.003912876,0.00081194786,0.000073416435,0.00023343401,0.00041152834,0.0884153,0.09275665,0.382546,0.012132575,0.4172314],"study_design_scores_gemma":[0.000033841698,0.0005004859,0.0097413035,0.00012481793,0.000033947268,0.0012011635,0.00032411638,0.5097125,0.056939457,0.4041142,0.01716152,0.00011267847],"about_ca_topic_score_codex":0.0002389421,"about_ca_topic_score_gemma":0.00044717305,"teacher_disagreement_score":0.004242983,"about_ca_system_score_codex":0.0005657328,"about_ca_system_score_gemma":0.0005348496,"threshold_uncertainty_score":0.0141941905},"labels":[],"label_agreement":null},{"id":"W7100311269","doi":"","title":"established in Montreal and Pisa, respectively. † Twenty patients","year":2016,"lang":"en","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Key (lock); MEDLINE; Public health; Telemedicine","score_opus":0.006883673385636172,"score_gpt":0.19638398476791488,"score_spread":0.1895003113822787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100311269","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059550885,0.099631436,0.010593144,0.2453581,0.11723147,0.0015035477,0.011352279,0.0012472189,0.45353186],"genre_scores_gemma":[0.29029295,0.05366947,0.0090267975,0.08651748,0.05185404,0.0007756047,0.002867728,0.00043528024,0.5045607],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994553,0.00008270332,0.000023342496,0.000112187154,0.0001425691,0.00018385],"domain_scores_gemma":[0.9981737,0.00026400742,0.00015208314,0.00007224503,0.0006490493,0.0006889019],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008201141,0.0010034675,0.0005391141,0.0012406897,0.0018569618,0.0013447368,0.0011071344,0.0021420605,0.048328754],"category_scores_gemma":[0.0021900826,0.0004178283,0.00034560935,0.0014142394,0.0015039486,0.0008410032,0.0011063294,0.0033031115,0.009517162],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075445615,0.00021432535,0.015317786,0.0006342467,0.00010702087,0.011521673,0.0002963687,0.00044712416,0.002798102,0.0060081696,0.7723172,0.18958351],"study_design_scores_gemma":[0.00052598654,0.00023895862,0.039172817,0.00065214327,0.000048100224,0.0059936903,0.00059869094,0.00033449175,0.0014834526,0.0014218264,0.9494347,0.00009509433],"about_ca_topic_score_codex":0.10269371,"about_ca_topic_score_gemma":0.31429702,"teacher_disagreement_score":0.95167124,"about_ca_system_score_codex":0.005055775,"about_ca_system_score_gemma":0.0063959584,"threshold_uncertainty_score":0.20419192},"labels":[],"label_agreement":null},{"id":"W7139528634","doi":"","title":"Optimized Self-Supervised Learning for MRI Reconstruction","year":2025,"lang":"","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Artificial neural network; Set (abstract data type); Deep learning; Key (lock); Pattern recognition (psychology); Disjoint sets; Semi-supervised learning; Iterative reconstruction","score_opus":0.01179005106120595,"score_gpt":0.22917381242957985,"score_spread":0.2173837613683739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139528634","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013270395,0.00019115106,0.9847868,0.0001416052,0.000022172992,0.000026556232,0.000042394746,0.00047515176,0.0010438346],"genre_scores_gemma":[0.4490638,0.00043444982,0.54296917,0.00023120869,0.00008317466,0.00018255069,0.00047806054,0.00030498073,0.0062525165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994966,0.00015769232,0.00002379284,0.00013947774,0.00014098464,0.000041511517],"domain_scores_gemma":[0.9985965,0.00072268536,0.00014113926,0.0002108767,0.00028560555,0.000043118092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011660996,0.00063641684,0.00068021554,0.00037222265,0.0003094073,0.0006055278,0.000888151,0.0008575717,0.0013696111],"category_scores_gemma":[0.0033876158,0.00044169312,0.00060699024,0.00037552684,0.0008162996,0.0009410093,0.0009400952,0.0015011308,0.00051878166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015819447,0.00012667826,0.0009787963,0.0001376738,0.00008848249,0.000057069785,0.00014295457,0.7669173,0.013566198,0.014191984,0.0042182575,0.19941643],"study_design_scores_gemma":[0.0000037975726,0.000014343855,0.000076801836,0.0000036124106,0.0000027182562,0.000009610632,0.00000405896,0.9947566,0.0018704141,0.0029395213,0.00031550103,0.000003191193],"about_ca_topic_score_codex":0.002152615,"about_ca_topic_score_gemma":0.0033841275,"teacher_disagreement_score":0.002152615,"about_ca_system_score_codex":0.00072998874,"about_ca_system_score_gemma":0.0010285769,"threshold_uncertainty_score":0.006167054},"labels":[],"label_agreement":null},{"id":"W7140889292","doi":"10.1109/ieeeconf67917.2025.11443847","title":"Large-scale Unlabeled Compressed Sensing via Bilinear Matrix Recovery","year":2025,"lang":"","type":"article","venue":"","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Matrix (chemical analysis); Compressed sensing; Bilinear interpolation; Pattern recognition (psychology); Compression (physics); Noise (video)","score_opus":0.008512310592972002,"score_gpt":0.25271048221236103,"score_spread":0.24419817161938903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140889292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034217404,0.00008214178,0.9954535,0.00012785044,0.000019717241,0.000018013669,0.000034939527,0.0001225973,0.0007194403],"genre_scores_gemma":[0.45897055,0.00045711998,0.53472805,0.0003802758,0.00017379348,0.00017442294,0.00046680716,0.00010653236,0.0045425096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888676,0.0004200547,0.000038210303,0.00021246752,0.00035720706,0.0000852147],"domain_scores_gemma":[0.9985207,0.00081557315,0.00016445793,0.00024466027,0.00018354571,0.00007107985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012214658,0.00086760183,0.00083012064,0.0004394846,0.00050254795,0.0008978778,0.0010826596,0.0009437815,0.0017097081],"category_scores_gemma":[0.0048813317,0.00040306672,0.0004872834,0.00082964613,0.0012350314,0.001863533,0.0021344726,0.001430741,0.00046525788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002817789,0.00007969501,0.00073653954,0.00024917533,0.000047895388,0.0002163911,0.0002667091,0.6527673,0.014051296,0.14927171,0.0037447358,0.17828678],"study_design_scores_gemma":[0.000007294959,0.000029762823,0.000055070992,0.0000074232203,0.0000032887417,0.00005299273,0.000017901624,0.97417647,0.0020688241,0.022329947,0.0012416076,0.000009469631],"about_ca_topic_score_codex":0.0021971182,"about_ca_topic_score_gemma":0.0022673998,"teacher_disagreement_score":0.0021971182,"about_ca_system_score_codex":0.0005084533,"about_ca_system_score_gemma":0.0011127993,"threshold_uncertainty_score":0.0064597726},"labels":[],"label_agreement":null},{"id":"W761084866","doi":"10.1007/s11063-015-9432-7","title":"Dispersion Constraint Based Non-negative Sparse Coding Model","year":2015,"lang":"en","type":"article","venue":"Neural Processing Letters","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Constraint (computer-aided design); Pattern recognition (psychology); Computer science; Artificial intelligence; Class (philosophy); Image (mathematics); Coding (social sciences); Feature (linguistics); Computational intelligence; Algorithm; Mathematics; Statistics","score_opus":0.041477988754916185,"score_gpt":0.2459310601038101,"score_spread":0.20445307134889393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W761084866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013182489,0.00030201674,0.9755579,0.0005441979,0.00007996887,0.000022228145,0.00024183864,0.00008487529,0.009984468],"genre_scores_gemma":[0.8057284,0.0014546866,0.1562926,0.00055927795,0.00018191562,0.00018563984,0.0009336806,0.00012588735,0.034537967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997043,0.000083478626,0.0000111407,0.000054982705,0.00011893776,0.0000271652],"domain_scores_gemma":[0.999328,0.0003128532,0.00007994835,0.000084759944,0.00016144021,0.00003302638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004562065,0.0004863173,0.0006177771,0.0003681182,0.00024786495,0.00076337124,0.0013746172,0.001174641,0.002722088],"category_scores_gemma":[0.0017822048,0.00022411146,0.00025585465,0.00081207365,0.0009596586,0.001473038,0.00075299543,0.0012409366,0.0006451452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102067934,0.00004676269,0.0003653043,0.00014160691,0.000029784276,0.00019860321,0.000084387204,0.60354745,0.0077000298,0.3553553,0.00487493,0.02755377],"study_design_scores_gemma":[0.0000046196683,0.000008693093,0.000059209855,0.000004355711,0.0000032210125,0.00003579036,0.0000049388123,0.97936773,0.00041646644,0.019455723,0.0006311082,0.000008146135],"about_ca_topic_score_codex":0.0022495321,"about_ca_topic_score_gemma":0.0022170213,"teacher_disagreement_score":0.002722088,"about_ca_system_score_codex":0.0004727465,"about_ca_system_score_gemma":0.0005929001,"threshold_uncertainty_score":0.009106278},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05359949354869539,"score_gpt":0.3679154265439329,"score_spread":0.3143159329952375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W765936379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004814053,0.065055124,0.84993565,0.0016162215,0.0020389487,0.00007259325,0.0010687499,0.0005047103,0.074894],"genre_scores_gemma":[0.16609259,0.08786674,0.6053754,0.0011860662,0.003698126,0.000468201,0.0033165691,0.00057840586,0.131418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989165,0.00021858429,0.000087054934,0.00024803003,0.0004825616,0.0000473631],"domain_scores_gemma":[0.998642,0.00054003287,0.00011851873,0.00018555447,0.00045784883,0.000055967677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336766,0.0013319757,0.0013597109,0.0028153264,0.0005892509,0.002426524,0.001492337,0.0012686265,0.012038752],"category_scores_gemma":[0.0042833467,0.00048010613,0.00064740353,0.0063717044,0.0012889679,0.002652068,0.0019356948,0.0024396079,0.0066105407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002942491,0.000042203617,0.00025735583,0.00040722504,0.000033921715,0.000086208594,0.00012334475,0.018472943,0.0010270396,0.5981322,0.040461417,0.34092668],"study_design_scores_gemma":[0.000010864804,0.00004971635,0.0005393451,0.00015852711,0.000024005356,0.00069137145,0.00013446581,0.0882334,0.0013305985,0.7378738,0.17090313,0.00005079642],"about_ca_topic_score_codex":0.0015898683,"about_ca_topic_score_gemma":0.0013949005,"teacher_disagreement_score":0.012038752,"about_ca_system_score_codex":0.0010390566,"about_ca_system_score_gemma":0.0007499477,"threshold_uncertainty_score":0.040273607},"labels":[],"label_agreement":null},{"id":"W793298464","doi":"10.1109/glocom.2014.7417132","title":"Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undersampling; Compressed sensing; Wideband; Nyquist rate; Cognitive radio; Computer science; Block (permutation group theory); Electronic engineering; Nyquist–Shannon sampling theorem; Signal-to-noise ratio (imaging); Spectrum (functional analysis); Algorithm; Sampling (signal processing); Telecommunications; Mathematics; Wireless; Engineering; Physics; Detector","score_opus":0.04200556769959409,"score_gpt":0.27493841623434945,"score_spread":0.23293284853475535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W793298464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053575076,0.0002491632,0.94455254,0.00011810305,0.000029783854,0.000030900388,0.000027931248,0.00012953022,0.0012869866],"genre_scores_gemma":[0.8107348,0.000219931,0.1877959,0.00011567321,0.000042599724,0.000035292236,0.000048512436,0.000013024795,0.0009943182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00011458122,0.000014732085,0.000056872508,0.00021408386,0.000034543576],"domain_scores_gemma":[0.9989981,0.00062843115,0.00012456311,0.00010492988,0.000111713045,0.00003230245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045318462,0.00032558915,0.00036036683,0.00029138784,0.0002117868,0.00035028177,0.00046195733,0.00044375684,0.0005303179],"category_scores_gemma":[0.0023323682,0.00014370821,0.000113785645,0.00029736562,0.00070142635,0.00080024375,0.0007102573,0.00050329097,0.00010763411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012810963,0.00019317595,0.0029959136,0.00037544454,0.000060668088,0.00070490636,0.00056028046,0.24604051,0.32698643,0.081358194,0.0024320337,0.33701125],"study_design_scores_gemma":[0.000019676865,0.00020197574,0.0004436649,0.000017743101,0.000010079842,0.00032638464,0.000053062424,0.96186894,0.02757665,0.0084324675,0.0010325606,0.000016729604],"about_ca_topic_score_codex":0.0005939923,"about_ca_topic_score_gemma":0.001069675,"teacher_disagreement_score":0.0005939923,"about_ca_system_score_codex":0.00018919048,"about_ca_system_score_gemma":0.00029780227,"threshold_uncertainty_score":0.0023967028},"labels":[],"label_agreement":null},{"id":"W98825195","doi":"","title":"Parallel Compressed Sensing Reconstruction","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Compressed sensing; Computer science; Diagonal; Basis (linear algebra); SIGNAL (programming language); Algorithm; Matrix (chemical analysis); Decoding methods; Signal reconstruction; Projection (relational algebra); Permutation (music); Iterative reconstruction; Block (permutation group theory); Computational complexity theory; Parallel computing; Signal processing; Computer vision; Mathematics; Computer hardware","score_opus":0.06176833597902959,"score_gpt":0.16833537842401203,"score_spread":0.10656704244498244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W98825195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093875,0.00031128337,0.983942,0.0002573198,0.00010741815,0.00006538432,0.000105007195,0.0005609495,0.0052632494],"genre_scores_gemma":[0.28770742,0.00075630296,0.70041424,0.00041134114,0.00020111889,0.00017962075,0.0006523104,0.00014951304,0.009528216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993017,0.000120922174,0.000030615196,0.00016100085,0.00032008463,0.00006570106],"domain_scores_gemma":[0.99941134,0.00014487805,0.000048101352,0.0002134724,0.00015623114,0.000025970248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004931895,0.00077658857,0.00080744777,0.0005362649,0.0004942997,0.0008093644,0.0008966663,0.0009081829,0.0037720397],"category_scores_gemma":[0.0013826789,0.0003628361,0.0005197718,0.00071637984,0.0006701739,0.0014075796,0.0011981318,0.0010825028,0.0013691143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007795962,0.00022272812,0.0011904679,0.00035365697,0.00015667907,0.00055189757,0.0002030856,0.22688703,0.12934601,0.13549568,0.010496406,0.49431676],"study_design_scores_gemma":[0.000044966644,0.00016311665,0.00029551235,0.000022159431,0.00003603165,0.0005610109,0.000038038066,0.91980934,0.037391953,0.025609646,0.015994294,0.00003389819],"about_ca_topic_score_codex":0.0013806939,"about_ca_topic_score_gemma":0.0021383648,"teacher_disagreement_score":0.0037720397,"about_ca_system_score_codex":0.0005196133,"about_ca_system_score_gemma":0.00080287544,"threshold_uncertainty_score":0.01261878},"labels":[],"label_agreement":null}]}