{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008096365,0.00035167503,0.98529905,0.0012256062,0.0001769718,0.0008625239,0.000003393364,0.0004309486,0.0035534396],"genre_scores_gemma":[0.5678732,0.0000031696682,0.4314531,0.00028865985,0.00022401604,0.000114719616,7.718379e-7,0.000025998264,0.000016399434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838746,0.000047901172,0.00029235613,0.00031504186,0.00042943022,0.0005277883],"domain_scores_gemma":[0.9988539,0.00021593773,0.00015627402,0.0001589372,0.00035498085,0.00025995364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013272282,0.00021432183,0.00024050365,0.0003238439,0.00046161067,0.0006191474,0.00036162735,0.000021150257,0.0000014950804],"category_scores_gemma":[0.0001262833,0.00016736788,0.00006446915,0.00052450725,0.00012406298,0.0005420138,0.000034494784,0.00030611962,0.000004064604],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002104071,0.00019521083,0.00715945,0.000055913646,0.00014418899,0.00011450714,0.0041615167,0.07018983,0.018965518,0.007948359,0.006513739,0.88434136],"study_design_scores_gemma":[0.0021496303,0.0011117106,0.00069815957,0.0010504097,0.00016362043,0.0021425823,0.013547124,0.79071146,0.056666236,0.009971176,0.1202641,0.0015238082],"about_ca_topic_score_codex":0.000012366835,"about_ca_topic_score_gemma":0.0000020641812,"teacher_disagreement_score":0.88281757,"about_ca_system_score_codex":0.00013321928,"about_ca_system_score_gemma":0.00014077722,"threshold_uncertainty_score":0.6825064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99129266,0.00024111246,0.00017053417,0.0006983449,0.00025716616,0.00047018338,0.00005616449,0.00036103072,0.0064528156],"genre_scores_gemma":[0.9418062,0.000082639825,0.05755446,0.000030799532,0.00020268168,0.00008092832,0.000009070255,0.00008207633,0.00015113941],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979507,2.0173854e-8,0.0006616198,0.00031559597,0.0007002625,0.00037184294],"domain_scores_gemma":[0.99746263,0.00007738233,0.00024154714,0.000096133816,0.0019644608,0.00015784192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005679254,0.00033684814,0.00050380244,0.000079924,0.000041568903,0.00007468878,0.00084537704,0.00021425636,0.0000072832154],"category_scores_gemma":[0.00036255972,0.0002496672,0.00041925765,0.00031615084,0.0002873932,0.00045604815,0.00015309008,0.00030718406,0.0000010362616],"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.00008550505,0.00014004481,0.00045963263,0.00042325314,0.0003531483,8.3608306e-8,0.00035882567,0.00032571566,0.8628788,0.088409275,0.046336897,0.00022881673],"study_design_scores_gemma":[0.0007515625,0.00028262247,0.00015814615,0.00031362855,0.00010616578,0.000010049417,0.0008786883,0.069391355,0.9134145,0.001562071,0.012735613,0.000395637],"about_ca_topic_score_codex":0.00002712004,"about_ca_topic_score_gemma":2.2769719e-7,"teacher_disagreement_score":0.0868472,"about_ca_system_score_codex":0.00019388263,"about_ca_system_score_gemma":0.000038580583,"threshold_uncertainty_score":0.9999955},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42266926,0.000089479916,0.57569295,0.00004915763,0.00009844411,0.000102624006,0.000008628421,0.00024057891,0.0010488409],"genre_scores_gemma":[0.5367766,0.0000021126853,0.46312463,0.000018728073,0.00002211295,0.0000011438389,0.000035691453,0.000012856469,0.0000061107276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992948,0.000016224665,0.00029526133,0.000084244995,0.00021699801,0.00009242985],"domain_scores_gemma":[0.9991731,0.00029601314,0.000070033384,0.00012003492,0.00028088235,0.000059960068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011254474,0.000107303276,0.00017830865,0.00012437276,0.00005518911,0.00003972167,0.00005961961,0.000039261413,0.000007740046],"category_scores_gemma":[0.00007372007,0.000113292954,0.000028594312,0.00012332128,0.000068019515,0.000095194686,0.000038546492,0.000063830485,0.0000074584004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035414678,0.000029338997,0.00003515622,0.000036683286,0.00004730486,9.429583e-7,0.00042086645,0.97066426,0.0012808722,0.025712078,0.0007336772,0.0010352454],"study_design_scores_gemma":[0.00024545545,0.000013369558,0.00016012408,0.00006773299,0.00001679421,0.000024767282,0.00004530666,0.80116445,0.0010582841,0.19670826,0.00038938195,0.0001060498],"about_ca_topic_score_codex":0.00000753939,"about_ca_topic_score_gemma":0.000001677829,"teacher_disagreement_score":0.17099619,"about_ca_system_score_codex":0.000021749944,"about_ca_system_score_gemma":0.000036618116,"threshold_uncertainty_score":0.46199524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99114585,0.000100080215,0.0067542214,0.00013175517,0.0003096538,0.00043859892,0.00016073283,0.00022210625,0.0007369975],"genre_scores_gemma":[0.68690413,0.000029206918,0.31274173,0.00001995287,0.00021780457,0.000009155684,0.000019003277,0.00004693306,0.000012107058],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789727,3.9168423e-8,0.0007916613,0.00037026347,0.00057970505,0.00036106465],"domain_scores_gemma":[0.99781775,0.00014777228,0.00032730217,0.00013100286,0.0014463171,0.00012985602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045686538,0.0003253908,0.0005221532,0.00012672888,0.0000637772,0.000099267236,0.00081496255,0.0002254536,0.000005567626],"category_scores_gemma":[0.0004335037,0.00030906242,0.00036577226,0.00020746236,0.00025248874,0.0007710736,0.00019323674,0.0003466631,3.6585024e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029303966,0.00007052313,0.0002946981,0.00022838918,0.00049451855,3.0136997e-7,0.00018578442,0.09681667,0.8745025,0.024321597,0.0024784855,0.00031350995],"study_design_scores_gemma":[0.0012952795,0.00006459521,0.00007270985,0.00022312674,0.00008467419,0.0000393706,0.00020835684,0.6874395,0.3088784,0.0014298946,0.000058243862,0.00020584262],"about_ca_topic_score_codex":0.000031494837,"about_ca_topic_score_gemma":4.909313e-7,"teacher_disagreement_score":0.59062284,"about_ca_system_score_codex":0.00014840304,"about_ca_system_score_gemma":0.00004968949,"threshold_uncertainty_score":0.99993616},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19721535,0.0010044258,0.8005122,0.000028998165,0.000020081743,0.00014770651,0.00009401069,0.00014342394,0.00083382917],"genre_scores_gemma":[0.97597647,0.0005362861,0.023139466,0.000020760795,0.000026167023,0.000020641402,0.0002466316,0.000023271095,0.000010338462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990801,0.000018585095,0.00026846604,0.0003149047,0.00018890461,0.00012901436],"domain_scores_gemma":[0.99933815,0.00015497628,0.0001638365,0.00017739546,0.000118466385,0.000047161186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062856445,0.00022172126,0.000486481,0.00028312046,0.000056918703,0.000051670508,0.00009136344,0.00011503805,0.000014349018],"category_scores_gemma":[0.0000024445558,0.0001817821,0.00006943166,0.00021960806,0.00010245282,0.00004379364,0.00012586267,0.00013667878,6.036577e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031589814,0.000014087838,0.0007352958,0.00007879502,0.0018749508,0.0000014337945,0.00007730187,0.9872667,0.00046301977,0.005715467,0.00015893987,0.0035824177],"study_design_scores_gemma":[0.00052164047,0.000041514308,0.02428231,0.00032420678,0.0023166223,0.000005205482,0.00011438946,0.87899953,0.003840878,0.08879996,0.000087857006,0.0006658883],"about_ca_topic_score_codex":0.000042273197,"about_ca_topic_score_gemma":0.000009934776,"teacher_disagreement_score":0.7787611,"about_ca_system_score_codex":0.000023931934,"about_ca_system_score_gemma":0.00003209127,"threshold_uncertainty_score":0.7412859},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5656367,0.0008985684,0.4241517,0.00016547991,0.002593858,0.0014793837,0.00017580706,0.002370308,0.0025282027],"genre_scores_gemma":[0.9901227,0.0002582712,0.008402203,0.00001092097,0.00030840628,0.0000031828706,0.00019061168,0.00006082375,0.0006428862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989121,0.00003430913,0.00017888131,0.0004907564,0.00008089315,0.00030304887],"domain_scores_gemma":[0.99867016,0.000095940755,0.00014335335,0.000724926,0.00018072932,0.00018488376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007693697,0.00034402148,0.0003757872,0.00012422193,0.00013726551,0.000039466002,0.0002781442,0.00031716176,0.00004396195],"category_scores_gemma":[0.000022486145,0.00036853418,0.00017938214,0.0002136022,0.00012235797,0.00018172889,0.00015799943,0.00040161706,0.000014983567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020410533,0.00030456003,0.0008814947,0.00067352614,0.0028453676,0.00010066537,0.0005815911,0.9051873,0.0027507597,0.054068808,0.02868277,0.0018820689],"study_design_scores_gemma":[0.015921576,0.0010800052,0.0045785382,0.0042543383,0.007210042,0.00013452783,0.0016164593,0.6502041,0.06307025,0.08513826,0.1577667,0.009025197],"about_ca_topic_score_codex":0.00013382778,"about_ca_topic_score_gemma":0.000031078558,"teacher_disagreement_score":0.424486,"about_ca_system_score_codex":0.0002210473,"about_ca_system_score_gemma":0.00015349357,"threshold_uncertainty_score":0.9998767},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007964411,0.0019218504,0.9609521,0.000046299556,0.00012302303,0.0025326116,0.000036762012,0.0007911846,0.03351654],"genre_scores_gemma":[0.034501188,0.02335476,0.8912195,0.00040157614,0.0008275561,0.006747754,0.00035975577,0.0007751379,0.04181277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992179,0.0000020894502,0.00020592782,0.0002959608,0.00009763907,0.00018045197],"domain_scores_gemma":[0.9995012,0.000026346575,0.00004762771,0.00018918594,0.00015862541,0.000076964556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001396396,0.0001845648,0.00017313007,0.00033199548,0.0000810634,0.000061673905,0.00012459225,0.00013372478,0.000007898158],"category_scores_gemma":[0.00002047562,0.00020916748,0.000018559967,0.00017532155,0.00006555673,0.000153199,0.000064773165,0.00014606738,0.000002152896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038856333,0.00005379181,0.000013262453,0.0007801243,0.000064036445,0.0000011860329,0.00094366603,0.9166308,0.004425404,0.059109963,0.0044555576,0.013518298],"study_design_scores_gemma":[0.00014526045,0.00001310386,0.000016434045,0.00016012206,0.000019876106,0.0000034877637,0.000005942858,0.9410288,0.0011084124,0.0007980591,0.056412388,0.00028811354],"about_ca_topic_score_codex":0.0000027469316,"about_ca_topic_score_gemma":0.0000038763337,"teacher_disagreement_score":0.069732584,"about_ca_system_score_codex":0.000095325304,"about_ca_system_score_gemma":0.00006216276,"threshold_uncertainty_score":0.8529602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7942027,0.00012027523,0.1252105,0.000029150373,0.00006515151,0.00029577795,0.000001310146,0.00046527357,0.07960987],"genre_scores_gemma":[0.9716449,0.000013049335,0.028239561,0.000046905683,0.000016616417,0.0000025528873,7.9971954e-7,0.0000165877,0.000019076459],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99937594,0.00003384677,0.0001667323,0.00011402411,0.00013357903,0.00017587827],"domain_scores_gemma":[0.99950707,0.0000700216,0.00002951221,0.0003325914,0.000041233576,0.000019575375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109637585,0.000116821444,0.00015090383,0.00008923486,0.000022848397,0.000013908606,0.0002037309,0.000042181422,0.000017329518],"category_scores_gemma":[0.00000808159,0.000077184646,0.000024961133,0.00021894324,0.000056819204,0.000086335494,0.00003099757,0.00013183132,0.0000027766687],"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.00027209148,0.0005276519,0.034957163,0.0005440455,0.00043560908,0.00093951856,0.07006513,0.04066102,0.77241087,0.009645074,0.01396467,0.05557714],"study_design_scores_gemma":[0.00053606293,0.00010533331,0.031004645,0.000765766,0.000025089239,0.00008895215,0.0021795807,0.31688422,0.64505357,0.0018247612,0.0009999382,0.0005321183],"about_ca_topic_score_codex":0.00034397328,"about_ca_topic_score_gemma":0.000057900696,"teacher_disagreement_score":0.27622318,"about_ca_system_score_codex":0.0000081933895,"about_ca_system_score_gemma":0.0000065889285,"threshold_uncertainty_score":0.31474984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13002354,0.00022914512,0.84971976,0.00007944855,0.00043885273,0.00029134165,0.0000045820952,0.0025709192,0.016642429],"genre_scores_gemma":[0.8111081,0.000003638659,0.18854523,0.000081050835,0.000095242154,0.000003774111,0.000010789482,0.000034364617,0.00011780606],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993834,0.000012757289,0.00014183809,0.00013083126,0.00011309268,0.000218107],"domain_scores_gemma":[0.9995102,0.0000459535,0.000017327468,0.00021795156,0.00010115292,0.00010737167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000706315,0.00013361836,0.00016278846,0.000036060395,0.000060366663,0.0000713032,0.00009599931,0.00007092566,0.00000888183],"category_scores_gemma":[0.000015922205,0.00012208342,0.000048923397,0.00006170879,0.00004210972,0.000087995475,0.000036084082,0.00008080005,0.00001792375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008691339,0.000039005503,0.000100380705,0.00003614351,0.00007274537,0.000017627368,0.00052372523,0.42324513,0.08833077,0.0010104268,0.45711157,0.029425548],"study_design_scores_gemma":[0.0003539228,0.000034760797,0.000022286495,0.000034674264,0.000008860671,0.000009534723,0.00004622515,0.82054293,0.12354415,0.0006559099,0.05458304,0.0001637345],"about_ca_topic_score_codex":0.00002137136,"about_ca_topic_score_gemma":0.0000028643428,"teacher_disagreement_score":0.6810846,"about_ca_system_score_codex":0.000027447039,"about_ca_system_score_gemma":0.0000135181845,"threshold_uncertainty_score":0.49784175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181673,0.000049097587,0.06420516,0.00024478658,0.0003128,0.00074420206,0.0000036799354,0.00072877883,0.015544177],"genre_scores_gemma":[0.9978276,0.000010530404,0.0018303338,0.00010841623,0.00006307631,0.00008768126,0.00004021013,0.000018080937,0.000014062119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921924,0.000055905817,0.00022868169,0.00022125056,0.00013512198,0.00013979977],"domain_scores_gemma":[0.99953556,0.000076753444,0.000031619787,0.00026999976,0.00002974183,0.000056298668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017476447,0.00011381719,0.000121682504,0.00040962856,0.000011023078,0.000027393571,0.000079196856,0.00012303487,0.000005070113],"category_scores_gemma":[0.00013004983,0.00012232887,0.000017760516,0.0004996783,0.000014776842,0.00012119176,0.0000066707257,0.00018588104,0.000013304214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042206584,0.00033338452,0.057712603,0.000031754487,0.000008576109,0.00001959888,0.0008431485,0.5874403,0.29283017,0.00061464694,0.004018634,0.055725127],"study_design_scores_gemma":[0.00096308347,0.000032955613,0.23777857,0.00007795229,0.0000033665979,0.0000035937871,0.00013872159,0.56852007,0.19111472,0.0007676968,0.0003965087,0.00020273616],"about_ca_topic_score_codex":0.0007783338,"about_ca_topic_score_gemma":0.0024263856,"teacher_disagreement_score":0.18006597,"about_ca_system_score_codex":0.00024348928,"about_ca_system_score_gemma":0.000025677853,"threshold_uncertainty_score":0.49884266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008480945,0.0003953837,0.98610103,0.00017330384,0.00017419961,0.00026078592,0.0000043644873,0.000647191,0.0037627784],"genre_scores_gemma":[0.7686248,0.000018842997,0.23083381,0.00007403958,0.00019679517,0.00002433601,0.0000015212967,0.000027166147,0.00019872173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949884,0.0000055327023,0.00016805717,0.00008688917,0.000068665315,0.00017200355],"domain_scores_gemma":[0.99958134,0.0001400821,0.000023815443,0.00019614237,0.00003774322,0.000020898398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008417752,0.000095488285,0.00011480607,0.00003749772,0.00005069322,0.00001849139,0.00013699612,0.00004240552,0.000019815805],"category_scores_gemma":[0.000011896332,0.00007033846,0.00006927393,0.00006236566,0.000018549345,0.000058091595,0.00003321893,0.00005989734,0.000003597467],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056261892,0.000015136305,0.000014198876,0.000023294993,0.00007412948,0.0000011025472,0.00043951883,0.023711124,0.015770009,0.00013921766,0.009899219,0.9499074],"study_design_scores_gemma":[0.00012609422,0.000016282178,0.000025944568,0.00003081176,0.000013696017,0.000004338878,0.00012953697,0.9004624,0.084123604,0.00006367703,0.0149145415,0.000089115936],"about_ca_topic_score_codex":0.000017454919,"about_ca_topic_score_gemma":0.00002377668,"teacher_disagreement_score":0.9498183,"about_ca_system_score_codex":0.00001692992,"about_ca_system_score_gemma":0.000004629245,"threshold_uncertainty_score":0.2868319},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04598993,0.0012383962,0.32779345,0.004776296,0.009539499,0.0007968053,0.00019955495,0.005461277,0.6042048],"genre_scores_gemma":[0.96162736,0.00046222037,0.036376465,0.00017626754,0.0004920686,0.000014289046,0.00080369285,0.000025813768,0.000021798709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991047,0.00004151177,0.00025447895,0.00020403042,0.00020761327,0.0001876971],"domain_scores_gemma":[0.99784786,0.00015134933,0.000080150254,0.0017329927,0.00013747292,0.00005019784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026851366,0.00014413276,0.00011332931,0.000109193476,0.00019484681,0.00026301353,0.0019659507,0.00008347986,0.00014537778],"category_scores_gemma":[0.00003348063,0.0001596197,0.000031802945,0.00018940878,0.000073604286,0.00035515914,0.000406729,0.0005515335,0.000031917756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003459914,0.00013031684,0.004429885,0.000009452079,0.0003678191,0.000009043383,0.0002646308,0.09749844,0.01108382,0.45946896,0.13481286,0.29189017],"study_design_scores_gemma":[0.000097957374,0.0000067558967,0.0008091302,0.00019252038,0.00001206268,0.000009952334,0.000015838974,0.89385384,0.0002882575,0.01449023,0.090014644,0.00020877986],"about_ca_topic_score_codex":0.000020784644,"about_ca_topic_score_gemma":0.00020137236,"teacher_disagreement_score":0.91563743,"about_ca_system_score_codex":0.00001917652,"about_ca_system_score_gemma":0.00001746117,"threshold_uncertainty_score":0.65091026},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042462137,0.00042719697,0.89927965,0.0006205703,0.0005865468,0.0018316709,0.00034263098,0.0018638688,0.052585747],"genre_scores_gemma":[0.50936544,0.0012180664,0.48264405,0.000050353774,0.0009936794,0.00023607619,0.0037518675,0.00017802342,0.0015624407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865484,0.000107566775,0.00015626878,0.0004058084,0.00041448115,0.00026101785],"domain_scores_gemma":[0.9973876,0.000032791875,0.00000755333,0.0019073562,0.0005953439,0.00006937516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042711178,0.00015464629,0.0001479231,0.00029004583,0.00022808678,0.0003964583,0.0008368198,0.00019022594,0.00021403754],"category_scores_gemma":[0.00007745068,0.00013932036,0.000015156938,0.00029054735,0.00015802568,0.00020030889,0.0011787907,0.00078220194,0.0001012401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044556027,0.0000149323405,0.000011378091,0.000019988813,0.000038478185,0.000007612186,0.000088956906,0.9313119,0.000277742,0.0000622857,0.0677627,0.00039956457],"study_design_scores_gemma":[0.00006763079,0.000032118507,0.000011877136,0.00016502393,0.0000100075795,0.000004252487,0.000031610594,0.9913926,0.0024986516,0.000065590015,0.005552979,0.00016765845],"about_ca_topic_score_codex":0.00028358924,"about_ca_topic_score_gemma":0.00074162416,"teacher_disagreement_score":0.4669033,"about_ca_system_score_codex":0.000092044276,"about_ca_system_score_gemma":0.00019666359,"threshold_uncertainty_score":0.5681319},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13260011,0.0001423157,0.8628014,0.000018642828,0.00004827398,0.00037375657,0.00034682077,0.00084101525,0.0028276527],"genre_scores_gemma":[0.99791086,0.0000011194796,0.0017749907,0.00005652765,0.00007791984,0.000009401264,0.00008947452,0.00005350902,0.000026219568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991914,0.000026466556,0.0002614654,0.00018100411,0.00013943242,0.00020020588],"domain_scores_gemma":[0.99933857,0.00017569728,0.00004650503,0.00026813467,0.000037541075,0.00013355257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066613815,0.00015656654,0.00021026247,0.00014136545,0.000056010012,0.00030123052,0.00011873966,0.000075664786,0.0000056377776],"category_scores_gemma":[0.000050438503,0.00016112061,0.00003643692,0.00021999858,0.000024343632,0.0005556536,0.00008366979,0.0001285344,0.000066851186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008793777,0.00015779631,0.005905184,0.00049335003,0.0001462558,0.000005452157,0.00014066821,0.8962298,0.010429389,0.011262972,0.002237586,0.072903626],"study_design_scores_gemma":[0.0002494723,0.000041014628,0.0005695854,0.00022782685,0.000017910945,0.000004715346,0.000019359848,0.9113685,0.003885881,0.0032434366,0.08004474,0.00032754298],"about_ca_topic_score_codex":0.0000013723756,"about_ca_topic_score_gemma":2.4584438e-7,"teacher_disagreement_score":0.8653107,"about_ca_system_score_codex":0.00000935913,"about_ca_system_score_gemma":0.0000058310043,"threshold_uncertainty_score":0.65703076},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9454398,0.0027799641,0.047171585,0.0013517928,0.00056932424,0.00040236133,0.0000053026115,0.0016342696,0.0006455946],"genre_scores_gemma":[0.992202,0.00082387414,0.0019758986,0.00476204,0.00018057761,0.000006014227,0.00000587282,0.000042790438,9.3196934e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991772,0.000030577445,0.00017802342,0.00018207214,0.00016457013,0.0002675486],"domain_scores_gemma":[0.9993906,0.00006758367,0.000037534566,0.00039010527,0.000029738358,0.000084463885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006366739,0.00019913189,0.0003326786,0.000046852187,0.000041566418,0.000029288203,0.00015559202,0.000011156767,0.000009945259],"category_scores_gemma":[0.000010456051,0.00017966515,0.00017702385,0.00020310412,0.000067030414,0.0000873985,0.000031300897,0.000386981,0.00005545662],"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.0000014849169,0.000017887507,0.000020077108,0.0002231881,0.000035225366,0.00001798817,0.000032860044,0.0004150702,0.9680808,0.00008560974,0.014715579,0.016354214],"study_design_scores_gemma":[0.0003563002,0.00005181674,0.0014235176,0.003206996,0.00021383933,0.000052590258,0.0000026617458,0.58239615,0.28576112,0.00527607,0.11976238,0.0014965435],"about_ca_topic_score_codex":0.000013607501,"about_ca_topic_score_gemma":0.00000240689,"teacher_disagreement_score":0.6823197,"about_ca_system_score_codex":0.000007821346,"about_ca_system_score_gemma":0.0000026027515,"threshold_uncertainty_score":0.73265326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2599119,0.00007357517,0.7362959,0.000008454222,0.00055661827,0.0006964637,0.00007205012,0.001441,0.000944067],"genre_scores_gemma":[0.97756135,0.00028498512,0.019891031,0.000044809094,0.00027250143,0.0000141221835,0.0001384569,0.000088213026,0.0017045323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889356,0.000038851147,0.00016409392,0.0005172579,0.000050945222,0.0003352782],"domain_scores_gemma":[0.9991565,0.00003451803,0.000088781846,0.00041944237,0.00019835035,0.00010245053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000064476466,0.00032682,0.00035011742,0.00020878743,0.0001026455,0.000078493285,0.00034975683,0.00038902555,0.00005890655],"category_scores_gemma":[0.0000061364976,0.00042225147,0.00021573172,0.0002245083,0.00004563219,0.000120167264,0.0001942422,0.00037339187,0.000036109835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004100076,0.00008744124,0.0003869804,0.00018976489,0.0006280256,0.000071556264,0.00012918773,0.91496086,0.002908521,0.0056051216,0.060091134,0.014900413],"study_design_scores_gemma":[0.0004165665,0.00004007513,0.00012335333,0.00007365359,0.00014875844,0.0000051850175,0.000019106858,0.9813165,0.004021351,0.01044122,0.0029239287,0.00047031368],"about_ca_topic_score_codex":0.00038690327,"about_ca_topic_score_gemma":0.00008590013,"teacher_disagreement_score":0.71764946,"about_ca_system_score_codex":0.00021619062,"about_ca_system_score_gemma":0.000038505787,"threshold_uncertainty_score":0.9998229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9707482,0.00031245433,0.02561881,0.000020842828,0.0006825535,0.00047776077,0.00015536322,0.000645259,0.0013387781],"genre_scores_gemma":[0.99537134,0.0011615376,0.0026957241,0.000024059993,0.00031483325,0.000076162,0.00025649564,0.000057495094,0.00004235953],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99883384,0.00005035781,0.00043857776,0.00030642116,0.0001668553,0.00020392935],"domain_scores_gemma":[0.99918836,0.000068570975,0.00015888792,0.00044744677,0.00009335592,0.00004339206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0000633535,0.0002689646,0.0003994166,0.00016704833,0.00005765611,0.000021252437,0.00019359792,0.00021620988,0.00014117599],"category_scores_gemma":[0.000009739653,0.00029266658,0.00019404473,0.00010636391,0.000042978158,0.00008920608,0.00015844936,0.00041448965,0.000026117326],"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.00045347246,0.00037146788,0.31740433,0.00039079855,0.0033955842,0.00017486242,0.005331013,0.21616332,0.30176407,0.000042517844,0.077640705,0.07686787],"study_design_scores_gemma":[0.0022413828,0.00013757241,0.14651261,0.00074574474,0.00037280237,0.000022108505,0.0005611488,0.011858392,0.83087814,0.0017988727,0.0036654256,0.0012057995],"about_ca_topic_score_codex":0.0016932791,"about_ca_topic_score_gemma":0.00015733372,"teacher_disagreement_score":0.52911407,"about_ca_system_score_codex":0.0000834557,"about_ca_system_score_gemma":0.00007035176,"threshold_uncertainty_score":0.99995255},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92001104,0.00033321572,0.028350333,0.0000850048,0.0011456081,0.00017671705,0.0000022269453,0.0026389826,0.04725685],"genre_scores_gemma":[0.9890903,0.000034658824,0.010497227,0.000074527416,0.00013608627,0.0000025429688,0.0000060204643,0.000031461514,0.00012714026],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992651,0.00002802194,0.0001781131,0.00017065716,0.00013760634,0.00022049797],"domain_scores_gemma":[0.9994352,0.00002188189,0.000030441008,0.00026717034,0.00011017061,0.00013514321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066224704,0.00016223501,0.00017334138,0.00012815082,0.00004036952,0.000040184845,0.000083262756,0.000088022294,0.000008037275],"category_scores_gemma":[0.000016210039,0.00015411747,0.000049958016,0.00014518504,0.000052514948,0.00012682247,0.000044497636,0.00014654348,0.00005789523],"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.00009313571,0.00009669492,0.0010159649,0.00004456563,0.000276571,0.0003545536,0.0016248407,0.045121524,0.1820874,0.0018980503,0.39244008,0.37494662],"study_design_scores_gemma":[0.0007289224,0.00014772937,0.00058484165,0.00020152528,0.000042902015,0.00073474966,0.00053076266,0.48504382,0.48078817,0.0043039923,0.026149083,0.0007434806],"about_ca_topic_score_codex":0.000043101176,"about_ca_topic_score_gemma":0.000010350448,"teacher_disagreement_score":0.4399223,"about_ca_system_score_codex":0.00008299925,"about_ca_system_score_gemma":0.000018025812,"threshold_uncertainty_score":0.6284728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.167237,0.00009496269,0.8010579,0.00019208256,0.00035032412,0.0007536834,0.00029438615,0.00029485958,0.029724801],"genre_scores_gemma":[0.9981041,0.00005262563,0.0015544688,0.00008424367,0.00007890142,0.000017857206,0.000061606755,0.000008590188,0.000037591966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992362,0.000032080035,0.00036399803,0.00006261256,0.00019849112,0.00010656757],"domain_scores_gemma":[0.9991702,0.00037478624,0.00014141745,0.00012851373,0.00011773468,0.00006735107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001195626,0.00010269834,0.00012367342,0.00015107726,0.000045634217,0.000025066904,0.000109874905,0.000059813658,0.000030739153],"category_scores_gemma":[0.000078375946,0.00008217376,0.00002650943,0.00012342389,0.000040155803,0.0003067106,0.000024771582,0.000092574104,0.000018266495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032293683,0.00013059462,0.000058433663,0.00009049894,0.00012019441,2.9795487e-7,0.00088159327,0.0070126327,0.019787598,0.92909724,0.0023027747,0.040195215],"study_design_scores_gemma":[0.0015470868,0.00042199777,0.0026130818,0.0004609895,0.00016352585,0.000041863976,0.00032056865,0.45936313,0.41773403,0.025858145,0.09074554,0.0007300509],"about_ca_topic_score_codex":0.0000055938954,"about_ca_topic_score_gemma":1.4015058e-7,"teacher_disagreement_score":0.9032391,"about_ca_system_score_codex":0.0000242279,"about_ca_system_score_gemma":0.000012952655,"threshold_uncertainty_score":0.3350949},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16966179,0.0029394848,0.7944271,0.0009044457,0.004229143,0.0039588446,0.00049833476,0.008174269,0.01520656],"genre_scores_gemma":[0.88003695,0.0004831316,0.114283346,0.0009460774,0.0013925165,0.0007920162,0.00023326692,0.0003619652,0.0014707171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850214,0.00002332132,0.00037335363,0.00033944793,0.00021388309,0.0005478526],"domain_scores_gemma":[0.998783,0.00013472496,0.00006945103,0.0006750526,0.00018921809,0.00014853613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012102748,0.00033861696,0.00036515127,0.00014500857,0.000117176394,0.00015150705,0.00036654205,0.0002304569,0.00015503928],"category_scores_gemma":[0.000041468902,0.000349208,0.00017930743,0.00018931167,0.000051024574,0.00043954537,0.000081587394,0.00025091096,0.00038929933],"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.000021328255,0.00006734959,0.00013100311,0.00008607314,0.00024603496,0.000037310376,0.00030642684,0.0024568394,0.02017161,0.00018293622,0.40950292,0.56679016],"study_design_scores_gemma":[0.0021017918,0.00042547373,0.0011789607,0.00044530997,0.00017446633,0.00012889065,0.00025434708,0.37518507,0.24519472,0.012952168,0.35965177,0.0023070048],"about_ca_topic_score_codex":0.00026370128,"about_ca_topic_score_gemma":0.000037026166,"teacher_disagreement_score":0.7103752,"about_ca_system_score_codex":0.000110304165,"about_ca_system_score_gemma":0.000034882145,"threshold_uncertainty_score":0.999896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9577794,0.00053827185,0.03856932,0.00001139226,0.00025074978,0.00027769094,0.000008673102,0.0005389971,0.0020254925],"genre_scores_gemma":[0.998844,0.00021305635,0.0006693284,0.0000022241986,0.000058624784,0.0000010784396,0.0000124066355,0.000031097505,0.00016815553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991752,0.00006366177,0.00016094488,0.0003468184,0.0000893638,0.00016400396],"domain_scores_gemma":[0.9990458,0.000011010333,0.00012878861,0.0004987065,0.00024256646,0.000073129064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121072146,0.00024471804,0.00037060183,0.00016707629,0.000046643,0.000020569454,0.0002570994,0.00019657277,0.000006031825],"category_scores_gemma":[0.000006305006,0.000218256,0.0000851711,0.00022521507,0.00013516833,0.00012972653,0.00018972195,0.0003020374,0.0000023056175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024918513,0.000031456904,0.00007540498,0.0001585187,0.00013562382,0.000036449565,0.00005971306,0.9962247,0.0018186909,0.0006074534,0.00053556304,0.000067239875],"study_design_scores_gemma":[0.0014133742,0.00008361742,0.00015437005,0.0015849192,0.0004317025,0.000027669483,0.00041286624,0.9174225,0.07356636,0.0039159344,0.00015695943,0.00082975504],"about_ca_topic_score_codex":0.00014096653,"about_ca_topic_score_gemma":0.000011614811,"teacher_disagreement_score":0.07880223,"about_ca_system_score_codex":0.000111911824,"about_ca_system_score_gemma":0.000075207136,"threshold_uncertainty_score":0.8900221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31287727,0.0009169851,0.59960496,0.0015852496,0.0006283547,0.0012673049,0.00013937432,0.0029573878,0.08002312],"genre_scores_gemma":[0.9410689,0.0013890297,0.055303633,0.00004627301,0.000045830624,0.00016789143,0.00040124194,0.000102379374,0.0014748375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558043,0.0025116624,0.00051024754,0.00065484364,0.0003439846,0.00039882585],"domain_scores_gemma":[0.9944387,0.0009477615,0.00035674166,0.00215282,0.0019263898,0.00017757302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017818814,0.00044023345,0.0004141176,0.00021857698,0.00026629862,0.00051539124,0.0007828747,0.00051463937,0.000063759195],"category_scores_gemma":[0.00070883054,0.00049363263,0.0002076658,0.00023651104,0.00022463503,0.00015420276,0.0006318364,0.0011774085,0.00015011695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037763,0.0011966021,0.003987794,0.0005369079,0.0011655526,0.000036992824,0.03428201,0.010846647,0.09893037,0.08342837,0.053864744,0.71168625],"study_design_scores_gemma":[0.00034490498,3.05386e-7,0.010060746,0.0014549635,0.00009846637,0.000009448523,0.00017675465,0.7468756,0.21627244,0.0058179977,0.01810882,0.00077957945],"about_ca_topic_score_codex":0.0012071956,"about_ca_topic_score_gemma":0.0005137411,"teacher_disagreement_score":0.7360289,"about_ca_system_score_codex":0.00023210591,"about_ca_system_score_gemma":0.00009432373,"threshold_uncertainty_score":0.9997515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91940725,0.00023753187,0.0027932015,0.0020572697,0.0009983756,0.00042809147,0.000014759519,0.00076476193,0.073298745],"genre_scores_gemma":[0.998651,0.00015457612,0.00070056657,0.00012347872,0.0000944098,0.000012789093,0.0000012889517,0.000029603394,0.00023223062],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986232,0.000015702319,0.00035866423,0.00032735002,0.0003889431,0.0002861329],"domain_scores_gemma":[0.9989588,0.0000775247,0.00013838541,0.00029452238,0.00046013386,0.00007058315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119780656,0.0002602572,0.00029090684,0.00009547335,0.00012918386,0.00015736558,0.00055678654,0.000113675684,0.00013273966],"category_scores_gemma":[0.00019005769,0.00019401131,0.000119487064,0.00034587033,0.00017042927,0.00012395011,0.00013251207,0.00035675475,0.00006973422],"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.00013949422,0.00019852053,0.00016112188,0.0000822928,0.000046019428,0.000007242751,0.0007055187,0.0037917586,0.70641387,0.24161367,0.004722935,0.042117555],"study_design_scores_gemma":[0.000020226535,0.00008424228,0.0001105744,0.0009225732,0.000014312755,0.0000050624385,0.00050941965,0.042562872,0.9251459,0.029740714,0.0006782018,0.00020588978],"about_ca_topic_score_codex":0.000015882126,"about_ca_topic_score_gemma":0.0000091024085,"teacher_disagreement_score":0.21873204,"about_ca_system_score_codex":0.00003363099,"about_ca_system_score_gemma":0.00003308241,"threshold_uncertainty_score":0.7911552},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11066515,0.0001056849,0.88367283,0.000055270273,0.00014728725,0.0000823874,0.0000022607749,0.0012896823,0.0039794263],"genre_scores_gemma":[0.6629365,0.000010802639,0.33668637,0.0000865163,0.00018309786,0.0000027917788,0.000005765576,0.00002628974,0.00006183243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993634,0.000008588972,0.00015492777,0.00012134563,0.00014595821,0.00020576226],"domain_scores_gemma":[0.99973696,0.00001441387,0.000020378897,0.00015246563,0.000026576692,0.00004922557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074259995,0.00013164632,0.00011514208,0.00008801526,0.00006051394,0.00005833395,0.00009747524,0.000062471874,0.000074996715],"category_scores_gemma":[0.000003434366,0.00013322734,0.00004127984,0.00009192801,0.000013078733,0.00023479806,0.00003144613,0.00010967968,0.000049841376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015052395,0.000016561367,0.0000065076247,0.000006089625,0.000024333136,0.000008792431,0.00013842208,0.7527244,0.0119009195,0.0006349266,0.0013240948,0.23321342],"study_design_scores_gemma":[0.000075896794,0.000005941645,0.00007424144,0.000035848476,0.00001013153,0.000039106424,0.000018219824,0.96308494,0.033670004,0.0019525115,0.0008665317,0.00016664912],"about_ca_topic_score_codex":0.000024833651,"about_ca_topic_score_gemma":0.00000977969,"teacher_disagreement_score":0.55227137,"about_ca_system_score_codex":0.000055391574,"about_ca_system_score_gemma":0.000007557999,"threshold_uncertainty_score":0.54328537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49048898,0.0000030438591,0.50894076,0.000040381663,0.0002458934,0.00009582114,3.0412647e-7,0.00016093625,0.000023906006],"genre_scores_gemma":[0.77049345,9.844879e-7,0.22931834,0.00006104832,0.000110496025,0.0000035434794,8.4528426e-7,0.000011030132,2.6139995e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873805,0.000013480617,0.00018876189,0.00045481583,0.00023731988,0.0003675799],"domain_scores_gemma":[0.99918437,0.00007622672,0.00006084999,0.0005003251,0.00009153177,0.000086676766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025117747,0.00019762533,0.00026995465,0.0004673049,0.00016111843,0.00017463589,0.0004177957,0.00009978026,0.0000073281817],"category_scores_gemma":[0.000020241954,0.00017030936,0.00005589216,0.0017832245,0.0002588401,0.00028243018,0.00008684945,0.00041983023,0.000002798869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008605546,0.000034375593,0.05731271,0.000022849954,0.00006896875,0.00003453454,0.00093497953,0.24109009,0.20761772,0.000005717749,0.0000032653832,0.4928662],"study_design_scores_gemma":[0.00010691038,0.000042689622,0.0405575,0.00005101248,0.00002577274,0.000052172647,6.7892546e-7,0.74885374,0.20973264,0.00038839105,0.0000015832335,0.00018692226],"about_ca_topic_score_codex":0.000058390582,"about_ca_topic_score_gemma":0.000614741,"teacher_disagreement_score":0.5077636,"about_ca_system_score_codex":0.000053720065,"about_ca_system_score_gemma":0.000055543413,"threshold_uncertainty_score":0.6945014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8345943,0.00005529434,0.15355657,0.000018352159,0.00014578055,0.00006715003,4.0495385e-7,0.00040647335,0.011155683],"genre_scores_gemma":[0.996935,0.0000058087585,0.0029747738,0.000014164574,0.0000284804,3.7067508e-7,6.1584103e-7,0.000013065665,0.000027683993],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995343,0.000013146278,0.00015076493,0.00008620521,0.00008565509,0.00012991545],"domain_scores_gemma":[0.9997511,0.000014754897,0.000018114957,0.00015187214,0.00002638272,0.000037772337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008192062,0.00008203856,0.00013317054,0.000102470935,0.000009421471,0.000009333404,0.000043473698,0.00005058909,0.00000625296],"category_scores_gemma":[0.000015451276,0.000081632425,0.000023777764,0.0001375282,0.000027343292,0.000053271637,0.000018448289,0.000091295115,0.000003554211],"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.00005600074,0.000056901532,0.0011527813,0.000040209492,0.000031612097,0.00004434274,0.000592891,0.025010688,0.93083626,0.00041706802,0.0023667025,0.03939457],"study_design_scores_gemma":[0.00015770156,0.00002492156,0.0006085117,0.00004020305,0.0000031396437,0.000012138794,0.00002894911,0.066996634,0.92030936,0.011580546,0.00014228652,0.00009558004],"about_ca_topic_score_codex":0.00038652608,"about_ca_topic_score_gemma":0.0005305245,"teacher_disagreement_score":0.16234075,"about_ca_system_score_codex":0.000047041907,"about_ca_system_score_gemma":0.0000067251935,"threshold_uncertainty_score":0.33288738},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4375485,0.00018434385,0.063999206,0.00062479556,0.0004418883,0.001172129,0.000067320696,0.010479366,0.48548245],"genre_scores_gemma":[0.99408096,0.000102792175,0.002841865,0.0001505971,0.00020732752,9.624906e-8,0.0003119247,0.0014408076,0.0008636203],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990324,0.000073690484,0.00017921887,0.00021777503,0.00018811511,0.0003088253],"domain_scores_gemma":[0.9991471,0.000008591222,0.000030348214,0.0004048885,0.0002786806,0.00013038458],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013386458,0.00013732894,0.0001298937,0.00014328976,0.0005748005,0.00038125596,0.0005111827,0.00006924649,0.009363171],"category_scores_gemma":[0.00006378947,0.00014200396,0.000045844274,0.00026118557,0.00006896024,0.00021442503,0.00032880157,0.00020824472,0.012674906],"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.000008462419,0.000040529107,0.0000026959958,0.000021274944,0.000046872974,0.000010823615,0.00027934712,0.0014984943,0.08183269,0.0011401259,0.8528228,0.06229593],"study_design_scores_gemma":[0.00027749853,0.000056295565,0.00036059073,0.000025119323,0.000008186578,0.000043362837,0.00005073517,0.05073163,0.013094799,0.00036504556,0.93477577,0.00021094835],"about_ca_topic_score_codex":0.000021788615,"about_ca_topic_score_gemma":1.1227833e-7,"teacher_disagreement_score":0.55653244,"about_ca_system_score_codex":0.00006483373,"about_ca_system_score_gemma":0.0000010113289,"threshold_uncertainty_score":0.9915424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99096155,0.0069948696,0.0013428704,0.00006130649,0.00006448109,0.00012883265,0.0000067714072,0.00024258519,0.00019673456],"genre_scores_gemma":[0.93608475,0.06277097,0.00095753337,0.00006506484,0.000038916496,0.000032539836,0.0000124293265,0.00002069011,0.000017091677],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995634,0.000025960177,0.00011104513,0.00012717304,0.000055382407,0.00011705587],"domain_scores_gemma":[0.99978983,0.000040041927,0.000020407928,0.0001006187,0.000015511627,0.000033594726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051752053,0.000111277834,0.00013869996,0.000077154386,0.00006289731,0.00001614759,0.00003568597,0.00006273968,0.000034446606],"category_scores_gemma":[0.000010247572,0.000099786586,0.00001697792,0.000106907646,0.000036263216,0.000083238796,0.000009621292,0.0000875809,5.8815783e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059324077,0.0001766589,0.7852674,0.000023555785,0.00009725803,0.000087748514,0.0010787353,0.013832203,0.0070068254,0.0004623353,0.013288493,0.17861944],"study_design_scores_gemma":[0.0018650519,0.00024685907,0.73605347,0.00008472232,0.000018244828,0.000050030983,0.000019649815,0.13581806,0.10241448,0.0024345412,0.020279821,0.0007150452],"about_ca_topic_score_codex":0.0000716678,"about_ca_topic_score_gemma":0.000014052211,"teacher_disagreement_score":0.1779044,"about_ca_system_score_codex":0.0000066990324,"about_ca_system_score_gemma":0.000003921919,"threshold_uncertainty_score":0.4069179},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28186056,0.00024566357,0.0062437695,0.000017132968,0.002157602,0.00022348162,7.169975e-7,0.0014742557,0.7077768],"genre_scores_gemma":[0.99452966,0.00010749133,0.0029454539,0.00010257312,0.0022771724,0.0000019421846,2.4593987e-7,0.00002178072,0.000013665294],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943155,0.000015952039,0.00014770689,0.00014822414,0.00007269466,0.0001838934],"domain_scores_gemma":[0.9997758,0.00003904031,0.000018794248,0.0001303823,0.000010541981,0.000025432228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042573167,0.00010524687,0.000103179096,0.00009818484,0.000024568699,0.000011572964,0.00014188065,0.000033030356,0.000057371428],"category_scores_gemma":[0.0000124314165,0.00011052099,0.00002357019,0.00014111145,0.0000153176,0.000072967385,0.00003388569,0.00018500832,0.00007273944],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015200406,0.0000419744,0.0009515524,0.000016104013,0.0000033403744,0.00012310008,0.0008828725,0.026703032,0.0017219471,0.0010576447,0.003050646,0.9654326],"study_design_scores_gemma":[0.00021463669,0.00024621675,0.004546598,0.00047787774,0.000006130593,0.000033328823,0.00014923722,0.30248776,0.29347312,0.0034632855,0.39420143,0.00070037256],"about_ca_topic_score_codex":0.0000032287414,"about_ca_topic_score_gemma":0.000010256348,"teacher_disagreement_score":0.9647322,"about_ca_system_score_codex":0.000014377293,"about_ca_system_score_gemma":0.0000032441067,"threshold_uncertainty_score":0.45069152},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042634398,0.00007339222,0.9550895,0.00006458018,0.000055494223,0.00052875135,0.000006643145,0.0010804588,0.00046678813],"genre_scores_gemma":[0.99517,0.0000064648925,0.004236158,0.00011239931,0.00005864395,0.00012908506,0.000004085162,0.000057211688,0.00022594443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988603,0.000034424727,0.0002230335,0.00033062004,0.00030634226,0.00024528874],"domain_scores_gemma":[0.99930716,0.000037329537,0.00006268974,0.00019660093,0.00024341771,0.00015279265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007783721,0.000245271,0.00019825969,0.00032644186,0.00018921285,0.00009705736,0.00012623028,0.00011530169,0.000002285098],"category_scores_gemma":[0.0000032230469,0.00018617962,0.000036885194,0.0007658201,0.000033219705,0.00023188883,0.0000012319875,0.00027400788,0.000038514194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000298619,0.00016124688,0.0000039010783,0.000031260963,0.000035525467,0.0000029676396,0.0009266907,0.938478,0.022616765,0.0000013207958,0.00031459364,0.037129134],"study_design_scores_gemma":[0.0006279124,0.00043364955,0.00003945618,0.00024958278,0.000049262326,0.000015110913,0.00033040138,0.69750094,0.29980984,0.000029892546,0.000564033,0.00034992848],"about_ca_topic_score_codex":0.00004916498,"about_ca_topic_score_gemma":0.000019434785,"teacher_disagreement_score":0.9525356,"about_ca_system_score_codex":0.00016372054,"about_ca_system_score_gemma":0.00005910669,"threshold_uncertainty_score":0.75921845},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04434312,0.000011401549,0.953343,0.00011032846,0.000137081,0.00026346123,0.0000039157085,0.0013435897,0.00044411357],"genre_scores_gemma":[0.8726719,0.0000026197215,0.1270203,0.000116354975,0.00008152976,0.000029605839,0.0000032179141,0.000057520818,0.00001695011],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905074,0.000028874683,0.00021011272,0.00028122604,0.00019506607,0.0002339951],"domain_scores_gemma":[0.9993627,0.00007306782,0.000054051456,0.0002857504,0.00014000926,0.0000844124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008500451,0.00021193815,0.00018846693,0.00017372901,0.00023028743,0.00017362999,0.000093078816,0.00007026835,0.0000075080134],"category_scores_gemma":[0.00000649208,0.00020946731,0.00003481683,0.00034013315,0.000030724346,0.00037897594,0.0000011303341,0.00021240044,0.00003264495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000366774,0.00002783046,4.4548986e-7,0.000036845635,0.000016057138,0.0000014472631,0.00025831218,0.3392385,0.40568522,0.000010680262,0.00005764783,0.25463036],"study_design_scores_gemma":[0.00021841832,0.000053446336,0.000098874756,0.00014971479,0.000033201202,0.000019028475,0.000017839491,0.5430505,0.4557941,0.00014685393,0.00018580216,0.00023219116],"about_ca_topic_score_codex":0.000055904908,"about_ca_topic_score_gemma":0.0000133811345,"teacher_disagreement_score":0.8283288,"about_ca_system_score_codex":0.00007011345,"about_ca_system_score_gemma":0.000017025966,"threshold_uncertainty_score":0.8541829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5247275,0.00090279506,0.45724782,0.0005325088,0.00008086752,0.00033995364,0.000026165364,0.001284242,0.014858114],"genre_scores_gemma":[0.974432,0.000015594647,0.025121396,0.00012140425,0.0000827036,0.000023130122,0.00012696932,0.000020410684,0.000056377892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.000013572539,0.00017452957,0.00027191485,0.00028044728,0.00016746066],"domain_scores_gemma":[0.9995284,0.000041889558,0.00004318498,0.0001436245,0.000133607,0.000109291934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006847599,0.0001697758,0.00026295776,0.00019047385,0.00008999991,0.00005619642,0.00008161126,0.000037698257,0.000033584343],"category_scores_gemma":[0.0000033183774,0.00014673614,0.000056536115,0.0005850676,0.0000783896,0.000054567085,0.000023955234,0.00011957735,0.00001668275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007073884,0.00009305575,0.0017032472,0.000019505138,0.002248199,0.000016680024,0.00027592893,0.96872276,0.001283468,0.0074855597,0.008452976,0.009627884],"study_design_scores_gemma":[0.0008338798,0.00006167283,0.04896616,0.000026024258,0.00083604787,0.000043874214,0.000103990154,0.92096734,0.002955272,0.019712983,0.004823348,0.00066942186],"about_ca_topic_score_codex":0.000017014116,"about_ca_topic_score_gemma":0.000005442265,"teacher_disagreement_score":0.4497045,"about_ca_system_score_codex":0.000040950712,"about_ca_system_score_gemma":0.00003346137,"threshold_uncertainty_score":0.5983726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010839967,0.00083143497,0.9935308,0.00003236416,0.0007178042,0.00037813224,0.000005620035,0.000610086,0.0028097616],"genre_scores_gemma":[0.7068985,0.000017758679,0.29192296,0.00013070287,0.00086538726,0.000011285947,0.000010673047,0.00008969759,0.000053004605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827284,0.000003557461,0.0003001908,0.00058820617,0.00033536664,0.0004998358],"domain_scores_gemma":[0.9992438,0.00013243829,0.00007714713,0.00037074153,0.00011830984,0.000057552585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020505345,0.000374633,0.0003475791,0.000402408,0.00014542152,0.00021753651,0.0005299814,0.00021494538,0.0000027012406],"category_scores_gemma":[0.000016226844,0.00036602907,0.00010306472,0.0001771273,0.0002265036,0.00007302022,0.00011149821,0.00040562512,0.0000031328118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028846994,0.0000063609677,0.0000031294364,0.00005135269,0.000004401154,0.000010531315,0.000068874484,0.80101585,0.0029231708,0.00043801265,0.00009017789,0.19538526],"study_design_scores_gemma":[0.00009967392,0.000039177743,0.00002078727,0.00061548117,0.000011154984,0.000020064275,4.7803116e-8,0.92410845,0.04827085,0.025257843,0.0010915608,0.00046488212],"about_ca_topic_score_codex":0.0000051804545,"about_ca_topic_score_gemma":0.000015597692,"teacher_disagreement_score":0.70581454,"about_ca_system_score_codex":0.00021675254,"about_ca_system_score_gemma":0.00009133719,"threshold_uncertainty_score":0.9998792},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9027502,0.0006858047,0.07796335,0.0001372725,0.00018523938,0.00053638767,0.000025602192,0.0017259575,0.01599017],"genre_scores_gemma":[0.8705693,0.00008404556,0.12891643,0.00005353835,0.00016730787,0.000025288575,0.0000074639247,0.000042371907,0.00013425258],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993594,0.000008813273,0.00014637981,0.00014669458,0.000118901924,0.00021976636],"domain_scores_gemma":[0.9995622,0.000050533134,0.00002372898,0.00018360827,0.000088317305,0.000091610455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012272784,0.00012607785,0.00021384387,0.000068356516,0.00003739482,0.0000601793,0.000099513985,0.00005631941,0.000008767144],"category_scores_gemma":[0.00010008901,0.00013290773,0.000030593306,0.000063680985,0.000025955416,0.00015813342,0.00005510936,0.000109569606,0.000018420338],"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.000035168214,0.00016693586,0.000343939,0.00015257922,0.00017587768,0.000012615304,0.00056751183,0.00009498791,0.99289453,0.00034846124,0.0038792929,0.0013280779],"study_design_scores_gemma":[0.0002798474,0.00007128303,0.000010768884,0.00032801979,0.0000680758,0.0000037504792,0.000057806217,0.23921144,0.7580885,0.00073060376,0.0009614143,0.00018844887],"about_ca_topic_score_codex":0.000010860565,"about_ca_topic_score_gemma":0.0000034608274,"teacher_disagreement_score":0.23911645,"about_ca_system_score_codex":0.000039670605,"about_ca_system_score_gemma":0.000009949468,"threshold_uncertainty_score":0.541982},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23848253,0.00006416415,0.7577709,0.000008497212,0.000388191,0.000492601,0.000017648588,0.0009797047,0.0017957808],"genre_scores_gemma":[0.9971017,0.00003884374,0.0020330765,0.000016888032,0.00011665942,0.000008030417,0.00006243028,0.00004903496,0.000573332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992056,0.000016761116,0.00012861766,0.0003723562,0.00003876464,0.00023789727],"domain_scores_gemma":[0.99919945,0.000051534444,0.0000711407,0.0004911552,0.00011931828,0.00006738588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005513044,0.00024746745,0.00024174663,0.00016303029,0.00007069188,0.00006946429,0.00032010835,0.0002780785,0.000025927657],"category_scores_gemma":[0.000015816555,0.00030542543,0.00012986355,0.0001138681,0.000047900816,0.00011923971,0.00018078701,0.0002860169,0.000041533523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011478943,0.000017933024,0.000019300047,0.00010900546,0.00009336766,0.00000717781,0.00006246783,0.9758312,0.00033101597,0.01791251,0.004988188,0.0006163403],"study_design_scores_gemma":[0.00018136852,0.000019830788,0.000043628774,0.00011025898,0.00008228442,0.000001261169,0.000028727345,0.9215464,0.00084047084,0.076278485,0.0005352367,0.00033205765],"about_ca_topic_score_codex":0.000033019212,"about_ca_topic_score_gemma":0.0000070497495,"teacher_disagreement_score":0.7586192,"about_ca_system_score_codex":0.00014844832,"about_ca_system_score_gemma":0.000027884264,"threshold_uncertainty_score":0.9999398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015535388,0.00015146127,0.99580956,0.000011537613,0.00016598657,0.0007844079,0.00002249198,0.0020596446,0.00083953945],"genre_scores_gemma":[0.030685985,0.0000097043,0.9686418,0.000040133662,0.00010629167,0.00015065505,0.00026118872,0.00009067967,0.000013545053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853075,0.00024912867,0.00035393133,0.00035882305,0.00020746131,0.00029993037],"domain_scores_gemma":[0.99875605,0.00010864919,0.00009621532,0.0003788681,0.0004894407,0.00017076684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000980817,0.00025284424,0.0003129496,0.0001691653,0.00012165607,0.00014823793,0.00019561432,0.00019407229,0.000010585039],"category_scores_gemma":[0.00026447073,0.00026549058,0.00009213643,0.000379877,0.000047748425,0.00023437067,0.000025184618,0.0001450924,2.4842822e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021673322,0.000047719433,0.00009647052,0.00003769207,0.000030557658,6.7553736e-7,0.00037616526,0.9806594,0.00010362783,0.000085778884,0.0001423163,0.018397924],"study_design_scores_gemma":[0.00048382493,0.000059631908,0.000008605908,0.000032123266,0.000050873452,0.000011385874,0.00018042015,0.99636674,0.0021407187,0.00020690654,0.00014254314,0.0003162422],"about_ca_topic_score_codex":0.000008423132,"about_ca_topic_score_gemma":2.8814958e-7,"teacher_disagreement_score":0.030530632,"about_ca_system_score_codex":0.000113341506,"about_ca_system_score_gemma":0.00005858307,"threshold_uncertainty_score":0.99997973},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107206805,0.00011549506,0.951843,0.000047307643,0.0003202407,0.000115827235,3.520401e-7,0.002731822,0.034105252],"genre_scores_gemma":[0.889846,0.00003752332,0.10950406,0.00018016691,0.0002699953,0.000009572713,0.000005914008,0.000055731933,0.00009102368],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899256,0.00006181647,0.00023657826,0.00019151843,0.00012558431,0.00039191343],"domain_scores_gemma":[0.9994735,0.00005669557,0.00003631427,0.00033185826,0.000025176623,0.00007641428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021593343,0.00020164435,0.00028292002,0.00005712762,0.00011922855,0.00009344971,0.00014974969,0.00009468208,0.000083285646],"category_scores_gemma":[0.000011065466,0.00018570296,0.00007904216,0.0001527972,0.000026236863,0.00009592842,0.000043784214,0.00013455066,0.000016220487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067594316,0.000059045324,0.0011394134,0.00014899307,0.00033493133,0.00004617369,0.00030587285,0.19549058,0.52118134,0.08585587,0.08969828,0.105671905],"study_design_scores_gemma":[0.00028317177,0.000011297382,0.00007288207,0.00006616967,0.000017836212,0.000008562687,0.000004787826,0.929171,0.058988985,0.005977902,0.00512097,0.00027644084],"about_ca_topic_score_codex":0.000027102336,"about_ca_topic_score_gemma":0.0000103311695,"teacher_disagreement_score":0.87912536,"about_ca_system_score_codex":0.000024221012,"about_ca_system_score_gemma":0.0000034811217,"threshold_uncertainty_score":0.7572747},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036870223,0.000934157,0.9509309,0.0001856148,0.001794556,0.00016735094,0.0000055823566,0.0030053195,0.0061063296],"genre_scores_gemma":[0.9892252,0.00003456358,0.010135598,0.00028641446,0.00021622825,0.000007827965,0.000010861272,0.00004543151,0.000037857957],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911594,0.000018879024,0.00017522382,0.0001844047,0.00017593124,0.00032959448],"domain_scores_gemma":[0.99933887,0.000017802035,0.000029089599,0.0003684048,0.0000949478,0.00015088629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006734508,0.00018290861,0.00018800047,0.00014962001,0.000057684912,0.00007014331,0.0002642972,0.000094172654,0.0000039500414],"category_scores_gemma":[0.0000041296585,0.0001921501,0.00007928703,0.00020525393,0.000054097207,0.00013794811,0.00014260777,0.00021387849,0.000034249366],"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.000016603102,0.00006037495,0.0066402606,0.000034156932,0.00021131533,0.00014801718,0.00069531973,0.035505567,0.0009378099,0.034480806,0.89600414,0.025265606],"study_design_scores_gemma":[0.00030031608,0.00007821643,0.00080153166,0.0000710386,0.000012569302,0.000047513375,0.000034963174,0.8678411,0.003390609,0.012465739,0.114581384,0.00037500582],"about_ca_topic_score_codex":0.000013518471,"about_ca_topic_score_gemma":0.0000066959287,"teacher_disagreement_score":0.95235497,"about_ca_system_score_codex":0.000028665436,"about_ca_system_score_gemma":0.000011702158,"threshold_uncertainty_score":0.78356534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16714215,0.005292117,0.8167011,0.00007401109,0.0032699713,0.0042728847,0.00026976713,0.0015090104,0.0014689366],"genre_scores_gemma":[0.96485406,0.00059215864,0.032230932,0.000028885404,0.0005017112,0.0011653092,0.00014239381,0.00012278692,0.0003617881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981288,0.000107865955,0.00081195694,0.00037128443,0.00018311566,0.00039697706],"domain_scores_gemma":[0.9981572,0.00031497545,0.00027360066,0.0007780665,0.0003774601,0.00009870657],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038510194,0.00041143395,0.0013066959,0.00018027214,0.00007154612,0.000043248783,0.00031589877,0.00039978055,0.000016893526],"category_scores_gemma":[0.000105937965,0.00038593178,0.00055645104,0.000078724755,0.00016883171,0.000052047133,0.00028847682,0.00042001926,0.000037071815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005911975,0.0014028527,0.002248121,0.00885166,0.018275555,0.00013394655,0.00301525,0.68938196,0.046708703,0.009708877,0.16113906,0.053222064],"study_design_scores_gemma":[0.011631036,0.000037639853,0.00009179335,0.0010859492,0.00042308023,0.000012600027,0.00007112889,0.976126,0.0073135747,0.0006355677,0.0020174894,0.00055410044],"about_ca_topic_score_codex":0.00038908495,"about_ca_topic_score_gemma":0.0000055050564,"teacher_disagreement_score":0.79771185,"about_ca_system_score_codex":0.000079913814,"about_ca_system_score_gemma":0.00006155496,"threshold_uncertainty_score":0.9998593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21812038,0.0015227839,0.5640464,0.00032073012,0.007142818,0.0011107435,0.0001540327,0.019509288,0.18807282],"genre_scores_gemma":[0.9898724,0.00020918109,0.008398358,0.00003456477,0.00029704528,0.000020858644,0.0000127411,0.00007939687,0.0010754325],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999058,0.00002446265,0.00021832847,0.0003017876,0.00014912846,0.00024830102],"domain_scores_gemma":[0.9991071,0.000038806953,0.000052093746,0.0006901381,0.000034354965,0.0000775066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034465076,0.00033570375,0.00030382443,0.00011074396,0.000027767806,0.000049731483,0.00027748707,0.0003877453,0.00022563964],"category_scores_gemma":[0.000015910207,0.00022100421,0.00012256269,0.000030304185,0.000022988881,0.000048213296,0.0003845468,0.00038782935,0.00013416252],"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.000059368074,0.0001070517,0.00060229324,0.00031841898,0.000673497,0.0002210131,0.0006959681,0.0037669316,0.48845333,0.0040273597,0.27647913,0.22459565],"study_design_scores_gemma":[0.00048198825,0.000028694762,0.004326163,0.0034651444,0.000051242052,0.0000119965725,0.00001176245,0.06137811,0.85203844,0.031922698,0.044549078,0.0017347058],"about_ca_topic_score_codex":0.000045370663,"about_ca_topic_score_gemma":0.000004498974,"teacher_disagreement_score":0.77175206,"about_ca_system_score_codex":0.00006630751,"about_ca_system_score_gemma":0.000017658356,"threshold_uncertainty_score":0.901229},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9971531,0.000749491,0.0016460335,0.00015956312,0.00009164269,0.00016334056,0.0000011518024,0.000009709411,0.000025953888],"genre_scores_gemma":[0.99905515,0.00028074306,0.0006304127,0.000017822746,0.0000101860605,0.0000015978454,0.0000016271019,0.0000022845184,1.8789672e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943286,0.00017903133,0.00021328792,0.00007495409,0.000034406225,0.000065484484],"domain_scores_gemma":[0.99939877,0.00037361213,0.00006680559,0.000112613765,0.000041191117,0.000006997024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040065555,0.00006266647,0.00017393472,0.00007059991,0.000019158122,0.0000023544385,0.00006883222,0.00005428334,9.1357705e-8],"category_scores_gemma":[0.00008022461,0.000032735763,0.000007413663,0.000115410716,0.0005700094,0.000040352952,0.00001943215,0.00012387938,9.298488e-9],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064845703,0.00008531887,0.04608808,0.0003520964,0.00008157214,0.000011513641,0.04429724,0.0028243803,0.1685489,0.00053058646,0.0001251625,0.7364067],"study_design_scores_gemma":[0.0033294288,0.0015631936,0.38442662,0.0027139604,0.000069303955,0.00076487893,0.018930651,0.49811125,0.057639565,0.031624597,0.0004479319,0.00037861196],"about_ca_topic_score_codex":0.00014279778,"about_ca_topic_score_gemma":0.00035402426,"teacher_disagreement_score":0.7360281,"about_ca_system_score_codex":0.000009950814,"about_ca_system_score_gemma":0.0000067875844,"threshold_uncertainty_score":0.21002233},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070695095,0.0000120077275,0.92535484,0.000005577884,0.000048150472,0.00014939478,0.0000066172934,0.00038790904,0.0033404168],"genre_scores_gemma":[0.96935815,0.0000010721379,0.030493196,0.000038868173,0.000026625185,0.000024696406,0.0000017987701,0.00003635449,0.000019244266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912184,0.000030860414,0.00018922355,0.00021106865,0.00025570637,0.00019130422],"domain_scores_gemma":[0.999611,0.000024669327,0.000041605843,0.00015157361,0.000091516275,0.000079598525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008794999,0.00016395413,0.0001746652,0.00014591285,0.00015980622,0.0000397996,0.000110084766,0.000046484347,0.000009694826],"category_scores_gemma":[5.876315e-7,0.00014938286,0.00003645805,0.0002545303,0.000058986618,0.0001237512,7.0109553e-7,0.0001693685,0.0000037356301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101633064,0.00012736545,0.000007871396,0.00002546028,0.000031587024,3.8923494e-7,0.00048036914,0.94414586,0.016023658,0.000056909466,0.000023584429,0.0389753],"study_design_scores_gemma":[0.00022665887,0.0004064124,0.000057021694,0.00015935539,0.00003653919,0.000007165949,0.00027331396,0.85733485,0.14100596,0.000062349594,0.00021914995,0.00021122089],"about_ca_topic_score_codex":0.000018974722,"about_ca_topic_score_gemma":0.000005731075,"teacher_disagreement_score":0.89866304,"about_ca_system_score_codex":0.000045321598,"about_ca_system_score_gemma":0.000017602826,"threshold_uncertainty_score":0.6091656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03247591,0.0027442398,0.9637542,0.00012387907,0.0003032389,0.00010851424,0.000007829533,0.00006882507,0.00041337358],"genre_scores_gemma":[0.99336034,0.00031946052,0.0060877837,0.000040655694,0.00013586685,0.000002039102,0.0000027474591,0.00002158269,0.0000295166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989928,0.0000881477,0.0003383855,0.000075226264,0.00020824402,0.0002972244],"domain_scores_gemma":[0.99921274,0.00020795963,0.00016952779,0.00012048102,0.00020665387,0.00008265718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063805806,0.00013654996,0.00025780703,0.000059991602,0.00007359222,0.00006890506,0.000121072335,0.000053847638,0.000007774645],"category_scores_gemma":[0.0001584366,0.00009951364,0.000036335474,0.000077773584,0.00012100028,0.00011664412,0.000019637473,0.0004912363,0.0000025966986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014336242,0.00022341525,0.0006958835,0.0001382352,0.002139677,0.00021536922,0.0077749225,0.027347175,0.014198575,0.8161039,0.053490743,0.076238476],"study_design_scores_gemma":[0.0039516715,0.00060859916,0.0005620855,0.00010206614,0.00025493765,0.0008125454,0.00050714536,0.69433814,0.0043440927,0.2905426,0.003621529,0.00035460986],"about_ca_topic_score_codex":0.000055814864,"about_ca_topic_score_gemma":0.000039845672,"teacher_disagreement_score":0.96088445,"about_ca_system_score_codex":0.00017478611,"about_ca_system_score_gemma":0.00012708575,"threshold_uncertainty_score":0.40580487},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58801305,0.00047902935,0.3381649,0.008959025,0.005335174,0.0005047455,0.000002117711,0.005535376,0.053006586],"genre_scores_gemma":[0.99377036,0.0000031065651,0.0037761144,0.00020955283,0.0016729896,0.00000161513,0.0000016699958,0.00002668905,0.00053791114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955153,0.000024269917,0.00008285145,0.000098121614,0.000087938606,0.0001552734],"domain_scores_gemma":[0.99957645,0.000024755396,0.000010671388,0.00028523424,0.000044281136,0.000058631853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014541106,0.000084505584,0.00009612245,0.000050770268,0.00004705856,0.000041683208,0.00011232431,0.0000297991,0.0000037752682],"category_scores_gemma":[0.000037065303,0.000066710556,0.000020143169,0.00014198221,0.0000196896,0.00004978223,0.000033040888,0.00011763161,0.00035545346],"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.000008736601,0.000003826996,0.00001299584,0.0000035466155,0.000016730437,0.000003948469,0.0011510038,0.037767142,0.0871063,0.0003217669,0.86030877,0.01329523],"study_design_scores_gemma":[0.00013611116,0.00003517457,0.000085966625,0.000045711447,0.000018817227,0.000045951376,0.00013064066,0.06969299,0.325854,0.0016359271,0.60207516,0.00024357006],"about_ca_topic_score_codex":0.000010384979,"about_ca_topic_score_gemma":0.000003884568,"teacher_disagreement_score":0.4057573,"about_ca_system_score_codex":0.00005112901,"about_ca_system_score_gemma":0.0000049007126,"threshold_uncertainty_score":0.45687538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018188365,0.0008324232,0.8457574,0.000039560604,0.00015428016,0.00024931098,0.00000496336,0.000355045,0.15242511],"genre_scores_gemma":[0.70752627,0.0075823357,0.28360912,0.0005194767,0.00015520348,0.000010746379,0.00011137548,0.000061324296,0.0004241425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990719,0.000022611657,0.0003525585,0.00012076597,0.00020712918,0.00022504378],"domain_scores_gemma":[0.9982911,0.00016493042,0.000120390076,0.0011450908,0.0002034077,0.00007512586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004246921,0.00021755448,0.00022655627,0.00042547437,0.00025536955,0.00022712987,0.00066636427,0.00012420557,0.000005501326],"category_scores_gemma":[0.000003887555,0.00020165634,0.000024124667,0.00017448363,0.0007086976,0.0017207705,0.00042731228,0.00045896647,0.000010019768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000128991405,0.000012247209,0.000044287543,0.00004977397,0.000036898353,0.0000015395331,0.0016203476,0.2500009,0.000032750377,0.16754034,0.00058936054,0.58005863],"study_design_scores_gemma":[0.00012115705,0.0000140821385,0.00014282374,0.00040023433,0.000012535731,0.000039830786,0.000024295969,0.9731903,0.00005676179,0.0006028291,0.02510054,0.00029457448],"about_ca_topic_score_codex":0.0000036349818,"about_ca_topic_score_gemma":0.000004540761,"teacher_disagreement_score":0.7231894,"about_ca_system_score_codex":0.000076295786,"about_ca_system_score_gemma":0.00003602643,"threshold_uncertainty_score":0.82233065},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015291044,0.000095477706,0.9937694,0.0002766815,0.00004826107,0.0014542112,0.0000010599849,0.001063488,0.0017623218],"genre_scores_gemma":[0.5135566,0.000011449498,0.48525262,0.00007313133,0.00007419876,0.00089314487,0.000009369924,0.000051101266,0.000078386474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.000011149611,0.000219321,0.00010850392,0.00009413744,0.0002441159],"domain_scores_gemma":[0.9994141,0.0002511254,0.000029960687,0.00019497088,0.00006567619,0.000044159264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012291966,0.00012640387,0.00015156876,0.00002851823,0.00008684217,0.0001350152,0.00013560729,0.00006918565,0.00011503481],"category_scores_gemma":[0.00005892085,0.00008401171,0.000060723818,0.00008022906,0.000045152956,0.00008918858,0.000025759866,0.00010615169,0.000041805557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035063793,0.00041503704,0.00006082822,0.0019932028,0.00060880126,0.000010593849,0.0027756933,0.18650597,0.008945514,0.110602096,0.043474544,0.6445727],"study_design_scores_gemma":[0.000110882655,0.000030198522,0.000004227613,0.00011174165,0.000023083801,0.000010607289,0.00009063938,0.9740744,0.004170225,0.01785327,0.003385768,0.00013491951],"about_ca_topic_score_codex":0.0000055308037,"about_ca_topic_score_gemma":6.860181e-7,"teacher_disagreement_score":0.78756845,"about_ca_system_score_codex":0.000016943632,"about_ca_system_score_gemma":0.0000045952875,"threshold_uncertainty_score":0.34258983},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3300771,0.0002611303,0.46157908,0.00016095598,0.00014364845,0.00019089761,0.0000012866974,0.0039470554,0.20363884],"genre_scores_gemma":[0.9882264,0.000012159772,0.011331161,0.00015794946,0.00003784383,0.0000044320486,0.0000013227215,0.000013381356,0.00021533147],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997518,0.0000038487765,0.0000469682,0.00005953247,0.000059834107,0.000077983335],"domain_scores_gemma":[0.9998229,0.0000137377665,0.0000055983064,0.000118121316,0.000020533573,0.000019105742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00001063447,0.000058441998,0.000048012073,0.00003657513,0.000016926231,0.000015126708,0.00003539112,0.000024565814,0.00027217134],"category_scores_gemma":[0.0000016383779,0.00004747679,0.00001351705,0.000060915896,0.0000075296552,0.000058771755,0.0000034073084,0.00003701753,0.000046699643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036221816,0.00013254065,0.003016329,0.00005067709,0.0001347751,0.000093140385,0.00026263075,0.18178637,0.11579218,0.001973881,0.54626507,0.15045622],"study_design_scores_gemma":[0.00016604572,0.00004064098,0.0005461615,0.00003188816,0.000008243716,0.0000037566126,0.0000067955652,0.8202849,0.16924776,0.00005004279,0.009477708,0.00013606738],"about_ca_topic_score_codex":0.00001209305,"about_ca_topic_score_gemma":0.000008628275,"teacher_disagreement_score":0.6581493,"about_ca_system_score_codex":0.000013347557,"about_ca_system_score_gemma":0.0000010991466,"threshold_uncertainty_score":0.29800853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2625437,0.0004331799,0.7316372,0.00023580616,0.00025957538,0.0008525667,0.0000065239597,0.0017485725,0.0022828819],"genre_scores_gemma":[0.9894419,0.00010791978,0.009350843,0.000117468124,0.00039139594,0.00019401498,0.00015739015,0.00009098783,0.00014811251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99871296,0.00002182906,0.00027582355,0.0003715891,0.00020215931,0.00041562322],"domain_scores_gemma":[0.99875253,0.000018459768,0.0001035426,0.0008791337,0.0001237085,0.00012264933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001536882,0.00034709138,0.00030161167,0.00017134994,0.0001145438,0.000059488266,0.00028996947,0.00030988877,0.000005810007],"category_scores_gemma":[0.000013221646,0.00035133417,0.00007068504,0.00021754122,0.000027020864,0.00015872682,0.00026254612,0.0004283537,0.000095466625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023947132,0.00027272286,0.041014444,0.0008607052,0.0006572463,0.00002132252,0.0038645393,0.68413556,0.17647812,0.0031419338,0.009580172,0.079733774],"study_design_scores_gemma":[0.0013220691,0.00024010203,0.40333545,0.0031627293,0.00068544043,0.00008673855,0.00023808479,0.37465528,0.17525493,0.0060795937,0.03038237,0.004557219],"about_ca_topic_score_codex":0.00006882432,"about_ca_topic_score_gemma":0.000108411725,"teacher_disagreement_score":0.7268982,"about_ca_system_score_codex":0.00020324084,"about_ca_system_score_gemma":0.000026243568,"threshold_uncertainty_score":0.99989384},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35417923,0.000077139164,0.64032817,0.000008841023,0.00015783565,0.00012433028,6.3656506e-7,0.0010215152,0.00410231],"genre_scores_gemma":[0.8808766,0.000010932829,0.11864551,0.00010687869,0.00009796152,0.0000043852547,0.0000024639896,0.000046090474,0.00020916804],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.000079131576,0.0002561685,0.00016222738,0.00015892829,0.00026181867],"domain_scores_gemma":[0.9994821,0.00015467145,0.000037771937,0.00022921237,0.000034049925,0.00006221815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043078163,0.00018095376,0.00036808642,0.00010186043,0.000087821594,0.000104404484,0.0001479699,0.00007638301,0.00007897975],"category_scores_gemma":[0.000048067373,0.00015979502,0.00012546874,0.00008330042,0.00004344191,0.00013186775,0.000052339703,0.00015342838,0.000019088717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010591289,0.000064832566,0.00043051748,0.00009355666,0.0003200651,0.00004025894,0.00075003086,0.3106973,0.642029,0.026668416,0.00056894467,0.017277952],"study_design_scores_gemma":[0.012625446,0.0000041612366,0.000064824766,0.00008201734,0.000034735345,0.000016007725,0.000031910884,0.9339715,0.05041038,0.0015806103,0.00087820966,0.00030016483],"about_ca_topic_score_codex":0.000084745894,"about_ca_topic_score_gemma":0.000019722318,"teacher_disagreement_score":0.62327427,"about_ca_system_score_codex":0.00003268396,"about_ca_system_score_gemma":0.0000068871113,"threshold_uncertainty_score":0.65162516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3906549,0.00007367572,0.38231105,0.00036643143,0.002515063,0.00042924163,0.0000069141583,0.0016961873,0.22194654],"genre_scores_gemma":[0.99430484,0.0000060038183,0.0053855143,0.0002274604,0.000045912344,0.0000059704903,0.000004417639,0.0000034638567,0.000016408678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859136,0.000015348702,0.0002083963,0.00010886486,0.0007135771,0.00036245628],"domain_scores_gemma":[0.9994739,0.00002994516,0.00008019367,0.00023285193,0.00007363914,0.00010942418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073372,0.00011854703,0.00008410162,0.00044980715,0.00048573664,0.00025107933,0.00041177377,0.00004137932,0.000028416702],"category_scores_gemma":[0.00022958686,0.00008681696,0.000024018003,0.001303837,0.0005913736,0.0036383378,0.000037980775,0.00009035237,0.00009612089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021047003,0.00009945693,0.01061853,0.000054517954,0.000004414309,0.000001074129,0.0038307803,0.80029845,0.02263852,0.0571694,0.009422068,0.09584172],"study_design_scores_gemma":[0.00007440414,0.000048348244,0.01956959,0.00007847879,0.000002399764,0.0000038446137,0.00009942157,0.91985255,0.057396293,0.0010083164,0.0016951539,0.00017121673],"about_ca_topic_score_codex":0.0000066025978,"about_ca_topic_score_gemma":2.9132224e-7,"teacher_disagreement_score":0.60365,"about_ca_system_score_codex":0.00007486441,"about_ca_system_score_gemma":0.000067298926,"threshold_uncertainty_score":0.37359425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5465783,0.00012897902,0.45147994,0.0000723915,0.000050159415,0.00014900757,0.0000015011472,0.0005073441,0.0010324267],"genre_scores_gemma":[0.92370516,0.0000069883217,0.07557146,0.0005598775,0.00008653076,0.000005039007,0.00000323827,0.000057945294,0.0000037814493],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00002986814,0.00025708167,0.00028418712,0.00020785905,0.00038955058],"domain_scores_gemma":[0.99964213,0.000020653386,0.00006233581,0.00019190833,0.000017964727,0.00006498309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009455761,0.00025659753,0.00024889785,0.00021794211,0.00007295247,0.000051331306,0.00015504601,0.00006994144,0.000014847556],"category_scores_gemma":[0.0000012155654,0.0002435007,0.000038663835,0.00020525338,0.000102537815,0.00018383273,0.000019365018,0.00030040555,0.000011385258],"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.000051020033,0.00006353664,0.0015401444,0.000115644616,0.00006132052,0.00058820227,0.0026864174,0.06571863,0.89290494,0.0000024260646,0.00045984355,0.035807885],"study_design_scores_gemma":[0.0007260175,0.00006634253,0.0026767545,0.0010946151,0.00003759146,0.000089898596,0.0001799774,0.6220217,0.37118858,0.00011362588,0.0009282114,0.00087671494],"about_ca_topic_score_codex":0.00006196352,"about_ca_topic_score_gemma":0.00000819944,"teacher_disagreement_score":0.556303,"about_ca_system_score_codex":0.000077112,"about_ca_system_score_gemma":0.00001368028,"threshold_uncertainty_score":0.99296707},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6320085,0.000014284224,0.36461288,6.587095e-7,0.000033967088,0.000037930968,0.0000014098424,0.00019693644,0.0030934564],"genre_scores_gemma":[0.79090655,0.0000118540065,0.20904909,0.000005095148,0.000007789555,8.0636727e-7,0.0000014722285,0.000007219955,0.000010131679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950194,0.0000138333835,0.000202153,0.000101032536,0.00007581662,0.00010520224],"domain_scores_gemma":[0.99966776,0.000002549823,0.00004355277,0.0002050365,0.000047717243,0.000033370085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005730242,0.00008685242,0.00022278163,0.00018533728,0.000022088489,0.000004605812,0.000056166708,0.00004703079,0.000069148475],"category_scores_gemma":[0.000001861719,0.00008365023,0.00011899251,0.00018126838,0.00002676148,0.000056226294,0.000029569113,0.000051174033,9.82593e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015961305,0.00003584895,0.0030874729,0.000011731711,0.0005936885,0.0000027216822,0.00030590297,0.73399705,0.25927255,0.0013189154,0.000048030302,0.0013100972],"study_design_scores_gemma":[0.00005919959,0.0000045075953,0.0013733336,0.0000075999874,0.00014722074,0.000004689696,0.000009343335,0.7415623,0.25590008,0.00085547764,0.000002179735,0.000074058],"about_ca_topic_score_codex":0.0004015059,"about_ca_topic_score_gemma":0.00003521319,"teacher_disagreement_score":0.15889807,"about_ca_system_score_codex":0.000031867192,"about_ca_system_score_gemma":0.000006209466,"threshold_uncertainty_score":0.3411157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04328842,0.00004239465,0.9511892,0.000022157235,0.00026608488,0.00021160489,0.0000018684987,0.00090084044,0.004077413],"genre_scores_gemma":[0.9843999,0.000020471301,0.015000539,0.000012281999,0.00020978159,0.000039832015,0.000048955735,0.000026445823,0.00024176265],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995876,0.000011499651,0.0001083401,0.00007498992,0.00006639932,0.00015119016],"domain_scores_gemma":[0.9997365,0.00006313893,0.000019856054,0.00008517447,0.000056288216,0.00003905513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053663207,0.00008610928,0.00007531342,0.000059273312,0.000074094,0.000015311485,0.00004179506,0.00006591791,0.000036181158],"category_scores_gemma":[0.000017798253,0.000083913124,0.00003457629,0.00008511787,0.000008923431,0.00024085164,0.000008331703,0.000073575866,0.000020766809],"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.000028022938,0.000068163165,0.016726183,0.000048071455,0.00009121387,2.437985e-7,0.0014254767,0.010559161,0.93608195,0.0031671023,0.0079014115,0.023903027],"study_design_scores_gemma":[0.00017552389,0.000033397268,0.020360753,0.0000150373735,0.000017164344,0.0000019572817,0.00016817334,0.8067807,0.16661632,0.0006588601,0.0049899686,0.00018214174],"about_ca_topic_score_codex":0.000007814979,"about_ca_topic_score_gemma":6.172794e-7,"teacher_disagreement_score":0.9411115,"about_ca_system_score_codex":0.00004501633,"about_ca_system_score_gemma":0.000003395747,"threshold_uncertainty_score":0.3421878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034028366,0.00044286216,0.963267,0.000020483527,0.00042128784,0.00019302193,0.000008010868,0.0008293476,0.00078959524],"genre_scores_gemma":[0.89387476,0.000051320778,0.1058552,0.000022842978,0.00006803466,0.000024446337,0.000004816664,0.00005976651,0.000038807702],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987424,0.00002838532,0.00042702095,0.00019598196,0.00028996734,0.00031626897],"domain_scores_gemma":[0.9992353,0.00008984406,0.000114922455,0.00030122267,0.00016597897,0.00009278445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020222765,0.00024535443,0.00024543682,0.0003025822,0.00019449274,0.00008349323,0.0001367973,0.00013433596,0.00004628067],"category_scores_gemma":[0.000013078564,0.00025377143,0.00009469167,0.00036065828,0.00007803305,0.0013168713,0.0000018017768,0.0002681389,0.00004403907],"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.00003679765,0.00011653899,0.000008364838,0.000096147414,0.000019377458,0.0000014810475,0.00037960446,0.07118715,0.44141236,0.0000028413235,0.0003902022,0.48634914],"study_design_scores_gemma":[0.00018507856,0.000036136425,0.00007412533,0.0002156637,0.000046940484,0.000015081874,0.00003337476,0.28314498,0.71552515,0.00043101519,0.000084389765,0.00020804304],"about_ca_topic_score_codex":0.00001526808,"about_ca_topic_score_gemma":0.000003428072,"teacher_disagreement_score":0.8598464,"about_ca_system_score_codex":0.00009251491,"about_ca_system_score_gemma":0.000024702676,"threshold_uncertainty_score":0.9999915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.457497,0.00027336032,0.3962787,0.0005499561,0.00035832354,0.00028062167,0.0000036501974,0.0019418471,0.14281651],"genre_scores_gemma":[0.99443233,0.000016972932,0.005286376,0.00011126355,0.000060479142,0.0000069322587,0.0000060208395,0.000010876638,0.00006874727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997061,0.000010409008,0.00006400896,0.000067299436,0.000056614906,0.000095594965],"domain_scores_gemma":[0.9997573,0.000026719428,0.000010718755,0.00015406751,0.000010203847,0.00004100471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039761675,0.0000552602,0.000046159326,0.00003540505,0.000021981914,0.00001596196,0.00002500796,0.000028323093,0.000017222086],"category_scores_gemma":[0.000008856326,0.00005178565,0.00001129643,0.00005257276,0.000011865176,0.000104554834,0.0000036931767,0.000040338473,0.00002161745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011976058,0.00039475612,0.17861564,0.000102950646,0.00007281746,0.000008802185,0.0013115909,0.03166787,0.22634552,0.10029584,0.17365307,0.2874114],"study_design_scores_gemma":[0.0001488601,0.000016723818,0.087667994,0.00003198192,0.00000866146,0.000002089865,0.00004729205,0.7683129,0.12364498,0.0003031341,0.019635929,0.00017950241],"about_ca_topic_score_codex":0.000005476362,"about_ca_topic_score_gemma":0.0000041403428,"teacher_disagreement_score":0.736645,"about_ca_system_score_codex":0.000018144605,"about_ca_system_score_gemma":0.0000013011295,"threshold_uncertainty_score":0.21117575},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865377,0.0003757211,0.1070148,0.00003592345,0.0030365752,0.000053765696,0.0000028390311,0.000300527,0.0026421729],"genre_scores_gemma":[0.99248695,0.000009093063,0.006548152,0.00003940146,0.00073776493,2.972678e-7,0.0000058974447,0.000023659919,0.00014876323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983161,0.00006194327,0.00038464324,0.00019624748,0.00046763505,0.0005733984],"domain_scores_gemma":[0.9991207,0.00007872476,0.00011084223,0.00032390904,0.000110496076,0.00025530258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011077048,0.00018722682,0.0002676374,0.00060221,0.00043663534,0.0003004078,0.0002684189,0.00005359855,0.00008135139],"category_scores_gemma":[0.000040902927,0.00015627673,0.000266872,0.0010220695,0.000073727315,0.00020619747,0.000074706215,0.0004327254,0.00009310402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004159389,0.00047126293,0.04166888,0.000038845395,0.0015139995,0.00021654631,0.003944006,0.75729305,0.040284876,0.0036485642,0.034746263,0.116132125],"study_design_scores_gemma":[0.0002868121,0.000060293307,0.042841204,0.00021616291,0.00043990932,0.00031961672,0.00026704426,0.8939851,0.020051558,0.00038683537,0.04046006,0.0006854251],"about_ca_topic_score_codex":0.0000014064193,"about_ca_topic_score_gemma":0.0000022786542,"teacher_disagreement_score":0.13669203,"about_ca_system_score_codex":0.00007103103,"about_ca_system_score_gemma":0.000019190225,"threshold_uncertainty_score":0.637278},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5927026,0.00070514396,0.40527022,0.000022461581,0.0008296681,0.000042678646,0.0000013262209,0.000060294384,0.00036560983],"genre_scores_gemma":[0.9810606,0.0009416349,0.017078914,0.000089101944,0.000781132,0.000001138328,0.0000041791563,0.000035023622,0.000008259055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872047,0.000062815234,0.00057117164,0.00014247446,0.00025594485,0.0002471424],"domain_scores_gemma":[0.9991597,0.00016984258,0.00021454201,0.00011156896,0.00025358016,0.00009077772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111386,0.00018935195,0.0002970435,0.00032690095,0.000038898892,0.00007134815,0.00024307953,0.0001301674,0.000020560396],"category_scores_gemma":[0.000032288543,0.00018773277,0.00008575301,0.0001378371,0.000055575572,0.0001804839,0.000056950325,0.00036296892,0.0000011273587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021340528,0.000058607442,0.011124297,0.000005023678,0.00012885754,0.00030198338,0.000301148,0.97607577,0.004658979,0.00016569883,0.00019302485,0.0067731943],"study_design_scores_gemma":[0.0006169768,0.00006533856,0.024537956,0.00051702437,0.000027917235,0.0010743355,0.00011271754,0.9704415,0.0016948753,0.00016038938,0.0004928513,0.0002581254],"about_ca_topic_score_codex":0.00018261117,"about_ca_topic_score_gemma":0.000020310346,"teacher_disagreement_score":0.388358,"about_ca_system_score_codex":0.00009447952,"about_ca_system_score_gemma":0.00001099728,"threshold_uncertainty_score":0.76555204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545983,0.008101556,0.004863948,0.00008700633,0.0010118395,0.00031782367,0.000004296357,0.0034628,0.12755248],"genre_scores_gemma":[0.9596598,0.00019536728,0.039666668,0.00011252911,0.00008328887,0.000007675599,9.788388e-7,0.000058590886,0.00021508045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924445,0.000021007236,0.00018310541,0.00018850098,0.00010095717,0.00026198005],"domain_scores_gemma":[0.99955493,0.000011247766,0.000024675886,0.00031910863,0.000039932278,0.000050132116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064419495,0.00015087926,0.0001428006,0.00008406585,0.00006503946,0.000038411716,0.00010190856,0.00004054208,0.00029996457],"category_scores_gemma":[0.000012098871,0.00016149151,0.000050940038,0.00012414937,0.000085483676,0.00014706471,0.000034387038,0.00014230517,0.000075124284],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022370385,0.000013323638,0.0018458774,0.000010063621,0.0000046599916,0.00010564096,0.0004874909,0.000017941096,0.04754393,0.00062233506,0.0035311102,0.94579524],"study_design_scores_gemma":[0.0017706108,0.00014700144,0.09157001,0.00068682357,0.0000901481,0.0021738017,0.0004886762,0.54489183,0.14507738,0.014314441,0.19696805,0.0018212367],"about_ca_topic_score_codex":0.000058145997,"about_ca_topic_score_gemma":0.0000027716421,"teacher_disagreement_score":0.943974,"about_ca_system_score_codex":0.000028729224,"about_ca_system_score_gemma":0.000005373827,"threshold_uncertainty_score":0.6585432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9886508,0.000071034076,0.008845208,0.00011828703,0.0002553449,0.000428563,0.0000828631,0.00018202921,0.0013658938],"genre_scores_gemma":[0.6793495,0.000028551314,0.32025892,0.000021539225,0.0002630446,0.000010718492,0.000020207539,0.000040938507,0.0000066090824],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818534,4.818776e-8,0.0006919552,0.00035525495,0.00046269174,0.00030468564],"domain_scores_gemma":[0.99823695,0.00025176094,0.0003459541,0.00012218388,0.0009649276,0.000078202924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041716624,0.00029583825,0.0005133333,0.0001208187,0.00007258201,0.000064346226,0.00077378354,0.00020570809,0.000005315301],"category_scores_gemma":[0.00044275328,0.00027160448,0.00035724335,0.00019822369,0.000209372,0.0005087942,0.00017939373,0.00032124572,2.5195763e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012602376,0.00006317194,0.0001369372,0.0003842122,0.000541372,7.983472e-8,0.00013599922,0.007515577,0.9490879,0.039177913,0.001568018,0.0012627606],"study_design_scores_gemma":[0.00094662956,0.00006738583,0.00012553646,0.00029902701,0.00010963666,0.000040816227,0.00028061395,0.7121691,0.28480724,0.00075719436,0.00019032307,0.00020648615],"about_ca_topic_score_codex":0.000023281256,"about_ca_topic_score_gemma":1.9495597e-7,"teacher_disagreement_score":0.70465356,"about_ca_system_score_codex":0.00007996325,"about_ca_system_score_gemma":0.00001757961,"threshold_uncertainty_score":0.9999736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79343975,0.00053593155,0.113770895,0.00004536169,0.0010673084,0.00032429575,0.00007643711,0.0021967287,0.08854328],"genre_scores_gemma":[0.9553615,0.000016731747,0.044387747,0.00003191953,0.000102969985,0.0000013391108,0.000039680384,0.000018888653,0.000039267736],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994003,0.00002527528,0.00019360584,0.00010365544,0.00009493604,0.00018218785],"domain_scores_gemma":[0.99928695,0.000030201607,0.000040107785,0.0005524898,0.00003860372,0.000051643972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008185862,0.00010560805,0.00016816334,0.000058186783,0.000025362338,0.0000106391235,0.00019952058,0.000052886688,0.00016179949],"category_scores_gemma":[0.0000109857065,0.00009795831,0.000025608384,0.000077007375,0.00004659259,0.00025179752,0.000084913954,0.00007693109,0.000015774158],"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.000026253758,0.00009359055,0.006248205,0.000060581933,0.0002075287,0.0000031114603,0.0003141145,0.0005054934,0.7590561,0.0022085982,0.09031285,0.14096357],"study_design_scores_gemma":[0.00052905857,0.000032776625,0.024471717,0.000130615,0.00006233872,0.0001693336,0.00016631189,0.38724923,0.5537529,0.00046444673,0.032470148,0.0005011551],"about_ca_topic_score_codex":0.000046088117,"about_ca_topic_score_gemma":0.0000039282754,"teacher_disagreement_score":0.38674372,"about_ca_system_score_codex":0.000013368588,"about_ca_system_score_gemma":0.0000040764253,"threshold_uncertainty_score":0.3994624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95015126,0.0044547007,0.013905118,0.00031839233,0.00018759418,0.00019949987,0.000005438403,0.0024255905,0.028352411],"genre_scores_gemma":[0.9805628,0.00085141894,0.018330298,0.000045794823,0.000116211835,0.000013454621,0.000003333464,0.000023622477,0.000053088632],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952275,0.00001228991,0.00014860378,0.00012013623,0.00005751434,0.00013871299],"domain_scores_gemma":[0.9997089,0.000033095857,0.000026757758,0.0001481271,0.00003407285,0.00004903113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039129718,0.00012402776,0.0001354875,0.00007110915,0.000048938648,0.000051502502,0.00007219874,0.00007415929,0.00008354356],"category_scores_gemma":[0.000015090613,0.000119853066,0.00001597989,0.00009509922,0.000039021004,0.0001611306,0.00002174986,0.00012534931,0.00003896122],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019028723,0.00009011019,0.0041186004,0.000670248,0.00015433786,0.000026770065,0.0018979765,0.004745756,0.054947425,0.0071334657,0.08385769,0.84233856],"study_design_scores_gemma":[0.00068201305,0.00011510424,0.008080283,0.0011556074,0.000060754635,0.0014471882,0.0002829812,0.19281186,0.6649583,0.014192434,0.11474524,0.0014682261],"about_ca_topic_score_codex":0.000004202809,"about_ca_topic_score_gemma":0.000015839747,"teacher_disagreement_score":0.8408704,"about_ca_system_score_codex":0.000023917972,"about_ca_system_score_gemma":0.000010248364,"threshold_uncertainty_score":0.4887466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61976856,0.00030859266,0.3703398,0.0005914833,0.00021133712,0.00026143136,0.000014990531,0.0015553755,0.0069484357],"genre_scores_gemma":[0.9933975,0.000048485756,0.0063459375,0.000047200643,0.000063539344,0.0000040479954,0.000049052298,0.00003657288,0.000007667965],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986023,0.0001032473,0.0003687305,0.00036979085,0.00019657811,0.00035938638],"domain_scores_gemma":[0.9978722,0.00015632955,0.00014559542,0.0016061338,0.00018019481,0.000039576524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032099118,0.00026508467,0.00038642305,0.00028282736,0.00015017862,0.000039192524,0.001082353,0.0002580972,0.000018875644],"category_scores_gemma":[0.00009962074,0.00021678556,0.00004682708,0.00042769188,0.0005081461,0.00012644888,0.00042435533,0.00043991042,0.00001468205],"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.000053059717,0.00009071196,0.0023943277,0.000084929816,0.00023189384,0.000034198612,0.0004030696,0.0024929803,0.5220705,0.019072922,0.0045471885,0.44852418],"study_design_scores_gemma":[0.00020724475,0.000060422248,0.00059205986,0.00024006359,0.00006620496,0.00018876551,0.00022134952,0.74839103,0.23557547,0.011783024,0.00239657,0.0002778254],"about_ca_topic_score_codex":0.00007421093,"about_ca_topic_score_gemma":0.000024252957,"teacher_disagreement_score":0.745898,"about_ca_system_score_codex":0.000031576274,"about_ca_system_score_gemma":0.000032985918,"threshold_uncertainty_score":0.8840258},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46806997,0.000043004977,0.5306698,0.00019946853,0.00093004276,0.000024909503,0.0000010007508,0.000027591366,0.00003416592],"genre_scores_gemma":[0.81133807,0.000029062865,0.18801855,0.00019603413,0.00040461708,8.490419e-7,0.0000026416901,0.000008965625,0.0000012053731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923974,0.00012153305,0.0003229464,0.00010204156,0.000116044495,0.000097721255],"domain_scores_gemma":[0.99906564,0.00048291602,0.00014021719,0.00005987923,0.00019879684,0.00005257866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025047286,0.00010760757,0.00023808389,0.00030833602,0.000035363482,0.00007078941,0.00006195942,0.00011110887,0.000020962427],"category_scores_gemma":[0.000025258265,0.0000971696,0.00007394783,0.00004205708,0.000052144656,0.0002121285,0.000015565663,0.00021030354,8.811862e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017733625,0.00008397486,0.007540774,0.00002280985,0.0007324998,0.00027445765,0.00014373672,0.041286245,0.05554896,0.0002751317,0.0036826308,0.89023143],"study_design_scores_gemma":[0.00020147047,0.000040533392,0.071083106,0.0001248163,0.000016673644,0.0046405955,0.0000038861012,0.92219627,0.0010244974,0.0005209895,0.00004999282,0.00009719755],"about_ca_topic_score_codex":0.000010748878,"about_ca_topic_score_gemma":2.3703625e-7,"teacher_disagreement_score":0.8901342,"about_ca_system_score_codex":0.000043933138,"about_ca_system_score_gemma":0.000021183005,"threshold_uncertainty_score":0.39624614},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09800286,0.00021827647,0.8811567,0.000032378717,0.00010766012,0.00015257414,0.0000017097768,0.0015835803,0.01874431],"genre_scores_gemma":[0.9335323,0.000007840182,0.06612156,0.0000858777,0.00011535992,0.0000038243684,0.000014185409,0.00003963142,0.000079423706],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922156,0.000027493848,0.00014693516,0.00011480773,0.00016129823,0.0003279218],"domain_scores_gemma":[0.9995336,0.00005742642,0.000025462925,0.00021433875,0.000052503507,0.00011665454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045076562,0.00017667607,0.0001657799,0.000073002455,0.00010946985,0.0000364138,0.00008159171,0.00006463967,0.00011280603],"category_scores_gemma":[0.0000017413413,0.00014046188,0.000037176454,0.000111452406,0.000043205408,0.00022366291,0.000027756112,0.00015013976,0.000042478554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009834556,0.0002405131,0.004791764,0.00007190138,0.0003114451,0.00005188237,0.002167853,0.3172511,0.6046408,0.002836013,0.035382096,0.032156345],"study_design_scores_gemma":[0.00052154745,0.000054408745,0.004426384,0.00015020857,0.0000587227,0.00013639788,0.000172933,0.7971801,0.19004169,0.0004984842,0.0061666123,0.0005925013],"about_ca_topic_score_codex":0.00003516342,"about_ca_topic_score_gemma":0.0000072184557,"teacher_disagreement_score":0.83552945,"about_ca_system_score_codex":0.000024617953,"about_ca_system_score_gemma":0.000005615542,"threshold_uncertainty_score":0.5727869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336289,0.00022554734,0.15323159,0.00047355823,0.0007611765,0.00008945451,0.0000030396945,0.0009884794,0.010598286],"genre_scores_gemma":[0.99544495,0.000017024735,0.0025755807,0.00087091775,0.0010304669,0.0000050086865,0.0000031749364,0.00003312223,0.00001976213],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999529,0.000008377659,0.0000641846,0.00006622569,0.00007910292,0.00025312224],"domain_scores_gemma":[0.99971557,0.000018070501,0.000013226855,0.00020659388,0.0000039854012,0.000042574753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000313461,0.00009996354,0.00009129158,0.000020983285,0.000024370796,0.00001987051,0.00006789525,0.000022096305,0.000017588778],"category_scores_gemma":[0.0000018994675,0.00010299212,0.000054996104,0.00006670992,0.000013423296,0.000190686,0.000018537557,0.00010535718,0.00009183298],"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.000013446169,0.000096157586,0.0034563134,0.000034795572,0.0002266275,0.000020521096,0.0006555589,0.008241181,0.5212748,0.0037733773,0.4036896,0.05851763],"study_design_scores_gemma":[0.0002698384,0.000032103835,0.0042175045,0.00008648647,0.000058985745,0.000019217028,0.000014997206,0.010576163,0.88356924,0.007556286,0.09268573,0.0009134698],"about_ca_topic_score_codex":0.000007409626,"about_ca_topic_score_gemma":2.538291e-7,"teacher_disagreement_score":0.3622944,"about_ca_system_score_codex":0.000030301082,"about_ca_system_score_gemma":0.0000014871562,"threshold_uncertainty_score":0.41998968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98560333,0.000066181296,0.0019660846,0.00013068448,0.0002896376,0.00039463348,0.000013475539,0.0016542732,0.009881698],"genre_scores_gemma":[0.9884953,0.000034542205,0.010947166,0.00009918455,0.00017072227,0.0000072444213,0.000031533196,0.00007012623,0.00014421271],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988881,0.000051034753,0.0002601043,0.000227236,0.00018640615,0.00038714873],"domain_scores_gemma":[0.9993089,0.000054721677,0.000052843774,0.00033388654,0.00015264394,0.00009701056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044395547,0.0002395628,0.00021817938,0.00012155885,0.00010053722,0.0001192719,0.000102934435,0.00008309225,0.00031700864],"category_scores_gemma":[0.000012652277,0.0002444383,0.00008284164,0.00014314825,0.00005216195,0.00020024588,0.000042182142,0.00018570584,0.00044931818],"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.00001028085,0.000026237227,0.0004154719,0.00006858717,0.00021838192,0.00016574083,0.0019086668,0.022729976,0.76756597,0.00024642274,0.14072207,0.0659222],"study_design_scores_gemma":[0.00048405613,0.000040978455,0.004207944,0.00009614379,0.00004408832,0.0000965747,0.0019528901,0.19227608,0.78908783,0.0013895057,0.009597663,0.00072626525],"about_ca_topic_score_codex":0.00025970754,"about_ca_topic_score_gemma":0.000015638496,"teacher_disagreement_score":0.1695461,"about_ca_system_score_codex":0.000059118982,"about_ca_system_score_gemma":0.000007396147,"threshold_uncertainty_score":0.9967904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004859913,0.0019764097,0.99205476,0.00011872488,0.0005320064,0.00016246898,0.0000038685835,0.00006713632,0.00022473108],"genre_scores_gemma":[0.98381495,0.00016705888,0.015585955,0.000024291452,0.0003574638,0.000010943805,0.000008053281,0.000023142142,0.000008141637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895865,0.000046358327,0.00056858285,0.0000672104,0.00022920189,0.00013001161],"domain_scores_gemma":[0.99893403,0.00021745099,0.00027270234,0.00018350445,0.00033989208,0.000052402003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884002,0.000111953996,0.00021501532,0.00020867679,0.000034860623,0.000091345755,0.00054355094,0.00006453912,0.0000011427745],"category_scores_gemma":[0.00004437732,0.000112187576,0.00008020408,0.0000967956,0.000019851133,0.00021212171,0.000046915775,0.00025374527,8.2483086e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016992664,0.00001821931,0.000046512556,3.2960564e-8,0.00008411611,0.000007498493,0.00036394142,0.98859715,0.00009805059,0.0023927775,0.0001419478,0.008232752],"study_design_scores_gemma":[0.00077282725,0.00006143178,0.00031131983,0.0010337585,0.000012568985,0.00011061818,0.0006018739,0.9950489,0.000102042686,0.001512786,0.0003219334,0.00010996157],"about_ca_topic_score_codex":0.00015070257,"about_ca_topic_score_gemma":0.00004736938,"teacher_disagreement_score":0.97895503,"about_ca_system_score_codex":0.00030188606,"about_ca_system_score_gemma":0.00006199635,"threshold_uncertainty_score":0.45748764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.894434,0.0022270558,0.098746136,0.00035560373,0.0016698609,0.0008322363,0.000009755621,0.00031314875,0.0014122413],"genre_scores_gemma":[0.99737644,0.0002667648,0.0012242822,0.00017940065,0.0007852269,0.00005940928,0.0000035360483,0.00003848258,0.000066448505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860674,0.00006422575,0.00042798213,0.00022785211,0.00021266408,0.00046055435],"domain_scores_gemma":[0.99928313,0.000053528423,0.0000963513,0.00015752288,0.00014871433,0.0002607719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035768826,0.00022616172,0.0003448297,0.0002469357,0.00016701886,0.0002005781,0.000117895135,0.00009417048,0.0000012368698],"category_scores_gemma":[0.000024725401,0.0002117061,0.000031336785,0.00031194655,0.000013883345,0.00019414962,0.000020738142,0.0003807581,0.000004060625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010854942,0.00035093486,0.018649515,0.00048023227,0.00040247245,0.000121131285,0.012669756,0.20700787,0.2756829,0.002529355,0.026680183,0.4553171],"study_design_scores_gemma":[0.0029731605,0.0009983716,0.03376873,0.0046679657,0.00019970478,0.0032279768,0.0017035488,0.70965266,0.037547,0.001543434,0.2002029,0.003514526],"about_ca_topic_score_codex":0.00007346154,"about_ca_topic_score_gemma":0.000009865552,"teacher_disagreement_score":0.50264484,"about_ca_system_score_codex":0.00011094608,"about_ca_system_score_gemma":0.000011794296,"threshold_uncertainty_score":0.86331236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019074922,0.000057201505,0.95391375,0.000011218917,0.000091667964,0.00008742034,1.809816e-7,0.000904735,0.025858916],"genre_scores_gemma":[0.90560776,0.00002323162,0.094231464,0.000033910965,0.000051141495,3.0654672e-7,0.0000021957287,0.000013897576,0.000036108766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996676,0.0000054082484,0.00008668438,0.00008057749,0.00004971735,0.00011001982],"domain_scores_gemma":[0.9998371,0.00001933852,0.00001193336,0.00007309836,0.000029162044,0.000029337538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055356275,0.000069078495,0.000061836225,0.00007419281,0.00004228075,0.00002600175,0.000017522476,0.000046316512,0.000008174819],"category_scores_gemma":[0.000004734887,0.000067260145,0.000010564156,0.000077714416,0.000015688152,0.00007209129,0.0000109552175,0.00005647441,9.916523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003322472,0.000023466637,0.00073679705,0.000042016178,0.000074146665,0.000060188017,0.0007631979,0.57702506,0.08352546,0.0008223053,0.005619742,0.3312744],"study_design_scores_gemma":[0.00006644498,0.000010611144,0.0002667937,0.000021603319,0.0000050465283,0.000031532003,0.000060715014,0.90957433,0.08929152,0.00014231644,0.0004359205,0.00009313788],"about_ca_topic_score_codex":0.00003395082,"about_ca_topic_score_gemma":0.000020632404,"teacher_disagreement_score":0.88653284,"about_ca_system_score_codex":0.000016585203,"about_ca_system_score_gemma":0.0000018267958,"threshold_uncertainty_score":0.2742789},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28185758,0.00007579099,0.71094507,0.0000052505234,0.000048002734,0.0001851261,8.205688e-7,0.0010772728,0.0058050724],"genre_scores_gemma":[0.7212657,0.000009017285,0.27857167,0.000054588312,0.000026701808,0.000025295702,0.000003221776,0.000030284933,0.000013554959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923474,0.0000063747366,0.00015757653,0.00021827767,0.00013710863,0.00024590542],"domain_scores_gemma":[0.9994571,0.00002778039,0.000018043145,0.00032541546,0.00009121024,0.000080445054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006532501,0.00015872811,0.00014784234,0.00036930808,0.000043302472,0.000038299764,0.00017062943,0.00003247292,0.000013039641],"category_scores_gemma":[0.000020291256,0.00013420421,0.000033290064,0.0006144231,0.000010952705,0.00013825289,0.000034779874,0.00014894159,0.000061793995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001273111,0.00012243798,0.00038804475,0.000048863185,0.0001676921,0.000044540247,0.00051399384,0.8818638,0.034221493,0.00554639,0.002287908,0.07466758],"study_design_scores_gemma":[0.000072606555,0.00003381673,0.00007916148,0.000016886934,0.000011615521,0.00001606393,0.00002327848,0.90239304,0.09604174,0.0009801425,0.000111848414,0.00021982232],"about_ca_topic_score_codex":0.00012547827,"about_ca_topic_score_gemma":0.0000049356977,"teacher_disagreement_score":0.4394081,"about_ca_system_score_codex":0.00004139052,"about_ca_system_score_gemma":0.0000055280943,"threshold_uncertainty_score":0.5472689},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43033662,0.00003254339,0.56688124,0.00032870515,0.00012291415,0.0001489291,0.0000023671303,0.0006935706,0.0014531395],"genre_scores_gemma":[0.9915444,0.0000016411399,0.0072911107,0.00097444037,0.00014106357,0.000003670129,0.000010259751,0.000029673301,0.000003687172],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991382,0.000015128526,0.00020411218,0.00013566426,0.00023776003,0.00026915676],"domain_scores_gemma":[0.99958825,0.0000129144955,0.00006464813,0.00012240633,0.00007539807,0.000136411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010018112,0.00019641974,0.00018000885,0.00009052509,0.00008735073,0.00022134479,0.00008036557,0.00006074482,0.0000023574135],"category_scores_gemma":[0.0000029261696,0.00017519678,0.000019116418,0.00013141603,0.00009210933,0.0007518099,0.000014990428,0.00017851486,0.00001104473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031836718,0.000037744183,0.00093373255,0.00039898205,0.00013716739,0.00026384764,0.008782258,0.22551157,0.512541,0.000012767944,0.05563029,0.19543228],"study_design_scores_gemma":[0.0010375538,0.00012233054,0.00034357034,0.0003521764,0.000058904385,0.00016690276,0.00020799546,0.7559606,0.23642741,0.000051136765,0.0046658237,0.0006056063],"about_ca_topic_score_codex":0.000022789847,"about_ca_topic_score_gemma":0.000001565,"teacher_disagreement_score":0.56120783,"about_ca_system_score_codex":0.000038311755,"about_ca_system_score_gemma":0.000038825252,"threshold_uncertainty_score":0.7144317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38138407,0.00005617448,0.6107741,0.000103009115,0.00005996044,0.0001964878,0.000003119718,0.0008572738,0.0065657934],"genre_scores_gemma":[0.9974359,0.000023768154,0.0023773608,0.000074925585,0.0000349873,0.0000049433606,0.000014488503,0.000021777754,0.000011796549],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993482,0.000017491562,0.00015338171,0.00014168504,0.00008518419,0.00025405543],"domain_scores_gemma":[0.9997229,0.00005493627,0.000010891365,0.00012399917,0.000030155328,0.000057102887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003312442,0.00013184808,0.00015688884,0.00010999749,0.000021762775,0.000035643377,0.00005580066,0.00008168531,0.00006324569],"category_scores_gemma":[0.000007973462,0.00012537085,0.00004161755,0.00021281175,0.000032636173,0.00016452964,0.000023500803,0.00018080547,0.00002785565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000166598,0.00069554296,0.008139815,0.00015606859,0.0010511864,0.0013878884,0.0026279415,0.29449296,0.3223999,0.033546876,0.09091847,0.24441673],"study_design_scores_gemma":[0.00018504892,0.00001339539,0.0015195998,0.00005640407,0.000006079537,0.000022802948,0.000040491166,0.915077,0.042183813,0.040679123,0.000024273102,0.00019199694],"about_ca_topic_score_codex":0.000277145,"about_ca_topic_score_gemma":0.000056797147,"teacher_disagreement_score":0.620584,"about_ca_system_score_codex":0.000030614665,"about_ca_system_score_gemma":0.0000036441343,"threshold_uncertainty_score":0.51124746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78220594,0.010896989,0.17865528,0.00008761085,0.00030776582,0.0005612885,0.0000115617895,0.0009191461,0.026354428],"genre_scores_gemma":[0.85080534,0.00033419707,0.14866838,0.00003442807,0.000052508905,0.000039612532,0.000001415745,0.000033677585,0.000030421063],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991673,0.000013010896,0.00020175813,0.00022802156,0.000079516925,0.00031035425],"domain_scores_gemma":[0.9996814,0.000031918382,0.000026734511,0.00016968543,0.000043051718,0.000047193902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014632082,0.00015633304,0.00015758527,0.00008125012,0.00012578425,0.000046614954,0.000099959114,0.00003469073,0.000028962126],"category_scores_gemma":[0.000015086681,0.00016838001,0.000048078826,0.00009216695,0.00011102217,0.00024286393,0.000018729212,0.00010308717,0.0000026886307],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002367194,0.0000107366495,0.001968518,0.00004511972,0.0000020340972,0.00001209521,0.00092812954,0.0000041833155,0.033415683,0.000555866,0.00033751983,0.96269643],"study_design_scores_gemma":[0.0044746473,0.00042039753,0.06551996,0.0013897746,0.00016621828,0.0012509557,0.0036791055,0.26621377,0.46745148,0.15208983,0.034633543,0.0027103103],"about_ca_topic_score_codex":0.00004033063,"about_ca_topic_score_gemma":0.000006870174,"teacher_disagreement_score":0.95998615,"about_ca_system_score_codex":0.000025309339,"about_ca_system_score_gemma":0.0000066798434,"threshold_uncertainty_score":0.68663377},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042150225,0.00011591965,0.98765963,0.000006777935,0.00004015467,0.00023720534,0.000014537261,0.00084768224,0.0068630953],"genre_scores_gemma":[0.74034643,0.000015082536,0.25951177,0.000021937516,0.00001023715,0.000024354475,0.0000011908364,0.00005150633,0.000017520353],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990988,0.000018429555,0.0002591632,0.00023915614,0.00015832396,0.00022612585],"domain_scores_gemma":[0.99933815,0.000029022614,0.00008696101,0.00028323205,0.00020469715,0.000057916248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051090043,0.00021794361,0.00022865935,0.0002173843,0.0001653216,0.000039777842,0.0001239354,0.000054088134,0.000008901094],"category_scores_gemma":[7.469997e-7,0.0002141968,0.00006800642,0.00031740672,0.0001308525,0.00039363236,0.0000013334699,0.00024519805,0.0000032007238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019534206,0.00018690177,0.000004458534,0.00013789197,0.000107186774,0.000016025586,0.0009764949,0.19580233,0.28618732,0.000015622678,0.00006039036,0.51631004],"study_design_scores_gemma":[0.00016183931,0.00002754576,0.000014793341,0.0002417586,0.00006144454,0.00002592682,0.00015581162,0.56382704,0.43495837,0.00033623455,0.000007143151,0.0001821316],"about_ca_topic_score_codex":0.000028764543,"about_ca_topic_score_gemma":0.000012116083,"teacher_disagreement_score":0.73613137,"about_ca_system_score_codex":0.000051130788,"about_ca_system_score_gemma":0.000044520973,"threshold_uncertainty_score":0.8734692},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34251451,0.00008777404,0.6555462,0.000478506,0.00047144725,0.00012633996,0.000001607453,0.00055540685,0.00021820239],"genre_scores_gemma":[0.8672022,0.000152399,0.13199022,0.0004343024,0.00016255419,0.000014121284,0.000012763519,0.000026837015,0.0000045907886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916965,0.00008103873,0.0001914644,0.0002185985,0.00017141842,0.00016783288],"domain_scores_gemma":[0.9995189,0.00014058867,0.000043650976,0.00011786225,0.000051481067,0.00012756113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022289675,0.00015092059,0.00017091642,0.00017727315,0.000104771985,0.00012792213,0.00005254023,0.000047691934,0.00001543824],"category_scores_gemma":[0.00004616806,0.0001443563,0.000038460228,0.00013162121,0.00007515065,0.0001506987,0.000029996821,0.0002398626,0.0000014315748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001261192,0.00003366382,0.00071650586,0.00006407842,0.000052066433,0.000027344453,0.000113903865,0.00024692103,0.14243324,0.00014564164,0.0007843783,0.8553696],"study_design_scores_gemma":[0.0005603652,0.000019040763,0.0065668006,0.00024988595,0.000016858203,0.00019354127,0.000008785906,0.98592246,0.0052952413,0.00088059483,0.00013096358,0.00015545951],"about_ca_topic_score_codex":0.00012156914,"about_ca_topic_score_gemma":0.0000010202211,"teacher_disagreement_score":0.9856755,"about_ca_system_score_codex":0.000016252821,"about_ca_system_score_gemma":0.000007791769,"threshold_uncertainty_score":0.58866787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8262776,0.000101190424,0.16931753,0.00002107267,0.0000833808,0.00036878194,0.000014776506,0.00039247583,0.0034232137],"genre_scores_gemma":[0.96373355,0.000054819688,0.03604767,0.000013040686,0.000046007615,0.000043912718,0.000025116147,0.000017079296,0.000018806146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952585,0.000008963393,0.00012904358,0.00013317865,0.00006542479,0.00013751569],"domain_scores_gemma":[0.9996939,0.000043934975,0.000034394317,0.00012125964,0.00006960279,0.000036914687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045188746,0.0001118842,0.00012780826,0.00006433042,0.00012215799,0.000015984904,0.000047020956,0.000063996566,0.000003590239],"category_scores_gemma":[0.000020764333,0.0001098147,0.000028175664,0.000069381895,0.00012389391,0.00013761378,0.000016171089,0.000060312905,0.000001536671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002611728,0.000120302844,0.01510543,0.0005840431,0.0005128837,0.00003116162,0.0071041724,0.016142396,0.13837798,0.5650032,0.00397992,0.25277737],"study_design_scores_gemma":[0.0014410415,0.00014261731,0.012352152,0.00014247233,0.000058130394,0.00043244273,0.00058619125,0.5583794,0.35299554,0.063444845,0.009214826,0.0008103593],"about_ca_topic_score_codex":0.000007926545,"about_ca_topic_score_gemma":0.000006613157,"teacher_disagreement_score":0.542237,"about_ca_system_score_codex":0.000042949017,"about_ca_system_score_gemma":0.0000140562715,"threshold_uncertainty_score":0.44781134},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002449363,0.00046348193,0.989913,0.00015567472,0.000008250654,0.0007252204,0.000007331885,0.00110053,0.0051771593],"genre_scores_gemma":[0.2870783,0.00013479647,0.71184224,0.00012565979,0.00018176787,0.0005308896,0.000027365677,0.000048131256,0.000030866682],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993021,0.000005271296,0.00021106264,0.00019074434,0.00011613676,0.00017468038],"domain_scores_gemma":[0.99927306,0.00007785936,0.000057252728,0.00044513113,0.00006043277,0.000086290354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044063087,0.0001697512,0.00018026959,0.00009247721,0.00014227055,0.00009163595,0.00020828862,0.000046045734,0.000009938614],"category_scores_gemma":[0.0000010588437,0.0001592237,0.000026533446,0.00023106452,0.00008326961,0.000088886096,0.000049138678,0.00009587946,0.00004914022],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000770865,0.00077853096,0.0002591045,0.0007980984,0.00044929446,0.0000056665476,0.0019503329,0.04106879,0.013749646,0.26464802,0.04541368,0.6308711],"study_design_scores_gemma":[0.00030915375,0.000030428315,0.00025074885,0.00012050156,0.00009895057,0.000122032594,0.00008760933,0.51633126,0.0026403798,0.014267921,0.46520212,0.0005388733],"about_ca_topic_score_codex":0.0000012720533,"about_ca_topic_score_gemma":0.0000026172247,"teacher_disagreement_score":0.63033223,"about_ca_system_score_codex":0.000028831266,"about_ca_system_score_gemma":0.000008416015,"threshold_uncertainty_score":0.6492954},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99179536,0.00028130002,0.0030770232,0.00009339701,0.0009952793,0.00008897705,0.000002912308,0.00036385172,0.003301878],"genre_scores_gemma":[0.9892135,0.000050520168,0.009786898,0.00011405152,0.0007182347,0.000001936718,5.581363e-7,0.00005186303,0.00006241169],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882054,0.000070405375,0.0002887871,0.000093196475,0.00020494197,0.00052213744],"domain_scores_gemma":[0.999446,0.000060157534,0.000052908927,0.00019835209,0.00005976484,0.00018282003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023925111,0.00019050701,0.0002128221,0.0002427829,0.00006323357,0.00006345356,0.00012217098,0.00010382833,0.000056697372],"category_scores_gemma":[0.000029364728,0.00018166471,0.000100806436,0.00017857245,0.000035985464,0.00018878191,0.000008286947,0.000541854,0.00007691138],"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.000062809835,0.00020776379,0.0066320966,0.000036621,0.000096109834,0.0008614786,0.00093781675,0.10149986,0.8274734,0.000027039052,0.05823792,0.0039270665],"study_design_scores_gemma":[0.0010554885,0.00005980354,0.0047108415,0.00026236253,0.000041105795,0.0018184616,0.00014923164,0.07519698,0.8980538,0.00017404827,0.017785162,0.0006926664],"about_ca_topic_score_codex":0.000008576926,"about_ca_topic_score_gemma":0.0000031997977,"teacher_disagreement_score":0.07058044,"about_ca_system_score_codex":0.00009641584,"about_ca_system_score_gemma":0.000016914704,"threshold_uncertainty_score":0.7408072},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5880834,0.0000084944095,0.40942535,0.00014062761,0.000044009,0.00013275279,0.0000032812814,0.00032019726,0.0018419154],"genre_scores_gemma":[0.96849644,0.0000021393835,0.031176714,0.0002234401,0.000027305778,0.0000028961324,0.000024115121,0.000015755078,0.000031170264],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999302,0.000051570732,0.0002213949,0.00014843643,0.00012587852,0.00015070202],"domain_scores_gemma":[0.9993682,0.000115043404,0.00003507644,0.00020567761,0.0002227487,0.00005329183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011637406,0.0001204037,0.00023729706,0.0002887368,0.0000408422,0.0000671119,0.000044586202,0.000029962606,0.0001082469],"category_scores_gemma":[0.000019174862,0.00012211248,0.00007867121,0.0004944269,0.000016140024,0.00018912599,0.000026627133,0.000060851202,0.000024692497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002250843,0.000007761961,0.00077450013,0.0000046684404,0.00018531468,0.0000027416922,0.0001497733,0.28159034,0.70874506,0.000083827676,0.0031112877,0.005342474],"study_design_scores_gemma":[0.000043668006,0.0000026136718,0.02487,0.000012326092,0.00007039261,0.0000013123273,0.00003999604,0.7015718,0.2731103,0.00012387846,0.000050396186,0.000103264574],"about_ca_topic_score_codex":0.0006543352,"about_ca_topic_score_gemma":0.00007850239,"teacher_disagreement_score":0.43563476,"about_ca_system_score_codex":0.000026433863,"about_ca_system_score_gemma":0.000006089196,"threshold_uncertainty_score":0.49796027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0645301,0.000093994706,0.9133613,0.000074139556,0.00022403582,0.00008507981,0.0000023326447,0.0013301518,0.020298839],"genre_scores_gemma":[0.98564047,0.000010600743,0.013885713,0.00014183052,0.00008279614,0.000006404585,0.000033855376,0.00002129502,0.00017702639],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995693,0.000023956807,0.00011288234,0.00010167018,0.00007740032,0.00011481506],"domain_scores_gemma":[0.999756,0.000023304656,0.000021140966,0.00013429059,0.000036003505,0.000029311135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003261089,0.000090308626,0.00009047712,0.0000387852,0.000036092555,0.000041770643,0.000054542856,0.000032155167,0.00006619183],"category_scores_gemma":[0.000010733295,0.000089267465,0.000023467632,0.000056700348,0.00000972052,0.00010596206,0.000015004177,0.00004470772,0.0000143599755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008959061,0.000029836876,0.00041972258,0.000012292026,0.000044950775,0.0000017975688,0.00026911814,0.08251132,0.6085136,0.0058029885,0.27681482,0.025570577],"study_design_scores_gemma":[0.00018687078,0.000005457837,0.000633276,0.000009957989,0.000007814757,0.000003927698,0.0000045752713,0.90058875,0.0922762,0.00067299453,0.0054790983,0.00013110718],"about_ca_topic_score_codex":0.000033145832,"about_ca_topic_score_gemma":8.5460755e-7,"teacher_disagreement_score":0.9211104,"about_ca_system_score_codex":0.000017497714,"about_ca_system_score_gemma":0.0000018720846,"threshold_uncertainty_score":0.36402217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642328,0.0008997744,0.02802803,0.000098524804,0.00041632538,0.00012521965,0.0000032764524,0.000913399,0.0052826437],"genre_scores_gemma":[0.99575543,0.00029559934,0.0030946406,0.00020408559,0.00053099217,0.0000039419147,0.000016349444,0.000028277318,0.00007067204],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994511,0.0000119791885,0.00010400667,0.00013005944,0.00014478092,0.00015804383],"domain_scores_gemma":[0.9994513,0.0000602963,0.000021362017,0.00038549193,0.000028267317,0.000053324253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000011081505,0.00013412465,0.00013239225,0.000014966853,0.00011649146,0.000021547974,0.00021475082,0.000056106976,0.000015183121],"category_scores_gemma":[0.0000051806123,0.00010909942,0.000062259714,0.00012403977,0.00003713683,0.00010532317,0.00005120579,0.00016641067,0.00013032946],"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.000053326195,0.00015106614,0.0049561327,0.000026746564,0.00084669376,0.00018651572,0.03767054,0.011326588,0.086403176,0.011828636,0.68800974,0.15854083],"study_design_scores_gemma":[0.0010489002,0.00014509007,0.07622411,0.00027690796,0.00015849511,0.000010240381,0.0004217841,0.022871133,0.32554308,0.3340741,0.23751746,0.0017087093],"about_ca_topic_score_codex":0.0017091486,"about_ca_topic_score_gemma":0.0001282106,"teacher_disagreement_score":0.4504923,"about_ca_system_score_codex":0.000029579658,"about_ca_system_score_gemma":0.000025894256,"threshold_uncertainty_score":0.44489452},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007537108,0.00015501547,0.9857324,0.000020415364,0.0004978512,0.00011550861,2.2220475e-7,0.0006031387,0.0053383824],"genre_scores_gemma":[0.57198673,0.00011626505,0.42742366,0.00007948034,0.00030342568,0.0000015039686,0.000006753017,0.00005699031,0.000025204701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989832,0.000022054115,0.00037557815,0.000112340065,0.00020791644,0.00029890766],"domain_scores_gemma":[0.9994925,0.000049067585,0.00011408059,0.00013337404,0.00012099977,0.00008995809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045164904,0.00015784382,0.00014655336,0.00021263148,0.00015812425,0.00012877876,0.000106693406,0.00009127104,0.00002257175],"category_scores_gemma":[0.000049593084,0.00015571812,0.000052185744,0.00028278385,0.000014232252,0.00020171516,0.000019845733,0.00034811685,0.000008584013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018721745,0.000013289098,0.00004865573,0.000011554263,0.000019176687,0.000027719103,0.00013019015,0.9432331,0.0016668264,0.000038578208,0.00012235234,0.05466989],"study_design_scores_gemma":[0.00018102032,0.00009566195,0.000033163265,0.00022545499,0.000012512274,0.00021541084,0.00005308174,0.99014837,0.007182414,0.00012088022,0.0015329757,0.00019907446],"about_ca_topic_score_codex":0.00000127603,"about_ca_topic_score_gemma":0.0000013891471,"teacher_disagreement_score":0.5644496,"about_ca_system_score_codex":0.00010153224,"about_ca_system_score_gemma":0.000008465349,"threshold_uncertainty_score":0.6350001},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12785009,0.00011277626,0.8679575,0.00008314037,0.0008046525,0.0006892745,0.000011796255,0.00027959165,0.0022112092],"genre_scores_gemma":[0.9948081,0.0000326965,0.0048063537,0.00009557284,0.00013270065,0.00006672455,0.0000055123514,0.000027113821,0.00002521879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.00020617306,0.00032876432,0.00028996103,0.00019976127,0.00021402627],"domain_scores_gemma":[0.9988167,0.00046237372,0.00017401236,0.00032426132,0.00014325893,0.00007938161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006563982,0.00021854967,0.00034154608,0.00008678608,0.000110610956,0.000103437895,0.00023564884,0.00007709352,0.000007977337],"category_scores_gemma":[0.000023115252,0.00016109193,0.00006298806,0.000062538056,0.00004283023,0.00008384792,0.000026265145,0.00013077559,0.000004618803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022516813,0.00023771555,0.0004146304,0.001126888,0.00055972754,0.000006538108,0.0017843585,0.2808703,0.15152663,0.33166483,0.021265928,0.2103173],"study_design_scores_gemma":[0.000233952,0.00050051924,0.00018260455,0.0005305637,0.000014943784,0.0000086204755,0.00006872272,0.98089445,0.014137352,0.0021772538,0.0010450151,0.00020602452],"about_ca_topic_score_codex":0.00021824271,"about_ca_topic_score_gemma":0.00000835577,"teacher_disagreement_score":0.866958,"about_ca_system_score_codex":0.000018462606,"about_ca_system_score_gemma":0.000013523606,"threshold_uncertainty_score":0.6569138},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45885158,0.00008647196,0.5400659,0.000004324716,0.00010182213,0.00010031842,2.003788e-7,0.0002703531,0.0005190297],"genre_scores_gemma":[0.9639752,0.000052384807,0.03592332,0.000009819513,0.000016869662,0.0000050462427,9.645373e-8,0.00001304621,0.000004234708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992638,0.0000064001747,0.00015761016,0.00015124923,0.00017262515,0.0002483173],"domain_scores_gemma":[0.9996445,0.00010250889,0.000017812232,0.0001356849,0.0000443604,0.000055099892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004975153,0.00010361357,0.00013200493,0.00024900347,0.000031994623,0.0000306435,0.00016785452,0.000040488634,0.0000014947423],"category_scores_gemma":[0.0001488417,0.00010656478,0.000011757782,0.00040578097,0.0001116135,0.0001841554,0.000050363058,0.000111075744,0.0000013571691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.3223357e-7,0.0000022370934,0.000051432035,0.000020438243,0.0000013895444,0.0000012136404,0.00032285418,0.76980776,0.22716245,0.000064026746,0.000011130514,0.0025545622],"study_design_scores_gemma":[0.000077536264,0.000023717497,0.000022987266,0.00012393603,0.0000021049377,0.000008108251,0.00003408166,0.93653625,0.06259262,0.00005909751,0.00040236666,0.00011718291],"about_ca_topic_score_codex":0.000016639868,"about_ca_topic_score_gemma":0.0000012033387,"teacher_disagreement_score":0.5051236,"about_ca_system_score_codex":0.00003876804,"about_ca_system_score_gemma":0.000013205621,"threshold_uncertainty_score":0.43455857},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54155916,0.00022717442,0.43915203,0.00010601788,0.0009499182,0.00044371875,0.000010241553,0.004890994,0.012660745],"genre_scores_gemma":[0.88896865,0.0000015050981,0.11030844,0.00051545113,0.00010761968,0.0000034198101,0.000011617953,0.00004248154,0.000040832205],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.000026146425,0.00015660672,0.00014792124,0.00018395374,0.00036542641],"domain_scores_gemma":[0.9993412,0.0001474506,0.000022395405,0.00031681862,0.000048644975,0.0001235013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080901984,0.00019651752,0.00017022942,0.0001164119,0.00007228748,0.000049994607,0.00013520596,0.00008722311,0.00008641473],"category_scores_gemma":[0.000030762778,0.00017894979,0.00006495348,0.000119952216,0.000027085973,0.00020032653,0.00005496242,0.00017089074,0.000065961394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011307218,0.00058440585,0.02025879,0.0000674781,0.00013552852,0.000038642655,0.00015014104,0.34950992,0.57053477,0.00032507253,0.04738301,0.010899143],"study_design_scores_gemma":[0.00035629034,0.000008385326,0.0028383732,0.00005104991,0.000005167521,0.000003320135,0.0000037387674,0.7502508,0.24434058,0.00000862926,0.001942635,0.00019099719],"about_ca_topic_score_codex":0.00004083526,"about_ca_topic_score_gemma":0.0000073686083,"teacher_disagreement_score":0.4007409,"about_ca_system_score_codex":0.00003801966,"about_ca_system_score_gemma":0.00000769509,"threshold_uncertainty_score":0.7297361},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023726799,0.0022289709,0.92350966,0.000028542574,0.00023690624,0.0005883787,0.0000070547258,0.0030725256,0.046601173],"genre_scores_gemma":[0.8712753,0.00029076805,0.12806824,0.00005424649,0.000087263434,0.000029142811,0.000009070785,0.00006878357,0.000117203934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991108,0.00001723288,0.0002984244,0.00016921917,0.0001275641,0.0002767263],"domain_scores_gemma":[0.9994923,0.000041125757,0.00007314972,0.00027121443,0.000039950934,0.00008228636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015117684,0.00017824411,0.00021744364,0.000047817648,0.00006824964,0.000044076547,0.00009109615,0.00006988557,0.00004958493],"category_scores_gemma":[0.000021094957,0.00016800434,0.000037315345,0.00017882258,0.000046858728,0.00009462819,0.000035870326,0.000091450594,0.000023671739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000172263,0.00090436696,0.06561449,0.0061636576,0.0013376857,0.0012704062,0.026631385,0.008243028,0.0032163,0.5196152,0.123494305,0.24333692],"study_design_scores_gemma":[0.0010242974,0.0002837637,0.005407241,0.0041117696,0.0006450399,0.0006839878,0.0010622327,0.53779227,0.020691806,0.29306692,0.1316464,0.003584264],"about_ca_topic_score_codex":0.000010112635,"about_ca_topic_score_gemma":0.0000040734867,"teacher_disagreement_score":0.8475485,"about_ca_system_score_codex":0.000015620677,"about_ca_system_score_gemma":0.0000045296897,"threshold_uncertainty_score":0.6851018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97957176,0.0006893689,0.019065,0.00028948952,0.00013034567,0.0000723721,0.00003580532,0.0000098651135,0.00013596528],"genre_scores_gemma":[0.998096,0.00028796785,0.0014918734,0.000029719897,0.00005762149,4.0933958e-7,0.00003028769,0.000004705674,0.0000014306953],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914974,0.00005343261,0.00038220664,0.000073708004,0.0002884651,0.000052474265],"domain_scores_gemma":[0.9990917,0.00018760836,0.00025427504,0.00014349363,0.00030917782,0.000013776572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121663,0.00006329708,0.00016373544,0.00026041258,0.000013915807,0.000035789468,0.00033657605,0.000020879967,0.0000137265515],"category_scores_gemma":[0.00006125358,0.00004575151,0.000044949247,0.00015796536,0.00003526242,0.00038380967,0.00005128306,0.000105388266,2.3508356e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016820287,0.00018829803,0.19952698,0.00004057096,0.0024080332,0.00009811511,0.0049965912,0.034075126,0.69495493,0.0002404612,0.0015511562,0.06175153],"study_design_scores_gemma":[0.0001779078,0.000016989674,0.2199961,0.00022357734,0.0001034643,0.000026620868,0.00044981454,0.7682534,0.009922977,0.000723361,0.000052129613,0.00005366138],"about_ca_topic_score_codex":0.0004969724,"about_ca_topic_score_gemma":0.000010437949,"teacher_disagreement_score":0.7341783,"about_ca_system_score_codex":0.000012776618,"about_ca_system_score_gemma":0.000012356543,"threshold_uncertainty_score":0.18656924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300548,0.00012369672,0.8862818,0.00006270432,0.00024171344,0.00030569395,0.000002396122,0.0011106239,0.048865892],"genre_scores_gemma":[0.9783199,0.000013324326,0.021079753,0.00002013021,0.00018164904,0.000060457427,0.000023552624,0.00001885671,0.00028240026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996236,0.0000072504067,0.00009472991,0.00007663627,0.000052412106,0.00014535505],"domain_scores_gemma":[0.99973726,0.000025956082,0.00001600408,0.00016667407,0.000018527977,0.000035603596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059447913,0.00006765922,0.000064685206,0.00003720157,0.0000272225,0.000017806728,0.000049188755,0.000045622808,0.000013125771],"category_scores_gemma":[0.00001044753,0.0000638414,0.00003301133,0.000056021832,0.000011176709,0.0001642506,0.000008176459,0.00003472987,0.000019916337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050642524,0.00025523125,0.01707418,0.000098149976,0.00017852537,6.106031e-7,0.0019873965,0.009412686,0.21919802,0.17485285,0.16689001,0.41000172],"study_design_scores_gemma":[0.00019416839,0.00001612444,0.021240491,0.000013254404,0.000026187317,0.0000053233657,0.00047326952,0.70653635,0.25961637,0.0019225517,0.009706067,0.0002498466],"about_ca_topic_score_codex":0.0000049769533,"about_ca_topic_score_gemma":0.0000013747668,"teacher_disagreement_score":0.9153144,"about_ca_system_score_codex":0.000019005145,"about_ca_system_score_gemma":0.0000018141025,"threshold_uncertainty_score":0.26033765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866875,0.0001765455,0.2076192,0.0001040775,0.00006953519,0.00024321355,9.866205e-7,0.00046839262,0.004630545],"genre_scores_gemma":[0.9769526,0.0000041333496,0.02294581,0.000023168875,0.00002692254,0.000005749224,3.414739e-7,0.000014666787,0.000026611639],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993949,0.000032137996,0.00019475912,0.000085999636,0.00013406169,0.00015814285],"domain_scores_gemma":[0.9995281,0.00014185248,0.000033004515,0.00023708615,0.000023955916,0.00003601517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026413612,0.00009927035,0.00018903683,0.000035303743,0.00004129501,0.000028934473,0.000119269265,0.000050212377,0.000015893453],"category_scores_gemma":[0.00014461779,0.00006884765,0.00005241221,0.000092458584,0.00009685862,0.000041449708,0.00008936454,0.00010594299,0.0000032065504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028342925,0.00036453965,0.006804447,0.0033237094,0.00028807804,0.000008341948,0.005377022,0.00053400313,0.027239721,0.46341422,0.0018455954,0.49077198],"study_design_scores_gemma":[0.0009934907,0.00021757146,0.0053189937,0.0019364166,0.00021236546,0.00009782362,0.00097316,0.2536902,0.16298354,0.5582499,0.014213952,0.0011125855],"about_ca_topic_score_codex":0.000005506745,"about_ca_topic_score_gemma":0.0000015123328,"teacher_disagreement_score":0.4896594,"about_ca_system_score_codex":0.000008914358,"about_ca_system_score_gemma":0.0000020594837,"threshold_uncertainty_score":0.28075257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8439385,0.00047307566,0.12116645,0.0005085515,0.00015148369,0.00046583317,0.0000017460782,0.0006940104,0.032600287],"genre_scores_gemma":[0.96349835,0.000014590463,0.036280487,0.00013909003,0.000025476384,0.0000025436987,0.0000012079735,0.000018455978,0.000019815254],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925166,0.00005080429,0.00021654088,0.00011810506,0.00014859758,0.0002143153],"domain_scores_gemma":[0.9993969,0.00017652258,0.00002934062,0.0003221601,0.00005288996,0.000022177308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012604322,0.000120031655,0.0001545313,0.00008289615,0.000031156884,0.000050852555,0.00021936209,0.000031951848,0.000060883376],"category_scores_gemma":[0.000026608572,0.00009063089,0.0000402904,0.00016340871,0.00003974527,0.00017124979,0.000045175115,0.0001319847,0.00000965615],"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.0000065648164,0.00006882948,0.011554775,0.00011908525,0.00004507526,0.00005118203,0.0042386963,0.07142557,0.8096319,0.0007258069,0.058604844,0.043527707],"study_design_scores_gemma":[0.0000883811,0.0000040034106,0.0036309962,0.00010600055,0.0000042183783,0.00001080161,0.00057998014,0.75225055,0.24094331,0.001738597,0.00050814595,0.00013498767],"about_ca_topic_score_codex":0.00092216174,"about_ca_topic_score_gemma":0.000011602692,"teacher_disagreement_score":0.680825,"about_ca_system_score_codex":0.000013346507,"about_ca_system_score_gemma":0.000004986848,"threshold_uncertainty_score":0.36958206},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99276364,0.00025361308,0.00023281644,0.00078591984,0.00017246486,0.00054903585,0.000014665669,0.00045269434,0.0047751484],"genre_scores_gemma":[0.8040727,0.00026589798,0.19491413,0.00007786425,0.00027668648,0.00018157177,0.000007188901,0.00010592424,0.00009804644],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982714,1.1865708e-8,0.0005680879,0.00031792134,0.00043643138,0.00040613036],"domain_scores_gemma":[0.9985653,0.00009657624,0.00018528459,0.00006910282,0.0009584995,0.00012519397],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025854644,0.00034744208,0.00041790586,0.00011790673,0.00008365311,0.00019319908,0.00056250807,0.00020986842,0.000016849679],"category_scores_gemma":[0.00011594461,0.0002891028,0.00031748248,0.00026735078,0.00020379205,0.0006302963,0.00014600117,0.00031808356,0.0000018030058],"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.0000170991,0.000042076266,0.00017730435,0.00033253554,0.00035456772,1.2033031e-7,0.00015207283,0.000052983443,0.82864875,0.16037764,0.008578859,0.0012659775],"study_design_scores_gemma":[0.0008199884,0.0001533511,0.0012445078,0.00061076647,0.00015548599,0.00003076899,0.0006312463,0.3532483,0.6311916,0.008192588,0.0031196047,0.0006017716],"about_ca_topic_score_codex":0.000012421051,"about_ca_topic_score_gemma":6.7374714e-8,"teacher_disagreement_score":0.3531953,"about_ca_system_score_codex":0.0000893261,"about_ca_system_score_gemma":0.000010159575,"threshold_uncertainty_score":0.99995613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45581836,0.00037825198,0.534555,0.0019571558,0.00018887041,0.00027934538,0.000008269098,0.0008823632,0.005932345],"genre_scores_gemma":[0.9965699,0.00002866141,0.0025150715,0.0007613611,0.00006092831,0.0000024269902,0.000011090468,0.000045584507,0.000005029894],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909556,0.00004143132,0.00017725473,0.0001659981,0.0001757968,0.00034398507],"domain_scores_gemma":[0.9995238,0.00007893609,0.000041428877,0.00029377674,0.000022123608,0.000039913943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008624965,0.00018869323,0.00023083664,0.00011271354,0.000055223965,0.000026310661,0.00013055307,0.000055063036,0.0000071856334],"category_scores_gemma":[0.000009268909,0.0001853449,0.00010101839,0.00009895862,0.00006326122,0.00005468512,0.000007350624,0.0002622883,0.0000037306922],"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.000034834466,0.000012510432,0.000025420492,0.000038472124,0.000042327843,0.00000725643,0.00012910808,0.08690842,0.8903587,0.0002457582,0.004291002,0.01790621],"study_design_scores_gemma":[0.00029296085,0.000111935406,0.00010790549,0.000102051796,0.000021218202,0.0000038943367,0.0000049438145,0.30879617,0.6855842,0.00019629012,0.0045873574,0.0001910922],"about_ca_topic_score_codex":0.000009895318,"about_ca_topic_score_gemma":0.0000042185816,"teacher_disagreement_score":0.54075146,"about_ca_system_score_codex":0.00006925156,"about_ca_system_score_gemma":0.00001190354,"threshold_uncertainty_score":0.7558146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23017566,0.00002856167,0.759532,0.000068936286,0.0002459247,0.00035547194,0.000012460896,0.004921373,0.0046596546],"genre_scores_gemma":[0.72755694,0.0000057790558,0.27207217,0.000030917075,0.000085554624,0.00004612546,0.000015247654,0.000027401946,0.00015988377],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949956,0.000003548815,0.00013052156,0.00011639585,0.000064642256,0.00018534334],"domain_scores_gemma":[0.99965996,0.00002940926,0.000015872369,0.00021643125,0.00004147504,0.0000368398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090760004,0.00011000065,0.00011060705,0.000071382296,0.000049239814,0.00003759756,0.0001024335,0.0000695753,0.00004887142],"category_scores_gemma":[0.000013009703,0.000104391765,0.00005663419,0.000042903976,0.0000110113715,0.00009849497,0.000013601079,0.00012704711,0.000014640287],"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.00002628183,0.00013833096,0.000035751887,0.00011575637,0.000057067497,0.000008482836,0.00023368651,0.00992194,0.40257156,0.0135704605,0.22459294,0.34872776],"study_design_scores_gemma":[0.000065857406,0.000018400953,0.000020336298,0.000010162402,0.0000076136944,0.000010226171,0.000005606644,0.51992077,0.45372477,0.0016662102,0.024432613,0.00011740087],"about_ca_topic_score_codex":0.0000025002223,"about_ca_topic_score_gemma":0.000016433416,"teacher_disagreement_score":0.50999886,"about_ca_system_score_codex":0.000010156205,"about_ca_system_score_gemma":0.000005392546,"threshold_uncertainty_score":0.42569727},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.380698,0.00006319792,0.5471362,0.00021621349,0.00066201953,0.0005469117,0.0000064582287,0.0034964376,0.0671746],"genre_scores_gemma":[0.49727935,0.000029705074,0.5018033,0.00007841484,0.00022960754,0.00008782277,0.000008824799,0.000025061005,0.0004579388],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997847,0.0000018554748,0.00006344768,0.00005373572,0.000023316516,0.00007296268],"domain_scores_gemma":[0.9998461,0.000013799753,0.0000056082795,0.00007593792,0.000040534545,0.00001800575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000011722539,0.00004582393,0.000044751185,0.000029578203,0.000022909602,0.000018389675,0.000027422408,0.00002853597,0.00016592341],"category_scores_gemma":[0.00000402148,0.000042025178,0.000026545045,0.000027989185,0.000011100749,0.00012509244,0.00000516585,0.00003033942,0.000060519436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051239977,0.000026323929,0.00016528819,0.00002524521,0.000056340163,0.0000014380291,0.00004311698,0.00040784356,0.46593037,0.00086014223,0.24294326,0.28953552],"study_design_scores_gemma":[0.00014432351,0.000032988024,0.00039278436,0.000019475183,0.000006713322,0.0000499959,0.000042562006,0.73285055,0.24528243,0.0074436325,0.013581043,0.00015349538],"about_ca_topic_score_codex":0.000015548616,"about_ca_topic_score_gemma":0.0000010951155,"teacher_disagreement_score":0.73244274,"about_ca_system_score_codex":0.000009993935,"about_ca_system_score_gemma":0.000001942406,"threshold_uncertainty_score":0.1816745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4018003,0.000035844718,0.5952754,0.000008784885,0.00013663304,0.00013156861,5.248683e-7,0.0013060193,0.0013049272],"genre_scores_gemma":[0.92130417,0.000011367805,0.078180544,0.00007173315,0.000073709074,0.0000083995965,0.00000210861,0.000048053702,0.0002999175],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999164,0.000018698318,0.00019049706,0.00017847677,0.0001381574,0.00031020876],"domain_scores_gemma":[0.9996606,0.000023258799,0.000028223323,0.00016215169,0.00005250004,0.00007325718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007104726,0.00017764793,0.00016110222,0.0001088955,0.00010093219,0.00013622342,0.00012217523,0.00009709168,0.00022446754],"category_scores_gemma":[0.000004964131,0.0001757117,0.00006747797,0.00015166089,0.000027680278,0.00030747594,0.00004902502,0.00019433502,0.000115316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002940174,0.000029944926,0.00047967446,0.00003203084,0.00006984287,0.000011486066,0.00022294844,0.15018244,0.8330079,0.00080734154,0.0022227885,0.012930687],"study_design_scores_gemma":[0.00012197483,0.00000912549,0.00060731865,0.00005307627,0.00001062078,0.000020512723,0.0001434776,0.8485903,0.14943574,0.00022933101,0.00055992487,0.00021855907],"about_ca_topic_score_codex":0.0009786148,"about_ca_topic_score_gemma":0.00006198869,"teacher_disagreement_score":0.6984079,"about_ca_system_score_codex":0.000112978676,"about_ca_system_score_gemma":0.0000082675015,"threshold_uncertainty_score":0.7165315},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015783792,0.00010886761,0.9944226,0.00012164517,0.000008953584,0.0005078776,0.0000085747,0.000781836,0.00388177],"genre_scores_gemma":[0.4483756,0.00003947833,0.55020106,0.00013601767,0.00010097045,0.00075908465,0.00031617712,0.00003628357,0.000035332796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993816,0.000013554281,0.00016619117,0.00019919964,0.00011701669,0.00012244981],"domain_scores_gemma":[0.99949425,0.000073125295,0.00004578568,0.00015968391,0.0001528539,0.00007427701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004660136,0.000129996,0.00010680933,0.00009280991,0.00020918579,0.00008911582,0.00008070201,0.000047094476,0.000012716755],"category_scores_gemma":[0.0000030947367,0.00012908647,0.00002005249,0.0003194223,0.00006742282,0.00009748898,0.000018153645,0.00008331373,0.000012199644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012319178,0.0000201976,0.00012226679,0.00001394609,0.000011180772,7.3937926e-8,0.0000193534,0.94726175,0.000010781805,0.03088998,0.000168407,0.02148083],"study_design_scores_gemma":[0.00017218338,0.000017412849,0.00023588273,0.000023020883,0.000018110954,0.000014025894,0.000027404427,0.95648664,0.00004212715,0.0020324346,0.040755272,0.00017549255],"about_ca_topic_score_codex":0.0000015221816,"about_ca_topic_score_gemma":0.0000016971798,"teacher_disagreement_score":0.44821778,"about_ca_system_score_codex":0.000018319352,"about_ca_system_score_gemma":0.000012778293,"threshold_uncertainty_score":0.5263994},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013990656,0.000041252322,0.99536574,0.00017860327,0.000068564565,0.0001078503,0.000007641695,0.002307244,0.00052401825],"genre_scores_gemma":[0.121671624,0.000027770013,0.87783587,0.00023391665,0.000035286637,0.000013446349,0.0000023895013,0.00002726869,0.00015242372],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993644,0.000009369561,0.00015741061,0.00012645093,0.00014724158,0.00019513842],"domain_scores_gemma":[0.99933153,0.00010661594,0.000010111256,0.0004511248,0.000024117988,0.0000764859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036850422,0.000145256,0.00016009185,0.000065028384,0.00007385484,0.000029267994,0.0001941035,0.00008963092,0.00026141762],"category_scores_gemma":[0.000028367334,0.00013230016,0.00008993147,0.00012941417,0.000022073496,0.000070650705,0.0000017102698,0.0002064105,0.00023751032],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018986447,0.00007979598,3.702772e-7,0.00000898467,0.000018048224,0.000008770032,0.000056486366,0.0016532831,0.00024488743,0.000096800344,0.00020286077,0.9976278],"study_design_scores_gemma":[0.00019632654,0.00014248682,0.00009509428,0.00015488216,0.000043462907,0.000046137335,0.000024275738,0.009985473,0.033640735,0.9531377,0.0021906383,0.00034281946],"about_ca_topic_score_codex":5.9941357e-7,"about_ca_topic_score_gemma":2.3326415e-7,"teacher_disagreement_score":0.997285,"about_ca_system_score_codex":0.000029917983,"about_ca_system_score_gemma":0.0000041708195,"threshold_uncertainty_score":0.5395044},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867338,0.00010510955,0.0052130804,0.00071341865,0.00016314539,0.0012476551,0.00008584116,0.0003736026,0.005364344],"genre_scores_gemma":[0.7471645,0.00012535488,0.25029647,0.00011373631,0.0006487632,0.001206378,0.000030709856,0.00014908917,0.00026499527],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983282,5.653887e-9,0.00056067854,0.00032042994,0.00038347795,0.00040720458],"domain_scores_gemma":[0.99797577,0.00023814963,0.00017739984,0.00007820856,0.0014102687,0.0001201779],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018688898,0.00031998853,0.00035683013,0.00009628413,0.00009373181,0.00024772825,0.00069647783,0.00018778098,0.0000128325855],"category_scores_gemma":[0.0002616852,0.0002851455,0.00052751927,0.00022542411,0.00014911052,0.00074025086,0.0000561537,0.00024609108,0.0000038293942],"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.000033215936,0.00008862007,0.00035106298,0.00045505713,0.000597116,2.9741123e-8,0.00017572977,0.0012075943,0.84102464,0.13005641,0.022325074,0.0036854292],"study_design_scores_gemma":[0.0015671784,0.0003299987,0.0010590306,0.00069559825,0.00028602584,0.00002513476,0.0014465428,0.11842738,0.7989531,0.017674077,0.058340587,0.0011953303],"about_ca_topic_score_codex":0.0000046418495,"about_ca_topic_score_gemma":6.3990214e-8,"teacher_disagreement_score":0.2450834,"about_ca_system_score_codex":0.00011374642,"about_ca_system_score_gemma":0.000013987589,"threshold_uncertainty_score":0.99996006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1055217,0.00025992907,0.88986874,0.000037746122,0.000344501,0.00032789205,0.0000074292507,0.0014596253,0.002172435],"genre_scores_gemma":[0.99900293,0.0000100987045,0.0005455991,0.000060541202,0.00017583914,0.000052502448,0.0000020026353,0.000064087566,0.00008640075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988603,0.000037212118,0.000261311,0.0002487344,0.00025294124,0.00033952066],"domain_scores_gemma":[0.9995772,0.000024898358,0.00004270717,0.00014266073,0.00012019852,0.00009231256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005045928,0.0002671431,0.0002538456,0.00017525074,0.00039559504,0.00030796454,0.00018415069,0.0001729602,0.00010906662],"category_scores_gemma":[6.413202e-7,0.00026166937,0.000084773215,0.0003157345,0.000047379166,0.00041730623,0.0000013872483,0.00040323683,0.000053224525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003267337,0.0001687033,0.00005660548,0.00028338633,0.00024859386,0.0000315433,0.001904363,0.39666405,0.27958775,0.00015373508,0.004188837,0.31667975],"study_design_scores_gemma":[0.0006208603,0.000108846645,0.00022793327,0.00028671758,0.000112565176,0.000063808715,0.0005347304,0.66385007,0.3317508,0.0007826041,0.00066607277,0.0009949679],"about_ca_topic_score_codex":0.000039811326,"about_ca_topic_score_gemma":0.000003732187,"teacher_disagreement_score":0.89348125,"about_ca_system_score_codex":0.00008618924,"about_ca_system_score_gemma":0.000031301865,"threshold_uncertainty_score":0.99998355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006634981,0.00017699575,0.9872983,0.00013350045,0.000050323615,0.00045761222,0.000004445082,0.00028060802,0.0049632126],"genre_scores_gemma":[0.58431315,0.000405685,0.4142661,0.00010660935,0.000096749325,0.000306464,0.000003152858,0.00005257967,0.00044948218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954,0.000005388418,0.00016154276,0.000075030446,0.00011073994,0.00010732025],"domain_scores_gemma":[0.9992308,0.00010530944,0.00004185817,0.00055866357,0.00004029654,0.000023040862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004535769,0.000085889726,0.00009010708,0.000011827578,0.0001386674,0.000020559746,0.00038638912,0.000023609053,0.000012142863],"category_scores_gemma":[0.0000012535758,0.00004797274,0.0000359002,0.00018474151,0.000115475064,0.000020591553,0.000025819818,0.00008016068,0.000017160426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045740394,0.00019545386,0.000076656484,0.0001213185,0.00025547107,0.0000013586216,0.0015373483,0.032261375,0.001624923,0.08610859,0.029189637,0.8486233],"study_design_scores_gemma":[0.00014880323,0.000023201575,0.00024428876,0.00016068842,0.0000496288,0.000034960314,0.0000762249,0.8648914,0.01818166,0.033802163,0.082157634,0.00022933718],"about_ca_topic_score_codex":0.0000024397734,"about_ca_topic_score_gemma":0.0000016571664,"teacher_disagreement_score":0.848394,"about_ca_system_score_codex":0.00001032377,"about_ca_system_score_gemma":0.000009839065,"threshold_uncertainty_score":0.19562715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9800862,0.00047677627,0.0078032436,0.000100021716,0.00027256337,0.00018901733,0.0000023156085,0.0001368623,0.010932968],"genre_scores_gemma":[0.97624594,0.0007073316,0.022557225,0.000023251336,0.00032103164,0.0000033419556,3.3042795e-7,0.000046188645,0.00009533406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998426,0.00007242897,0.00039404424,0.00007515085,0.0007150316,0.0003173098],"domain_scores_gemma":[0.99899036,0.00020463238,0.00009841567,0.00027878056,0.00031413184,0.00011371198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011306426,0.0001240448,0.00028350795,0.00038471338,0.00007248227,0.000053390493,0.00041449643,0.000077691046,0.00007895994],"category_scores_gemma":[0.00012137598,0.00009291474,0.000109006614,0.00015414652,0.00007828493,0.00012388338,0.000057588142,0.00058927626,0.000030053976],"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.00026548348,0.0011005739,0.00018196058,0.0005360619,0.0006663066,0.0010318762,0.015335505,0.0019964357,0.30860797,0.6153505,0.04899371,0.005933639],"study_design_scores_gemma":[0.00077493064,0.0004039247,0.00017032893,0.0009455866,0.00003337854,0.00022275503,0.0011733129,0.04265979,0.7091829,0.2430844,0.0010553511,0.00029330223],"about_ca_topic_score_codex":0.0000039115093,"about_ca_topic_score_gemma":4.9787667e-7,"teacher_disagreement_score":0.40057498,"about_ca_system_score_codex":0.00009107312,"about_ca_system_score_gemma":0.000028748664,"threshold_uncertainty_score":0.37889534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47508118,0.000008278403,0.48635644,0.0002434822,0.0002949827,0.00025896268,9.00464e-7,0.0015677535,0.036188032],"genre_scores_gemma":[0.97968537,0.0000021964115,0.01973278,0.00034967266,0.00010253713,0.000023718567,0.0000032194757,0.000018853918,0.00008166253],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996019,0.0000016955447,0.00007752219,0.00012066027,0.00006075546,0.00013748366],"domain_scores_gemma":[0.9996499,0.000010060759,0.0000083445275,0.00024613217,0.000025400497,0.00006020369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045243825,0.00008115614,0.00008136536,0.000059155456,0.000032845724,0.000029797384,0.0001175598,0.000035920955,0.00003818845],"category_scores_gemma":[0.0000029562286,0.00008220269,0.000021490725,0.00009370303,0.00001169218,0.000061999475,0.000036170168,0.000116308016,0.00016875526],"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.000002363909,0.000010352483,0.0017344401,0.0000038901003,0.00000653062,0.0000027919966,0.00004514048,0.00028960558,0.9524199,0.002032289,0.020693798,0.022758905],"study_design_scores_gemma":[0.00012348327,0.000015216799,0.010619714,0.000012339432,0.000010688757,0.00001339752,0.000023797287,0.310319,0.5615567,0.0012280958,0.11576205,0.00031553104],"about_ca_topic_score_codex":0.000066183704,"about_ca_topic_score_gemma":0.000079198035,"teacher_disagreement_score":0.5046042,"about_ca_system_score_codex":0.000011208032,"about_ca_system_score_gemma":0.000002360109,"threshold_uncertainty_score":0.33521283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07074086,0.0003805289,0.90599096,0.00008603191,0.00017020336,0.000029883331,0.000005245524,0.000043946045,0.02255234],"genre_scores_gemma":[0.95362705,0.0006724954,0.045408122,0.00017402698,0.0000750375,2.533679e-7,4.8900034e-7,0.000007919934,0.000034586297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947906,0.00013735594,0.00016094226,0.000039078044,0.000103840975,0.00007974365],"domain_scores_gemma":[0.99646777,0.0032840956,0.00006378824,0.000050418108,0.00007086951,0.00006307453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864015,0.00006107915,0.00010517618,0.000043234104,0.00005607504,0.00001306885,0.000039270497,0.000035504974,0.000069371476],"category_scores_gemma":[0.0012754359,0.00004937916,0.000017992526,0.00003356069,0.00006624787,0.00022990577,0.0000070247734,0.0002303703,0.0000110103065],"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.0017519614,0.00007559247,0.0000065441695,0.000011054841,0.00011115802,0.0009913025,0.00026308908,0.0038320057,0.0011188394,0.96194947,0.01441941,0.01546956],"study_design_scores_gemma":[0.001926984,0.0032253673,0.0027581444,0.00031931855,0.00040866304,0.038364217,0.000956044,0.02401201,0.012535666,0.7995457,0.11520987,0.00073799776],"about_ca_topic_score_codex":6.197456e-7,"about_ca_topic_score_gemma":3.585913e-8,"teacher_disagreement_score":0.88288623,"about_ca_system_score_codex":0.000016465949,"about_ca_system_score_gemma":0.000012132734,"threshold_uncertainty_score":0.20136236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015153095,0.00076205574,0.9809888,0.000040591098,0.0005580338,0.00044564024,0.000015938123,0.0014346015,0.0006012211],"genre_scores_gemma":[0.9200188,0.000026449226,0.079536475,0.00007245398,0.00016798399,0.000052782194,0.000007410792,0.00008642702,0.00003123854],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890053,0.000026951448,0.0002533457,0.00020223815,0.00016282,0.000454119],"domain_scores_gemma":[0.9993542,0.00007463056,0.000078003395,0.00019444263,0.00019753989,0.00010122005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009745309,0.0002497256,0.00021736532,0.00019864737,0.00034093717,0.00013450767,0.00009685343,0.00011281042,0.00001376395],"category_scores_gemma":[0.0000075760254,0.00025504592,0.00009634374,0.0002634056,0.00007332878,0.0006888759,0.000001060115,0.00020986008,0.000014435947],"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.000121945304,0.0002408208,0.000013833051,0.00034640607,0.000124095,0.000009007482,0.0018119102,0.028052593,0.4407179,0.00004242472,0.0012892238,0.52722985],"study_design_scores_gemma":[0.00030859464,0.000036783116,0.000014345041,0.00034541488,0.00006559701,0.00003085627,0.00012777351,0.32157776,0.6766227,0.0001644377,0.00040607253,0.0002996822],"about_ca_topic_score_codex":0.0000034629081,"about_ca_topic_score_gemma":0.0000015021218,"teacher_disagreement_score":0.9048657,"about_ca_system_score_codex":0.00007052041,"about_ca_system_score_gemma":0.000021319884,"threshold_uncertainty_score":0.99999017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93825865,0.0000061946325,0.04824551,0.000011554273,0.00064026454,0.000064769076,5.303075e-7,0.0008362826,0.011936246],"genre_scores_gemma":[0.84576505,0.000003985058,0.154077,0.0000146117545,0.00009786837,0.000001508257,0.000001367301,0.000011407129,0.00002723324],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971396,0.000004525206,0.00008186043,0.00007030248,0.000040940875,0.00008840433],"domain_scores_gemma":[0.9997984,0.000008821606,0.000012700727,0.00012017548,0.000036098518,0.00002377717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003108524,0.000063881365,0.000056695437,0.00004571935,0.000037575952,0.00003758003,0.000036945694,0.00006272638,0.00010438136],"category_scores_gemma":[0.000009487745,0.00006154376,0.000020047704,0.000058700174,0.000024409002,0.00017267808,0.000007913844,0.00012261148,0.00001847558],"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.0000015667445,0.0000020387542,0.000054956367,0.00000145753,0.000003966031,0.0000014984936,0.000011005104,0.0003207025,0.9894102,0.00042245485,0.00056827103,0.00920187],"study_design_scores_gemma":[0.000046400502,0.000004515825,0.00021098995,0.0000067972915,0.0000053501913,0.00007544936,0.000012369168,0.30267823,0.6955546,0.0006447617,0.0006775544,0.00008299649],"about_ca_topic_score_codex":0.000022759888,"about_ca_topic_score_gemma":0.00004317007,"teacher_disagreement_score":0.30235752,"about_ca_system_score_codex":0.000013574599,"about_ca_system_score_gemma":0.000005380436,"threshold_uncertainty_score":0.2509682},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12617277,0.0010252981,0.87180346,0.0000013964556,0.0006057191,0.00015497234,0.0000014917035,0.0001972497,0.00003764835],"genre_scores_gemma":[0.83802307,0.000038018952,0.16180235,0.0000024974681,0.000086323205,0.000017914115,0.00000235277,0.000027355089,9.657866e-8],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989969,0.000020175316,0.0004511463,0.00018763305,0.00013656677,0.0002075391],"domain_scores_gemma":[0.9993233,0.00022540125,0.00008293469,0.00028920162,0.000049798826,0.000029360814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012828675,0.00017672197,0.000371536,0.0002935187,0.000008105494,0.000011355136,0.00020823571,0.0000702752,3.7329778e-7],"category_scores_gemma":[0.000006542209,0.000201024,0.000042513006,0.00025840293,0.000018397583,0.00017001409,0.000046192556,0.00016255262,5.0678295e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033259862,0.000016900414,0.007570577,0.00018176701,0.0000066570524,0.0000012696519,0.00006483729,0.97302467,0.0054783886,0.0002351092,0.0000015267856,0.013414968],"study_design_scores_gemma":[0.00025087324,0.000034226046,0.006866418,0.00092533685,0.0000026988941,0.0000017443275,0.000003773148,0.9723288,0.019017253,0.000049057195,0.00034812768,0.00017169167],"about_ca_topic_score_codex":0.000018071745,"about_ca_topic_score_gemma":0.0000013186066,"teacher_disagreement_score":0.71185035,"about_ca_system_score_codex":0.00005038946,"about_ca_system_score_gemma":0.000003884542,"threshold_uncertainty_score":0.8197521},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045118853,0.00083994464,0.9933132,0.00002398261,0.00010518589,0.00009630953,0.000003463756,0.00079450494,0.0003115109],"genre_scores_gemma":[0.8938655,0.006218076,0.099521786,0.000053016076,0.000120368175,0.0000103520715,0.0000897828,0.000060467293,0.00006060014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947196,0.00000967913,0.00016549834,0.00013161913,0.00007227349,0.00014896398],"domain_scores_gemma":[0.99974245,0.000020929478,0.000021966613,0.000106872234,0.000045705165,0.00006210057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040131104,0.00013087149,0.00012616359,0.00007947867,0.00014552621,0.000034419787,0.000031698288,0.00005877457,0.000009198863],"category_scores_gemma":[0.000013104989,0.00014842943,0.000015132919,0.00024197607,0.000029398536,0.00012064734,0.00001541185,0.0000610546,7.6219544e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014401462,0.000002562378,0.0011283403,0.000019632642,0.000009595735,0.0000030626975,0.00007149635,0.9952657,0.000101469675,0.0017743362,0.001543676,0.00007866994],"study_design_scores_gemma":[0.00011783942,0.0000071927275,0.0010301099,0.000055161894,0.000009015888,0.000043811575,0.000009751677,0.9930088,0.00011514801,0.0000566578,0.0053762165,0.0001703146],"about_ca_topic_score_codex":0.0000054690922,"about_ca_topic_score_gemma":0.0000014797134,"teacher_disagreement_score":0.89379144,"about_ca_system_score_codex":0.000014800173,"about_ca_system_score_gemma":0.0000028157165,"threshold_uncertainty_score":0.6052777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96931016,0.000116080795,0.015364049,0.00003905989,0.0000790071,0.000094366114,1.7866313e-7,0.00045393204,0.0145431915],"genre_scores_gemma":[0.9921285,0.00009192392,0.0077020684,0.000015082749,0.000008233722,0.000005448753,4.8385743e-7,0.000007693235,0.0000405867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965274,0.000007604157,0.000095245174,0.00009228972,0.00003537268,0.000116747025],"domain_scores_gemma":[0.9998605,0.000014245728,0.00000943318,0.00008226006,0.000012920657,0.00002060428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036863712,0.00006309269,0.00007484955,0.00007327007,0.000023056999,0.000025709838,0.000033695153,0.00003701685,0.000051994644],"category_scores_gemma":[0.0000047284707,0.000062348954,0.000010722438,0.00007155056,0.000019001736,0.00016209451,0.000017217897,0.00007494111,0.00001550633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060027,0.000042225125,0.041424796,0.000075846954,0.000020785646,0.000016392136,0.00084108004,0.00680102,0.22906251,0.0018081617,0.0029174595,0.71698374],"study_design_scores_gemma":[0.00032695069,0.000026033611,0.0642133,0.00014343497,0.000006187863,0.00010122738,0.0006722704,0.8911155,0.032212216,0.010650074,0.0001473696,0.00038544324],"about_ca_topic_score_codex":0.00013971342,"about_ca_topic_score_gemma":0.000060384715,"teacher_disagreement_score":0.8843145,"about_ca_system_score_codex":0.000022011414,"about_ca_system_score_gemma":0.0000017464764,"threshold_uncertainty_score":0.25425166},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7390185,0.00031855577,0.25173113,0.000008397392,0.0009922439,0.00019041254,0.000019657127,0.0010070576,0.00671407],"genre_scores_gemma":[0.7892617,0.00005586664,0.21024293,0.00002745206,0.000312892,0.0000072266334,0.000014626521,0.00005893943,0.0000183669],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99899065,0.000019237777,0.00023095959,0.00022690654,0.00019592827,0.00033632098],"domain_scores_gemma":[0.9991307,0.00008706682,0.00006062052,0.00048460995,0.00013910134,0.00009784802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009125246,0.0002193873,0.00022203797,0.0002160478,0.0001298397,0.00015981213,0.0002615124,0.0001597023,0.00008815682],"category_scores_gemma":[0.000034960176,0.0002416418,0.000080633916,0.00024487785,0.00007147706,0.0002496576,0.00009507987,0.00040582241,0.000023256947],"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.0000052777436,0.000021304837,0.00004290553,0.000017858927,0.000026295924,0.000015275007,0.00008262024,0.007250281,0.9880084,0.00027368884,0.00077506126,0.0034810465],"study_design_scores_gemma":[0.00024687356,0.000022179245,0.00031198928,0.00008728436,0.000041461004,0.000041710777,0.000036133693,0.47749773,0.51673615,0.0007197331,0.0038412865,0.00041747783],"about_ca_topic_score_codex":0.000017882943,"about_ca_topic_score_gemma":0.000001190428,"teacher_disagreement_score":0.47127223,"about_ca_system_score_codex":0.00003005202,"about_ca_system_score_gemma":0.000010704704,"threshold_uncertainty_score":0.98538667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001389,0.00008287368,0.29684728,0.000035917245,0.00041857525,0.0006057915,0.000016152764,0.00074316724,0.0011112804],"genre_scores_gemma":[0.99303555,0.000092511706,0.0064351945,0.00008584956,0.00018715326,0.000086467386,0.00001776797,0.000055221968,0.0000042558177],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99921244,0.000014101169,0.00019961737,0.00021017993,0.00007974855,0.00028392443],"domain_scores_gemma":[0.9996126,0.000035463367,0.00005304275,0.00019568816,0.00003099496,0.000072176204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015367042,0.00020778255,0.00025650012,0.000054967448,0.00007819547,0.00021820526,0.00008857981,0.00007951017,0.00006479086],"category_scores_gemma":[0.0000059028325,0.00017895816,0.000015458781,0.00006649767,0.000013656324,0.00008270541,0.000013187743,0.00009148867,0.000018437366],"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.000017076578,0.000006346916,8.487543e-7,0.000010947603,0.000022203558,0.0000011071945,0.000028521852,0.000014397904,0.98629,0.01129971,0.00025373808,0.0020551237],"study_design_scores_gemma":[0.0004987997,0.000020611904,0.000008712555,0.000054304957,0.000025404077,0.000009662448,0.00004856827,0.00009573475,0.9839473,0.013747496,0.0012909584,0.00025248402],"about_ca_topic_score_codex":0.000034308745,"about_ca_topic_score_gemma":0.0000017905318,"teacher_disagreement_score":0.29289663,"about_ca_system_score_codex":0.00001929518,"about_ca_system_score_gemma":0.000011583024,"threshold_uncertainty_score":0.7297702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7037314,0.0021428994,0.0769559,0.00007687514,0.001761559,0.00037722135,0.000007145615,0.0058826474,0.20906436],"genre_scores_gemma":[0.9748423,0.000051367027,0.02464106,0.000109708555,0.00013738585,0.000007374588,0.0000030527322,0.000025176812,0.00018256743],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993404,0.000012426337,0.00013131642,0.00009081118,0.00009523696,0.00032978924],"domain_scores_gemma":[0.99958414,0.000023320163,0.000015333097,0.0002542101,0.000029905592,0.00009307251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045059005,0.00012916214,0.000120075594,0.000046369045,0.000042279586,0.00002410688,0.00015060387,0.000057745463,0.00013055753],"category_scores_gemma":[0.000008172728,0.00011651173,0.000038055838,0.00008793648,0.000037072587,0.00016998472,0.00004112821,0.00009721136,0.0001547156],"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.0000029058863,0.000037127265,0.0034943097,0.000012063926,0.00002544565,0.000004239267,0.00030691628,0.000343247,0.79333436,0.0027829446,0.19656745,0.0030889607],"study_design_scores_gemma":[0.00008596084,0.000008607758,0.0022922475,0.000033421857,0.000007836198,0.00002065636,0.000026847318,0.0056593628,0.97615427,0.00023786444,0.015260224,0.00021268647],"about_ca_topic_score_codex":0.000023404764,"about_ca_topic_score_gemma":9.80446e-7,"teacher_disagreement_score":0.27111092,"about_ca_system_score_codex":0.00002386144,"about_ca_system_score_gemma":0.000004125142,"threshold_uncertainty_score":0.47512105},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5313044,0.00045456132,0.17366609,0.00080962304,0.0012263508,0.0005751923,0.0000058900964,0.0032929124,0.28866497],"genre_scores_gemma":[0.9795961,0.000013446309,0.01949785,0.00057904085,0.00014347163,0.000017808361,0.0000048199195,0.000017058443,0.00013041208],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993662,0.000021024074,0.00013234225,0.00013756282,0.000101553356,0.00024130942],"domain_scores_gemma":[0.9995025,0.000052302417,0.000012039662,0.00030308365,0.000051930514,0.000078164754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000037734048,0.00011411524,0.00013532137,0.000032578235,0.000031211195,0.00003621855,0.0001788522,0.000068137495,0.0017530824],"category_scores_gemma":[0.0000167649,0.00010457889,0.000022219994,0.00009249064,0.00002057244,0.00007137881,0.000072488096,0.0000976095,0.00048534293],"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.000014939071,0.0000718521,0.02556189,0.000009434742,0.00034671972,0.000019887711,0.00042190996,0.05167173,0.19654039,0.007744096,0.57673997,0.14085719],"study_design_scores_gemma":[0.0012604834,0.0004119668,0.17530976,0.00047425792,0.00013401196,0.000017236493,0.00023365855,0.11570111,0.35658997,0.1987576,0.1481236,0.0029863408],"about_ca_topic_score_codex":0.0011028909,"about_ca_topic_score_gemma":0.00016669217,"teacher_disagreement_score":0.4482917,"about_ca_system_score_codex":0.00002470239,"about_ca_system_score_gemma":0.0000061906126,"threshold_uncertainty_score":0.99915946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175185,0.0002818267,0.071251385,0.000004603708,0.0003156643,0.00007693342,0.0000016435642,0.0003266287,0.010222826],"genre_scores_gemma":[0.95657295,0.00001888484,0.043234706,0.000018492645,0.000112044465,0.0000015151721,7.7600487e-7,0.000016398275,0.00002423133],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949986,0.000015522512,0.00017448148,0.00006782874,0.00007282834,0.00016947318],"domain_scores_gemma":[0.9997335,0.000021498237,0.000034864428,0.00012528879,0.00004453035,0.00004033416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088828776,0.00009577366,0.00014636904,0.000089854744,0.000028219287,0.0000147579485,0.000042798787,0.000051029496,0.00013225176],"category_scores_gemma":[0.000008510878,0.00008962398,0.000045705438,0.00009210992,0.00002709823,0.00029193336,0.000017224713,0.00007356266,0.000005973537],"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.0000044684766,0.000012283056,0.004271565,0.000013041264,0.00004613818,8.5247876e-7,0.00033682914,0.006073836,0.98064935,0.0009585526,0.0008205666,0.0068125194],"study_design_scores_gemma":[0.000059036334,0.000010507458,0.00063432095,0.00010429128,0.000014814822,0.00003511593,0.00010072601,0.04780089,0.950442,0.0004996173,0.0001774974,0.000121186524],"about_ca_topic_score_codex":0.00001772275,"about_ca_topic_score_gemma":8.420241e-7,"teacher_disagreement_score":0.041727055,"about_ca_system_score_codex":0.000028759572,"about_ca_system_score_gemma":0.00000425799,"threshold_uncertainty_score":0.36547598},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019218747,0.000021055137,0.9795862,0.000045813464,0.00016325116,0.00011179431,0.0000024538076,0.000042674543,0.0008080337],"genre_scores_gemma":[0.6806241,0.000008094485,0.31891176,0.00002448078,0.0003943313,0.0000038401695,0.000011146238,0.000012965195,0.000009266462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948555,0.0000059918684,0.0002715435,0.00004475549,0.00013042234,0.00006171444],"domain_scores_gemma":[0.99940956,0.00023180373,0.00014600583,0.000037342474,0.00014585658,0.000029415625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085141604,0.000077290344,0.00016373955,0.00006638596,0.000042690317,0.00003323583,0.000043664542,0.000040212377,0.0000033026745],"category_scores_gemma":[0.000037249978,0.00006820726,0.00003270083,0.000050051123,0.000018127548,0.000054490603,0.0000064900096,0.000051387422,7.580702e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003727496,0.00007694817,0.0000029639568,0.00016904899,0.00010946888,6.527934e-7,0.0007315471,0.4930504,0.004585888,0.48036215,0.0063239266,0.014549728],"study_design_scores_gemma":[0.0004874686,0.00007460501,0.00005221157,0.00006840071,0.00004326918,0.000016856502,0.000038285296,0.57600486,0.0054619433,0.41601384,0.0016473574,0.000090911606],"about_ca_topic_score_codex":5.1074295e-8,"about_ca_topic_score_gemma":9.42451e-8,"teacher_disagreement_score":0.6614053,"about_ca_system_score_codex":0.000014156463,"about_ca_system_score_gemma":0.0000112344405,"threshold_uncertainty_score":0.2781411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.571661,0.00004463002,0.4228885,0.000058210335,0.00027093815,0.0002556955,0.000006542428,0.0010094283,0.0038050932],"genre_scores_gemma":[0.8697676,0.000014839815,0.1298865,0.000023333865,0.00015169414,0.00007941649,0.000007938824,0.00002591769,0.000042749693],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993754,0.000010084475,0.00016094297,0.00016390703,0.00006435438,0.0002253357],"domain_scores_gemma":[0.999589,0.00010005839,0.000025620877,0.00017586525,0.00006363089,0.000045803954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003821661,0.00011815428,0.0001237345,0.00004459675,0.000075728036,0.00007364842,0.00008061515,0.00006043928,0.00017571489],"category_scores_gemma":[0.000044763015,0.00011421245,0.000059246708,0.000058533384,0.000027622755,0.00027394,0.000017297334,0.00007051415,0.00005410043],"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.00000814177,0.000016216502,0.0010202944,0.000012949567,0.000023368033,0.0000010689612,0.0002210052,0.0018161503,0.92150533,0.0003503288,0.013152324,0.061872818],"study_design_scores_gemma":[0.0002474865,0.000014875081,0.00029528982,0.00003223261,0.000009765701,0.000003877356,0.00027512005,0.46260464,0.5340225,0.0018430644,0.00048052508,0.00017058372],"about_ca_topic_score_codex":0.0005905997,"about_ca_topic_score_gemma":0.000037565955,"teacher_disagreement_score":0.4607885,"about_ca_system_score_codex":0.000025906698,"about_ca_system_score_gemma":0.0000054979687,"threshold_uncertainty_score":0.46574488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1448095,0.0015569871,0.8519573,0.00017147139,0.00019859847,0.00031835987,0.000025269917,0.0008664879,0.00009599085],"genre_scores_gemma":[0.9916864,0.0000029185974,0.0075039333,0.00032645828,0.00036256117,0.0000075650623,0.000018125285,0.00007086656,0.00002118713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976934,0.00015056395,0.0005581788,0.00044491852,0.00056232687,0.0005905863],"domain_scores_gemma":[0.9987041,0.00025996508,0.00015170408,0.00020667845,0.00014254673,0.00053502375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002716629,0.00042293573,0.0005725594,0.0001683681,0.00026353236,0.00027798698,0.00022620498,0.00022499198,0.000017934553],"category_scores_gemma":[0.000042275013,0.00033610495,0.00008073417,0.00026290398,0.00036432562,0.00017666351,0.000057437806,0.0003433641,0.0000032850564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004783693,0.0005198364,0.00074679306,0.001377972,0.00024318643,0.0018245262,0.0007960497,0.05469851,0.37592608,0.000022688308,0.0050263084,0.55403435],"study_design_scores_gemma":[0.0029533296,0.00029572158,0.000044222306,0.00083493843,0.0001116116,0.00015169605,0.00008544541,0.9907795,0.0025663972,0.00018139611,0.0015245136,0.00047120807],"about_ca_topic_score_codex":0.000029126648,"about_ca_topic_score_gemma":0.0000041961466,"teacher_disagreement_score":0.936081,"about_ca_system_score_codex":0.00009045666,"about_ca_system_score_gemma":0.00014672917,"threshold_uncertainty_score":0.9999091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837782,0.00007568331,0.2151053,0.000031156607,0.00019072134,0.00011626639,0.0000023365335,0.00038696695,0.00031335562],"genre_scores_gemma":[0.91172785,0.000009462166,0.08785869,0.00010765955,0.00024298784,0.0000024693493,0.0000026947635,0.00004645822,0.0000017592794],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987527,0.00003669047,0.00039925874,0.00022970501,0.00026539553,0.00031624222],"domain_scores_gemma":[0.99946785,0.00006557147,0.00013509179,0.0001474104,0.00010846807,0.00007559681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008616505,0.00023275433,0.00029968636,0.00018409411,0.00010978737,0.0001184449,0.00013003814,0.00009970777,0.000013497161],"category_scores_gemma":[0.0000073142596,0.00023447153,0.00007466281,0.0001922609,0.00024407695,0.00030444987,0.000022132861,0.00020194541,0.0000064235505],"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.00001151986,0.000009399968,0.00032049057,0.00012845742,0.000033713957,0.000038628124,0.000090843365,0.015703063,0.94760764,0.000011739235,0.00023205388,0.035812434],"study_design_scores_gemma":[0.00015338295,0.000029048035,0.0004921115,0.0005253306,0.00007266245,0.00025890197,0.00006082226,0.7276682,0.2699922,0.0004162153,0.000009932472,0.00032118682],"about_ca_topic_score_codex":0.000070133276,"about_ca_topic_score_gemma":9.473586e-7,"teacher_disagreement_score":0.71196514,"about_ca_system_score_codex":0.000058106358,"about_ca_system_score_gemma":0.000033861437,"threshold_uncertainty_score":0.9561472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16867824,0.000005840508,0.81862897,0.00002224695,0.00025873148,0.0001153113,0.0000020315224,0.0011116788,0.011176974],"genre_scores_gemma":[0.7990225,0.0000018214645,0.20074388,0.00002449878,0.00010126827,0.0000017543175,0.00001223392,0.000022773529,0.00006925822],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995186,0.000009201699,0.00010563889,0.00012352639,0.000109160086,0.00013388034],"domain_scores_gemma":[0.9996431,0.00002618778,0.000025251664,0.00018411627,0.00008196176,0.00003938991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025821717,0.00011564304,0.000102167425,0.0000625407,0.000051060873,0.000051025392,0.000045830766,0.0000800202,0.000027211352],"category_scores_gemma":[0.0000058489413,0.00009946057,0.000018574294,0.00009859947,0.000021705211,0.00012611457,0.000013588773,0.00015624,0.0000069407365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029757379,0.000055417124,0.00005026314,0.000016985065,0.00015219014,0.0000527303,0.0011298097,0.23572516,0.5863545,0.0030356182,0.0039998647,0.1693977],"study_design_scores_gemma":[0.00016912707,0.000015921094,0.0009680804,0.000013956138,0.000012384693,0.00004561767,0.000017051772,0.90905285,0.08911088,0.0002682309,0.00017201819,0.0001539063],"about_ca_topic_score_codex":0.000041922474,"about_ca_topic_score_gemma":0.000015660664,"teacher_disagreement_score":0.6733276,"about_ca_system_score_codex":0.000011066719,"about_ca_system_score_gemma":0.00000740207,"threshold_uncertainty_score":0.40558845},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25690496,0.00010011254,0.74041235,0.000016463662,0.00031267936,0.00035593158,0.000017394816,0.00067178835,0.0012083424],"genre_scores_gemma":[0.97849387,0.000025549509,0.02046194,0.00008661737,0.00047874034,0.00013133636,0.00009143542,0.00007504565,0.00015544739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990044,0.00002879137,0.00020993176,0.00025797455,0.00010609222,0.00039280296],"domain_scores_gemma":[0.99936205,0.00016104334,0.000051062085,0.0002919937,0.00007366127,0.000060210434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015909226,0.00020188303,0.00026057454,0.00007600683,0.000100042984,0.000044165517,0.000113081565,0.00014031916,0.0000031414925],"category_scores_gemma":[0.00001673552,0.00020294271,0.00016402086,0.00011667371,0.000021976028,0.000028310978,0.000019533638,0.000064934065,0.0000020544155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000965339,0.00003371293,0.0000037695756,0.000067241024,0.000047823836,8.049814e-7,0.000032329583,0.9746077,0.008168035,0.002209913,0.010208355,0.004523797],"study_design_scores_gemma":[0.00036416337,0.000097965254,0.000024555646,0.00008211818,0.000035285968,0.0000062282306,0.000016562088,0.96394587,0.028154107,0.001234687,0.0057811826,0.00025727137],"about_ca_topic_score_codex":0.000010491427,"about_ca_topic_score_gemma":0.0000020991133,"teacher_disagreement_score":0.7215889,"about_ca_system_score_codex":0.000049216593,"about_ca_system_score_gemma":0.0000066699395,"threshold_uncertainty_score":0.82757634},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17877069,0.000056410165,0.8182449,0.0004491633,0.00029036542,0.00061986875,0.000052984524,0.00081759767,0.00069807575],"genre_scores_gemma":[0.9880477,0.00065250666,0.0109509295,0.00014274594,0.000022572789,0.00006193279,0.000053806896,0.000059051963,0.000008709862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869555,0.00018059755,0.00036743694,0.0003452316,0.00013666575,0.0002745264],"domain_scores_gemma":[0.99643487,0.0006689936,0.00006551903,0.0026546665,0.00008511373,0.000090835536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012123341,0.00025425197,0.00027773093,0.00032064828,0.00031539524,0.00018848381,0.00088422815,0.00016688582,0.000018184757],"category_scores_gemma":[0.000005794423,0.00028295824,0.00004397719,0.0003926271,0.00018574142,0.00049211166,0.000022940576,0.0006892774,0.000011068263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029288076,0.00020467598,0.00034699446,0.000024245168,0.000052915555,0.0000026816053,0.00008353533,0.71439916,0.008928016,0.000031906642,0.00035057415,0.27554598],"study_design_scores_gemma":[0.00046749375,0.000020214113,0.0008516812,0.00031831255,0.000021824055,0.000012140829,0.00005434863,0.9871096,0.010719241,0.000046279714,0.00009765314,0.0002812156],"about_ca_topic_score_codex":0.0005863602,"about_ca_topic_score_gemma":0.00090675836,"teacher_disagreement_score":0.80927706,"about_ca_system_score_codex":0.00007974006,"about_ca_system_score_gemma":0.000019456616,"threshold_uncertainty_score":0.9999623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005578327,0.0001819475,0.99293095,0.000045997822,0.0001606534,0.00047418795,0.000010788945,0.00048957183,0.00012759969],"genre_scores_gemma":[0.86585873,0.000010850218,0.13374673,0.000054734814,0.000082997256,0.0001620505,0.000005468586,0.00003681608,0.000041603795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941725,0.00000902869,0.00014480145,0.00014916986,0.0000925853,0.00018715387],"domain_scores_gemma":[0.99966794,0.000021207512,0.000028616976,0.00009610891,0.000109817374,0.00007628107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007267693,0.00012106744,0.00009770588,0.00013735915,0.00016178234,0.000050446506,0.000044540735,0.0000658177,0.0000029325981],"category_scores_gemma":[0.0000031481543,0.00013267709,0.000024557561,0.00021035157,0.000012677438,0.0001692987,7.2955186e-7,0.00006816168,0.0000069685807],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009661045,0.00006697762,0.0000010240705,0.00007039307,0.000010859867,1.2983607e-7,0.000556052,0.102649026,0.14569886,0.000014410447,0.00007210476,0.7508505],"study_design_scores_gemma":[0.000098025506,0.000014000494,0.000011809593,0.000040223003,0.000019806894,0.0000033252297,0.000022423035,0.62915665,0.37031338,0.000022726761,0.00019688428,0.00010073045],"about_ca_topic_score_codex":9.940775e-7,"about_ca_topic_score_gemma":4.1730996e-7,"teacher_disagreement_score":0.8602804,"about_ca_system_score_codex":0.000046777885,"about_ca_system_score_gemma":0.000008526945,"threshold_uncertainty_score":0.54104143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.497596,0.00017100803,0.49629214,0.000032056036,0.000092322596,0.00019073626,0.000027410351,0.0002515916,0.005346736],"genre_scores_gemma":[0.8808102,0.000011156983,0.11910551,0.000013654773,0.000014794949,3.6189695e-7,0.00002846434,0.0000124224025,0.0000034359412],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930036,0.000034393855,0.00028000167,0.000081027,0.00013684372,0.00016736324],"domain_scores_gemma":[0.99916947,0.00011294294,0.000057192028,0.00058044464,0.000050500108,0.000029428005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018725752,0.00009251922,0.00018621003,0.00010947453,0.000009811955,0.000007460179,0.0001994136,0.00004860194,0.00001968706],"category_scores_gemma":[0.00004170333,0.0000905439,0.000022844932,0.00014962771,0.00003186208,0.0005056766,0.00007789607,0.00006898054,0.000002195658],"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.000019021638,0.000078156656,0.0018884109,0.00027271066,0.00001586542,0.0000019920608,0.000448157,0.0048571927,0.98095965,0.00008333718,0.005089431,0.0062860693],"study_design_scores_gemma":[0.00009799631,0.0000039641955,0.000984896,0.0000916641,0.0000055968235,0.0000012262681,0.000045828645,0.44435444,0.5541819,0.00002667727,0.00014912397,0.00005671714],"about_ca_topic_score_codex":0.00022513584,"about_ca_topic_score_gemma":0.000026125077,"teacher_disagreement_score":0.43949723,"about_ca_system_score_codex":0.000013380389,"about_ca_system_score_gemma":0.0000062759696,"threshold_uncertainty_score":0.36922732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96970075,0.000014433086,0.029639592,0.000071319286,0.000084454645,0.00015331883,4.404689e-7,0.00022818876,0.00010748469],"genre_scores_gemma":[0.99919814,0.0000047619887,0.0006715503,0.000071157396,0.000026658836,0.0000069832504,0.000004165812,0.000010197163,0.000006395523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.000022537723,0.00013129224,0.00006993903,0.00007788149,0.00008690057],"domain_scores_gemma":[0.99974364,0.00004250903,0.000035177392,0.000083559775,0.000080200276,0.000014902682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030151421,0.00006828599,0.00006778456,0.000032791857,0.000040658535,0.000029003668,0.00006763576,0.00002929411,0.0000077698605],"category_scores_gemma":[0.0000054067837,0.0000528396,0.000028841096,0.00008010205,0.00003309616,0.00015971431,0.00001779046,0.000081668026,0.000010166964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015523038,0.000004389644,0.00019813709,0.000007068113,0.000007116857,2.0501922e-7,0.00011543009,0.50617516,0.48693413,0.00011787539,0.00032376286,0.0061151464],"study_design_scores_gemma":[0.00007066093,0.000024867833,0.14781795,0.000018063201,0.0000064736455,0.0000037481598,0.00010360962,0.84347546,0.0077261557,0.0006865183,0.000004587306,0.00006189838],"about_ca_topic_score_codex":0.00007322295,"about_ca_topic_score_gemma":0.0000033595088,"teacher_disagreement_score":0.479208,"about_ca_system_score_codex":0.000014565123,"about_ca_system_score_gemma":0.0000024963838,"threshold_uncertainty_score":0.21547364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589653,0.00014276129,0.43880916,0.00028037652,0.00023390283,0.0003713033,0.0000017942949,0.00018015574,0.0010152418],"genre_scores_gemma":[0.99672717,0.000002105402,0.002677101,0.0003535285,0.00018266425,0.00003956648,0.0000024219753,0.00001040467,0.000005057067],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939436,0.000021475475,0.00018658018,0.00005383986,0.0001382922,0.0002054396],"domain_scores_gemma":[0.99976236,0.000055866603,0.00005182725,0.00007784076,0.00003375157,0.000018329336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022399645,0.00008610331,0.000095941825,0.000043220414,0.000054305376,0.00005562252,0.00010763448,0.000044688273,0.0000021513913],"category_scores_gemma":[0.000012597337,0.000055375946,0.0000301392,0.00014344265,0.00003499453,0.00085713295,0.00000421482,0.00012454441,0.0000012207454],"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.00005124131,0.000055990444,0.0004457575,0.00029944238,0.000013417953,9.2184854e-7,0.003937678,0.044056773,0.86754245,0.00000949207,0.017680489,0.06590637],"study_design_scores_gemma":[0.00045916802,0.000091519505,0.0020861824,0.00037821103,0.000038128313,0.000037833368,0.00053041795,0.3300993,0.64769113,0.00024652766,0.017931307,0.0004102471],"about_ca_topic_score_codex":0.000037727033,"about_ca_topic_score_gemma":0.0000020793009,"teacher_disagreement_score":0.43776184,"about_ca_system_score_codex":0.000031867494,"about_ca_system_score_gemma":0.000011184476,"threshold_uncertainty_score":0.22581655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.299298,0.000041877054,0.6939834,0.00008066931,0.00015414029,0.000050280105,6.889647e-7,0.00058988464,0.005801109],"genre_scores_gemma":[0.996906,0.000008085477,0.002032487,0.00072657573,0.00029891788,0.0000015226539,0.0000025570218,0.000019118665,0.0000047413946],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995997,0.000004447938,0.00008006893,0.0000726228,0.00007210763,0.00017106559],"domain_scores_gemma":[0.9997821,0.00003986602,0.000012077383,0.00012945283,0.000009778037,0.000026719952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006515511,0.000078982855,0.0000935251,0.000028003438,0.000028880686,0.000017711043,0.000067925284,0.00001824577,0.0000035266814],"category_scores_gemma":[0.000002541193,0.00008157605,0.000044630575,0.000091189264,0.00001716454,0.000053421187,0.000011941746,0.00009077117,0.000016917693],"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.000010934987,0.000008605525,0.0002526331,0.000007497083,0.000039130664,0.00003742047,0.00015512909,0.0038589397,0.9576006,0.0013829757,0.021032948,0.015613215],"study_design_scores_gemma":[0.0006496347,0.000010681184,0.0010582538,0.00005947653,0.000024474659,0.0000072643347,0.000015620593,0.02039261,0.9679338,0.0024280478,0.0070522754,0.00036788272],"about_ca_topic_score_codex":0.0000067852975,"about_ca_topic_score_gemma":0.0000011780045,"teacher_disagreement_score":0.697608,"about_ca_system_score_codex":0.000020168674,"about_ca_system_score_gemma":0.0000010734448,"threshold_uncertainty_score":0.33265746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030729728,0.000118920005,0.965241,0.00078486785,0.00017511443,0.0012200791,0.00001498222,0.001378463,0.00033683865],"genre_scores_gemma":[0.9428537,0.000015198403,0.05614344,0.00025034905,0.0000989396,0.00017287559,0.000008337239,0.00010795089,0.00034920103],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983237,0.00005700042,0.0003648046,0.00044196978,0.00032935603,0.00048320348],"domain_scores_gemma":[0.9988914,0.000158282,0.000085260835,0.00026558188,0.0004032184,0.00019624845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000098266166,0.00036908896,0.0003583751,0.0004374621,0.00037305185,0.00038145875,0.00019180044,0.00019692344,0.00004180651],"category_scores_gemma":[0.000012529157,0.00031178028,0.00013330807,0.0006264898,0.000051348885,0.0006028546,0.0000021380367,0.00033618076,0.000041150375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008638079,0.000084144216,0.0000014398274,0.00010883756,0.000064824184,0.0000063592083,0.00043941222,0.3850688,0.45840633,0.0000026509051,0.0049375608,0.15079324],"study_design_scores_gemma":[0.0004623359,0.00019178189,0.00003705772,0.00036335416,0.0000654374,0.000017449067,0.00015898702,0.6392562,0.35719764,0.000270832,0.0015152763,0.00046368598],"about_ca_topic_score_codex":0.00004277784,"about_ca_topic_score_gemma":0.000008305384,"teacher_disagreement_score":0.912124,"about_ca_system_score_codex":0.000116615156,"about_ca_system_score_gemma":0.000052581705,"threshold_uncertainty_score":0.9999334},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014650002,0.00001832371,0.9725131,0.000006718835,0.00026873656,0.0002949934,0.000007293823,0.0008583281,0.011382498],"genre_scores_gemma":[0.42556962,0.0000020954878,0.57419115,0.000026626163,0.00013047698,0.000002564334,0.000025806105,0.000029964964,0.000021692395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993186,0.000011854482,0.00017933246,0.0001839355,0.000084469466,0.00022182465],"domain_scores_gemma":[0.9995478,0.00006616108,0.00003963997,0.00018509901,0.00010876905,0.000052531854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079866426,0.00016189735,0.00017150973,0.00009365892,0.00009839619,0.00007496828,0.000083231156,0.00013485971,0.00004423638],"category_scores_gemma":[0.000016624217,0.00016179355,0.0000715831,0.000099650686,0.000046151334,0.00014688131,0.000021399681,0.000176832,6.3622326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007779656,0.0000080144355,0.00000472425,0.000009876035,0.000023672566,0.0000012452463,0.000016387145,0.8659796,0.13031988,0.00012090408,0.0005829383,0.0029249503],"study_design_scores_gemma":[0.00018585984,0.000013951047,0.0000019794888,0.000022368344,0.000022078402,0.000034081724,0.000040600422,0.9204732,0.0787049,0.0002226771,0.00007814835,0.00020010746],"about_ca_topic_score_codex":0.000017947308,"about_ca_topic_score_gemma":0.000004472276,"teacher_disagreement_score":0.41091964,"about_ca_system_score_codex":0.000023762095,"about_ca_system_score_gemma":0.000019506242,"threshold_uncertainty_score":0.6597749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08996225,0.00014409029,0.837834,0.000014704938,0.00008847346,0.00015434546,8.624778e-7,0.0010597091,0.070741564],"genre_scores_gemma":[0.9637829,0.00001506448,0.035958763,0.00002104535,0.00001436299,0.000004782715,0.0000013359296,0.0000071579652,0.00019461098],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99988514,0.0000011669906,0.000028867567,0.000033944187,0.000011790607,0.00003909144],"domain_scores_gemma":[0.99992895,0.0000046916366,0.000002917471,0.00004397898,0.0000102162885,0.000009266587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000011875158,0.000027200094,0.000027950378,0.00001543123,0.00001083076,0.00000463688,0.000014514727,0.000019351353,0.000010320568],"category_scores_gemma":[0.0000025809911,0.000024524239,0.0000061616447,0.00001319117,0.000004991107,0.000028982402,0.0000039489537,0.00000949861,7.9374297e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004613962,0.000048581278,0.001469398,0.0001261697,0.00012666828,0.00000548005,0.0027182638,0.00038762062,0.39331648,0.34712762,0.057069335,0.19755825],"study_design_scores_gemma":[0.00010437579,0.000033234977,0.0015418784,0.000014099492,0.000009742078,0.0000036789597,0.00002603831,0.07140591,0.8896999,0.031118836,0.005925618,0.00011669035],"about_ca_topic_score_codex":0.0000058421606,"about_ca_topic_score_gemma":0.0000027212081,"teacher_disagreement_score":0.8738206,"about_ca_system_score_codex":0.000001960936,"about_ca_system_score_gemma":5.7194853e-7,"threshold_uncertainty_score":0.100006945},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042330526,0.00075753074,0.87985593,0.00013491548,0.0009418288,0.00015888065,0.0000010551161,0.0032602337,0.072559066],"genre_scores_gemma":[0.978648,0.000009515892,0.020362323,0.00036494728,0.0005094946,9.73235e-7,0.0000039972774,0.00003877496,0.0000619889],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918306,0.000022135864,0.0001410081,0.00009514594,0.000101793004,0.00045684216],"domain_scores_gemma":[0.9995602,0.00008391441,0.000018577686,0.00023093786,0.000014136186,0.000092260256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103225226,0.0001500558,0.00016224367,0.000046443878,0.00007655893,0.000040567807,0.00007155056,0.00006280528,0.000112193025],"category_scores_gemma":[0.0000063113234,0.00014451801,0.00004470556,0.00012817388,0.000020845904,0.00011760549,0.00002230534,0.0001271157,0.000041500654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046430177,0.00008141351,0.009921239,0.00008130705,0.00017565202,0.000047274607,0.00029839002,0.35552102,0.1544052,0.008272623,0.45863867,0.0125107635],"study_design_scores_gemma":[0.00025767487,0.000015426749,0.0016177896,0.00012830677,0.000027355063,0.000018906292,0.00001606666,0.6302982,0.34039736,0.00097652833,0.025806481,0.00043990003],"about_ca_topic_score_codex":0.000019853684,"about_ca_topic_score_gemma":0.0000060799885,"teacher_disagreement_score":0.93631744,"about_ca_system_score_codex":0.000030396735,"about_ca_system_score_gemma":0.0000043171735,"threshold_uncertainty_score":0.58932734},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043872602,0.000029307801,0.94655025,0.00031529609,0.00028159644,0.000339852,0.000007089472,0.00035132782,0.008252687],"genre_scores_gemma":[0.999397,0.000074735326,0.00026320436,0.00015576842,0.000011176189,0.000025786068,9.909296e-7,0.000006316106,0.00006504677],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947584,0.00010757998,0.0002121387,0.000037733418,0.00010344291,0.00006329118],"domain_scores_gemma":[0.9994479,0.00015651934,0.000059359787,0.00026188942,0.00006061258,0.000013727169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022811341,0.00007100159,0.00007968452,0.00008921317,0.00011397216,0.00002829195,0.00011905938,0.000050928767,0.000009955225],"category_scores_gemma":[0.000020622161,0.00003433182,0.000043244316,0.0001781098,0.0001234479,0.00025759765,0.0000011315215,0.00013722043,0.0000073538827],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044889768,0.000051400784,0.000016616772,0.00012224578,0.0001456543,4.7384425e-8,0.0057576387,0.03813903,0.0071115578,0.06238762,0.0024733704,0.8833459],"study_design_scores_gemma":[0.0012269072,0.00008743919,0.0019499126,0.00018292641,0.00010265494,0.0000127735575,0.0005165733,0.25049454,0.7047493,0.03057718,0.009805862,0.00029394904],"about_ca_topic_score_codex":0.000013035916,"about_ca_topic_score_gemma":0.0000014451351,"teacher_disagreement_score":0.9555244,"about_ca_system_score_codex":0.00001514969,"about_ca_system_score_gemma":0.0000065067475,"threshold_uncertainty_score":0.1400011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3496844,0.000029265133,0.50139135,0.000026377924,0.00026000888,0.00015329888,0.0000029613452,0.0013135507,0.14713877],"genre_scores_gemma":[0.9738165,0.000002356118,0.026058596,0.000054064145,0.000028529623,5.217582e-7,0.0000026765313,0.000023727633,0.000013014581],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991765,0.000037347938,0.00024905862,0.00013587634,0.00019267024,0.0002085516],"domain_scores_gemma":[0.9994672,0.000052056752,0.00004387918,0.00028755295,0.00009534264,0.000053950997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016395941,0.00014904221,0.00024666736,0.00008165423,0.0000425312,0.000021030544,0.00012169987,0.00005808732,0.00006951777],"category_scores_gemma":[0.000033809803,0.00014808336,0.00006230157,0.00009613444,0.0000838672,0.00006153757,0.0000318399,0.00009491631,0.000008374001],"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.000009523595,0.00002416063,0.0002921919,0.00005860398,0.000054673084,0.0000020527332,0.00011036813,0.0029554311,0.9866621,0.0032802247,0.0015736828,0.004977002],"study_design_scores_gemma":[0.0003064048,0.000025783796,0.0009600554,0.00017392574,0.000011297201,0.000006197326,0.000026749582,0.15729554,0.8389295,0.0017612453,0.00029116267,0.00021214396],"about_ca_topic_score_codex":0.00002874196,"about_ca_topic_score_gemma":0.000007905279,"teacher_disagreement_score":0.62413216,"about_ca_system_score_codex":0.000022097358,"about_ca_system_score_gemma":0.000006202455,"threshold_uncertainty_score":0.6038664},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056344382,0.00004763016,0.9414782,0.000021146338,0.0001576039,0.0005868915,0.0000014583934,0.00087455567,0.0004881413],"genre_scores_gemma":[0.5560925,0.0000023205614,0.44361085,0.00014217009,0.00010060677,0.00002366599,0.0000019412018,0.000020029353,0.000005938452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987212,0.000017368295,0.00017164389,0.000409395,0.00021641477,0.00046397385],"domain_scores_gemma":[0.9990322,0.00015704763,0.000048189027,0.00031793347,0.0003242951,0.00012035856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035909013,0.00020833834,0.00020401843,0.00014177145,0.0001977679,0.00034515353,0.00044137737,0.000045494773,0.0000034034113],"category_scores_gemma":[0.000020712836,0.00016754364,0.00003636571,0.00039736045,0.00026068892,0.00043807985,0.00009475614,0.00012132217,0.0000084103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035095574,0.00009657763,0.00013235924,0.00027913845,0.000063064304,0.000004566669,0.0012000378,0.46938086,0.31708995,0.0015090469,0.0028506063,0.2073587],"study_design_scores_gemma":[0.0001363801,0.000057791745,0.00021412763,0.00007348552,0.000006420694,0.000015439024,0.000012490759,0.8467307,0.14942066,0.0030394983,0.000059776386,0.00023321115],"about_ca_topic_score_codex":0.0000044454623,"about_ca_topic_score_gemma":3.3388724e-7,"teacher_disagreement_score":0.4997481,"about_ca_system_score_codex":0.000031712018,"about_ca_system_score_gemma":0.000053815187,"threshold_uncertainty_score":0.6832231},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4168944,0.000052348798,0.5820219,0.00001163062,0.0008933624,0.000064343156,0.0000012296872,0.000040497926,0.00002028325],"genre_scores_gemma":[0.68118525,3.6342692e-7,0.3185903,0.000009076997,0.00019883618,3.8480187e-7,0.00000448211,0.0000094496845,0.000001853575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991435,0.000035057637,0.0003395559,0.0000827418,0.00019493984,0.00020419703],"domain_scores_gemma":[0.9993936,0.00006905703,0.00013981525,0.000120779965,0.00020961043,0.00006715354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010115103,0.00007709999,0.00012711981,0.0003218931,0.00008976223,0.0001391563,0.000117544114,0.00004287981,0.000003492915],"category_scores_gemma":[0.000047392485,0.00007490761,0.00004857123,0.0002734273,0.00002963991,0.0002319462,0.000010309415,0.00011761601,0.0000010078103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014304722,0.00025108425,0.000523929,0.000030737177,0.000012454525,0.000006798565,0.0014573528,0.65806144,0.18479846,0.00006191313,0.0030434509,0.15173806],"study_design_scores_gemma":[0.00021577365,0.000033050404,0.0013432413,0.000096142736,0.000006447976,0.000008834182,0.00006873353,0.9594961,0.037955012,0.000037081536,0.0006594404,0.0000801551],"about_ca_topic_score_codex":0.0000012664292,"about_ca_topic_score_gemma":5.850196e-7,"teacher_disagreement_score":0.30143464,"about_ca_system_score_codex":0.000083678766,"about_ca_system_score_gemma":0.000024880343,"threshold_uncertainty_score":0.3054644},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488581,0.000047647758,0.049350854,0.000036301128,0.00027371093,0.00013194152,0.000012823517,0.000516664,0.0007719468],"genre_scores_gemma":[0.9723342,0.000029872808,0.027251119,0.00011362159,0.00020002888,0.000006699093,0.00004835301,0.0000133129,0.00000280458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995429,0.00000985233,0.00014729313,0.000077650795,0.00008900779,0.00013329125],"domain_scores_gemma":[0.9995576,0.00015221871,0.000039840357,0.00017367888,0.000041660474,0.000034982993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008187367,0.00011335116,0.00021388514,0.000037199887,0.00006684895,0.00008534044,0.00006779806,0.00006640646,0.0000075169273],"category_scores_gemma":[0.00005034917,0.00010940586,0.0000458464,0.000050654624,0.00004908954,0.0002935706,0.000044621913,0.00020135936,0.000013080459],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027060488,0.00005673511,0.0032953909,0.00015131384,0.00067205203,0.0000100451125,0.011529069,0.0067855828,0.3486073,0.019977344,0.0031148838,0.6030942],"study_design_scores_gemma":[0.0668494,0.00002953735,0.02121904,0.00034025527,0.0003996305,0.000017753115,0.0006262945,0.40828505,0.23428811,0.23771368,0.028068872,0.0021623566],"about_ca_topic_score_codex":0.00023682922,"about_ca_topic_score_gemma":0.000009927288,"teacher_disagreement_score":0.6009319,"about_ca_system_score_codex":0.000005387955,"about_ca_system_score_gemma":0.000004687838,"threshold_uncertainty_score":0.44614416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99055237,0.000088122084,0.00039788554,0.0001488283,0.0001764238,0.00041283702,0.00002049378,0.00044214484,0.0077609187],"genre_scores_gemma":[0.7294,0.00007310554,0.27011168,0.00003398578,0.00016757601,0.00008019165,0.000007309064,0.00008365833,0.000042491272],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983516,9.77336e-9,0.00051793945,0.00030013235,0.00046054937,0.00036978096],"domain_scores_gemma":[0.998447,0.000083263156,0.00022064596,0.00006994662,0.0010803626,0.00009880244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021447003,0.00033173207,0.0003537739,0.00011651372,0.00007415676,0.000066263696,0.0006474166,0.00018033951,0.000014042623],"category_scores_gemma":[0.000121315665,0.0002660648,0.00031293178,0.00029986375,0.00015110274,0.00048750525,0.00009108441,0.0002701461,0.0000014799539],"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.00019357346,0.0001800031,0.0029552954,0.00055148406,0.0010176142,6.202964e-7,0.0010909521,0.0005653652,0.7563467,0.2283064,0.0074777897,0.0013141911],"study_design_scores_gemma":[0.00092514144,0.00029045402,0.0016161132,0.0005807163,0.00018102862,0.000030017283,0.0007842036,0.2041872,0.78712136,0.0014967889,0.0022503636,0.00053664076],"about_ca_topic_score_codex":0.000011379432,"about_ca_topic_score_gemma":3.4149343e-7,"teacher_disagreement_score":0.2697138,"about_ca_system_score_codex":0.000093782255,"about_ca_system_score_gemma":0.000014940039,"threshold_uncertainty_score":0.99997914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138698,0.000037258258,0.3644303,0.000018678558,0.00032066967,0.00013667754,0.0000011104798,0.0038914967,0.117293976],"genre_scores_gemma":[0.9347086,0.0000052503697,0.06452448,0.000039651677,0.000106132575,0.000009963081,0.000005039857,0.000037234342,0.0005636627],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994583,0.0000047638882,0.00010732726,0.00014380785,0.000089578316,0.00019622865],"domain_scores_gemma":[0.999655,0.000032630785,0.0000139371,0.00021384728,0.00002842425,0.000056166424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059516904,0.000123807,0.000114088834,0.000061596256,0.000048006274,0.000038333004,0.0001295604,0.000100416306,0.00006129423],"category_scores_gemma":[0.000033331686,0.000113746035,0.00004544404,0.00008916514,0.000026053536,0.00007249778,0.00003794576,0.00042860885,0.000039119423],"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.0000036100428,0.000048941187,0.0021960454,0.000011683553,0.000030699804,0.0000027253138,0.00015181195,0.012252896,0.9737137,0.0019161393,0.003434718,0.006237051],"study_design_scores_gemma":[0.0002224246,0.000011873874,0.0014512845,0.000007479133,0.0000060506773,0.000021615635,0.000049267674,0.8467839,0.1223091,0.00008659583,0.02882441,0.00022600248],"about_ca_topic_score_codex":0.000058951264,"about_ca_topic_score_gemma":0.000017733717,"teacher_disagreement_score":0.85140455,"about_ca_system_score_codex":0.000006935245,"about_ca_system_score_gemma":0.0000053413446,"threshold_uncertainty_score":0.46384287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58994496,0.0012948837,0.06717021,0.00027045768,0.00074456324,0.00004274502,0.00015759973,0.00027640376,0.34009817],"genre_scores_gemma":[0.98837215,0.0009506152,0.0071098576,0.00081822654,0.0007359568,0.00031501325,0.0012550582,0.0003380836,0.00010505379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9946473,0.00021780287,0.0013473774,0.0011301682,0.0015106307,0.0011466825],"domain_scores_gemma":[0.99575764,0.0011729952,0.0012881656,0.0011092813,0.00018085628,0.00049104716],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001015237,0.0005628321,0.0003543725,0.0006042907,0.000776088,0.0006766104,0.00086700416,0.0010801681,0.1754995],"category_scores_gemma":[0.00028256903,0.0010991363,0.0011522659,0.001294568,0.00059593434,0.00065310457,0.0007199641,0.0007499199,0.0005077352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010071609,0.00029198758,0.00003009305,0.0007252213,0.0055520968,0.0002561136,0.0011716007,0.3188838,0.005876703,0.48785838,0.17154048,0.006806353],"study_design_scores_gemma":[0.0007256791,0.00036728632,0.0001367133,0.0003083243,0.0019047818,0.000102080274,0.00035727897,0.42247233,0.57160026,0.00078661315,0.00053986826,0.0006988161],"about_ca_topic_score_codex":0.0010381296,"about_ca_topic_score_gemma":0.0002997871,"teacher_disagreement_score":0.56572354,"about_ca_system_score_codex":0.000014183272,"about_ca_system_score_gemma":0.00056840363,"threshold_uncertainty_score":0.99914587},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39006972,0.004290644,0.6028272,0.000031544845,0.00010996534,0.0001553153,0.00000338674,0.0006637486,0.0018484439],"genre_scores_gemma":[0.9768803,0.000065017724,0.022820251,0.00005273686,0.00012378443,0.000004274175,0.0000031405623,0.000018099314,0.00003240419],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994195,0.000022363869,0.00011721896,0.00013492207,0.00008716194,0.00021880413],"domain_scores_gemma":[0.9997295,0.000037092897,0.000028795865,0.000057652484,0.000064691514,0.000082260834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016265997,0.00012366276,0.00013490289,0.00005615008,0.00016705305,0.00012502533,0.00003207908,0.000066321234,0.000020291927],"category_scores_gemma":[0.00001306406,0.000116497424,0.000013496368,0.000101665486,0.000041204374,0.0005597407,0.00003940104,0.00012223047,0.0000024225571],"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.00005492175,0.000075781616,0.008360941,0.00038945032,0.00005991661,0.00000871254,0.0007083155,0.00034813207,0.65926087,0.00036189283,0.0046403618,0.3257307],"study_design_scores_gemma":[0.00064794044,0.00012014177,0.012807013,0.0009077213,0.00018104058,0.00029337028,0.0002214439,0.17942747,0.7923792,0.006874497,0.005301122,0.0008390142],"about_ca_topic_score_codex":0.000029823803,"about_ca_topic_score_gemma":0.000001377631,"teacher_disagreement_score":0.5868105,"about_ca_system_score_codex":0.000019866826,"about_ca_system_score_gemma":0.000010385046,"threshold_uncertainty_score":0.4750627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85256135,0.00005370045,0.14644895,0.00014113056,0.00017346867,0.00011759975,5.66757e-7,0.000021430104,0.00048180475],"genre_scores_gemma":[0.8860878,0.0001008695,0.11359959,0.00004316582,0.00015627047,3.8853017e-8,0.0000017327936,0.0000082078095,0.0000023267728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990624,0.00007616612,0.00046543236,0.00008204241,0.00019817527,0.00011577264],"domain_scores_gemma":[0.999255,0.00019110489,0.00016793393,0.000105654,0.00026156878,0.000018748011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036002626,0.000094861105,0.00019206035,0.00019976021,0.00005891466,0.000040896313,0.000065610184,0.00007788743,6.888648e-7],"category_scores_gemma":[0.000078861856,0.00008125902,0.000023173843,0.00042834476,0.000045513065,0.00010669248,0.0000061474916,0.00031168436,8.096956e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002932093,0.000016537393,0.00043879435,0.00004096028,0.000027395065,0.000006047357,0.0012001476,0.13414727,0.36122176,0.00062670565,0.000097321725,0.50214773],"study_design_scores_gemma":[0.00039084197,0.00002919768,0.026385682,0.00030590242,0.000013230227,0.00013157561,0.0001429622,0.9117269,0.05565684,0.0047905766,0.00031493526,0.00011138329],"about_ca_topic_score_codex":0.0000393906,"about_ca_topic_score_gemma":0.00015283751,"teacher_disagreement_score":0.7775796,"about_ca_system_score_codex":0.000022216982,"about_ca_system_score_gemma":0.000032014166,"threshold_uncertainty_score":0.33136466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036368538,0.0000671989,0.78513825,0.0000037085267,0.00017551721,0.00007937076,5.3883514e-7,0.0018686729,0.1762982],"genre_scores_gemma":[0.9840924,0.000012881073,0.01568702,0.000097683376,0.000033140946,7.680207e-7,0.0000023947991,0.000019804345,0.000053917745],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996529,0.000009049873,0.00009206352,0.000076737946,0.000055266562,0.000113980306],"domain_scores_gemma":[0.9997716,0.00000833676,0.000012005822,0.00014081247,0.000036505557,0.00003073349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000018858436,0.00007975795,0.00007751213,0.000048835205,0.00002998965,0.000011893595,0.000052752144,0.00004588647,0.00009723418],"category_scores_gemma":[0.000003939791,0.00007485194,0.000021100446,0.0000755069,0.000019772853,0.00006930652,0.000018061326,0.000056065717,0.000039742587],"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.00010941578,0.00023965734,0.009608421,0.00015273513,0.00062322913,0.0005357792,0.013187391,0.04012675,0.22991985,0.04243768,0.26578894,0.39727014],"study_design_scores_gemma":[0.00010847247,0.00001659649,0.0007261927,0.00004163331,0.000010396092,0.000017965665,0.00007134945,0.36159152,0.63061947,0.0029625408,0.0036322402,0.00020163045],"about_ca_topic_score_codex":0.000044896697,"about_ca_topic_score_gemma":0.0000070151877,"teacher_disagreement_score":0.94772387,"about_ca_system_score_codex":0.000011831175,"about_ca_system_score_gemma":0.0000025626905,"threshold_uncertainty_score":0.30523735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013240542,0.00017593814,0.9738796,0.000008764075,0.00011085466,0.0006679606,0.0000013297422,0.0015860613,0.010328994],"genre_scores_gemma":[0.66151434,0.000004135407,0.33796713,0.000028333387,0.00010994066,0.000017956705,0.000008135305,0.000051456114,0.0002985473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924994,0.000019835086,0.0001630646,0.00018796689,0.00010389663,0.0002753276],"domain_scores_gemma":[0.9993954,0.00012104747,0.000029307468,0.00028688728,0.00008271032,0.00008470035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007637184,0.0001878589,0.00023531645,0.00006169639,0.000067811605,0.00015330913,0.00011819873,0.000077739016,0.000011900559],"category_scores_gemma":[0.000003911863,0.00014542717,0.000041400737,0.00008219827,0.000020568827,0.00012554179,0.000020541702,0.000100589714,0.0000070873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008958269,0.00005037708,0.00014181992,0.00048067793,0.0005451192,0.000005604385,0.0006026607,0.62296945,0.15943387,0.026019147,0.047832597,0.1418291],"study_design_scores_gemma":[0.00026053755,0.000027415872,0.00002789657,0.00010225262,0.000022404465,0.000021673666,0.00027219055,0.9705805,0.02662191,0.0010948001,0.00069838256,0.00027003267],"about_ca_topic_score_codex":0.0002313315,"about_ca_topic_score_gemma":0.0000023363295,"teacher_disagreement_score":0.6482738,"about_ca_system_score_codex":0.000024916826,"about_ca_system_score_gemma":0.000012498949,"threshold_uncertainty_score":0.5930348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51447046,0.00022464943,0.48211387,0.000021760643,0.00030676322,0.00007916456,0.0000031390755,0.00029772258,0.0024824764],"genre_scores_gemma":[0.94872,0.000039367347,0.051058,0.000045522094,0.00009125782,0.000005323093,0.0000026322468,0.00002540226,0.000012496699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998801,0.00003391118,0.000398606,0.00022478787,0.00024012988,0.00030158204],"domain_scores_gemma":[0.9994148,0.000057106372,0.00006715712,0.00031149708,0.000082356644,0.000067075925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017031288,0.0001931102,0.00021861908,0.000059478472,0.00007587222,0.000045314133,0.0002243961,0.00010613082,0.00010756922],"category_scores_gemma":[0.0000373898,0.00020765979,0.00009296129,0.00030186374,0.00008559863,0.00017136207,0.00003984995,0.00018489652,0.000024755476],"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.000032970776,0.000114543494,0.00059115124,0.00006608764,0.00009461149,0.00002476562,0.0004308081,0.36846736,0.13757768,0.47823602,0.0010651306,0.013298889],"study_design_scores_gemma":[0.00003849508,0.000037166403,0.00019497555,0.00030535334,0.000019568195,0.00004749129,0.00058369845,0.20672056,0.6160998,0.17413722,0.0012211414,0.0005945409],"about_ca_topic_score_codex":0.000104560604,"about_ca_topic_score_gemma":0.00004492345,"teacher_disagreement_score":0.4785221,"about_ca_system_score_codex":0.00006146978,"about_ca_system_score_gemma":0.000026741212,"threshold_uncertainty_score":0.846812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08102574,0.000046886064,0.91700673,0.000048004556,0.00018064822,0.00007664149,0.0000061797577,0.0007236059,0.0008855359],"genre_scores_gemma":[0.9768702,0.000021594924,0.022892637,0.000085373715,0.000042834916,0.000014284471,0.0000018746593,0.000039171573,0.000032031716],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993193,0.000033239998,0.00020969684,0.00015539008,0.00011599421,0.00016633635],"domain_scores_gemma":[0.9995609,0.00005083527,0.000048410893,0.00019834106,0.00010113428,0.00004037892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010377444,0.00014496228,0.00018432215,0.0001384116,0.00009800077,0.00005269337,0.00009625971,0.000081271675,0.000039152972],"category_scores_gemma":[0.0000037803122,0.000150644,0.000057565278,0.00018785505,0.000058789694,0.00025810555,6.2776587e-7,0.00018611853,0.000016810485],"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.000033042696,0.0000581095,0.0000012506695,0.000121574434,0.000026060132,0.0000021944056,0.0001793991,0.050547957,0.8379318,0.000034812874,0.00021799079,0.11084581],"study_design_scores_gemma":[0.00019180102,0.000039045528,0.000046735342,0.00020455713,0.000028623272,0.0000047173617,0.000013984708,0.17772979,0.82019114,0.0013162778,0.00009238816,0.00014093866],"about_ca_topic_score_codex":0.000019179592,"about_ca_topic_score_gemma":0.000003264857,"teacher_disagreement_score":0.89584446,"about_ca_system_score_codex":0.000028100128,"about_ca_system_score_gemma":0.000010978996,"threshold_uncertainty_score":0.6143084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007425161,0.0001368883,0.9869074,0.00045850044,0.000063760905,0.0015349025,0.0000029944842,0.002135189,0.0013352085],"genre_scores_gemma":[0.24279268,0.0000021046858,0.7567074,0.00007276021,0.000090702684,0.00022021822,0.000019553481,0.00005649612,0.000038139835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998141,0.00004426859,0.00050516275,0.0003724582,0.00027481536,0.00066231104],"domain_scores_gemma":[0.99887204,0.00029322144,0.00008260718,0.00040123798,0.00018966757,0.00016119656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046124883,0.00038309878,0.00052029965,0.000103156155,0.00023923385,0.00030622547,0.00019209002,0.0001591525,0.00003514462],"category_scores_gemma":[0.00016743591,0.0003154413,0.00012777548,0.0003192088,0.00014436788,0.00021830341,0.000034592704,0.00027089287,0.000012476687],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013232432,0.0007299432,0.00005259525,0.0007333074,0.00025208128,0.000048393344,0.00204908,0.0011703906,0.00397425,0.11007293,0.00097390375,0.8798108],"study_design_scores_gemma":[0.0021863414,0.001923883,0.00023688139,0.0012409276,0.00036089573,0.00037632458,0.00034771435,0.7199315,0.037698217,0.13514829,0.098394535,0.0021545375],"about_ca_topic_score_codex":0.000002780578,"about_ca_topic_score_gemma":0.0000051178918,"teacher_disagreement_score":0.8776563,"about_ca_system_score_codex":0.00006532593,"about_ca_system_score_gemma":0.000019591986,"threshold_uncertainty_score":0.9999298},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016665427,0.00006060942,0.9745035,0.00008298424,0.00004982652,0.000374534,8.361199e-7,0.001744897,0.0065173577],"genre_scores_gemma":[0.72464323,0.0000011729078,0.27497151,0.000111280075,0.000101480815,0.00006344208,0.0000060282564,0.000029123374,0.000072731455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920636,0.000019861583,0.0002345587,0.00015601357,0.00010281545,0.00028039265],"domain_scores_gemma":[0.9996116,0.00008063963,0.000026775853,0.0001312737,0.000080609,0.00006908877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001455431,0.00015713663,0.00020354302,0.000053081203,0.0000820089,0.0001116015,0.00010287876,0.000071858405,0.00003368651],"category_scores_gemma":[0.000027420943,0.00013811473,0.00006429308,0.000083374514,0.000050108716,0.00008701532,0.000011154539,0.000071932205,0.0000056920308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027944914,0.00005584294,0.000052695974,0.00022103399,0.00006493391,0.0000032625817,0.0002549899,0.0049655293,0.121225715,0.048963103,0.0035660707,0.8205989],"study_design_scores_gemma":[0.0003984505,0.000091740345,0.000012618334,0.00006901548,0.000025164181,0.000008454882,0.000034049644,0.9341275,0.049625177,0.004948239,0.010394441,0.00026511782],"about_ca_topic_score_codex":0.000005000064,"about_ca_topic_score_gemma":0.000009603218,"teacher_disagreement_score":0.929162,"about_ca_system_score_codex":0.000016354523,"about_ca_system_score_gemma":0.000018835386,"threshold_uncertainty_score":0.5632155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24333335,0.0004031376,0.7547394,0.00009467152,0.000048542308,0.00029807436,0.000003110245,0.0002863521,0.0007933268],"genre_scores_gemma":[0.90946525,0.000029285111,0.090172336,0.0001234178,0.000053277912,0.000020083758,0.0000021700018,0.000049033944,0.000085172076],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988425,0.00006546551,0.00026599603,0.0002743259,0.0002561552,0.00029557722],"domain_scores_gemma":[0.9990744,0.00022713502,0.00009637605,0.0004263875,0.00008405143,0.00009166081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003356065,0.00024050486,0.00025727865,0.00012560352,0.00035712853,0.00013232039,0.00019678395,0.00006875736,0.000009943984],"category_scores_gemma":[0.000015727132,0.00018683096,0.000042963376,0.00021387226,0.00009973058,0.00011397032,0.0000099495865,0.00024817185,0.000009148333],"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.00006716626,0.000017944216,0.0000025604859,0.000056794157,0.00004027809,0.0000072114944,0.0014922603,0.0056390516,0.372753,0.000021308902,0.000019481087,0.61988294],"study_design_scores_gemma":[0.00031308518,0.000098624056,0.000027899456,0.00058994634,0.00005601196,0.000086041844,0.0011415456,0.020998789,0.97427154,0.0016611479,0.00045393253,0.0003014605],"about_ca_topic_score_codex":0.000030516074,"about_ca_topic_score_gemma":0.00005059564,"teacher_disagreement_score":0.66613185,"about_ca_system_score_codex":0.000046251236,"about_ca_system_score_gemma":0.000019776957,"threshold_uncertainty_score":0.76187456},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49407938,0.00051334663,0.50256956,0.00005270643,0.00035794263,0.00081867416,0.00011873221,0.0011900319,0.0002996172],"genre_scores_gemma":[0.92135125,0.00059366215,0.07689547,0.00004414762,0.0001260431,0.00026307686,0.00058087986,0.00014458147,8.7822076e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968786,0.00039494253,0.001050278,0.000574965,0.00048963085,0.00061155844],"domain_scores_gemma":[0.9957651,0.00049998536,0.0005269568,0.0025002377,0.00046625407,0.00024149474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000635239,0.00057917193,0.00066726655,0.00038920366,0.0006223789,0.00016914854,0.00092492945,0.00028289357,7.369655e-7],"category_scores_gemma":[0.00015574819,0.0006007438,0.0001704792,0.0005347937,0.00035284008,0.00087033265,0.00026363606,0.0006593669,0.000011488515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037372673,0.00033480348,0.0009444483,0.00019678095,0.00017487488,0.0000038135286,0.00092141714,0.34582213,0.45920542,0.0006631307,0.00010792976,0.19158788],"study_design_scores_gemma":[0.00073453947,0.00013798718,0.0007881336,0.000916503,0.000065605935,0.000087169356,0.00013783795,0.78809,0.20785514,0.00059857726,0.000050811406,0.000537699],"about_ca_topic_score_codex":0.00017558012,"about_ca_topic_score_gemma":0.00023375376,"teacher_disagreement_score":0.44226786,"about_ca_system_score_codex":0.00017181954,"about_ca_system_score_gemma":0.000050552437,"threshold_uncertainty_score":0.9996444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34873644,0.017471028,0.619677,0.0009359625,0.0021696808,0.0005491363,0.0000032954824,0.0013811893,0.009076287],"genre_scores_gemma":[0.9829598,0.00941508,0.0067740134,0.00017195546,0.00059764745,0.000011190413,0.0000070115902,0.000045263023,0.000018013778],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990629,0.00013703808,0.0003166461,0.00010685992,0.000091098475,0.00028544135],"domain_scores_gemma":[0.99849343,0.0007537609,0.00013007954,0.00046827603,0.00006813213,0.00008632659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005265671,0.00016118925,0.00024320032,0.00007749854,0.0007801328,0.00017816629,0.00038030508,0.000081293634,0.0000024020073],"category_scores_gemma":[0.000013112357,0.00015126992,0.000077489596,0.00015612008,0.00006532883,0.00007671667,0.00007627991,0.00046078803,0.0000018961085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013597925,0.0000842633,0.0050432435,0.000036799633,0.00036623605,0.000005503916,0.0007507513,0.08834068,0.003549603,0.037203047,0.015705029,0.84877884],"study_design_scores_gemma":[0.00040909156,0.000087438246,0.00027869898,0.00058283814,0.000034295932,0.000054726206,0.000028601085,0.8655623,0.00020854488,0.0022889478,0.13024615,0.0002183562],"about_ca_topic_score_codex":0.0000017762952,"about_ca_topic_score_gemma":0.0000059642375,"teacher_disagreement_score":0.8485605,"about_ca_system_score_codex":0.000024255445,"about_ca_system_score_gemma":0.000006193695,"threshold_uncertainty_score":0.61686087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91486657,0.0000085440615,0.080420844,0.00043659503,0.0012224913,0.00015385958,0.00001669741,0.0011498748,0.0017245306],"genre_scores_gemma":[0.993696,0.000011252119,0.0029764464,0.00277514,0.00038726104,0.00003746922,0.00006037962,0.00004737872,0.00000870654],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993209,0.000015772132,0.00015993086,0.0001775003,0.00009003655,0.00023586235],"domain_scores_gemma":[0.99962234,0.000028821327,0.000030012792,0.000226668,0.000025497451,0.000066641835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060684284,0.00015680339,0.00011638691,0.0000948125,0.000043768123,0.000055941266,0.00010980914,0.00009069504,0.00030077598],"category_scores_gemma":[0.000008329341,0.00016400826,0.00006702522,0.000069351954,0.000039264807,0.00013345927,0.00001955049,0.0003609767,0.00022298326],"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.0000026022806,0.000012034096,0.00043291887,0.000008316757,0.000019776555,0.000013148459,0.00003331552,0.0000073365654,0.81112814,0.0000015958154,0.0089539075,0.1793869],"study_design_scores_gemma":[0.0013881128,0.00008248318,0.014309065,0.00018247035,0.00009983609,0.00014882749,0.000052478797,0.079812564,0.8610121,0.0009836935,0.04021141,0.0017169705],"about_ca_topic_score_codex":0.000025784433,"about_ca_topic_score_gemma":0.000050484217,"teacher_disagreement_score":0.17766993,"about_ca_system_score_codex":0.0000146541015,"about_ca_system_score_gemma":0.0000019641075,"threshold_uncertainty_score":0.6688063},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6717321,0.0005303482,0.32667747,0.000017690527,0.000044473705,0.000031950698,6.9328763e-7,0.000033310116,0.0009319439],"genre_scores_gemma":[0.86025697,0.00004820707,0.13963716,0.000008888836,0.000026719494,4.0704657e-7,4.791577e-7,0.000008053165,0.000013108338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993643,0.00010396473,0.00027103632,0.000044673114,0.00014721359,0.00006878619],"domain_scores_gemma":[0.9993679,0.00008693646,0.00019129648,0.000098853314,0.00019867838,0.000056319055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001167991,0.000070458125,0.00024132295,0.0002344731,0.00002005795,0.000021535541,0.00007911271,0.000041746975,0.000009861471],"category_scores_gemma":[0.00004681797,0.000059030863,0.00006453253,0.00031146483,0.0000472872,0.00017737116,0.000016531925,0.000110711764,5.736198e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046305716,0.00015002127,0.0036664237,0.0001639445,0.003323523,0.000014847582,0.007687178,0.72233546,0.10193237,0.01757005,0.0026793992,0.14001371],"study_design_scores_gemma":[0.00025275288,0.0001406762,0.0021899804,0.000054490283,0.000500354,0.000040579554,0.00035314975,0.86426944,0.1222698,0.009365932,0.0004549298,0.00010794699],"about_ca_topic_score_codex":0.0000013316251,"about_ca_topic_score_gemma":2.1271075e-7,"teacher_disagreement_score":0.18852486,"about_ca_system_score_codex":0.000021496,"about_ca_system_score_gemma":0.00001791467,"threshold_uncertainty_score":0.24072087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83221877,0.0012317138,0.1603765,0.000019105919,0.0007202077,0.00036937548,0.000037843572,0.001480376,0.0035461348],"genre_scores_gemma":[0.91498303,0.000070155795,0.08437873,0.000035605597,0.00028865194,0.000009891541,0.000022402806,0.00008064284,0.0001308803],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981979,0.000097451135,0.0005426156,0.00028272404,0.000313621,0.0005656954],"domain_scores_gemma":[0.9988849,0.00005961028,0.00014464065,0.00053488126,0.00016332098,0.0002126045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028668452,0.00036331464,0.0004894814,0.00022758817,0.00010595985,0.00005699993,0.00021842393,0.0002645016,0.00025675524],"category_scores_gemma":[0.000023859428,0.00036384515,0.00014452201,0.00026584012,0.00011906848,0.0006570663,0.00006197228,0.00019771134,0.000015697338],"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.000014986848,0.00010089027,0.00022301216,0.00002240093,0.00011097454,0.0000026852888,0.00017048695,0.002768393,0.915824,0.00015871959,0.0028673674,0.07773609],"study_design_scores_gemma":[0.00043496874,0.000082994266,0.00016369026,0.00013463062,0.00009292653,0.0001356755,0.00010458003,0.25047958,0.7441136,0.00036117525,0.00337447,0.0005216987],"about_ca_topic_score_codex":0.00011167989,"about_ca_topic_score_gemma":0.00001265623,"teacher_disagreement_score":0.2477112,"about_ca_system_score_codex":0.000079589125,"about_ca_system_score_gemma":0.000024464465,"threshold_uncertainty_score":0.9998813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8763653,0.000062579486,0.12266127,0.000021079868,0.00004261514,0.00019472146,0.0000012419271,0.00028699927,0.0003641736],"genre_scores_gemma":[0.969519,0.0000035306432,0.030392282,0.000008443297,0.000026418214,0.000009996876,0.000007320396,0.000011665717,0.000021319029],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999595,0.000023882018,0.00013690909,0.00007430669,0.000056099372,0.000113812945],"domain_scores_gemma":[0.99980104,0.000044989105,0.000045730696,0.00007503683,0.000020144957,0.000013038836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014066712,0.000055451284,0.00006995376,0.0000599959,0.00004792275,0.000013678222,0.000032936394,0.00003423736,0.0000011079997],"category_scores_gemma":[0.000030745738,0.000046902904,0.000021042388,0.00013821707,0.00001674876,0.00016590719,0.0000244109,0.00005883733,7.395653e-8],"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.0000056006606,0.00003235274,0.076346815,0.000022417096,0.000011474097,5.6531903e-8,0.00032967483,0.03708407,0.88504744,0.00011981827,0.00014307014,0.0008572296],"study_design_scores_gemma":[0.0001498196,0.000003537222,0.11935914,0.000021729873,0.000006801075,0.000006174767,0.00014685614,0.8056299,0.07460068,0.000015491689,0.000015421949,0.00004442202],"about_ca_topic_score_codex":0.00004833121,"about_ca_topic_score_gemma":6.4838315e-7,"teacher_disagreement_score":0.81044674,"about_ca_system_score_codex":0.000025960828,"about_ca_system_score_gemma":0.0000030289027,"threshold_uncertainty_score":0.1912645},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05543705,0.03692523,0.7223929,0.0044262563,0.0047627175,0.00056037324,0.000046158693,0.0014992317,0.17395005],"genre_scores_gemma":[0.9345065,0.0010649788,0.011509356,0.000112716814,0.0011773288,0.000023530645,0.000018548497,0.00010505188,0.05148199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978824,0.000060870992,0.00062944094,0.00047629545,0.00022684273,0.00072410295],"domain_scores_gemma":[0.99875426,0.00015024099,0.00009158634,0.00075473683,0.00013226643,0.00011690061],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002525468,0.0003698242,0.0003569487,0.0001561205,0.00015336415,0.00018642898,0.0004770019,0.00028259284,0.0016242155],"category_scores_gemma":[0.00004234245,0.00045099127,0.00023578547,0.00052446086,0.0001961534,0.0002047821,0.00011355121,0.00039883715,0.0034024117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000133254225,0.00025963935,0.00083328545,0.00019018956,0.00006803132,0.00022615289,0.00045363465,0.57094115,0.03615094,0.07302992,0.12809013,0.18974364],"study_design_scores_gemma":[0.000022632601,0.000051502997,0.00019924309,0.0004255406,0.00004898922,0.00007472296,0.00015284953,0.34918106,0.45655906,0.019006625,0.17383549,0.00044229208],"about_ca_topic_score_codex":0.001604004,"about_ca_topic_score_gemma":0.00011389927,"teacher_disagreement_score":0.87906945,"about_ca_system_score_codex":0.00017454624,"about_ca_system_score_gemma":0.000031181393,"threshold_uncertainty_score":0.9997942},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042041417,0.0022647069,0.95377696,0.000002989845,0.0002248004,0.00091937074,0.00000826871,0.0005033229,0.0002581657],"genre_scores_gemma":[0.99680436,0.0000055870114,0.0029015194,0.000017499178,0.00009843626,0.000078802455,0.000011168849,0.00007370412,0.000008910604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985329,0.00009957464,0.0004771329,0.0003263521,0.00017373031,0.00039029596],"domain_scores_gemma":[0.99934244,0.0001177626,0.00013725435,0.00016573015,0.00014178063,0.000095026146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047776895,0.0002930365,0.0004348119,0.00022801275,0.0001384511,0.00021182952,0.00011914385,0.00013078022,0.0000013277391],"category_scores_gemma":[0.00001440167,0.0002958009,0.000036333196,0.0001561962,0.00004766991,0.00023663334,0.000014132362,0.00014960137,0.0000019126783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044623943,0.00005512605,0.00008200058,0.0012343135,0.000028657836,0.00003342783,0.0008516555,0.969222,0.012327396,0.000028636934,0.00015389854,0.015938276],"study_design_scores_gemma":[0.0006150803,0.00017102073,0.00014541743,0.0018622031,0.000028699691,0.000040211828,0.00017988101,0.98719275,0.009315455,0.00007113162,0.000023377821,0.0003547413],"about_ca_topic_score_codex":0.00021626467,"about_ca_topic_score_gemma":0.000004411391,"teacher_disagreement_score":0.95476294,"about_ca_system_score_codex":0.00006112062,"about_ca_system_score_gemma":0.000042939817,"threshold_uncertainty_score":0.9999494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9718703,0.00040665764,0.007341778,0.00033857962,0.0004914198,0.0008393665,0.00001666289,0.00035829522,0.018336924],"genre_scores_gemma":[0.98137975,0.00009118456,0.018263154,0.000040862764,0.000059439404,0.00003050783,0.000004136382,0.00004242137,0.000088522145],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99805653,0.00011215751,0.0006427831,0.00026312756,0.0005812727,0.0003441311],"domain_scores_gemma":[0.99853104,0.00011704663,0.0002434105,0.0008454776,0.00021377228,0.000049225524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009300462,0.0002922993,0.00040335822,0.00016284078,0.00007415483,0.000043547567,0.00048977224,0.0001998328,0.00011899057],"category_scores_gemma":[0.000092074624,0.0001926284,0.00016094142,0.00045069001,0.00014123005,0.00013851468,0.00008027245,0.00041332503,0.00000653609],"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.000034901423,0.000069582115,0.00029823053,0.00005904767,0.000061139064,0.0000010446594,0.0006979302,0.00056909176,0.9862166,0.00095394824,0.008828043,0.0022104068],"study_design_scores_gemma":[0.00050784263,0.000049265396,0.00043413503,0.00035626316,0.00007444215,0.000039145503,0.00034450463,0.015700527,0.96805525,0.0022566519,0.011821329,0.00036063313],"about_ca_topic_score_codex":0.00014901691,"about_ca_topic_score_gemma":0.00069012237,"teacher_disagreement_score":0.018248402,"about_ca_system_score_codex":0.000059301732,"about_ca_system_score_gemma":0.00003724559,"threshold_uncertainty_score":0.7855158},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03895927,0.00008006105,0.95804393,0.000010799396,0.000229264,0.00039574387,0.0000027361364,0.0010576099,0.0012206149],"genre_scores_gemma":[0.8341151,0.0000029446035,0.16565587,0.0000064800356,0.00006951536,0.00003873844,0.000003585593,0.00009774104,0.000010045802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998398,0.0000330342,0.0005166119,0.00029751408,0.00025061797,0.00050422637],"domain_scores_gemma":[0.9993074,0.000119073615,0.000057200283,0.00033703257,0.000056716042,0.00012256541],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032562038,0.000361979,0.00044686478,0.00026262386,0.000056135406,0.00007287359,0.00020523953,0.00016790713,0.000042789157],"category_scores_gemma":[0.00011858638,0.0003733329,0.00008547027,0.00032585458,0.00004505882,0.00009909672,0.00009193817,0.00033803593,0.000023726932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029739422,0.0000518154,0.000009563057,0.00021344052,0.000024901325,0.000008458831,0.00015400205,0.9890646,0.0069328416,0.0031685797,0.0000274721,0.00034138357],"study_design_scores_gemma":[0.0003083716,0.000030516854,0.000006801322,0.0008636381,0.000030087509,0.000030030455,0.000016002996,0.99150807,0.0055324174,0.0012410518,0.00003309742,0.00039992432],"about_ca_topic_score_codex":0.000010722955,"about_ca_topic_score_gemma":0.000001332532,"teacher_disagreement_score":0.7951558,"about_ca_system_score_codex":0.00019231068,"about_ca_system_score_gemma":0.00001213717,"threshold_uncertainty_score":0.99987185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023440104,0.0002675935,0.972206,0.0006466667,0.00027408567,0.0011566598,0.0000783101,0.0012714388,0.0006591312],"genre_scores_gemma":[0.9911531,0.00073816534,0.007207882,0.00024600248,0.000041088464,0.00040535108,0.000021087364,0.000103279126,0.000084041254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986569,0.00010483793,0.00041209382,0.0002639032,0.00017882885,0.00038341605],"domain_scores_gemma":[0.99760216,0.0005557785,0.00007555635,0.0014060461,0.00021142038,0.00014906337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008452738,0.0003222064,0.00036731656,0.00021747398,0.000598887,0.00010370428,0.00059981813,0.00019863113,0.000051721883],"category_scores_gemma":[0.000001919366,0.00033604648,0.00022682786,0.00022063036,0.00015997337,0.00029257697,0.000003827983,0.00047211774,0.000038830767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010008826,0.00058338774,0.0000049867454,0.00012741005,0.0005779241,0.0000029364774,0.0014321271,0.1704114,0.37683937,0.0008237661,0.007966512,0.4411301],"study_design_scores_gemma":[0.0008764355,0.000054737702,0.00004724869,0.00028962258,0.00008135265,0.000008547109,0.000083887215,0.89751196,0.097639635,0.00086820504,0.0021602781,0.00037806015],"about_ca_topic_score_codex":0.00019343875,"about_ca_topic_score_gemma":0.000053044918,"teacher_disagreement_score":0.967713,"about_ca_system_score_codex":0.000094017065,"about_ca_system_score_gemma":0.000024900392,"threshold_uncertainty_score":0.99990916},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4656985,0.00038598556,0.4369729,0.000015856367,0.00033110747,0.00009358441,0.0000035115186,0.002016095,0.094482444],"genre_scores_gemma":[0.6827179,0.0000023720165,0.31713292,0.000037445643,0.00006773018,9.922828e-7,0.0000022606134,0.000018878585,0.00001945113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951905,0.000014285748,0.00011365473,0.000095172356,0.00010441341,0.00015341747],"domain_scores_gemma":[0.99969447,0.000029568115,0.000019726516,0.00013182979,0.00005868315,0.00006573947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089303736,0.000104451625,0.00010720742,0.00007142113,0.000031168496,0.00004606571,0.000079199446,0.000051568426,0.0000118728],"category_scores_gemma":[0.000018669329,0.00009885712,0.000026318643,0.00012472895,0.000013240665,0.00012281007,0.000033784352,0.00008713766,0.00002633787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030473484,0.00008370354,0.0020783488,0.0000681894,0.00030817112,0.000207543,0.0053363414,0.75949275,0.12782528,0.008384076,0.04078787,0.05539725],"study_design_scores_gemma":[0.00009268859,0.0000173166,0.000058502814,0.00006137145,0.000017443603,0.000033378517,0.00014706406,0.93926656,0.05709088,0.002874396,0.00016067909,0.00017973936],"about_ca_topic_score_codex":0.00012325257,"about_ca_topic_score_gemma":0.0000049417627,"teacher_disagreement_score":0.21701941,"about_ca_system_score_codex":0.0000516009,"about_ca_system_score_gemma":0.000010764905,"threshold_uncertainty_score":0.4031276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014302991,0.0000382585,0.98335665,0.00042182274,0.00008330126,0.00019490691,0.0000013646185,0.000098126664,0.0015025606],"genre_scores_gemma":[0.040136896,0.0000056541567,0.9595718,0.00015972699,0.00007613866,0.000023608995,0.0000057945003,0.0000103124385,0.000010098576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993086,0.000096047756,0.00023472197,0.00014620317,0.000117186464,0.000097271564],"domain_scores_gemma":[0.99898344,0.00080474577,0.000028337443,0.00006534976,0.000058979458,0.000059138856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030186947,0.000116582305,0.00021656907,0.00011895072,0.000033575925,0.000023720304,0.000026769387,0.00005544599,0.00010767361],"category_scores_gemma":[0.00013149074,0.00009122834,0.000013360938,0.00009125863,0.00012482032,0.00008923475,0.000014346442,0.00013604673,0.000004153061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008623851,0.00004719905,0.000013952256,0.000109267705,0.000022217766,0.000006499195,0.00059039565,0.0058242963,0.0052173077,0.014000835,0.00031960625,0.9738398],"study_design_scores_gemma":[0.00026261405,0.000065525135,0.0018401983,0.00021448116,0.000007697227,0.00004429243,0.000037941314,0.76091236,0.00036826718,0.23616844,0.0000060682446,0.000072083334],"about_ca_topic_score_codex":0.00000615224,"about_ca_topic_score_gemma":9.126622e-8,"teacher_disagreement_score":0.9737677,"about_ca_system_score_codex":0.000020745,"about_ca_system_score_gemma":0.000005276606,"threshold_uncertainty_score":0.3720184},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009007034,0.0004132316,0.995368,0.00034892495,0.00022946541,0.0013325249,0.000016882683,0.0006405663,0.0007497197],"genre_scores_gemma":[0.11046348,0.0002878457,0.888061,0.00064386113,0.0001643169,0.00014159593,0.000020158212,0.00008503646,0.00013275055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998543,0.00012111182,0.00042695153,0.0002787761,0.00017146447,0.00045864566],"domain_scores_gemma":[0.9988459,0.00027883786,0.00011175917,0.00051811454,0.00015126118,0.00009416968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006415726,0.00028023092,0.00037624096,0.000096877884,0.00011626684,0.00003892681,0.00037706492,0.0001570396,0.000025438409],"category_scores_gemma":[0.00007993567,0.00020907474,0.00018322909,0.00030801666,0.000087248874,0.00014957784,0.00004224274,0.0002558024,0.000012632759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009093771,0.00017644679,0.000041743137,0.00016521345,0.0002357588,0.0000045692354,0.0030984252,0.7049211,0.23997696,0.00045163944,0.022079624,0.028757572],"study_design_scores_gemma":[0.00051395554,0.00017676759,0.000016965681,0.00010844603,0.00007008993,0.0000061737305,0.00009174671,0.8842075,0.07675145,0.003864185,0.033926703,0.00026602088],"about_ca_topic_score_codex":0.000035251982,"about_ca_topic_score_gemma":0.00000926334,"teacher_disagreement_score":0.17928638,"about_ca_system_score_codex":0.00004480614,"about_ca_system_score_gemma":0.000030328772,"threshold_uncertainty_score":0.8525821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017325977,0.002162306,0.9787991,0.00006203754,0.00019989596,0.0003571702,0.000015975253,0.00056639354,0.00051111926],"genre_scores_gemma":[0.5327487,0.00009108393,0.4663389,0.0000970359,0.000049518367,0.000089406676,0.0000030051312,0.0000444657,0.0005378656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991979,0.000028597771,0.0001944251,0.00025250542,0.00006083339,0.00026574873],"domain_scores_gemma":[0.999531,0.00010488886,0.00004034498,0.00014965741,0.000079631805,0.00009451139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014323204,0.0002066496,0.0002281594,0.00013822221,0.00026189713,0.00019812165,0.00006061883,0.00010752627,0.00014463594],"category_scores_gemma":[0.000008211967,0.00020534734,0.000040808798,0.00016750705,0.00005413014,0.0003122527,0.0000024127683,0.0002212372,0.000004672832],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020305806,0.000021107928,0.0000016931456,0.00022911098,0.000056965262,0.000004603649,0.0008697197,0.010555731,0.11530598,0.0000029276378,0.00027568731,0.87265617],"study_design_scores_gemma":[0.00056754204,0.00006612954,0.000018234285,0.00023302376,0.00008035434,0.00014305965,0.0010393478,0.7047109,0.29113907,0.00011327445,0.0014761593,0.0004128973],"about_ca_topic_score_codex":0.000035699937,"about_ca_topic_score_gemma":0.00004356846,"teacher_disagreement_score":0.8722433,"about_ca_system_score_codex":0.00002605113,"about_ca_system_score_gemma":0.000015952932,"threshold_uncertainty_score":0.8373822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017795246,0.0007442348,0.98879373,0.000005441797,0.00003459948,0.00035777036,0.000005708291,0.00012596569,0.008153049],"genre_scores_gemma":[0.79187924,0.021436255,0.18353166,0.000043038766,0.00006396026,0.000029368874,0.0003412597,0.00027939733,0.0023958173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939907,0.0000069936223,0.0003015229,0.000112480644,0.00009588617,0.000084043975],"domain_scores_gemma":[0.99957097,0.00007365154,0.00014559814,0.00012132353,0.000059227244,0.000029258803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058310277,0.0001663545,0.00025091931,0.00017384204,0.000021021604,0.000024968378,0.000029972187,0.0001662858,0.0000036644958],"category_scores_gemma":[0.00001244644,0.00017642957,0.000021501466,0.000031358293,0.000046797042,0.00012330395,0.00001986344,0.00006453498,3.8207753e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014279648,0.00006734205,0.000009621824,0.0014097849,0.00009840721,0.000012012533,0.0043661334,0.6237775,0.0015964219,0.3619682,0.00033595975,0.006344346],"study_design_scores_gemma":[0.00012009065,0.0000236219,5.13446e-7,0.0005202216,0.000055056647,0.000011590899,0.000049737766,0.96333516,0.0013789419,0.034289595,0.000047065158,0.00016842393],"about_ca_topic_score_codex":0.000004315514,"about_ca_topic_score_gemma":0.000002285865,"teacher_disagreement_score":0.805262,"about_ca_system_score_codex":0.000025841959,"about_ca_system_score_gemma":0.000004043269,"threshold_uncertainty_score":0.7194589},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12419353,0.000028583301,0.8555666,0.00008933384,0.0006437411,0.00040438172,0.000009297932,0.0029989982,0.016065529],"genre_scores_gemma":[0.83272684,4.1360906e-7,0.16688946,0.0002016855,0.0001049632,0.0000059085187,0.000003108288,0.000032490152,0.00003514445],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947053,0.000006200486,0.00011745153,0.000135816,0.00007256937,0.00019743253],"domain_scores_gemma":[0.99947286,0.00012890824,0.000017226674,0.00025092147,0.00007860016,0.000051466744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052216987,0.00013021918,0.00013639494,0.00006171954,0.000056067263,0.000031791566,0.000087938126,0.000069539965,0.000019289948],"category_scores_gemma":[0.000018527624,0.00012462659,0.00006560976,0.00006127436,0.000031660897,0.00004299849,0.000012646557,0.00015643201,0.000009117011],"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.000033685887,0.000029291488,0.000022375965,0.000016576827,0.000047243713,0.000009745378,0.000039070786,0.015555062,0.9466754,0.0026277974,0.02566633,0.009277385],"study_design_scores_gemma":[0.00018973812,0.000016775975,0.0000152216135,0.000012458003,0.000007794119,0.0000034039044,0.0000057518714,0.5057502,0.47915152,0.0004560647,0.014277657,0.000113428454],"about_ca_topic_score_codex":0.000023756358,"about_ca_topic_score_gemma":0.000037679805,"teacher_disagreement_score":0.7085333,"about_ca_system_score_codex":0.00000953719,"about_ca_system_score_gemma":0.000011297346,"threshold_uncertainty_score":0.50821245},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022616272,0.000016282382,0.9869609,0.0001203025,0.00021461913,0.0004077146,0.0000029070457,0.0009900333,0.0090256445],"genre_scores_gemma":[0.45938548,0.0000017033727,0.539724,0.00028557776,0.00019425708,0.000013342689,0.000013687106,0.00003569337,0.00034625575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994475,0.000008297107,0.00012707793,0.0001371383,0.00009781527,0.00018215085],"domain_scores_gemma":[0.99953705,0.000095755306,0.000023690809,0.0002003508,0.000077968165,0.00006516881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025824676,0.0001351326,0.0001296167,0.00007588699,0.000045713354,0.000070381626,0.000054131324,0.000070341404,0.000119782584],"category_scores_gemma":[0.000009819199,0.00012531443,0.000056481298,0.000070081725,0.0000062582158,0.000099419194,0.000010547332,0.000070928974,0.00004818401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063788043,0.00001862543,0.0000036574295,0.00001081049,0.000039396204,0.0000030030594,0.00011451321,0.04452988,0.041538958,0.00033680256,0.086314775,0.8270832],"study_design_scores_gemma":[0.00027809516,0.000046987796,0.00031399797,0.000052080202,0.0000087318385,0.0000025083662,0.000009160009,0.9375041,0.059539616,0.0012499782,0.00083790714,0.0001568392],"about_ca_topic_score_codex":0.00026480487,"about_ca_topic_score_gemma":0.0000040786967,"teacher_disagreement_score":0.8929742,"about_ca_system_score_codex":0.000039128987,"about_ca_system_score_gemma":0.000013191283,"threshold_uncertainty_score":0.51101744},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003476211,0.00026800908,0.9873098,0.000054579403,0.0002925082,0.00018861308,0.0000045937286,0.0010277078,0.007377961],"genre_scores_gemma":[0.39414287,0.000007759291,0.60509217,0.00016261153,0.00016870695,0.000035398498,0.0000043851524,0.000033502747,0.00035261968],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995226,0.000015287993,0.00010216422,0.00007398761,0.00005345757,0.00023246523],"domain_scores_gemma":[0.9995921,0.00014145169,0.000012003141,0.00018047797,0.000022901217,0.000051058847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016257487,0.00009646942,0.00012350247,0.000057447116,0.00002344616,0.000017037959,0.00006821943,0.000063945845,0.000079491096],"category_scores_gemma":[0.000019655743,0.000084970896,0.00008389291,0.000060127582,0.00000467584,0.00009954528,0.000009900014,0.00005015078,0.000020990157],"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.00019435327,0.00018490113,0.0004890226,0.00029622277,0.00027204218,0.000005243516,0.00019401248,0.033612087,0.2544302,0.009556484,0.4763476,0.22441784],"study_design_scores_gemma":[0.00034648096,0.000033550124,0.00009550398,0.00003705779,0.000027782837,0.0000044505414,0.000009983072,0.34843296,0.597189,0.0015472713,0.052028008,0.00024797232],"about_ca_topic_score_codex":0.000012537344,"about_ca_topic_score_gemma":0.0000020019106,"teacher_disagreement_score":0.4243196,"about_ca_system_score_codex":0.000021811182,"about_ca_system_score_gemma":0.0000051662732,"threshold_uncertainty_score":0.34650123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6138454,0.0038641226,0.3743324,0.0012153239,0.003297191,0.0004646865,0.00000965422,0.0005933097,0.0023778924],"genre_scores_gemma":[0.9202611,0.000043360535,0.079205126,0.00021652045,0.0002297895,0.000007558955,0.000025743822,0.0000082493925,0.0000025404495],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999562,0.000015084456,0.00012797388,0.00013472165,0.000025703646,0.00013447189],"domain_scores_gemma":[0.99971193,0.000087496184,0.000019793706,0.000082227096,0.000038904545,0.000059642134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014974238,0.00009390447,0.00018251021,0.00017613091,0.000025395002,0.0000026602122,0.000051451094,0.00008781701,0.000004094637],"category_scores_gemma":[0.000020395077,0.00007941609,0.000030111183,0.000092499766,0.00027076842,0.000031540898,0.000019626761,0.000082605206,6.289598e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062858965,0.00017780416,0.08122998,0.00015891755,0.00072064163,0.00011485164,0.0013305057,0.0013342351,0.06945258,0.031237893,0.16428828,0.6493257],"study_design_scores_gemma":[0.010650222,0.002552245,0.022047153,0.0012109425,0.00016364307,0.0009643111,0.00022470478,0.36609325,0.0067683654,0.576172,0.01204438,0.0011088125],"about_ca_topic_score_codex":0.00001787276,"about_ca_topic_score_gemma":0.000016201433,"teacher_disagreement_score":0.6482169,"about_ca_system_score_codex":0.000012263519,"about_ca_system_score_gemma":0.000007069206,"threshold_uncertainty_score":0.32384938},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045859814,0.00010041886,0.9897424,0.00014211144,0.000109542474,0.0022880533,0.0000022389165,0.001919513,0.0011097338],"genre_scores_gemma":[0.040080953,0.0000028288105,0.9586083,0.00003941014,0.00012014019,0.0008909689,0.000046606678,0.00008659116,0.0001241615],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983745,0.000085146145,0.0005551054,0.00030656302,0.00015819892,0.0005204896],"domain_scores_gemma":[0.9987528,0.00043361398,0.00009017176,0.00034164582,0.00024273791,0.00013904633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035871603,0.000312515,0.000449272,0.00012485714,0.00013713026,0.00030508402,0.00019014378,0.00018854835,0.00008725184],"category_scores_gemma":[0.00037663194,0.0002722586,0.00016508004,0.0002979919,0.0001149347,0.00024569724,0.000047102734,0.00019389232,0.000029109031],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143234465,0.00014504752,0.0000065349773,0.00032734495,0.00015007144,0.0000036076972,0.0008291211,0.00012536306,0.019531928,0.006782938,0.00071066857,0.971373],"study_design_scores_gemma":[0.00062691164,0.0001374866,0.0000039780634,0.00031765454,0.00008638727,0.00002425715,0.00025811652,0.8787151,0.055083428,0.046286844,0.017952124,0.0005077099],"about_ca_topic_score_codex":0.0000036125764,"about_ca_topic_score_gemma":6.452853e-7,"teacher_disagreement_score":0.97086537,"about_ca_system_score_codex":0.000053830907,"about_ca_system_score_gemma":0.000016305508,"threshold_uncertainty_score":0.99997294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8190362,0.0034406823,0.17605753,0.000020233469,0.00011785221,0.000048193724,0.0000055581872,0.00016579169,0.0011079381],"genre_scores_gemma":[0.9981826,0.00061458687,0.00096257555,0.000024258004,0.00006665223,0.0000035426604,0.000026789203,0.000011637781,0.00010736761],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99888784,0.00001588569,0.0003243944,0.00031610232,0.00020840128,0.00024738943],"domain_scores_gemma":[0.9995089,0.00014278955,0.000034435816,0.00014476835,0.000057819445,0.00011128409],"candidate_categories":["bibliometrics"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.00043574983,0.0001689199,0.00037318518,0.014412084,0.00007334073,0.00008071047,0.000042123567,0.000114064314,0.00011110589],"category_scores_gemma":[0.00004446245,0.00015587466,0.00016227979,0.030883586,0.000051445946,0.00013746033,0.000029974744,0.00017495659,0.000007909736],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018251943,0.000030412042,0.8466241,0.000019348568,0.005429705,0.00002707343,0.000040816227,0.042051546,0.00018305657,0.0002931225,0.0001953911,0.10508722],"study_design_scores_gemma":[0.00012902111,0.00002257072,0.9202912,0.000007064339,0.0026485173,0.0000211733,0.00009638641,0.075756125,0.0003172973,0.00025149752,0.00023524386,0.00022394759],"about_ca_topic_score_codex":0.00021103265,"about_ca_topic_score_gemma":0.0002408002,"teacher_disagreement_score":0.17914638,"about_ca_system_score_codex":0.00007602634,"about_ca_system_score_gemma":0.0000065325216,"threshold_uncertainty_score":0.9967587},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011297046,0.000045330602,0.98597926,0.000014902945,0.00007783135,0.00019532598,0.0000037148586,0.00094099366,0.0014455881],"genre_scores_gemma":[0.89798087,0.000003342951,0.10178768,0.00004148778,0.000053971977,0.00004739883,0.0000037792004,0.00005629109,0.000025196827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990005,0.0000328932,0.00021394053,0.00028183212,0.00020245941,0.0002683665],"domain_scores_gemma":[0.999551,0.000039150153,0.000059983988,0.0001915784,0.00008777824,0.0000705211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093714174,0.00023965408,0.00024789083,0.00013531238,0.00029173243,0.00013720027,0.00013244964,0.00008354017,0.000020950762],"category_scores_gemma":[0.0000015873846,0.00022843375,0.000046387504,0.00026757026,0.00012207459,0.00026908572,0.0000010406404,0.00028543148,0.0000032486682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058762445,0.00004507001,2.0610518e-7,0.00006183717,0.000020152642,0.0000011627001,0.00022005738,0.966087,0.011530812,0.000012998134,0.00001443442,0.021947538],"study_design_scores_gemma":[0.00033602375,0.0000906702,0.0000039827646,0.0003155768,0.000037519247,0.000036513153,0.000051168514,0.93168604,0.06704681,0.00009798323,0.000019251827,0.00027847424],"about_ca_topic_score_codex":0.000008477435,"about_ca_topic_score_gemma":0.0000022768438,"teacher_disagreement_score":0.8866838,"about_ca_system_score_codex":0.00006574209,"about_ca_system_score_gemma":0.000026784526,"threshold_uncertainty_score":0.9315258},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181351,0.00018415863,0.0796161,0.0000120335535,0.00006960698,0.0003514956,0.000017849849,0.00021697381,0.0013966736],"genre_scores_gemma":[0.9712026,0.00003943216,0.028673152,0.000005563044,0.000023506842,0.000017864832,0.000012048098,0.000017860304,0.000007986739],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938226,0.000018993549,0.0001839758,0.00015443536,0.00014064183,0.0001197093],"domain_scores_gemma":[0.9995319,0.00006865919,0.00009232464,0.00014760993,0.00012101832,0.000038454324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000061773884,0.00012590483,0.00019442447,0.00013541162,0.00005376648,0.000046597437,0.00007636865,0.00008987474,0.000009026953],"category_scores_gemma":[0.000035385583,0.00009150471,0.000017806582,0.0002400122,0.0001434569,0.00021401708,0.000023165843,0.0001931582,5.4118544e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016595115,0.000038859514,0.012357848,0.00009591116,0.00011958403,0.0000017949458,0.00045763954,0.00013100996,0.9301461,0.0015824764,0.00026983966,0.054633003],"study_design_scores_gemma":[0.0033976033,0.00021893498,0.028082054,0.00025034032,0.0001283312,0.00014808465,0.0008652148,0.053438373,0.90896904,0.0032165074,0.0006180646,0.0006674606],"about_ca_topic_score_codex":0.00006616771,"about_ca_topic_score_gemma":0.000012436092,"teacher_disagreement_score":0.053965542,"about_ca_system_score_codex":0.000014375344,"about_ca_system_score_gemma":0.000017406624,"threshold_uncertainty_score":0.3731454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82859945,0.0039867205,0.166673,0.00003759433,0.000065550106,0.00025486265,0.000005756438,0.00028290987,0.000094119954],"genre_scores_gemma":[0.9904331,0.000022253975,0.009309513,0.000024038669,0.000085092026,0.000018747978,0.000024780953,0.000027161948,0.000055322827],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990851,0.000049962193,0.00027109854,0.00022775037,0.00018589407,0.0001801377],"domain_scores_gemma":[0.9995871,0.000033969525,0.00006843103,0.000073944044,0.00015647415,0.00008005012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013249996,0.00017184112,0.00019735501,0.000056869503,0.00022636792,0.00025309017,0.000029049701,0.00009762981,0.000009944393],"category_scores_gemma":[0.000010174567,0.00015587932,0.000019556675,0.00007428784,0.00004329641,0.00045359766,0.000031992808,0.000096378346,0.0000028426068],"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.0000069552716,0.000012222008,0.00015341598,0.000106197636,0.000016497666,0.0000020872515,0.00019079137,0.0031794573,0.9874136,0.00012278295,0.0009220163,0.00787397],"study_design_scores_gemma":[0.0002878556,0.000018937642,0.0037714546,0.0002574864,0.000015994889,0.000050816314,0.00007350021,0.98284227,0.01199267,0.00032282408,0.00013109355,0.00023512474],"about_ca_topic_score_codex":0.00043724815,"about_ca_topic_score_gemma":0.0000011011824,"teacher_disagreement_score":0.9796628,"about_ca_system_score_codex":0.000030194069,"about_ca_system_score_gemma":0.000011068864,"threshold_uncertainty_score":0.6356574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28948513,0.00005745833,0.70863223,0.000022155918,0.000102687176,0.00014556969,3.0145134e-7,0.00067334686,0.00088114955],"genre_scores_gemma":[0.9582487,0.0000025856511,0.041463,0.00019158082,0.00004606628,0.000005217596,0.000012521569,0.000027969389,0.0000023981372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990911,0.00007332651,0.00025502074,0.00020223329,0.00012614182,0.00025221854],"domain_scores_gemma":[0.99937886,0.00012932313,0.000034332465,0.00034931238,0.000053886484,0.00005428139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017321615,0.00017724826,0.00023156691,0.000089870526,0.000044744636,0.000040174546,0.0000905276,0.00014734753,0.000015269588],"category_scores_gemma":[0.000021305877,0.00017385127,0.000054639317,0.00015053783,0.00003661313,0.00008247205,0.000022499375,0.0002531573,0.0000082701945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064821543,0.000017257044,0.00020844811,0.000010187371,0.0000072670846,0.000009058628,0.000024963818,0.97385013,0.0026044135,0.000063151696,0.0001641482,0.023034478],"study_design_scores_gemma":[0.00022852601,0.000019584435,0.0015720469,0.0001119691,0.000008602142,0.0000054590023,0.0000043344726,0.9716121,0.025009584,0.0010762975,0.00014951096,0.0002019693],"about_ca_topic_score_codex":0.00017143409,"about_ca_topic_score_gemma":0.000057012938,"teacher_disagreement_score":0.6687635,"about_ca_system_score_codex":0.00006064484,"about_ca_system_score_gemma":0.0000063779125,"threshold_uncertainty_score":0.7089449},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038168665,0.000013060979,0.8866229,0.000041060386,0.00033408482,0.00011239921,8.6292545e-7,0.0022064082,0.07250054],"genre_scores_gemma":[0.9094258,0.000007681584,0.09031017,0.00013408407,0.00007317435,0.0000021124365,0.0000111614545,0.000020911215,0.000014892217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992304,0.000033580847,0.00028972863,0.00010300373,0.00012463018,0.00021868093],"domain_scores_gemma":[0.9994975,0.000057394995,0.000057528763,0.00026346662,0.000069623566,0.0000544919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011773658,0.00016163016,0.0001846846,0.00012901038,0.00010644303,0.00013148124,0.00007918419,0.00008760069,0.000023894092],"category_scores_gemma":[0.000023721215,0.00015857187,0.000048170827,0.000120487835,0.00003690856,0.0005999043,0.000028448141,0.00014174618,0.00003771503],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010665897,0.000007772869,0.000100825295,0.000072413335,0.00006168373,0.0000026455136,0.00026499716,0.02811764,0.16097644,0.0016455638,0.00327924,0.8054601],"study_design_scores_gemma":[0.00015201198,0.000007532484,0.00012787581,0.00006733535,0.000010094328,0.000051710493,0.000039788567,0.7710329,0.22319542,0.0025012018,0.002622946,0.00019115981],"about_ca_topic_score_codex":0.000045192322,"about_ca_topic_score_gemma":0.00000730079,"teacher_disagreement_score":0.8712571,"about_ca_system_score_codex":0.000036329202,"about_ca_system_score_gemma":0.000005027348,"threshold_uncertainty_score":0.6466373},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06860989,0.000060057133,0.9136419,0.00005022048,0.00018130436,0.00018844633,6.789277e-7,0.0016116829,0.015655795],"genre_scores_gemma":[0.9810923,0.00004199673,0.018429901,0.00014468907,0.00009233995,0.000019734907,0.0000037049545,0.000037140602,0.00013822502],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992865,0.000017927048,0.0001857794,0.0001506617,0.00008319413,0.00027598414],"domain_scores_gemma":[0.99953586,0.000083495135,0.000018267425,0.00023238796,0.000059344926,0.00007064516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008545789,0.0001606582,0.00018730716,0.000073806106,0.000057038294,0.00010711378,0.00012294103,0.000070618415,0.0004093062],"category_scores_gemma":[0.000011813225,0.0001392895,0.00006363802,0.00010079984,0.000041207488,0.00021562808,0.000040516807,0.00014445081,0.0004554864],"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.000011620108,0.000018067383,0.000023983062,0.000031412903,0.000053086256,0.00001503575,0.00007974187,0.014426543,0.9275952,0.00034726295,0.018480526,0.038917545],"study_design_scores_gemma":[0.00037716582,0.000010892916,0.00012481502,0.000056964927,0.000007682625,0.000008253123,0.00002894524,0.46838862,0.5284918,0.0014723801,0.00081432686,0.00021814885],"about_ca_topic_score_codex":0.00012917901,"about_ca_topic_score_gemma":0.0000064509836,"teacher_disagreement_score":0.9124824,"about_ca_system_score_codex":0.00002939498,"about_ca_system_score_gemma":0.0000041845296,"threshold_uncertainty_score":0.5854508},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79954606,0.00014120463,0.16240521,0.001979296,0.0007143696,0.0001490737,0.000003657538,0.0020728223,0.03298832],"genre_scores_gemma":[0.97319597,0.000012584447,0.025193416,0.0012853388,0.00024077608,0.000004581497,0.0000049613363,0.000042784563,0.000019572839],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993361,0.000017930393,0.00012084341,0.00014465813,0.00011486158,0.00026557088],"domain_scores_gemma":[0.9995854,0.000042708594,0.000022196902,0.0002722349,0.000022736858,0.00005470634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004730852,0.00014758261,0.00014081174,0.000067198554,0.000051994197,0.00006146788,0.00011439484,0.000030269252,0.000010659919],"category_scores_gemma":[0.000011525793,0.00015553876,0.000054345433,0.00006451522,0.000051178657,0.00007880794,0.000030099802,0.00016038957,0.00003617808],"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.000003890895,0.00001197895,0.00020779342,0.000010752945,0.000041888492,0.000054449498,0.00022511042,0.03501983,0.929402,0.0028244804,0.02951798,0.0026798674],"study_design_scores_gemma":[0.00038677055,0.00001695763,0.00063357165,0.000076147175,0.00003862536,0.000064056185,0.00004803295,0.70828044,0.27987525,0.0008213519,0.009219644,0.000539158],"about_ca_topic_score_codex":0.0000068713366,"about_ca_topic_score_gemma":6.971087e-7,"teacher_disagreement_score":0.6732606,"about_ca_system_score_codex":0.000031517153,"about_ca_system_score_gemma":0.0000021648675,"threshold_uncertainty_score":0.63426864},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09457297,0.00040041376,0.9031295,0.000014753097,0.00015617526,0.00019970622,0.000042608244,0.0003274006,0.0011564682],"genre_scores_gemma":[0.86858493,0.00013547055,0.13112828,0.000025515226,0.000040811774,0.0000019737859,0.0000162741,0.000022280392,0.000044460605],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994647,0.000009650052,0.00015139986,0.00014591475,0.00005552178,0.00017280993],"domain_scores_gemma":[0.99962544,0.00016654568,0.00003036865,0.00006603505,0.00006284948,0.00004873475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057608337,0.00011308875,0.00014802742,0.000038614417,0.00015728254,0.00002561802,0.000027218732,0.00004523535,4.909531e-7],"category_scores_gemma":[0.000025781605,0.00011576415,0.000013381029,0.000044590557,0.000058328314,0.00002299877,0.000032353568,0.00008965157,6.9912505e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021305568,0.00006435478,0.0024863966,0.00036245762,0.00044371223,0.00030140142,0.009398344,0.023064997,0.0039145937,0.032330044,0.028187696,0.8994247],"study_design_scores_gemma":[0.00027748488,0.000068695495,0.0048781317,0.000072694434,0.000017883254,0.00015314689,0.000052248655,0.98637474,0.00096249464,0.006124471,0.00082028494,0.00019771283],"about_ca_topic_score_codex":0.000019403451,"about_ca_topic_score_gemma":0.0000036071885,"teacher_disagreement_score":0.96330976,"about_ca_system_score_codex":0.000009451354,"about_ca_system_score_gemma":0.0000064615037,"threshold_uncertainty_score":0.4720725},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.342432,0.00007702914,0.48542616,0.000007227656,0.00025028363,0.00018048855,0.0000010775776,0.0030148663,0.16861087],"genre_scores_gemma":[0.9589124,0.0000118055395,0.04059251,0.00015263882,0.000080249185,0.0000017485579,0.0000016048227,0.00006290447,0.00018416175],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991986,0.00003968321,0.00014442106,0.00017445632,0.00011122241,0.00033158215],"domain_scores_gemma":[0.9994227,0.00005619355,0.000025312489,0.00036935043,0.00005722079,0.00006918757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008512811,0.00020172617,0.00020349628,0.000042599328,0.00006395117,0.00002737281,0.000111305984,0.00007958465,0.00016939123],"category_scores_gemma":[0.0000023143336,0.0001589945,0.000041413972,0.00012748704,0.00006781349,0.000079037956,0.000032633347,0.00016058663,0.00003545079],"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.002196205,0.0007027219,0.005941563,0.00035147506,0.0033680776,0.003417171,0.013692063,0.14387286,0.33450842,0.18993177,0.15966281,0.14235488],"study_design_scores_gemma":[0.0007384808,0.00019711001,0.0024212692,0.00059029786,0.000090345406,0.00017626597,0.00048431233,0.11905949,0.86178064,0.009487727,0.003601773,0.0013723066],"about_ca_topic_score_codex":0.000018789684,"about_ca_topic_score_gemma":0.000011214356,"teacher_disagreement_score":0.61648035,"about_ca_system_score_codex":0.000015016217,"about_ca_system_score_gemma":0.0000066909515,"threshold_uncertainty_score":0.6483608},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.146481,0.00032011216,0.778922,0.000025954125,0.00019549442,0.0005614133,0.000009921492,0.0013365303,0.072147526],"genre_scores_gemma":[0.9784443,0.00000885568,0.02066962,0.00004279155,0.000705038,0.000018337943,0.000021648477,0.00007587967,0.000013563672],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982027,0.0000600117,0.00016021918,0.00020110336,0.00054134766,0.00083461124],"domain_scores_gemma":[0.998892,0.00037567003,0.000022081736,0.000399667,0.00014458843,0.00016601295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000398185,0.00018838346,0.00020444828,0.000119769706,0.00023166482,0.00008704444,0.00021493637,0.00009671655,0.000036057267],"category_scores_gemma":[0.000007983007,0.00019768922,0.000057417255,0.00043858538,0.00012007081,0.00011382386,0.00010950677,0.000667296,0.00013085813],"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.0000299168,0.000094590796,0.00011886275,0.000055568245,0.00007109305,0.0000056592885,0.00043219753,0.32042423,0.60729104,0.009657339,0.0076369727,0.054182522],"study_design_scores_gemma":[0.00023755402,0.000014195764,0.00019622779,0.00007357684,0.000010679613,0.0000023267514,0.000118017495,0.3249641,0.6660497,0.003912023,0.004081374,0.00034021898],"about_ca_topic_score_codex":0.000022068729,"about_ca_topic_score_gemma":8.40662e-7,"teacher_disagreement_score":0.83196324,"about_ca_system_score_codex":0.00009373182,"about_ca_system_score_gemma":0.00002758601,"threshold_uncertainty_score":0.80615324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80998576,0.000028708993,0.18087703,0.000017073484,0.00040622996,0.000064511696,5.955369e-7,0.0007100989,0.007910009],"genre_scores_gemma":[0.96651703,0.0000011002362,0.033280406,0.00003650335,0.0001376881,0.0000010439135,8.8470256e-7,0.000015339006,0.000009980415],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950707,0.000018929186,0.000099955236,0.00013058074,0.000112272886,0.0001311993],"domain_scores_gemma":[0.9996887,0.000022259155,0.000018257024,0.00016710887,0.000064537846,0.000039127615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000084966036,0.000103630686,0.00011664479,0.000060244158,0.00006598295,0.000017211938,0.000057332443,0.00008000455,0.000045222576],"category_scores_gemma":[0.000017287011,0.000097957876,0.000037325142,0.00008053622,0.000033324588,0.00012827785,0.000025992138,0.00012799953,0.000014693961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045728004,0.000051379637,0.019854106,0.000024110022,0.0002671995,0.000009150351,0.00014740962,0.07441301,0.57510394,0.006694664,0.00700855,0.31638074],"study_design_scores_gemma":[0.00023950875,0.00003315459,0.007017957,0.00012178603,0.000037458758,0.00011934874,0.00001930595,0.758783,0.21300052,0.019245857,0.0009722572,0.00040984116],"about_ca_topic_score_codex":0.00009539042,"about_ca_topic_score_gemma":0.000067443856,"teacher_disagreement_score":0.68437,"about_ca_system_score_codex":0.000045481658,"about_ca_system_score_gemma":0.0000068748313,"threshold_uncertainty_score":0.39946064},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06923656,0.00034920612,0.92527956,0.000090527064,0.00001901178,0.000088443536,0.000012177432,0.00026607874,0.004658467],"genre_scores_gemma":[0.95916843,0.00019125665,0.040060002,0.00034090632,0.000022439066,0.000007298817,0.00017579617,0.000010081535,0.000023773842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924725,0.000009457296,0.00021208836,0.00022954424,0.00015203358,0.00014960223],"domain_scores_gemma":[0.99967945,0.00003608598,0.000049485472,0.00013083882,0.000045231343,0.00005891243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000683315,0.00014959986,0.00024832616,0.00013581372,0.00008182339,0.000057222773,0.00008378148,0.00006291529,0.000032000502],"category_scores_gemma":[0.00000182119,0.00016103784,0.00007784745,0.0004976408,0.000029921786,0.00009012994,0.000013432814,0.00009405526,0.0000054526076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010623066,0.000020630705,0.000043874923,0.0000024435806,0.00023543088,0.0000012807903,0.000027575587,0.9886784,0.0005170861,0.0009195517,0.0017026797,0.0078404015],"study_design_scores_gemma":[0.00017361222,0.000016691441,0.002734498,0.000005597391,0.00020751501,0.0000013233035,0.000016083279,0.990061,0.0010636694,0.0053598676,0.000161532,0.00019861599],"about_ca_topic_score_codex":0.000006828077,"about_ca_topic_score_gemma":6.952276e-7,"teacher_disagreement_score":0.88993186,"about_ca_system_score_codex":0.000034851517,"about_ca_system_score_gemma":0.000010815614,"threshold_uncertainty_score":0.6566933},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174404,0.0018800767,0.07895079,0.0002084516,0.00018421008,0.00019144441,0.0000010402828,0.000029502526,0.0011140592],"genre_scores_gemma":[0.9796987,0.0003537655,0.01986931,0.000017382512,0.000031112646,0.0000017226124,5.4133448e-8,0.000012646931,0.000015278345],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935925,0.000020406402,0.00035392272,0.000031594023,0.00014637488,0.00008843403],"domain_scores_gemma":[0.9994541,0.00010249998,0.00016661448,0.00013211067,0.00011225387,0.00003246293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020553972,0.000081356484,0.00022452314,0.000057994384,0.0000202747,0.0000285766,0.00010944312,0.000024672752,0.000014425151],"category_scores_gemma":[0.000040968567,0.00004583125,0.00008011177,0.000046024183,0.00007071002,0.000045811867,0.000028371825,0.0001063974,0.0000032953687],"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.0002822748,0.0022950843,0.00097023154,0.0038380565,0.0029846595,0.00016266233,0.038511094,0.1514142,0.41682398,0.017417703,0.1341264,0.23117366],"study_design_scores_gemma":[0.0045943907,0.0007236255,0.002419464,0.0047885687,0.0006141025,0.0025174473,0.0054223854,0.49528322,0.41257244,0.06869246,0.0015220569,0.0008498375],"about_ca_topic_score_codex":0.0000012342191,"about_ca_topic_score_gemma":1.14414895e-7,"teacher_disagreement_score":0.34386903,"about_ca_system_score_codex":0.000012866089,"about_ca_system_score_gemma":0.000004704178,"threshold_uncertainty_score":0.18689442},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016584245,0.0001243299,0.980373,0.00013021594,0.00046288842,0.00060835946,0.0003291735,0.0012218645,0.00016587987],"genre_scores_gemma":[0.92492855,0.0001698742,0.074143596,0.00008378392,0.000086132095,0.00019205586,0.00028058942,0.000099755845,0.000015681855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861276,0.00014685423,0.0003367411,0.00027385226,0.00020172315,0.0004280523],"domain_scores_gemma":[0.99577194,0.00042531267,0.00006930459,0.0034788342,0.00009792977,0.0001566468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030661863,0.00028002326,0.0002689752,0.00019507762,0.0005796457,0.00007270234,0.0010740819,0.00015345942,0.000014655711],"category_scores_gemma":[0.0000025304284,0.000308523,0.000101021535,0.00027573237,0.00010389087,0.00020888953,0.000011744072,0.00046081745,0.000015192836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023411443,0.00060496543,0.000005818919,0.000014021129,0.000048926933,3.14847e-7,0.00013097373,0.93072206,0.002404088,0.00022313373,0.00019769697,0.06562457],"study_design_scores_gemma":[0.00035652795,0.00006984128,0.000063870495,0.00012217963,0.0000704645,0.000004792734,0.00008503689,0.9895536,0.007191233,0.000007885318,0.0021462217,0.00032840026],"about_ca_topic_score_codex":0.000049898743,"about_ca_topic_score_gemma":0.000046428904,"teacher_disagreement_score":0.90834427,"about_ca_system_score_codex":0.00012790212,"about_ca_system_score_gemma":0.00001874595,"threshold_uncertainty_score":0.9999367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1531236,0.00013092787,0.84244794,0.000020056206,0.0000077157865,0.00004482958,0.000008670292,0.00013251262,0.0040837354],"genre_scores_gemma":[0.976991,0.000012674373,0.022776118,0.000052852607,0.000014185565,0.000009593012,0.00012133128,0.000010222227,0.000012035669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.000020902695,0.00022974935,0.00019387408,0.0001700359,0.00012267909],"domain_scores_gemma":[0.99953353,0.00014822897,0.00006346908,0.00016954832,0.000040521278,0.000044715685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014135776,0.0001231359,0.00037604093,0.0005014398,0.000047153106,0.00002524653,0.000085647815,0.000048380916,0.00003719769],"category_scores_gemma":[0.0000033411231,0.00012252228,0.00019804493,0.0013400605,0.000043984757,0.000033333923,0.000019281062,0.00006342366,0.0000022803931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007233219,0.00001834198,0.00090979104,0.000009812145,0.0026977605,1.8358271e-7,0.000022273944,0.9849418,0.00022893264,0.0050142533,0.000072957104,0.006076709],"study_design_scores_gemma":[0.00011798824,0.000010235674,0.012356231,0.0000027372676,0.0024811865,1.4452263e-7,0.000021815373,0.97598696,0.002018683,0.0067752376,0.00009613348,0.00013264336],"about_ca_topic_score_codex":0.000022745106,"about_ca_topic_score_gemma":0.0000072384228,"teacher_disagreement_score":0.8238674,"about_ca_system_score_codex":0.000015077785,"about_ca_system_score_gemma":0.000010216376,"threshold_uncertainty_score":0.49963135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082148544,0.000016729999,0.9167145,0.000010482822,0.00021503634,0.0001352801,0.000029301818,0.00031069363,0.00041943323],"genre_scores_gemma":[0.9925784,0.0000029466426,0.007259295,0.00009428351,0.000009076791,0.00000901403,0.000034964847,0.000010267887,0.0000017590771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911934,0.000080955695,0.00037995982,0.000065081345,0.00018012687,0.00017453903],"domain_scores_gemma":[0.9992863,0.00016930887,0.00009080249,0.00029562105,0.000110946276,0.00004701434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003183948,0.00013078828,0.00020653938,0.0009899111,0.0000669423,0.000017153465,0.00007431934,0.00010079197,0.000032692882],"category_scores_gemma":[0.000007117093,0.00014389849,0.00012295644,0.0008467966,0.000047133,0.00047685552,4.237338e-7,0.00015798118,0.00001571368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050774714,0.000052185645,0.000115544455,0.000019518846,0.00009817534,1.17484554e-7,0.00031371435,0.98688537,0.0033649658,0.00027659987,0.000020413734,0.008802619],"study_design_scores_gemma":[0.00023272281,0.000009778148,0.0030541648,0.00003378323,0.00014385884,3.4942812e-7,0.00008375453,0.7761168,0.22007753,0.00008314997,0.000044262237,0.00011984438],"about_ca_topic_score_codex":0.000055070715,"about_ca_topic_score_gemma":0.000011644935,"teacher_disagreement_score":0.91042984,"about_ca_system_score_codex":0.00015622037,"about_ca_system_score_gemma":0.0000239712,"threshold_uncertainty_score":0.586801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12096094,0.00008820263,0.8756173,0.000014940692,0.000092284936,0.00045916636,3.5325908e-7,0.00097587996,0.0017909146],"genre_scores_gemma":[0.89389867,0.0000054822494,0.10591503,0.000007017503,0.000029933168,0.00006498234,0.0000016520115,0.000062992556,0.000014226168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998922,0.000006811534,0.00038141737,0.00016564256,0.00015563495,0.00036850403],"domain_scores_gemma":[0.99955094,0.00004933887,0.000025712181,0.00026683364,0.00002451342,0.00008264452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121194396,0.00022054995,0.0002585458,0.00019203218,0.000023583934,0.00008075235,0.00014279713,0.00011436656,0.00009234122],"category_scores_gemma":[0.000027204504,0.00022138849,0.000046858164,0.00024245946,0.000019234487,0.00028266766,0.00004399799,0.00023355133,0.00007285722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.6260885e-7,0.00002024315,0.000032754215,0.00022925215,0.000010803774,0.000003852633,0.00018210552,0.9809524,0.016321931,0.0013272882,0.00008521609,0.00083369017],"study_design_scores_gemma":[0.00018513441,0.00000871373,0.000044605644,0.0004979129,0.0000075292173,0.000022757164,0.000012439656,0.9781425,0.009640061,0.011154137,0.000035284298,0.00024894183],"about_ca_topic_score_codex":0.000027506814,"about_ca_topic_score_gemma":0.0000013730348,"teacher_disagreement_score":0.7729377,"about_ca_system_score_codex":0.00010795892,"about_ca_system_score_gemma":0.000006099141,"threshold_uncertainty_score":0.90279603},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057734214,0.00025524132,0.9414389,0.000017517128,0.00004711701,0.00024218082,0.0000074570867,0.00019108682,0.00006627144],"genre_scores_gemma":[0.7406452,0.000008908161,0.25925186,0.000040091654,0.000009283229,0.00000815963,0.000018445578,0.000015948148,0.0000021253265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932265,0.00004221456,0.00022399884,0.00012994792,0.00008711239,0.00019409541],"domain_scores_gemma":[0.99932104,0.00027589634,0.00004559776,0.00025072554,0.00006166844,0.000045089022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002192219,0.00012557261,0.00026176462,0.0004142385,0.000025466523,0.000015776166,0.000057545985,0.000075029086,0.000006102868],"category_scores_gemma":[0.000019710706,0.0001281836,0.00008509786,0.00043907034,0.0000343963,0.00007875599,0.000005664486,0.000050060426,3.1168446e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073921576,0.000082156366,0.008362346,0.00007162977,0.00027137905,0.0000011331479,0.000072550996,0.841725,0.13541155,0.000093805116,0.00037238668,0.013462186],"study_design_scores_gemma":[0.00024583403,0.000015276768,0.0038835385,0.000025834255,0.000101324025,2.0008535e-7,0.000009669693,0.72139907,0.27402592,0.00013878985,0.00004006863,0.00011445881],"about_ca_topic_score_codex":0.00008172208,"about_ca_topic_score_gemma":0.000008273823,"teacher_disagreement_score":0.682911,"about_ca_system_score_codex":0.00002255723,"about_ca_system_score_gemma":0.000011545416,"threshold_uncertainty_score":0.5227176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.903163,0.0005850786,0.08777374,0.000006301754,0.0016187169,0.00023122512,0.000009192072,0.0007169865,0.0058957455],"genre_scores_gemma":[0.81308866,0.00016772376,0.18633884,0.000020126521,0.00028310408,0.000007870686,0.000007033108,0.00005131955,0.00003531475],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875456,0.00004168301,0.0002950105,0.00021024399,0.00019093331,0.00050756364],"domain_scores_gemma":[0.9991739,0.0000428938,0.000083049774,0.0004517145,0.00010071651,0.00014773717],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000101761856,0.00025109504,0.00024328541,0.00010991827,0.00014832766,0.00007233002,0.0002120029,0.00015948337,0.000031541134],"category_scores_gemma":[0.00002187135,0.0002666086,0.00006782176,0.00014280781,0.0000880945,0.00039014843,0.000103862454,0.00021670233,0.00002698024],"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.000008147253,0.000030649055,0.0006323233,0.00002056344,0.000017673454,0.000005169973,0.00030499918,0.006319678,0.98741347,0.00027216118,0.0016318469,0.0033432988],"study_design_scores_gemma":[0.00017967187,0.000014203174,0.00012997672,0.00025117496,0.00003206007,0.00014237,0.000085332504,0.09523674,0.9020757,0.00023841906,0.0012732454,0.00034109232],"about_ca_topic_score_codex":0.00003487975,"about_ca_topic_score_gemma":9.864647e-7,"teacher_disagreement_score":0.0985651,"about_ca_system_score_codex":0.00008131034,"about_ca_system_score_gemma":0.000014098142,"threshold_uncertainty_score":0.9999786},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1206663,0.00004940154,0.8788612,0.00006314541,0.0001105925,0.00012421892,0.00000101843,0.00004214751,0.00008198801],"genre_scores_gemma":[0.9380164,0.000021209078,0.06185878,0.000021466883,0.000041014428,0.000010668654,8.469791e-7,0.00001169637,0.000017882654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991014,0.00007267587,0.00038052432,0.000093595096,0.00021356826,0.0001382382],"domain_scores_gemma":[0.9992745,0.0001300454,0.000206236,0.00015653673,0.00017713467,0.000055541215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017351187,0.00010188709,0.00031529588,0.00012024054,0.00006469859,0.000015211764,0.00016730445,0.000043183853,0.00003175869],"category_scores_gemma":[0.00006484529,0.000065894026,0.0004048265,0.00061033736,0.000043510874,0.00005724635,0.000016501406,0.00017238765,0.0000015238869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002307903,0.00010840933,0.00453951,0.00003513426,0.0016430095,0.0000011312729,0.0002182736,0.8202049,0.024795394,0.00008970414,0.00018696551,0.14815447],"study_design_scores_gemma":[0.00009461485,0.00008867244,0.0014075616,0.0000471117,0.00028186606,0.000004744154,0.000083547166,0.92103773,0.076384895,0.00038471518,0.00011135726,0.000073166644],"about_ca_topic_score_codex":0.00011320776,"about_ca_topic_score_gemma":0.0000032527532,"teacher_disagreement_score":0.81735015,"about_ca_system_score_codex":0.00003431431,"about_ca_system_score_gemma":0.000007866665,"threshold_uncertainty_score":0.26870805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64004767,0.0005916757,0.35853598,0.000034658002,0.0001512274,0.000310399,0.000024870264,0.00015941536,0.00014408912],"genre_scores_gemma":[0.999714,0.00009644678,0.000032163633,0.000035645415,0.00003373645,0.000011567029,0.0000039559422,0.000022738339,0.00004973829],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883723,0.00017247694,0.0002809317,0.00022353225,0.00025137883,0.00023443387],"domain_scores_gemma":[0.9993165,0.00029569762,0.000076505785,0.00013009376,0.000067713016,0.00011350226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018522095,0.00018523395,0.00029169887,0.000096087744,0.00027423946,0.0000801273,0.00006920122,0.0001369511,0.000017397377],"category_scores_gemma":[0.0000074440136,0.00013874081,0.00004719508,0.00018345138,0.00016122652,0.00006535522,0.0000022324361,0.00040987958,0.0000012661995],"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.0000043253235,0.00006377011,0.00005067536,0.00009805589,0.00018639052,0.000002906386,0.00037528615,0.002303024,0.9528729,0.000009541594,0.0011235705,0.042909563],"study_design_scores_gemma":[0.00033303094,0.00031510237,0.00013521213,0.0007327457,0.00006119057,0.00010651897,0.00041269342,0.86949307,0.12695003,0.000077519566,0.0010298765,0.00035304262],"about_ca_topic_score_codex":0.0001511186,"about_ca_topic_score_gemma":0.0000012769934,"teacher_disagreement_score":0.86719,"about_ca_system_score_codex":0.000026897827,"about_ca_system_score_gemma":0.000009161721,"threshold_uncertainty_score":0.5657686},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013514764,0.0011295152,0.9835993,0.00008679011,0.000043102864,0.00026877958,0.000025846675,0.00025543311,0.001076483],"genre_scores_gemma":[0.6872813,0.00008135514,0.31222913,0.000092768576,0.000058466292,0.00007943451,0.00014182663,0.000021816657,0.000013896633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989196,0.00003759506,0.00027583045,0.0004488162,0.00013249664,0.00018566941],"domain_scores_gemma":[0.99913543,0.00039119273,0.00010579193,0.00019079477,0.00008878524,0.00008798687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025555314,0.00029011094,0.00055925484,0.00027016076,0.00010252592,0.00011119779,0.00014498926,0.00018898191,0.000013625755],"category_scores_gemma":[0.000005133718,0.00030097808,0.0001530201,0.00020622321,0.00008556319,0.000023165283,0.00020753349,0.00026238314,0.0000013615346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023503775,0.000020853044,0.00009567084,0.00015414314,0.0029726662,0.0000012129648,0.00020287037,0.8409245,0.0009099788,0.045609303,0.0009146177,0.108170696],"study_design_scores_gemma":[0.00013833861,0.00001216899,0.00069727114,0.000014841167,0.0009388078,0.0000015774158,0.000021474256,0.7506083,0.000610211,0.24626683,0.0004184302,0.0002717137],"about_ca_topic_score_codex":0.000018931985,"about_ca_topic_score_gemma":0.0000033022466,"teacher_disagreement_score":0.67376655,"about_ca_system_score_codex":0.000028397837,"about_ca_system_score_gemma":0.00002665008,"threshold_uncertainty_score":0.9999442},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16768195,0.00065233087,0.8158991,0.000040945997,0.00074021093,0.0004699809,0.000020127518,0.0007955246,0.01369986],"genre_scores_gemma":[0.92114943,0.000029569868,0.078411676,0.00004802355,0.00020728371,0.0000035363416,0.000006481124,0.00003381403,0.00011017163],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992759,0.000016225978,0.00021968162,0.00011006384,0.000091423826,0.00028665268],"domain_scores_gemma":[0.9994803,0.00013513032,0.000043410226,0.0002128606,0.00006597463,0.00006233516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089820205,0.00015669786,0.00024789982,0.00008163659,0.00003671376,0.000021123698,0.00006792673,0.000070201444,0.000018262534],"category_scores_gemma":[0.00001720434,0.00014494013,0.0000859797,0.00008633572,0.000024112775,0.00016909739,0.000022894406,0.00007828893,0.0000039943066],"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.00011563015,0.00014808797,0.00052962714,0.0001331791,0.00045012822,0.000007511968,0.001383785,0.015442086,0.8786874,0.0017394824,0.055119928,0.046243165],"study_design_scores_gemma":[0.00025078194,0.000056681343,0.00014405033,0.0000797249,0.000027801101,0.000017020739,0.00004754686,0.10574911,0.8884244,0.0008689222,0.004124666,0.0002092992],"about_ca_topic_score_codex":0.000026516016,"about_ca_topic_score_gemma":0.0000057778984,"teacher_disagreement_score":0.7534675,"about_ca_system_score_codex":0.000025471967,"about_ca_system_score_gemma":0.0000056528725,"threshold_uncertainty_score":0.5910487},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15750055,0.00658586,0.8263674,0.00040295662,0.002441756,0.00091543613,0.00008165036,0.0024034434,0.0033009665],"genre_scores_gemma":[0.36571902,0.0003539786,0.63240653,0.00021193546,0.00058727193,0.00014299518,0.000077818004,0.00013120586,0.0003692091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999159,0.0000119778715,0.00020244066,0.00025232654,0.00010301915,0.00027123492],"domain_scores_gemma":[0.9994701,0.000026139176,0.00003614953,0.0003211553,0.00008290678,0.000063539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008884507,0.00016114012,0.0001369519,0.00008199352,0.00009177589,0.00010728915,0.00015399029,0.00006486001,0.000055425226],"category_scores_gemma":[0.000014289846,0.00017971854,0.000038250968,0.000110399946,0.000067739435,0.00028954743,0.000013823796,0.00017024078,0.0000064764768],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026260368,0.000010117493,0.00057426724,0.000004069333,0.0000013651367,0.0000017610579,0.000036264133,0.000088421315,0.0559271,0.000034005105,0.008905867,0.93441415],"study_design_scores_gemma":[0.00027609442,0.000033616052,0.0011253695,0.000037505582,0.000011406898,0.000051889674,0.000035138688,0.85554343,0.044997923,0.00070210686,0.09693899,0.000246503],"about_ca_topic_score_codex":0.00002942768,"about_ca_topic_score_gemma":0.00001013127,"teacher_disagreement_score":0.9341676,"about_ca_system_score_codex":0.000019755456,"about_ca_system_score_gemma":0.000010072833,"threshold_uncertainty_score":0.73287094},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41806805,0.0036731304,0.57463914,0.000010567193,0.001014642,0.00011277489,6.7789324e-7,0.00042212708,0.0020588932],"genre_scores_gemma":[0.9757126,0.00015719775,0.023596207,0.000049128303,0.00042670802,9.929033e-7,7.819424e-7,0.000052463954,0.00000393394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984215,0.00012203026,0.00049961725,0.000229924,0.00037057418,0.00035636974],"domain_scores_gemma":[0.9992187,0.00006173761,0.00021702648,0.00011628134,0.00023891208,0.00014731761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003824212,0.0002574824,0.00029285852,0.0004231093,0.00020042673,0.00016779084,0.000116941264,0.000098468925,0.000005856626],"category_scores_gemma":[0.00006925933,0.00025133282,0.000061683895,0.0005269443,0.00006850449,0.0012617868,0.000019976716,0.00072900305,0.0000041760836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012925736,0.000018920191,0.00027771358,0.000024803687,0.000010132467,0.0001019703,0.00022156064,0.38049573,0.06839719,0.0000043159766,0.000018157449,0.55030024],"study_design_scores_gemma":[0.0008141737,0.00015218096,0.00008201475,0.0015495269,0.000020077236,0.0022146385,0.0005115548,0.79172504,0.19793692,0.0026826388,0.0019011974,0.00041005466],"about_ca_topic_score_codex":0.0000043356,"about_ca_topic_score_gemma":0.000009147009,"teacher_disagreement_score":0.55764455,"about_ca_system_score_codex":0.000402964,"about_ca_system_score_gemma":0.00006238513,"threshold_uncertainty_score":0.9999939},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48191378,0.00013369201,0.51145506,0.000013793518,0.00021920055,0.00021807123,0.0000027879482,0.001639912,0.004403731],"genre_scores_gemma":[0.9833848,0.0000294059,0.016195484,0.000014796323,0.000082589904,0.0000039548963,0.0000023865164,0.00003303911,0.00025356337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994434,0.000014790506,0.00014210086,0.00012320028,0.000104610896,0.00017186212],"domain_scores_gemma":[0.99969256,0.000015904197,0.00001766309,0.00018998723,0.000038617636,0.00004528373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029048506,0.00012476974,0.00012287743,0.00007214797,0.000067353,0.000016910968,0.0000725633,0.00006681841,0.000037049813],"category_scores_gemma":[0.000014209212,0.00012057587,0.000036727113,0.00013087856,0.000021761425,0.00008896303,0.000018036826,0.00007620507,0.000004984469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003453436,0.00011520716,0.011635878,0.00017528648,0.00018076076,0.00027423183,0.0018042534,0.78052765,0.17484885,0.0018676838,0.016405357,0.012130291],"study_design_scores_gemma":[0.00009364155,0.000015223776,0.0007955332,0.000032463544,0.00001094141,0.000048671307,0.000017358618,0.97785604,0.019958653,0.00031463118,0.0006326337,0.0002242343],"about_ca_topic_score_codex":0.00011325337,"about_ca_topic_score_gemma":0.000012932528,"teacher_disagreement_score":0.50147104,"about_ca_system_score_codex":0.00006819247,"about_ca_system_score_gemma":0.000011645623,"threshold_uncertainty_score":0.49169412},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83955926,0.00005036564,0.15930492,0.000092866954,0.0001641378,0.000109520595,0.0000040064606,0.0003427558,0.00037215167],"genre_scores_gemma":[0.9945621,0.000028775154,0.0045926413,0.00065202924,0.00009339735,0.000026143252,0.000013856331,0.000029393022,0.0000016652253],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99948674,0.000030077443,0.00009941129,0.00014234158,0.00009695398,0.0001444861],"domain_scores_gemma":[0.9997635,0.0000422781,0.000024000283,0.000099333265,0.000030449792,0.000040459847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047690024,0.00012365323,0.00009059477,0.000088546476,0.000051451152,0.000048302725,0.000028834698,0.000036613685,0.000026793477],"category_scores_gemma":[0.000005878347,0.00012164977,0.000020380021,0.000065458094,0.000020462525,0.00013315953,0.0000037933992,0.00009274524,0.000013885748],"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.00005207717,0.00005904399,0.1362817,0.00017930314,0.00018079893,0.00012498639,0.00037451426,0.0063673733,0.3528541,0.000003528905,0.0049485867,0.498574],"study_design_scores_gemma":[0.0012579476,0.00008960365,0.024677763,0.00068813766,0.00008306089,0.000050496208,0.00006734008,0.013506389,0.95725894,0.00010802259,0.0014994517,0.00071284355],"about_ca_topic_score_codex":0.000013477036,"about_ca_topic_score_gemma":0.0000026718621,"teacher_disagreement_score":0.60440487,"about_ca_system_score_codex":0.000027967497,"about_ca_system_score_gemma":0.0000032542955,"threshold_uncertainty_score":0.49607337},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10768474,0.000119468896,0.8884004,0.000009615754,0.0003875045,0.0001781231,0.000002976341,0.0010648569,0.0021523181],"genre_scores_gemma":[0.85752,0.0000063905277,0.14210913,0.000022027481,0.00020084022,0.000004500141,0.000007389639,0.000044345823,0.00008537116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927616,0.000021518143,0.00015825032,0.000112427246,0.000088571585,0.0003430488],"domain_scores_gemma":[0.99959666,0.00013687306,0.00003065483,0.00010974089,0.00006365487,0.00006241601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008853728,0.0001607757,0.00016436263,0.000081146005,0.00020525783,0.00004556772,0.000054420067,0.00006146674,0.000010063477],"category_scores_gemma":[0.000036732086,0.00015793889,0.000059738315,0.000053973185,0.000037296042,0.0002883823,0.000048771937,0.00013162558,0.0000025177087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045946363,0.00005522176,0.0013942677,0.00014103002,0.00020896454,0.000003270746,0.0067133973,0.5501857,0.37055537,0.0016653042,0.0014846933,0.06754686],"study_design_scores_gemma":[0.00015084563,0.0000141106275,0.00045078926,0.00006650025,0.00002515675,0.000013438564,0.0005517983,0.8982786,0.097953185,0.00013907871,0.0021525722,0.00020391881],"about_ca_topic_score_codex":0.000038964936,"about_ca_topic_score_gemma":0.0000046659784,"teacher_disagreement_score":0.74983525,"about_ca_system_score_codex":0.00006145033,"about_ca_system_score_gemma":0.0000044329367,"threshold_uncertainty_score":0.6440561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8340068,0.00027997867,0.16490296,0.00029469814,0.00019297322,0.00013464868,0.0000049696823,0.00008686848,0.00009610723],"genre_scores_gemma":[0.9898241,0.00010558244,0.009832047,0.00014595935,0.000060010487,0.0000025949823,0.000018566187,0.0000102586955,8.660684e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000021207063,0.0005666174,0.00006355699,0.00022657627,0.00014573462],"domain_scores_gemma":[0.99920297,0.000028713102,0.00022736208,0.00003629721,0.00043492866,0.00006972382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015814233,0.00012366447,0.00015187151,0.00033734023,0.00008487468,0.00022512494,0.00007225364,0.00006849981,0.000002371059],"category_scores_gemma":[0.000058102636,0.00012236036,0.000030255389,0.0001088957,0.00005007361,0.0027725936,0.000018987786,0.00023625052,0.000001597707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027224267,0.00004511924,0.00004849572,0.000032536806,0.000022845301,0.000004557568,0.0018904997,0.0020670218,0.08612763,0.000010420606,0.00029963587,0.909424],"study_design_scores_gemma":[0.0016029908,0.000052785417,0.00038731075,0.00049729104,0.000009750241,0.00030884997,0.0007915391,0.94131815,0.053539332,0.00004334883,0.0012947285,0.00015393335],"about_ca_topic_score_codex":0.00001598327,"about_ca_topic_score_gemma":0.0000029266052,"teacher_disagreement_score":0.9392511,"about_ca_system_score_codex":0.0000666841,"about_ca_system_score_gemma":0.000021702173,"threshold_uncertainty_score":0.49897107},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3267219,0.00034327793,0.66928923,0.000030310885,0.0016091375,0.0002272621,0.000043607735,0.00039767672,0.0013375856],"genre_scores_gemma":[0.99788773,0.00022972631,0.0014939695,0.0001992782,0.000051313185,0.00006981415,0.000008011447,0.00003407175,0.000026079986],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985725,0.000063333566,0.00028276618,0.00020071083,0.0005816719,0.00029899002],"domain_scores_gemma":[0.99946016,0.000019685034,0.000058576115,0.0001971823,0.00009853235,0.00016587281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001653164,0.00023376103,0.00017653697,0.00014917439,0.00015590679,0.000055142027,0.00007214318,0.00006126111,0.00006943402],"category_scores_gemma":[0.000001474644,0.00023968657,0.00006605591,0.00010957179,0.00003421045,0.00018889307,0.0000014101797,0.00013448007,0.000021919934],"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.00021874675,0.00067364465,0.00030686316,0.000029745423,0.0007680679,0.0000026919247,0.0016752579,0.18767627,0.34404388,0.000042948064,0.0021420445,0.46241984],"study_design_scores_gemma":[0.0008966918,0.00008348788,0.0014037878,0.00014474145,0.00009890794,0.0000041216667,0.00015594755,0.013205544,0.98172176,0.00011888286,0.0018066425,0.00035947547],"about_ca_topic_score_codex":0.00015508934,"about_ca_topic_score_gemma":0.000058737805,"teacher_disagreement_score":0.6711658,"about_ca_system_score_codex":0.00026100496,"about_ca_system_score_gemma":0.000017129132,"threshold_uncertainty_score":0.9774135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9495774,0.00031301123,0.048657242,0.0006860648,0.000009619995,0.00034611765,0.000033773846,0.000053501226,0.00032325793],"genre_scores_gemma":[0.9983891,0.00010570567,0.0013464184,0.00006177556,0.000019012099,0.000054260017,0.000008774781,0.000008362325,0.0000065735962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996653,0.000018034038,0.00014920399,0.000068838934,0.000038693106,0.00005988871],"domain_scores_gemma":[0.99964684,0.00007711797,0.000034571534,0.00019116502,0.00003770852,0.000012573615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006237793,0.00005842944,0.000076858145,0.000033399552,0.00006064285,0.0000061912774,0.00007763904,0.00002597118,0.000004012487],"category_scores_gemma":[0.0000071795903,0.00003921495,0.00002042629,0.00016543336,0.00004585441,0.000023576602,0.000014200871,0.00007476996,0.0000017640983],"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.0000038683647,0.000036719102,0.000014831286,0.000015220928,0.000009009485,0.0000033793951,0.00016193654,0.005584541,0.010516911,0.9830582,0.00006133421,0.0005340284],"study_design_scores_gemma":[0.00072836643,0.00011417387,0.0031925007,0.00036419148,0.000064101165,0.00025968713,0.00040214922,0.121493846,0.40185606,0.46880782,0.0023353563,0.0003817537],"about_ca_topic_score_codex":0.000063039566,"about_ca_topic_score_gemma":0.000043384596,"teacher_disagreement_score":0.5142504,"about_ca_system_score_codex":0.000011854819,"about_ca_system_score_gemma":0.0000057552843,"threshold_uncertainty_score":0.15991393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09421093,0.008405792,0.89439,0.00017630488,0.0005644751,0.00082467706,0.000016580454,0.00046817484,0.00094309926],"genre_scores_gemma":[0.79659843,0.0005178134,0.20194212,0.00019268718,0.00024351478,0.0002714127,0.000011242524,0.00006876881,0.00015399937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991573,0.0000085966485,0.00018993202,0.00022120104,0.000081236045,0.0003417448],"domain_scores_gemma":[0.9995515,0.00003498633,0.000030238272,0.00024859916,0.00004554479,0.00008915151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012812742,0.00016078785,0.00016723212,0.00010458678,0.00006864577,0.00005132719,0.000086361615,0.000044851873,0.000008954858],"category_scores_gemma":[0.000010240082,0.00018138997,0.000035232275,0.00013010543,0.00003749082,0.00021552625,0.000030294674,0.000087538734,0.000016634489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005500908,0.00000661439,0.0008696283,0.000015336485,0.0000022055142,5.2537985e-7,0.0000703679,0.000112948605,0.01151163,0.000014692299,0.0010834645,0.9863071],"study_design_scores_gemma":[0.00028954147,0.00003635474,0.016070679,0.00014657761,0.00001968616,0.000065051274,0.000048189315,0.93863845,0.011557572,0.0007043238,0.03210279,0.0003208176],"about_ca_topic_score_codex":0.000024993495,"about_ca_topic_score_gemma":0.0000036711826,"teacher_disagreement_score":0.9859863,"about_ca_system_score_codex":0.000058905473,"about_ca_system_score_gemma":0.000006285527,"threshold_uncertainty_score":0.73968685},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12152691,0.00004772529,0.87223595,0.000022583417,0.0000384358,0.000037368864,8.945302e-7,0.000026256585,0.00606388],"genre_scores_gemma":[0.914534,0.000018311475,0.08534051,0.000012252428,0.00008247235,4.9617324e-8,2.9185063e-7,0.000011316122,8.0529804e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993554,0.000017762375,0.00032469293,0.00004170513,0.00015581235,0.00010462731],"domain_scores_gemma":[0.99935204,0.00029721923,0.000081897895,0.000068485155,0.00013594153,0.0000644129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024552268,0.00008236184,0.00025816736,0.000038232105,0.000015918076,0.0000128184265,0.000053019972,0.000042751617,0.000019496088],"category_scores_gemma":[0.00004284658,0.000062962805,0.00006233624,0.00006638838,0.00024939838,0.00005040955,0.000020531048,0.00013761551,6.408895e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002221603,0.00004320618,0.000002628284,0.000036949805,0.000035513724,0.000012577487,0.0001557375,0.0035307477,0.0062606903,0.98766094,0.00001595152,0.002222833],"study_design_scores_gemma":[0.00020962425,0.00008328706,0.000014801303,0.00027995012,0.000044987188,0.00009138221,0.00010143206,0.24878708,0.12593004,0.62436,0.000016846432,0.00008054671],"about_ca_topic_score_codex":9.3903424e-8,"about_ca_topic_score_gemma":2.2564436e-8,"teacher_disagreement_score":0.7930071,"about_ca_system_score_codex":0.000008088771,"about_ca_system_score_gemma":0.000004982817,"threshold_uncertainty_score":0.25675488},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.970958,0.00007728583,0.007909685,0.000016937394,0.000086856824,0.0002544797,0.0000034569898,0.00040439534,0.020288913],"genre_scores_gemma":[0.95417494,7.7021394e-7,0.045723278,0.000032171338,0.000024610796,0.000005653557,0.0000041784256,0.000028970042,0.000005461793],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910724,0.000024392531,0.00031544894,0.00018775913,0.000116362426,0.00024878883],"domain_scores_gemma":[0.9993665,0.00021067396,0.000062799554,0.00022338476,0.00009353344,0.000043098593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056863828,0.00016863906,0.00020946543,0.00014773119,0.000027922777,0.000030386063,0.00010171595,0.000042673,0.000016153366],"category_scores_gemma":[0.00005309497,0.00016839703,0.00003790685,0.00020500456,0.000060213664,0.00018146401,0.00003111605,0.0001374939,0.0000070884767],"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.0000087764465,0.000019463452,0.0010133479,0.000007763903,0.0000065721815,0.000013329771,0.0002507393,0.011552098,0.9818105,0.000012497199,0.0005200437,0.004784871],"study_design_scores_gemma":[0.00037414473,0.000014680595,0.004674819,0.00017513869,0.000002163316,0.0000076669785,0.00031751095,0.38803095,0.6061605,0.000114738825,0.0000041009675,0.00012358662],"about_ca_topic_score_codex":0.0010072683,"about_ca_topic_score_gemma":0.0000076618,"teacher_disagreement_score":0.37647885,"about_ca_system_score_codex":0.00006817312,"about_ca_system_score_gemma":0.000015747986,"threshold_uncertainty_score":0.6867032},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79928607,0.00025716014,0.19800834,0.000059506787,0.00006893541,0.00008279006,0.000026376838,0.00033380048,0.001877041],"genre_scores_gemma":[0.9844631,0.000014782327,0.0152545385,0.00007541721,0.000029893168,0.0000016959638,0.00013396876,0.000010297192,0.000016300623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991179,0.000018744864,0.0002737135,0.00015321282,0.000276642,0.000159787],"domain_scores_gemma":[0.99952054,0.00007713476,0.000053634278,0.00019000462,0.00009419772,0.00006450294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006528457,0.00013295098,0.00026125932,0.0004681771,0.000046195022,0.00001657805,0.00012644536,0.000048123973,0.000039036022],"category_scores_gemma":[0.000010911556,0.00011671086,0.00017150403,0.00093915843,0.000035044206,0.000060173013,0.000028393635,0.000101831036,0.000009207468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006513827,0.000036840087,0.001673424,0.000004837626,0.00030175812,0.0000057396046,0.000057460627,0.9903407,0.0022003183,0.003069952,0.00044621722,0.0018562154],"study_design_scores_gemma":[0.00018160265,0.000060817005,0.26883656,0.000028846023,0.0002101161,0.0000050130116,0.000023201595,0.7194721,0.003912572,0.006431605,0.00059756543,0.00024001175],"about_ca_topic_score_codex":0.000009568117,"about_ca_topic_score_gemma":0.0000011315186,"teacher_disagreement_score":0.27086863,"about_ca_system_score_codex":0.000026401502,"about_ca_system_score_gemma":0.000009972267,"threshold_uncertainty_score":0.47593307},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017239181,0.000091316404,0.97470146,0.00002243684,0.00025584412,0.00009953331,3.415959e-7,0.00021338095,0.0073765046],"genre_scores_gemma":[0.95474035,0.00015774451,0.044868197,0.000026166752,0.0001173725,7.047186e-7,0.000011558148,0.000024869176,0.00005301491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993866,0.000016061651,0.0002478927,0.00005844207,0.00016649504,0.00012449973],"domain_scores_gemma":[0.9996029,0.000017253871,0.000096279684,0.0001017343,0.00013489007,0.000046953424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021797726,0.00008249065,0.00010711607,0.00014887427,0.00004037283,0.000029999523,0.00006563265,0.0000710387,0.000028595705],"category_scores_gemma":[0.000019681034,0.00007753208,0.000040467217,0.00018155185,0.00001838435,0.00011862212,0.000005409198,0.00012955492,0.000001934084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023082821,0.00003253029,0.00014938822,0.000007696621,0.000021127478,0.000008444511,0.00007060546,0.974991,0.0031805423,0.0007542276,0.00034240715,0.020418916],"study_design_scores_gemma":[0.0005184269,0.00035433235,0.0006726972,0.00033996062,0.00002877171,0.00010997019,0.000066029184,0.81528455,0.17919306,0.0012025854,0.001969301,0.00026030384],"about_ca_topic_score_codex":5.298547e-7,"about_ca_topic_score_gemma":2.9119676e-7,"teacher_disagreement_score":0.9375012,"about_ca_system_score_codex":0.000041409927,"about_ca_system_score_gemma":0.000008470281,"threshold_uncertainty_score":0.31616664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9377146,0.0071886815,0.048009697,0.00013201489,0.0003131844,0.00015562987,0.0000018965059,0.0014994869,0.0049848272],"genre_scores_gemma":[0.9933857,0.000047850215,0.006238617,0.000052789805,0.0002371463,0.000005769268,0.0000027313984,0.000020115422,0.000009285766],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994311,0.0000090979465,0.00014556067,0.00012228393,0.000111010515,0.00018099311],"domain_scores_gemma":[0.9998215,0.000020509518,0.000021460393,0.00007666674,0.000025899855,0.000033979915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007622127,0.00010011361,0.000120357836,0.000095815994,0.00004627409,0.00004592461,0.00009338194,0.00006997134,0.000022354847],"category_scores_gemma":[0.000006412951,0.000097726785,0.0000221333,0.0001393977,0.000036801906,0.00038358857,0.00001627633,0.00030425013,0.000013084394],"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.000023721284,0.000060634946,0.0057032336,0.0001520565,0.000005888542,0.000044290504,0.00039269254,0.011639676,0.74247676,0.0009535398,0.001013049,0.23753448],"study_design_scores_gemma":[0.00054949167,0.000061034756,0.006691337,0.00042762168,0.0000146677785,0.000064028995,0.0000982799,0.7059106,0.1978027,0.05224468,0.035346415,0.00078911934],"about_ca_topic_score_codex":0.000002955459,"about_ca_topic_score_gemma":0.000013801926,"teacher_disagreement_score":0.69427097,"about_ca_system_score_codex":0.000016625027,"about_ca_system_score_gemma":0.000013417482,"threshold_uncertainty_score":0.39851826},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157513,0.00039762646,0.058513,0.00003420315,0.0001945379,0.000098468816,5.129561e-7,0.0011399088,0.023870476],"genre_scores_gemma":[0.98097146,0.000011477126,0.018819176,0.00007161836,0.000071007955,0.0000011917768,0.000002111319,0.000019693647,0.00003226496],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999495,0.00001884212,0.0001222412,0.00006639943,0.00006237963,0.00023509852],"domain_scores_gemma":[0.99975985,0.00003677258,0.000010695204,0.00013634117,0.000012111707,0.000044229128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006075397,0.00009827136,0.000118752876,0.00008010094,0.000017464872,0.000015623737,0.000051494684,0.000044576795,0.000030951265],"category_scores_gemma":[0.000008655406,0.00009314144,0.000021937263,0.0001127583,0.000019391891,0.0001713467,0.000024277644,0.000094602656,0.000018471314],"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.000028379538,0.00015935239,0.14795907,0.000066849716,0.00010282194,0.000049617516,0.0044235876,0.010623703,0.75037044,0.0041000117,0.03782469,0.04429148],"study_design_scores_gemma":[0.00037150006,0.000016894766,0.049651936,0.00014002234,0.0000073638043,0.000023072182,0.0003603354,0.12420672,0.8070677,0.0010238684,0.016586317,0.0005442567],"about_ca_topic_score_codex":0.000068964466,"about_ca_topic_score_gemma":0.000017074968,"teacher_disagreement_score":0.11358302,"about_ca_system_score_codex":0.000022373437,"about_ca_system_score_gemma":0.0000024962076,"threshold_uncertainty_score":0.37981978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9452562,0.00025371215,0.0022512474,0.000052779797,0.00016579755,0.000031420994,0.000028743441,0.00024080396,0.051719297],"genre_scores_gemma":[0.9968141,0.00029910562,0.0018671058,0.00015140184,0.0003058276,0.00022451984,0.00017627516,0.00009491853,0.000066753826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99850774,0.000010643397,0.0003949467,0.00035753654,0.00028812664,0.0004410108],"domain_scores_gemma":[0.9989116,0.00020550126,0.0002064173,0.0004966399,0.000033661345,0.00014613371],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021655484,0.000227526,0.00018263907,0.00016885962,0.00023033106,0.00031297325,0.0002700172,0.00036406386,0.0023631065],"category_scores_gemma":[0.000032496995,0.00031709316,0.00041502836,0.0003034005,0.0000985257,0.00024957577,0.00011488868,0.00024850632,0.00027512386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016397602,0.00012127557,0.000018010234,0.00048709454,0.003011844,0.000081724684,0.0005399148,0.016728314,0.031079672,0.9032956,0.032036677,0.012435926],"study_design_scores_gemma":[0.00040068766,0.000109418004,0.0005054632,0.00014540667,0.0013630453,0.000032471937,0.0005307757,0.40667546,0.58734196,0.0006491529,0.0016455068,0.00060063007],"about_ca_topic_score_codex":0.00032138213,"about_ca_topic_score_gemma":0.00008992343,"teacher_disagreement_score":0.9026464,"about_ca_system_score_codex":0.000004556701,"about_ca_system_score_gemma":0.000039934774,"threshold_uncertainty_score":0.9999281},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54912865,0.00012971298,0.4407713,0.0000115438515,0.00076427415,0.00019811842,0.000011901784,0.0009385704,0.008045925],"genre_scores_gemma":[0.9303573,0.000014288461,0.06938846,0.00002795615,0.00012466485,0.0000020166003,0.0000067190535,0.000049726157,0.000028892053],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.000022465643,0.0003136493,0.0002300936,0.0001922722,0.00027373873],"domain_scores_gemma":[0.99913764,0.00006909021,0.00008597752,0.0004279214,0.00019601615,0.00008332896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056870478,0.0002510967,0.00033924752,0.00014939139,0.000060570597,0.000027056318,0.00018078666,0.00018923337,0.000057348683],"category_scores_gemma":[0.000026236885,0.00023084752,0.000109266475,0.00010869624,0.00007611146,0.0001767074,0.00006807189,0.0004303125,0.000005338126],"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.000040703206,0.000013065508,0.000021279431,0.00001554225,0.00012377954,0.000025269712,0.00030192558,0.26548764,0.6990081,0.00049315137,0.000828344,0.033641182],"study_design_scores_gemma":[0.00013288746,0.00002501017,0.000046720488,0.00006125892,0.000020927602,0.00002528305,0.000050955943,0.708921,0.28491408,0.005555367,0.000046565925,0.00019993325],"about_ca_topic_score_codex":0.00013051055,"about_ca_topic_score_gemma":0.00009322938,"teacher_disagreement_score":0.44343337,"about_ca_system_score_codex":0.000024218501,"about_ca_system_score_gemma":0.000021468786,"threshold_uncertainty_score":0.9413689},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119698465,0.000030378034,0.86838895,0.00010965567,0.000014321571,0.0002370098,0.0000010956948,0.0010994766,0.0104206335],"genre_scores_gemma":[0.93937814,0.0000043101836,0.060106833,0.00041587383,0.000043557946,0.00001754996,0.0000059622457,0.000014040838,0.000013738225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99950594,0.0000053512917,0.000102964215,0.00014497286,0.000083470666,0.00015732118],"domain_scores_gemma":[0.9996495,0.000020820726,0.000017600409,0.00019543276,0.000055259687,0.000061369836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021808726,0.0001178468,0.000117284544,0.00007406199,0.00004966181,0.000029853883,0.000093896284,0.00003086734,0.000007860621],"category_scores_gemma":[0.000003897954,0.00010171258,0.000016423899,0.00019433333,0.000010092251,0.00007713509,0.000010181083,0.00007458146,0.000013645809],"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.00004921677,0.00007151605,0.0000315235,0.000006126935,0.000045225283,0.0000068302834,0.00058873947,0.09685782,0.7345034,0.0045625214,0.0028105665,0.16046652],"study_design_scores_gemma":[0.00067171146,0.00034337307,0.0011627567,0.00015962448,0.000018925515,0.000014813265,0.0001764859,0.13387673,0.8492528,0.0024735965,0.011340493,0.0005086566],"about_ca_topic_score_codex":0.000008052729,"about_ca_topic_score_gemma":0.0000031654733,"teacher_disagreement_score":0.8196797,"about_ca_system_score_codex":0.000027432085,"about_ca_system_score_gemma":0.0000044086833,"threshold_uncertainty_score":0.41477188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.448574,0.000023821489,0.5388365,0.000059976697,0.0007927884,0.00019744695,0.0000017951832,0.0013821654,0.0101315435],"genre_scores_gemma":[0.98865575,0.000004899001,0.010961191,0.000060152575,0.00019679942,0.000004087349,0.0000022443937,0.000029837674,0.000085042644],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99954635,0.000004376233,0.00010251303,0.00011637562,0.000055027347,0.00017535468],"domain_scores_gemma":[0.99965096,0.00007636608,0.000017081753,0.00018212368,0.00003419213,0.000039268765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003987798,0.00010624186,0.00011002959,0.00005867952,0.00007018098,0.000042564414,0.000055728295,0.00007931673,0.00002172678],"category_scores_gemma":[0.0000207015,0.00010180135,0.000049182087,0.000053605607,0.000023000706,0.00006750288,0.000009051201,0.00015740801,0.000008953674],"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.00000765622,0.0000041219564,0.00003399923,0.000006948697,0.000017290118,0.0000026194357,0.000030366084,0.00051937863,0.97954935,0.00019298874,0.0028498443,0.016785428],"study_design_scores_gemma":[0.00012750109,0.000020093872,0.00022928802,0.000010169693,0.000009104391,0.000018176237,0.000009586828,0.06668581,0.9175163,0.004339281,0.010899829,0.00013486862],"about_ca_topic_score_codex":0.000026808153,"about_ca_topic_score_gemma":0.000236218,"teacher_disagreement_score":0.54008174,"about_ca_system_score_codex":0.000011435997,"about_ca_system_score_gemma":0.0000036322213,"threshold_uncertainty_score":0.41513386},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14941691,0.000018248864,0.844903,0.00004594929,0.000082952974,0.00022915102,0.0000019690153,0.0005639116,0.0047379048],"genre_scores_gemma":[0.93166673,0.000028933386,0.068029895,0.00004491584,0.000070891525,0.000034121516,0.00004634644,0.000016482634,0.000061678846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965703,0.000011551518,0.00009548516,0.00010845996,0.00004517787,0.00008226994],"domain_scores_gemma":[0.99977267,0.000049285845,0.00001746434,0.00010084283,0.000038016286,0.000021727652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007079623,0.00006601201,0.00007261295,0.000043325294,0.000032402917,0.000032326618,0.000025401776,0.000045172175,0.000008337978],"category_scores_gemma":[0.0000338364,0.000065943444,0.00001891281,0.00004451035,0.000010276088,0.00012465187,0.0000071235213,0.0000321022,0.000007544147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054417378,0.00004671075,0.00021334186,0.00021855228,0.000059408823,9.590409e-7,0.0005683269,0.056078736,0.124823235,0.002420271,0.026089765,0.78942627],"study_design_scores_gemma":[0.00019882189,0.000021426198,0.00028620724,0.0000308918,0.0000104904375,0.0000034450873,0.00004091688,0.8400725,0.15379821,0.004980669,0.00045429618,0.00010212955],"about_ca_topic_score_codex":0.000009017362,"about_ca_topic_score_gemma":0.000005332764,"teacher_disagreement_score":0.78932416,"about_ca_system_score_codex":0.000008741151,"about_ca_system_score_gemma":0.0000011308217,"threshold_uncertainty_score":0.26890957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70130473,0.0011508482,0.29681185,0.000009233463,0.00017639139,0.00012142479,0.0000025896684,0.00013953345,0.00028339447],"genre_scores_gemma":[0.91757274,0.000090392285,0.08211937,0.000044394503,0.00012779314,0.0000014714857,0.0000020169093,0.00004061553,0.0000012029379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840015,0.00011357534,0.00059343514,0.00021352938,0.0003475214,0.00033179164],"domain_scores_gemma":[0.9990116,0.00015676004,0.00035458265,0.0001549033,0.00020590611,0.00011627336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016236842,0.0002684735,0.0003737363,0.00035486574,0.00017355217,0.00019587619,0.00021216269,0.00008524957,0.00002869934],"category_scores_gemma":[0.000031837848,0.00024890213,0.000057656696,0.00032794726,0.00015333299,0.00089252146,0.000017986215,0.00047325986,0.0000019808326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000670378,0.00006781352,0.0016790557,0.00018839979,0.00001210348,0.00009168055,0.00020980535,0.40335763,0.13063087,0.00001615519,0.000008129555,0.46367133],"study_design_scores_gemma":[0.00038342347,0.00016301479,0.00056601583,0.0017136204,0.000020693802,0.0002899431,0.0002390053,0.9243805,0.06907931,0.0028021054,0.000057911388,0.00030449402],"about_ca_topic_score_codex":0.000007995829,"about_ca_topic_score_gemma":0.0000027340734,"teacher_disagreement_score":0.52102286,"about_ca_system_score_codex":0.0000897146,"about_ca_system_score_gemma":0.00005908965,"threshold_uncertainty_score":0.9999963},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11474538,0.0016739023,0.7398857,0.002630641,0.00024811897,0.00080264,0.000008965216,0.002219537,0.1377851],"genre_scores_gemma":[0.81201804,0.00030891426,0.18701619,0.00022851245,0.00006430396,0.000009396581,0.0000074088975,0.000032467382,0.00031478313],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999407,0.000029823912,0.00014314278,0.00012039019,0.000106188745,0.00019343705],"domain_scores_gemma":[0.9988062,0.00029428225,0.00002774762,0.00074595044,0.00009835618,0.000027503422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004601015,0.00013478924,0.00014567023,0.0000044320827,0.00027475055,0.000028183737,0.00029634405,0.000082568935,0.000020741776],"category_scores_gemma":[0.00004089248,0.00009887345,0.00006986317,0.00008161505,0.00014245123,0.00012211724,0.00008729491,0.00016901977,0.0000109640105],"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.00005734421,0.000050994102,0.00008058005,0.00002771196,0.00021704899,0.000021758178,0.0031720328,0.057654284,0.0113248015,0.046602856,0.8723398,0.008450823],"study_design_scores_gemma":[0.00093146943,0.00007705024,0.00069505785,0.00017931743,0.000070426715,0.0001932859,0.00087747,0.54495853,0.20825352,0.026152577,0.2169578,0.0006535256],"about_ca_topic_score_codex":0.00009045205,"about_ca_topic_score_gemma":0.00003363058,"teacher_disagreement_score":0.69727266,"about_ca_system_score_codex":0.000032002525,"about_ca_system_score_gemma":0.000008898651,"threshold_uncertainty_score":0.40319422},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124289535,0.00006372513,0.8051083,0.000015282934,0.00016742677,0.00037424604,0.000004805018,0.0018704366,0.06810624],"genre_scores_gemma":[0.92431587,0.000011483328,0.075348124,0.000079671445,0.00006217978,0.00001059173,0.0000037043771,0.000057951238,0.000110423345],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922067,0.000010666668,0.00015923662,0.00019768569,0.000098038865,0.0003136942],"domain_scores_gemma":[0.9994621,0.00006746969,0.00003401834,0.00025839062,0.00010801544,0.00006997578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005762037,0.00018952439,0.00022145186,0.00007747293,0.00009617865,0.000041369007,0.000111449765,0.0000691972,0.000033495842],"category_scores_gemma":[0.0000057591083,0.00015897506,0.000047332134,0.000107766464,0.000052202635,0.00015333125,0.000029497081,0.000101045196,0.000010302773],"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.0009886313,0.0002793907,0.0029941865,0.0006391511,0.0013702633,0.0004630559,0.0063789682,0.012791402,0.5985573,0.034100004,0.09217075,0.24926692],"study_design_scores_gemma":[0.0004045312,0.00009279882,0.00025540238,0.00025298228,0.00003818132,0.00005414247,0.0001788279,0.23360898,0.7623286,0.0010226457,0.001391468,0.00037140955],"about_ca_topic_score_codex":0.000085415086,"about_ca_topic_score_gemma":0.000043182645,"teacher_disagreement_score":0.80002636,"about_ca_system_score_codex":0.00002892282,"about_ca_system_score_gemma":0.000009776422,"threshold_uncertainty_score":0.64828146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000031952437,0.0010631084,0.9925906,0.0000625619,0.0014382728,0.0012177775,0.00004955072,0.003121834,0.00042435183],"genre_scores_gemma":[0.00036230544,0.00051493547,0.9962417,0.00017464993,0.0003737672,0.0004422501,0.0015653834,0.00023300978,0.00009202774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710554,0.00096481486,0.0007189937,0.0006623805,0.00017109132,0.00037719775],"domain_scores_gemma":[0.99703354,0.001131601,0.00031980406,0.0008244444,0.0005638808,0.00012671889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131417,0.00056622445,0.000771329,0.0003416247,0.00018849105,0.00021450622,0.0004076559,0.00075963285,0.00010652106],"category_scores_gemma":[0.0008537099,0.0006345143,0.0003419416,0.00023688066,0.000048971964,0.00014637188,0.00021843694,0.0004796984,0.0000034894585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002178785,0.000016292775,0.000007430539,0.00022991018,0.000087815824,3.563497e-7,0.000085229236,0.85551935,0.0005204073,0.000060381808,0.004025195,0.13942581],"study_design_scores_gemma":[0.00032432508,0.000034398738,0.000015795124,0.0002918908,0.00023567505,0.0000061245664,0.000007074763,0.9556706,0.024878431,0.0078842975,0.010003632,0.0006477725],"about_ca_topic_score_codex":0.000006916818,"about_ca_topic_score_gemma":7.7076385e-7,"teacher_disagreement_score":0.13877805,"about_ca_system_score_codex":0.0001657584,"about_ca_system_score_gemma":0.00005930028,"threshold_uncertainty_score":0.9996106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.501038,0.000050684986,0.494467,0.00009531977,0.0001485301,0.00022110861,0.0000035150265,0.00035364847,0.0036222122],"genre_scores_gemma":[0.9981142,0.0000028379059,0.0017396493,0.00006766357,0.0000107635615,0.000015418505,3.6598763e-8,0.000022191569,0.00002719907],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943304,0.000027209393,0.00015604844,0.0000957548,0.0001563303,0.00013160551],"domain_scores_gemma":[0.9996115,0.000026526657,0.000033936474,0.00025492653,0.00005443399,0.000018669012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006078405,0.00012416604,0.00010901877,0.000039189752,0.0001907906,0.000034232315,0.0002048711,0.00005119359,0.000054527085],"category_scores_gemma":[0.000007587988,0.000065372515,0.00006882385,0.00013078605,0.00016326431,0.00011550479,0.00000167607,0.00030239622,0.000004383234],"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.00032282487,0.00052394584,0.000051676696,0.0010607505,0.00031271364,0.000012675922,0.018807784,0.022860723,0.8426936,0.0017855042,0.0007196965,0.11084809],"study_design_scores_gemma":[0.000057469486,0.000016373797,0.000100135665,0.00029133668,0.000021400949,0.000008053595,0.00011126349,0.08084882,0.9129818,0.0054689017,0.000003692704,0.00009073886],"about_ca_topic_score_codex":0.000008487674,"about_ca_topic_score_gemma":0.0000037408233,"teacher_disagreement_score":0.49707624,"about_ca_system_score_codex":0.000019520845,"about_ca_system_score_gemma":0.000015979444,"threshold_uncertainty_score":0.26658136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6302968,0.0005528486,0.35939562,0.0000073331994,0.0005415672,0.00041585576,0.00006343753,0.0012831776,0.007443334],"genre_scores_gemma":[0.6706542,0.000071411436,0.32863706,0.0000752732,0.00020294821,0.000013260568,0.00005731779,0.00013003414,0.00015851996],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973164,0.00015683453,0.00077818753,0.0005368828,0.000637162,0.00057448854],"domain_scores_gemma":[0.9981314,0.00007071997,0.00016470549,0.0010892886,0.0003277559,0.00021611864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039581538,0.0005168879,0.00072493596,0.0003046245,0.000106107844,0.00007528389,0.00049104186,0.00031676108,0.00078473904],"category_scores_gemma":[0.00005275836,0.00051889574,0.0002393364,0.00029137178,0.00010266255,0.00057481235,0.00012850243,0.00023868703,0.000051163028],"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.00008658725,0.00019510603,0.00031962007,0.00002295463,0.00035130393,0.000015656486,0.0004147477,0.0028800447,0.9802084,0.00005421108,0.0017761161,0.013675245],"study_design_scores_gemma":[0.0009730222,0.00020528102,0.0018825729,0.00044782378,0.00023755246,0.000018093044,0.0000822201,0.05763026,0.9307754,0.0041177724,0.0026207743,0.0010092234],"about_ca_topic_score_codex":0.0012176089,"about_ca_topic_score_gemma":0.0002994704,"teacher_disagreement_score":0.054750215,"about_ca_system_score_codex":0.00011844252,"about_ca_system_score_gemma":0.000056627476,"threshold_uncertainty_score":0.99972624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055469953,0.00035807764,0.92814773,0.00013295759,0.0063415705,0.0019914655,0.00029681053,0.001366558,0.0058948444],"genre_scores_gemma":[0.9932333,0.00037608712,0.0034550466,0.00004056459,0.00039033906,0.00026429418,0.00004784728,0.00012827161,0.0020642057],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980125,0.000060805447,0.00055407744,0.00061539747,0.00026928354,0.00048792627],"domain_scores_gemma":[0.9981263,0.00019345598,0.000096188036,0.001219921,0.00013471696,0.00022936707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028275864,0.00041659633,0.00045046635,0.00022644026,0.00029366495,0.00022754521,0.00043021177,0.00034108973,0.000029888504],"category_scores_gemma":[0.000011010282,0.00042447133,0.00011961376,0.00020935912,0.000179871,0.00014550767,0.000008130252,0.0006238074,0.000028861557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009232045,0.001572885,0.00012553154,0.0011485385,0.0026937095,0.00006317143,0.0027790933,0.31837925,0.32124063,0.0048351623,0.21188033,0.1343585],"study_design_scores_gemma":[0.0021573815,0.00025439798,0.000055368553,0.000242287,0.0003873444,0.00017319561,0.00020920401,0.8098303,0.044658188,0.00028595998,0.14076695,0.0009794378],"about_ca_topic_score_codex":0.00016412328,"about_ca_topic_score_gemma":0.0003807997,"teacher_disagreement_score":0.9377634,"about_ca_system_score_codex":0.000040447732,"about_ca_system_score_gemma":0.0000370287,"threshold_uncertainty_score":0.9998207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2797655,0.00045704911,0.71509343,0.002365625,0.00018988758,0.0009746583,0.000050630606,0.0008515678,0.00025165855],"genre_scores_gemma":[0.78764236,0.00003530732,0.211653,0.00031104035,0.00003244911,0.00022633087,0.00006613467,0.000029280622,0.0000040976265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945235,0.000028115766,0.000146054,0.00015638069,0.00006260556,0.00015447199],"domain_scores_gemma":[0.99806654,0.00018969818,0.000034166947,0.0016195965,0.000053376225,0.000036592737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069553054,0.00011334356,0.00010868688,0.0000744719,0.00017474347,0.000083845654,0.0007121985,0.00003607146,0.000003554276],"category_scores_gemma":[0.000012677056,0.00011761512,0.000024037046,0.00008272894,0.000108245855,0.00010242717,0.00013786464,0.00012770468,0.000006245462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096119375,0.00014611892,0.00018533888,0.0000791173,0.00018387845,0.0000015121391,0.00071368634,0.4665899,0.4129367,0.00012187815,0.07455397,0.044478316],"study_design_scores_gemma":[0.00016906588,0.000009626023,0.00018828158,0.00004837315,0.000015663632,0.0000030625374,0.000038880822,0.9834263,0.011021159,0.000011420852,0.0049274946,0.00014068089],"about_ca_topic_score_codex":0.00010273174,"about_ca_topic_score_gemma":0.0000062398526,"teacher_disagreement_score":0.5168364,"about_ca_system_score_codex":0.000028043745,"about_ca_system_score_gemma":0.000007976466,"threshold_uncertainty_score":0.47962055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043363467,0.000037541777,0.9508624,0.0009583524,0.00095802546,0.0005745986,0.000105397914,0.0023503571,0.0007898326],"genre_scores_gemma":[0.40225202,0.000040805513,0.5972956,0.000033801607,0.00009136223,0.00009971574,0.00009821657,0.00005509714,0.00003342809],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987461,0.000006464106,0.000422369,0.0002992563,0.00015595272,0.00036985168],"domain_scores_gemma":[0.9989578,0.0000200985,0.00012366707,0.0005846565,0.00023673217,0.00007705648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022958498,0.00023412233,0.00032030462,0.0004815064,0.00013440884,0.000024210787,0.00028300632,0.0007476522,0.0000320063],"category_scores_gemma":[0.00033970966,0.00024155529,0.00010032798,0.0005794922,0.000245835,0.00021678006,0.000089313224,0.0005280015,0.000012516999],"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.0001477575,0.00056082825,0.00078176544,0.00044748845,0.00025281328,0.000038910115,0.00012944362,0.105421774,0.45603302,0.36136377,0.025472408,0.049350034],"study_design_scores_gemma":[0.00037908112,0.000068593276,0.000009955005,0.00006146676,0.0000528418,0.00004148942,0.000029579342,0.48684594,0.3621717,0.011819643,0.13823034,0.00028935983],"about_ca_topic_score_codex":0.000002066271,"about_ca_topic_score_gemma":0.00001752932,"teacher_disagreement_score":0.38142416,"about_ca_system_score_codex":0.000037878766,"about_ca_system_score_gemma":0.000046979298,"threshold_uncertainty_score":0.98503387},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14317134,0.000037337697,0.81842077,0.00018216616,0.00008659811,0.00015090071,2.3393932e-7,0.0025929115,0.035357777],"genre_scores_gemma":[0.9881854,0.000008368368,0.01159415,0.000067606554,0.000051493433,0.0000013723308,0.000011599077,0.000007887598,0.000072145565],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996388,0.000009297246,0.000093269824,0.00009234432,0.00006843885,0.0000978676],"domain_scores_gemma":[0.99977994,0.0000047500316,0.000016193953,0.00015063268,0.0000248981,0.00002358281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050414463,0.00006577865,0.000059487156,0.000041033225,0.000039721534,0.000023431998,0.0000581104,0.00005033029,0.000010804237],"category_scores_gemma":[0.000005518101,0.000066220935,0.000018761815,0.000103329694,0.0000064021356,0.00010634762,0.0000055205774,0.00005651949,0.000012327258],"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.0000034953516,0.000045420864,0.00076849246,0.000007684798,0.000010977983,0.000003238378,0.00014968128,0.0007715725,0.82534677,0.018293675,0.0030547848,0.15154423],"study_design_scores_gemma":[0.00009291229,0.000047254714,0.055254694,0.00003202311,0.000009825804,0.000008597214,0.000010590461,0.7393753,0.18419346,0.019348076,0.0014252802,0.00020202402],"about_ca_topic_score_codex":0.000002495657,"about_ca_topic_score_gemma":0.0000016071893,"teacher_disagreement_score":0.84501404,"about_ca_system_score_codex":0.00002481096,"about_ca_system_score_gemma":0.0000013940429,"threshold_uncertainty_score":0.27004114},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81846577,0.000085445696,0.17467526,0.0002121551,0.000408544,0.00020571529,0.00001412179,0.00031666484,0.005616336],"genre_scores_gemma":[0.9859188,0.000053087235,0.013687662,0.000108445965,0.00015025261,0.000004463576,0.0000016922203,0.00002774479,0.00004784994],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989365,0.000004078336,0.00027779484,0.00020539378,0.00039622732,0.00018001226],"domain_scores_gemma":[0.9991358,0.00002933951,0.000168339,0.00006113072,0.0005552607,0.000050165185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010252013,0.00020225467,0.00019696554,0.00015444371,0.00018227166,0.00010636564,0.00031684458,0.00010334708,0.000015934465],"category_scores_gemma":[0.0000473743,0.00016940957,0.000054725024,0.00011834822,0.00017779817,0.0002635018,0.000039021015,0.0002502362,0.0000012179493],"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.000115037525,0.0001241392,0.00065563805,0.0003344861,0.00008662356,0.000009138398,0.0008608075,0.12975438,0.8438878,0.0013878787,0.0011643374,0.02161974],"study_design_scores_gemma":[0.0001480607,0.000029698593,0.00021428415,0.0005762606,0.00002190805,0.000034314762,0.000115805575,0.81738466,0.17720738,0.0040947124,0.000011558793,0.00016133691],"about_ca_topic_score_codex":0.00001321879,"about_ca_topic_score_gemma":3.111226e-7,"teacher_disagreement_score":0.6876303,"about_ca_system_score_codex":0.000057613743,"about_ca_system_score_gemma":0.000052817904,"threshold_uncertainty_score":0.69083214},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081559345,0.00016462554,0.9147062,0.000004415807,0.000096511874,0.00033920686,0.0000030264428,0.00056213693,0.0025645678],"genre_scores_gemma":[0.34856486,0.0000066223847,0.6512628,0.000042317413,0.000043861404,0.000004597674,0.0000042111255,0.000030486204,0.000040219365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993132,0.00003071329,0.0001919878,0.00018693834,0.00006271259,0.00021444693],"domain_scores_gemma":[0.99955505,0.00010115239,0.000051018727,0.0001283748,0.00011655537,0.00004782034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013621069,0.00015134618,0.0001875915,0.000088178655,0.00008853429,0.00004530338,0.000043531694,0.00009894055,0.000050820723],"category_scores_gemma":[0.000018543835,0.00015090808,0.00004094782,0.00008623678,0.00002814224,0.0001813182,0.00002880176,0.00010028407,9.298738e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116468014,0.000038652743,0.00011713578,0.00015330616,0.00028992744,0.00002132179,0.001702574,0.0059508076,0.46517512,0.0014255368,0.00115255,0.5238566],"study_design_scores_gemma":[0.00026172533,0.00006444983,0.000085700376,0.00013022636,0.00004127618,0.000053910346,0.00016620153,0.72892374,0.26633692,0.0027554743,0.00092572946,0.00025465986],"about_ca_topic_score_codex":0.000091574504,"about_ca_topic_score_gemma":0.000029670338,"teacher_disagreement_score":0.7229729,"about_ca_system_score_codex":0.000027078608,"about_ca_system_score_gemma":0.000010516931,"threshold_uncertainty_score":0.61538523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65822244,0.00016829441,0.0320886,0.000024112418,0.00025238836,0.00014251065,0.0000012316692,0.0033288954,0.30577153],"genre_scores_gemma":[0.9926972,0.000005529582,0.0069980375,0.00012467099,0.000058598835,0.0000057474367,0.0000026259845,0.000019078727,0.000088529756],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955857,0.000008086087,0.00010151676,0.000052987725,0.00007413232,0.00020467988],"domain_scores_gemma":[0.9997643,0.000026619766,0.000011383242,0.00013638691,0.000010780083,0.000050522314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007362503,0.0000820615,0.00008156245,0.00005697956,0.000023400798,0.000012500475,0.00005186596,0.00004017886,0.00015744501],"category_scores_gemma":[0.0000075718135,0.000070609225,0.000031920357,0.00007647572,0.000008032172,0.00007573811,0.0000099766585,0.000076508746,0.00006898215],"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.000013319703,0.00022261679,0.0064587747,0.00005945471,0.00020154468,0.0000139481535,0.0011128769,0.0055538868,0.6731395,0.06394726,0.16555849,0.08371833],"study_design_scores_gemma":[0.00008062936,0.000024704992,0.0011901649,0.000036387675,0.000009052078,0.0000074473755,0.000055593697,0.023736788,0.9683402,0.0022457514,0.004045325,0.00022792885],"about_ca_topic_score_codex":0.0000040781338,"about_ca_topic_score_gemma":2.864381e-7,"teacher_disagreement_score":0.33447477,"about_ca_system_score_codex":0.000008316504,"about_ca_system_score_gemma":0.0000011616135,"threshold_uncertainty_score":0.28793606},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39830115,0.00061741465,0.5909737,0.000074789285,0.00009564369,0.00023162183,0.000021970602,0.0009028151,0.00878088],"genre_scores_gemma":[0.978315,0.00014451287,0.02134504,0.00001990093,0.000023412771,0.0000012055226,0.00004710504,0.000013164948,0.00009068706],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958163,0.000012935888,0.00013646403,0.00010811597,0.00008507507,0.0000757576],"domain_scores_gemma":[0.9994761,0.000036363264,0.000018975668,0.00041394006,0.000031456595,0.000023167495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060751823,0.00006970535,0.00013930791,0.00005207724,0.00003055453,0.000007592314,0.00013774257,0.0000371846,0.000017267277],"category_scores_gemma":[0.00002138483,0.00006433841,0.000011997823,0.00007901266,0.000051226067,0.00013346146,0.00008190123,0.00003839258,0.0000011676947],"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.00025193396,0.00013995024,0.008841927,0.0002024831,0.00046824355,0.00006931873,0.0012648319,0.0031180414,0.7710477,0.026241954,0.14073399,0.047619604],"study_design_scores_gemma":[0.0035035976,0.00010950395,0.034544304,0.00014274825,0.00007777475,0.0002702309,0.000050289167,0.613143,0.3133546,0.01198931,0.022098865,0.00071573985],"about_ca_topic_score_codex":0.000040517185,"about_ca_topic_score_gemma":0.000007249362,"teacher_disagreement_score":0.610025,"about_ca_system_score_codex":0.000004020451,"about_ca_system_score_gemma":0.000005400904,"threshold_uncertainty_score":0.26236442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08273065,0.000032291995,0.9111983,0.0000031062134,0.000026045498,0.0005689012,0.000003268144,0.0014723464,0.0039651],"genre_scores_gemma":[0.6042292,7.639287e-7,0.39557263,0.0000077116065,0.000019137377,0.00010538468,0.000026857313,0.000026678425,0.00001160294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989342,0.00002265105,0.00030063232,0.00022783488,0.00015280882,0.00036183704],"domain_scores_gemma":[0.9993447,0.000033014898,0.000038994353,0.00039897452,0.0000452801,0.00013905486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022578295,0.00019174129,0.00033266473,0.00015598566,0.00007069819,0.000059175647,0.00021595965,0.00008745135,0.0000413603],"category_scores_gemma":[0.00001491823,0.00016996318,0.00019258863,0.00029623887,0.00005121251,0.00008763035,0.000028188628,0.0001053583,0.000008367472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005458124,0.014501623,0.005715102,0.0041566696,0.016043184,0.0001829579,0.03434009,0.035764392,0.048525628,0.28982434,0.0016579679,0.54874223],"study_design_scores_gemma":[0.00023933241,0.000116058145,0.00029105874,0.00003014716,0.00061060564,0.0000070042356,0.00023795367,0.9810743,0.011344727,0.004936017,0.0007590931,0.0003537409],"about_ca_topic_score_codex":0.000009650616,"about_ca_topic_score_gemma":0.0000031481889,"teacher_disagreement_score":0.9453099,"about_ca_system_score_codex":0.000028649887,"about_ca_system_score_gemma":0.0000036000738,"threshold_uncertainty_score":0.6930897},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4933415,0.00014347481,0.44088423,0.00018940835,0.0003763814,0.0006917218,0.000019364697,0.0036680328,0.060685877],"genre_scores_gemma":[0.96467656,0.00007657714,0.034770392,0.000059233545,0.000072617826,0.000016457807,0.000027812257,0.00003257835,0.00026776193],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935263,0.000020271347,0.00016771487,0.00016761744,0.00010455904,0.0001872278],"domain_scores_gemma":[0.9996111,0.00003463383,0.000027173483,0.00021754876,0.000050307197,0.000059234975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003882137,0.00014897039,0.00014283533,0.000058853082,0.00006892926,0.000022793174,0.000086445696,0.00005257227,0.000105175815],"category_scores_gemma":[0.000033337456,0.00015031401,0.000041360254,0.00011533089,0.000101201986,0.00015926987,0.000022240529,0.00011899772,0.000059793387],"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.0000207325,0.000036125108,0.00005468914,0.000028706987,0.00004370002,0.00018764901,0.00054803625,0.002840853,0.6637385,0.0005275215,0.33094394,0.0010295628],"study_design_scores_gemma":[0.0005423566,0.0001722251,0.00014167516,0.00011564031,0.000029209985,0.0003674258,0.00010662209,0.19381376,0.7872194,0.0037935784,0.01298949,0.00070860184],"about_ca_topic_score_codex":0.00005100191,"about_ca_topic_score_gemma":0.000018545827,"teacher_disagreement_score":0.47133505,"about_ca_system_score_codex":0.00007824179,"about_ca_system_score_gemma":0.00001450919,"threshold_uncertainty_score":0.6129627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8979657,0.00006683904,0.09546674,0.00021909937,0.00016911127,0.0007543363,0.00000650858,0.00038814405,0.004963466],"genre_scores_gemma":[0.9914308,0.000010072306,0.0084068375,0.00006113096,0.00003009499,0.000010317548,0.000002719546,0.000015520689,0.000032460805],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994547,0.000032983782,0.00017572792,0.00011090772,0.00007624029,0.00014947374],"domain_scores_gemma":[0.99944526,0.00020149379,0.000063485786,0.0001677555,0.00009399595,0.000027982662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111926835,0.0001029095,0.00013665723,0.000034571294,0.000073807685,0.00002659009,0.000074611096,0.000045881367,0.000039177652],"category_scores_gemma":[0.000032844644,0.00007287303,0.000055672353,0.000053406988,0.000039827853,0.000064538726,0.00001688015,0.0000858475,0.0000052541777],"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.0000075349844,0.000025808638,0.00011063917,0.000034461573,0.000081949795,4.7844657e-7,0.00029783527,0.0021412,0.81009835,0.00069734023,0.05440162,0.13210279],"study_design_scores_gemma":[0.000055636374,0.00003474172,0.000033644952,0.0001108286,0.000007027654,0.000005096547,0.00008669022,0.3438593,0.6524107,0.003139401,0.00018293204,0.00007401586],"about_ca_topic_score_codex":0.00006161175,"about_ca_topic_score_gemma":0.0000026060898,"teacher_disagreement_score":0.34171808,"about_ca_system_score_codex":0.000020508644,"about_ca_system_score_gemma":0.0000029870428,"threshold_uncertainty_score":0.2971676},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11905248,0.0004786177,0.87713635,0.000015185292,0.00084556005,0.0006121672,0.000044844783,0.0015422651,0.000272526],"genre_scores_gemma":[0.996758,0.00006725709,0.0029426748,0.000044269917,0.00004709746,0.00005258537,0.00000167619,0.00007167533,0.000014752283],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987487,0.000046938887,0.00036424288,0.0003603737,0.000098642005,0.0003810609],"domain_scores_gemma":[0.99923396,0.00009005388,0.00008729022,0.00037570143,0.00014350415,0.000069481124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001469176,0.0002851866,0.0004133399,0.00053093303,0.0002604578,0.000047654758,0.00013183393,0.0003638419,0.0000065672466],"category_scores_gemma":[0.000004046612,0.0002986836,0.00009307105,0.000283341,0.00013050994,0.00015743656,0.000002312047,0.00030460092,0.0000058551805],"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.00019317231,0.00026186256,0.00003150663,0.0004008791,0.000922847,0.00011511236,0.0012060638,0.064146176,0.829942,0.0047917124,0.00061036734,0.09737834],"study_design_scores_gemma":[0.0008932188,0.00037826085,0.000023429166,0.0005683939,0.00016360576,0.000309302,0.0005296438,0.5417124,0.4466956,0.0072997827,0.0008190064,0.0006073361],"about_ca_topic_score_codex":0.0001369521,"about_ca_topic_score_gemma":0.000014724548,"teacher_disagreement_score":0.8777055,"about_ca_system_score_codex":0.000085749045,"about_ca_system_score_gemma":0.000015895439,"threshold_uncertainty_score":0.99994653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15753564,0.022809952,0.81214887,0.00037281748,0.0009968984,0.001019816,0.000020401205,0.00054099684,0.0045546116],"genre_scores_gemma":[0.97679806,0.003384565,0.019183746,0.0001400612,0.00038490462,0.000026757994,0.000010205847,0.00006391748,0.0000077874065],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989421,0.000099879464,0.00033006046,0.00012099685,0.0001178389,0.00038917403],"domain_scores_gemma":[0.9984255,0.0006865898,0.00016043738,0.0004245121,0.00014949823,0.00015350815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039639298,0.0002236266,0.00027608968,0.00014673696,0.0006227268,0.00012750803,0.0002647624,0.000108191314,0.0000022796012],"category_scores_gemma":[0.000019681529,0.00021472496,0.00009142244,0.000158556,0.00011187693,0.00020537387,0.00009893808,0.0005947404,0.0000010442977],"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.00029770008,0.00048059833,0.0014972471,0.00005558883,0.00084561587,0.000014824216,0.0051827733,0.0017666837,0.5136799,0.004428428,0.005446199,0.46630445],"study_design_scores_gemma":[0.007370464,0.0012451288,0.0061127963,0.019929314,0.00087455084,0.009118564,0.0028423457,0.36824363,0.41241682,0.0030187725,0.16392747,0.0049001235],"about_ca_topic_score_codex":0.0000027876001,"about_ca_topic_score_gemma":0.0000018338819,"teacher_disagreement_score":0.8192624,"about_ca_system_score_codex":0.000057420573,"about_ca_system_score_gemma":0.0000138244495,"threshold_uncertainty_score":0.875623},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113705374,0.00054337905,0.8485052,0.000035387377,0.0010532347,0.00034439977,0.0000010620125,0.0046607875,0.031151164],"genre_scores_gemma":[0.99926084,0.000009251886,0.00035633624,0.00011384224,0.00012888499,0.000024660512,0.000022830065,0.000021110032,0.00006221567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990071,0.000043769123,0.00042709586,0.000078370285,0.00021118321,0.00023244659],"domain_scores_gemma":[0.99948126,0.00002786109,0.00014484036,0.00013686113,0.00014773473,0.00006141721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017914655,0.00016580215,0.00020883867,0.00012776302,0.00015374794,0.00033695556,0.00013630201,0.00009821476,0.000008160293],"category_scores_gemma":[0.000034904504,0.00015571114,0.0000384041,0.00016363723,0.000024049952,0.0014746902,0.000021025638,0.00021456456,0.00009460228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016355914,0.000007354819,0.0005509456,0.0005725267,0.000025598389,0.000001657613,0.0021381346,0.64811486,0.007866947,0.0004685887,0.001387825,0.3388492],"study_design_scores_gemma":[0.00019136007,0.000024387646,0.00013817512,0.00010552311,0.0000071755335,0.000042367792,0.00010645065,0.9615414,0.0038330609,0.00003714442,0.03378402,0.00018894134],"about_ca_topic_score_codex":0.000022693946,"about_ca_topic_score_gemma":6.606651e-7,"teacher_disagreement_score":0.8855555,"about_ca_system_score_codex":0.000035896115,"about_ca_system_score_gemma":0.0000060174852,"threshold_uncertainty_score":0.63497156},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6949921,0.00008941927,0.30131528,0.00003673913,0.00012798018,0.00022051539,0.00001299916,0.0011630432,0.002041906],"genre_scores_gemma":[0.9829214,0.0000472475,0.016542211,0.00012179747,0.000104194754,0.000024008117,0.000013311433,0.00010699617,0.00011882997],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982979,0.00003722555,0.00046758223,0.00033499024,0.0003547314,0.0005075321],"domain_scores_gemma":[0.9990856,0.00007681999,0.00010819849,0.00048699343,0.00010130492,0.00014109483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017706455,0.00037222577,0.0005166628,0.00031852123,0.00012978174,0.00005134201,0.00027861175,0.0001534625,0.000080816055],"category_scores_gemma":[0.00002478147,0.00036965494,0.00022424526,0.00024616346,0.00010494461,0.00020715779,0.0001142061,0.00026884372,0.000018876002],"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.00007006607,0.00017891427,0.00008519275,0.00013864014,0.00013732939,0.00020356503,0.0017355636,0.1283505,0.8619169,0.00007197606,0.006175409,0.00093596865],"study_design_scores_gemma":[0.0004826586,0.000044134744,0.00022941081,0.00015361386,0.000024250143,0.00005261571,0.00014456545,0.39820078,0.60014915,0.00014926397,0.000042042375,0.00032750532],"about_ca_topic_score_codex":0.00028462967,"about_ca_topic_score_gemma":0.000031900083,"teacher_disagreement_score":0.28792927,"about_ca_system_score_codex":0.00007408521,"about_ca_system_score_gemma":0.000033114844,"threshold_uncertainty_score":0.99987555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22811705,0.00001178452,0.7686942,0.000056395213,0.000020449343,0.00018290282,0.000006980088,0.00017047983,0.0027397606],"genre_scores_gemma":[0.63293844,0.000005113183,0.3669798,0.000006424919,0.000008313173,0.0000062673857,0.000036939033,0.000007826175,0.0000108865515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995443,0.000007669395,0.00018803556,0.00006507115,0.00012296693,0.00007191016],"domain_scores_gemma":[0.99942803,0.00014277232,0.000063127874,0.00008660428,0.0002505583,0.000028909993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000024578521,0.000083274834,0.000117911084,0.000091353606,0.000053489923,0.00004091904,0.00005218987,0.000029943778,0.00012258776],"category_scores_gemma":[0.00002386826,0.000078047124,0.000012617473,0.00013345234,0.00012736193,0.00016765713,0.000015905673,0.00004478286,0.000007440958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016724031,0.000040538678,0.00013568389,0.00003810522,0.000041920404,4.908037e-7,0.00014424554,0.9869604,0.00024465306,0.01088406,0.0004068625,0.0011013541],"study_design_scores_gemma":[0.00021309656,0.00003463976,0.0031431087,0.00006846575,0.000020893782,0.000027110591,0.000061557075,0.977426,0.0006214405,0.018245785,0.000029090346,0.00010881672],"about_ca_topic_score_codex":0.000006593781,"about_ca_topic_score_gemma":0.0000013955008,"teacher_disagreement_score":0.4048214,"about_ca_system_score_codex":0.000011159101,"about_ca_system_score_gemma":0.00001915933,"threshold_uncertainty_score":0.31826693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28408474,0.000077872384,0.7072428,0.000023314275,0.0003445989,0.00013366921,6.981389e-7,0.0015368565,0.006555476],"genre_scores_gemma":[0.97889286,0.0000073344245,0.020575844,0.000093012706,0.00014707347,0.000013851148,0.000017047587,0.000029151755,0.00022384754],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994352,0.000027047232,0.00012555429,0.000093955336,0.0001015815,0.00021666153],"domain_scores_gemma":[0.9997233,0.000024135365,0.000019806466,0.00013446319,0.00004574539,0.000052527306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081535676,0.000113248534,0.00009251479,0.000095460986,0.000044569322,0.000036637004,0.00004781733,0.00009692697,0.000063082356],"category_scores_gemma":[0.000014396553,0.000111020054,0.00004768565,0.00015811759,0.000011481423,0.00029882442,0.00000724715,0.00008222985,0.000026913667],"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.00005613226,0.00027629986,0.01863814,0.00008632948,0.00015244573,0.0000020204131,0.0004230412,0.030215926,0.8491816,0.0071873167,0.05055781,0.043222923],"study_design_scores_gemma":[0.0001511617,0.00002558899,0.0035808687,0.000025246558,0.00002925448,0.000005307013,0.0000150876995,0.5021118,0.48933306,0.00042043213,0.0040779295,0.00022425581],"about_ca_topic_score_codex":0.000011326163,"about_ca_topic_score_gemma":0.000005536516,"teacher_disagreement_score":0.6948081,"about_ca_system_score_codex":0.000057804726,"about_ca_system_score_gemma":0.00000504424,"threshold_uncertainty_score":0.45272666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43070975,0.0000149438065,0.5635748,0.000018853512,0.000038940274,0.000086059394,0.000001579035,0.00035715775,0.005197953],"genre_scores_gemma":[0.99232477,0.000012070018,0.0075631742,0.000020734315,0.000008839257,0.000003950973,0.0000031595882,0.000018193956,0.0000450799],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957234,0.0000120063905,0.000108879874,0.000086306674,0.00011149698,0.00010895245],"domain_scores_gemma":[0.9997936,0.000027823287,0.000006729534,0.00012242357,0.000021914699,0.000027495305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004283333,0.00010238769,0.00012384789,0.000062522566,0.000019169465,0.000009084762,0.00002016661,0.000050639926,0.00003261843],"category_scores_gemma":[0.0000022788688,0.00008369893,0.000041283398,0.00009870088,0.000027370734,0.000121798745,0.0000012188651,0.00006914953,0.0000039507704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007483118,0.00006641639,0.00017978366,0.000067149806,0.00019727871,0.000014609045,0.00090917887,0.47873712,0.0126156965,0.000673731,0.0018686176,0.5045956],"study_design_scores_gemma":[0.00017465105,0.00011636493,0.00046039754,0.000033591223,0.000041113282,0.000009486286,0.000018934516,0.80688554,0.1917802,0.00014326154,0.0002053916,0.0001310702],"about_ca_topic_score_codex":0.000032409902,"about_ca_topic_score_gemma":0.00002860844,"teacher_disagreement_score":0.56161505,"about_ca_system_score_codex":0.00001578536,"about_ca_system_score_gemma":0.0000015883703,"threshold_uncertainty_score":0.34131432},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027302248,0.000004187861,0.9584883,0.0000027140836,0.000673751,0.00023595456,0.000054668308,0.00095904944,0.012279166],"genre_scores_gemma":[0.9941567,0.00002137167,0.0054949713,0.0002243721,0.00002431982,0.00003203053,0.000018550849,0.000016603522,0.000011073003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989698,0.00004325372,0.000499806,0.00006555736,0.00018808193,0.0002334785],"domain_scores_gemma":[0.9994062,0.00005571942,0.00011678356,0.00024025331,0.00010710109,0.00007393379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000206864,0.00019218429,0.00016529171,0.0003422495,0.00017056867,0.000080350284,0.00014534108,0.00011878362,0.00061025814],"category_scores_gemma":[0.000006259482,0.0002021983,0.00009559884,0.00017325777,0.000042878506,0.0032295636,0.0000017733075,0.00022036333,0.00026137795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049718353,0.00007820983,0.000008320499,0.00011127982,0.00026390972,0.0000032485157,0.013326153,0.7778143,0.0075490596,0.0035433485,0.0011636617,0.1956413],"study_design_scores_gemma":[0.0006909352,0.00013756785,0.00008494694,0.00012278938,0.00007760739,0.000040909166,0.0006827273,0.24075295,0.7472233,0.0033185764,0.006297372,0.0005703306],"about_ca_topic_score_codex":0.00002926505,"about_ca_topic_score_gemma":0.0000012133717,"teacher_disagreement_score":0.96685445,"about_ca_system_score_codex":0.000087610875,"about_ca_system_score_gemma":0.000027263824,"threshold_uncertainty_score":0.82454073},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8724423,0.00014569801,0.12506203,0.000010845133,0.00006195078,0.00008743812,8.9607437e-7,0.0010639946,0.0011248342],"genre_scores_gemma":[0.94739145,0.0000010680357,0.05233874,0.000070975686,0.00014467721,0.0000012592319,0.0000032199769,0.000032195127,0.000016387603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993711,0.000023925739,0.0001355065,0.0001390257,0.00007259767,0.00025782528],"domain_scores_gemma":[0.9996946,0.000031460728,0.000019195699,0.00017963865,0.000025702939,0.000049397506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006264015,0.00013454117,0.00012468807,0.00004473165,0.00009445289,0.0000815199,0.000064955624,0.000055617274,0.00002189166],"category_scores_gemma":[0.00000374439,0.00013149901,0.00002302442,0.00013824247,0.000021694812,0.00012071478,0.000017789007,0.00009829481,0.0000015149562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003455643,0.0000062946706,0.0014606436,0.0000069954776,0.0000040617933,0.0000067603064,0.000009586731,0.92785305,0.06850635,0.000043151726,0.00034363428,0.0017560261],"study_design_scores_gemma":[0.00010993601,0.000024089168,0.0010104568,0.00003451032,0.000008428915,0.0000072499297,0.000015574617,0.8771242,0.12114349,0.00023003966,0.0001364105,0.00015560066],"about_ca_topic_score_codex":0.00048580416,"about_ca_topic_score_gemma":0.00009860519,"teacher_disagreement_score":0.07494917,"about_ca_system_score_codex":0.000018929622,"about_ca_system_score_gemma":0.000006347549,"threshold_uncertainty_score":0.53623736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012989252,0.000458848,0.9519291,0.00025657256,0.0011112493,0.0025966621,0.00019939618,0.0028132927,0.027645651],"genre_scores_gemma":[0.39179915,0.0005065067,0.59927136,0.0005153767,0.00091796054,0.00034006394,0.001206509,0.0005632206,0.004879835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932439,0.00028219755,0.0021087306,0.0015472115,0.0013411805,0.0014768038],"domain_scores_gemma":[0.99452233,0.00071669085,0.00078617595,0.0024698235,0.0008547087,0.0006502434],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0008088506,0.0013972784,0.0015778339,0.0010490286,0.00035962387,0.00030256147,0.0010694606,0.00084974285,0.0017646397],"category_scores_gemma":[0.0005284747,0.001395322,0.0008171585,0.0012929116,0.00022862601,0.0010906948,0.0002590378,0.00055576756,0.00018979576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009342042,0.0005061713,0.0003841472,0.0003318872,0.0007073002,0.000033130003,0.0015855738,0.66533697,0.22439452,0.00374464,0.08555357,0.016487906],"study_design_scores_gemma":[0.004089779,0.00096507184,0.00084308995,0.0010185706,0.0006652588,0.00004860806,0.00010971655,0.6507275,0.2779373,0.0037604447,0.056956,0.0028786275],"about_ca_topic_score_codex":0.00043050395,"about_ca_topic_score_gemma":0.0003594529,"teacher_disagreement_score":0.3788099,"about_ca_system_score_codex":0.00031603695,"about_ca_system_score_gemma":0.00022709642,"threshold_uncertainty_score":0.99987775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4235663,0.00012674306,0.5605286,0.00002796222,0.00009692586,0.00014635379,7.947034e-7,0.00072970265,0.0147766275],"genre_scores_gemma":[0.98046255,0.00012776609,0.019091856,0.00009697402,0.000072018476,0.0000013264556,0.0000029164355,0.000033750428,0.0001108211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992883,0.00002470239,0.00020190472,0.00013535353,0.00013328664,0.00021640284],"domain_scores_gemma":[0.9993611,0.00018772665,0.000038030197,0.0002879263,0.000074811775,0.000050421007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004166728,0.00016469987,0.0003092598,0.000059705937,0.000055656372,0.000010259706,0.00008536947,0.00009089775,0.000030353676],"category_scores_gemma":[0.000006208075,0.00013311773,0.000055717923,0.00013405347,0.00006139665,0.000055689634,0.000022319702,0.000158989,0.0000018550244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014030973,0.00013842697,0.004939587,0.00015279965,0.00075699674,0.0008764029,0.00089841057,0.70412153,0.17072599,0.00033940148,0.07474391,0.04090345],"study_design_scores_gemma":[0.0009607882,0.00006862901,0.00031194146,0.00013998289,0.00002237036,0.00013587804,0.000035776375,0.6511077,0.34647763,0.000017522656,0.0004721044,0.00024963738],"about_ca_topic_score_codex":0.00009157052,"about_ca_topic_score_gemma":0.000016358248,"teacher_disagreement_score":0.55689627,"about_ca_system_score_codex":0.000009578977,"about_ca_system_score_gemma":0.000007965134,"threshold_uncertainty_score":0.54283834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42681998,0.00002225789,0.5115688,0.000013212584,0.000047549554,0.00028867743,8.285775e-7,0.0009139611,0.060324747],"genre_scores_gemma":[0.7281096,7.6516255e-7,0.27166715,0.00010845586,0.00006371055,0.0000015126033,0.0000011968413,0.00003657744,0.00001104664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888146,0.00017365867,0.00025173248,0.00022404583,0.00018586771,0.00028324605],"domain_scores_gemma":[0.99830484,0.0007885205,0.00007816934,0.00063051155,0.00013436352,0.000063562235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005489548,0.00021979722,0.0002686332,0.00004579691,0.00010254381,0.000023303763,0.00017359908,0.000074990254,0.000010153373],"category_scores_gemma":[0.000108626184,0.0001375538,0.00005119326,0.00031284118,0.000121069,0.000051847226,0.000034670244,0.0002467364,0.0000011849809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077461277,0.00013633656,0.008565195,0.000111132395,0.00010674543,0.00001740451,0.0009043391,0.94774634,0.01604639,0.002200103,0.0011529532,0.02223846],"study_design_scores_gemma":[0.00025730525,0.000090616704,0.0037756155,0.00031653527,0.000045758752,0.000025940533,0.00014829739,0.95290124,0.040573265,0.0015933865,0.00003182826,0.00024022673],"about_ca_topic_score_codex":0.0005644762,"about_ca_topic_score_gemma":0.0000073859032,"teacher_disagreement_score":0.3012896,"about_ca_system_score_codex":0.000024589765,"about_ca_system_score_gemma":0.000034408862,"threshold_uncertainty_score":0.5609281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054249004,0.00028256633,0.9379282,0.00013878275,0.00009216948,0.0017358067,0.0000028567997,0.0018251,0.0037455256],"genre_scores_gemma":[0.8846297,0.000032043088,0.11507981,0.000042847892,0.000035666995,0.00011644703,0.0000020303203,0.00004328945,0.000018161341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947834,0.000009454603,0.00017123714,0.000103363025,0.000059146852,0.00017848569],"domain_scores_gemma":[0.9996283,0.00012943374,0.000026011217,0.00014826599,0.000029812405,0.000038149283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012507317,0.00010659523,0.000121086654,0.000029102328,0.00008325454,0.000049269085,0.000094184965,0.00006990187,0.000015754149],"category_scores_gemma":[0.000049487848,0.00007330186,0.000035634344,0.00006117276,0.000055059107,0.00005667123,0.000028486751,0.00008898535,0.000005603719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001620364,0.0006014747,0.00036014433,0.0027268243,0.0006100397,0.000027797756,0.027514065,0.00072260236,0.015696708,0.38709778,0.0047524506,0.5597281],"study_design_scores_gemma":[0.0004618214,0.00025461093,0.00017935778,0.000523244,0.00012795858,0.000091009715,0.0005505171,0.86762804,0.0178882,0.08646192,0.025305,0.0005283513],"about_ca_topic_score_codex":0.0000045564757,"about_ca_topic_score_gemma":0.0000029258629,"teacher_disagreement_score":0.8669054,"about_ca_system_score_codex":0.000008942496,"about_ca_system_score_gemma":0.0000025857353,"threshold_uncertainty_score":0.2989163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022927173,0.00011076773,0.9928435,0.000060037582,0.00035790465,0.00023145883,0.00000362654,0.0020232734,0.002076703],"genre_scores_gemma":[0.88091683,0.000027184624,0.11866355,0.00007105312,0.00011530258,0.000023103457,0.00000428117,0.00008738344,0.00009132419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886364,0.00004435122,0.00026804444,0.00029838315,0.00018016348,0.00034542198],"domain_scores_gemma":[0.9993077,0.00020845384,0.00005835848,0.00020290524,0.00013733837,0.00008523656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014402003,0.00025075773,0.00024733623,0.00037334353,0.0005036424,0.00017082923,0.00011664097,0.00011587753,0.000012893792],"category_scores_gemma":[0.000014600261,0.00027578723,0.00012117846,0.00042796996,0.00006318102,0.00031530092,0.0000011658428,0.0004147062,0.000012341473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034638433,0.000046852,0.000003738525,0.00012422386,0.000037948008,0.0000031999905,0.00016214023,0.54552794,0.06799005,0.000004347535,0.0003871333,0.3856778],"study_design_scores_gemma":[0.0002753267,0.000061012848,0.000010609419,0.00016761564,0.000043110547,0.000020086844,0.000037184753,0.7816061,0.2155155,0.0002798484,0.0017343474,0.0002492664],"about_ca_topic_score_codex":0.0000076766755,"about_ca_topic_score_gemma":0.0000026630005,"teacher_disagreement_score":0.8786241,"about_ca_system_score_codex":0.00006723213,"about_ca_system_score_gemma":0.00001843641,"threshold_uncertainty_score":0.9999694},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009145178,0.00030482464,0.9855455,0.00039570616,0.000037945993,0.00024912803,0.0000060846087,0.00023071718,0.0040849196],"genre_scores_gemma":[0.8031166,0.000072465904,0.19654979,0.00007032518,0.000027801427,0.0000868855,0.000047854122,0.000017875085,0.000010366471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993757,0.00009233102,0.00016832085,0.00008619734,0.00013007817,0.00014736029],"domain_scores_gemma":[0.9983131,0.0008148218,0.00006659593,0.00065309124,0.00012172002,0.000030648083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018559337,0.00010755499,0.00009190399,0.000039958075,0.00023380033,0.000025434285,0.0003326748,0.000037813537,4.5008764e-7],"category_scores_gemma":[0.000022481167,0.000088111534,0.000026256295,0.00021942251,0.00010122867,0.00017871238,0.00006481246,0.0002392945,0.000016019016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000690938,0.000060171322,0.00025658842,0.0000015409543,0.000015932892,3.1066506e-8,0.00034701658,0.856724,0.000110411354,0.12968248,0.00031041203,0.01248449],"study_design_scores_gemma":[0.00014385609,0.000010521025,0.0037242984,0.000029368226,0.0000071831682,0.0000015076225,0.000045882407,0.9416613,0.0006803147,0.053064603,0.00052505493,0.00010609203],"about_ca_topic_score_codex":0.000005930827,"about_ca_topic_score_gemma":0.0000070207625,"teacher_disagreement_score":0.7939715,"about_ca_system_score_codex":0.0001219447,"about_ca_system_score_gemma":0.000022989052,"threshold_uncertainty_score":0.3593084},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13966022,0.000060209033,0.833323,0.000014116966,0.00016439222,0.00019126394,0.0000029091939,0.0025762117,0.02400767],"genre_scores_gemma":[0.92274165,0.0000027381514,0.076947875,0.00012072091,0.000058997586,0.000003221083,0.000006278497,0.000057375797,0.00006111547],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990838,0.000020578316,0.00021363312,0.00022183941,0.00010835555,0.0003517566],"domain_scores_gemma":[0.99938387,0.000023123519,0.000036429163,0.0003808055,0.00007837929,0.00009738835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003817252,0.00024662135,0.00022694812,0.00011261429,0.0000669398,0.000034776218,0.00015396834,0.00010772626,0.000068951325],"category_scores_gemma":[0.000005676757,0.00023428755,0.00009227793,0.00011692829,0.00005833809,0.000118495656,0.00003057465,0.0001872355,0.00001756975],"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.000111112895,0.00010968027,0.00022201934,0.000052294734,0.00013242371,0.00011565012,0.00089056685,0.14622681,0.8269748,0.0009323151,0.0036088584,0.020623475],"study_design_scores_gemma":[0.00015421772,0.000026977312,0.00016710297,0.000027623068,0.000014082058,0.0000090205185,0.000020864823,0.63229275,0.36628574,0.0007704426,0.0000280988,0.00020310895],"about_ca_topic_score_codex":0.0001882163,"about_ca_topic_score_gemma":0.00005332679,"teacher_disagreement_score":0.7830815,"about_ca_system_score_codex":0.00003882096,"about_ca_system_score_gemma":0.000017391045,"threshold_uncertainty_score":0.9553969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9275546,0.00006326192,0.06796329,0.000121570076,0.000041853127,0.000097198325,0.000015264928,0.0012823213,0.0028606423],"genre_scores_gemma":[0.98467463,0.0000052200526,0.014863753,0.00013102539,0.000020543539,8.407077e-7,0.00021977567,0.000008355834,0.00007587005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994106,0.000010108518,0.00011560191,0.00017745889,0.0001449884,0.00014123978],"domain_scores_gemma":[0.9993187,0.000015887828,0.000015739233,0.00056640804,0.000035822104,0.000047409772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045496763,0.000111944755,0.00018433732,0.00010327176,0.000028947767,0.000022010736,0.00020012271,0.00003395445,0.00007115791],"category_scores_gemma":[0.0000021821056,0.00008384125,0.00002405538,0.0002659345,0.000016307196,0.00008198359,0.00004368642,0.00007761206,0.000008974144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027322193,0.0006358045,0.0066441866,0.000018561595,0.0064535523,0.00072896696,0.00018495313,0.7377652,0.12474022,0.018090153,0.05665395,0.04781125],"study_design_scores_gemma":[0.00035567474,0.00010068624,0.07990526,0.000022592278,0.00039464596,0.000014339325,0.000007192678,0.8817944,0.035177,0.00015065754,0.001756894,0.00032068495],"about_ca_topic_score_codex":0.00007796957,"about_ca_topic_score_gemma":0.000054253982,"teacher_disagreement_score":0.1440292,"about_ca_system_score_codex":0.00001737519,"about_ca_system_score_gemma":0.0000049939645,"threshold_uncertainty_score":0.34189472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052277714,0.0020050246,0.79987526,0.002563172,0.000118451964,0.0025259121,0.0000931137,0.002438376,0.138103],"genre_scores_gemma":[0.74858075,0.0005304066,0.25045863,0.0001915568,0.000025434014,0.000069748916,0.00006341486,0.000021586124,0.00005844877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.000007619528,0.00020183336,0.00009638553,0.00005866304,0.00010636571],"domain_scores_gemma":[0.99901557,0.00015963314,0.000051255895,0.00069625064,0.000046130288,0.000031187323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005931901,0.0001275325,0.00015819537,0.00007538575,0.00014690925,0.000063024716,0.00022954629,0.000071384646,0.0000032097378],"category_scores_gemma":[0.00001826274,0.0001215183,0.00003086148,0.00009971722,0.00003551873,0.000051560935,0.000027913378,0.00009934573,0.0000052959317],"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.000046552428,0.00053291634,0.0000027757492,0.00013222854,0.00009789452,5.768906e-7,0.0024416703,0.0036673793,0.025998933,0.7925877,0.044406533,0.13008484],"study_design_scores_gemma":[0.0011255903,0.00039851933,0.00017784446,0.00066423335,0.00016290299,0.000016361393,0.0008427805,0.3366609,0.08153596,0.5257154,0.05168048,0.0010190333],"about_ca_topic_score_codex":1.3362794e-7,"about_ca_topic_score_gemma":0.0000013434747,"teacher_disagreement_score":0.69630307,"about_ca_system_score_codex":0.000015532076,"about_ca_system_score_gemma":0.000005518226,"threshold_uncertainty_score":0.49553725},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587093,0.000104882725,0.027589703,0.000024189256,0.000031851738,0.00015944683,0.000006900302,0.00021502531,0.013158672],"genre_scores_gemma":[0.9970511,0.000009824119,0.0027832484,0.000029674311,0.000042689804,0.000007543924,0.000017374894,0.000013574734,0.000044948003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991598,0.000057262576,0.00027161092,0.00013510366,0.00018943833,0.00018674336],"domain_scores_gemma":[0.9996028,0.00007345213,0.000042597163,0.00022872549,0.000037934435,0.00001448775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015546657,0.00013458669,0.0003013327,0.00032103845,0.000024956356,0.000021842137,0.00017981407,0.00006455271,0.000056932404],"category_scores_gemma":[0.000007182001,0.000098815726,0.00015072113,0.00072522316,0.000039324535,0.000068838206,0.000023546996,0.00011069675,0.0000028723555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059801685,0.000223208,0.004173417,0.0000062225818,0.001005332,0.000037598493,0.00045179817,0.9143579,0.07293066,0.002950063,0.0022779158,0.001526061],"study_design_scores_gemma":[0.00045101755,0.00010738619,0.2252751,0.000025993442,0.00056653324,0.000004155801,0.00040277294,0.64310586,0.12915625,0.00040942561,0.00018268016,0.00031284476],"about_ca_topic_score_codex":0.0005775755,"about_ca_topic_score_gemma":0.00021307587,"teacher_disagreement_score":0.27125207,"about_ca_system_score_codex":0.000018803763,"about_ca_system_score_gemma":0.000006732197,"threshold_uncertainty_score":0.4029588},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06133812,0.00038191443,0.92471755,0.00002615538,0.0006041226,0.00021389445,0.0000019580905,0.0017863989,0.010929883],"genre_scores_gemma":[0.91504973,0.00002155661,0.08418507,0.00010447019,0.0005084904,0.0000029482128,0.0000064365863,0.00003906295,0.000082240724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999308,0.000010371979,0.00012485478,0.00008939202,0.00005905613,0.00040831824],"domain_scores_gemma":[0.99962234,0.00006902121,0.000014567386,0.00018435094,0.00002820877,0.000081484766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006514647,0.0001360633,0.0001467312,0.00005373145,0.000054436667,0.000027721946,0.0000578293,0.00007341941,0.000018975159],"category_scores_gemma":[0.000005117115,0.0001286164,0.00008170791,0.000079752164,0.000020148773,0.00009432351,0.000014001452,0.00009436115,0.0000066715434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098894496,0.00014738302,0.0034087815,0.00010524971,0.00053242495,0.000018957635,0.0006634659,0.39346373,0.23727085,0.015161962,0.30542725,0.043701064],"study_design_scores_gemma":[0.00026097646,0.000022816062,0.0008922131,0.0000335442,0.00003395843,0.00002995578,0.000047152826,0.80249,0.18110828,0.00073453883,0.01396844,0.00037812477],"about_ca_topic_score_codex":0.000009885077,"about_ca_topic_score_gemma":0.000003217518,"teacher_disagreement_score":0.8537116,"about_ca_system_score_codex":0.000016201504,"about_ca_system_score_gemma":0.0000016604386,"threshold_uncertainty_score":0.5244824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01628789,0.00039440734,0.8858649,0.000021971611,0.0001782312,0.0002903118,0.0000020907696,0.0021828162,0.09477739],"genre_scores_gemma":[0.8603219,0.0000053176896,0.13875362,0.000038939754,0.0002450225,0.000030991214,0.000024044753,0.00003313514,0.00054706604],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945086,0.0000065404224,0.00013036306,0.000082978135,0.00006074196,0.00026848784],"domain_scores_gemma":[0.99973106,0.000035405617,0.000017770908,0.00012784237,0.00003612119,0.000051796822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001024988,0.00010256642,0.0001131753,0.000051544335,0.0000648096,0.00003861675,0.00007083551,0.00006851539,0.00001967797],"category_scores_gemma":[0.00002312468,0.00009775432,0.00003665168,0.00012458165,0.000009029533,0.00018053524,0.0000145233325,0.000060688748,0.0000036105316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083963445,0.0003134673,0.0021096042,0.00047373137,0.00065700937,0.000005476714,0.018104322,0.07044694,0.32646492,0.16553216,0.118593834,0.29721457],"study_design_scores_gemma":[0.00047355721,0.00003180377,0.00047508552,0.00005754804,0.000046657227,0.000046972746,0.0006022435,0.7966124,0.17146955,0.0016304823,0.027967993,0.0005857117],"about_ca_topic_score_codex":0.0000020282087,"about_ca_topic_score_gemma":1.8650019e-7,"teacher_disagreement_score":0.84403396,"about_ca_system_score_codex":0.000017633447,"about_ca_system_score_gemma":0.0000054799043,"threshold_uncertainty_score":0.39863053},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6245156,0.000024462855,0.07627508,0.00008025016,0.00088224345,0.00016026269,0.0000031434495,0.0035937608,0.2944652],"genre_scores_gemma":[0.9861374,0.000007551765,0.01348321,0.000070325834,0.0000956263,0.00000499151,0.0000019606896,0.000020336414,0.00017857921],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995985,0.0000051807856,0.00008943553,0.00009211505,0.000068281886,0.00014650062],"domain_scores_gemma":[0.9996655,0.00004120696,0.000010344488,0.00020508155,0.00003131996,0.000046572506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034078705,0.00009620033,0.00009800344,0.00004542962,0.00003792784,0.000030377361,0.00011162802,0.000057339123,0.00023695402],"category_scores_gemma":[0.000011162203,0.00008863209,0.00002975626,0.00006821251,0.000032586093,0.00007299756,0.000024263247,0.00021073867,0.000072079776],"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.000002932574,0.000014350069,0.00019479048,0.0000052939345,0.000025132482,0.00001240999,0.0001553997,0.000985962,0.9610353,0.012109674,0.021277279,0.004181438],"study_design_scores_gemma":[0.00012518445,0.000009558608,0.00078556227,0.000015028674,0.0000058936757,0.000009563018,0.00002734885,0.12926723,0.8521104,0.0017229686,0.015733702,0.0001875676],"about_ca_topic_score_codex":0.000019170524,"about_ca_topic_score_gemma":0.00003850194,"teacher_disagreement_score":0.36162186,"about_ca_system_score_codex":0.0000057963266,"about_ca_system_score_gemma":0.0000033933923,"threshold_uncertainty_score":0.36143118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3910875,0.005921311,0.5164348,0.0006551892,0.004477401,0.003853282,0.00027515285,0.0112365205,0.066058844],"genre_scores_gemma":[0.89624226,0.0005100054,0.09134525,0.0010987897,0.0026544349,0.0003147824,0.00036728792,0.00087212864,0.0065950495],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9904349,0.00026374398,0.0021487644,0.0016790911,0.0016125432,0.0038609875],"domain_scores_gemma":[0.99366397,0.0010725739,0.00059317425,0.0026920054,0.00072000304,0.0012582723],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0014814795,0.0021998056,0.00207284,0.0011092075,0.0009657877,0.0007494785,0.0017290732,0.0013707319,0.0017635453],"category_scores_gemma":[0.00040978834,0.0022232889,0.0012602594,0.0011714516,0.00046087266,0.0017736783,0.00064114755,0.0012011639,0.0011384767],"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.00037254763,0.00053154165,0.0010689247,0.00038937927,0.0011761823,0.00003676605,0.0021869352,0.008388384,0.7735953,0.009357017,0.18810454,0.014792484],"study_design_scores_gemma":[0.0028075003,0.00035290705,0.0012721833,0.00075082405,0.0006884675,0.00020626571,0.00018331852,0.010453934,0.12212577,0.003197633,0.8539321,0.0040291203],"about_ca_topic_score_codex":0.0001937822,"about_ca_topic_score_gemma":0.00084157154,"teacher_disagreement_score":0.6658275,"about_ca_system_score_codex":0.00082890614,"about_ca_system_score_gemma":0.00024690863,"threshold_uncertainty_score":0.9999257},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659029,0.00004181647,0.023315137,0.00007996459,0.000101805555,0.00012286965,0.000004226241,0.00013014347,0.010301123],"genre_scores_gemma":[0.9965741,0.0000045079073,0.0032397108,0.0001269216,0.000015307396,9.677284e-7,5.634848e-7,0.000012879068,0.00002501102],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946284,0.00003400971,0.0001763978,0.000106256324,0.00011315678,0.00010732428],"domain_scores_gemma":[0.99933493,0.00025087534,0.00006558643,0.0002600957,0.00006601451,0.000022526445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063114574,0.00011972442,0.00022204887,0.00005284678,0.000038205515,0.000011607356,0.00010770759,0.00005558515,0.00004209638],"category_scores_gemma":[0.000025678984,0.00007897963,0.0000444171,0.00008389543,0.000082282786,0.000026187727,0.00003566368,0.00008159933,5.703738e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017017151,0.00028673446,0.04287374,0.0009981982,0.00047191308,0.000006315712,0.0015625528,0.15006848,0.6992418,0.0037331607,0.023790985,0.076795936],"study_design_scores_gemma":[0.00015094841,0.000045366767,0.013521419,0.0001789565,0.000011460566,0.0000010959129,0.000021840537,0.50573534,0.47955385,0.0004884468,0.00020306354,0.000088199115],"about_ca_topic_score_codex":0.000038141767,"about_ca_topic_score_gemma":0.000065178465,"teacher_disagreement_score":0.35566688,"about_ca_system_score_codex":0.000005365761,"about_ca_system_score_gemma":0.0000055459,"threshold_uncertainty_score":0.3220696},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15784848,0.0017613894,0.7961723,0.00013077307,0.0002921098,0.0006816529,0.000003113094,0.001886276,0.041223872],"genre_scores_gemma":[0.9680767,0.00014270945,0.031624556,0.000055339013,0.000020068952,0.0000030434328,0.0000027847773,0.00001793049,0.000056864494],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999425,0.000026130458,0.00023734773,0.00009856584,0.00008681606,0.00012616007],"domain_scores_gemma":[0.99952334,0.00007433667,0.000041399566,0.00021088702,0.00011810935,0.000031937507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004579173,0.00011527792,0.00021015873,0.000063622574,0.000018367893,0.000031197036,0.00008066539,0.000044840268,0.00023426561],"category_scores_gemma":[0.000017727274,0.00010235602,0.00004889814,0.00008312222,0.000039949005,0.00017911385,0.000028421868,0.000075906064,0.000048918486],"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.0000018423272,0.000011709567,0.000103778686,0.000084107196,0.000040744064,0.0000019643978,0.00013539003,0.00059956947,0.9322496,0.00044533826,0.010774391,0.055551562],"study_design_scores_gemma":[0.000110459034,0.000015143511,0.0012505732,0.00038434129,0.00001244607,0.0000063654884,0.000059049326,0.36254388,0.633438,0.0014058619,0.0006169151,0.00015695432],"about_ca_topic_score_codex":0.00033768418,"about_ca_topic_score_gemma":0.000007891424,"teacher_disagreement_score":0.8102282,"about_ca_system_score_codex":0.000010017486,"about_ca_system_score_gemma":0.000004047287,"threshold_uncertainty_score":0.41739574},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45182952,0.00003117541,0.5448783,0.000006524587,0.000043383283,0.0004031801,0.000005421387,0.00032307167,0.0024794084],"genre_scores_gemma":[0.872989,0.0000037344948,0.12686183,0.000010266031,0.000018539493,0.0000063886214,0.00008521487,0.000015408508,0.000009597522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939054,0.0000059332206,0.00025688706,0.000081377715,0.000078545396,0.00018672149],"domain_scores_gemma":[0.9997075,0.00008948369,0.000043913857,0.00008621945,0.000052236963,0.000020620526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032096566,0.00008379292,0.00012319189,0.0001879104,0.000017249036,0.000012491348,0.000034326265,0.000068615656,0.000009064889],"category_scores_gemma":[0.000035096473,0.000086543434,0.000038593775,0.00017339368,0.0000034457685,0.0001508612,0.0000054452794,0.000058652182,0.0000026410767],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013540064,0.00015926761,0.003169082,0.00025271974,0.00003736067,0.000006680725,0.0004935401,0.014085697,0.041644968,0.0029044182,0.0010785222,0.93603235],"study_design_scores_gemma":[0.0005340848,0.000062538245,0.007162467,0.00020369346,0.000011050417,0.0000050036138,0.00006916439,0.58868307,0.39615887,0.006284015,0.0006638841,0.00016213817],"about_ca_topic_score_codex":0.000045802906,"about_ca_topic_score_gemma":0.0001398826,"teacher_disagreement_score":0.93587023,"about_ca_system_score_codex":0.000046046276,"about_ca_system_score_gemma":0.0000037790437,"threshold_uncertainty_score":0.3529139},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9454803,0.0002575182,0.017711451,0.0027165336,0.00031537583,0.00032514395,0.000009575276,0.0013503849,0.031833757],"genre_scores_gemma":[0.92257625,0.00013802719,0.0763951,0.00006247917,0.0005548036,0.00006386226,0.0000061118467,0.000049017155,0.00015432462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718183,0.00005868321,0.00046155354,0.0002443684,0.001490909,0.0005626713],"domain_scores_gemma":[0.99791896,0.0008156144,0.000046075926,0.0004471297,0.00062755175,0.00014465446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073236,0.00019906998,0.0002055294,0.0005744591,0.00015567485,0.0004007543,0.0011453318,0.0000938485,0.00009091654],"category_scores_gemma":[0.00041128136,0.00018748804,0.00008134974,0.0002733542,0.00016368569,0.00073689397,0.00022961432,0.0005373011,0.00013499628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070733804,0.0013309509,0.0009311964,0.00026841537,0.0009289461,0.00015947744,0.012247519,0.5326451,0.23968713,0.11616971,0.023556821,0.07200401],"study_design_scores_gemma":[0.00025120875,0.000037324942,0.00034020832,0.00019635193,0.000005995921,0.000023207567,0.0006152836,0.81635296,0.14644808,0.019543463,0.015949503,0.000236415],"about_ca_topic_score_codex":0.000027042612,"about_ca_topic_score_gemma":0.00010580577,"teacher_disagreement_score":0.2837079,"about_ca_system_score_codex":0.00022519141,"about_ca_system_score_gemma":0.000019693194,"threshold_uncertainty_score":0.764554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13249551,0.00012388379,0.8633026,0.00013171561,0.00006737622,0.00013306248,0.0000014474206,0.00046985474,0.0032745549],"genre_scores_gemma":[0.59792787,0.000027189824,0.40191197,0.000053709417,0.00004305929,0.000015663534,0.000002043163,0.000010763672,0.000007751291],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961895,0.000010242527,0.00010263223,0.00008613445,0.00003785306,0.00014417055],"domain_scores_gemma":[0.9998563,0.000032594504,0.00000473012,0.00007459424,0.0000086927885,0.000023079147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007747364,0.00006979301,0.00009343505,0.00008418605,0.000014020803,0.000012582378,0.000047239562,0.000051892315,0.00002125154],"category_scores_gemma":[0.000003957101,0.000065356275,0.000045867746,0.000090385816,0.000010809763,0.00005565082,0.0000033077783,0.00007643763,0.0000027046094],"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.00013489826,0.00019787466,0.00006796713,0.00012979134,0.000103336715,0.000061331324,0.0028040314,0.30653682,0.4966841,0.0727314,0.0037095398,0.1168389],"study_design_scores_gemma":[0.0006348251,0.000074272495,0.00073130726,0.000046625595,0.000012948378,0.00001409882,0.000052768017,0.06730644,0.8284793,0.10020948,0.002190593,0.00024737907],"about_ca_topic_score_codex":0.000029302064,"about_ca_topic_score_gemma":0.000024457991,"teacher_disagreement_score":0.46543235,"about_ca_system_score_codex":0.00003620739,"about_ca_system_score_gemma":0.0000053336776,"threshold_uncertainty_score":0.26651514},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009378091,0.0010764104,0.97107583,0.000020535097,0.000903371,0.00021201024,0.000009213959,0.001572846,0.015751714],"genre_scores_gemma":[0.9463616,0.00005084378,0.051095,0.00014518258,0.0021086556,0.0000112401785,0.000012174408,0.00011456709,0.000100718156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728554,0.000043053853,0.0005692834,0.00044662552,0.000569819,0.0010856465],"domain_scores_gemma":[0.99839777,0.0007771011,0.00008698685,0.00027389603,0.00012950554,0.0003347463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044404052,0.00043849985,0.00043066446,0.00013352584,0.00031424384,0.00021169054,0.00029053097,0.00024981375,0.00014491359],"category_scores_gemma":[0.00004125592,0.00043559808,0.00007129214,0.00047000247,0.0001346772,0.0001757644,0.000039651964,0.00079079164,0.00008807576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028400874,0.00017244337,0.00062680646,0.0001361822,0.0000935595,0.0004967398,0.00016404124,0.2189938,0.0074039013,0.001392273,0.04158563,0.7286506],"study_design_scores_gemma":[0.0018301979,0.0003785189,0.008687824,0.005540278,0.00023367601,0.000092716815,0.00037350936,0.8311658,0.10001408,0.013417397,0.034796353,0.0034696336],"about_ca_topic_score_codex":0.000006590066,"about_ca_topic_score_gemma":0.0000024026,"teacher_disagreement_score":0.9369835,"about_ca_system_score_codex":0.00013597171,"about_ca_system_score_gemma":0.000028332905,"threshold_uncertainty_score":0.99980956},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12470822,0.000027948388,0.87357336,0.000043257416,0.00030392723,0.0003962514,0.000037996124,0.00053792336,0.00037111176],"genre_scores_gemma":[0.9809972,0.000012638673,0.018598067,0.00029372107,0.000029839428,0.000019360288,0.000015575224,0.000013111411,0.000020469814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922824,0.000022071894,0.00030211595,0.00010499086,0.00013169486,0.00021089568],"domain_scores_gemma":[0.999541,0.00008909875,0.000063856955,0.00016760227,0.00007686798,0.000061608465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002162533,0.00017856836,0.00017018084,0.00022072032,0.00022166711,0.00009122672,0.000071428694,0.00011863824,0.000019363544],"category_scores_gemma":[0.000006770702,0.00018365294,0.000074696094,0.00012198033,0.00004835572,0.0008475124,8.6304084e-7,0.00016561797,0.000007160446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035210684,0.00009565264,0.0000028119289,0.000086494954,0.00010830034,0.0000021453282,0.00076040905,0.4795767,0.010162247,0.008514641,0.00037843047,0.49996006],"study_design_scores_gemma":[0.00211998,0.0007485817,0.00025258746,0.0004425502,0.00024350476,0.00013181672,0.00033112933,0.7359084,0.2051868,0.05210207,0.0014285232,0.0011040452],"about_ca_topic_score_codex":0.000006305319,"about_ca_topic_score_gemma":0.000003219958,"teacher_disagreement_score":0.856289,"about_ca_system_score_codex":0.00006909486,"about_ca_system_score_gemma":0.000023103334,"threshold_uncertainty_score":0.74891496},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013703543,0.000022961141,0.984691,0.00004951626,0.00018712778,0.00038707867,0.000038202157,0.00024028416,0.00068025786],"genre_scores_gemma":[0.3335081,0.0000012354378,0.66622436,0.000012768465,0.000040836763,0.000032643016,0.00014824167,0.000017668432,0.0000141431465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919486,0.000010964407,0.0003691104,0.00008658612,0.0002367428,0.00010173927],"domain_scores_gemma":[0.99902713,0.00018831744,0.00009021745,0.00014189511,0.0004972671,0.000055143057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011793935,0.00011095405,0.00017780915,0.00009941759,0.000042333097,0.000035378824,0.00010906002,0.00004987119,0.000015832577],"category_scores_gemma":[0.00008946069,0.000113496186,0.000057355403,0.00012615506,0.000045781213,0.00011280378,0.000015453914,0.000045551194,0.000011267054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008961659,0.00021965898,0.0000076191263,0.00027388104,0.00019152364,7.2861644e-7,0.0016861677,0.7869744,0.00088229857,0.17936942,0.007495526,0.022889813],"study_design_scores_gemma":[0.00023577701,0.000027040032,0.00002160076,0.000033912784,0.000018165054,0.000004209692,0.000069342816,0.6884335,0.0020211304,0.30883402,0.00021876552,0.00008250071],"about_ca_topic_score_codex":0.0000012489475,"about_ca_topic_score_gemma":9.68965e-7,"teacher_disagreement_score":0.31980455,"about_ca_system_score_codex":0.000046318215,"about_ca_system_score_gemma":0.00006556821,"threshold_uncertainty_score":0.46282402},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30983827,0.0021161004,0.6837015,0.00032806743,0.00073707156,0.0003409054,0.000023755269,0.0004302637,0.002484027],"genre_scores_gemma":[0.99545187,0.00024956826,0.003914089,0.00023436687,0.000056504447,0.00004114717,0.00003708284,0.0000092107375,0.0000061369665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995259,0.000021741755,0.00013202832,0.00014367646,0.00007193903,0.000104718856],"domain_scores_gemma":[0.9995827,0.00012357498,0.000043760778,0.00005486686,0.00011750045,0.00007761368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009764642,0.00009254124,0.00009229239,0.00003271454,0.000058577654,0.00006356701,0.000032882795,0.00003659972,0.0000056231006],"category_scores_gemma":[0.00010448759,0.00009413952,0.0000121196435,0.000051062463,0.000038335747,0.00046510473,0.000016631286,0.000064884516,0.0000052777605],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004806287,0.000038685746,0.00026567196,0.00003745007,0.000020183807,0.0000108493705,0.008680633,0.00022107305,0.0005784737,0.00017244508,0.0044213952,0.9855051],"study_design_scores_gemma":[0.002572983,0.0010861041,0.0009812593,0.00019118204,0.00013581016,0.0004663888,0.007166935,0.84028995,0.015695607,0.008717528,0.121578574,0.0011176739],"about_ca_topic_score_codex":0.000016958786,"about_ca_topic_score_gemma":0.0000017112039,"teacher_disagreement_score":0.9843874,"about_ca_system_score_codex":0.00000862875,"about_ca_system_score_gemma":0.0000129368955,"threshold_uncertainty_score":0.38388982},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01965575,0.0011824244,0.9737239,0.00007356767,0.000020969439,0.00016746514,0.0000017610892,0.0005743071,0.004599891],"genre_scores_gemma":[0.7191633,0.000081853475,0.28062463,0.000029436947,0.000038475206,0.000009006454,0.000018481333,0.000025653586,0.0000091455095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928993,0.000076649114,0.00016781365,0.00013269721,0.00012871351,0.00020420189],"domain_scores_gemma":[0.99932176,0.00003156471,0.00008539638,0.00029079217,0.00020145727,0.0000690291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001976661,0.00015778824,0.00013866695,0.00008144231,0.00024014075,0.00011843477,0.00014278926,0.0000847698,0.000010243579],"category_scores_gemma":[0.00000964287,0.00015323347,0.000017316393,0.00018501545,0.00024122743,0.001218981,0.000063221116,0.00024235484,0.000004277029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022259298,0.00018557993,0.0019118859,0.00020663405,0.00009729199,0.000004474502,0.0018596707,0.004552695,0.20273359,0.0006155576,0.0013327901,0.78627723],"study_design_scores_gemma":[0.00030780042,0.000065600034,0.001551623,0.00048212026,0.00006205261,0.00014589156,0.00031618561,0.9448495,0.050727088,0.0009493679,0.00018709355,0.00035569927],"about_ca_topic_score_codex":0.00001655795,"about_ca_topic_score_gemma":0.000008808324,"teacher_disagreement_score":0.94029677,"about_ca_system_score_codex":0.000064266365,"about_ca_system_score_gemma":0.000020307965,"threshold_uncertainty_score":0.624868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.699387,0.0050320453,0.07119611,0.00037399665,0.0005436307,0.00018824155,0.0000026059645,0.0094271535,0.21384919],"genre_scores_gemma":[0.995937,0.000107115695,0.00233063,0.00008241007,0.00010709416,0.000003832472,0.0000036639303,0.000048271613,0.0013800184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940187,0.0000246585,0.000115402654,0.000120466226,0.00012236032,0.0002152575],"domain_scores_gemma":[0.99974823,0.000030020645,0.000019445706,0.00014727323,0.000011133881,0.00004391103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007064576,0.00012785953,0.00012186535,0.0000703858,0.00009378001,0.00006361916,0.00013798452,0.000049223498,0.0004438719],"category_scores_gemma":[0.000017677592,0.00012985824,0.000046430665,0.00009762742,0.000012034777,0.000077351804,0.000043364318,0.00033676947,0.00018804445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073200595,0.000060752904,0.011457256,0.00006741398,0.00014764075,0.00020504792,0.0029868376,0.561471,0.08562649,0.0016757747,0.02689539,0.30939907],"study_design_scores_gemma":[0.00015581121,0.000027324788,0.00075327634,0.00005322379,0.000011190036,0.000038991886,0.000029178573,0.8969455,0.0050707813,0.00081271044,0.095815755,0.00028630754],"about_ca_topic_score_codex":0.00004182134,"about_ca_topic_score_gemma":0.0000060936013,"teacher_disagreement_score":0.33547446,"about_ca_system_score_codex":0.000022101034,"about_ca_system_score_gemma":6.797643e-7,"threshold_uncertainty_score":0.5295465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7618925,0.00007180913,0.2347211,0.0002595531,0.00006267261,0.00025503198,0.000013194391,0.00015563575,0.0025685022],"genre_scores_gemma":[0.9957774,0.000004455637,0.0041218353,0.000034648543,0.000032634318,0.0000070505994,0.0000010006462,0.000010505484,0.000010464331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994746,0.000032002692,0.00021543437,0.00008308646,0.00009982905,0.00009504091],"domain_scores_gemma":[0.99954563,0.00011190641,0.000037985163,0.00025454277,0.000031954518,0.000017961474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007761649,0.00006969088,0.00017307706,0.00019674678,0.000016374977,0.000008467727,0.00013770924,0.000027768532,0.000019320229],"category_scores_gemma":[0.000047614598,0.00005811201,0.00007555078,0.00036952423,0.000026456424,0.000049937276,0.00002076819,0.00010818203,0.0000026525686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005048964,0.000013570601,0.0065231016,0.000002334943,0.00003740717,0.000001854981,0.00022592193,0.9614316,0.028787643,0.00012484193,0.0002571767,0.002589489],"study_design_scores_gemma":[0.00012377498,0.000016202148,0.20595373,0.000012431623,0.00006886601,5.154023e-7,0.000009010107,0.78655547,0.006934204,0.000014431597,0.0002619554,0.00004942792],"about_ca_topic_score_codex":0.0004694428,"about_ca_topic_score_gemma":0.00094903895,"teacher_disagreement_score":0.2338849,"about_ca_system_score_codex":0.000010673199,"about_ca_system_score_gemma":0.000005035187,"threshold_uncertainty_score":0.2369739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08913849,0.00015754068,0.90782636,0.0001214437,0.0003303305,0.00039362398,0.0000031250086,0.0007629157,0.0012661485],"genre_scores_gemma":[0.9047625,0.000009486662,0.09473163,0.00021562085,0.00016456036,0.000005912464,0.000011462907,0.000053467014,0.000045356883],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.00004150281,0.0002767899,0.00022683307,0.00013220409,0.00026983162],"domain_scores_gemma":[0.9991682,0.00016874338,0.000078766054,0.00041739442,0.00013180281,0.00003506179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016659591,0.00018587266,0.00017897015,0.000059881528,0.00022427498,0.00013669283,0.00016525282,0.000052998384,0.000004605305],"category_scores_gemma":[0.00004409358,0.00015606277,0.00008658919,0.000103265,0.000057917197,0.00022210031,0.00004049169,0.00011794629,0.000007688699],"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.000034091463,0.000025964702,0.0000962511,0.000053675307,0.000075887125,0.000003881674,0.001296707,0.048298124,0.91274357,0.0018895479,0.0057055065,0.029776774],"study_design_scores_gemma":[0.00030856134,0.0000049107853,0.0000719285,0.000056674584,0.00003445954,0.000013546756,0.00009486754,0.78528434,0.20606245,0.0021019464,0.0057829074,0.0001834273],"about_ca_topic_score_codex":0.00013271031,"about_ca_topic_score_gemma":0.00001785809,"teacher_disagreement_score":0.815624,"about_ca_system_score_codex":0.00004613967,"about_ca_system_score_gemma":0.000007716095,"threshold_uncertainty_score":0.6364055},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48192447,0.00007449902,0.5118607,0.00012131977,0.0002606342,0.00050389883,0.000004242599,0.0016141802,0.0036360314],"genre_scores_gemma":[0.9030188,0.0000026891216,0.09673055,0.00007205997,0.000036233007,0.000027134549,0.00000797752,0.000016100747,0.00008850206],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973124,0.0000029673138,0.00006444979,0.000062798514,0.000036922473,0.00010164544],"domain_scores_gemma":[0.999803,0.000011580608,0.000006396714,0.00011506803,0.000036055742,0.000027901167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000143763455,0.0000687746,0.00006471929,0.000032627966,0.00002583766,0.000042017804,0.000052557687,0.000040503804,0.0001050044],"category_scores_gemma":[0.000008853576,0.000058866233,0.000022162025,0.000037142163,0.000006733465,0.00011890642,0.00000706316,0.00003190655,0.000034565055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005519732,0.00001699369,0.00043021602,0.00004587963,0.00009305378,0.0000015730039,0.00022354118,0.081402175,0.3598021,0.012521878,0.4189202,0.12653689],"study_design_scores_gemma":[0.000096322015,0.000015647169,0.00076535484,0.000008785921,0.0000054878365,0.0000021568937,0.000014301725,0.7053657,0.2842805,0.0050210413,0.004302719,0.00012196065],"about_ca_topic_score_codex":0.00003717447,"about_ca_topic_score_gemma":0.000004829551,"teacher_disagreement_score":0.62396353,"about_ca_system_score_codex":0.000012305532,"about_ca_system_score_gemma":0.0000028135107,"threshold_uncertainty_score":0.24004954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24381997,0.0016151575,0.7512418,0.00047021438,0.0003757554,0.0005068758,0.000089591835,0.00071545166,0.001165162],"genre_scores_gemma":[0.92958564,0.000027166587,0.069886886,0.00022870283,0.0001708297,0.000020401267,0.000025386571,0.000023882303,0.00003111532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999242,0.000012218123,0.00021534563,0.00017543173,0.00013649235,0.00021850572],"domain_scores_gemma":[0.9995909,0.00009092382,0.000026903426,0.00015728928,0.00007427725,0.00005971687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079703495,0.0001633955,0.00021797598,0.00009909434,0.00005992325,0.000030454295,0.00011567813,0.000076412165,0.000026199365],"category_scores_gemma":[0.000013945147,0.00016284896,0.00008316247,0.00007049956,0.00003602668,0.00008724776,0.000018687222,0.000089285764,0.000002690045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001002231,0.00013074304,0.00011406293,0.00010780973,0.00008327524,0.000014301521,0.0004291686,0.016226303,0.0962624,0.001015208,0.004872157,0.8806443],"study_design_scores_gemma":[0.00063392293,0.00018356854,0.0009064618,0.00014943258,0.00002246265,0.000018274774,0.000017188422,0.8989787,0.090692975,0.0008201906,0.007281941,0.00029484133],"about_ca_topic_score_codex":0.0000072438916,"about_ca_topic_score_gemma":0.000005689808,"teacher_disagreement_score":0.8827524,"about_ca_system_score_codex":0.000021820091,"about_ca_system_score_gemma":0.000019116833,"threshold_uncertainty_score":0.6640788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57054454,0.0005024967,0.42585626,0.000019949814,0.0000425665,0.00016576039,0.00011092174,0.00050838204,0.002249111],"genre_scores_gemma":[0.9291756,0.0000037417688,0.070570484,0.000038778344,0.000071400806,0.0000061419937,0.00008504131,0.000046635367,0.0000021610217],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985752,0.00007008108,0.0005674084,0.00023295602,0.00031687692,0.00023748373],"domain_scores_gemma":[0.99900824,0.00024335968,0.00025485377,0.00026198768,0.0001688597,0.00006272308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019295716,0.00024388357,0.00044785833,0.00016367612,0.000064361884,0.000034413224,0.00025059504,0.00012707266,0.00011569723],"category_scores_gemma":[0.000058108653,0.00024794834,0.00008091564,0.0002466102,0.00014301683,0.00020588271,0.000020111482,0.00015813124,0.000009884593],"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.000021334097,0.000026987303,0.00015799144,0.00019625024,0.000035253768,0.000009408756,0.0003116541,0.15463236,0.80182546,0.00008057475,0.00015038575,0.0425523],"study_design_scores_gemma":[0.00018018989,0.000081881364,0.00010905756,0.0006852721,0.00003980667,0.0000050372087,0.000020275907,0.60419786,0.3820545,0.012379363,0.000034796365,0.00021193632],"about_ca_topic_score_codex":0.00018203504,"about_ca_topic_score_gemma":0.0000089758205,"teacher_disagreement_score":0.4495655,"about_ca_system_score_codex":0.000042297863,"about_ca_system_score_gemma":0.00006502318,"threshold_uncertainty_score":0.99999726},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010381995,0.00019099642,0.983321,0.000020468944,0.0001916132,0.00022721071,0.0000636123,0.00075094454,0.0048521436],"genre_scores_gemma":[0.8180588,0.0000034119728,0.18157773,0.00002766227,0.00015762779,0.0000037652953,0.000031892836,0.00003858197,0.00010051366],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992833,0.000009316603,0.00020779682,0.00010535414,0.00010777303,0.00028642706],"domain_scores_gemma":[0.99941856,0.00014062184,0.000047315003,0.00021227573,0.000108674045,0.00007252988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000052443025,0.00016203283,0.00024062124,0.00008173127,0.000037292553,0.000043563767,0.000063926745,0.00006906201,0.0000139053345],"category_scores_gemma":[0.000018127626,0.0001498392,0.00010570998,0.0000753777,0.000052620595,0.00020612666,0.000028658884,0.00007596924,0.0000053758813],"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.000055616463,0.00024184462,0.0003822197,0.00014405543,0.00031343658,0.000014581393,0.00039736458,0.011340828,0.3573742,0.00023666336,0.027071673,0.60242754],"study_design_scores_gemma":[0.0003789951,0.000027739881,0.00006905998,0.00005726586,0.000021464157,0.000008152893,0.000039697854,0.4478262,0.54989994,0.00010947798,0.0013900605,0.00017195554],"about_ca_topic_score_codex":0.000010144173,"about_ca_topic_score_gemma":5.662693e-7,"teacher_disagreement_score":0.8076768,"about_ca_system_score_codex":0.000017832548,"about_ca_system_score_gemma":0.00000935471,"threshold_uncertainty_score":0.6110265},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011620566,0.000026310998,0.9803724,0.00032990368,0.00082820276,0.00016116888,0.00020846627,0.00021095807,0.006241991],"genre_scores_gemma":[0.9040152,0.000068101646,0.09545384,0.00009419806,0.00012109918,0.0000209083,0.00006586169,0.000019880263,0.00014092456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915534,0.00001559341,0.00026482786,0.0001869633,0.00020990544,0.00016737363],"domain_scores_gemma":[0.99920225,0.0001588773,0.00004671699,0.000120592435,0.0003602473,0.00011129123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012852805,0.00015724511,0.00015738359,0.000072462346,0.00006252304,0.00017311034,0.00016860523,0.000068331996,0.00015014908],"category_scores_gemma":[0.00025519516,0.0001451571,0.000023641875,0.000048474554,0.00012776683,0.000078141355,0.00003088213,0.000117000454,0.000048420614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020095619,0.000055409382,0.00005010748,0.000011163498,0.000050342962,0.000025928419,0.0005171562,0.0138638625,0.001385941,0.7571323,0.012177509,0.2145293],"study_design_scores_gemma":[0.000041884654,0.00015064118,0.000018070026,0.000056568948,0.000009300771,0.0000096373415,0.00027202404,0.86090696,0.014445245,0.120110154,0.0038015035,0.00017798808],"about_ca_topic_score_codex":0.000017847891,"about_ca_topic_score_gemma":0.000017193594,"teacher_disagreement_score":0.8923946,"about_ca_system_score_codex":0.000037368845,"about_ca_system_score_gemma":0.000047023426,"threshold_uncertainty_score":0.5919335},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018547241,0.00006596128,0.93332875,0.00001590002,0.00015004222,0.00010471082,9.539145e-7,0.00082848605,0.0636505],"genre_scores_gemma":[0.78652936,0.000024674815,0.21234158,0.000065754684,0.00005225306,0.000018674202,0.0000060326092,0.0000222047,0.00093945017],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997964,0.0000028110287,0.00005269637,0.000048296617,0.000025312738,0.00007448157],"domain_scores_gemma":[0.9998727,0.000014631835,0.0000042377596,0.000073200186,0.000021255168,0.000013973103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002038272,0.000044450037,0.000045157165,0.000023385213,0.000015467669,0.000009665599,0.000023781156,0.000025746594,0.000058601545],"category_scores_gemma":[0.000012605197,0.00004166447,0.000017757147,0.000042380576,0.0000036652427,0.000028787004,0.0000019029196,0.000016710532,0.0000054543375],"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.000011683894,0.00008766173,0.000202887,0.00005385229,0.00012319969,0.000006011549,0.00023055826,0.08498049,0.06504302,0.16830471,0.4789673,0.20198862],"study_design_scores_gemma":[0.00019350604,0.000025136827,0.00003762223,0.0000081621065,0.0000071474237,0.000004209399,0.000014963643,0.26110616,0.5127531,0.0042232224,0.22148238,0.00014435197],"about_ca_topic_score_codex":9.328505e-7,"about_ca_topic_score_gemma":0.0000010676805,"teacher_disagreement_score":0.78467464,"about_ca_system_score_codex":0.000007528509,"about_ca_system_score_gemma":0.000002182073,"threshold_uncertainty_score":0.16990277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84080184,0.00008615803,0.027934924,0.000018735553,0.000061547165,0.00003395309,1.2977267e-7,0.00022429157,0.1308384],"genre_scores_gemma":[0.9973799,0.000002815495,0.0024884038,0.00002022291,0.000011865963,3.223823e-7,1.107154e-7,0.0000045644256,0.00009176879],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997944,0.0000011226233,0.00007084923,0.000026125144,0.000040612485,0.00006688591],"domain_scores_gemma":[0.999903,0.000011746693,0.0000038885682,0.00006544595,0.0000065479826,0.000009342508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006513254,0.000026547905,0.0000460228,0.00005576036,0.0000016257736,0.0000019155214,0.000046391317,0.000020318428,0.000036218917],"category_scores_gemma":[0.0000028728311,0.000025067762,0.000010162691,0.00006804732,0.0000054042316,0.000022210219,0.000007959132,0.000029467341,0.000004041209],"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.00002048532,0.000070680995,0.011271556,0.000032324464,0.000028118255,0.00010500229,0.00040916225,0.003844971,0.8725213,0.023526717,0.04563561,0.042534072],"study_design_scores_gemma":[0.00006198814,0.000009614861,0.011107526,0.00001514686,8.745678e-7,0.0000023949503,0.000013218806,0.0021222553,0.9801718,0.0015621792,0.004883093,0.000049912916],"about_ca_topic_score_codex":0.00003606105,"about_ca_topic_score_gemma":0.00013686917,"teacher_disagreement_score":0.15657806,"about_ca_system_score_codex":0.0000070398814,"about_ca_system_score_gemma":0.0000010041862,"threshold_uncertainty_score":0.10222337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1975787,0.00020176041,0.66102844,0.000038442147,0.000091905225,0.00013725375,0.000004053207,0.0010803825,0.13983907],"genre_scores_gemma":[0.9274692,0.00003867979,0.07223,0.00012207103,0.0000257788,3.1026522e-7,0.0000017509034,0.000013449858,0.00009878554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994439,0.000010951844,0.00018548185,0.00010916278,0.000100443955,0.0001500413],"domain_scores_gemma":[0.99961245,0.000026188365,0.000033546738,0.00021569799,0.000077559285,0.000034561228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032669173,0.000120145894,0.00019263996,0.000076620636,0.000020612404,0.000009958081,0.00007904609,0.00006245982,0.000008501747],"category_scores_gemma":[0.0000071614554,0.00011566256,0.00006265691,0.00008646243,0.00002050868,0.00009331303,0.000015036351,0.00008914367,0.0000033183367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002186323,0.000018757404,0.000004000642,0.000004982742,0.000044998364,0.000013206522,0.00014399414,0.69479966,0.22932231,0.0026422497,0.022753142,0.050230857],"study_design_scores_gemma":[0.00007608907,0.000039205715,0.000051328443,0.000052382642,0.0000083979185,0.0000075388266,0.000025001946,0.6999364,0.28933942,0.010309176,0.00004460391,0.00011048583],"about_ca_topic_score_codex":0.000014728743,"about_ca_topic_score_gemma":0.0000024453514,"teacher_disagreement_score":0.72989047,"about_ca_system_score_codex":0.00002359223,"about_ca_system_score_gemma":0.000008864753,"threshold_uncertainty_score":0.47165823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061994903,0.00056347763,0.93274784,0.000018030803,0.0008411581,0.0010669484,0.00002408527,0.0014545732,0.0012889757],"genre_scores_gemma":[0.8180613,0.00013321613,0.18097153,0.00003527961,0.00018572916,0.000013836034,0.0000611727,0.000085908796,0.00045202902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983829,0.00013765112,0.0002562269,0.00063280785,0.000053382304,0.0005370093],"domain_scores_gemma":[0.9985021,0.00022531212,0.0001630327,0.00074111874,0.00020762041,0.00016086802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040948114,0.00046623015,0.0006472294,0.00023039238,0.00014776805,0.00012151,0.00049004157,0.00048102395,0.000028315026],"category_scores_gemma":[0.00004743553,0.0005512355,0.00032549046,0.00022118495,0.00012032455,0.00022315676,0.00043195966,0.0006230371,0.000009167281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009926191,0.0005287394,0.002392155,0.0024825444,0.0062898104,0.00044200764,0.0050969725,0.45393997,0.14732082,0.27507982,0.010447837,0.094986685],"study_design_scores_gemma":[0.0011762462,0.000067030596,0.00013171292,0.000651328,0.00065177184,0.000010249478,0.0002079676,0.85069823,0.08496337,0.036458574,0.023533285,0.0014502163],"about_ca_topic_score_codex":0.00002584167,"about_ca_topic_score_gemma":0.0000033215636,"teacher_disagreement_score":0.7560664,"about_ca_system_score_codex":0.00020867836,"about_ca_system_score_gemma":0.000041253978,"threshold_uncertainty_score":0.99969393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1362445,0.0001040006,0.86238706,0.000022758522,0.0001869204,0.00023560473,0.000006215221,0.0006129659,0.00019993777],"genre_scores_gemma":[0.95656365,0.000057455436,0.04307307,0.000032478325,0.00003890021,0.00008343329,0.0000043316777,0.00005394335,0.00009274667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991757,0.00002120083,0.00023997386,0.00021199013,0.00011998398,0.00023114584],"domain_scores_gemma":[0.9996657,0.000042350795,0.000045294124,0.000115925206,0.0000926524,0.000038119884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010039197,0.0001718289,0.00016696377,0.00022644807,0.0002497084,0.000076393604,0.0000916941,0.000084154555,0.0000062470535],"category_scores_gemma":[0.0000039298097,0.00019429998,0.00006348285,0.00025303563,0.0000477303,0.00072670757,6.3769335e-7,0.0002051102,0.00000554968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015764692,0.00013497905,0.000006950347,0.000099176184,0.000027298523,0.00002442879,0.0013977132,0.69309276,0.23856665,0.000018112736,0.0001908387,0.066283405],"study_design_scores_gemma":[0.0004094134,0.00006644062,0.0000945467,0.00022123885,0.000023447119,0.000027124317,0.00015926885,0.47942573,0.5190131,0.00022695801,0.000055199063,0.00027751492],"about_ca_topic_score_codex":0.000018707808,"about_ca_topic_score_gemma":0.00001651919,"teacher_disagreement_score":0.8203191,"about_ca_system_score_codex":0.000119065604,"about_ca_system_score_gemma":0.000033787335,"threshold_uncertainty_score":0.7923323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23898476,0.0040115635,0.683391,0.0019775783,0.0007737308,0.0009215706,0.0000065739073,0.0010149651,0.06891828],"genre_scores_gemma":[0.98717576,0.000021927131,0.011585221,0.00066964043,0.00045776906,9.676735e-7,0.0000027353058,0.000038652317,0.000047350102],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860096,0.00006643628,0.00037000887,0.00018160233,0.0004181041,0.0003628958],"domain_scores_gemma":[0.9992585,0.000036231224,0.00015182178,0.0002482226,0.00018501937,0.00012015814],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004887866,0.00024736658,0.0003176363,0.000069003065,0.0005754224,0.0013080388,0.00093803887,0.00007800511,0.00007762224],"category_scores_gemma":[0.000008765655,0.00017909941,0.000073412586,0.00017807736,0.00007265864,0.00054381444,0.00008550552,0.0006111084,0.000021803538],"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.00013531187,0.00006577575,0.00011654798,0.000010434976,0.00015439162,0.00011103196,0.0012877659,0.019475026,0.49532765,0.000010609223,0.017893516,0.46541193],"study_design_scores_gemma":[0.0016221328,0.00015622306,0.002027505,0.0018362937,0.00017878201,0.00048746873,0.00038783313,0.49889177,0.4693449,0.020806247,0.0033729747,0.0008878457],"about_ca_topic_score_codex":0.00005140691,"about_ca_topic_score_gemma":0.0000042147963,"teacher_disagreement_score":0.748191,"about_ca_system_score_codex":0.00007178482,"about_ca_system_score_gemma":0.00006831612,"threshold_uncertainty_score":0.9997287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24019183,0.00044491232,0.71161985,0.00046458852,0.0016709542,0.0009939151,0.000024209809,0.0048724473,0.039717313],"genre_scores_gemma":[0.8491436,0.0001648929,0.14877346,0.00022194014,0.00045721157,0.00003006006,0.00007038259,0.0000581044,0.0010803042],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989112,0.00001894657,0.0003365351,0.0002682727,0.00014267805,0.00032234302],"domain_scores_gemma":[0.99929893,0.00005710877,0.00006228594,0.0003663555,0.00013014239,0.00008516689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000086265056,0.00024266898,0.0002490532,0.00016526187,0.000094380535,0.000078666104,0.00013377708,0.00018448985,0.00014960377],"category_scores_gemma":[0.00005975913,0.00024755308,0.00011387034,0.0002017348,0.000028699673,0.00024218988,0.00001439248,0.00010531325,0.00005067895],"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.000117938886,0.00011372732,0.00018671688,0.00006164739,0.00013914412,0.0000047539,0.0003301313,0.02033589,0.5571365,0.012795091,0.16870849,0.24006997],"study_design_scores_gemma":[0.0014584806,0.0003885969,0.0035778992,0.0003129052,0.00015433248,0.00017240604,0.0000474707,0.17034133,0.3130029,0.0133436965,0.49565896,0.0015410143],"about_ca_topic_score_codex":0.0000062104205,"about_ca_topic_score_gemma":0.000045603687,"teacher_disagreement_score":0.6089518,"about_ca_system_score_codex":0.00008121037,"about_ca_system_score_gemma":0.000017741146,"threshold_uncertainty_score":0.9999977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53107876,0.0003225395,0.4648901,0.00014558445,0.00037775422,0.0008597362,0.0000033985916,0.00081948657,0.0015026527],"genre_scores_gemma":[0.99586666,0.0000033441002,0.0037103537,0.00020904884,0.000111453024,0.000056925706,0.000009571407,0.000013933149,0.000018741108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926984,0.000022475006,0.00030550556,0.00006823236,0.0001663557,0.00016757415],"domain_scores_gemma":[0.999612,0.000012588482,0.00009646988,0.00012624146,0.00012084362,0.00003186697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085376196,0.00013463612,0.000114130875,0.00007924357,0.00016225791,0.00075076654,0.00008789777,0.00006578114,0.0000044220415],"category_scores_gemma":[0.00000556426,0.00009345568,0.000018560728,0.00011241718,0.00003395602,0.0025363625,0.000026363055,0.00013571754,0.000015491836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042394886,0.000010532284,0.00037246305,0.0006224651,0.00003682884,0.0000014172684,0.005180342,0.07373077,0.014155786,0.00012394588,0.0035014153,0.90225977],"study_design_scores_gemma":[0.00008803217,0.000008367141,0.00021578425,0.00009040521,0.0000059589393,0.00006690754,0.00024715738,0.99553823,0.0024222198,0.00006037812,0.0011339531,0.00012260796],"about_ca_topic_score_codex":0.000035483732,"about_ca_topic_score_gemma":1.617864e-7,"teacher_disagreement_score":0.92180747,"about_ca_system_score_codex":0.000028470324,"about_ca_system_score_gemma":0.00000673776,"threshold_uncertainty_score":0.72396594},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034757864,0.00012481629,0.8655349,0.00008201437,0.00012174299,0.00009930491,0.0000050797285,0.0026453387,0.09662894],"genre_scores_gemma":[0.8699971,0.0000047377266,0.12833755,0.000108208595,0.00019900632,0.000008529326,0.000023844175,0.000044470384,0.0012765726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992011,0.000014051629,0.00014357633,0.00014361246,0.00022339639,0.00027424813],"domain_scores_gemma":[0.99967396,0.000036514582,0.000008890555,0.0002038702,0.00003359603,0.000043154458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009447401,0.00013235593,0.00012249508,0.000111799105,0.00005477317,0.00007210189,0.00014844735,0.00006379647,0.00022433445],"category_scores_gemma":[0.0000013531518,0.00012584931,0.000061004284,0.00014639166,0.000021350468,0.00007760933,0.000027417665,0.0001444925,0.00006921277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017679293,0.00017032142,0.0008898837,0.000050237162,0.000074685,0.00017376084,0.000060503993,0.2049245,0.16138326,0.0158377,0.08719265,0.5292248],"study_design_scores_gemma":[0.00026743292,0.000028224,0.0025132063,0.00004139026,0.000009785528,0.000012551728,0.000017876237,0.5374214,0.44289914,0.005499413,0.010957547,0.00033201577],"about_ca_topic_score_codex":0.00021789335,"about_ca_topic_score_gemma":0.00004346747,"teacher_disagreement_score":0.83523923,"about_ca_system_score_codex":0.00003363129,"about_ca_system_score_gemma":0.00001503507,"threshold_uncertainty_score":0.5131986},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42265648,0.000075062024,0.5743238,0.00011471011,0.0015612782,0.0004536363,0.00007213384,0.00060031656,0.00014259038],"genre_scores_gemma":[0.9396292,0.00020615193,0.05949739,0.00003341189,0.00033117487,0.00005812932,0.000074801166,0.0001330442,0.000036723082],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967567,0.00004395643,0.0011540028,0.00058540725,0.00071683276,0.0007431485],"domain_scores_gemma":[0.99847686,0.00017523787,0.00019395426,0.0006298882,0.00019412633,0.00032993418],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032869767,0.00061436486,0.00069002353,0.001302091,0.00017819784,0.00007069321,0.00036110647,0.00070140226,0.00011430245],"category_scores_gemma":[0.0000308997,0.00066701387,0.00028885427,0.0012498451,0.0002077083,0.0005630753,0.000011002945,0.0009036004,0.000016997636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010763595,0.00027862043,0.0000185059,0.00016003213,0.00016540274,0.000029765393,0.0004016162,0.32088956,0.6483691,0.0011803756,0.00013416832,0.028265228],"study_design_scores_gemma":[0.0017426446,0.00012851649,0.00078622263,0.00071155705,0.000104415674,0.0005443312,0.000034816872,0.9392939,0.049405377,0.00032578318,0.0061197546,0.0008026725],"about_ca_topic_score_codex":0.00005047787,"about_ca_topic_score_gemma":0.00017972612,"teacher_disagreement_score":0.6184043,"about_ca_system_score_codex":0.00029976622,"about_ca_system_score_gemma":0.00011945592,"threshold_uncertainty_score":0.9995781},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90531766,0.00013741384,0.05636628,0.000008837457,0.00028909426,0.00015957777,0.000008339754,0.001365633,0.036347162],"genre_scores_gemma":[0.94626224,0.00016798866,0.052972462,0.000078752106,0.00006743333,0.000010101905,0.000006108909,0.000021331582,0.00041356497],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996543,0.0000021412695,0.00009852226,0.00007684226,0.00003434625,0.00013385019],"domain_scores_gemma":[0.99977976,0.000013006359,0.000009499392,0.00015286502,0.000025762822,0.000019118563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000028692293,0.00008019895,0.00008577092,0.000040738152,0.000021414917,0.0000066668617,0.00008351871,0.000038405768,0.0000740688],"category_scores_gemma":[0.0000046807,0.00007092378,0.000038947735,0.000038303308,0.000011501218,0.00008906232,0.000011398412,0.00004345143,0.000016466021],"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.00041327387,0.0006807365,0.0043661017,0.0003604554,0.00045979852,0.000030453688,0.0015714638,0.0074693877,0.08029378,0.0073769195,0.24877639,0.6482012],"study_design_scores_gemma":[0.0003663393,0.00030266333,0.0073676207,0.00011999156,0.000028789284,0.000018685407,0.00006900288,0.2134666,0.7461943,0.0034743054,0.028104628,0.0004870486],"about_ca_topic_score_codex":0.000011749881,"about_ca_topic_score_gemma":0.000012186502,"teacher_disagreement_score":0.6659005,"about_ca_system_score_codex":0.0000086370865,"about_ca_system_score_gemma":0.0000032972102,"threshold_uncertainty_score":0.28921878},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12090953,0.00016034805,0.86927325,0.0000132965615,0.00011458443,0.00025112843,0.0000033865135,0.00039359796,0.008880892],"genre_scores_gemma":[0.563652,0.000015824444,0.43623513,0.000007420443,0.000036202706,0.0000018710614,8.748723e-7,0.000013109418,0.00003759617],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957097,0.000017471677,0.00014372947,0.00011060064,0.000048965063,0.00010824452],"domain_scores_gemma":[0.99967617,0.000045944238,0.000036607813,0.00012968353,0.00008202994,0.000029564693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009001047,0.00009064475,0.00017357468,0.000068983776,0.000023789906,0.000007229408,0.000037632268,0.000054153163,0.000014661756],"category_scores_gemma":[0.000011947731,0.00008499494,0.000038139464,0.000053177006,0.000026273447,0.0000599163,0.000018320343,0.000046737576,6.372796e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026446873,0.000008359879,0.000010080705,0.00003680467,0.000057785786,0.00000266498,0.0005511797,0.00036991757,0.92919946,0.00046900596,0.0021243722,0.067143895],"study_design_scores_gemma":[0.00011666503,0.00004016438,0.00008484951,0.000052642485,0.000028298165,0.00004140363,0.00009776774,0.072771676,0.92207026,0.00433395,0.00026378816,0.00009852706],"about_ca_topic_score_codex":0.00008692031,"about_ca_topic_score_gemma":0.0000028600086,"teacher_disagreement_score":0.44274247,"about_ca_system_score_codex":0.000007846501,"about_ca_system_score_gemma":0.0000038071635,"threshold_uncertainty_score":0.34659934},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028162475,0.00042425445,0.9755251,0.000022642967,0.00071402965,0.00017780576,0.000050570205,0.0028902953,0.0173791],"genre_scores_gemma":[0.96167505,0.00011065384,0.03730021,0.000014375273,0.00019920399,0.00001882261,0.0005665162,0.00004493777,0.00007024981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993971,0.000012635402,0.00016008569,0.0001386992,0.00009439848,0.00019708203],"domain_scores_gemma":[0.99948305,0.000012613938,0.000032206004,0.0003604989,0.000053021264,0.000058594247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003749479,0.0001964684,0.00020023022,0.000049442766,0.000018922161,0.000050222334,0.00015070943,0.0002507121,0.00024308925],"category_scores_gemma":[0.0000058863207,0.0001970626,0.000060889837,0.00004149189,0.00001689173,0.00004827332,0.00016906211,0.00030223455,0.000022285642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011355316,0.000008184063,0.00006123276,0.000021909002,0.000043744803,0.0000013118703,0.000016098315,0.98505855,0.00012878777,0.00028863386,0.013827982,0.0005424456],"study_design_scores_gemma":[0.000062792606,0.0000040033106,0.0001907018,0.00007272923,0.0000401,0.0000024329524,0.000009147855,0.9854743,0.010024185,0.00030202497,0.0034915283,0.00032606555],"about_ca_topic_score_codex":0.0000194238,"about_ca_topic_score_gemma":0.0000013422236,"teacher_disagreement_score":0.9588588,"about_ca_system_score_codex":0.000058107755,"about_ca_system_score_gemma":0.00001047926,"threshold_uncertainty_score":0.803598},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019943323,0.00012118899,0.97559303,0.0000394475,0.000193101,0.00015317538,0.000003591771,0.0005873435,0.0033658133],"genre_scores_gemma":[0.47932383,0.000021452679,0.5204505,0.000033910474,0.000098846554,0.000024948798,0.0000052321393,0.000012904674,0.00002838872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997107,0.0000059564486,0.00007539615,0.00006405106,0.000029772506,0.00011413985],"domain_scores_gemma":[0.9998032,0.000028145936,0.000012642348,0.000091742084,0.000026585029,0.000037724974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000627227,0.000061133906,0.00005976998,0.00004392471,0.00002801623,0.000018765328,0.000020644491,0.00004157169,0.000017321296],"category_scores_gemma":[0.0000060544617,0.00005882902,0.0000187908,0.00003518514,0.000018552859,0.0001599259,0.0000040274253,0.000032719465,0.00000456399],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021250298,0.000009075313,0.00015834054,0.00000859406,0.000008334109,1.282406e-7,0.00002004258,0.000006835837,0.05809249,0.0004222337,0.003924968,0.9373468],"study_design_scores_gemma":[0.00014026795,0.000011252759,0.0012561115,0.000014017656,0.000011526141,0.000014432241,0.000031314383,0.849867,0.14335802,0.00039072146,0.0048047155,0.00010060514],"about_ca_topic_score_codex":0.0000043902833,"about_ca_topic_score_gemma":9.632868e-7,"teacher_disagreement_score":0.9372462,"about_ca_system_score_codex":0.000015873069,"about_ca_system_score_gemma":0.0000026079738,"threshold_uncertainty_score":0.23989779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35843402,0.0047182674,0.63525254,0.00003699934,0.0004095737,0.00026849363,0.0000072128723,0.000164504,0.0007084057],"genre_scores_gemma":[0.95140576,0.00017273317,0.047585543,0.00012428281,0.0006015351,0.0000015860389,0.000004939352,0.00010144411,0.0000021626258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771386,0.0001896114,0.0007327473,0.00026260858,0.00045341416,0.0006477549],"domain_scores_gemma":[0.99828964,0.000682017,0.00047205118,0.00019272423,0.00020524462,0.0001582932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000875019,0.00038724375,0.0006173131,0.00046657745,0.00026326385,0.00011246618,0.00019955779,0.00011807636,0.000006609771],"category_scores_gemma":[0.00011502572,0.00036567356,0.0001713003,0.00031676292,0.00009176216,0.0007212277,0.000034332406,0.00065425783,9.4540735e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021547337,0.00006443104,0.0024660372,0.0001563011,0.000024089733,0.000008287641,0.00017908557,0.8052534,0.07179769,0.000022878316,0.0000046055065,0.11980772],"study_design_scores_gemma":[0.00073771644,0.00017350189,0.0010599097,0.005019275,0.000056858833,0.000072494986,0.00034144043,0.8649875,0.12565446,0.0006007151,0.000798536,0.0004975921],"about_ca_topic_score_codex":0.000005337841,"about_ca_topic_score_gemma":0.00000124406,"teacher_disagreement_score":0.59297174,"about_ca_system_score_codex":0.000254244,"about_ca_system_score_gemma":0.000060423958,"threshold_uncertainty_score":0.99987954},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16032733,0.00016484894,0.33379334,0.00033867153,0.00022421902,0.00015171255,8.974549e-7,0.0053053354,0.49969366],"genre_scores_gemma":[0.99291915,0.000029631627,0.006673284,0.00015524305,0.000053365584,0.0000015379316,0.0000036468218,0.000007004631,0.00015713491],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972117,0.000003852649,0.000068739304,0.000066953486,0.0000491024,0.0000901915],"domain_scores_gemma":[0.9998038,0.0000046937425,0.0000064779438,0.00014976031,0.000011135177,0.000024177029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000019326279,0.00005836395,0.000051541894,0.000034250228,0.000016870008,0.000018004248,0.00005735382,0.00003417071,0.00003564075],"category_scores_gemma":[0.000001927712,0.000054328913,0.000019491834,0.000061646766,0.00000627842,0.000058125508,0.0000033713623,0.000049025643,0.000057121233],"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.0000048341226,0.00004621811,0.0001562792,0.0000031704371,0.000013249713,0.0000083785035,0.000081482845,0.0013651757,0.53049576,0.0554074,0.07870076,0.33371732],"study_design_scores_gemma":[0.00037532538,0.0001706771,0.104678206,0.000066561166,0.0000233541,0.000030029076,0.00012065745,0.5084254,0.28396276,0.02092246,0.08047573,0.0007488211],"about_ca_topic_score_codex":0.000002516057,"about_ca_topic_score_gemma":0.0000021316055,"teacher_disagreement_score":0.83259183,"about_ca_system_score_codex":0.000013446981,"about_ca_system_score_gemma":0.0000010568273,"threshold_uncertainty_score":0.22154687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95032346,0.0012246375,0.012165856,0.00015723007,0.00009708908,0.00007252101,3.1021568e-7,0.00097428914,0.034984607],"genre_scores_gemma":[0.9875293,0.001279616,0.011093618,0.00001936935,0.000050438626,5.900756e-7,6.2184967e-7,0.0000121047615,0.00001433965],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996063,0.0000062527974,0.00007683225,0.00011325185,0.00006295566,0.0001343664],"domain_scores_gemma":[0.9997827,0.000032262742,0.000016209622,0.00009662108,0.000029315726,0.00004288432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000102968435,0.0000858787,0.000085976404,0.00007221715,0.000048701568,0.000018942237,0.000041190284,0.00003714131,0.00001283833],"category_scores_gemma":[0.0000058498977,0.00007251834,0.000009142838,0.0000658114,0.00003540864,0.00013383912,0.000020407344,0.00007756674,0.0000025894105],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665223,0.000020649186,0.009726639,0.0001524991,0.00008257579,0.000058977275,0.0007074148,0.00014195348,0.010729238,0.0026834714,0.00058513664,0.97508377],"study_design_scores_gemma":[0.0007759707,0.00024881423,0.027589524,0.0006794487,0.000056917444,0.0008176408,0.0023482784,0.023813004,0.9185335,0.0028881112,0.021244563,0.0010042385],"about_ca_topic_score_codex":0.000030584142,"about_ca_topic_score_gemma":0.00017640472,"teacher_disagreement_score":0.97407955,"about_ca_system_score_codex":0.000012595547,"about_ca_system_score_gemma":0.0000025330573,"threshold_uncertainty_score":0.29572123},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03153379,0.0002492705,0.94997114,0.000019124596,0.0003104719,0.00020182884,0.0000038277235,0.0013769595,0.016333578],"genre_scores_gemma":[0.92141193,0.0000032828689,0.078139804,0.00016065293,0.00021566144,0.0000048202082,0.000005186656,0.000023153269,0.00003550388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99957097,0.000008340139,0.00008708434,0.000065224616,0.000053554173,0.00021482013],"domain_scores_gemma":[0.99972045,0.000058730802,0.000012668586,0.000121842895,0.000039119062,0.00004720579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005273315,0.000089807174,0.000096209245,0.00003980209,0.00004148957,0.00001571395,0.00003749284,0.000038763596,0.000019256828],"category_scores_gemma":[0.0000043741284,0.00008668966,0.0000422342,0.00004370312,0.000012041739,0.00014348293,0.0000127446065,0.000043507527,0.000016556716],"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.00013481062,0.00014872442,0.0003509138,0.00008015801,0.00030281997,0.000006986006,0.0011189412,0.014466141,0.62807673,0.025457485,0.25016892,0.07968734],"study_design_scores_gemma":[0.00027384592,0.000031118227,0.00037101292,0.00004506094,0.00002363707,0.000012885204,0.0000816812,0.39427334,0.58858067,0.0018281454,0.0142320385,0.0002465845],"about_ca_topic_score_codex":0.000008342725,"about_ca_topic_score_gemma":0.0000012180229,"teacher_disagreement_score":0.88987815,"about_ca_system_score_codex":0.000023912557,"about_ca_system_score_gemma":0.000001933709,"threshold_uncertainty_score":0.35351017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55511904,0.0003949094,0.41424477,0.00015097155,0.00011405712,0.00020019735,0.0000012889724,0.0012589501,0.028515816],"genre_scores_gemma":[0.983106,0.000015770695,0.016734362,0.000034441073,0.00001913667,8.179344e-7,0.0000026331784,0.0000071455975,0.0000796761],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996631,0.0000061808623,0.0000857316,0.000069649206,0.00010003531,0.000075284646],"domain_scores_gemma":[0.99976605,0.000009365401,0.000025296407,0.00013960325,0.000039645238,0.000020050948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000028775426,0.00007103217,0.00009237323,0.000042391603,0.000014101989,0.0000054044817,0.000044574183,0.000047103083,0.000014192866],"category_scores_gemma":[0.0000035812589,0.00004675844,0.000017180031,0.000090913934,0.000012313223,0.000022262315,0.000004005213,0.000060790877,0.0000015306996],"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.00011811627,0.00021823496,0.00047372948,0.00005159845,0.00008101981,0.00005071052,0.0010494282,0.1963856,0.54610056,0.006386232,0.038418207,0.21066655],"study_design_scores_gemma":[0.00017305014,0.00012817186,0.0018378182,0.00016429553,0.000009016366,0.000010040212,0.00002366857,0.3170695,0.67959183,0.0003197169,0.00055712636,0.00011575264],"about_ca_topic_score_codex":0.0000037052002,"about_ca_topic_score_gemma":5.289993e-7,"teacher_disagreement_score":0.42798698,"about_ca_system_score_codex":0.0000104613055,"about_ca_system_score_gemma":0.0000034163213,"threshold_uncertainty_score":0.1906754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021488598,0.00011703443,0.9616983,0.00018978718,0.00020877163,0.00026463452,0.0000042001284,0.0019342059,0.014094485],"genre_scores_gemma":[0.9400682,0.000017056078,0.05894635,0.000072660456,0.00019402042,0.000022779917,0.000015507649,0.000032288055,0.0006311738],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994919,0.000009970312,0.00012888215,0.00010471242,0.00009397008,0.00017056633],"domain_scores_gemma":[0.9996549,0.00005813947,0.000015400557,0.00019468518,0.00004162481,0.000035266374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010812907,0.000097237964,0.00014663205,0.000056415818,0.00004014249,0.000039514307,0.000113692964,0.000058494083,0.000074971525],"category_scores_gemma":[0.000014763087,0.00009623562,0.00005690095,0.000053594733,0.000012628002,0.000049747,0.000017653636,0.000052264986,0.0000619769],"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.000068188616,0.00007812338,0.00019254927,0.00019443418,0.00013965591,0.0000017694309,0.00010358559,0.013280078,0.47940567,0.16482867,0.29874808,0.04295922],"study_design_scores_gemma":[0.00076760986,0.00011679143,0.00065326446,0.000061011906,0.00004465213,0.00000922579,0.000013480133,0.543344,0.17363258,0.02070748,0.26022598,0.00042392718],"about_ca_topic_score_codex":0.000013227673,"about_ca_topic_score_gemma":0.000004936194,"teacher_disagreement_score":0.9185796,"about_ca_system_score_codex":0.000017352399,"about_ca_system_score_gemma":0.0000019640686,"threshold_uncertainty_score":0.39243746},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09174324,0.000005180047,0.9028624,0.000062262865,0.0007283214,0.0002261317,0.00018039627,0.00044882233,0.0037432043],"genre_scores_gemma":[0.99268496,0.000012960682,0.0069448007,0.00023961505,0.00003590706,0.000042363088,0.000019314213,0.000011383001,0.000008682175],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994468,0.000021561882,0.00022986448,0.00007635549,0.000108300694,0.00011712588],"domain_scores_gemma":[0.9993111,0.00036372963,0.000027583988,0.00018588775,0.000058981495,0.000052735308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000230381,0.00010634547,0.00009351,0.00009688955,0.00009733036,0.00005159088,0.00006800442,0.00011672499,0.000044960067],"category_scores_gemma":[0.000043052598,0.0000989972,0.000050919753,0.000048071855,0.000071206734,0.00036807006,6.788179e-7,0.00020868951,0.000024319585],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042484617,0.00021405825,0.00003292349,0.000071735,0.000500565,0.0000011756799,0.0046442416,0.06610089,0.059694257,0.021345802,0.013842364,0.8293035],"study_design_scores_gemma":[0.0022557098,0.00017718745,0.00028230282,0.0000654011,0.00007527069,0.00000804235,0.0001534109,0.21637668,0.6772507,0.09331235,0.00958684,0.00045609384],"about_ca_topic_score_codex":0.0000030868648,"about_ca_topic_score_gemma":0.0000067998176,"teacher_disagreement_score":0.9009417,"about_ca_system_score_codex":0.000016716664,"about_ca_system_score_gemma":0.000009082821,"threshold_uncertainty_score":0.4036989},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03389996,0.000012193224,0.95913774,0.00012821062,0.00010483102,0.00026777567,0.0000048114134,0.0010893999,0.0053550927],"genre_scores_gemma":[0.9530092,0.0000057895404,0.046158805,0.00073371833,0.00002647801,0.0000050338213,0.000036172005,0.0000053236827,0.000019512174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964595,0.0000026227856,0.00011537323,0.00005300088,0.000058849106,0.00012418233],"domain_scores_gemma":[0.99976635,0.000020269481,0.0000124104,0.000108062035,0.000051895964,0.000040996107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003368677,0.00007364916,0.00008269621,0.00008626381,0.00003901745,0.000031838674,0.00006523334,0.000036131656,0.000014441814],"category_scores_gemma":[0.0000074078316,0.0000716494,0.000030342862,0.00007645421,0.0000031422287,0.00016487845,0.0000073101355,0.00003412118,0.0000217818],"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.00014558254,0.000048274218,0.00010991907,0.00007497943,0.00008059948,0.0000016408762,0.00064216426,0.18494199,0.4222533,0.005720551,0.25241688,0.13356411],"study_design_scores_gemma":[0.00043272955,0.00013107671,0.0012132899,0.000054194366,0.000012257903,0.0000019785364,0.00006238651,0.5431433,0.4003486,0.0007832414,0.053584192,0.00023277522],"about_ca_topic_score_codex":0.000004606377,"about_ca_topic_score_gemma":5.240987e-7,"teacher_disagreement_score":0.9191092,"about_ca_system_score_codex":0.000024345052,"about_ca_system_score_gemma":0.000002480673,"threshold_uncertainty_score":0.2921778},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030092023,0.00005985216,0.9474565,0.00002218637,0.00008280741,0.00011112259,0.0000016389216,0.0010289208,0.021144964],"genre_scores_gemma":[0.9499647,0.0000030587767,0.04964579,0.000025038125,0.00007991805,0.000009790528,0.000007733472,0.000015814207,0.00024812573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975187,0.000002367007,0.00006558043,0.00005503676,0.000040659674,0.00008451436],"domain_scores_gemma":[0.9998814,0.000018735927,0.00000761443,0.0000626869,0.000021695687,0.000007888506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000024595378,0.000051175753,0.000050969105,0.000029403112,0.000024971161,0.000021823034,0.00004098418,0.000026913063,0.000008847788],"category_scores_gemma":[0.000001474091,0.00004930327,0.000022524555,0.00003712572,0.0000046198943,0.000052872172,0.0000057046786,0.000022255626,0.0000058683977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016242937,0.000036590696,0.00020226951,0.000026565052,0.000044421093,0.0000039347788,0.00011277348,0.24640821,0.1812214,0.4077155,0.13977635,0.02443575],"study_design_scores_gemma":[0.00020599386,0.000032908894,0.0009575619,0.000037525653,0.000014474414,0.0000038132334,0.000055642355,0.56469506,0.31374934,0.10568882,0.0142904045,0.00026846258],"about_ca_topic_score_codex":0.000058795267,"about_ca_topic_score_gemma":0.000026922859,"teacher_disagreement_score":0.9198727,"about_ca_system_score_codex":0.0000120775385,"about_ca_system_score_gemma":0.000001670617,"threshold_uncertainty_score":0.2010529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032055073,0.0006641856,0.9936315,0.00014632852,0.00023810581,0.00012775938,0.00000562938,0.0008804498,0.00110054],"genre_scores_gemma":[0.99261636,0.00010930832,0.0069488157,0.00007650346,0.00009054563,0.00002967069,7.1011897e-7,0.00004561397,0.000082459075],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991262,0.000017619757,0.00018518673,0.00017896145,0.0002104598,0.00028156568],"domain_scores_gemma":[0.9996026,0.000053770033,0.000032770913,0.00016481776,0.000082942606,0.00006307347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007397842,0.00018522708,0.00012452519,0.00008047733,0.0005306419,0.00014328622,0.00017299585,0.00008329709,0.0000118930475],"category_scores_gemma":[0.0000011804781,0.00014827342,0.000082919556,0.00022305179,0.00009250518,0.0001880723,7.410675e-7,0.00035755977,0.00003365343],"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.000015241724,0.0000351354,2.1694127e-7,0.000011183199,0.000031912496,0.000011836515,0.000303033,0.23126577,0.0049441177,0.000035061268,0.00012790321,0.7632186],"study_design_scores_gemma":[0.00054990104,0.00016075281,0.000015944026,0.0005086469,0.000065877524,0.00007845521,0.0005058523,0.121870734,0.86225027,0.0104508,0.0030245413,0.0005182442],"about_ca_topic_score_codex":0.000017006114,"about_ca_topic_score_gemma":0.000012589393,"teacher_disagreement_score":0.9894109,"about_ca_system_score_codex":0.00009901348,"about_ca_system_score_gemma":0.00004455133,"threshold_uncertainty_score":0.60464144},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2150016,0.0011024164,0.7754489,0.000059529004,0.00022167816,0.0002509597,0.000020046578,0.0011431291,0.0067517348],"genre_scores_gemma":[0.9006636,0.0001399864,0.098798044,0.000047433157,0.000097605865,0.000035844347,0.0000035144042,0.00002140469,0.00019254703],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995154,0.000008668023,0.000118260345,0.000096205695,0.000052548046,0.0002089077],"domain_scores_gemma":[0.999622,0.00010281622,0.000015958789,0.0001703773,0.000021535128,0.00006732684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011268614,0.000100960344,0.00019437486,0.00014424004,0.000037222253,0.000026469428,0.000041345607,0.000056405406,0.000051562412],"category_scores_gemma":[0.0000337091,0.00008975808,0.000098029224,0.00014284451,0.000013581458,0.00013267432,0.000018923853,0.000037451253,0.000006069351],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003124226,0.00011232796,0.006611846,0.00009327702,0.0034355668,0.000003748644,0.00036674464,0.0027069815,0.031995397,0.0012320696,0.037778072,0.9156327],"study_design_scores_gemma":[0.00017667466,0.00004154616,0.016777983,0.00004099485,0.0013649877,0.000011590733,0.00009279384,0.32606632,0.63714546,0.00072850083,0.016946917,0.00060621044],"about_ca_topic_score_codex":0.000015789652,"about_ca_topic_score_gemma":0.000004778481,"teacher_disagreement_score":0.91502655,"about_ca_system_score_codex":0.000016523389,"about_ca_system_score_gemma":0.0000021035573,"threshold_uncertainty_score":0.36602286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10353925,0.00001486553,0.8832857,0.00003587998,0.00006173726,0.0001295509,0.0000032801568,0.00032374632,0.01260596],"genre_scores_gemma":[0.94190097,0.0000028257618,0.057924207,0.000018559724,0.00003612474,0.0000051813795,0.00004426545,0.000024528697,0.00004331313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990583,0.000023714227,0.00035164508,0.00013209783,0.00030484918,0.0001294031],"domain_scores_gemma":[0.9995585,0.000051089482,0.00009046726,0.00021182738,0.00006583514,0.00002226954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014913554,0.00012669436,0.00019546371,0.00017588158,0.000027724376,0.000025209445,0.00011063711,0.00008303034,0.000055154986],"category_scores_gemma":[0.000011133431,0.00012265418,0.00006951448,0.00016524571,0.000024447318,0.00012981897,0.000015419837,0.000087593275,0.0000017341617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011850743,0.000051089766,0.00010895697,0.000041642594,0.000008871205,6.9305094e-7,0.000035135185,0.97985196,0.015221613,0.003349657,0.00032539992,0.0009931136],"study_design_scores_gemma":[0.00013810737,0.000031221738,0.0007632742,0.000104764375,0.000022853732,8.3827763e-7,0.000020936786,0.9111774,0.085201055,0.0024069715,0.000017872111,0.00011469],"about_ca_topic_score_codex":0.00013834704,"about_ca_topic_score_gemma":0.000009516985,"teacher_disagreement_score":0.83836174,"about_ca_system_score_codex":0.000060833834,"about_ca_system_score_gemma":0.000008814163,"threshold_uncertainty_score":0.5001692},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2138595,0.00022493208,0.7526985,0.000019867986,0.00057746476,0.000577653,0.0000019949778,0.0015170476,0.030523064],"genre_scores_gemma":[0.80573404,0.000002138957,0.19381227,0.00015976511,0.00010295898,0.00001007173,0.000004549031,0.0000494217,0.00012479891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855524,0.00005391355,0.00025967284,0.00023563842,0.00032107043,0.00057445944],"domain_scores_gemma":[0.99919295,0.000022705026,0.000030834995,0.00041313464,0.00010010835,0.00024027048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020231817,0.0002617347,0.0002871661,0.00013225779,0.000091301015,0.000045713427,0.00016896155,0.00009056531,0.000016865959],"category_scores_gemma":[0.000016893526,0.0002375163,0.000080197664,0.00021459494,0.000027787584,0.000092004186,0.000088379005,0.0001410704,0.00011766177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011707439,0.00037130743,0.002667384,0.000044764285,0.000097389784,0.0000036394624,0.0018002618,0.814732,0.16206099,0.00003153437,0.016094035,0.002084995],"study_design_scores_gemma":[0.00053128775,0.000016082688,0.006189257,0.000092202405,0.000054350807,0.000030331528,0.0001620116,0.7014705,0.29014948,0.000006149151,0.00074541796,0.0005529411],"about_ca_topic_score_codex":0.000058911566,"about_ca_topic_score_gemma":0.0000061926958,"teacher_disagreement_score":0.59187454,"about_ca_system_score_codex":0.00009869805,"about_ca_system_score_gemma":0.000006235837,"threshold_uncertainty_score":0.9685633},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01628008,0.00027736276,0.96571887,0.00007253115,0.0006389553,0.00092356926,0.000051213432,0.0012021405,0.014835312],"genre_scores_gemma":[0.42212564,0.00007630685,0.57677966,0.00011971868,0.00017819891,0.000101762926,0.000029391076,0.00008350891,0.00050584774],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998438,0.00005173935,0.0005762047,0.00030189272,0.00023155219,0.00040060803],"domain_scores_gemma":[0.9984806,0.00030184738,0.00016026178,0.00069558405,0.00026643826,0.00009526106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004108438,0.00033313342,0.0004444415,0.00018599852,0.00012172339,0.00003889314,0.0003207307,0.00022407054,0.00059737824],"category_scores_gemma":[0.00006172116,0.00025980128,0.00026971812,0.0002594203,0.00021812708,0.00016744394,0.00003973874,0.00017167452,0.000015497584],"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.00014627064,0.00011746582,0.00007521639,0.000074754236,0.00049445615,0.000006341223,0.000348917,0.0012038025,0.4048404,0.0034671489,0.011304625,0.5779206],"study_design_scores_gemma":[0.0014971243,0.00017237858,0.00021349917,0.00019973046,0.00021224341,0.00006683593,0.00010790297,0.34501138,0.63100976,0.00703137,0.013858969,0.0006187943],"about_ca_topic_score_codex":0.000080119156,"about_ca_topic_score_gemma":0.000102170794,"teacher_disagreement_score":0.5773018,"about_ca_system_score_codex":0.000051561718,"about_ca_system_score_gemma":0.0000632694,"threshold_uncertainty_score":0.9999854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9213484,0.000021725593,0.035972666,0.000058657577,0.00012865892,0.00015175472,0.000004124642,0.0015506626,0.040763333],"genre_scores_gemma":[0.9852128,0.0000038918392,0.014484691,0.0001430261,0.000047724916,0.000007796213,0.000007851653,0.000021438691,0.00007075008],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935484,0.000010575496,0.00010321975,0.00019170546,0.00013967945,0.00019998351],"domain_scores_gemma":[0.9994405,0.000049384307,0.000026926105,0.000365047,0.00004999727,0.00006814127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004492348,0.00015491879,0.00020612334,0.00017384464,0.0000779584,0.000053357344,0.00015554151,0.00004559171,0.000114328424],"category_scores_gemma":[0.0000053305457,0.00012116835,0.000069492045,0.00030823084,0.000051224953,0.0000834658,0.000030930685,0.00025646444,0.000021860751],"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.00037875975,0.00059842976,0.1403983,0.0000564451,0.0047538024,0.0006151645,0.0009956757,0.110894725,0.60223705,0.03354297,0.039065883,0.06646281],"study_design_scores_gemma":[0.00073265133,0.00013659928,0.08470284,0.0000543049,0.00072957005,0.000031530988,0.00009775001,0.6572056,0.23987116,0.00057181367,0.014928847,0.00093735335],"about_ca_topic_score_codex":0.00008117857,"about_ca_topic_score_gemma":0.0003618321,"teacher_disagreement_score":0.54631084,"about_ca_system_score_codex":0.000015825904,"about_ca_system_score_gemma":0.000004295474,"threshold_uncertainty_score":0.4941102},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25662506,0.0022493165,0.74000823,0.00014929994,0.00037305648,0.000056244244,8.272817e-7,0.0001385943,0.00039934003],"genre_scores_gemma":[0.9932908,0.000056674886,0.0062722517,0.00008261689,0.00028367303,2.9359776e-7,6.570555e-7,0.000010035045,0.0000030413842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994887,0.0000055542996,0.0001754465,0.00006292025,0.000059885093,0.0002074745],"domain_scores_gemma":[0.99956584,0.000021401818,0.000023940393,0.00006603339,0.00003895013,0.000283818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004634171,0.00009917645,0.00014039832,0.00023731156,0.000028989047,0.000055997498,0.00009851192,0.0000522646,0.0000026593877],"category_scores_gemma":[0.000007689488,0.00009641299,0.000040098366,0.00016530158,0.000008110822,0.00009054114,0.0000023463708,0.00020975561,9.50865e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009806054,0.000025334286,0.0008505636,0.000018331004,0.00010515779,0.00043070765,0.0002453943,0.09563652,0.025728703,0.017358173,0.012355819,0.8472355],"study_design_scores_gemma":[0.00016664738,0.0002353507,0.035246197,0.00007524495,0.000015206961,0.00040928507,0.0000020878406,0.9520628,0.001296492,0.0005044218,0.00977872,0.00020755242],"about_ca_topic_score_codex":0.000020143227,"about_ca_topic_score_gemma":0.000020418109,"teacher_disagreement_score":0.8564263,"about_ca_system_score_codex":0.000055684992,"about_ca_system_score_gemma":0.000026038277,"threshold_uncertainty_score":0.39316073},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15489988,0.00042659664,0.8229945,0.00048474493,0.0000475248,0.00032075783,0.000006607445,0.0014257306,0.019393697],"genre_scores_gemma":[0.8868458,0.000090586516,0.11262958,0.00035146327,0.000027185975,0.0000015245802,0.000024767702,0.000010949438,0.000018096722],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996504,0.000008750485,0.00010230719,0.00008059781,0.000043367127,0.00011456005],"domain_scores_gemma":[0.99964976,0.00003972416,0.00001864113,0.00020889353,0.000054254982,0.000028697095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047348018,0.00008674483,0.00009649576,0.00004443421,0.000083548926,0.00005571042,0.000057381534,0.000028301933,0.0000052801483],"category_scores_gemma":[0.0000047330686,0.00008660063,0.00002421895,0.000029899627,0.000023166884,0.00015361507,0.000014998019,0.000054397744,0.0000017240671],"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.000047727022,0.000042776395,0.00001448946,0.000044471613,0.000051738763,0.000012766752,0.0003071557,0.0015939269,0.6415874,0.01017366,0.105097465,0.24102643],"study_design_scores_gemma":[0.0003243058,0.00005860314,0.0005181336,0.000088848465,0.000018460576,0.000055957218,0.000042109066,0.5242615,0.4435522,0.026052415,0.004799558,0.00022793836],"about_ca_topic_score_codex":0.00000780348,"about_ca_topic_score_gemma":0.0000019730232,"teacher_disagreement_score":0.73194593,"about_ca_system_score_codex":0.000016030519,"about_ca_system_score_gemma":0.0000017215891,"threshold_uncertainty_score":0.35314712},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34664208,0.0003448184,0.47639295,0.00072291103,0.00025779378,0.00017308429,0.0000029513697,0.0061650234,0.16929838],"genre_scores_gemma":[0.9963747,0.00004254431,0.00321597,0.00012485741,0.00003429992,9.776741e-7,0.000010437568,0.0000042874653,0.00019192863],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997775,0.0000042319584,0.00005769651,0.000053655996,0.00004446811,0.00006244896],"domain_scores_gemma":[0.9998607,0.000004198503,0.000005938235,0.00010045365,0.000011290188,0.000017392125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000023431834,0.000043041124,0.000038844926,0.000017824748,0.000015337626,0.000016696149,0.000036351474,0.000040208324,0.000024001001],"category_scores_gemma":[0.0000027291649,0.00004145034,0.000013414583,0.00003975975,0.0000040708805,0.000054197997,0.0000018800268,0.000050841598,0.00003076419],"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.0000018939089,0.000025375446,0.00016457278,0.0000015807176,0.000005067591,5.989049e-7,0.00001698841,0.000265156,0.61590105,0.0028814466,0.29483178,0.08590446],"study_design_scores_gemma":[0.000116682604,0.000046050987,0.027563443,0.000014142667,0.000007719711,0.0000033953845,0.000010114115,0.41829368,0.47794124,0.0042724474,0.07149823,0.00023285966],"about_ca_topic_score_codex":0.0000034008563,"about_ca_topic_score_gemma":7.162609e-7,"teacher_disagreement_score":0.64973265,"about_ca_system_score_codex":0.000014593352,"about_ca_system_score_gemma":0.000001036981,"threshold_uncertainty_score":0.16902958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73146373,0.0031984902,0.25535515,0.00009752672,0.00013392336,0.0004870604,0.0000017180915,0.0027244627,0.006537963],"genre_scores_gemma":[0.98612356,0.0000056710787,0.013546405,0.00005836103,0.000109101864,0.000047717353,0.0000012321633,0.000060040813,0.000047901685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896395,0.000021533082,0.00022669118,0.00022190699,0.0002107916,0.00035511758],"domain_scores_gemma":[0.99955624,0.00002148622,0.000050313574,0.00015453328,0.00012768326,0.000089769506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007910791,0.00022345249,0.00020428938,0.00008743973,0.00019176007,0.00020240621,0.00017223971,0.00007754667,0.00006659116],"category_scores_gemma":[0.000012420692,0.00019106884,0.000048891136,0.00017854667,0.0000737523,0.00029987455,0.000055075474,0.00021839725,0.00014080219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027627013,0.00010208284,0.00023638335,0.00020663391,0.000058675494,0.000031333708,0.0012779019,0.37315857,0.33708555,0.00009281848,0.0035701804,0.28415224],"study_design_scores_gemma":[0.000098210614,0.000036249337,0.00030438646,0.00050136645,0.000015339829,0.000016735694,0.00020282586,0.8853124,0.1127368,0.00026100065,0.00022243797,0.00029228482],"about_ca_topic_score_codex":0.000039148956,"about_ca_topic_score_gemma":9.416938e-7,"teacher_disagreement_score":0.5121538,"about_ca_system_score_codex":0.000055219407,"about_ca_system_score_gemma":0.00003184937,"threshold_uncertainty_score":0.77915615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017085783,0.00020883378,0.9742332,0.00042355518,0.00012638702,0.00037574198,0.000016460122,0.005436501,0.0020935016],"genre_scores_gemma":[0.7814244,0.00003628788,0.21710694,0.00087953446,0.0001303526,0.00016411391,0.000059709073,0.00010428149,0.000094347684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984748,0.000085495136,0.0003386312,0.00030464254,0.0002454812,0.00055096415],"domain_scores_gemma":[0.99867845,0.00013235513,0.000080652855,0.0008474945,0.00008417739,0.00017687863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033969953,0.00032116158,0.0003006952,0.00033482327,0.00014279272,0.00014188403,0.00035062124,0.0002579509,0.00002179417],"category_scores_gemma":[0.00015714957,0.00034401455,0.00012273787,0.0003888925,0.00005893702,0.00017732762,0.00005944214,0.00028459443,0.000012788624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010405697,0.0002580024,0.011933803,0.00018652418,0.00013250277,0.00003373258,0.00021611567,0.51067054,0.13748378,0.1826451,0.023596078,0.13273978],"study_design_scores_gemma":[0.00023026436,0.000050718998,0.0015610182,0.000058783768,0.000019273246,0.000013155503,0.0000057014486,0.8397543,0.13988678,0.0106937615,0.007377205,0.00034905804],"about_ca_topic_score_codex":0.00065897586,"about_ca_topic_score_gemma":0.000104643266,"teacher_disagreement_score":0.7643387,"about_ca_system_score_codex":0.0001960636,"about_ca_system_score_gemma":0.000043604734,"threshold_uncertainty_score":0.9999012},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37126428,0.009417943,0.4490098,0.0001078147,0.000988888,0.00028063447,6.337316e-7,0.010168319,0.15876168],"genre_scores_gemma":[0.9876715,0.00014256807,0.010979952,0.00005704661,0.00007395086,0.000003426854,0.000001173787,0.000021768368,0.0010486173],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962,0.000012991268,0.000065152184,0.000050268394,0.000049071485,0.00020250659],"domain_scores_gemma":[0.99979764,0.000018215318,0.000008049085,0.00010571845,0.000014012507,0.000056368903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000058774967,0.000079039826,0.00008984752,0.000027199663,0.000027900618,0.000012755179,0.000050045637,0.00004094545,0.00014575284],"category_scores_gemma":[0.0000099805275,0.000071648465,0.00002691345,0.00005484459,0.000010858966,0.000094749405,0.00001809747,0.00011840659,0.00019849076],"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.000015743733,0.00033689316,0.17017534,0.00026470193,0.00044788717,0.00003973089,0.00553963,0.022522597,0.37135142,0.023926448,0.17263937,0.23274022],"study_design_scores_gemma":[0.00030514857,0.000025247124,0.011443621,0.000088864756,0.000026174806,0.000030663337,0.00023427737,0.13185653,0.33982685,0.000061059596,0.5155062,0.00059535255],"about_ca_topic_score_codex":0.000012223621,"about_ca_topic_score_gemma":0.00000234249,"teacher_disagreement_score":0.6164072,"about_ca_system_score_codex":0.0000124343815,"about_ca_system_score_gemma":0.0000014903295,"threshold_uncertainty_score":0.29217398},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33030656,0.000047707803,0.6197302,0.00010115422,0.00015033307,0.00022033048,0.0000035399016,0.0012411097,0.04819911],"genre_scores_gemma":[0.97984225,0.0000015048453,0.019967642,0.000040793293,0.000055669956,0.000006046332,0.0000054381103,0.000027393431,0.000053254338],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994835,0.000007839865,0.00016393876,0.000116828654,0.0000824828,0.00014540665],"domain_scores_gemma":[0.9996514,0.000044012744,0.00004462275,0.00019463863,0.000044822275,0.000020519477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039283335,0.000119841156,0.00013346657,0.0001057154,0.00002428708,0.000029328523,0.00010675773,0.000050150797,0.000013239738],"category_scores_gemma":[0.000007915907,0.00010843339,0.000048251466,0.000088038505,0.000028915847,0.00007244383,0.000020043399,0.00010112255,0.0000041421645],"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.000028411077,0.00012547945,0.00012870647,0.00007113518,0.000018686267,0.000076966004,0.00004847606,0.015323773,0.9576289,0.013046963,0.0090499995,0.004452499],"study_design_scores_gemma":[0.00028632328,0.000061043356,0.00079886784,0.0005398798,0.000010124642,0.000020193833,0.0000259426,0.13030285,0.86622673,0.0013249201,0.00020204937,0.0002010771],"about_ca_topic_score_codex":0.000061995466,"about_ca_topic_score_gemma":0.0000142882545,"teacher_disagreement_score":0.6495357,"about_ca_system_score_codex":0.00002792582,"about_ca_system_score_gemma":0.0000050034873,"threshold_uncertainty_score":0.44217855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55138636,0.00016246061,0.43380567,0.00003882213,0.00006170909,0.0015190946,0.00003571079,0.00024774313,0.012742426],"genre_scores_gemma":[0.73312026,0.000022952705,0.26657197,0.0000010445066,0.000007527212,0.00011971487,0.000004204177,0.000018821433,0.00013353198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991018,0.000028835668,0.00033920177,0.0000922186,0.00025907913,0.00017884927],"domain_scores_gemma":[0.99877924,0.00036342247,0.00002668648,0.000365875,0.00043331488,0.000031471394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542421,0.00007780576,0.00016110009,0.00026045454,0.00009597516,0.000021555581,0.00020221288,0.00005260148,0.000036198762],"category_scores_gemma":[0.0004894833,0.0000716327,0.000051043815,0.00028566082,0.00009669329,0.00007768512,0.000034704004,0.00012799958,0.000010206443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020494675,0.0006560161,0.000038430073,0.0011268244,0.0001103732,0.0000021308808,0.009996678,0.031102896,0.09184277,0.8608315,0.001901373,0.0023705112],"study_design_scores_gemma":[0.00022947574,0.00048674433,0.000036705118,0.0007548045,0.000025677151,0.000004215363,0.00094433,0.48535618,0.45500132,0.056852363,0.00012468507,0.00018348052],"about_ca_topic_score_codex":0.000023473527,"about_ca_topic_score_gemma":0.0000148484605,"teacher_disagreement_score":0.80397916,"about_ca_system_score_codex":0.000021685632,"about_ca_system_score_gemma":0.000032468834,"threshold_uncertainty_score":0.29210967},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10452317,0.000013158609,0.89461344,0.000027957962,0.00010530956,0.00020055908,0.000016278318,0.00038741433,0.00011269157],"genre_scores_gemma":[0.91096884,0.000007630574,0.08882125,0.00011190078,0.000025039213,0.000034063472,0.00000820313,0.000015095792,0.000007955431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930817,0.000010602873,0.00021523774,0.00015129232,0.00013015397,0.0001845491],"domain_scores_gemma":[0.99954146,0.00008191509,0.000042777367,0.00012146439,0.00012728466,0.00008510084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014545376,0.00015272484,0.00019898338,0.0004127243,0.000273292,0.000111976165,0.00008629079,0.00008733403,0.000023313418],"category_scores_gemma":[0.0000016691853,0.00015513168,0.00007309837,0.0004756435,0.00002358779,0.00043531004,0.0000011176634,0.00023322193,0.0000036972096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009371764,0.000020302836,0.000038287533,0.00012564125,0.00018024596,3.23921e-7,0.00039169035,0.58606446,0.09761732,0.000004548629,0.000051841547,0.31541163],"study_design_scores_gemma":[0.00018289713,0.000049906386,0.00015618016,0.000040769002,0.00017868966,0.0000037131667,0.000038486614,0.7266169,0.27209735,0.000020931358,0.00046598134,0.00014817923],"about_ca_topic_score_codex":0.000006358116,"about_ca_topic_score_gemma":0.0000058343635,"teacher_disagreement_score":0.8064457,"about_ca_system_score_codex":0.000021802793,"about_ca_system_score_gemma":0.000014009746,"threshold_uncertainty_score":0.63260865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040750664,0.00047627406,0.95125794,0.000035789475,0.0029197093,0.0026252558,0.000056828318,0.0012204762,0.0006570692],"genre_scores_gemma":[0.9961457,0.000053594402,0.0003042395,0.000030210402,0.00014865349,0.002760425,0.000019951729,0.000110161716,0.000427062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803925,0.000089597095,0.00068248383,0.00042136814,0.00029663814,0.0004706612],"domain_scores_gemma":[0.99883336,0.0001697174,0.0001140271,0.0005653972,0.00019388615,0.00012363943],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021408664,0.00036354398,0.00044782806,0.00039858947,0.00021974844,0.00019878703,0.0002550166,0.00017417702,0.000010484307],"category_scores_gemma":[0.00001001764,0.00040229163,0.00010245231,0.00028372556,0.000037176713,0.00054799323,0.0000018863964,0.00026499561,0.000060067563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010586011,0.0001491438,0.0000020588345,0.00026326938,0.00006404586,0.0000024646351,0.0005251313,0.9350813,0.056773607,0.00020136457,0.0033394846,0.0035875256],"study_design_scores_gemma":[0.0008529519,0.00025489257,0.000072395436,0.0012498678,0.00004495634,0.00003876365,0.00023432373,0.9474249,0.04758189,0.00012765471,0.001546437,0.0005710086],"about_ca_topic_score_codex":0.0021170506,"about_ca_topic_score_gemma":0.00005996374,"teacher_disagreement_score":0.95539504,"about_ca_system_score_codex":0.00022696539,"about_ca_system_score_gemma":0.000033563683,"threshold_uncertainty_score":0.9998429},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94997543,0.00012877384,0.024120305,0.00010502306,0.00009053966,0.00008191808,0.000009194544,0.0006599126,0.024828874],"genre_scores_gemma":[0.99603665,0.000033560205,0.0036302719,0.00009877076,0.0000291668,0.000003208465,0.000012738015,0.0000103069,0.00014530473],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967647,0.000009494552,0.00011748389,0.00006255806,0.00007653315,0.00005746477],"domain_scores_gemma":[0.99969554,0.00007049417,0.000017806453,0.00016362582,0.000036215508,0.000016290305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015911717,0.000057968777,0.00007631264,0.00004863239,0.000016899154,0.000009221226,0.00005043968,0.000041792635,0.00028474303],"category_scores_gemma":[0.000018518738,0.00005497755,0.000022983873,0.000099388264,0.000008259564,0.000060183185,0.0000040392842,0.000045481254,0.00002635513],"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.000005935523,0.000059338865,0.00037454304,0.00000457189,0.000042275205,0.0000027620279,0.00022734451,0.040001765,0.77989644,0.0036514935,0.17276661,0.0029669346],"study_design_scores_gemma":[0.00013148756,0.000048374484,0.004144187,0.00005833472,0.000011222504,2.4344467e-7,0.0000121658495,0.25289124,0.7365213,0.0038120407,0.002242521,0.00012687864],"about_ca_topic_score_codex":0.000055327862,"about_ca_topic_score_gemma":0.000014060923,"teacher_disagreement_score":0.21288948,"about_ca_system_score_codex":0.0000116322435,"about_ca_system_score_gemma":0.0000010058932,"threshold_uncertainty_score":0.31177366},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013586647,0.00012475102,0.9963741,0.00005712953,0.00037039595,0.00048123897,0.000028491953,0.0020312082,0.0005191214],"genre_scores_gemma":[0.00022242728,0.00005830525,0.99888426,0.00023492458,0.000118363096,0.00013013971,0.00015650189,0.00010711569,0.00008793565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988048,0.00019060764,0.00031747977,0.00028258597,0.00013387341,0.00027061958],"domain_scores_gemma":[0.99847835,0.00052765,0.000095944306,0.00050361396,0.00030870567,0.000085705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004300859,0.00024843626,0.00032680482,0.00013704084,0.00015193848,0.00008119379,0.00027585824,0.00017482073,0.000120616496],"category_scores_gemma":[0.0007753563,0.00026562164,0.00009433501,0.0002766034,0.00004977751,0.00019877731,0.000062171726,0.00012093826,0.0000025734998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048931875,0.000011581109,0.000013304652,0.000017635008,0.000027442951,2.566782e-7,0.00006143774,0.85341734,0.00014436884,0.00013334605,0.002954914,0.14321345],"study_design_scores_gemma":[0.00055181794,0.000051877112,0.000014427705,0.000044773788,0.000039473714,0.0000030841866,0.000016191743,0.9801378,0.010754833,0.0016211271,0.0064534815,0.00031110132],"about_ca_topic_score_codex":0.000003966532,"about_ca_topic_score_gemma":6.6521164e-7,"teacher_disagreement_score":0.14290236,"about_ca_system_score_codex":0.00005280679,"about_ca_system_score_gemma":0.000016254358,"threshold_uncertainty_score":0.9999796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05448085,0.00004594095,0.94124174,0.00004906975,0.0013675584,0.00023734476,0.000018036762,0.0011697838,0.0013896892],"genre_scores_gemma":[0.9788583,0.000006920256,0.020532472,0.0000474533,0.0002631775,0.00009973937,0.0000028019547,0.00006143091,0.00012774103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990985,0.000010999213,0.0002529793,0.0002465477,0.0001233577,0.00026766022],"domain_scores_gemma":[0.9994913,0.00008532189,0.000047751248,0.00017034145,0.00012001979,0.00008527557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009415153,0.0002043491,0.00017770701,0.0002010523,0.00036663515,0.00010319358,0.000099711695,0.0001634958,0.00010564171],"category_scores_gemma":[0.0000030315173,0.00021770672,0.000120939745,0.00021322712,0.000069958485,0.00031043292,5.164394e-7,0.00046687239,0.000022909375],"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.000046995574,0.000048421316,0.000004831179,0.000049335216,0.000044969296,0.000001793277,0.00012697348,0.018613292,0.43077067,0.000015383057,0.00039121148,0.5498861],"study_design_scores_gemma":[0.00039935185,0.00008945985,0.000022268063,0.00016079134,0.00009796613,0.00009311852,0.00011753325,0.32782605,0.66703296,0.000352236,0.0034318336,0.0003764225],"about_ca_topic_score_codex":0.000005353792,"about_ca_topic_score_gemma":0.00003074109,"teacher_disagreement_score":0.9243774,"about_ca_system_score_codex":0.000041062198,"about_ca_system_score_gemma":0.000043709217,"threshold_uncertainty_score":0.8877823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44047052,0.000021890142,0.55456924,0.00013715924,0.0002622704,0.00020077487,0.0000255642,0.0005893329,0.0037232281],"genre_scores_gemma":[0.99384356,0.00013191969,0.005061967,0.0007516625,0.00013372791,0.0000032922483,0.00004432631,0.00001439185,0.000015131471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992554,0.000032560903,0.00016517713,0.00022556337,0.00013464046,0.00018665435],"domain_scores_gemma":[0.9996108,0.000023709646,0.00003870383,0.00014395647,0.00009444256,0.00008838875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004651135,0.00020711934,0.00019146666,0.0001054822,0.00005756979,0.000092663984,0.000073853014,0.000087181885,0.00009433184],"category_scores_gemma":[9.810492e-7,0.0001702559,0.00003079581,0.00006644416,0.000048477745,0.00011775665,0.000007770559,0.00018007413,0.00007445546],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028290446,0.00003877744,0.000036152713,0.000008135838,0.000011909558,0.000037623777,0.00006634996,0.00019593316,0.002574326,0.000015999,0.0014870394,0.9954995],"study_design_scores_gemma":[0.0023822994,0.0027871393,0.007083198,0.0021987685,0.00004475554,0.00025936522,0.000033336644,0.9255282,0.0562696,0.0013890328,0.0009443463,0.0010799157],"about_ca_topic_score_codex":0.0000039035226,"about_ca_topic_score_gemma":0.0000050669078,"teacher_disagreement_score":0.9944196,"about_ca_system_score_codex":0.000010189982,"about_ca_system_score_gemma":0.000008240388,"threshold_uncertainty_score":0.69428337},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8060521,0.00002516447,0.1925844,0.00001650352,0.00006863565,0.00006439186,0.0000010936462,0.00035228606,0.00083545165],"genre_scores_gemma":[0.97719383,0.000004952242,0.022713665,0.00004074216,0.000011535534,0.0000018649403,0.000018685942,0.000010700331,0.000004039061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996894,0.000014016315,0.000104523555,0.00006140354,0.00006666257,0.00006400901],"domain_scores_gemma":[0.9998633,0.000022124133,0.000015858584,0.000058722613,0.00002444627,0.000015494023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015020437,0.00005651255,0.000068515415,0.000050221643,0.000015852576,0.000009284764,0.000035904417,0.000023828568,0.000029293837],"category_scores_gemma":[0.0000024128776,0.000059413127,0.00002657251,0.00010230837,0.000014034983,0.000055077213,0.0000018109668,0.000035849356,0.0000034087816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005534419,0.000005819721,0.000042970878,0.00000439232,0.0000026911976,7.198624e-7,0.000017752447,0.9583919,0.0014433401,0.0000054781826,0.00016062372,0.039918743],"study_design_scores_gemma":[0.000108989516,0.000035806417,0.00048031023,0.000012475251,0.000005359617,0.0000016229654,0.0000018932739,0.98124707,0.017935101,0.00007752127,0.00003826709,0.00005561062],"about_ca_topic_score_codex":0.0000066415278,"about_ca_topic_score_gemma":3.8779046e-7,"teacher_disagreement_score":0.17114174,"about_ca_system_score_codex":0.000010863072,"about_ca_system_score_gemma":0.000002205693,"threshold_uncertainty_score":0.2422797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1418964,0.00021304317,0.8514374,0.00012035451,0.0001503214,0.00023496768,0.000008925941,0.0003249622,0.0056136465],"genre_scores_gemma":[0.97561705,0.000029486595,0.024106184,0.000058921236,0.00007371625,0.0000028777226,0.000018437455,0.00001224975,0.00008105872],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995328,0.000028108358,0.000102666665,0.00013393628,0.00010441198,0.000098079145],"domain_scores_gemma":[0.9997285,0.00003686696,0.000020524576,0.00017310218,0.00002383827,0.000017181592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118850054,0.00007010008,0.00006881207,0.00007129138,0.000057926154,0.00005218377,0.00006466446,0.000050471503,0.00001955156],"category_scores_gemma":[0.00003892326,0.000057992176,0.00000804586,0.00016499017,0.0000065165664,0.00018093089,0.0000251692,0.00007482782,0.000001668667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052057076,0.0002414211,0.010676771,0.00006209883,0.00020052872,0.000004102266,0.0017818473,0.29905644,0.49306345,0.0001630598,0.15329403,0.0414042],"study_design_scores_gemma":[0.00013304502,0.000006200759,0.0051904023,0.0000071014565,0.0000092548535,0.0000039515535,0.00005426956,0.9539512,0.039487813,0.0000801019,0.0009854389,0.000091226786],"about_ca_topic_score_codex":0.000041175113,"about_ca_topic_score_gemma":0.000017466047,"teacher_disagreement_score":0.8337207,"about_ca_system_score_codex":0.00006784624,"about_ca_system_score_gemma":0.0000019342262,"threshold_uncertainty_score":0.23648524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548731,0.00004665854,0.039883375,0.00020929922,0.000024722602,0.00044699924,0.000013516273,0.0000749667,0.0044273897],"genre_scores_gemma":[0.981091,0.00005265512,0.018748686,0.000006618702,0.000032058484,0.000025990485,0.0000048466504,0.000019022373,0.000019078963],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904203,0.000062780266,0.00027279535,0.000101087426,0.0003623614,0.00015896991],"domain_scores_gemma":[0.99885416,0.00024534733,0.000023000686,0.00041133518,0.00043582075,0.000030355273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490203,0.000090975904,0.00016206496,0.00016281352,0.00018864434,0.00005740609,0.00019434364,0.000054431497,0.000027759144],"category_scores_gemma":[0.00020791612,0.000067535104,0.000029144201,0.00027916284,0.00060440315,0.00007789281,0.00007626084,0.00018244449,0.000018438372],"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.000014588725,0.00020144241,0.0000054019083,0.00033733045,0.000056387467,8.1734345e-7,0.0021900316,0.012984013,0.6326255,0.34633726,0.004418067,0.00082914345],"study_design_scores_gemma":[0.00006408548,0.00006599985,0.000038999435,0.00013812145,0.000004264622,0.0000024027338,0.00015842136,0.4302378,0.5523984,0.016830971,0.000010024282,0.000050507213],"about_ca_topic_score_codex":0.000017631057,"about_ca_topic_score_gemma":0.0000415617,"teacher_disagreement_score":0.4172538,"about_ca_system_score_codex":0.000023559322,"about_ca_system_score_gemma":0.000021756636,"threshold_uncertainty_score":0.27540016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44086123,0.00028145473,0.5584101,0.000004790369,0.00009007831,0.00007997415,0.000006893623,0.00012954518,0.00013591886],"genre_scores_gemma":[0.980239,0.000007412872,0.019674785,0.00000740867,0.000027565515,0.0000087483395,0.0000016130259,0.000025304364,0.000008201059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.000025222673,0.0003388894,0.00011945097,0.00030432176,0.00018735799],"domain_scores_gemma":[0.999521,0.00009086228,0.000107028995,0.0001271055,0.000097576274,0.000056405628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014087073,0.00014630484,0.00021583219,0.00023799231,0.0000686284,0.000011829673,0.000081569044,0.00008878556,0.00003557712],"category_scores_gemma":[0.0000023788186,0.00013791303,0.0000714185,0.00028657512,0.000053244563,0.00013555172,0.0000012618174,0.00014091976,0.0000064200412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046386827,0.00014538375,0.00000304018,0.0000776954,0.000017062433,4.600195e-7,0.00015328705,0.81108105,0.06655229,0.000011350194,0.0000313658,0.12188062],"study_design_scores_gemma":[0.000117799565,0.000041646803,0.000058121772,0.00027232338,0.000036092806,0.000006051195,0.000019367146,0.51407737,0.48522794,0.000051615556,0.00000823968,0.000083433166],"about_ca_topic_score_codex":0.000015113665,"about_ca_topic_score_gemma":7.9737987e-7,"teacher_disagreement_score":0.53937775,"about_ca_system_score_codex":0.00003845145,"about_ca_system_score_gemma":0.00002306262,"threshold_uncertainty_score":0.562393},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9954436,0.00016466816,0.00094555796,0.0003033802,0.00024180855,0.0003041267,0.000013727767,0.000302267,0.0022808954],"genre_scores_gemma":[0.891081,0.000077740064,0.10845831,0.00004512975,0.00022320935,0.000017354401,0.000005366695,0.000060936698,0.00003100295],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863607,1.1092869e-8,0.0004528308,0.00023740173,0.00040396772,0.0002697512],"domain_scores_gemma":[0.9985406,0.00009333712,0.0001533219,0.000051302897,0.0010384936,0.00012296469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029990426,0.00025474708,0.00033157787,0.00009212822,0.000049724982,0.00011295662,0.0003616795,0.00014787211,0.0000013882915],"category_scores_gemma":[0.0002866478,0.00023000801,0.00020040164,0.00019516368,0.00016011232,0.00031028077,0.000103204184,0.00020130696,6.8950186e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059208636,0.00004241535,0.0002542395,0.00035797566,0.00030694253,3.216827e-7,0.00036339177,0.001811914,0.84653616,0.14248249,0.006443668,0.0013412891],"study_design_scores_gemma":[0.0007897273,0.00018528002,0.00036633876,0.00040418954,0.00013586212,0.000041575906,0.0007357006,0.71493375,0.27636802,0.0028717124,0.0027793439,0.0003884812],"about_ca_topic_score_codex":0.00000878681,"about_ca_topic_score_gemma":1.739531e-7,"teacher_disagreement_score":0.71312183,"about_ca_system_score_codex":0.00008162523,"about_ca_system_score_gemma":0.000015632799,"threshold_uncertainty_score":0.9379454},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.232897,0.0012311406,0.469067,0.00044733885,0.0005567692,0.00014822502,5.1717774e-7,0.007925845,0.28772616],"genre_scores_gemma":[0.9963788,0.000020150048,0.0028502804,0.00032164954,0.0001975068,0.0000015231361,8.2578794e-7,0.000011263388,0.00021802017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997659,0.000002807455,0.000053731917,0.00004497094,0.000029873221,0.000102755774],"domain_scores_gemma":[0.9998587,0.000008186888,0.0000033319648,0.00009831737,0.000007923364,0.000023555469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000012522821,0.00005109759,0.000051006686,0.000015767744,0.0000124314165,0.000013052839,0.000048799462,0.000029326924,0.00012542498],"category_scores_gemma":[9.481921e-7,0.000046105455,0.000018731751,0.00003300402,0.000008051091,0.000044854365,0.000009786417,0.0000609905,0.00002695028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019880888,0.000007762743,0.00023502538,0.0000015724811,0.000017167802,0.000006464875,0.000029916631,0.7086178,0.0022732082,0.0017772645,0.13944529,0.14758655],"study_design_scores_gemma":[0.000034207034,0.000004066341,0.00018229197,0.000002205818,0.0000017387957,0.000004979173,0.000002340252,0.9625644,0.010388543,0.000049412294,0.026701009,0.00006478245],"about_ca_topic_score_codex":0.0000031694808,"about_ca_topic_score_gemma":0.000004974246,"teacher_disagreement_score":0.7634818,"about_ca_system_score_codex":0.0000075683943,"about_ca_system_score_gemma":5.646434e-7,"threshold_uncertainty_score":0.18801259},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23633328,0.00023857084,0.5662801,0.0008467556,0.0010554672,0.0005457287,0.00009089843,0.0020018655,0.19260731],"genre_scores_gemma":[0.98173827,0.000011300891,0.017103925,0.00013818289,0.0002483559,0.000013044171,0.000121914105,0.000028438546,0.0005965506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989289,0.00004293772,0.00018824899,0.00026936948,0.00018746094,0.0003830781],"domain_scores_gemma":[0.9991775,0.0001029142,0.000057618898,0.00040875937,0.00010301484,0.00015019889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014174716,0.00019762038,0.00019354174,0.00020096728,0.00056192087,0.00006767972,0.00034390012,0.00013731487,0.0000071392287],"category_scores_gemma":[0.000053814965,0.00024485844,0.00013163107,0.00019361259,0.00022414527,0.0003848559,0.000066993474,0.00018849492,0.000010189746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047768404,0.000051456507,0.00049797655,0.000062944186,0.00013010901,0.00008477776,0.00026068088,0.053244177,0.09157133,0.8402578,0.01194738,0.0018435873],"study_design_scores_gemma":[0.0013571194,0.00018079381,0.0036053208,0.0003827983,0.00023176937,0.0010782991,0.00038188216,0.5766621,0.14050454,0.026438678,0.24786276,0.0013139467],"about_ca_topic_score_codex":0.000049914834,"about_ca_topic_score_gemma":0.00001048141,"teacher_disagreement_score":0.8138191,"about_ca_system_score_codex":0.0005983594,"about_ca_system_score_gemma":0.0001271859,"threshold_uncertainty_score":0.99850374},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3587667,0.0008221076,0.2735731,0.00031604833,0.0022549278,0.0008537356,0.000027106285,0.009328997,0.35405728],"genre_scores_gemma":[0.9494861,0.00016436155,0.04619322,0.00022945108,0.0004414744,0.000022441978,0.00013894521,0.000095229116,0.0032288267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99853945,0.00003681754,0.00036484783,0.0002302973,0.00026980828,0.00055878353],"domain_scores_gemma":[0.9990124,0.000055459896,0.00006152535,0.0005651978,0.00011304988,0.00019235272],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012156012,0.00029777727,0.00028829105,0.00018373484,0.000086254106,0.000060422484,0.0002214942,0.00022168145,0.0011192507],"category_scores_gemma":[0.00003832794,0.0002849755,0.00010569976,0.00027370418,0.000042601907,0.0003908033,0.00007881642,0.00016648865,0.00053670246],"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.000031889154,0.00019867928,0.006260127,0.00006454122,0.000245815,0.000013299314,0.0013060303,0.003618814,0.27242845,0.008815692,0.6982268,0.00878986],"study_design_scores_gemma":[0.00037170877,0.000053992007,0.004556309,0.00006860374,0.00007642917,0.000046410656,0.000022956418,0.014284133,0.08919991,0.00042309455,0.8901554,0.00074106175],"about_ca_topic_score_codex":0.0000126807345,"about_ca_topic_score_gemma":0.000033190918,"teacher_disagreement_score":0.59071934,"about_ca_system_score_codex":0.00007836047,"about_ca_system_score_gemma":0.000019575229,"threshold_uncertainty_score":0.99996024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005150655,0.000050810966,0.9776859,0.0001582894,0.00012811476,0.00021208705,0.0000044971644,0.0019816037,0.014628],"genre_scores_gemma":[0.61631143,0.0000070674246,0.38316125,0.00029292746,0.00010638589,0.000009487954,0.000004192828,0.00002283542,0.00008444582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932045,0.0000066529033,0.00015172316,0.0001477724,0.00010570562,0.00026769127],"domain_scores_gemma":[0.9996546,0.00006454903,0.000018849809,0.00017273937,0.00003862991,0.000050647857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010492283,0.00014469944,0.00015223151,0.00009215735,0.00007991629,0.00010081502,0.00014282254,0.000057231708,0.000020316988],"category_scores_gemma":[0.000009633375,0.00014433828,0.00007998686,0.00008616374,0.0000091476795,0.000115482144,0.000011432224,0.00009521428,0.000006957484],"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.000006067287,0.000034869605,0.0000037773332,0.000023081991,0.000030115822,0.000027085413,0.00014504835,0.004935056,0.71718943,0.0017503107,0.01685719,0.25899798],"study_design_scores_gemma":[0.00020003162,0.00003934901,0.000024045092,0.000065729895,0.000011698582,0.000007442781,0.000025294516,0.63169414,0.36316508,0.0025866854,0.0019824633,0.00019807057],"about_ca_topic_score_codex":0.0000065358627,"about_ca_topic_score_gemma":0.0000012142017,"teacher_disagreement_score":0.62675905,"about_ca_system_score_codex":0.00003835092,"about_ca_system_score_gemma":0.0000071300024,"threshold_uncertainty_score":0.58859444},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27655163,0.00007674001,0.025121773,0.00012017535,0.00012634987,0.00007994785,1.08063155e-7,0.00283121,0.6950921],"genre_scores_gemma":[0.99380225,0.000006211076,0.005012455,0.000105882646,0.000026103993,0.000005421051,3.047804e-7,0.000007054624,0.0010342879],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998633,0.0000010894628,0.000029028426,0.000027017888,0.0000215384,0.000057977486],"domain_scores_gemma":[0.999892,0.0000037299064,0.0000013796762,0.00007819887,0.00000981219,0.000014880888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000004641364,0.000030218473,0.000027279177,0.000013789072,0.0000059989316,0.000013298988,0.00003070951,0.000014514448,0.0006930461],"category_scores_gemma":[0.0000010191286,0.000024159499,0.000009813518,0.000023148628,0.000003997978,0.00004049521,0.000006079304,0.000023161416,0.0005834765],"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":[1.2481756e-7,0.0000039821225,0.00020891415,0.0000019202464,0.000009763657,0.0000014225066,0.00001838202,0.0006109492,0.08162761,0.0025075008,0.8773712,0.03763826],"study_design_scores_gemma":[0.00012463453,0.000019464342,0.010123923,0.00001847896,0.00000480495,0.000012167209,0.000029519595,0.1891581,0.63751686,0.013886307,0.14874072,0.0003650043],"about_ca_topic_score_codex":0.000027881582,"about_ca_topic_score_gemma":0.0000010269184,"teacher_disagreement_score":0.7286304,"about_ca_system_score_codex":0.0000031073848,"about_ca_system_score_gemma":4.785906e-7,"threshold_uncertainty_score":0.75883687},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49592528,0.0018338396,0.36947086,0.0005463432,0.00010724894,0.0006152827,0.0000016285237,0.0043284157,0.1271711],"genre_scores_gemma":[0.75877017,0.000057322828,0.24074659,0.00030446408,0.000050724375,7.731224e-7,0.0000079184665,0.00002540284,0.00003665414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991285,0.00003462937,0.0002409292,0.00016860628,0.00015659929,0.00027072759],"domain_scores_gemma":[0.99925375,0.000057584275,0.00003850057,0.00052247866,0.00007449872,0.000053204076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005231623,0.00019753887,0.00022863445,0.00001233006,0.00014050103,0.00008735527,0.00018364338,0.00011049593,0.000055550794],"category_scores_gemma":[0.000009634632,0.00019559907,0.00006820109,0.00012640406,0.000044363394,0.0002354638,0.000046737347,0.00022641647,0.000035877634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003484771,0.00010792308,0.000025660873,0.00002180358,0.00013629951,0.0001131797,0.0008664708,0.56624556,0.36454114,0.00454042,0.016191674,0.04717502],"study_design_scores_gemma":[0.00016808245,0.000024764167,0.00006719076,0.0002398099,0.000024475892,0.00009794493,0.000036039823,0.86336696,0.13111918,0.003015773,0.0015564847,0.00028331298],"about_ca_topic_score_codex":0.000030157385,"about_ca_topic_score_gemma":9.3404987e-7,"teacher_disagreement_score":0.2971214,"about_ca_system_score_codex":0.000081425576,"about_ca_system_score_gemma":0.000009518761,"threshold_uncertainty_score":0.7976299},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32507366,0.00036712902,0.5444503,0.000007774052,0.0004973646,0.00031761196,0.0000963047,0.003933198,0.1252567],"genre_scores_gemma":[0.8219486,0.000024939234,0.17761551,0.000060549773,0.00013696006,7.868663e-7,0.00011785963,0.000046530236,0.00004828051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988462,0.000038372622,0.00023713576,0.0004137526,0.00014887388,0.00031566658],"domain_scores_gemma":[0.9986849,0.00015046766,0.000051016174,0.0009772476,0.00005149729,0.000084870655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008270362,0.00023382426,0.00027373864,0.00007408562,0.00008290528,0.0000608695,0.0004488273,0.000121851364,0.000060038914],"category_scores_gemma":[0.00005286982,0.000230472,0.000047190355,0.000116163814,0.000043456213,0.00027729114,0.00031007157,0.00024119687,0.00003317557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002997349,0.0007292174,0.0011356134,0.00020782034,0.0025210131,0.002751686,0.014445229,0.07303347,0.215099,0.0007237172,0.055438526,0.63361496],"study_design_scores_gemma":[0.00014289867,0.000022142322,0.00009381803,0.000074359734,0.000048840546,0.00003742193,0.00018517103,0.93740207,0.05931089,0.0013439978,0.0009771317,0.00036124178],"about_ca_topic_score_codex":0.00083597394,"about_ca_topic_score_gemma":0.000035197892,"teacher_disagreement_score":0.8643686,"about_ca_system_score_codex":0.000030556046,"about_ca_system_score_gemma":0.000009472975,"threshold_uncertainty_score":0.9398375},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15597922,0.00028590692,0.75649196,0.0006298718,0.00037284495,0.00024006175,0.000023664868,0.0056762765,0.08030022],"genre_scores_gemma":[0.9892131,0.000016026239,0.009977441,0.00016257628,0.000047522073,0.000005960009,0.00002591106,0.000026287173,0.0005251932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993346,0.0000071043187,0.0001578199,0.00015829103,0.00012308161,0.00021911191],"domain_scores_gemma":[0.9995697,0.000012640009,0.000016659229,0.00030309238,0.000025094429,0.00007279367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048437996,0.00014535611,0.00020749826,0.0001994297,0.000033058233,0.000032614935,0.0001295813,0.00007206751,0.00061904604],"category_scores_gemma":[0.0000068063932,0.00013112681,0.00014151022,0.00041924632,0.00002271517,0.000077963814,0.0000253446,0.000119073484,0.00009845762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091885675,0.00046497467,0.015944753,0.00011329721,0.008041664,0.0007852364,0.0013348398,0.6664117,0.13304222,0.021842672,0.11825172,0.033675026],"study_design_scores_gemma":[0.001962211,0.00030914313,0.04101813,0.000085680564,0.0019937486,0.0000749619,0.00025648074,0.44793665,0.41421103,0.008038919,0.081693806,0.0024192256],"about_ca_topic_score_codex":0.00012826116,"about_ca_topic_score_gemma":0.00017685018,"teacher_disagreement_score":0.8332339,"about_ca_system_score_codex":0.0000620387,"about_ca_system_score_gemma":0.000012594144,"threshold_uncertainty_score":0.677812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078781776,0.0005051904,0.91273594,0.000009944339,0.0005548739,0.00022036629,0.000022725279,0.0009931833,0.0061760186],"genre_scores_gemma":[0.99662477,0.0008195087,0.0014501689,0.000029253895,0.00016928988,0.0000010560346,0.000049809616,0.000053933905,0.0008022119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989004,0.00012587434,0.00015478779,0.0005138842,0.00006640781,0.00023863217],"domain_scores_gemma":[0.99898213,0.000050163493,0.0000757355,0.0006300832,0.00011922563,0.00014267987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002573877,0.000302079,0.00031562115,0.00016220722,0.00006363192,0.00005755013,0.0002796452,0.0003729705,0.000017147666],"category_scores_gemma":[0.000014988241,0.0003683322,0.00009284171,0.00015968028,0.00009893637,0.00022177429,0.00044468557,0.00041201722,0.000012501344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057336823,0.000018324092,0.000027995478,0.00003326019,0.00012541498,0.00014608933,0.000091692316,0.9669882,0.00007927684,0.028897695,0.0016310076,0.0019036839],"study_design_scores_gemma":[0.00014226108,0.000017318744,0.000011485395,0.00007195498,0.00008183502,0.00000698395,0.000022618122,0.63742197,0.00067764084,0.36088237,0.0003751521,0.00028840973],"about_ca_topic_score_codex":0.000033976612,"about_ca_topic_score_gemma":0.000006315016,"teacher_disagreement_score":0.917843,"about_ca_system_score_codex":0.00012544976,"about_ca_system_score_gemma":0.000049360053,"threshold_uncertainty_score":0.99987686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9224312,0.00020562398,0.066608235,0.000009443208,0.0008708304,0.0002699337,0.000037003156,0.001792071,0.007775673],"genre_scores_gemma":[0.99848074,0.000074523894,0.0008168405,0.000024204477,0.00016440044,5.704575e-7,0.00002862786,0.000056717756,0.00035335374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989076,0.00004200556,0.00014526778,0.0004910986,0.00008004386,0.00033393822],"domain_scores_gemma":[0.99878365,0.000022540327,0.00006721919,0.0007988855,0.00015702765,0.00017067922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000091623166,0.00033846495,0.0003280658,0.0001944471,0.000048969625,0.000035034584,0.00050470914,0.00038341098,0.000040506588],"category_scores_gemma":[0.000016493615,0.00038639476,0.00015503356,0.00022526247,0.00006174188,0.00004056387,0.0005157042,0.00063259236,0.00007139602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001749002,0.00001605117,0.000107985594,0.000029926598,0.000089138455,0.00017955537,0.00009072951,0.99366814,0.0005283319,0.0014385626,0.0036956822,0.00013838566],"study_design_scores_gemma":[0.00027280248,0.000019557108,0.00016067529,0.000116034265,0.000099476376,0.000005602485,0.000043297092,0.98180336,0.005411028,0.008688875,0.002868968,0.0005103442],"about_ca_topic_score_codex":0.000053161442,"about_ca_topic_score_gemma":0.000018748531,"teacher_disagreement_score":0.07604957,"about_ca_system_score_codex":0.0002371987,"about_ca_system_score_gemma":0.0000700463,"threshold_uncertainty_score":0.9998588},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041911,0.00031787733,0.9835736,0.0001459258,0.0002909354,0.00015859358,0.0000059136332,0.0014561196,0.004009105],"genre_scores_gemma":[0.85729855,0.00008369674,0.142188,0.00006433364,0.00017861037,0.0000234755,0.00012316738,0.000027685915,0.000012494887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994657,0.000049715538,0.00016033028,0.00009953364,0.00009509355,0.00012963949],"domain_scores_gemma":[0.99856263,0.00003369103,0.000034174085,0.001151479,0.00014994566,0.00006805593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042802978,0.00012264815,0.00013027363,0.000040550738,0.00008176953,0.000072299816,0.00047931148,0.000041221756,0.0000023737173],"category_scores_gemma":[0.0000024521757,0.00013346807,0.000043561082,0.00018987957,0.000045036075,0.00014341286,0.00025028957,0.00017475273,0.000054398606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010263626,0.00080537767,0.00069261517,0.000037779824,0.00048323095,0.0000056322724,0.004560631,0.12845206,0.022140147,0.06483398,0.14413446,0.63384384],"study_design_scores_gemma":[0.00015217719,0.00001696324,0.0005517382,0.000026321755,0.000011487098,0.0000023651696,0.000010426934,0.98422307,0.002302024,0.007862026,0.0046864673,0.00015493968],"about_ca_topic_score_codex":0.000013363229,"about_ca_topic_score_gemma":0.0000032485027,"teacher_disagreement_score":0.855771,"about_ca_system_score_codex":0.000057892586,"about_ca_system_score_gemma":0.000016921756,"threshold_uncertainty_score":0.544267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12586221,0.00023046225,0.8703635,0.00036899865,0.0023255849,0.00014242652,0.000104745886,0.00020883011,0.0003932696],"genre_scores_gemma":[0.9908672,0.00008286209,0.0073444294,0.0002835252,0.0010697065,6.933969e-7,0.00028257052,0.000064537744,0.0000044703393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977246,0.00015943036,0.000820363,0.0002651838,0.00063610263,0.0003943379],"domain_scores_gemma":[0.9980611,0.00038106376,0.00030824923,0.00050580833,0.00055176247,0.00019199924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063115556,0.00030036984,0.00043197442,0.00028341237,0.000039585924,0.00018400715,0.000835524,0.00020755574,0.00000724975],"category_scores_gemma":[0.0001457952,0.00029595545,0.00011033096,0.00025523134,0.000053956937,0.00026364648,0.0001538541,0.0009087801,0.0000026742346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003296749,0.00005222173,0.00072311773,0.0000034267844,0.000118270495,0.0005709223,0.000032044143,0.98820513,0.00042371312,0.000010593161,0.006506008,0.003024867],"study_design_scores_gemma":[0.0014490569,0.00005457265,0.00043615192,0.0007760025,0.00002898875,0.00017258794,0.000094649644,0.9935306,0.00074152136,0.000039585233,0.002391679,0.0002846461],"about_ca_topic_score_codex":0.00002707724,"about_ca_topic_score_gemma":0.000029127967,"teacher_disagreement_score":0.865005,"about_ca_system_score_codex":0.0003047198,"about_ca_system_score_gemma":0.000046092136,"threshold_uncertainty_score":0.9999493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403489,0.0002979578,0.35304585,0.00018286273,0.00032128222,0.00014403544,0.0000047058174,0.0004234596,0.005230962],"genre_scores_gemma":[0.99839574,0.000014536548,0.0011289744,0.00016524541,0.00023581638,7.5444325e-7,0.000012141407,0.00002821106,0.000018582581],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916023,0.00016224089,0.00018395466,0.00015163045,0.00014041764,0.00020153183],"domain_scores_gemma":[0.99844867,0.00044331228,0.00007348483,0.0009694432,0.000043145115,0.000021936172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058359787,0.0001288471,0.00017035255,0.000047454792,0.00017552494,0.000040015897,0.000583387,0.00004018764,0.0000030245014],"category_scores_gemma":[0.00006193836,0.00008221324,0.000035400073,0.0001532885,0.00013080453,0.000096723394,0.00018931838,0.00019797134,0.00002557403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003835667,0.000032962165,0.00025878564,0.00007593316,0.00012470943,0.0000067065757,0.0027248454,0.051403817,0.81629544,0.00080172595,0.017326161,0.11091056],"study_design_scores_gemma":[0.000082619,0.000012371202,0.0002621449,0.00016672236,0.000039899474,0.000058279897,0.00004304578,0.8824821,0.11267707,0.0011795885,0.0028773788,0.00011876372],"about_ca_topic_score_codex":0.00008345248,"about_ca_topic_score_gemma":0.000004305339,"teacher_disagreement_score":0.8310783,"about_ca_system_score_codex":0.000022176055,"about_ca_system_score_gemma":0.0000061132905,"threshold_uncertainty_score":0.33525586},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36791125,0.000058400637,0.61872154,0.00010019572,0.00025448448,0.00015337697,0.0000017440608,0.001943476,0.010855551],"genre_scores_gemma":[0.9572356,0.000005154319,0.0425598,0.000055574612,0.000031156596,0.000006880395,0.0000045775196,0.000026028229,0.000075282405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951035,0.00001065239,0.000102482794,0.000121898534,0.000108102126,0.00014652322],"domain_scores_gemma":[0.9996372,0.000011733678,0.000015435744,0.00020100735,0.00006129584,0.0000733642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004380248,0.00011473743,0.00011203267,0.00006042652,0.000021031967,0.000024397656,0.000064960564,0.00006254926,0.000025608804],"category_scores_gemma":[0.000004062797,0.00009288428,0.000023743512,0.0000971493,0.000038254897,0.00007864431,0.000007999237,0.00009895145,0.000031127693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004323142,0.00018899493,0.005144995,0.00013878536,0.00029283698,0.00021030601,0.00047239073,0.30964974,0.029822888,0.0006765668,0.027232558,0.6257376],"study_design_scores_gemma":[0.00045025517,0.000085322186,0.00019069306,0.00008899283,0.000015576623,0.00004909726,0.000057194622,0.9454462,0.052325092,0.00018859479,0.0008961584,0.00020681511],"about_ca_topic_score_codex":0.00005671274,"about_ca_topic_score_gemma":0.00013093134,"teacher_disagreement_score":0.6357965,"about_ca_system_score_codex":0.00005626196,"about_ca_system_score_gemma":0.000031507698,"threshold_uncertainty_score":0.3787711},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043327518,0.00008323815,0.62621117,0.000092830705,0.00012308439,0.00012243407,0.0000011114079,0.0021039576,0.32793465],"genre_scores_gemma":[0.905098,0.000008924468,0.094623975,0.000081469305,0.00006519035,0.000008234524,0.000007921452,0.000014916956,0.000091366186],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996075,0.000014936627,0.0000758263,0.000083758474,0.00010138949,0.000116571086],"domain_scores_gemma":[0.9997159,0.000014192284,0.0000055598784,0.00014734583,0.000038625632,0.00007834961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006894796,0.00007311737,0.00008046453,0.000033130967,0.00001297816,0.00002933982,0.00004176506,0.000053064105,0.000015325777],"category_scores_gemma":[0.000016903388,0.000065052336,0.000020422358,0.00006355781,0.000016711148,0.0001156512,0.000015714031,0.00008676711,0.00006366891],"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.000054051652,0.0002794716,0.0003582419,0.00002766673,0.000117263095,0.00009520872,0.00096739683,0.01658049,0.021974025,0.05005728,0.9030393,0.0064496156],"study_design_scores_gemma":[0.00036520022,0.00008651213,0.00010072676,0.000022159762,0.00003026169,0.00024969334,0.0004326824,0.88590413,0.067860074,0.003892757,0.04069377,0.0003620029],"about_ca_topic_score_codex":0.00002102742,"about_ca_topic_score_gemma":0.0000021507678,"teacher_disagreement_score":0.8693237,"about_ca_system_score_codex":0.000028680453,"about_ca_system_score_gemma":0.000011775472,"threshold_uncertainty_score":0.26527575},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21861841,0.000099054494,0.7602047,0.00029464072,0.00035746003,0.0003385214,0.00022221672,0.0008666381,0.018998364],"genre_scores_gemma":[0.9839053,0.000058542584,0.010115995,0.000074998,0.00004561512,0.0000015473818,0.000083852574,0.000023014523,0.005691117],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994067,0.00002334956,0.00008057298,0.00015862855,0.0001416881,0.00018907634],"domain_scores_gemma":[0.99965835,0.00003780486,0.000029460492,0.00016432827,0.000052614618,0.00005746095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029724557,0.000125549,0.00012296184,0.00012692918,0.00017367704,0.00007456434,0.00016621382,0.00007883461,0.0003244763],"category_scores_gemma":[0.0000065029876,0.00015582173,0.00005491862,0.00027276386,0.000032659842,0.0013686713,0.00005560025,0.00009942398,0.000068979156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000363098,0.00009826112,0.000663988,0.000027016891,0.00018461973,0.000050616538,0.00024353847,0.3493392,0.014715481,0.04351159,0.5904208,0.0007086129],"study_design_scores_gemma":[0.0005825729,0.000030770447,0.0013111877,0.00003912296,0.000034947687,0.000010244863,0.00034894503,0.97791356,0.001986624,0.00086948305,0.01645821,0.00041436014],"about_ca_topic_score_codex":0.00011136023,"about_ca_topic_score_gemma":0.000008063334,"teacher_disagreement_score":0.7652869,"about_ca_system_score_codex":0.00014971632,"about_ca_system_score_gemma":0.000020498856,"threshold_uncertainty_score":0.6354226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9135253,0.0004605271,0.0767638,0.000011579118,0.00035593013,0.00025240143,0.0000022096335,0.0007087874,0.0079195015],"genre_scores_gemma":[0.9941447,0.000005744949,0.005606098,0.000018918621,0.00008691656,0.0000010520886,0.00000643878,0.000030197001,0.00009996413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991927,0.000043369666,0.00021635323,0.0001534231,0.00015964569,0.00023449938],"domain_scores_gemma":[0.9995672,0.000033578028,0.000030131758,0.00020584116,0.000078004065,0.0000852598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012809352,0.00014688144,0.00021639183,0.00016276224,0.000026060285,0.00006781464,0.00009756063,0.000099735575,0.0000071937707],"category_scores_gemma":[0.000016504773,0.00014962564,0.000032904303,0.00017320033,0.000026891888,0.000150678,0.000039971615,0.0001183041,0.000045854315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005744042,0.000041789175,0.001254209,0.000029457118,0.00006794354,0.00009352058,0.0006120284,0.80275816,0.18522605,0.00023906343,0.00892413,0.0006961915],"study_design_scores_gemma":[0.00046138756,0.000013401128,0.0001048147,0.00014720304,0.00001155764,0.000035177556,0.00017362284,0.9794057,0.018814627,0.00011265155,0.0005212151,0.00019863885],"about_ca_topic_score_codex":0.00051764614,"about_ca_topic_score_gemma":0.000028478222,"teacher_disagreement_score":0.17664753,"about_ca_system_score_codex":0.00018148447,"about_ca_system_score_gemma":0.000019263001,"threshold_uncertainty_score":0.6101557},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97932255,0.00018915866,0.01763694,0.00009036008,0.0004478417,0.000046499874,0.0000032283956,0.000044658307,0.0022187496],"genre_scores_gemma":[0.9889484,0.0000027007127,0.010958349,0.0000140175625,0.00006711866,1.7780513e-7,1.08962716e-7,0.0000068771556,0.0000022622914],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993669,0.000043020005,0.00027007028,0.000032263655,0.00020652151,0.00008126318],"domain_scores_gemma":[0.99936765,0.000048739268,0.00012633235,0.00018822559,0.00020684511,0.00006220303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002287356,0.000064080385,0.0001804388,0.000026103955,0.000018056384,0.000009365244,0.00021217165,0.000026531505,0.000016401324],"category_scores_gemma":[0.0001260579,0.00004201648,0.0000802025,0.000082685256,0.00009189248,0.00006408566,0.000037680922,0.0001643954,0.0000013284692],"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.0012326061,0.0017685967,0.2330528,0.00074146414,0.0015596285,0.00017222243,0.005893431,0.12644845,0.19637726,0.11005473,0.30309415,0.01960466],"study_design_scores_gemma":[0.0014339699,0.0004917246,0.19515827,0.00048629582,0.00015254428,0.00044562528,0.00024992923,0.14616475,0.36311233,0.27627736,0.0155932475,0.0004339342],"about_ca_topic_score_codex":0.000008547196,"about_ca_topic_score_gemma":0.000005315828,"teacher_disagreement_score":0.2875009,"about_ca_system_score_codex":0.000043362554,"about_ca_system_score_gemma":0.00004489846,"threshold_uncertainty_score":0.17133823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2897524,0.000059384696,0.7068311,0.000031673844,0.00008937241,0.00018903619,0.000022026717,0.0005633362,0.0024616625],"genre_scores_gemma":[0.86299384,0.0000011492483,0.13681282,0.00003329681,0.000057712212,0.000013137353,0.00001211165,0.0000328819,0.000043041586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993388,0.000006874468,0.00016341772,0.00012039097,0.00011502217,0.00025548087],"domain_scores_gemma":[0.9995814,0.000048932456,0.000026343643,0.00019031839,0.00009064691,0.00006234607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009194811,0.00013163606,0.00020369115,0.00007359375,0.000027426813,0.000024864383,0.00009620224,0.000054925753,0.000008530946],"category_scores_gemma":[0.000010541285,0.00011737911,0.00005145355,0.00006793395,0.000026698157,0.00006981468,0.000017996246,0.00006130462,6.8327734e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013017183,0.00041634252,0.010700602,0.001215392,0.00041977255,0.000030629635,0.0036795698,0.7582377,0.19021411,0.0021060873,0.029359039,0.0023190244],"study_design_scores_gemma":[0.0012903905,0.00029245418,0.00026220357,0.00019103535,0.00003148829,0.0000054362504,0.00086182024,0.6486696,0.34593573,0.0004686158,0.0017000948,0.00029112175],"about_ca_topic_score_codex":0.0000227173,"about_ca_topic_score_gemma":0.00015415152,"teacher_disagreement_score":0.5732415,"about_ca_system_score_codex":0.00003216211,"about_ca_system_score_gemma":0.000023384086,"threshold_uncertainty_score":0.4786581},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.925064,0.00015151092,0.06866244,0.00015487582,0.0010665163,0.00020195867,0.000009130851,0.000868387,0.0038211334],"genre_scores_gemma":[0.96678,0.0000099810095,0.032453246,0.00012894165,0.0004447544,0.000001137893,0.0000022076772,0.000098980534,0.00008077318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981284,0.00011107716,0.00037380017,0.0002525023,0.0005690393,0.0005651607],"domain_scores_gemma":[0.99839455,0.000091675705,0.00015214451,0.00039125604,0.0005390887,0.0004312875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022771712,0.0003777769,0.00039057565,0.00025630786,0.0001812334,0.00022432503,0.0001847628,0.00012094362,0.000015972642],"category_scores_gemma":[0.00004178113,0.00031028813,0.00012232267,0.00024738043,0.00013790916,0.0001052117,0.000018044339,0.00068127416,0.000043282515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009433126,0.000042309923,0.000054445067,0.000009133822,0.00009023682,0.0017006003,0.00035517823,0.9010824,0.07234863,0.000002290364,0.023609187,0.00061126554],"study_design_scores_gemma":[0.0012581714,0.00015674469,0.00006812205,0.00034129116,0.00007754965,0.0038192058,0.00035951013,0.6727766,0.31717998,0.00005927897,0.0033533406,0.00055024074],"about_ca_topic_score_codex":0.000015129457,"about_ca_topic_score_gemma":0.0000043878567,"teacher_disagreement_score":0.24483134,"about_ca_system_score_codex":0.0001797483,"about_ca_system_score_gemma":0.00009647988,"threshold_uncertainty_score":0.9999349},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9382317,0.00013563347,0.0027945826,0.00021736934,0.00031477204,0.00038385886,0.0000033288811,0.0006227226,0.057296015],"genre_scores_gemma":[0.9981612,0.0004148009,0.0010823782,0.000053464613,0.000035341873,0.000012116258,3.5818852e-7,0.000029166493,0.00021120124],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99892503,0.000010981256,0.00031196655,0.00027026774,0.00020336518,0.00027840742],"domain_scores_gemma":[0.99928075,0.000043455242,0.000114134295,0.00015168861,0.00032004714,0.00008991445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017296463,0.00022549325,0.0002579431,0.00009893517,0.0001412401,0.000063010215,0.0003805007,0.00010870639,0.00016525225],"category_scores_gemma":[0.00016344547,0.0001824598,0.000069816764,0.00022680896,0.00029128464,0.0001318987,0.00013322919,0.00037704097,0.00003439643],"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.00012710948,0.00014178561,0.0032164939,0.00009750216,0.00007459563,0.000005308097,0.006153605,0.00011013591,0.59750456,0.36006683,0.0016199982,0.03088206],"study_design_scores_gemma":[0.000022993821,0.000120919794,0.00040036708,0.00032559055,0.0000281334,0.000012299791,0.0010920964,0.06402979,0.90767837,0.025717353,0.00032036027,0.0002517005],"about_ca_topic_score_codex":0.000047295165,"about_ca_topic_score_gemma":0.000009203469,"teacher_disagreement_score":0.33434948,"about_ca_system_score_codex":0.000017629478,"about_ca_system_score_gemma":0.000016278282,"threshold_uncertainty_score":0.7440495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26652414,0.00009829828,0.73128396,0.000048215603,0.00033573125,0.00052749517,0.00012606801,0.00039774872,0.000658357],"genre_scores_gemma":[0.9983512,0.000121669276,0.0011994021,0.00004751508,0.000096287615,6.786752e-7,0.0000164859,0.000058648573,0.00010811188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871427,0.000051848296,0.00019627449,0.0005441143,0.00008146033,0.00041203128],"domain_scores_gemma":[0.9985855,0.00031282494,0.00011788084,0.0008000737,0.00012288825,0.00006079054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000111526206,0.0004082753,0.00043197488,0.00020119867,0.00012777433,0.00005921264,0.0005470338,0.00034730387,0.000011782516],"category_scores_gemma":[0.000011771143,0.0003122438,0.00014765684,0.0002194286,0.00021395007,0.0001467629,0.00030564299,0.00058328226,0.0000030632746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002436389,0.000013149713,0.00030316136,0.000086933775,0.00023822635,0.00013934549,0.000073711344,0.99147,0.0007962356,0.0033664752,0.0005852019,0.002683947],"study_design_scores_gemma":[0.00097362476,0.00006196312,0.0014088349,0.00081231643,0.0001724713,0.000016400969,0.00013962737,0.9331259,0.012385188,0.0490547,0.0011286886,0.0007202807],"about_ca_topic_score_codex":0.00014925531,"about_ca_topic_score_gemma":0.0007869261,"teacher_disagreement_score":0.7318271,"about_ca_system_score_codex":0.0003040475,"about_ca_system_score_gemma":0.00007388418,"threshold_uncertainty_score":0.99993294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11091524,0.000051307445,0.75911254,0.00017115266,0.00022131698,0.00005666989,0.0000015063658,0.003422658,0.12604761],"genre_scores_gemma":[0.99156857,0.000021795626,0.007889715,0.00003896684,0.000039356044,1.2956069e-7,2.742363e-7,0.0000140935745,0.0004270747],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971855,0.0000060621596,0.000052318093,0.00006443788,0.000047049172,0.00011157604],"domain_scores_gemma":[0.99978065,0.000031110154,0.0000050983876,0.00013647857,0.000017847711,0.000028797465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000014630094,0.00006202548,0.00006107706,0.000034993944,0.000017238945,0.000009040624,0.000050266106,0.000028909275,0.000076157914],"category_scores_gemma":[0.0000030073745,0.000041411437,0.000020912137,0.000038262366,0.00001969034,0.00006126524,0.000015996806,0.000025347257,0.000059377886],"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.000003935922,0.0000037249406,0.00007125051,0.0000023080247,0.000024207007,0.000025571468,0.0000281081,0.0003115997,0.87244195,0.0027200892,0.037230354,0.08713692],"study_design_scores_gemma":[0.00023630146,0.000011719187,0.00019755513,0.000064677944,0.0000060176335,0.000013045358,0.00001703069,0.026979037,0.92363244,0.0015246677,0.04712474,0.00019277591],"about_ca_topic_score_codex":0.000008822368,"about_ca_topic_score_gemma":0.0000034203363,"teacher_disagreement_score":0.8806534,"about_ca_system_score_codex":0.000019526433,"about_ca_system_score_gemma":0.0000024753958,"threshold_uncertainty_score":0.16887094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022009398,0.00022794698,0.9947091,0.000035248002,0.00039126864,0.0011779168,0.000012578149,0.0016095582,0.0016163333],"genre_scores_gemma":[0.01302761,0.0000150958585,0.9859182,0.000025613823,0.00029252536,0.00045280124,0.000085686006,0.00011826744,0.00006420412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873894,0.00005163708,0.00041544123,0.00032021923,0.00012681156,0.00034696446],"domain_scores_gemma":[0.9989502,0.00021872825,0.000086950226,0.00051186694,0.00014942804,0.00008284178],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052608544,0.000318163,0.00048006422,0.00009619151,0.00006670708,0.00018011707,0.00028898846,0.00038455028,0.000053422904],"category_scores_gemma":[0.000267089,0.0003090754,0.00018263595,0.00007554966,0.00008601499,0.000031818734,0.00025695827,0.00029692936,0.0000143143825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004044169,0.00021670035,0.0000076286806,0.005923083,0.0008192243,0.0000083602545,0.001670391,0.16219603,0.0010438133,0.011006456,0.01950649,0.7975614],"study_design_scores_gemma":[0.00010138426,0.00004287387,5.693756e-7,0.00047272583,0.00009087275,0.0000066536372,0.000022443528,0.90055877,0.009324994,0.078210466,0.010799096,0.00036915118],"about_ca_topic_score_codex":0.0000013851309,"about_ca_topic_score_gemma":2.7204135e-7,"teacher_disagreement_score":0.7971922,"about_ca_system_score_codex":0.00005482205,"about_ca_system_score_gemma":0.000019739711,"threshold_uncertainty_score":0.99993616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988612,0.0003760763,0.097531125,0.0002531084,0.00027549703,0.00020844211,0.0000693069,0.00046966912,0.001955536],"genre_scores_gemma":[0.99907976,0.000025470506,0.00062405644,0.000100634155,0.00006478048,0.0000015771054,0.000004441397,0.000029317793,0.00006995566],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99934393,0.00002730409,0.00016963566,0.00012479658,0.00011721919,0.00021708789],"domain_scores_gemma":[0.99942046,0.00012550244,0.000066029825,0.00029142929,0.000067752764,0.000028838098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043561635,0.00014580862,0.00016835006,0.000023308126,0.000056646793,0.000012277455,0.00015801867,0.000031988828,0.0000065117],"category_scores_gemma":[0.000008554015,0.00009497364,0.00006870378,0.00008094396,0.00012950748,0.000075461205,0.000048564936,0.00008510486,0.000016005803],"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.000004215108,0.000009374361,0.000107778,0.000007789714,0.000038443337,0.0000035339917,0.00010155609,0.00011044807,0.93507326,0.00013798165,0.007954511,0.056451138],"study_design_scores_gemma":[0.00039483627,0.000014989828,0.00060278474,0.00027425666,0.00003416503,0.000018670666,0.00006160844,0.008077284,0.97920054,0.008578264,0.0024822592,0.0002603548],"about_ca_topic_score_codex":0.000039361774,"about_ca_topic_score_gemma":6.1557296e-7,"teacher_disagreement_score":0.10021853,"about_ca_system_score_codex":0.000022580063,"about_ca_system_score_gemma":0.000011199312,"threshold_uncertainty_score":0.38729125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12653545,0.00015261341,0.86518615,0.0000059636745,0.000550032,0.000646249,0.000027806303,0.001670541,0.0052251816],"genre_scores_gemma":[0.9644666,0.0002915481,0.034745794,0.000024525445,0.00007602337,0.0000038434905,0.00010993777,0.000086485226,0.00019524728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.00013667732,0.00023979414,0.0007144206,0.000115588555,0.0003765598],"domain_scores_gemma":[0.9985108,0.00005663907,0.0001549228,0.000853202,0.0002435227,0.00018092431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021198837,0.0004474225,0.00046998647,0.00078059733,0.000064837746,0.000058065605,0.00046772382,0.00045484936,0.000037064343],"category_scores_gemma":[0.00003463341,0.00053780637,0.00017631864,0.001057576,0.000051392315,0.00016163966,0.00049000554,0.0006160224,0.000026668402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032231423,0.00005611216,0.0001523712,0.00004948073,0.0001699432,0.00017280878,0.00009361077,0.99587995,0.00015680755,0.0007774699,0.0018292464,0.0006299743],"study_design_scores_gemma":[0.0004001424,0.000039833918,0.00016163691,0.00012445837,0.00020268247,0.000010290344,0.000019575416,0.9911568,0.0016432137,0.00518183,0.00048350828,0.00057602127],"about_ca_topic_score_codex":0.0003024311,"about_ca_topic_score_gemma":0.000022463028,"teacher_disagreement_score":0.83793116,"about_ca_system_score_codex":0.0004922417,"about_ca_system_score_gemma":0.000078619065,"threshold_uncertainty_score":0.99970734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056599868,0.000047225287,0.9897911,0.000024058023,0.00020645822,0.00020468845,0.0000061194605,0.001330083,0.002730308],"genre_scores_gemma":[0.5818189,0.0000022617999,0.41791362,0.000044731263,0.00010022849,0.000026437756,0.00001533846,0.000025392623,0.000053125026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995232,0.000008546117,0.00010176737,0.00011245126,0.00009923186,0.00015477452],"domain_scores_gemma":[0.9996536,0.000018104645,0.000015858051,0.00015781092,0.00007035024,0.00008429831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111464054,0.00010367287,0.00010358479,0.000056038825,0.000030303445,0.000049062546,0.00010377607,0.000053656466,0.0000042017355],"category_scores_gemma":[0.000006167854,0.00010058538,0.000026349935,0.00005129644,0.0000096642725,0.00022985727,0.000013211173,0.00005342085,0.0000136602075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023959417,0.000059184076,0.0000021529363,0.0000098902065,0.00005889908,0.000009198747,0.0012143209,0.41692516,0.0038730807,0.004225892,0.02162328,0.551975],"study_design_scores_gemma":[0.0001537675,0.000111561974,0.000010795436,0.000016705997,0.000008780733,0.0000057989855,0.00019792804,0.95217294,0.024459368,0.022316663,0.0004089173,0.00013679064],"about_ca_topic_score_codex":0.00004650725,"about_ca_topic_score_gemma":0.000008808889,"teacher_disagreement_score":0.5761589,"about_ca_system_score_codex":0.00003869679,"about_ca_system_score_gemma":0.000009012397,"threshold_uncertainty_score":0.41017526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012687032,0.00003334566,0.9726618,0.000020261095,0.00048389466,0.00016498132,0.000021527505,0.0007043427,0.013222806],"genre_scores_gemma":[0.998741,0.000042339754,0.000984241,0.000054615542,0.000014818392,0.000022379638,0.0000063111943,0.00000962271,0.00012472116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938947,0.00003769871,0.0002685106,0.00004130098,0.00016944845,0.0000935956],"domain_scores_gemma":[0.9995129,0.00006843736,0.000045702738,0.00017377584,0.00015021699,0.000048969257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014491582,0.000094913565,0.000119929704,0.00030073835,0.00005139671,0.00002145219,0.00008074039,0.00007300273,0.000037235965],"category_scores_gemma":[0.000015335489,0.00007228292,0.000050619077,0.00028220017,0.0000527245,0.0006043343,5.4393513e-7,0.00013428465,0.000051038445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015358434,0.00015076046,0.00001374053,0.00010295985,0.00027875046,0.0000017325832,0.005590833,0.77367157,0.0040624025,0.006187924,0.017481804,0.19092171],"study_design_scores_gemma":[0.0033836875,0.0003317795,0.000119437034,0.0001565719,0.00009031961,0.000035772104,0.0019147296,0.11984009,0.834561,0.011496064,0.02755752,0.00051300525],"about_ca_topic_score_codex":0.00001152463,"about_ca_topic_score_gemma":8.855476e-7,"teacher_disagreement_score":0.98605394,"about_ca_system_score_codex":0.000045080033,"about_ca_system_score_gemma":0.00002879105,"threshold_uncertainty_score":0.29476118},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003042338,0.00020782926,0.99262255,0.000018640301,0.0000841925,0.00056555204,0.0000015158047,0.00056531245,0.0028920916],"genre_scores_gemma":[0.052683137,0.0000021056344,0.9470481,0.00002198851,0.00003088502,0.000087862085,0.0000075668577,0.00004399765,0.0000743063],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991559,0.00004091006,0.00033546577,0.00013305355,0.00011329791,0.0002214155],"domain_scores_gemma":[0.99924254,0.00019022053,0.00005798659,0.00022927449,0.00019295457,0.00008699254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864702,0.00014435909,0.00033831928,0.000066718945,0.000023122982,0.00003755132,0.00012160955,0.00010809371,0.000026822083],"category_scores_gemma":[0.000251134,0.00013159448,0.00007978652,0.000161266,0.000055593264,0.00007261581,0.00003435705,0.000083593055,0.0000039938627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019084435,0.00072922645,0.00003089514,0.0029014403,0.00071679836,0.00001085481,0.0043694824,0.10092189,0.12245289,0.062382597,0.0063814777,0.6989116],"study_design_scores_gemma":[0.00047290433,0.00008242224,0.0000012762588,0.00009739169,0.000047999612,0.0000058482783,0.00014245923,0.9262865,0.036397085,0.029604785,0.0066766925,0.00018458866],"about_ca_topic_score_codex":0.0000014487694,"about_ca_topic_score_gemma":2.6080426e-7,"teacher_disagreement_score":0.82536465,"about_ca_system_score_codex":0.000024381228,"about_ca_system_score_gemma":0.000017155162,"threshold_uncertainty_score":0.5366267},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0846922,0.00072317664,0.90710026,0.000029538072,0.0007545848,0.00047572778,0.000049934348,0.00083377544,0.005340803],"genre_scores_gemma":[0.9437931,0.000019225577,0.055763524,0.000011970265,0.0003083351,0.0000124161725,0.00002459393,0.000038842943,0.000027962717],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990451,0.000009279262,0.0002457309,0.0002287348,0.00020177096,0.0002694192],"domain_scores_gemma":[0.9988024,0.00016234549,0.0000542407,0.00058850995,0.00029391516,0.00009858425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000122066536,0.00015986334,0.00026864116,0.00007421263,0.000031113672,0.000028722829,0.0004128951,0.00009024631,0.000002212354],"category_scores_gemma":[0.00016302279,0.00015481695,0.000043704695,0.0001297132,0.000027415783,0.00016301603,0.00016444577,0.00011444566,0.0000034133584],"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.00033984653,0.00034890874,0.0006843158,0.00018544686,0.0006197774,0.000028229126,0.0017068468,0.0715036,0.77227926,0.000948858,0.09677787,0.054577056],"study_design_scores_gemma":[0.0004885107,0.00013505417,0.00005512946,0.0001275313,0.0000382094,0.000008669061,0.00015224422,0.3752269,0.6186649,0.0018003925,0.0030411005,0.00026135272],"about_ca_topic_score_codex":0.000050687864,"about_ca_topic_score_gemma":0.000003432442,"teacher_disagreement_score":0.85910094,"about_ca_system_score_codex":0.00009008547,"about_ca_system_score_gemma":0.000040176645,"threshold_uncertainty_score":0.63132524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94231826,0.00010357385,0.048022687,0.0001618723,0.0005206978,0.00019483801,0.0000059037816,0.0009921127,0.0076800315],"genre_scores_gemma":[0.98730576,0.000025865607,0.011860905,0.000096592456,0.000080211066,0.000007574889,0.000011459074,0.000026035283,0.0005855794],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.000012297312,0.00014186528,0.00013803369,0.00008580894,0.00014656167],"domain_scores_gemma":[0.9995754,0.00005820964,0.000025174562,0.00019144699,0.000083779414,0.00006602959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006385679,0.00012758476,0.00014335642,0.00005796154,0.00003522602,0.000054475644,0.000051325824,0.00007928563,0.00014920924],"category_scores_gemma":[0.000052012143,0.000120011806,0.000017814797,0.00009717638,0.000015785003,0.00021846216,0.000036780464,0.00008401805,0.00003693932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007534548,0.0005377209,0.0032463793,0.00025738517,0.0010719163,0.00023858428,0.0038791362,0.12453552,0.10810064,0.013503445,0.6639013,0.07997449],"study_design_scores_gemma":[0.003995129,0.00081261154,0.04383605,0.00013282665,0.00011603727,0.0002232433,0.00016238118,0.794564,0.08190364,0.03289606,0.039583422,0.0017746018],"about_ca_topic_score_codex":0.0001272896,"about_ca_topic_score_gemma":0.000062163715,"teacher_disagreement_score":0.6700285,"about_ca_system_score_codex":0.00003323311,"about_ca_system_score_gemma":0.000010240392,"threshold_uncertainty_score":0.48939395},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39136258,0.000015105376,0.6036249,0.0000057605694,0.00077618787,0.0001266032,0.000053733624,0.00014418985,0.0038909572],"genre_scores_gemma":[0.9979008,0.000023473174,0.0020132703,0.000009238775,0.00001698602,0.000011501357,0.00000517974,0.000009539134,0.00001004587],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992687,0.00003583279,0.0003712827,0.00005622304,0.00017752827,0.000090449794],"domain_scores_gemma":[0.9992239,0.000040916482,0.0002147879,0.00037967975,0.00011044318,0.000030296203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018263965,0.00010542729,0.0001575954,0.00018244465,0.00012373507,0.000025573656,0.00016448715,0.00008424401,0.00016745813],"category_scores_gemma":[0.0000064092314,0.00010901736,0.00008780955,0.00004086491,0.000095424715,0.00087802176,0.000001289739,0.00010197047,0.00002127722],"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.00047552862,0.0001087749,0.00006548838,0.00008158782,0.00039783726,7.642415e-7,0.0016787511,0.18515627,0.47647762,0.00030993513,0.00031556457,0.33493185],"study_design_scores_gemma":[0.00031153922,0.000044028846,0.00034638707,0.00015626871,0.000041959967,0.0000023535401,0.00013545809,0.0074666655,0.9901824,0.0011662854,0.000043254353,0.00010341944],"about_ca_topic_score_codex":0.00004155771,"about_ca_topic_score_gemma":0.000004467489,"teacher_disagreement_score":0.6065382,"about_ca_system_score_codex":0.000026305534,"about_ca_system_score_gemma":0.000014380552,"threshold_uncertainty_score":0.4445599},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27757162,0.0008097096,0.71636623,0.000009451707,0.00030110052,0.00011619227,0.000001189004,0.0019413257,0.0028831835],"genre_scores_gemma":[0.8604194,0.000006207626,0.13918974,0.00004074936,0.00024285362,0.0000017662767,0.0000027128103,0.00008359443,0.0000130028875],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987492,0.000043067033,0.00027723244,0.00027260245,0.00025696182,0.00040093393],"domain_scores_gemma":[0.99927795,0.000025777847,0.00008063809,0.00024733995,0.0002392375,0.00012903876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020423134,0.00026312898,0.00025577357,0.0001786177,0.000188367,0.0003367597,0.00013617969,0.00011498511,0.000002961328],"category_scores_gemma":[0.00006323276,0.00028679092,0.00005869051,0.00034952976,0.000064946275,0.00067675,0.00006510699,0.00028931763,0.000010676271],"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.000017734501,0.000014440781,0.000057946116,0.00009225961,0.000023262883,0.0000632488,0.00060254143,0.13145944,0.7770226,0.0000013306454,0.00025884944,0.090386316],"study_design_scores_gemma":[0.00017202308,0.0000111253,0.000026981761,0.00019859153,0.00002367155,0.00010335096,0.00020488074,0.6592692,0.33931786,0.00024187705,0.00018344988,0.00024697534],"about_ca_topic_score_codex":0.00007633637,"about_ca_topic_score_gemma":0.000011382104,"teacher_disagreement_score":0.5828478,"about_ca_system_score_codex":0.00017219991,"about_ca_system_score_gemma":0.00005633036,"threshold_uncertainty_score":0.9999584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034412276,0.0001495858,0.95380646,0.00002715149,0.0005440954,0.00013178057,0.0000010766134,0.0025105055,0.008417042],"genre_scores_gemma":[0.7112615,0.0000088373035,0.28855774,0.000025091173,0.00007287532,0.0000017070197,0.0000056412623,0.000029382321,0.000037185313],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992048,0.00004049504,0.00020675354,0.00017369338,0.00013397119,0.00024028693],"domain_scores_gemma":[0.9995197,0.000017625734,0.00003825805,0.00023768071,0.0000900967,0.00009664154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012694561,0.0001635881,0.00017307649,0.00010179392,0.0000714755,0.00006931641,0.00007054818,0.00010148487,0.000009245685],"category_scores_gemma":[0.000015234038,0.00016267406,0.000043088763,0.00012782378,0.000046398192,0.00022148168,0.000033352546,0.00014646508,0.000020438563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029997034,0.00004522567,0.00020316671,0.000041243304,0.00009368268,0.000037539547,0.00046000213,0.12187184,0.6909311,0.00018815018,0.0078112395,0.17828682],"study_design_scores_gemma":[0.00027495998,0.000009447892,0.00006846987,0.00005743063,0.000011746649,0.00008869332,0.00007793875,0.8475033,0.15070066,0.00048176636,0.00053919276,0.00018639695],"about_ca_topic_score_codex":0.00008515535,"about_ca_topic_score_gemma":0.000019622716,"teacher_disagreement_score":0.7256315,"about_ca_system_score_codex":0.000092936156,"about_ca_system_score_gemma":0.000010342654,"threshold_uncertainty_score":0.66336554},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.947483,0.00009259579,0.045252442,0.0000049581126,0.0003179498,0.0003902422,0.000016424443,0.00039368766,0.006048708],"genre_scores_gemma":[0.9996456,0.00003168179,0.00017422061,0.000003553587,0.00005105488,0.0000015117204,0.000006179143,0.00002735941,0.00005885767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911475,0.00008510878,0.0001561778,0.0003433098,0.00012791423,0.00017274878],"domain_scores_gemma":[0.9989894,0.000025702753,0.00007931812,0.00053223217,0.0003172002,0.00005611507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025312774,0.00020310811,0.00024549806,0.00018469838,0.00003160953,0.00001256872,0.00029369703,0.0002102964,0.000052816402],"category_scores_gemma":[0.000018481136,0.00020113317,0.0001197414,0.00015449521,0.000069829075,0.000029120592,0.00024042398,0.00019953237,0.000016873082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015033451,0.000030489564,0.0004074218,0.000039412786,0.00008416825,0.000012147529,0.000050832976,0.9921267,0.0035277826,0.002766746,0.00022268038,0.00071659393],"study_design_scores_gemma":[0.0003627741,0.00001705735,0.00062947284,0.00030316567,0.00017297469,9.489246e-7,0.000019319092,0.96167576,0.029187331,0.0073436005,0.000033203913,0.0002544054],"about_ca_topic_score_codex":0.000011619554,"about_ca_topic_score_gemma":0.0000031910631,"teacher_disagreement_score":0.05216259,"about_ca_system_score_codex":0.00021080785,"about_ca_system_score_gemma":0.00007897173,"threshold_uncertainty_score":0.8201972},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833037,0.00038109467,0.014970239,0.000058890066,0.00007845576,0.00020715174,0.00001545574,0.0005487846,0.00043622172],"genre_scores_gemma":[0.98812866,0.00032537204,0.011313446,0.000034962562,0.00007848696,0.000002762639,0.00000319846,0.000055575012,0.000057516874],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875116,0.000045850786,0.00033170584,0.00025915427,0.00020542182,0.00040669015],"domain_scores_gemma":[0.9992271,0.00019994617,0.00008742646,0.0002799383,0.00011012054,0.00009543533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012116444,0.00024755628,0.00035332024,0.00011433236,0.00006560982,0.000018885541,0.00011646154,0.000116589195,0.000008694746],"category_scores_gemma":[0.00005832662,0.00020184355,0.00006906603,0.0001415991,0.00013294173,0.00009687396,0.000050496383,0.00014531014,0.0000061908354],"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.000013435091,0.000012833822,0.00024329209,0.00002274296,0.000052648196,0.000020578782,0.00013980387,0.0041439063,0.9888571,0.000007611877,0.0009362555,0.0055497945],"study_design_scores_gemma":[0.00028738214,0.00007333324,0.00012965624,0.00025103614,0.00002704169,0.000039011535,0.00010828713,0.1285041,0.86908054,0.000101444006,0.0011389976,0.00025918926],"about_ca_topic_score_codex":0.000049139384,"about_ca_topic_score_gemma":0.000008126429,"teacher_disagreement_score":0.1243602,"about_ca_system_score_codex":0.000024696197,"about_ca_system_score_gemma":0.000010293766,"threshold_uncertainty_score":0.82309407},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005397803,0.0004855991,0.9745652,0.0001513334,0.00045883912,0.0004809904,0.00002106652,0.0010118282,0.017427318],"genre_scores_gemma":[0.97371936,0.00020341661,0.025378246,0.0000490584,0.00016812816,0.000081323735,0.000015509764,0.0000706569,0.00031428048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998828,0.00001779147,0.00028417946,0.00031619117,0.00018023088,0.00037360107],"domain_scores_gemma":[0.99915826,0.00020433828,0.000022740307,0.00045162605,0.00010008555,0.00006294271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026338513,0.00024442235,0.00033319704,0.0005773065,0.000022120581,0.000064963046,0.00032540289,0.0004549952,0.00003089133],"category_scores_gemma":[0.000039441802,0.00020755676,0.00013410082,0.0002023601,0.000029950834,0.000045106823,0.00029954835,0.0005348823,0.000011361564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001335359,0.0001590425,0.00079413084,0.0012703883,0.0005178543,0.00011525111,0.0007582608,0.5680336,0.0068636886,0.023316352,0.073845014,0.3241929],"study_design_scores_gemma":[0.0004768059,0.000043090735,0.000073085226,0.0007742129,0.000027003436,0.0000053374024,0.0000660512,0.8735837,0.09566693,0.018192422,0.010422882,0.0006685249],"about_ca_topic_score_codex":0.00014646447,"about_ca_topic_score_gemma":0.00007625898,"teacher_disagreement_score":0.96832156,"about_ca_system_score_codex":0.00016219831,"about_ca_system_score_gemma":0.000045559405,"threshold_uncertainty_score":0.8463919},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5643454,0.000037624577,0.15413712,0.00042742447,0.00113295,0.0007803392,0.000026290076,0.0051232716,0.27398956],"genre_scores_gemma":[0.9314917,0.000010808897,0.06796837,0.0002161376,0.000092292496,0.0000026381565,0.00007166121,0.000029280878,0.000117165764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934006,0.00002016015,0.00014662431,0.00021436738,0.00010595706,0.00017284256],"domain_scores_gemma":[0.99905205,0.00006029267,0.000025835367,0.0007546179,0.00005497277,0.000052242292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000335994,0.000144911,0.00013810367,0.00008583944,0.000041748222,0.000065264685,0.00016722611,0.0000621492,0.0007180299],"category_scores_gemma":[0.00001574174,0.00013011352,0.00002383406,0.00008255019,0.000030350975,0.00019792924,0.00008681969,0.00013518253,0.000105088344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011855935,0.000027966562,0.00063889957,0.000012994879,0.00005411655,0.000013656387,0.000016430758,0.015237634,0.031425737,0.00010101323,0.069237016,0.8832227],"study_design_scores_gemma":[0.00015579483,0.000020330997,0.0011765586,0.000057403613,0.000009457482,0.000014102516,0.000023818166,0.95095426,0.045745295,0.0003878804,0.0012814637,0.00017362156],"about_ca_topic_score_codex":0.0003351588,"about_ca_topic_score_gemma":0.000022016953,"teacher_disagreement_score":0.9357166,"about_ca_system_score_codex":0.000025571479,"about_ca_system_score_gemma":0.0000069136154,"threshold_uncertainty_score":0.7861924},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029791337,0.0001443188,0.965194,0.000010896511,0.00075195445,0.00032410285,0.000030522464,0.001204877,0.002547997],"genre_scores_gemma":[0.46174726,0.0000031045915,0.53785443,0.000050340564,0.00025135677,0.0000034960783,0.000046978508,0.00003177626,0.0000112383095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989124,0.000059059672,0.00024736312,0.0002777134,0.00009799568,0.0004054766],"domain_scores_gemma":[0.99875814,0.00021996936,0.000056397454,0.00077670586,0.000079747864,0.000109031665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048513818,0.00018372305,0.00020995467,0.00008640283,0.00013492776,0.00005973004,0.00021953124,0.00010935784,0.000017859275],"category_scores_gemma":[0.000046285473,0.00017853893,0.00003349306,0.0001091289,0.000022425298,0.0003244299,0.000089771434,0.00014217227,0.0000053726694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002305107,0.000054107786,0.000107847394,0.000046995527,0.00010520066,0.0000010673056,0.00038077106,0.40960425,0.23465675,0.0010301049,0.0026039628,0.3513859],"study_design_scores_gemma":[0.00019464089,0.0000106878615,0.000032540524,0.00007084959,0.000041386695,0.00006640671,0.00016999095,0.9247361,0.07106142,0.00023730275,0.0031514643,0.00022722027],"about_ca_topic_score_codex":0.00005608031,"about_ca_topic_score_gemma":0.0000016780755,"teacher_disagreement_score":0.51513183,"about_ca_system_score_codex":0.00004603209,"about_ca_system_score_gemma":0.000010074673,"threshold_uncertainty_score":0.72806066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15133795,0.00031458953,0.83759695,0.000037056187,0.0012163393,0.0002462047,0.00002529059,0.0017063305,0.0075192647],"genre_scores_gemma":[0.9476359,0.000015137436,0.051946994,0.00006637392,0.00021140305,0.0000016038073,0.000052469262,0.000025667845,0.00004443527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994951,0.0000107860515,0.00012930293,0.000110856054,0.00004091707,0.00021304237],"domain_scores_gemma":[0.9994622,0.000047844136,0.000022678694,0.00038525174,0.00003464161,0.000047409332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000703326,0.0000995594,0.000111429224,0.00005454556,0.00004230327,0.000024673616,0.00012649615,0.00005983676,0.000016231792],"category_scores_gemma":[0.000015417683,0.00009548785,0.000023741202,0.000053016098,0.000020058527,0.00032444397,0.000065269865,0.00007798295,0.000012439627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003773883,0.000031161355,0.00052273646,0.000053647596,0.00025845846,0.000002406283,0.00040647475,0.0027522766,0.17648825,0.0006465357,0.12835728,0.69044304],"study_design_scores_gemma":[0.000110454195,0.0000073466,0.00005629781,0.000052527186,0.000019716914,0.00007566911,0.00005965919,0.8870088,0.097944364,0.00033982866,0.014182562,0.00014275881],"about_ca_topic_score_codex":0.000020866371,"about_ca_topic_score_gemma":0.000003442892,"teacher_disagreement_score":0.88425654,"about_ca_system_score_codex":0.000023216708,"about_ca_system_score_gemma":0.0000035285261,"threshold_uncertainty_score":0.38938814},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25433016,0.0027139464,0.30786043,0.0001060159,0.00095973583,0.00014666737,0.0000021047606,0.0054264707,0.42845446],"genre_scores_gemma":[0.9962455,0.000015860061,0.0032438948,0.00021082489,0.0001366491,0.0000034880447,0.0000015871072,0.000018871175,0.00012330402],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962234,0.000006066326,0.00006538026,0.00004634952,0.000051574625,0.00020829536],"domain_scores_gemma":[0.999778,0.0000144633705,0.0000070278165,0.00013555623,0.000012672732,0.000052322994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002621392,0.0000757719,0.00006716872,0.000035969875,0.000023840603,0.000014443927,0.0000640276,0.000018350618,0.00008253463],"category_scores_gemma":[0.000002238837,0.00006940881,0.00002458751,0.000043318058,0.000013619738,0.0001458958,0.000022693433,0.00006514704,0.00010612325],"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.0000066374523,0.00009147877,0.030073214,0.000033404438,0.00012123918,0.000026703172,0.0011354062,0.017985385,0.18086882,0.009635838,0.64180577,0.118216135],"study_design_scores_gemma":[0.00016630284,0.000004969385,0.0058855447,0.000043526292,0.000018022334,0.0000667024,0.00011735875,0.39214823,0.4582068,0.0011141619,0.14179863,0.0004297558],"about_ca_topic_score_codex":0.000011075215,"about_ca_topic_score_gemma":2.6457622e-7,"teacher_disagreement_score":0.74191535,"about_ca_system_score_codex":0.000014487879,"about_ca_system_score_gemma":0.0000013074745,"threshold_uncertainty_score":0.28304088},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01032817,0.00013435062,0.98728937,0.00037873312,0.00018166707,0.00032175292,0.00005469722,0.0010467352,0.00026453222],"genre_scores_gemma":[0.69223785,0.000059191705,0.3074969,0.000074593445,0.000010416166,0.000040758205,0.000026578482,0.000039127386,0.000014565694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990436,0.000058891324,0.00027237085,0.00019565827,0.00020676358,0.0002227454],"domain_scores_gemma":[0.99843186,0.00014936867,0.000053664353,0.0010603929,0.00015382632,0.00015086672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001291498,0.00023370102,0.00021552361,0.00015029965,0.00036586553,0.000108874134,0.00030409425,0.00008930449,0.00000420888],"category_scores_gemma":[0.0000037060302,0.00026813004,0.000048996742,0.00023784502,0.0002040345,0.00015577927,0.000007874041,0.00037087814,0.000016249567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027705688,0.00029900967,5.7074874e-7,0.00001168469,0.0000635812,0.0000010487256,0.0003070578,0.96344435,0.0083487965,0.00004840531,0.0003515867,0.027096217],"study_design_scores_gemma":[0.000818337,0.00013084208,0.000011146353,0.000107266394,0.000038538194,0.000013831905,0.00008126234,0.9603876,0.037676085,0.000043091648,0.0004336773,0.00025834638],"about_ca_topic_score_codex":0.00012971467,"about_ca_topic_score_gemma":0.000046544217,"teacher_disagreement_score":0.6819097,"about_ca_system_score_codex":0.0001123642,"about_ca_system_score_gemma":0.00005670144,"threshold_uncertainty_score":0.9999771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021977857,0.00017204978,0.9770164,0.00009951947,0.00015736811,0.000318607,0.00002724164,0.0002147974,0.000016146196],"genre_scores_gemma":[0.98160744,0.000076410186,0.018217022,0.000008733366,0.00003275314,0.00002199799,0.000004109115,0.000024224895,0.0000073361607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920017,0.000011403023,0.00038236633,0.000113615155,0.00017186333,0.00012059925],"domain_scores_gemma":[0.9992213,0.00038638973,0.00006555272,0.00015088214,0.0001005754,0.00007529548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020737684,0.00011809412,0.00021354812,0.00010006698,0.000031605334,0.000007099023,0.00008151737,0.0000984995,0.0000017893603],"category_scores_gemma":[0.000044346732,0.000097814205,0.00005628179,0.00014742221,0.00006532437,0.00006809192,0.0000018430237,0.00012616035,0.0000014067265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004264529,0.000024357269,1.4706305e-7,0.00006900973,0.000068799156,5.0566007e-7,0.00013318293,0.74178183,0.22098063,0.00004520787,0.000077141216,0.03677653],"study_design_scores_gemma":[0.0001887561,0.000121039935,0.0000044889402,0.00011285047,0.00003854372,0.00000834166,0.000015363947,0.74786174,0.25118682,0.00009567273,0.0002932661,0.00007313022],"about_ca_topic_score_codex":0.0000048811557,"about_ca_topic_score_gemma":3.8043586e-7,"teacher_disagreement_score":0.95962954,"about_ca_system_score_codex":0.000019816871,"about_ca_system_score_gemma":0.000017022661,"threshold_uncertainty_score":0.39887476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04059499,0.00002585704,0.9183874,0.0000634419,0.00028077577,0.00016260752,0.0000035406108,0.0017658637,0.038715523],"genre_scores_gemma":[0.60938925,0.0000068696386,0.3899465,0.00015325847,0.00025715123,0.0000117892,0.0000038740063,0.000051727708,0.00017958105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.000006685575,0.00010327691,0.000108970526,0.000060849958,0.00019859262],"domain_scores_gemma":[0.9997239,0.00005070831,0.000011008482,0.0001516346,0.000019623305,0.000043134412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073376825,0.00009999703,0.000113498325,0.00005123337,0.000052653697,0.000031501073,0.0000728567,0.00005554023,0.00003781541],"category_scores_gemma":[0.000007372806,0.00009443672,0.00005203199,0.00004554279,0.000013287884,0.000055003682,0.000022375358,0.000053351374,0.000027196367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013422301,0.000044938948,0.00002141649,0.000041746105,0.00011964179,0.000011359524,0.00047256946,0.0005605057,0.10056355,0.03282391,0.16690192,0.69842505],"study_design_scores_gemma":[0.0003140017,0.00007582211,0.00002988171,0.000030333911,0.000011167195,0.000016627348,0.00007469188,0.7543147,0.038013916,0.0063821436,0.2004807,0.00025598326],"about_ca_topic_score_codex":0.000006675921,"about_ca_topic_score_gemma":0.0000032552848,"teacher_disagreement_score":0.7537542,"about_ca_system_score_codex":0.000018993924,"about_ca_system_score_gemma":0.0000020574405,"threshold_uncertainty_score":0.3851018},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00372222,0.00015698448,0.9896707,0.000037736092,0.0006247382,0.0005047156,0.0000021135882,0.0012386917,0.0040421234],"genre_scores_gemma":[0.43173805,0.000026310297,0.56763375,0.000026300999,0.00027604433,0.000110529596,0.000029073199,0.00003597571,0.00012398804],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938715,0.00003171569,0.00018968884,0.00012688022,0.000093630566,0.00017095763],"domain_scores_gemma":[0.9996422,0.00005486084,0.000027549715,0.00012273398,0.00008668753,0.000065976645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022583648,0.00012755752,0.00026004555,0.00010034348,0.000045792913,0.000038055292,0.000058581816,0.0000668951,0.000013539617],"category_scores_gemma":[0.000013420838,0.000115261995,0.000096239724,0.00007494115,0.000022705946,0.00014508681,0.000012573227,0.00006079409,0.000012667043],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030031307,0.000058766756,0.0000020655255,0.000024567471,0.00026428216,0.000005508481,0.000513259,0.014352623,0.05963854,0.0008610061,0.022154242,0.899122],"study_design_scores_gemma":[0.018320035,0.000025061772,6.6208696e-7,0.000028018967,0.00004374724,0.000040061437,0.000041156727,0.86994153,0.10756978,0.0027268464,0.0011074462,0.00015566559],"about_ca_topic_score_codex":0.00003304362,"about_ca_topic_score_gemma":0.0000018187691,"teacher_disagreement_score":0.8989664,"about_ca_system_score_codex":0.00006555464,"about_ca_system_score_gemma":0.0000076278525,"threshold_uncertainty_score":0.4700248},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14210883,0.00092285336,0.8555022,0.000041461168,0.00031618422,0.00051137747,0.0000153654,0.00042077425,0.00016094737],"genre_scores_gemma":[0.998852,0.00018085811,0.00039595677,0.000021569575,0.00005741347,0.00018338997,0.0000036201345,0.000031977263,0.000273216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889255,0.000048497375,0.00023352033,0.00027550236,0.00014716251,0.0004027949],"domain_scores_gemma":[0.9993523,0.00007896389,0.000041856314,0.00031414523,0.00009148329,0.00012125311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942103,0.00020488825,0.00036036843,0.00016808767,0.00008842942,0.00007125671,0.00008580205,0.00012604169,0.000004459112],"category_scores_gemma":[0.0000033648182,0.00019881768,0.00016156353,0.0003795125,0.000029455192,0.00009386661,6.301792e-7,0.00018169233,0.0000075841676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009850023,0.000068591355,0.00004022614,0.00004230069,0.00089719467,0.0000011346054,0.0001379774,0.9847077,0.010120499,0.00009409532,0.0011859515,0.0026058452],"study_design_scores_gemma":[0.001281173,0.0012987595,0.00006133321,0.0001256689,0.0012737476,0.000046591325,0.00021523818,0.8384248,0.14487903,0.002505524,0.008925042,0.000963094],"about_ca_topic_score_codex":0.00015158366,"about_ca_topic_score_gemma":0.00024969867,"teacher_disagreement_score":0.85674316,"about_ca_system_score_codex":0.00021674648,"about_ca_system_score_gemma":0.000044900997,"threshold_uncertainty_score":0.81075495},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20508358,0.00004588898,0.040952757,0.00003056566,0.00024058874,0.00021564818,0.0000029322002,0.0029154345,0.7505126],"genre_scores_gemma":[0.9880602,0.000013448044,0.011491281,0.0001804732,0.000072606315,0.0000014484151,0.0000029589764,0.00003116609,0.00014641856],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944717,0.000016333783,0.000102448816,0.00016069147,0.00009569894,0.00017766954],"domain_scores_gemma":[0.9995544,0.000061909384,0.000018723153,0.0002197813,0.00009788008,0.000047336107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002181925,0.00014767853,0.00012994248,0.00008433472,0.00004682391,0.00001746743,0.000071919414,0.000061733816,0.00024958525],"category_scores_gemma":[0.000013973153,0.00013740618,0.00004519124,0.000079295896,0.000030032012,0.000054103944,0.000038554474,0.00012755393,0.00008285598],"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.0013132408,0.00094102614,0.000616,0.00010397266,0.0014845908,0.0061213453,0.026826395,0.12856399,0.299709,0.20787568,0.042029165,0.2844156],"study_design_scores_gemma":[0.00039355774,0.00026586562,0.0008843317,0.00011267049,0.0000367215,0.00010758665,0.0009792009,0.4260305,0.54716355,0.022752082,0.00068574166,0.00058821164],"about_ca_topic_score_codex":0.00020780794,"about_ca_topic_score_gemma":0.000016865793,"teacher_disagreement_score":0.7829766,"about_ca_system_score_codex":0.00008965595,"about_ca_system_score_gemma":0.0000036399047,"threshold_uncertainty_score":0.56032616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90506876,0.0004756668,0.00008296516,0.000010059759,0.0011278153,0.0002707516,0.00008592095,0.0030284007,0.08984969],"genre_scores_gemma":[0.98970217,0.000092622606,0.009560189,0.00020540829,0.0001446305,0.000007689063,0.000018881836,0.00016337857,0.00010503631],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99762595,0.0001306275,0.0004415505,0.00037313753,0.00038771858,0.0010410364],"domain_scores_gemma":[0.99862486,0.000122015386,0.00008368883,0.0006906052,0.00009826914,0.0003805894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034859174,0.00049008714,0.0004364536,0.00026553686,0.00047484646,0.00006597073,0.0003327106,0.00026242444,0.00009051095],"category_scores_gemma":[0.000071659444,0.0005317592,0.00022961911,0.0004354347,0.000078109,0.00080054783,0.00013414783,0.000791184,0.00024153423],"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.00003838496,0.00014646928,0.00024688008,0.000067623274,0.00026861613,0.000093593124,0.000013493733,0.0019617302,0.846735,0.05699427,0.00020610992,0.09322784],"study_design_scores_gemma":[0.0004807202,0.000047566136,0.0014275513,0.00015662683,0.00008555523,0.00016753229,0.000035771325,0.002121673,0.911126,0.017097553,0.06625139,0.0010020493],"about_ca_topic_score_codex":0.000076127464,"about_ca_topic_score_gemma":0.00002730846,"teacher_disagreement_score":0.09222579,"about_ca_system_score_codex":0.00023086258,"about_ca_system_score_gemma":0.0000046440264,"threshold_uncertainty_score":0.9997134},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026335299,0.000012087156,0.9710627,0.0000052948144,0.00009534782,0.00020469262,0.000002495982,0.0009823705,0.0012996965],"genre_scores_gemma":[0.7269884,0.0000038838375,0.27266318,0.000045329154,0.00006694576,0.000008949069,0.000010547251,0.000035990808,0.00017680824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.000014019175,0.00013471225,0.00012991007,0.00006603359,0.00023918862],"domain_scores_gemma":[0.9989192,0.0007420294,0.000016105683,0.0002060359,0.00006629413,0.000050352082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756447,0.00013100942,0.00014948274,0.00004554823,0.000060433198,0.000043504406,0.00012989591,0.00007327907,0.00000985925],"category_scores_gemma":[0.00011899607,0.00012297148,0.000042568994,0.000058725444,0.000013601888,0.00004172997,0.000020645182,0.000071194634,0.000020420715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016301286,0.0000059205304,0.000029525025,0.0000074288478,0.000015777017,4.971419e-7,0.00003711125,0.98056453,0.004762031,0.00005210896,0.0025284865,0.01198027],"study_design_scores_gemma":[0.00012668823,0.000064604326,0.00005597175,0.000014841448,0.0000061993683,0.0000036493848,0.000008158273,0.9484425,0.044132274,0.00016130916,0.0068071317,0.00017666152],"about_ca_topic_score_codex":0.000044665456,"about_ca_topic_score_gemma":0.000016205739,"teacher_disagreement_score":0.7006531,"about_ca_system_score_codex":0.00001922195,"about_ca_system_score_gemma":0.000005288058,"threshold_uncertainty_score":0.5014632},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7918506,0.00018436371,0.20519435,0.00003764325,0.00014195128,0.00024967542,0.000056699348,0.0004891943,0.0017954945],"genre_scores_gemma":[0.9672583,0.00030299512,0.032112893,0.00005655189,0.0000312687,3.35369e-7,0.000032624805,0.000012705828,0.00019233733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954814,0.000011226367,0.0000766596,0.00014787288,0.00007394513,0.00014213118],"domain_scores_gemma":[0.9996502,0.000015256652,0.000037105026,0.00015480546,0.00009750581,0.00004512017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047203368,0.00003366697,0.00017222144,0.000032596425,0.00007637056,0.000045968533,0.00012806412,0.00008287245,0.000047137575],"category_scores_gemma":[0.000008511513,0.00013380681,0.000086558975,0.000103340855,0.000036754347,0.00017483256,0.000013559784,0.000047705893,0.0000023055172],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024407918,0.000061399696,0.00012785423,0.000042098407,0.00005929872,0.000046302852,0.00006317176,0.079515226,0.0035581007,0.000008347886,0.05910161,0.8573922],"study_design_scores_gemma":[0.003049478,0.00040491138,0.33853638,0.00040583883,0.00017228228,0.00007510362,0.00025160162,0.647583,0.0003356481,0.0045497445,0.0038014122,0.00083457393],"about_ca_topic_score_codex":0.0024849896,"about_ca_topic_score_gemma":0.0039251214,"teacher_disagreement_score":0.8565576,"about_ca_system_score_codex":0.00003475978,"about_ca_system_score_gemma":0.00001223056,"threshold_uncertainty_score":0.54564834},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5806911,0.0002345507,0.4109204,0.000024864383,0.00037047346,0.00023119945,0.000051668754,0.0011589795,0.006316765],"genre_scores_gemma":[0.9986941,0.0002977207,0.000590032,0.000018365969,0.00006281709,7.7410857e-7,0.000014500906,0.00003563269,0.00028602537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.0000330561,0.00011320152,0.00038351756,0.000043161923,0.00019750153],"domain_scores_gemma":[0.9992748,0.00004930273,0.000056245106,0.00046730434,0.000057568093,0.00009481708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000045461093,0.0002465772,0.00024308004,0.00014098038,0.000064486776,0.000042146607,0.00022563692,0.00027779755,0.000022810787],"category_scores_gemma":[0.000009429719,0.00025715816,0.0000698633,0.00008648013,0.00009007431,0.00011358019,0.00029443915,0.00030007007,0.000013614488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039158716,0.000023699597,0.0009487609,0.00020695776,0.00028927045,0.0003410222,0.00022727303,0.9654943,0.0039734826,0.017578036,0.006975355,0.003902724],"study_design_scores_gemma":[0.00028680515,0.000013298101,0.00068321254,0.00030302274,0.0000984379,0.000007893089,0.000016954184,0.9515042,0.007921966,0.037490387,0.0012188528,0.0004549746],"about_ca_topic_score_codex":0.000047127218,"about_ca_topic_score_gemma":0.000009242364,"teacher_disagreement_score":0.41800305,"about_ca_system_score_codex":0.00009094831,"about_ca_system_score_gemma":0.000019435325,"threshold_uncertainty_score":0.9999881},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24508877,0.00029557286,0.6831964,0.00003854309,0.00012533435,0.00011789226,0.0000032463442,0.0018428562,0.06929137],"genre_scores_gemma":[0.8945809,0.000018598748,0.10516631,0.00005963506,0.00009904721,4.5832454e-7,0.000002399909,0.000020792495,0.00005186231],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995324,0.000024998006,0.00013945239,0.00008812385,0.0000859764,0.00012902258],"domain_scores_gemma":[0.9996436,0.000021797345,0.000016130649,0.00024013894,0.000039876926,0.00003841066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081796876,0.000095454416,0.0001353542,0.00006028687,0.000018367828,0.000012086328,0.000093644776,0.000049054415,0.00006892639],"category_scores_gemma":[0.000004333059,0.0000883741,0.000035575566,0.000061473234,0.000031224823,0.0001014244,0.000019626337,0.000073049254,0.000008019546],"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.000010379603,0.0000332105,0.000010506485,0.00001246915,0.00004732257,0.000005939819,0.0003735106,0.018289002,0.2505493,0.0063604205,0.0018773805,0.7224306],"study_design_scores_gemma":[0.0000933948,0.000018801951,0.00014960748,0.00002122203,0.000008196215,0.000008990514,0.000050324015,0.36011246,0.6343087,0.0027411755,0.0023722725,0.0001148929],"about_ca_topic_score_codex":0.000020171088,"about_ca_topic_score_gemma":0.0000069291377,"teacher_disagreement_score":0.72231567,"about_ca_system_score_codex":0.000014987611,"about_ca_system_score_gemma":0.000005972205,"threshold_uncertainty_score":0.36037913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90303767,0.0038317603,0.09182841,0.0003868819,0.00056438206,0.0000836425,0.0000051997235,0.00009559118,0.00016644178],"genre_scores_gemma":[0.99430615,0.0011934837,0.0035203227,0.000034054705,0.00089319487,7.007104e-7,7.1216766e-7,0.000019929628,0.00003146882],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910325,0.000043215932,0.00040181982,0.00012399042,0.00015301576,0.00017468895],"domain_scores_gemma":[0.99937236,0.00009017478,0.00016837096,0.00015319325,0.000177166,0.000038756927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027009015,0.000119517186,0.00019394643,0.00015951072,0.00006007323,0.00007154218,0.00026533537,0.00008809378,0.0000068062936],"category_scores_gemma":[0.00004736057,0.00007833784,0.000022709963,0.0002432886,0.000055661367,0.00058509066,0.000028172677,0.0003103177,7.7469895e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004702401,0.00001258325,0.00051045354,0.000045254725,0.00003420997,0.00002802927,0.000073380885,0.0016199502,0.09972498,0.0000033149056,0.0017568643,0.896144],"study_design_scores_gemma":[0.0031677687,0.00051978853,0.0038049547,0.010105989,0.00024137902,0.006397985,0.00020779282,0.43666384,0.5049372,0.018926786,0.013761465,0.0012650846],"about_ca_topic_score_codex":0.000003302726,"about_ca_topic_score_gemma":0.0000061347932,"teacher_disagreement_score":0.89487886,"about_ca_system_score_codex":0.00006725721,"about_ca_system_score_gemma":0.000078895784,"threshold_uncertainty_score":0.31945243},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858898,0.00007604175,0.0009800952,0.002493215,0.0001429636,0.0002372048,0.000013904211,0.00024086537,0.109925896],"genre_scores_gemma":[0.99667734,0.000009301265,0.0020977336,0.0005003992,0.0000850636,0.000026108828,0.0000041125745,0.0000433226,0.0005566138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903196,0.000019776164,0.00020616596,0.00017844976,0.00015012472,0.00041354488],"domain_scores_gemma":[0.9990991,0.000058166977,0.000031320094,0.0005232079,0.000016753513,0.0002714936],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017620047,0.00017074659,0.00023506647,0.0001508362,0.00017274483,0.0002605761,0.0004092055,0.00010728346,0.0025330277],"category_scores_gemma":[0.00012259449,0.00016946028,0.000058660407,0.000037243564,0.000058339407,0.000031945085,0.000034239547,0.00024307432,0.0022021483],"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.00005926262,0.00020052936,0.0011419412,0.0004149852,0.00020577616,0.0034356958,0.0014250401,0.0043115914,0.006492866,0.6362666,0.32216176,0.023884],"study_design_scores_gemma":[0.002116165,0.00013918547,0.015985604,0.0025048777,0.000065735105,0.00020824556,0.00015730553,0.039638743,0.0048841033,0.6363397,0.2955557,0.0024046106],"about_ca_topic_score_codex":0.0014870244,"about_ca_topic_score_gemma":0.0027602797,"teacher_disagreement_score":0.11078753,"about_ca_system_score_codex":0.00014673363,"about_ca_system_score_gemma":0.00004167394,"threshold_uncertainty_score":0.99857473},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16881745,0.00015297596,0.82842857,0.000018573397,0.000015237821,0.00030267317,0.000006690192,0.00040492392,0.0018528962],"genre_scores_gemma":[0.8128194,0.00001678149,0.18698585,0.00004480954,0.000073599454,0.000025649348,0.0000061205365,0.000019216759,0.000008571301],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995545,0.000010768942,0.00014202303,0.00014270781,0.000042310487,0.00010769303],"domain_scores_gemma":[0.9995444,0.00008186761,0.00003260124,0.0002559789,0.000044289874,0.00004088818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000063595406,0.00010114145,0.00012544545,0.00006252811,0.00005024253,0.000019102612,0.00012066518,0.00006378709,0.0000047857],"category_scores_gemma":[2.8549906e-7,0.00010414238,0.000028182596,0.000091965005,0.000093585666,0.000032226773,0.00006028196,0.00016047915,0.000006884144],"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.0000015730765,0.000011414372,0.000035024404,0.000014099004,0.000016723588,3.38754e-7,0.00009419519,0.00007716697,0.7863053,0.014227464,0.0007076858,0.198509],"study_design_scores_gemma":[0.0001402028,0.0000074724107,0.00087401614,0.000021937794,0.000021587997,0.000053909975,0.000018608454,0.009127813,0.7964781,0.019846642,0.1731982,0.00021152913],"about_ca_topic_score_codex":0.0000042559373,"about_ca_topic_score_gemma":0.0000024237881,"teacher_disagreement_score":0.64400196,"about_ca_system_score_codex":0.00000396081,"about_ca_system_score_gemma":0.0000042118786,"threshold_uncertainty_score":0.4246803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058421507,0.0012595296,0.93434405,0.000089180765,0.00076123385,0.0015263486,0.00024670816,0.0013831437,0.0019683212],"genre_scores_gemma":[0.93757355,0.00012024607,0.060785774,0.00017927706,0.00040452645,0.00008355971,0.00011594905,0.00029830798,0.0004388373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947912,0.00016613005,0.0017397933,0.0010310179,0.0011078989,0.001163948],"domain_scores_gemma":[0.9958602,0.00061066577,0.0006393987,0.0007476237,0.0016827828,0.00045930163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000688724,0.0011220503,0.001342479,0.00093205407,0.00071723544,0.00038800438,0.0005219405,0.0006469293,0.000051893734],"category_scores_gemma":[0.00004593779,0.0011442582,0.0005700394,0.0011660936,0.00023846226,0.0014803117,0.000016883878,0.0007921285,0.000037698414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007125363,0.00036207755,0.0000016805394,0.00035292376,0.00041188998,0.0000380708,0.0017230812,0.47820413,0.42829394,0.00008174149,0.0013286404,0.08848928],"study_design_scores_gemma":[0.0015797439,0.00044883648,0.0000055325595,0.0009846429,0.00026724278,0.00006066542,0.00010941677,0.56381154,0.42721826,0.0012476358,0.0034215713,0.0008449414],"about_ca_topic_score_codex":0.000024482195,"about_ca_topic_score_gemma":0.00006941659,"teacher_disagreement_score":0.879152,"about_ca_system_score_codex":0.00042489835,"about_ca_system_score_gemma":0.00035436286,"threshold_uncertainty_score":0.99910074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015801474,0.000014961095,0.9688371,0.000003446284,0.000100757585,0.00015165485,0.000003517386,0.0009289347,0.028379506],"genre_scores_gemma":[0.24054408,0.0000030451597,0.7591814,0.00002981242,0.000051580984,0.000032092572,0.0000050916333,0.000018168766,0.00013477195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.0000013195767,0.00007642573,0.000068123925,0.000037357448,0.000099456774],"domain_scores_gemma":[0.99982285,0.000007915753,0.000009331973,0.000109798566,0.000029915209,0.000020177536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029768653,0.00006380462,0.000062476174,0.000035451973,0.000017840192,0.000008518177,0.00005742851,0.000039216127,0.00002726232],"category_scores_gemma":[0.0000027782191,0.00005896823,0.00002936212,0.000038766597,0.00000781892,0.00006313351,0.000008874456,0.000029585146,0.00000863061],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007913245,0.000104754756,0.00002697244,0.000036103742,0.00009252805,0.0000018229215,0.00069652917,0.00017237784,0.109782256,0.016754758,0.017000705,0.85532326],"study_design_scores_gemma":[0.00016309046,0.000030272558,0.00016830588,0.000012369772,0.000008664447,0.000006157863,0.00002800086,0.68293786,0.3114698,0.00296854,0.002079666,0.00012727783],"about_ca_topic_score_codex":0.000028134853,"about_ca_topic_score_gemma":0.0000031703335,"teacher_disagreement_score":0.855196,"about_ca_system_score_codex":0.000009535767,"about_ca_system_score_gemma":0.0000021731862,"threshold_uncertainty_score":0.24046548},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872225,0.00024591674,0.0019774875,0.0014313266,0.00013412046,0.0005496776,0.000016245564,0.0009406272,0.007482132],"genre_scores_gemma":[0.9986,0.000030991057,0.0010273538,0.00017598161,0.0000744271,0.00003412578,0.000017309254,0.00002292478,0.000016902724],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9990524,0.000023493718,0.00012766384,0.00041616353,0.00013768868,0.00024260458],"domain_scores_gemma":[0.99914974,0.000045889843,0.000032857497,0.0006724682,0.000013846529,0.000085210915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016147621,0.00013286229,0.00017679317,0.00004985052,0.000025882307,0.000038536567,0.00025809908,0.000047345733,0.0000064394117],"category_scores_gemma":[0.00014161934,0.00010740932,0.000014092426,0.00016172326,0.000037103575,0.00012283117,0.000112318914,0.00020249904,0.0000059209983],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011873695,0.00037456027,0.06850508,0.00037973176,0.00035243525,0.0015233278,0.003475371,0.05859175,0.0081631215,0.003300009,0.2265396,0.62760764],"study_design_scores_gemma":[0.0030682066,0.00027247565,0.4058123,0.0014630704,0.00011631456,0.00011031851,0.0007136374,0.28495762,0.26252878,0.0016176933,0.036914334,0.0024252625],"about_ca_topic_score_codex":0.0000661714,"about_ca_topic_score_gemma":0.000041425956,"teacher_disagreement_score":0.6251824,"about_ca_system_score_codex":0.000027417978,"about_ca_system_score_gemma":0.000007688485,"threshold_uncertainty_score":0.4380025},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008302232,0.000047989448,0.98860353,0.00019283307,0.00088284607,0.0001660194,0.00001805176,0.0015421953,0.00024428064],"genre_scores_gemma":[0.8096999,0.000013189692,0.1900948,0.00006251163,0.000053979697,0.000007083692,0.0000038674198,0.00004657148,0.000018107246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988113,0.00006311307,0.00031661507,0.00029509963,0.000225074,0.00028881064],"domain_scores_gemma":[0.9993694,0.00017048354,0.00006502714,0.00018911897,0.00013118675,0.00007479172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009824136,0.00023793636,0.00018799941,0.00027996363,0.00028946146,0.0000815868,0.00008945812,0.000060567618,0.000028419512],"category_scores_gemma":[0.0000031557388,0.00021770582,0.00010331655,0.00018702817,0.00010704045,0.00042587714,0.000001784893,0.00018837188,0.000033506367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012275188,0.00002725002,0.000008975999,0.000009163177,0.000037793125,0.0000080735845,0.000045044355,0.6008321,0.12923276,0.000012669308,0.000096699776,0.26967716],"study_design_scores_gemma":[0.0005103904,0.0000084191415,0.00012695488,0.00026203296,0.000024287321,0.00015368097,0.000017217177,0.8835401,0.11399288,0.0010442545,0.000059996764,0.00025980524],"about_ca_topic_score_codex":0.000018458046,"about_ca_topic_score_gemma":0.000005473438,"teacher_disagreement_score":0.8013977,"about_ca_system_score_codex":0.00018040815,"about_ca_system_score_gemma":0.000018486346,"threshold_uncertainty_score":0.8877786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021762384,0.0005622062,0.7778632,0.012932716,0.00059297145,0.0005367993,0.00008233673,0.0017572634,0.18391013],"genre_scores_gemma":[0.9896781,0.00027221662,0.008065617,0.0002029118,0.00004016251,0.00005117807,0.000066317065,0.00006742102,0.0015560928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683124,0.0016676257,0.00031770696,0.00047681967,0.00037320098,0.00033339392],"domain_scores_gemma":[0.9952395,0.001223571,0.00016444482,0.0026132434,0.00064929447,0.0001099506],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017759126,0.00034987504,0.0002650433,0.00013665015,0.00029234428,0.00029116857,0.001299759,0.00024917326,0.00021013196],"category_scores_gemma":[0.00047196445,0.00026720314,0.00019607088,0.00019280898,0.00019660527,0.00005600222,0.00056722446,0.00060414436,0.00005727765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007938721,0.0013320609,0.0059293793,0.0006186395,0.0007538423,0.0000817616,0.01340366,0.0140277995,0.052820627,0.47293448,0.19203508,0.24598329],"study_design_scores_gemma":[0.00036931018,8.4662116e-7,0.0021495945,0.0066478383,0.0000677957,0.0000053224535,0.000046935562,0.482686,0.41787687,0.040361587,0.048666585,0.0011212933],"about_ca_topic_score_codex":0.00016064261,"about_ca_topic_score_gemma":0.00015501337,"teacher_disagreement_score":0.9679157,"about_ca_system_score_codex":0.00011929724,"about_ca_system_score_gemma":0.00009376954,"threshold_uncertainty_score":0.999978},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.847519,0.00010269378,0.0320755,0.00091992924,0.00029322843,0.00052732864,0.000018529534,0.0033717677,0.11517204],"genre_scores_gemma":[0.9553291,0.000013719359,0.042252287,0.00018974069,0.00011449925,0.000004055995,0.000009246081,0.00007463349,0.0020126763],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988303,0.000060523846,0.00027337548,0.00026938232,0.00018257045,0.00038385324],"domain_scores_gemma":[0.9992507,0.00015483404,0.000030608553,0.00044683393,0.000034619123,0.00008241965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013315688,0.00024803297,0.0002986084,0.00018298162,0.000039423718,0.000035981542,0.00015687812,0.00012001813,0.000621656],"category_scores_gemma":[0.000021761423,0.00018304356,0.00006519273,0.0001628065,0.000043171545,0.00012063408,0.000044695527,0.00013723983,0.00067858415],"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.000026023232,0.0000203543,0.000014371708,0.000003672177,0.000022997188,0.00004328353,0.000052109073,0.00040403494,0.9371973,0.00010534574,0.056739815,0.0053706607],"study_design_scores_gemma":[0.00081729074,0.00004591466,0.0002601377,0.00029575155,0.000006325299,0.000030357358,0.000008478296,0.035543673,0.9516736,0.00357178,0.0072652563,0.00048138955],"about_ca_topic_score_codex":0.000023558441,"about_ca_topic_score_gemma":0.0000032741461,"teacher_disagreement_score":0.113159366,"about_ca_system_score_codex":0.000090064204,"about_ca_system_score_gemma":0.0000126520845,"threshold_uncertainty_score":0.87220526},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009939198,0.00004434299,0.9966714,0.00044898404,0.00004404568,0.0008780427,0.00004703845,0.00063387945,0.0011328907],"genre_scores_gemma":[0.10611272,0.00005012302,0.8928126,0.00015569339,0.00009465987,0.0004672447,0.00021257836,0.000037732967,0.000056642235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992142,0.000021209104,0.00026892533,0.00024392678,0.000103334,0.00014845989],"domain_scores_gemma":[0.99920166,0.00026872507,0.00006963606,0.00013286948,0.0002574195,0.00006972401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009982082,0.00015271002,0.00014735977,0.00014048506,0.00018653736,0.00006346151,0.00008786463,0.000083192084,0.000031283766],"category_scores_gemma":[0.000028204227,0.0001343828,0.000040856947,0.00023529581,0.000053865173,0.00015705713,0.000020031408,0.000048465532,0.0000030025801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005334942,0.000017069051,0.000009440113,0.000012228003,0.000022250193,1.0681858e-7,0.00003710918,0.97704333,0.00083593355,0.007325144,0.0006560616,0.014035976],"study_design_scores_gemma":[0.00056646153,0.000017675271,0.00004104339,0.00003947797,0.000022111768,0.0000074664604,0.000017679868,0.9928901,0.0010592379,0.003165778,0.001982132,0.00019083094],"about_ca_topic_score_codex":0.0000015952966,"about_ca_topic_score_gemma":4.4979825e-7,"teacher_disagreement_score":0.10601333,"about_ca_system_score_codex":0.00003608363,"about_ca_system_score_gemma":0.000038341866,"threshold_uncertainty_score":0.5479972},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85672766,0.0017509437,0.12500614,0.000753025,0.0024432442,0.0004876984,0.000079491,0.00015438418,0.012597424],"genre_scores_gemma":[0.9968982,0.0009179634,0.0020076032,0.00007673738,0.000081633676,6.759615e-7,0.0000034189334,0.000007377227,0.0000064334818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988917,0.000033654567,0.0006518283,0.000043561704,0.00027690703,0.00010235215],"domain_scores_gemma":[0.99789876,0.00006661007,0.0011555783,0.0003221881,0.00050951506,0.000047330133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019286112,0.00014976543,0.00033712207,0.00016295789,0.00009830293,0.00016302009,0.00036559944,0.00014323411,0.000010189265],"category_scores_gemma":[0.00014156196,0.00011570257,0.00012938473,0.000033972752,0.00010803524,0.0007024453,0.00026857894,0.00055879034,0.0000019893887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024144794,0.00009543647,0.0021225985,0.0011957741,0.0014625727,0.000017209333,0.010476078,0.4521453,0.0279578,0.0018343016,0.020600583,0.4818509],"study_design_scores_gemma":[0.0017676785,0.00027887206,0.034401227,0.019160382,0.00054522976,0.00053491426,0.0006564163,0.58872044,0.2707971,0.0617572,0.020119844,0.0012606679],"about_ca_topic_score_codex":0.00002606231,"about_ca_topic_score_gemma":0.000001619691,"teacher_disagreement_score":0.48059022,"about_ca_system_score_codex":0.000034009085,"about_ca_system_score_gemma":0.00008991444,"threshold_uncertainty_score":0.47182137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39537433,0.0034850475,0.48547694,0.0015742776,0.00090103876,0.0006871175,0.00003393185,0.0056536878,0.10681365],"genre_scores_gemma":[0.94080454,0.0003834191,0.057825904,0.00011515286,0.00029142966,0.000003646497,0.0000060472325,0.000033641274,0.00053619663],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999419,0.0000125658025,0.00011210516,0.00017461093,0.00009354235,0.00018822319],"domain_scores_gemma":[0.9992972,0.000048538062,0.000016994747,0.0005910567,0.000013061302,0.000033118275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008826954,0.000106280066,0.00011512764,0.000046367408,0.000017283008,0.000014214353,0.00026313742,0.000052234198,0.00006942188],"category_scores_gemma":[0.0000057388747,0.000054696513,0.000009685442,0.00013828973,0.000019112602,0.00024773277,0.000087747256,0.00007258467,0.000024973191],"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.00022203835,0.000113568014,0.01608707,0.00009573527,0.00018103344,0.0005880181,0.00013018683,0.008656671,0.03573966,0.008944914,0.8164749,0.11276617],"study_design_scores_gemma":[0.00275412,0.0003244683,0.009842079,0.0057449206,0.00009093711,0.00016819136,0.000060590573,0.3830448,0.18997154,0.016079504,0.38960993,0.0023089244],"about_ca_topic_score_codex":0.000028798846,"about_ca_topic_score_gemma":0.000045954952,"teacher_disagreement_score":0.54543024,"about_ca_system_score_codex":0.0000134389475,"about_ca_system_score_gemma":0.000007323554,"threshold_uncertainty_score":0.2230459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43711495,0.00002918299,0.5619649,0.000016774487,0.00035856952,0.00013418695,0.0001017663,0.00023850735,0.000041144314],"genre_scores_gemma":[0.9209175,0.00003569252,0.07874671,0.000037559563,0.00017765319,0.0000023457462,0.000032724114,0.000041626634,0.0000081487315],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998676,0.00006245887,0.0004138639,0.0003843253,0.00016018905,0.00030314704],"domain_scores_gemma":[0.99879307,0.00012434516,0.00014878256,0.00071399903,0.00013054225,0.00008924498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010935883,0.00024341393,0.00035647902,0.00016226913,0.00008252686,0.00007911772,0.0005752547,0.00014257246,0.000026374382],"category_scores_gemma":[0.000040844556,0.00020877332,0.0000743844,0.00010041498,0.00011487061,0.0013252744,0.00012500404,0.00018606348,0.000002373653],"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.00018357499,0.000107451284,0.0007859057,0.000028379834,0.00015804883,0.000031457763,0.00013579403,0.11132708,0.869684,0.000062164385,0.0006932268,0.016802916],"study_design_scores_gemma":[0.0012049724,0.000016416338,0.0001337123,0.00019743845,0.000026374979,0.000060813,0.0000145926115,0.6218787,0.37555593,0.0007154508,0.000005363105,0.00019024598],"about_ca_topic_score_codex":0.00016525552,"about_ca_topic_score_gemma":0.0001603304,"teacher_disagreement_score":0.51055163,"about_ca_system_score_codex":0.000065518936,"about_ca_system_score_gemma":0.00003578377,"threshold_uncertainty_score":0.8513529},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51571923,0.0006870334,0.47886956,0.0012404486,0.0001942796,0.0010638019,0.000036761172,0.00084941,0.0013394674],"genre_scores_gemma":[0.9310205,0.00042795006,0.066874415,0.000072253526,0.0008629841,0.0003686469,0.00012406631,0.00010400247,0.00014520981],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747646,0.00031562097,0.000642184,0.00062006677,0.0004091593,0.00053653034],"domain_scores_gemma":[0.99855554,0.00035323363,0.00031526136,0.00045078163,0.00016581683,0.00015935011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073260156,0.00062601664,0.0004965169,0.00020550452,0.00020065105,0.00022710937,0.0005140909,0.00082775654,0.00028886384],"category_scores_gemma":[0.00005093415,0.0006767703,0.00023793914,0.00013410511,0.00021317528,0.00017030236,0.00021558312,0.0010731037,0.000061500235],"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.00009010897,0.0005373008,0.018063452,0.0009343146,0.00068726344,0.00003424122,0.007894406,0.13822839,0.58930784,0.030253667,0.0070590763,0.20690995],"study_design_scores_gemma":[0.0008998154,0.00013697709,0.044411477,0.0012349956,0.0005366304,0.00005831917,0.00059408497,0.39387035,0.3783077,0.02571661,0.15270819,0.001524858],"about_ca_topic_score_codex":0.0017029744,"about_ca_topic_score_gemma":0.00027388972,"teacher_disagreement_score":0.41530123,"about_ca_system_score_codex":0.00030338185,"about_ca_system_score_gemma":0.00019519737,"threshold_uncertainty_score":0.99956834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027855638,0.000090653506,0.94906825,0.00017302536,0.0002449245,0.0002127754,0.0000061660803,0.0023769683,0.019971594],"genre_scores_gemma":[0.8838682,0.000025555431,0.11527611,0.00009748422,0.0001657306,0.000043961918,0.0000024507049,0.00006741332,0.0004530613],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991264,0.00001028584,0.00019098558,0.00021854107,0.000117191354,0.0003366374],"domain_scores_gemma":[0.99939847,0.00021403888,0.000034025277,0.00025382414,0.00004544651,0.000054168624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001178557,0.00018738351,0.00017734896,0.0000862225,0.00010137534,0.00005025234,0.00013318394,0.00008226211,0.00005252309],"category_scores_gemma":[0.00004577925,0.00012062686,0.00007983144,0.00007125493,0.00002801151,0.00012514969,0.000030058705,0.00006860306,0.00001979195],"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.000022452024,0.0000397266,0.00006210443,0.00005494766,0.000100515994,0.000011360079,0.00007808569,0.0000982871,0.3138859,0.053808276,0.017209403,0.614629],"study_design_scores_gemma":[0.0003916869,0.000044458822,0.000012731681,0.00030011966,0.000012047865,0.000004608525,0.000013671022,0.088643864,0.87881935,0.013497982,0.017945636,0.00031387055],"about_ca_topic_score_codex":0.0000019987688,"about_ca_topic_score_gemma":5.648762e-7,"teacher_disagreement_score":0.8560126,"about_ca_system_score_codex":0.000046092413,"about_ca_system_score_gemma":0.0000059569425,"threshold_uncertainty_score":0.49190205},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016664475,0.000040979317,0.98126346,0.00012482805,0.00022943868,0.00013291804,0.0000108662125,0.00083013007,0.0007029256],"genre_scores_gemma":[0.96151185,0.00001895608,0.038002186,0.000031013522,0.00019804212,0.000022454898,0.000010359115,0.000022225775,0.00018293002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995345,0.0000054354205,0.0001155793,0.00010873053,0.000064094966,0.00017164694],"domain_scores_gemma":[0.9997379,0.00007145116,0.000015502512,0.000116703566,0.00003540383,0.000023042747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005924449,0.00008522259,0.000100726415,0.000021650863,0.000067481116,0.000020143789,0.00007211909,0.000070730275,0.000029468234],"category_scores_gemma":[0.000010828587,0.000060413913,0.000040217474,0.00004681754,0.000010045973,0.000095903335,0.0000158649,0.000032065935,0.0000074286118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007368185,0.000069168054,0.0003451367,0.000017157805,0.000051972205,0.00000296067,0.00017390074,0.047511563,0.021036882,0.03978994,0.26594546,0.6249822],"study_design_scores_gemma":[0.00032805165,0.000026133195,0.0011267385,0.00006462503,0.000011745447,8.431558e-7,0.000008487794,0.953857,0.023779597,0.008996367,0.011599372,0.00020100812],"about_ca_topic_score_codex":0.0000020608531,"about_ca_topic_score_gemma":0.000024050118,"teacher_disagreement_score":0.94484735,"about_ca_system_score_codex":0.000031534204,"about_ca_system_score_gemma":0.0000023701964,"threshold_uncertainty_score":0.2463608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099200765,0.00012486751,0.98791945,0.00012359124,0.00004865635,0.00076950114,0.00034866645,0.0006811262,0.000064039945],"genre_scores_gemma":[0.94720644,0.000026451331,0.052034292,0.000056829733,0.00026080874,0.00024357808,0.000116561954,0.000044980978,0.000010080326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991064,0.000017549775,0.00023138527,0.00026779837,0.000086813794,0.00029003056],"domain_scores_gemma":[0.9983751,0.0010917636,0.00005836865,0.0002699184,0.00010459924,0.00010024681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073011724,0.00018925835,0.0002085577,0.000043661832,0.00017317709,0.00006206941,0.00009419005,0.00011014365,0.0000053443346],"category_scores_gemma":[0.000045437508,0.0001546605,0.00005049727,0.000106142375,0.0000997879,0.00009653001,0.000032280706,0.00009344512,0.0000030746492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006543612,0.00006340933,0.00033626752,0.000043723798,0.00009396228,0.0000032723951,0.00006608733,0.036471784,0.11604719,0.0005624609,0.004835924,0.84141046],"study_design_scores_gemma":[0.00072426826,0.000017035,0.0012122175,0.00014004095,0.000034443518,0.0000015304171,0.000015480453,0.9676589,0.023838734,0.0002481825,0.0058612386,0.0002479578],"about_ca_topic_score_codex":0.000012175609,"about_ca_topic_score_gemma":0.0000094576,"teacher_disagreement_score":0.9372863,"about_ca_system_score_codex":0.000035498888,"about_ca_system_score_gemma":0.000011884368,"threshold_uncertainty_score":0.63068724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99092543,0.00017255064,0.0033295068,0.0008420265,0.0003600133,0.00010356021,0.0000012635247,0.00009047964,0.0041751447],"genre_scores_gemma":[0.9994436,0.00004559731,0.00033784282,0.000088432935,0.000043646778,0.0000012745161,1.7392269e-8,0.000007716017,0.000031907053],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900347,0.000061452716,0.00014549009,0.00012522948,0.00047769747,0.00018667885],"domain_scores_gemma":[0.99935734,0.0002899685,0.00008087042,0.00015432296,0.00007562889,0.00004184838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056312565,0.00010304758,0.00011315452,0.00021809177,0.00020650934,0.00006591223,0.00034806094,0.000010466662,0.000038094942],"category_scores_gemma":[0.000073383715,0.00004333736,0.00003502731,0.00046222963,0.00018356247,0.00018214717,0.000021999147,0.00012915929,0.000015580834],"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.00044426168,0.0011734301,0.48508865,0.000034988912,0.00043684556,0.0004986849,0.0027299824,0.010625155,0.24948575,0.012241579,0.08501651,0.15222415],"study_design_scores_gemma":[0.003195196,0.0069124,0.15135394,0.004457334,0.00014986757,0.00044677453,0.009328594,0.028038941,0.77854794,0.0033762148,0.012728689,0.0014641315],"about_ca_topic_score_codex":0.0000038206044,"about_ca_topic_score_gemma":7.043774e-7,"teacher_disagreement_score":0.52906215,"about_ca_system_score_codex":0.000028275945,"about_ca_system_score_gemma":0.000025224846,"threshold_uncertainty_score":0.17672463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90472883,0.00018532631,0.09085254,0.00041691828,0.00018575716,0.00029115233,0.00003190609,0.0006006053,0.0027069584],"genre_scores_gemma":[0.9980728,0.000042218046,0.0013708512,0.00028277293,0.00006247577,0.0000032271712,0.0000020771492,0.000041404768,0.00012218302],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99891144,0.000041493524,0.00027831135,0.00023525314,0.00023405963,0.00029941864],"domain_scores_gemma":[0.998798,0.0005000053,0.00008539256,0.00046651295,0.00009910655,0.000050955914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000625431,0.0002626209,0.00028239642,0.00006152962,0.000096801785,0.000030896823,0.00024375533,0.00011656787,0.00012549799],"category_scores_gemma":[0.000049823502,0.00014147065,0.00006658105,0.00013096056,0.000091394744,0.000055678393,0.00007236635,0.00016736545,0.000007217079],"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.000011172937,0.000012346071,0.00006683181,0.000012351823,0.000058057514,0.0000038612557,0.00012763095,0.00059943,0.9838818,0.00050419103,0.009332994,0.005389361],"study_design_scores_gemma":[0.0001855121,0.00006127932,0.0003744642,0.00048492278,0.00001867149,0.0000061670203,0.00004366826,0.008696156,0.9868518,0.001609512,0.001413497,0.00025431387],"about_ca_topic_score_codex":0.000047178077,"about_ca_topic_score_gemma":0.00006919572,"teacher_disagreement_score":0.09334396,"about_ca_system_score_codex":0.00003378229,"about_ca_system_score_gemma":0.0000067248543,"threshold_uncertainty_score":0.57690054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5410884,0.000009534262,0.456989,0.000012170176,0.00006452303,0.000046894635,0.000011797241,0.00045579913,0.0013219208],"genre_scores_gemma":[0.94075125,0.000004586549,0.05912299,0.00004300061,0.00001704392,0.0000030112865,0.000035583445,0.000013563983,0.0000089667055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994508,0.000016454127,0.00020175564,0.000111823436,0.00011011082,0.00010903641],"domain_scores_gemma":[0.9993965,0.00015406062,0.000043490487,0.0002871028,0.00007811531,0.00004072321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053375552,0.000095072035,0.00021349195,0.0002662221,0.000029510047,0.000014754352,0.00010486922,0.000072488605,0.00023951157],"category_scores_gemma":[0.00003503764,0.00008798972,0.0001067168,0.0005622781,0.000029506125,0.00002708131,0.0000128981,0.0001367715,0.0000023118482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008905089,0.000053179232,0.074595906,0.0000074626155,0.0006034974,8.9593124e-7,0.00006311099,0.8097957,0.11179083,0.000056376517,0.0017814882,0.0012426437],"study_design_scores_gemma":[0.00010376186,0.0000070788706,0.025618138,0.0000049764926,0.00027614905,1.0972849e-7,0.000007618872,0.84088326,0.13242608,0.000034160068,0.000548248,0.00009041944],"about_ca_topic_score_codex":0.000058419406,"about_ca_topic_score_gemma":0.00008933744,"teacher_disagreement_score":0.39966288,"about_ca_system_score_codex":0.000006585324,"about_ca_system_score_gemma":0.000008130451,"threshold_uncertainty_score":0.35881168},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035122704,0.001454035,0.90998423,0.00027768456,0.0022234553,0.004267733,0.0010057623,0.004416129,0.04124827],"genre_scores_gemma":[0.5965119,0.00039644056,0.396524,0.000518941,0.0009604404,0.0003593566,0.0019471094,0.0004934866,0.0022882938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99103886,0.00035591944,0.0024013983,0.0021730764,0.0013011182,0.002729638],"domain_scores_gemma":[0.99298877,0.0005056219,0.0009370372,0.0022578887,0.002460754,0.0008499144],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0008680737,0.0022805582,0.0021426326,0.000744056,0.0010566023,0.0008807922,0.0012482031,0.0015400833,0.0008395857],"category_scores_gemma":[0.00050909695,0.0023383168,0.0011226129,0.0011919842,0.0005310573,0.0017539207,0.0005182192,0.00080909405,0.00020727511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031605272,0.001559916,0.00027491883,0.0009807898,0.0036013094,0.00007631777,0.0076380703,0.37324587,0.28751493,0.04376309,0.25045833,0.027725942],"study_design_scores_gemma":[0.008056386,0.0021287752,0.0010509517,0.0017383276,0.0013046596,0.0004968082,0.00045181953,0.48379087,0.052460875,0.019111875,0.42187855,0.0075300927],"about_ca_topic_score_codex":0.00027300493,"about_ca_topic_score_gemma":0.001400224,"teacher_disagreement_score":0.5613892,"about_ca_system_score_codex":0.0010993568,"about_ca_system_score_gemma":0.00043674104,"threshold_uncertainty_score":0.9997561},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25633064,0.000026979185,0.7170151,0.00009809945,0.00020236595,0.0003712514,0.000002692618,0.0024967468,0.023456113],"genre_scores_gemma":[0.8639414,0.0000034589657,0.13584827,0.00007786484,0.000057363504,0.0000038440025,0.0000072920107,0.000034027627,0.00002649228],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993939,0.000015077332,0.00012475636,0.00015394391,0.0001262764,0.00018606246],"domain_scores_gemma":[0.99950796,0.00005289942,0.00003212721,0.00024970525,0.00010630066,0.000051001643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006088292,0.00015605033,0.00014737537,0.00006952532,0.00007636581,0.00006695404,0.00007387858,0.000061010272,0.000044234614],"category_scores_gemma":[0.000015552738,0.0001244913,0.000029551438,0.000107640786,0.000054665998,0.00014249567,0.000016172804,0.00024819895,0.000017399934],"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.000007681272,0.000014425307,0.000078933415,0.000029468301,0.000017280216,0.000028971039,0.000055354467,0.0015534129,0.9838862,0.00032402403,0.0009661513,0.013038089],"study_design_scores_gemma":[0.00017660514,0.00001719712,0.0003109055,0.0001047769,0.000011062218,0.000015466943,0.000011944232,0.41973668,0.5785714,0.000047186382,0.00083494576,0.00016185206],"about_ca_topic_score_codex":0.000029390507,"about_ca_topic_score_gemma":0.00006536994,"teacher_disagreement_score":0.60761076,"about_ca_system_score_codex":0.000014482345,"about_ca_system_score_gemma":0.0000129738355,"threshold_uncertainty_score":0.50766075},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08950656,0.00007474185,0.9069405,0.00009894682,0.00061600364,0.00023014315,0.0000121879375,0.0012292463,0.0012916372],"genre_scores_gemma":[0.8511913,0.000015706419,0.14827673,0.00021275837,0.00014801345,0.000006752333,0.0000036453885,0.00005844125,0.0000867018],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99907315,0.000020845626,0.00021776842,0.0002401692,0.00014636586,0.00030168463],"domain_scores_gemma":[0.99920607,0.00025724663,0.000040362964,0.00032106123,0.00010892506,0.00006630874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000754103,0.00020632887,0.00020710375,0.000118201766,0.000117803604,0.000041898544,0.000074034426,0.00017148009,0.0001783587],"category_scores_gemma":[0.000045065528,0.00015614681,0.00011767963,0.00012545979,0.000034403045,0.00015277407,0.00003516054,0.00010583152,0.000014542873],"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.00020835074,0.00006927318,0.00031913054,0.00005046336,0.00035796172,0.000017924982,0.00014012185,0.0035441576,0.89497596,0.006098444,0.02429709,0.069921106],"study_design_scores_gemma":[0.0009765242,0.00017969703,0.0023851467,0.0013331014,0.00015260279,0.00005634477,0.000089370325,0.39424986,0.54472375,0.039588388,0.015203648,0.0010615799],"about_ca_topic_score_codex":0.000014716046,"about_ca_topic_score_gemma":0.0000021903065,"teacher_disagreement_score":0.7616847,"about_ca_system_score_codex":0.00008119896,"about_ca_system_score_gemma":0.000009751597,"threshold_uncertainty_score":0.6367482},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042164624,0.00004478972,0.9854174,0.00015308283,0.000049126145,0.00032599663,0.0000025630081,0.0013061556,0.008484371],"genre_scores_gemma":[0.99141514,0.0000153523,0.006673206,0.0001619973,0.000067614514,0.00004829003,0.0000036696256,0.00003012196,0.0015845934],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995822,0.000004362226,0.000105444116,0.00010843054,0.000056205077,0.00014337694],"domain_scores_gemma":[0.9997399,0.00003295949,0.000016266522,0.000111381705,0.00006704714,0.00003243766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003794606,0.000087237786,0.000088773755,0.000030610532,0.00003148563,0.00001563126,0.00006309074,0.000058312555,0.000035415625],"category_scores_gemma":[0.000014004692,0.000056977657,0.00003039325,0.00004487313,0.00001759925,0.000069811605,0.000011283451,0.00002352678,0.000017869474],"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.00007269211,0.00007045595,0.0018824068,0.00039645145,0.00018489706,0.0000043834193,0.000824844,0.011068125,0.2434555,0.028363869,0.49114245,0.22253394],"study_design_scores_gemma":[0.00059056113,0.00008052185,0.00009324461,0.00021041109,0.000019975401,0.000011483078,0.000048794787,0.13618755,0.71005905,0.010759189,0.14158896,0.00035029755],"about_ca_topic_score_codex":0.000003455889,"about_ca_topic_score_gemma":0.0000066944335,"teacher_disagreement_score":0.9871987,"about_ca_system_score_codex":0.00002409142,"about_ca_system_score_gemma":0.000009191519,"threshold_uncertainty_score":0.23234814},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115807936,0.000038074362,0.82696974,0.00042968048,0.000058895515,0.00013415737,0.0000017353171,0.0019841758,0.05457559],"genre_scores_gemma":[0.98418045,0.00003700561,0.014398582,0.00002189988,0.00004955053,0.0000074191175,0.000003025723,0.000021797572,0.0012802944],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99959385,0.000008113289,0.00007901125,0.00011444127,0.0000877177,0.00011688204],"domain_scores_gemma":[0.999714,0.000014552284,0.000016603266,0.00016828162,0.000056259272,0.000030313062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022945333,0.0000869222,0.000068803296,0.0000551158,0.000026718397,0.000015753538,0.00006101734,0.000048834114,0.000042532374],"category_scores_gemma":[0.0000031626344,0.000051598243,0.000015878815,0.000104132756,0.000026868422,0.0001347931,0.0000059409335,0.00003463857,0.000027774428],"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.000046459492,0.000031569187,0.00078079675,0.0000051724433,0.0000695607,0.000007176262,0.00011869445,0.00014855467,0.8241629,0.12555271,0.0064559025,0.0426205],"study_design_scores_gemma":[0.0005063995,0.00013340237,0.015971463,0.00012802762,0.000025638365,0.000021875623,0.0000749362,0.06270608,0.9077185,0.0055192607,0.0067991656,0.00039527472],"about_ca_topic_score_codex":0.0000048674297,"about_ca_topic_score_gemma":0.00000760713,"teacher_disagreement_score":0.8683725,"about_ca_system_score_codex":0.00005058641,"about_ca_system_score_gemma":0.000007883743,"threshold_uncertainty_score":0.21041152},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008616709,0.000036968246,0.9866079,0.00021271623,0.0013108008,0.0003088504,0.00011751613,0.0020846666,0.00070383976],"genre_scores_gemma":[0.9965721,0.000027291671,0.0028878003,0.00003823046,0.00027688898,0.00006909482,0.00001677505,0.000071101465,0.00004073364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986661,0.00008954078,0.00029513822,0.00031655404,0.00023739727,0.000395249],"domain_scores_gemma":[0.99886024,0.00034361437,0.0000683871,0.0005680982,0.000066917564,0.00009275364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001240623,0.00030049362,0.00029333754,0.00017902574,0.00025867284,0.000060226088,0.00023589788,0.0001343585,0.000026365218],"category_scores_gemma":[0.0000053643653,0.00024026989,0.00014666482,0.00034846106,0.000053366115,0.00010378475,0.0000031362013,0.0002546647,0.00004939303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092830356,0.00005611356,0.00003509047,0.00003263703,0.00007524767,0.000024358145,0.000033045417,0.97053975,0.0034811816,0.000086829146,0.0011023912,0.02444052],"study_design_scores_gemma":[0.0010403509,0.00018775507,0.00026624577,0.0029912433,0.00009347349,0.000017413378,0.000063007865,0.9604052,0.03047441,0.00020983076,0.0036524464,0.0005986801],"about_ca_topic_score_codex":0.000020543057,"about_ca_topic_score_gemma":0.000021817383,"teacher_disagreement_score":0.9879554,"about_ca_system_score_codex":0.0003613426,"about_ca_system_score_gemma":0.00001221984,"threshold_uncertainty_score":0.9797922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3698346,0.00002177504,0.62835723,0.000121631936,0.00007135071,0.00012374987,0.000035815418,0.00014612926,0.0012877026],"genre_scores_gemma":[0.9884476,0.000003581929,0.011466832,0.00002247003,0.000021847962,0.000005989864,0.0000017711989,0.000015229277,0.000014665337],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939233,0.000015855221,0.00023600283,0.000097207594,0.00010378019,0.0001548458],"domain_scores_gemma":[0.99924845,0.0003430847,0.000039482144,0.00028815056,0.000060607163,0.000020210897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093026974,0.00009647895,0.00024841403,0.00011769481,0.000022489774,0.0000076204474,0.00015996922,0.000055081204,0.000089032816],"category_scores_gemma":[0.00005060372,0.00005538701,0.00024424374,0.00018374968,0.00013883435,0.000026187608,0.000028354192,0.000033608572,1.2895329e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013929274,0.000062052866,0.003855657,0.00017195738,0.0012735681,6.7736266e-7,0.00024715133,0.078977145,0.80586845,0.10544131,0.00052053935,0.003442219],"study_design_scores_gemma":[0.0001939939,0.000031692376,0.0015516857,0.00010476334,0.0002541754,2.1128928e-7,0.00004927333,0.30740833,0.6862176,0.004051966,0.000039223036,0.0000970856],"about_ca_topic_score_codex":0.0000094067755,"about_ca_topic_score_gemma":0.000030868632,"teacher_disagreement_score":0.618613,"about_ca_system_score_codex":0.000018638988,"about_ca_system_score_gemma":0.000009674883,"threshold_uncertainty_score":0.22586165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053793013,0.0007621305,0.9382672,0.0004904674,0.000022169666,0.0010623861,0.00002495163,0.0002284266,0.005349273],"genre_scores_gemma":[0.58781874,0.00061400916,0.41089514,0.000008681486,0.000042315205,0.0002485413,0.000004294684,0.000031910535,0.00033634953],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990362,0.0000805397,0.0002886166,0.00015490943,0.00022837643,0.00021135401],"domain_scores_gemma":[0.9986481,0.00036124568,0.00001597407,0.00045876091,0.0004435813,0.000072321855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717144,0.0001021061,0.00019631989,0.00022280245,0.00017018784,0.000069411966,0.00017557268,0.000058963582,0.000041635416],"category_scores_gemma":[0.0002443059,0.00007442963,0.000030441255,0.00035346765,0.00014745891,0.000086478816,0.000109589855,0.00012759892,0.00001479679],"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.000010588095,0.00046821637,0.00021872742,0.000661899,0.0002322212,0.000004812386,0.0027797194,0.0015079421,0.54351646,0.3239858,0.007662383,0.11895126],"study_design_scores_gemma":[0.0013073497,0.0002978643,0.0008015786,0.0018094104,0.00010368613,0.00007428722,0.0007235745,0.35089847,0.49138653,0.06364337,0.08803673,0.00091713254],"about_ca_topic_score_codex":0.000012072121,"about_ca_topic_score_gemma":0.000034600544,"teacher_disagreement_score":0.5340257,"about_ca_system_score_codex":0.00004073866,"about_ca_system_score_gemma":0.000020501424,"threshold_uncertainty_score":0.3035152},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80742645,0.000112176,0.1588426,0.00001650627,0.00019135838,0.00013872399,0.0000041698427,0.0012193671,0.032048628],"genre_scores_gemma":[0.98921204,0.00008747494,0.010496778,0.0000046411665,0.000040951316,0.0000042137917,0.0000030708302,0.000024438732,0.00012636908],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929047,0.000047230486,0.0002235848,0.00014164131,0.00015291593,0.00014416508],"domain_scores_gemma":[0.99952394,0.000085733904,0.00007151174,0.00017796844,0.000099534176,0.000041287145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006619957,0.00012141076,0.00019790535,0.00006686711,0.000030520023,0.0000096218,0.00009648083,0.00007460315,0.00063694373],"category_scores_gemma":[0.000020626758,0.00009135389,0.000051525905,0.000057513782,0.00003737298,0.00012022868,0.000024863162,0.00006229686,0.00006560085],"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.000007899463,0.0000054932852,0.0010087218,0.0000023908099,0.000062339335,0.000001009033,0.000031428397,0.00092985603,0.916096,0.0000072517696,0.000320498,0.081527136],"study_design_scores_gemma":[0.00022918364,0.000030990428,0.0023065722,0.00019889131,0.000020595524,0.0000040577684,0.000014581256,0.01659329,0.9790275,0.0012893075,0.00013144007,0.00015359215],"about_ca_topic_score_codex":0.0001482899,"about_ca_topic_score_gemma":0.000006491183,"teacher_disagreement_score":0.18178558,"about_ca_system_score_codex":0.000037043894,"about_ca_system_score_gemma":0.0000041955363,"threshold_uncertainty_score":0.69740874},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16915031,0.000046760662,0.82721996,0.00008533983,0.00016450931,0.00017747705,0.00001633291,0.00064650114,0.0024927952],"genre_scores_gemma":[0.9399918,0.000007733471,0.05971623,0.000034251087,0.000076276345,0.000015484722,0.0000027866597,0.000033446056,0.00012200191],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933517,0.000006770875,0.00020867914,0.00012569841,0.000080861115,0.00024280045],"domain_scores_gemma":[0.99947417,0.00019800926,0.000027506097,0.00021038702,0.000054306933,0.000035627814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062044564,0.0001290978,0.0001898905,0.00008227276,0.0000294735,0.000015850123,0.00010608866,0.00006722875,0.000032466076],"category_scores_gemma":[0.000025929116,0.00010057543,0.0000917501,0.0000456258,0.000030660372,0.000066917455,0.000018236804,0.00003489384,0.0000017201841],"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.00005062526,0.000018544155,0.00019017397,0.00012225176,0.00003870466,0.0000015117719,0.00006087509,0.006288394,0.9831489,0.00073686737,0.0029003718,0.006442825],"study_design_scores_gemma":[0.00042137995,0.000073470124,0.00012970158,0.00020202792,0.000012536763,0.0000014510058,0.000042501502,0.05361969,0.9424577,0.0014542537,0.0014050214,0.00018027109],"about_ca_topic_score_codex":0.000014846155,"about_ca_topic_score_gemma":0.00003656595,"teacher_disagreement_score":0.7708415,"about_ca_system_score_codex":0.000031559684,"about_ca_system_score_gemma":0.000012301724,"threshold_uncertainty_score":0.4101347},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050321836,0.000026507489,0.94772375,0.0000789296,0.00010820196,0.00022720256,0.000058478247,0.00079821335,0.0006568849],"genre_scores_gemma":[0.9941139,0.000014473803,0.005323308,0.00008938967,0.00008170312,0.00010219048,0.000005945869,0.000068474685,0.00020056318],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990441,0.000013259161,0.00020599735,0.00024499767,0.00020844159,0.00028320047],"domain_scores_gemma":[0.99956,0.00010538554,0.000052002426,0.0001244774,0.00008822467,0.0000698975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010539736,0.00020614044,0.00018056345,0.00015605467,0.00019897195,0.00009542147,0.000110391455,0.00009024335,0.00016077765],"category_scores_gemma":[0.0000010146201,0.00015211469,0.0000853372,0.00012559397,0.00004443894,0.00050626544,5.939091e-7,0.00014434881,0.00001693473],"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.00038142168,0.00008744674,0.000006498664,0.00012573418,0.00011744278,0.0000206296,0.00017408666,0.05034735,0.2723542,0.000034965193,0.00079018075,0.67556006],"study_design_scores_gemma":[0.0012847717,0.00069407496,0.00006514916,0.0014860586,0.00014022295,0.00014651741,0.000075953845,0.018257365,0.9716278,0.0035339992,0.0019501201,0.0007380057],"about_ca_topic_score_codex":0.0000023147484,"about_ca_topic_score_gemma":0.000009696387,"teacher_disagreement_score":0.9437921,"about_ca_system_score_codex":0.000082607105,"about_ca_system_score_gemma":0.00005638707,"threshold_uncertainty_score":0.6203057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53113854,0.0010323302,0.40557066,0.00032940338,0.0016168923,0.00083674403,0.00014468365,0.004614294,0.054716453],"genre_scores_gemma":[0.97117203,0.00041335914,0.027496554,0.00006266493,0.00020761699,0.00001021784,0.000012390902,0.000053982836,0.0005711999],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874854,0.000028223028,0.00028650544,0.00043919784,0.0001630634,0.00033444213],"domain_scores_gemma":[0.99874485,0.00009682138,0.000057746474,0.000897068,0.00008194388,0.00012155392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001373144,0.0002742393,0.00026241687,0.00012919858,0.00007818039,0.000051074992,0.00028591984,0.00016539829,0.00023434729],"category_scores_gemma":[0.000037505495,0.0002054386,0.000041774903,0.00011128696,0.000108811764,0.0006124562,0.00023314828,0.00013019875,0.00010766329],"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.00007006868,0.0000361012,0.00079124764,0.0000180786,0.00018858157,0.00003248887,0.00013193165,0.00013860727,0.37151387,0.0014566692,0.031285588,0.59433675],"study_design_scores_gemma":[0.0024419902,0.00029199352,0.006247862,0.000776825,0.00019596954,0.00071191014,0.00015738017,0.37657607,0.48930654,0.005806821,0.11537237,0.002114267],"about_ca_topic_score_codex":0.000047862064,"about_ca_topic_score_gemma":0.00018917551,"teacher_disagreement_score":0.5922225,"about_ca_system_score_codex":0.000058702783,"about_ca_system_score_gemma":0.000014904274,"threshold_uncertainty_score":0.83775425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69307476,0.000040143088,0.29528376,0.00005410602,0.00016381098,0.0001486076,0.0000022451177,0.00074096775,0.0104916105],"genre_scores_gemma":[0.9776428,0.000017544226,0.022218198,0.00006267087,0.000029076033,6.167876e-7,0.0000011966404,0.000011830616,0.000016062231],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994796,0.0000132789355,0.00018668362,0.0000644432,0.00008565406,0.00017036287],"domain_scores_gemma":[0.99972165,0.000035544184,0.000025005394,0.000152754,0.00003557432,0.000029446215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047859885,0.000097769436,0.00011046229,0.00014004487,0.000025323421,0.000027946622,0.000057484274,0.000055507997,0.000028359478],"category_scores_gemma":[0.000016774635,0.0000715023,0.0000229412,0.00009939412,0.000018724182,0.00050699245,0.000027715107,0.000057593305,0.000024043227],"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.000020963456,0.000011253618,0.00053831085,0.000023790615,0.00002706822,0.000029444343,0.00046823669,0.005034509,0.5417726,0.0007657336,0.0021084663,0.44919962],"study_design_scores_gemma":[0.0008486263,0.000018929548,0.0028718375,0.0005698921,0.000010673324,0.000054673994,0.000112546055,0.2779702,0.70896506,0.0014483538,0.0066566956,0.00047248814],"about_ca_topic_score_codex":0.00007159634,"about_ca_topic_score_gemma":0.000014848816,"teacher_disagreement_score":0.44872713,"about_ca_system_score_codex":0.000076555705,"about_ca_system_score_gemma":0.000008792236,"threshold_uncertainty_score":0.2915779},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5004461,0.00013637284,0.48108897,0.0002707977,0.0002065303,0.00038910125,0.000016992119,0.0010354092,0.016409768],"genre_scores_gemma":[0.9813774,0.000027924525,0.018287977,0.0001785289,0.000050120685,0.0000025200152,0.0000024819008,0.000039506856,0.000033518234],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991129,0.000038467067,0.00018985475,0.00025002036,0.00012715723,0.00028162304],"domain_scores_gemma":[0.99935436,0.000267121,0.000028997592,0.00024333554,0.000039628114,0.000066556815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081963124,0.0002061207,0.00023300562,0.00016883861,0.000048394864,0.00003133834,0.00007078053,0.0000887585,0.000024889669],"category_scores_gemma":[0.000027399694,0.00015505074,0.000035750578,0.00010383139,0.00006241709,0.00008149894,0.000029861194,0.00012838077,0.0000131869465],"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.00026876864,0.0000697133,0.0006369584,0.00003623794,0.0000700942,0.00019144197,0.0002452134,0.007389972,0.82148296,0.0011836701,0.0030433591,0.16538163],"study_design_scores_gemma":[0.0012329648,0.00010982377,0.0030078336,0.0008518851,0.000012022331,0.0000128904785,0.000059968894,0.41987497,0.5722949,0.000954852,0.0010747265,0.00051320833],"about_ca_topic_score_codex":0.000054180487,"about_ca_topic_score_gemma":0.000041104184,"teacher_disagreement_score":0.48093137,"about_ca_system_score_codex":0.00007674034,"about_ca_system_score_gemma":0.000011137442,"threshold_uncertainty_score":0.6322786},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037264833,0.0000680852,0.87943816,0.000025390516,0.00039997298,0.0017975393,0.00003529822,0.0002787076,0.11423038],"genre_scores_gemma":[0.23836304,0.00007142752,0.59725636,0.000022578202,0.000108562286,0.000036321555,0.0005221301,0.00024673674,0.16337281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917674,0.00004746833,0.00018153478,0.00024444057,0.00016639548,0.00018339272],"domain_scores_gemma":[0.99912417,0.000039052225,0.0002805411,0.00035774367,0.00015638772,0.0000421149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006759829,0.00026025277,0.00030448186,0.000112120586,0.00014970408,0.000046390775,0.00034869558,0.00019705793,0.00025165186],"category_scores_gemma":[0.000014570663,0.00021809553,0.00013233011,0.00016876023,0.000046428617,0.00011997688,0.000022645894,0.00015050682,4.2258003e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018966229,0.00003637952,0.000028044286,0.0004771417,0.00021091862,0.0000043766418,0.0007089582,0.83131266,0.0012716657,0.00062003086,0.00019018965,0.16494995],"study_design_scores_gemma":[0.0013162006,0.00015841184,0.00015647171,0.0021325764,0.00060126674,0.0000069672487,0.0005720353,0.9579101,0.02807793,0.00028513125,0.008309131,0.00047375428],"about_ca_topic_score_codex":0.000049414266,"about_ca_topic_score_gemma":0.00024802907,"teacher_disagreement_score":0.28218177,"about_ca_system_score_codex":0.00012579247,"about_ca_system_score_gemma":0.00008036552,"threshold_uncertainty_score":0.88936776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3610793,0.00010231491,0.63341695,0.0010690377,0.00025545852,0.00038858101,0.000038077218,0.00040198964,0.0032482753],"genre_scores_gemma":[0.9913201,0.0002666698,0.008237827,0.00004498114,0.000043000608,0.000008838832,0.000001448108,0.000016463666,0.00006071212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989432,0.000008612583,0.0003553798,0.0002646152,0.00021563943,0.00021254718],"domain_scores_gemma":[0.9991963,0.00005702011,0.00012430147,0.00016516003,0.00038731124,0.00006992384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012206348,0.00019280394,0.00028539498,0.00018045082,0.00007859895,0.000055097917,0.0003437091,0.00007894154,0.00006479145],"category_scores_gemma":[0.000053016596,0.00012269111,0.00009258848,0.000531964,0.0002271045,0.00012654583,0.00008327597,0.00012494077,0.000005384101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034792337,0.00039521043,0.0016220254,0.000068017885,0.0011541843,0.0000062364443,0.0017954732,0.05508217,0.24184379,0.32467303,0.00033959176,0.37267235],"study_design_scores_gemma":[0.000026013387,0.00008855875,0.00021643523,0.00018081423,0.000109179266,0.0000030979518,0.00018574583,0.65737313,0.33265692,0.008932079,0.000044137716,0.00018387928],"about_ca_topic_score_codex":0.000030299276,"about_ca_topic_score_gemma":0.000015594354,"teacher_disagreement_score":0.63024074,"about_ca_system_score_codex":0.000032237982,"about_ca_system_score_gemma":0.000014892221,"threshold_uncertainty_score":0.50031984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014127317,0.000024166202,0.9838646,0.00024073802,0.00010111515,0.00020657186,0.000026080954,0.0002664544,0.0011429801],"genre_scores_gemma":[0.90499216,0.0000048411594,0.094790906,0.000017851977,0.00006662333,0.000014874059,0.000023570474,0.000011568267,0.00007760454],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964726,0.00001181088,0.00011129287,0.00010319796,0.00005319935,0.00007322266],"domain_scores_gemma":[0.9993387,0.00019924549,0.000027498536,0.00038829225,0.000035634966,0.000010621518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011515875,0.00005718574,0.000069555936,0.000031200216,0.000024295645,0.000008692158,0.00013227022,0.000041273808,0.000020701691],"category_scores_gemma":[0.000033188157,0.000031018342,0.000023437275,0.000055545257,0.00002142229,0.00009188621,0.000020268828,0.000023736486,9.391093e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074519485,0.000044402008,0.00012553167,0.0000448071,0.00016330223,2.1972696e-7,0.00006172927,0.0027393817,0.59698606,0.0054203877,0.034341145,0.35999852],"study_design_scores_gemma":[0.00024123507,0.000018381385,0.00025985038,0.000020576868,0.000015482863,0.0000040540267,0.000008029158,0.86489546,0.13311665,0.0005304996,0.00082693185,0.00006287042],"about_ca_topic_score_codex":0.0000201443,"about_ca_topic_score_gemma":0.000003065516,"teacher_disagreement_score":0.89086485,"about_ca_system_score_codex":0.000012486061,"about_ca_system_score_gemma":0.000009097263,"threshold_uncertainty_score":0.12648912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62618697,0.000018476927,0.36403593,0.000043989978,0.000024114323,0.000028122406,0.0000026999546,0.00024053549,0.009419175],"genre_scores_gemma":[0.9963647,0.0000074308064,0.003559607,0.00001761075,0.0000027567387,0.0000015999983,6.074171e-7,0.0000043421364,0.00004133998],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997306,0.0000063735624,0.000102416336,0.000057565903,0.0000335847,0.00006950073],"domain_scores_gemma":[0.999773,0.00004107437,0.0000095245205,0.00014797451,0.00001629399,0.0000120930945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029177301,0.00004450657,0.0001170991,0.00024155453,0.0000021523738,0.0000022766005,0.000065911154,0.000023345887,0.00013386455],"category_scores_gemma":[0.000008496846,0.000029165865,0.000039582155,0.00028386197,0.000013454905,0.000021901576,0.000008930139,0.000020251715,0.0000036579374],"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.000021626092,0.000066467495,0.02734517,0.000016860715,0.0005082535,0.000013756024,0.00013290124,0.0059352764,0.7976265,0.0030657623,0.002367906,0.16289952],"study_design_scores_gemma":[0.00013189988,0.000019614119,0.025328029,0.00008033221,0.000051458643,1.2673691e-7,0.000008005967,0.1915375,0.7823178,0.00026993838,0.00014791018,0.00010735043],"about_ca_topic_score_codex":0.00004441937,"about_ca_topic_score_gemma":0.0001270976,"teacher_disagreement_score":0.37017775,"about_ca_system_score_codex":0.00001537644,"about_ca_system_score_gemma":0.000003146374,"threshold_uncertainty_score":0.14657229},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08366203,0.000015615511,0.90768754,0.0011120059,0.0006756835,0.0002458238,0.000022109347,0.00076454517,0.0058146487],"genre_scores_gemma":[0.9902973,0.00007009537,0.00895857,0.00008041173,0.00022674685,0.00006445299,0.000010786457,0.000029163768,0.00026244114],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99903554,0.000019738454,0.00028236667,0.00024322372,0.00021603594,0.00020309494],"domain_scores_gemma":[0.9993133,0.00014744255,0.00006460074,0.0001335714,0.00028716394,0.000053902448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001017745,0.00016501633,0.00013707731,0.00013117194,0.00008556837,0.0000722499,0.00018546204,0.000056035213,0.0001934104],"category_scores_gemma":[0.00013042103,0.00011862265,0.000059855025,0.00006048206,0.000072877236,0.00014025668,0.000026543084,0.00011980191,0.00008723859],"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.00022533808,0.000061976476,0.00021091884,0.000007204769,0.00011116199,0.000017843848,0.0001541791,0.023578515,0.33633664,0.24504094,0.00058554235,0.39366972],"study_design_scores_gemma":[0.000106525185,0.0002284003,0.00013925757,0.000470355,0.000011426189,0.000017166503,0.000118116994,0.31527758,0.6440959,0.03521937,0.003956771,0.0003591313],"about_ca_topic_score_codex":0.000021119482,"about_ca_topic_score_gemma":0.000027462234,"teacher_disagreement_score":0.9066353,"about_ca_system_score_codex":0.00007865428,"about_ca_system_score_gemma":0.000022384142,"threshold_uncertainty_score":0.48372915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6596449,0.00017133229,0.29781446,0.00016207354,0.0011054798,0.0005722921,0.000027867129,0.000987247,0.03951435],"genre_scores_gemma":[0.9453059,0.00003214984,0.05405638,0.000027844071,0.00024923362,0.00003211597,0.000005188687,0.000047525227,0.00024365203],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931103,0.000002281687,0.00014494036,0.00015797385,0.00010686117,0.00027689518],"domain_scores_gemma":[0.99907094,0.00004295482,0.000037076654,0.0007009559,0.000060451173,0.000087596054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064041174,0.00014993637,0.0001805999,0.000030610656,0.00022409299,0.00019603307,0.00036089218,0.00011297117,0.000005429515],"category_scores_gemma":[0.00006787005,0.00013482214,0.00007426653,0.000011863427,0.0000714211,0.00018057413,0.000078025114,0.00010423406,0.000009641789],"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.00011458511,0.0001251446,0.0010453971,0.00019080623,0.00031313542,0.00006735286,0.00038900724,0.015066884,0.86364055,0.043022633,0.026348723,0.04967577],"study_design_scores_gemma":[0.0006176733,0.00006182746,0.001094173,0.00011397844,0.000038504044,0.00001364058,0.00001523345,0.13444096,0.83700085,0.008039679,0.018134346,0.00042913237],"about_ca_topic_score_codex":0.0000038987832,"about_ca_topic_score_gemma":0.0000018281886,"teacher_disagreement_score":0.285661,"about_ca_system_score_codex":0.000020394658,"about_ca_system_score_gemma":0.000006994382,"threshold_uncertainty_score":0.5497887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8886799,0.00015953346,0.106822275,0.0000976491,0.00036467414,0.00065245834,0.00014591186,0.0005894703,0.0024880825],"genre_scores_gemma":[0.99560237,0.00014963845,0.003935564,0.000069057394,0.000050002993,0.0000487541,0.000015337404,0.0000344734,0.00009480421],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988588,0.000011192777,0.0005586381,0.00010662277,0.00015985637,0.00030489164],"domain_scores_gemma":[0.99926156,0.000053148877,0.000112720336,0.0003019953,0.00019069934,0.000079889294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015742543,0.00022188471,0.00030503722,0.00021440552,0.000093093506,0.000058378708,0.00017969288,0.00012903244,0.000010673284],"category_scores_gemma":[0.000070400834,0.00014687164,0.0000955657,0.0001236963,0.00016128825,0.0006412958,0.00009235556,0.0001445578,0.0000127471985],"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.0011434064,0.00091349817,0.037475344,0.008106445,0.0026187107,0.000012759509,0.028107341,0.0011624577,0.4000011,0.016236097,0.062014204,0.44220862],"study_design_scores_gemma":[0.0048995796,0.0005423847,0.0020643407,0.0044047404,0.00020822247,0.00013924125,0.0030059638,0.10258188,0.7917235,0.0025381565,0.08625948,0.0016325214],"about_ca_topic_score_codex":0.000009096745,"about_ca_topic_score_gemma":0.000006547863,"teacher_disagreement_score":0.4405761,"about_ca_system_score_codex":0.000034416178,"about_ca_system_score_gemma":0.000015801821,"threshold_uncertainty_score":0.5989251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23333363,0.000033839966,0.76182026,0.000105166975,0.00031349264,0.00008755302,0.0000011494335,0.0006151405,0.0036897617],"genre_scores_gemma":[0.9736249,0.00010572157,0.025924847,0.000015052284,0.00010595715,0.0000051162765,0.0000020089694,0.000019974934,0.0001964488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943286,0.000016728038,0.00015217408,0.00017206465,0.0000846997,0.00014144625],"domain_scores_gemma":[0.99966717,0.000031250278,0.000030052217,0.00017849839,0.000040093677,0.000052958483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005998634,0.00012403601,0.000118861026,0.0000792017,0.000048890895,0.000020839261,0.000038844744,0.00011663533,0.00011127222],"category_scores_gemma":[0.00000581533,0.00008169925,0.000024464322,0.00007363503,0.000039907653,0.0002121083,0.00002581708,0.000066759785,0.000019476893],"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.000049630704,0.00002230913,0.0006612067,0.000016863449,0.000053300766,0.000014595366,0.00018265832,0.0012893195,0.39619836,0.00041103238,0.00862394,0.5924768],"study_design_scores_gemma":[0.00069104775,0.00008617165,0.012032346,0.00044880758,0.000029863424,0.00020408821,0.00004150855,0.5992696,0.3825234,0.0037509433,0.00048423803,0.00043798832],"about_ca_topic_score_codex":0.000039765328,"about_ca_topic_score_gemma":0.000012067324,"teacher_disagreement_score":0.74029124,"about_ca_system_score_codex":0.00004600989,"about_ca_system_score_gemma":0.000005320652,"threshold_uncertainty_score":0.33315986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18861993,0.0000578495,0.80987805,0.00009079483,0.00008838379,0.0006309469,0.000009111373,0.0002689376,0.00035601255],"genre_scores_gemma":[0.93198454,0.0000048802754,0.067547046,0.000036919108,0.00011308458,0.00008628426,0.00015034528,0.000045343273,0.000031559557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908775,0.000016527305,0.00021573821,0.00026871223,0.00019783656,0.00021344885],"domain_scores_gemma":[0.99930596,0.000035330744,0.000119666634,0.00037348864,0.00009685684,0.00006866891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021280852,0.00018790815,0.00018686704,0.00005955677,0.00034833618,0.00015279387,0.00015624161,0.00014122637,0.0000024723447],"category_scores_gemma":[0.000012583596,0.00019590708,0.000057989153,0.00005283251,0.00012279756,0.00011615227,0.000026142665,0.00012885492,0.0000029027233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002722056,0.000051160267,0.00020765059,0.00017752181,0.000025677862,0.0000013377432,0.0005515046,0.91455656,0.01265299,0.00008402784,0.0011172683,0.07054709],"study_design_scores_gemma":[0.00062150956,0.000055794724,0.0010290386,0.00013857559,0.00002997124,0.0000038195044,0.00008352012,0.9618647,0.033876132,0.00019807863,0.001872252,0.00022657897],"about_ca_topic_score_codex":0.000062524676,"about_ca_topic_score_gemma":0.0000038005946,"teacher_disagreement_score":0.74336463,"about_ca_system_score_codex":0.000083004044,"about_ca_system_score_gemma":0.000024614836,"threshold_uncertainty_score":0.7988859},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9060337,0.00032055256,0.08909679,0.0000048083857,0.0002040132,0.0001635965,0.0000035513067,0.00060767203,0.0035653],"genre_scores_gemma":[0.99854916,0.0009109286,0.00013946736,0.000008758994,0.00006601871,7.355315e-7,0.000018071738,0.000035171473,0.00027166904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990378,0.0000663488,0.00009609457,0.00049218605,0.000062887266,0.00024470253],"domain_scores_gemma":[0.9990706,0.00007260406,0.00011445441,0.0005851327,0.000062177794,0.0000950452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011633712,0.00030008925,0.00028269875,0.00010161975,0.00023252043,0.000110639354,0.00031900662,0.00023762847,0.00001017434],"category_scores_gemma":[0.000018297183,0.00030800875,0.00007119086,0.000054854354,0.00011811451,0.00009407421,0.00036252945,0.0011589669,0.0000038180688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076444725,0.000019299043,0.03053208,0.00007083381,0.00015068009,0.00045876452,0.00005723179,0.96275306,0.0000109453595,0.0020173623,0.00011444278,0.0037388543],"study_design_scores_gemma":[0.0005881569,0.00023125556,0.11511876,0.0020958798,0.00030417714,0.000029962388,0.000048208374,0.8742313,0.00036443616,0.0054539414,0.00023931786,0.0012946222],"about_ca_topic_score_codex":0.000047298367,"about_ca_topic_score_gemma":0.00013367765,"teacher_disagreement_score":0.09251546,"about_ca_system_score_codex":0.00008356601,"about_ca_system_score_gemma":0.000023629247,"threshold_uncertainty_score":0.9999372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852037,0.000062772815,0.1450834,0.000030174255,0.0005969931,0.00044593718,0.000038434748,0.00032470442,0.0013805662],"genre_scores_gemma":[0.9984876,0.00012466003,0.0011311733,0.000018409342,0.000039531587,0.0000013446827,0.000023973826,0.000028080336,0.00014526397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990611,0.0001160929,0.00018571324,0.00035569098,0.0000875355,0.00019387284],"domain_scores_gemma":[0.99873346,0.000035158548,0.00025365417,0.00078037835,0.00014138485,0.000055971454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012973972,0.0002497108,0.0002931778,0.000105259955,0.00013239216,0.000023815684,0.0006834312,0.00021282058,0.000028798897],"category_scores_gemma":[0.000026246209,0.00023592912,0.00018120494,0.00012828619,0.00017412324,0.00010660733,0.0004827017,0.00043126623,0.000007780795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011957583,0.00021513841,0.0075050383,0.0006681649,0.001121133,0.00018814662,0.0005049719,0.8651828,0.039088916,0.082677744,0.0024842,0.00024413096],"study_design_scores_gemma":[0.0003825465,0.0000441285,0.0035945564,0.0006028703,0.00026419052,0.000008120292,0.00009957825,0.74564093,0.20589402,0.042967252,0.000051267496,0.00045051976],"about_ca_topic_score_codex":0.0003102128,"about_ca_topic_score_gemma":0.000042797084,"teacher_disagreement_score":0.1668051,"about_ca_system_score_codex":0.00014932243,"about_ca_system_score_gemma":0.00005645325,"threshold_uncertainty_score":0.962091},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17596553,0.002052032,0.79760647,0.0019430165,0.0012505641,0.0012250008,0.00014014628,0.0021741567,0.017643107],"genre_scores_gemma":[0.9534519,0.00016124459,0.04574061,0.00007078749,0.00027518976,0.00014567595,0.000054839387,0.00006413464,0.00003563364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982398,0.00007195399,0.0004976645,0.00039187336,0.0003350804,0.0004636375],"domain_scores_gemma":[0.9987877,0.00023304977,0.00013801518,0.00037885908,0.000253312,0.00020909127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018484626,0.00033841605,0.00043153137,0.0003263264,0.00031954204,0.000055273522,0.00028944603,0.00029833653,0.0000056835743],"category_scores_gemma":[0.00009616687,0.0003494622,0.0001816774,0.00027713538,0.00003246888,0.00020330933,0.00008165156,0.000260732,0.00000130644],"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.001253259,0.0021218183,0.0019454499,0.0021351317,0.0018136541,0.00097140233,0.009524506,0.01673584,0.2417579,0.407918,0.015938114,0.29788494],"study_design_scores_gemma":[0.002043522,0.00019047703,0.0017721672,0.00039766074,0.00009724963,0.0011321744,0.000114509625,0.2640006,0.08630821,0.00047688314,0.64257675,0.00088980934],"about_ca_topic_score_codex":0.0000012192595,"about_ca_topic_score_gemma":0.000036050955,"teacher_disagreement_score":0.7774864,"about_ca_system_score_codex":0.00015447984,"about_ca_system_score_gemma":0.00014020268,"threshold_uncertainty_score":0.99989575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3420498,0.00009251417,0.63061535,0.0012145216,0.0015144177,0.0015054845,0.00021635696,0.0008957493,0.021895768],"genre_scores_gemma":[0.99724066,0.00004314706,0.0024797723,0.000009966583,0.000089635,0.00001721625,0.0000067871147,0.000016587936,0.00009623363],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990809,0.0000030751733,0.00027840093,0.0002762402,0.00018301743,0.00017835923],"domain_scores_gemma":[0.99868083,0.00004000327,0.00022108067,0.0006982006,0.00032455174,0.00003533557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001693821,0.00014419486,0.00022576965,0.00010653702,0.0002626375,0.00026579123,0.0016509492,0.00007221841,0.000032770222],"category_scores_gemma":[0.00037615013,0.000116134506,0.00009719763,0.0001775706,0.00011043561,0.0002966182,0.000221218,0.00011007569,0.000007708563],"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.00016450805,0.00015686463,0.0026417458,0.00012352421,0.0006811397,4.7426408e-7,0.0012495127,0.0027770682,0.47415695,0.43140155,0.0038112157,0.08283547],"study_design_scores_gemma":[0.000011504279,0.000028330915,0.0003406531,0.000059711194,0.00011448664,2.567468e-7,0.00013306654,0.31399915,0.6476088,0.037348684,0.00022536544,0.00012994626],"about_ca_topic_score_codex":0.000045595905,"about_ca_topic_score_gemma":0.00002525156,"teacher_disagreement_score":0.6551908,"about_ca_system_score_codex":0.00002119875,"about_ca_system_score_gemma":0.000014710552,"threshold_uncertainty_score":0.47358277},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5627076,0.000045654513,0.37774986,0.0014633324,0.0011659584,0.0030386571,0.000049805865,0.00077992165,0.052999184],"genre_scores_gemma":[0.9935859,0.000019516618,0.0061432915,0.000029802552,0.0000768666,0.000055561373,0.0000017674455,0.000021129043,0.00006615395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991309,0.000004385015,0.00029100673,0.00020647346,0.00017977455,0.00018746275],"domain_scores_gemma":[0.998979,0.000035233697,0.00025703537,0.0002236614,0.00046995538,0.00003513904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013346052,0.00016396385,0.0001988171,0.000058792328,0.00029822375,0.00020651238,0.0006269687,0.00008456389,0.00001270977],"category_scores_gemma":[0.00015190388,0.0001360507,0.00007968693,0.00006285186,0.0001853543,0.00026956212,0.000080146674,0.00013641438,0.000009100742],"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.0003255996,0.000118908894,0.00026777148,0.00013150468,0.00006453245,3.372937e-7,0.0012263719,0.0030252417,0.38245472,0.5386233,0.0008109096,0.072950825],"study_design_scores_gemma":[0.000019625139,0.00006139843,0.00012840616,0.00015182338,0.000010759384,7.4693776e-7,0.000071670394,0.3827431,0.5718558,0.04481684,0.0000385273,0.00010130003],"about_ca_topic_score_codex":0.00001082164,"about_ca_topic_score_gemma":0.000002839586,"teacher_disagreement_score":0.49380642,"about_ca_system_score_codex":0.00003052489,"about_ca_system_score_gemma":0.000016298598,"threshold_uncertainty_score":0.55479866},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57081026,0.000020811953,0.3578767,0.0010628802,0.0006528016,0.0021512592,0.000086886845,0.0007872616,0.066551134],"genre_scores_gemma":[0.997232,0.00001957565,0.0025709576,0.000032172124,0.000057157664,0.000045949946,0.0000028612815,0.000014340731,0.000024964895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99916553,0.0000029699665,0.00028712707,0.00013328831,0.00021860088,0.00019247376],"domain_scores_gemma":[0.9988946,0.00004322728,0.0002856397,0.00020498023,0.0005339067,0.000037679805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016209496,0.00015752064,0.00019703094,0.00007301141,0.0003113293,0.0002678287,0.00054936303,0.00007012374,0.0000133504545],"category_scores_gemma":[0.00016889385,0.0001184738,0.00005634647,0.00005677792,0.00021402625,0.0005756022,0.000052596402,0.00015437469,0.0000151528275],"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.0011558894,0.00010529757,0.0012350638,0.00038906024,0.00017972935,6.288732e-7,0.0033253063,0.011026009,0.26268706,0.6437753,0.0036325268,0.07248812],"study_design_scores_gemma":[0.000034264067,0.00015483727,0.00034111287,0.00031974842,0.000018924813,0.0000024182998,0.00037145233,0.2913343,0.6869814,0.01997289,0.0003318306,0.00013684551],"about_ca_topic_score_codex":0.000022822353,"about_ca_topic_score_gemma":0.0000044064477,"teacher_disagreement_score":0.6238024,"about_ca_system_score_codex":0.00003779526,"about_ca_system_score_gemma":0.000021092605,"threshold_uncertainty_score":0.4831221},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03929494,0.0010833755,0.18143833,0.00021388709,0.0052727014,0.0011255326,0.000031957257,0.011747554,0.75979173],"genre_scores_gemma":[0.98542583,0.00039674572,0.0112442365,0.000029314431,0.0005378533,0.000060023423,0.000024637011,0.0000807801,0.0022005602],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.000013731328,0.00015751939,0.00024277528,0.0001351006,0.00017252745],"domain_scores_gemma":[0.99842775,0.000010837983,0.000055652858,0.0014122394,0.000058156005,0.00003534439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069082846,0.00022978605,0.00024294875,0.000102333375,0.00006998047,0.00015787725,0.0005196554,0.00031583002,0.00005084465],"category_scores_gemma":[0.000026519103,0.00021902384,0.00010415345,0.000018721475,0.000027015558,0.000057782443,0.0004727342,0.00049549213,0.000034893535],"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.000029581737,0.00006631114,0.00037544113,0.00053241185,0.0005797433,0.000095294985,0.00040263252,0.010974573,0.017638532,0.00180243,0.8650448,0.10245829],"study_design_scores_gemma":[0.0008693145,0.000084699976,0.0029405141,0.0017421065,0.0002262624,0.00006127403,0.000047499634,0.51732284,0.25604504,0.0849966,0.13317266,0.0024911838],"about_ca_topic_score_codex":0.0002987872,"about_ca_topic_score_gemma":0.00006566936,"teacher_disagreement_score":0.94613093,"about_ca_system_score_codex":0.000056242392,"about_ca_system_score_gemma":0.000022843446,"threshold_uncertainty_score":0.8931533},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01060349,0.000045690245,0.9812305,0.00008813012,0.00016481146,0.00010508071,0.000014502051,0.0010173081,0.0067305085],"genre_scores_gemma":[0.943658,0.000034327742,0.0560564,0.00001595172,0.00005712294,0.000017226443,0.000030448882,0.000013813153,0.00011672254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997614,0.0000020350258,0.00005915049,0.000062219115,0.000031129846,0.000084033694],"domain_scores_gemma":[0.9996499,0.000012547737,0.000016777409,0.00026782442,0.00003452564,0.000018472036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002357063,0.00005923229,0.000063613734,0.0000151079375,0.00012125796,0.000092733164,0.00011866,0.000034525805,0.000020417601],"category_scores_gemma":[0.000028217815,0.000053391766,0.000027435759,0.000010187425,0.000016298542,0.00010837267,0.000021582906,0.000020591142,0.0000019530382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000077108225,0.000009254835,0.00015466235,0.000012861332,0.000028319075,0.000001986569,0.000013961869,0.91977966,0.0029515268,0.0036931937,0.062441047,0.010905791],"study_design_scores_gemma":[0.00012811134,0.0000108536415,0.00022564184,0.000014460931,0.00000740424,7.828695e-7,0.0000064210985,0.88846993,0.09945941,0.000617084,0.0109575465,0.00010234518],"about_ca_topic_score_codex":0.000012955049,"about_ca_topic_score_gemma":0.0000044896315,"teacher_disagreement_score":0.9330545,"about_ca_system_score_codex":0.000010233576,"about_ca_system_score_gemma":0.0000024939475,"threshold_uncertainty_score":0.21772529},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094983046,0.0057717767,0.8774182,0.00007203461,0.00023005894,0.001428849,0.000019114223,0.0026322512,0.111477874],"genre_scores_gemma":[0.9457044,0.0033885732,0.048690658,0.00013583736,0.00095520174,0.00019842487,0.000120778706,0.00051652663,0.00028962627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857,0.00000122747,0.00035861525,0.0004900611,0.0002008362,0.00037926325],"domain_scores_gemma":[0.99928284,0.00008327581,0.00015837699,0.0001401109,0.0002459534,0.000089459994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000083701925,0.0005867219,0.0005093665,0.00030548064,0.00019763802,0.00017146538,0.00015298702,0.0006227704,0.0000029342639],"category_scores_gemma":[0.00003398381,0.000600416,0.00016611736,0.00005958359,0.00007969323,0.00015546824,0.00005735971,0.0005092549,0.0000019587246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038795732,0.00007999337,0.00007801902,0.009106816,0.001751375,0.000052042164,0.01226337,0.21736933,0.016966611,0.23068905,0.0035173257,0.5077381],"study_design_scores_gemma":[0.00040955216,0.00020021602,0.0000017711922,0.0020376272,0.00030203623,0.000212161,0.000014698026,0.47800675,0.021912165,0.38859826,0.10662417,0.0016805731],"about_ca_topic_score_codex":0.000003113174,"about_ca_topic_score_gemma":0.0000026606228,"teacher_disagreement_score":0.94475454,"about_ca_system_score_codex":0.00005697376,"about_ca_system_score_gemma":0.000014699814,"threshold_uncertainty_score":0.9996447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006520798,0.00032837447,0.9909241,0.000038866965,0.00013733291,0.000603077,0.0000020845318,0.00047523904,0.0009701141],"genre_scores_gemma":[0.67588097,0.000006223446,0.32383737,0.0000059700365,0.00017391243,0.000025173325,0.0000019022805,0.0000368935,0.000031575404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990112,0.00006303357,0.00023465675,0.00027739024,0.00012632294,0.00028739905],"domain_scores_gemma":[0.9993854,0.00006317928,0.00016000177,0.0002061917,0.00014627051,0.000038942253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000340472,0.00019448335,0.00023860448,0.00017326913,0.00042556046,0.0002424692,0.00014972342,0.0001233639,0.0000020634245],"category_scores_gemma":[0.00003820305,0.00020238108,0.000055086704,0.00009392861,0.000052108164,0.0005095775,0.000032613076,0.00021601636,0.000001627747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025479984,0.000026833206,0.000014641722,0.000117175194,0.00003508411,0.000020529897,0.0010595602,0.088198364,0.36863023,0.00008471874,0.00072578026,0.5408323],"study_design_scores_gemma":[0.0002831079,0.000052862048,0.000048833666,0.0004131726,0.000021736005,0.000041763153,0.00019540114,0.756559,0.23710167,0.0049930634,0.00009183609,0.00019755868],"about_ca_topic_score_codex":0.00008520077,"about_ca_topic_score_gemma":0.000008150625,"teacher_disagreement_score":0.66936016,"about_ca_system_score_codex":0.0001136638,"about_ca_system_score_gemma":0.000049896957,"threshold_uncertainty_score":0.8252861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9458662,0.0023332865,0.021380328,0.00027178467,0.010073025,0.0019564882,0.00023672334,0.0018079744,0.016074143],"genre_scores_gemma":[0.9985212,0.00039648323,0.0006937031,0.000017611625,0.0001827797,0.000028942393,0.0000686674,0.000049951384,0.000040654875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99672025,0.001974175,0.00053466787,0.00021410226,0.0002542271,0.00030257745],"domain_scores_gemma":[0.9938155,0.0010741915,0.00018999478,0.0046635964,0.00018522034,0.00007149117],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035873307,0.00024447424,0.0004618102,0.00016264107,0.00044709997,0.0003769947,0.0014135395,0.00015982352,0.000002430953],"category_scores_gemma":[0.00048617352,0.00026320154,0.000063052976,0.00012491913,0.00017256374,0.00017575563,0.00021535315,0.00034988415,0.000040328607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015812411,0.0013257188,0.082373545,0.00023274145,0.0012230778,0.00018086145,0.0030697072,0.58977455,0.19310576,0.006194586,0.070110984,0.052250348],"study_design_scores_gemma":[0.0017538646,0.000103845654,0.60161036,0.0013392407,0.000049601847,0.000008840672,0.0000874714,0.32489902,0.03119401,0.0005433055,0.036931295,0.0014791633],"about_ca_topic_score_codex":0.0066157705,"about_ca_topic_score_gemma":0.0020584946,"teacher_disagreement_score":0.5192368,"about_ca_system_score_codex":0.00018466722,"about_ca_system_score_gemma":0.00003648523,"threshold_uncertainty_score":0.9999993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6269325,0.000049096405,0.36328638,0.000041672676,0.0006473819,0.00038008104,0.000009544423,0.0007605349,0.007892841],"genre_scores_gemma":[0.99717176,0.00009957428,0.0011989985,0.00001933715,0.00008594101,0.0000016210762,0.000026783719,0.00004828132,0.0013476945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895144,0.00004135493,0.00015273603,0.00052209187,0.000055189783,0.0002771931],"domain_scores_gemma":[0.9986328,0.000019524634,0.00008000623,0.0010779588,0.00008462779,0.000105107974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009981187,0.00028152255,0.0003184098,0.00035759297,0.00007408615,0.0000728987,0.0006697474,0.0003468762,0.000017919827],"category_scores_gemma":[0.000032239237,0.00036771278,0.00009181869,0.00021089337,0.000046328547,0.00013711063,0.0005093667,0.00044199554,0.000021771719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001567421,0.000019091653,0.00049960654,0.00003537416,0.000026819374,0.00023325524,0.00005254368,0.9935612,0.00024682013,0.00406586,0.00086877024,0.00037496717],"study_design_scores_gemma":[0.00022492037,0.000014864869,0.0017583728,0.0004833464,0.000045112203,0.000002483177,0.000020504849,0.9863465,0.0022432874,0.0070159016,0.0013170965,0.00052759936],"about_ca_topic_score_codex":0.000115441035,"about_ca_topic_score_gemma":0.00026474457,"teacher_disagreement_score":0.3702393,"about_ca_system_score_codex":0.00023388525,"about_ca_system_score_gemma":0.00004424807,"threshold_uncertainty_score":0.99987745},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031444422,0.0003516766,0.9960309,0.00006209393,0.00033567354,0.00022527018,0.000012710329,0.0013673105,0.0012999142],"genre_scores_gemma":[0.010383118,0.0003761269,0.98862064,0.00008548171,0.0001289269,0.000016137952,0.000081462196,0.00008944453,0.00021864475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989417,0.00011706825,0.00024259284,0.00028408284,0.0001718684,0.0002426587],"domain_scores_gemma":[0.99874854,0.00009297591,0.0001567337,0.0007215695,0.00015765388,0.00012250483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022266447,0.00023578237,0.00024574023,0.000086326465,0.00033195197,0.0002179279,0.00031573576,0.00019932489,0.00003595254],"category_scores_gemma":[0.00040167777,0.00026125571,0.0000743077,0.00012782538,0.00005968378,0.00040907905,0.00008485427,0.00018200208,0.0000087922945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014523033,0.000015465903,0.000088664325,0.000009392312,0.00005239295,0.000003549051,0.00012922486,0.7246254,0.021117756,0.00033653624,0.020217681,0.23338944],"study_design_scores_gemma":[0.0002783459,0.000032301286,0.00009888022,0.00008814092,0.000050306862,0.0000059826248,0.000012929762,0.66134816,0.33040768,0.004488491,0.0028139446,0.00037485233],"about_ca_topic_score_codex":0.000014568578,"about_ca_topic_score_gemma":0.0000022084093,"teacher_disagreement_score":0.30928993,"about_ca_system_score_codex":0.00006466404,"about_ca_system_score_gemma":0.000037704434,"threshold_uncertainty_score":0.99998397},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81814224,0.000044504868,0.1790101,0.000008715459,0.00036736074,0.0002519153,0.000019393272,0.00061846175,0.0015373199],"genre_scores_gemma":[0.9980478,0.00012048422,0.0013995412,0.0000055069654,0.000051807336,0.0000020467962,0.00009675012,0.00004016454,0.00023587541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904424,0.000035462555,0.00014292583,0.00046408287,0.00008605685,0.00022722952],"domain_scores_gemma":[0.9989519,0.000049469418,0.00013229894,0.00072665047,0.0000667186,0.00007298013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008002894,0.00029076115,0.00028015996,0.0002614716,0.000102049366,0.000053260832,0.000316197,0.0002905338,0.000024258543],"category_scores_gemma":[0.000029627414,0.0002911856,0.00007527147,0.00011269132,0.00008418844,0.00020578448,0.00022487463,0.0005326829,0.0000126299265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091609865,0.000035067238,0.018429019,0.000048456473,0.000054999924,0.00022574526,0.000053002033,0.97882676,0.00015289098,0.0005012193,0.0011749291,0.00040630577],"study_design_scores_gemma":[0.0004513288,0.000027713631,0.018829228,0.0006913818,0.000045000877,0.0000052400055,0.000022970486,0.9755776,0.0016011685,0.0022294517,0.00018620426,0.0003327203],"about_ca_topic_score_codex":0.00019254112,"about_ca_topic_score_gemma":0.00022197705,"teacher_disagreement_score":0.1799056,"about_ca_system_score_codex":0.00017140435,"about_ca_system_score_gemma":0.0000538815,"threshold_uncertainty_score":0.99995404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16652018,0.0006683032,0.7444662,0.00014768123,0.002308939,0.0011278928,0.000019767602,0.0013322388,0.083408825],"genre_scores_gemma":[0.94445187,0.00072369026,0.054557268,0.000038214,0.000050565744,0.000017609937,0.0000058267606,0.000015593385,0.0001393782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896187,0.000007109683,0.00018867989,0.0003138453,0.0002969349,0.00023154548],"domain_scores_gemma":[0.99928176,0.000007917406,0.00007005876,0.0005139323,0.00007525611,0.000051081366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032071877,0.00015011545,0.00016028677,0.00041654584,0.00011798738,0.000092982504,0.00048763072,0.0000661568,0.000028286757],"category_scores_gemma":[0.000011956028,0.00015713618,0.000029866691,0.00046456512,0.00044241737,0.00014087111,0.001354355,0.00011030138,0.0000050466047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048196293,0.000044666318,0.00047765396,0.0005340743,0.00007445211,0.000011045079,0.00026012672,0.96260893,0.00028754567,0.0045500756,0.015934266,0.015212346],"study_design_scores_gemma":[0.00010525553,0.000022522001,0.0021385488,0.00034374013,0.000048756647,0.0000020120087,0.00008239695,0.9887779,0.0035590106,0.0031215355,0.0015018046,0.00029652996],"about_ca_topic_score_codex":0.000020307385,"about_ca_topic_score_gemma":0.0000031203992,"teacher_disagreement_score":0.7779317,"about_ca_system_score_codex":0.000064940315,"about_ca_system_score_gemma":0.000014484274,"threshold_uncertainty_score":0.6407827},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22691593,0.00015237332,0.76906234,0.0006085813,0.0019730194,0.00028713813,0.0000018610833,0.000099733705,0.0008990443],"genre_scores_gemma":[0.92480487,0.000029456582,0.07432492,0.000057131056,0.00059045944,0.0000033357626,4.1479217e-7,0.000023113022,0.00016630103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992784,0.00002718634,0.00029570988,0.00008095343,0.00014654032,0.00017117037],"domain_scores_gemma":[0.99937516,0.000043313587,0.00025024096,0.00019386937,0.00008173762,0.00005568957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002790777,0.0001206236,0.0002108758,0.00012807305,0.0002181794,0.00010646131,0.00032745476,0.00009506642,0.000014263243],"category_scores_gemma":[0.00019796233,0.00009592327,0.00017922008,0.00007101365,0.000030682237,0.0003409129,0.000025235926,0.0004453966,0.0000017679441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027854092,0.00003969782,0.007983504,0.000041980536,0.00013426693,0.00004234472,0.00010238788,0.89166975,0.06713496,0.0001164012,0.007843373,0.024612783],"study_design_scores_gemma":[0.0025475437,0.00027484095,0.009982608,0.0013532172,0.0000998906,0.00015537321,0.00002175051,0.7351723,0.1705049,0.0029538602,0.0765148,0.00041896422],"about_ca_topic_score_codex":0.000059124686,"about_ca_topic_score_gemma":0.000087997105,"teacher_disagreement_score":0.697889,"about_ca_system_score_codex":0.000086846056,"about_ca_system_score_gemma":0.00010882787,"threshold_uncertainty_score":0.39116374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39871705,0.0000627747,0.5292787,0.00010062277,0.00027973886,0.00013247068,0.0000033502522,0.0016706347,0.06975469],"genre_scores_gemma":[0.9977178,0.000014642004,0.0020311654,0.000021278289,0.000046769874,0.000009697286,9.322378e-7,0.00002511452,0.00013262618],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952435,0.0000125812385,0.00007064564,0.00013581364,0.000083859035,0.00017277469],"domain_scores_gemma":[0.9994601,0.000015973008,0.000047121273,0.00041273172,0.000024337802,0.000039764407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005165224,0.00011933522,0.00011558224,0.000027981063,0.00027840526,0.00019429676,0.00015781922,0.00007603192,0.00001878875],"category_scores_gemma":[0.00001771787,0.00011314485,0.000035623645,0.000022772567,0.00003245411,0.0003104751,0.000037517744,0.00012785447,0.0000129856635],"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.0000049532414,0.000010266907,0.000075190386,0.000011923142,0.000025109095,0.0000062431727,0.000025285186,0.00013967727,0.8663095,0.000046360725,0.0023585504,0.1309869],"study_design_scores_gemma":[0.000079338235,0.0000083348705,0.0009372645,0.000019831596,0.000009101965,0.0000029343882,0.000011725997,0.10897179,0.88767534,0.00022125446,0.0019180423,0.00014505276],"about_ca_topic_score_codex":0.00010287581,"about_ca_topic_score_gemma":0.000036769663,"teacher_disagreement_score":0.59900075,"about_ca_system_score_codex":0.000039972005,"about_ca_system_score_gemma":0.0000027305346,"threshold_uncertainty_score":0.4613913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64669645,0.00021150727,0.10267016,0.00019207604,0.00022807826,0.00017896836,0.0000057549623,0.0041262032,0.24569082],"genre_scores_gemma":[0.99198735,0.000022549668,0.00674739,0.000016007129,0.00004800032,0.0000011955742,0.000007163229,0.0000205031,0.001149853],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996514,0.000005147147,0.000047134996,0.0001172365,0.000066083165,0.000113014365],"domain_scores_gemma":[0.99891716,0.000010943666,0.00001967514,0.0010093584,0.000016098244,0.000026738593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047168745,0.00007297374,0.00007925686,0.000018215045,0.00014794555,0.000114049835,0.0004485713,0.000027604954,0.00005482837],"category_scores_gemma":[0.000020333682,0.000057570196,0.0000069212365,0.0000140926,0.000024534058,0.00021272166,0.00013993586,0.00012006235,0.000027606626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001241921,0.00014571425,0.03985249,0.00014056047,0.0009549371,0.000987513,0.0007598813,0.13457549,0.10269497,0.0061930493,0.4094898,0.3040814],"study_design_scores_gemma":[0.00049814,0.00008727316,0.0097630145,0.00014089396,0.000037202346,0.000027537506,0.000056621826,0.80321616,0.03946921,0.00019134684,0.14598824,0.0005243856],"about_ca_topic_score_codex":0.00005434092,"about_ca_topic_score_gemma":0.00004042163,"teacher_disagreement_score":0.6686407,"about_ca_system_score_codex":0.000007018028,"about_ca_system_score_gemma":0.0000044545354,"threshold_uncertainty_score":0.23476444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23500147,0.000007139531,0.7604439,0.000109310015,0.000050319577,0.0001794889,0.000042170563,0.0002006464,0.003965527],"genre_scores_gemma":[0.9798235,0.0000035020046,0.020103687,0.000007185608,0.000010446191,0.000019390314,0.000018794446,0.000006041965,0.000007431879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.000009087391,0.00014104506,0.00008627176,0.000049825172,0.000101237616],"domain_scores_gemma":[0.99938285,0.00019337407,0.000032009953,0.0003293,0.000041113177,0.00002134214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000072818715,0.000055490418,0.000113371716,0.00004002783,0.00005525017,0.00002925816,0.00014628853,0.000037774927,0.000008399881],"category_scores_gemma":[0.00031042556,0.000054695687,0.000034761142,0.00003185254,0.000050672556,0.00006478693,0.000025950649,0.000063356194,4.0070765e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023304658,0.00037368076,0.1751545,0.00035868166,0.00012313822,0.000029632549,0.00049529853,0.4026754,0.282893,0.107866414,0.007085587,0.022711635],"study_design_scores_gemma":[0.00033700373,0.000019910562,0.058360435,0.000074087584,0.0000053811264,2.2283658e-7,0.000013508492,0.65414274,0.28376108,0.0031048744,0.00008429637,0.000096461576],"about_ca_topic_score_codex":0.00012548023,"about_ca_topic_score_gemma":0.00006153059,"teacher_disagreement_score":0.744822,"about_ca_system_score_codex":0.000015901443,"about_ca_system_score_gemma":0.000013258818,"threshold_uncertainty_score":0.22304253},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31239456,0.0015714014,0.6770864,0.00060803094,0.002146895,0.000987891,0.00017726327,0.0006436545,0.004383918],"genre_scores_gemma":[0.9979409,0.000032696375,0.0015133698,0.000041510884,0.0002977386,0.000005445492,0.00004405644,0.00002332317,0.000100957455],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950594,0.000019600448,0.00014155715,0.00011995574,0.0000899407,0.00012303646],"domain_scores_gemma":[0.99887824,0.000087649496,0.00007890243,0.00087495486,0.00006287627,0.000017366981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017580437,0.00008761136,0.00014297545,0.000026248166,0.00026580464,0.0001171016,0.0004684208,0.000038297854,0.0000010619093],"category_scores_gemma":[0.000026844038,0.000069374786,0.00002590461,0.0000144938585,0.000056020628,0.00016293135,0.00012263661,0.000066342946,0.000006763809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075441545,0.000048034293,0.00029392692,0.00031923977,0.00048263444,0.000013707667,0.0013039572,0.28198326,0.3671598,0.007026043,0.31432688,0.02696709],"study_design_scores_gemma":[0.00015049546,0.00001296538,0.00018592646,0.0002250202,0.000031446398,0.000012597574,0.000028595294,0.93941927,0.05203805,0.0003274798,0.007472406,0.00009575479],"about_ca_topic_score_codex":0.000046026766,"about_ca_topic_score_gemma":0.0000030276171,"teacher_disagreement_score":0.68554634,"about_ca_system_score_codex":0.000025578136,"about_ca_system_score_gemma":0.00000932334,"threshold_uncertainty_score":0.28290218},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16193075,0.00013752969,0.8366184,0.000016738919,0.00008983367,0.000089512476,0.0000025808883,0.00027417726,0.00084043463],"genre_scores_gemma":[0.67936933,0.00011493418,0.3204409,0.0000042571555,0.000044488716,0.0000012542159,0.0000037932095,0.000010251832,0.000010817949],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958205,0.0000066449634,0.00008817679,0.00016692148,0.000040758674,0.00011546755],"domain_scores_gemma":[0.9994105,0.000023325294,0.00003539878,0.00047821042,0.000017644712,0.000034912984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012391592,0.000083948624,0.00008235708,0.000036668876,0.00021576187,0.00015896755,0.00012284998,0.00005472278,0.00000468373],"category_scores_gemma":[0.000025296675,0.000080677964,0.0000061208048,0.00001072638,0.00005733593,0.00051162415,0.00015247731,0.00007842419,8.768936e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014430673,0.0000035473001,0.0006757386,0.00001675936,0.00002552536,0.0000027377373,0.00003595922,0.0020004478,0.05955809,0.00011575365,0.00021962199,0.9373314],"study_design_scores_gemma":[0.00010717198,0.000019056824,0.0018718418,0.000037888192,0.00001510427,0.000072471914,0.000026039595,0.9782257,0.019087728,0.00027861775,0.00013854646,0.00011984911],"about_ca_topic_score_codex":0.0002592744,"about_ca_topic_score_gemma":0.00002268281,"teacher_disagreement_score":0.97622526,"about_ca_system_score_codex":0.00001193737,"about_ca_system_score_gemma":0.000004375193,"threshold_uncertainty_score":0.32899517},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039824985,0.000913674,0.9538011,0.00007292361,0.0002524152,0.00024710805,0.0000057093694,0.00015656957,0.00472551],"genre_scores_gemma":[0.8776365,0.00017533267,0.1218447,0.000060768125,0.00022713849,0.000011273543,0.000008519483,0.000026675893,0.000009090109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987949,0.00001552172,0.0004415115,0.00014617779,0.00029194466,0.00030993536],"domain_scores_gemma":[0.99914306,0.000050288156,0.00036402172,0.00024224832,0.00012294583,0.00007744155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036027268,0.00022148261,0.0002404876,0.0002292,0.000551455,0.000675408,0.00041519967,0.00008411771,0.000004223864],"category_scores_gemma":[0.00017338744,0.00020017933,0.000067448076,0.000087844935,0.000066489796,0.0036078568,0.00003527394,0.00038310428,0.0000014927592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002713113,0.000074595424,0.0003704957,0.00017239101,0.000011949328,0.000010754529,0.00047168924,0.48610622,0.009106396,0.00015331419,0.00039443534,0.50285643],"study_design_scores_gemma":[0.0019706641,0.00019057594,0.0012177341,0.0011022364,0.000022887041,0.00024487663,0.00014405751,0.94763434,0.036032524,0.0086428225,0.002367083,0.00043022571],"about_ca_topic_score_codex":0.0000024345397,"about_ca_topic_score_gemma":0.0000042684496,"teacher_disagreement_score":0.8378115,"about_ca_system_score_codex":0.00011983173,"about_ca_system_score_gemma":0.00003420087,"threshold_uncertainty_score":0.81630766},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8534936,0.0006400328,0.1347778,0.00015032422,0.0010423108,0.00053867884,0.000009814192,0.0009308321,0.008416622],"genre_scores_gemma":[0.9994456,0.0000030424912,0.00043950256,0.000024752335,0.000039555107,0.000015951517,0.000011313553,0.000011837834,0.000008435018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990713,0.00001611538,0.0004985869,0.00006799644,0.0001787032,0.00016727264],"domain_scores_gemma":[0.99930257,0.000014940098,0.00029759953,0.00024055573,0.00011448448,0.000029828532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001524226,0.0001257033,0.00019069308,0.00017922228,0.00013355202,0.00041004078,0.0002135268,0.000052438125,0.0000017422104],"category_scores_gemma":[0.000052748885,0.00012180436,0.000029150204,0.00007995616,0.00004107098,0.0030271863,0.00003015128,0.00012347197,0.0000046156138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004303269,0.0000034724164,0.0009441688,0.00020898256,0.000002362335,0.0000016117975,0.00036414937,0.9494467,0.0017433661,0.00003238682,0.00029653084,0.046952017],"study_design_scores_gemma":[0.0001595406,0.000007282104,0.0027895935,0.00035215766,0.0000043233454,0.00001860148,0.00011335793,0.98794925,0.0083557265,0.000031435105,0.0000982631,0.00012043768],"about_ca_topic_score_codex":0.0001431744,"about_ca_topic_score_gemma":0.0000024502845,"teacher_disagreement_score":0.14595203,"about_ca_system_score_codex":0.000040279305,"about_ca_system_score_gemma":0.00001371881,"threshold_uncertainty_score":0.49670377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86535156,0.000010028886,0.0011728173,0.00020764161,0.00010460616,0.00006336118,0.0000018612025,0.0001420835,0.13294606],"genre_scores_gemma":[0.9996667,0.0000066152015,0.0001512664,0.000050175182,0.000017937555,0.000002697366,1.8892558e-7,0.0000067477263,0.000097705684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978167,0.0000069340686,0.000044523742,0.00004839745,0.000054686814,0.000063764215],"domain_scores_gemma":[0.99953586,0.00007705618,0.000024079276,0.00033779902,0.000013813069,0.000011415746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035046356,0.00005069195,0.00006326547,0.000011562236,0.00008349285,0.000026003394,0.0001440928,0.00002185457,0.00006336532],"category_scores_gemma":[0.000037114412,0.000032400683,0.000027749873,0.000008101787,0.000045948695,0.00003730258,0.000023900364,0.000056240635,0.0000124698145],"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.00005573378,0.00014423084,0.005094543,0.000026574357,0.00028865514,0.00002979955,0.0004357172,0.0029577808,0.400802,0.45038962,0.10899406,0.030781308],"study_design_scores_gemma":[0.00008525843,0.00004655188,0.012662775,0.000038383198,0.0000050823487,0.0000012005048,0.0000390564,0.010008022,0.9692638,0.0071618585,0.0006082356,0.00007977412],"about_ca_topic_score_codex":0.000027341386,"about_ca_topic_score_gemma":0.000012166314,"teacher_disagreement_score":0.56846184,"about_ca_system_score_codex":0.000009206614,"about_ca_system_score_gemma":0.0000021116289,"threshold_uncertainty_score":0.13212615},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9897414,0.00006442274,0.008250834,0.000021812673,0.00015235064,0.0001787728,0.0000025664626,0.000046997753,0.0015408611],"genre_scores_gemma":[0.99735665,0.000115807976,0.0024744468,0.0000037217437,0.0000216258,0.0000033202864,5.6661224e-7,0.00000880787,0.000015037978],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999607,0.000007679213,0.00017642099,0.00006353644,0.000055123146,0.000090220434],"domain_scores_gemma":[0.9994674,0.000108967666,0.00009523352,0.0002676642,0.000051314222,0.000009437115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053120955,0.000073260715,0.0001630735,0.00004313431,0.000062025385,0.000014035161,0.00012564527,0.00003514502,0.0000061742],"category_scores_gemma":[0.000021969507,0.00004982421,0.000041611685,0.0000169977,0.000076451965,0.00007763762,0.000027032658,0.000052518037,1.6337458e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076946446,0.000026413685,0.019474367,0.0001692553,0.00010236492,9.214963e-7,0.00029361763,0.024583232,0.5421725,0.00020749221,0.00034149364,0.4125514],"study_design_scores_gemma":[0.00009953806,0.000022253442,0.014676083,0.00016577134,0.000007960581,0.0000027382666,0.000046508576,0.42040482,0.56430185,0.00021896217,0.000009908014,0.00004360342],"about_ca_topic_score_codex":0.00005641674,"about_ca_topic_score_gemma":0.000031354404,"teacher_disagreement_score":0.4125078,"about_ca_system_score_codex":0.000010092049,"about_ca_system_score_gemma":0.0000036733884,"threshold_uncertainty_score":0.20317723},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029530814,0.00019997719,0.9928306,0.00008272155,0.002380275,0.0005366234,0.000007939182,0.0008906382,0.00011818576],"genre_scores_gemma":[0.98725146,0.00003488915,0.011662989,0.00013626898,0.0005571023,0.00012036287,0.0000074703453,0.000118329204,0.00011111272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983251,0.00015004905,0.00035090404,0.000436578,0.00019568218,0.0005416835],"domain_scores_gemma":[0.9986193,0.00055306155,0.0001797331,0.0004455525,0.000060917995,0.00014140048],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00049181486,0.00039198968,0.00046070296,0.00014756023,0.0014870034,0.0006128508,0.00025280315,0.0002667446,0.0000023826665],"category_scores_gemma":[0.000012187041,0.00037552713,0.00019771348,0.00009941187,0.000054953634,0.00022987321,0.0000037823247,0.0012115933,5.43842e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035089204,0.000021426938,0.000016023836,0.000020616071,0.00005036288,0.0000063006755,0.000036241614,0.8442352,0.00021464383,0.000010573818,0.00011298624,0.15524055],"study_design_scores_gemma":[0.00072143367,0.00029628963,0.000107029286,0.00035990129,0.00007251524,0.000034365676,0.00004744244,0.99641144,0.0001223536,0.0000022943943,0.0014292962,0.0003956518],"about_ca_topic_score_codex":0.00020141235,"about_ca_topic_score_gemma":0.000015569034,"teacher_disagreement_score":0.9842984,"about_ca_system_score_codex":0.000053303866,"about_ca_system_score_gemma":0.000004812016,"threshold_uncertainty_score":0.99986964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010994477,0.000171791,0.96849775,0.0001407091,0.00063673017,0.00042290552,0.000019854455,0.0015486361,0.017567134],"genre_scores_gemma":[0.6808345,0.000019987878,0.31815362,0.00007745655,0.00032913452,0.00001290485,0.000012225498,0.0000644224,0.0004958066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990485,0.000016815175,0.00019831491,0.00024131892,0.00014095957,0.00035411026],"domain_scores_gemma":[0.9988692,0.00007758736,0.00007915087,0.0007585738,0.00013313255,0.00008239401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008427145,0.0002324111,0.0003006709,0.00006818763,0.00041477763,0.0002848147,0.00032191814,0.0000981009,0.000023972716],"category_scores_gemma":[0.000034433648,0.0002204488,0.00013067042,0.000025412328,0.00009226581,0.00020954611,0.00009585847,0.00013230952,0.000015217223],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028271723,0.00003086972,0.000042322958,0.00003330401,0.0002447374,0.0000543634,0.00016014244,0.0021131109,0.1729396,0.0024820657,0.020024726,0.8018465],"study_design_scores_gemma":[0.0008291081,0.000027436403,0.00019899242,0.00010552583,0.00003407049,0.000019383468,0.00005349586,0.7930708,0.19644584,0.003910012,0.004979061,0.00032629466],"about_ca_topic_score_codex":0.00014385681,"about_ca_topic_score_gemma":0.00003536624,"teacher_disagreement_score":0.80152017,"about_ca_system_score_codex":0.00003228774,"about_ca_system_score_gemma":0.000011672755,"threshold_uncertainty_score":0.8989641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8410865,0.0010674318,0.15211123,0.0004471272,0.00008119425,0.002157455,0.000089129266,0.0006201807,0.0023397268],"genre_scores_gemma":[0.99519044,0.00018801967,0.0041558216,0.000051579096,0.00010549441,0.00017806493,0.000044725555,0.00003341451,0.000052448013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993769,0.000014235893,0.00019676499,0.00021670763,0.000090387366,0.00010501412],"domain_scores_gemma":[0.9993466,0.000108442204,0.00008380762,0.0003387782,0.000086910644,0.00003544841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009202784,0.00015754954,0.00017319272,0.000060166232,0.000097938224,0.0000331919,0.00012434048,0.0001382094,0.000009756433],"category_scores_gemma":[0.00002555535,0.0001230182,0.000032589283,0.000073651405,0.00005382575,0.000025821726,0.00013525346,0.00021984236,0.000012698108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013599872,0.00051336136,0.00025543457,0.0033527408,0.0014130615,0.0000033147019,0.0070427414,0.022028437,0.35083562,0.4545132,0.031213006,0.12869307],"study_design_scores_gemma":[0.00020978959,0.00010840909,0.0007443456,0.0007593133,0.00016541436,0.000010433295,0.000029337794,0.7306521,0.12449222,0.133455,0.008781288,0.00059236045],"about_ca_topic_score_codex":0.0000039822253,"about_ca_topic_score_gemma":8.0574006e-7,"teacher_disagreement_score":0.70862365,"about_ca_system_score_codex":0.000011301488,"about_ca_system_score_gemma":0.000014937681,"threshold_uncertainty_score":0.5016536},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48368824,0.00030727193,0.49085686,0.00089583267,0.0017871412,0.00030129016,0.000012835135,0.00020919989,0.021941341],"genre_scores_gemma":[0.9951273,0.00015903941,0.003905614,0.000041806175,0.0006896741,0.000003560998,8.847583e-7,0.000016990825,0.000055097862],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99933517,0.00001876219,0.00022201461,0.00008009822,0.00017627771,0.0001677072],"domain_scores_gemma":[0.9990711,0.000016521188,0.00018747666,0.0003986246,0.00025704718,0.000069223635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012280857,0.00013489221,0.00022705985,0.000035263973,0.00019760079,0.00024106333,0.00049487886,0.000043366676,0.0000050279396],"category_scores_gemma":[0.000039554405,0.0001024583,0.00009193103,0.000042713647,0.000100623176,0.0005534886,0.00006323563,0.00022483814,0.000009138921],"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.00027229253,0.00028582173,0.0007122536,0.00013743069,0.0005170105,0.000053755874,0.004501063,0.023571793,0.18979836,0.08276048,0.051867366,0.64552236],"study_design_scores_gemma":[0.00039618206,0.00024136661,0.005605274,0.0004076495,0.00008097686,0.00011542645,0.0004352616,0.009358452,0.9404394,0.026984433,0.0154949995,0.000440577],"about_ca_topic_score_codex":0.000007632565,"about_ca_topic_score_gemma":0.0000068522313,"teacher_disagreement_score":0.75064105,"about_ca_system_score_codex":0.000027514749,"about_ca_system_score_gemma":0.000046558867,"threshold_uncertainty_score":0.41781282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.832896,0.00015215254,0.057780568,0.000094955285,0.000353443,0.00020655437,0.0000023781115,0.00074326276,0.107770704],"genre_scores_gemma":[0.98160064,0.00003101059,0.018204663,0.00003451963,0.00005928195,5.408973e-7,0.0000011029435,0.000027704593,0.00004051494],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993863,0.000008852607,0.0001510494,0.00012882972,0.00009016496,0.0002347926],"domain_scores_gemma":[0.9994611,0.000016463766,0.000028668966,0.00042839788,0.00002438424,0.00004096588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055449877,0.00013346958,0.00017239712,0.00008158941,0.00014786402,0.00011527371,0.00017989436,0.00007216672,0.000021756006],"category_scores_gemma":[0.000010821119,0.00013183881,0.00004128265,0.00003324285,0.000049833263,0.00023614166,0.00003892191,0.00015101816,0.0000065869244],"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.000045322282,0.000058167276,0.0026404075,0.000081148784,0.00012384301,0.0008104839,0.00093659776,0.026996758,0.7153684,0.0020872676,0.0025920877,0.24825951],"study_design_scores_gemma":[0.00040486475,0.00001074919,0.0039000295,0.00024448504,0.0000125975075,0.000046802943,0.00006400104,0.5601708,0.43083686,0.0024976574,0.0014491929,0.00036194452],"about_ca_topic_score_codex":0.00058048445,"about_ca_topic_score_gemma":0.00020714864,"teacher_disagreement_score":0.5331741,"about_ca_system_score_codex":0.000047844343,"about_ca_system_score_gemma":0.000008326567,"threshold_uncertainty_score":0.53762305},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9400487,0.000395864,0.057931308,0.0001289803,0.00019846437,0.00018975996,0.0000773606,0.0000978135,0.0009317277],"genre_scores_gemma":[0.99186385,0.0001260864,0.0077235927,0.000044882272,0.000073081515,0.000017617258,0.00011760691,0.000019923984,0.000013353579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982991,0.0001671866,0.00062137557,0.00039005073,0.000314543,0.00020771565],"domain_scores_gemma":[0.9987124,0.00043719084,0.00026645226,0.00037162958,0.00016768093,0.000044601387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063432637,0.00026103004,0.00061732193,0.00037678043,0.00007405038,0.0000859621,0.00019519756,0.00018330339,0.00022414932],"category_scores_gemma":[0.00019085393,0.0002258476,0.00028942773,0.00058744877,0.00005150922,0.000060895123,0.00018292681,0.00048912416,0.0000014171662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001634795,0.00003159077,0.012326822,0.00011267069,0.002744756,0.000011169096,0.0008755894,0.9630572,0.0020607214,0.017202668,0.000119475626,0.0014409873],"study_design_scores_gemma":[0.00011442,0.000011465775,0.008540746,0.00041837382,0.00063855,0.0000023356645,0.0004718735,0.9717482,0.0045901723,0.013178959,0.0000060812126,0.00027882893],"about_ca_topic_score_codex":0.00029286352,"about_ca_topic_score_gemma":0.00006311658,"teacher_disagreement_score":0.051815134,"about_ca_system_score_codex":0.00006607305,"about_ca_system_score_gemma":0.00006903999,"threshold_uncertainty_score":0.9209798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07583026,0.000084691004,0.91900486,0.000049828453,0.00025875072,0.00039598026,0.000003943713,0.0014349512,0.0029367646],"genre_scores_gemma":[0.7112708,0.0000042579118,0.28846103,0.000013018019,0.000104077895,0.000020771473,0.000002903547,0.000048492777,0.000074660515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988717,0.000016368886,0.00028028517,0.00022355901,0.0001994976,0.0004086208],"domain_scores_gemma":[0.9990252,0.000068944224,0.00007739853,0.00065599085,0.000049007238,0.00012341556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014248682,0.00024097865,0.00033731302,0.00005051563,0.00029507716,0.00034083452,0.0004052931,0.000111701585,0.00008717952],"category_scores_gemma":[0.00011789727,0.00021007769,0.00009195633,0.000037362446,0.00017874727,0.00013926045,0.00014233899,0.00022873965,0.000054057626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007646154,0.0002448364,0.00062214246,0.00043482997,0.00017009383,0.0002079212,0.00063130306,0.0005317206,0.017590694,0.005808074,0.00027770535,0.973473],"study_design_scores_gemma":[0.00018375892,0.0000306751,0.00046820394,0.0001608955,0.000050201394,0.000057204183,0.000033132834,0.9815401,0.0092761535,0.0073296535,0.0005136557,0.00035637285],"about_ca_topic_score_codex":0.000019810157,"about_ca_topic_score_gemma":0.0000017566184,"teacher_disagreement_score":0.98100835,"about_ca_system_score_codex":0.00003618501,"about_ca_system_score_gemma":0.000010830063,"threshold_uncertainty_score":0.856672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43481448,0.00011773936,0.5623331,0.00045999972,0.0010647719,0.00038776707,0.00014607774,0.00010866488,0.00056736934],"genre_scores_gemma":[0.9640673,0.00011457031,0.035354186,0.00028529303,0.0001406465,0.000005273741,0.00002169908,0.000008448506,0.000002586812],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991376,0.00002153915,0.00050856767,0.000043870805,0.00016812484,0.000120341785],"domain_scores_gemma":[0.99869925,0.00009817389,0.0004198252,0.00018296116,0.0005539255,0.000045859477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021820453,0.00014395834,0.00026173686,0.00007658268,0.000119636046,0.00024689612,0.00026902676,0.00011624211,0.000026466503],"category_scores_gemma":[0.00020152079,0.00010288211,0.00011546868,0.0000413273,0.00015733557,0.0003997298,0.00014951148,0.0003365971,0.0000036702984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013158956,0.000209861,0.013911048,0.0031066628,0.0018637769,0.000004550117,0.020543862,0.34905428,0.0033195836,0.020974109,0.38527685,0.20041952],"study_design_scores_gemma":[0.00066078856,0.00018550492,0.013032089,0.0007803503,0.00008142855,0.000081861595,0.0001312095,0.87168425,0.004242289,0.024725012,0.08404806,0.00034716108],"about_ca_topic_score_codex":0.000023470862,"about_ca_topic_score_gemma":0.0000026243179,"teacher_disagreement_score":0.5292528,"about_ca_system_score_codex":0.00004452533,"about_ca_system_score_gemma":0.00006904457,"threshold_uncertainty_score":0.4195411},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5973136,0.000118453165,0.40083715,0.00010422218,0.0007679267,0.00009156651,0.0000054509796,0.00009058712,0.000671016],"genre_scores_gemma":[0.93332994,0.00023921118,0.06616557,0.000007801186,0.00023868307,1.4580819e-7,0.0000029884347,0.000013357813,0.0000022855406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994107,0.000017617283,0.0002597087,0.00006928816,0.00015045577,0.000092248665],"domain_scores_gemma":[0.99934506,0.000003436445,0.0002920013,0.000119494754,0.0001933662,0.000046626847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007860185,0.00009424454,0.00015294741,0.0000510944,0.00020864977,0.00018086589,0.00009855422,0.00008224856,0.000013219402],"category_scores_gemma":[0.000037039394,0.000096971526,0.000042131447,0.00005474037,0.00004118984,0.00057715597,0.00002324049,0.000077290286,7.487803e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044342385,0.000014675595,0.00034751554,0.000010236309,0.000023665429,0.000005009017,0.000040672316,0.9912003,0.0046569314,0.00015683765,0.00053852826,0.0029612316],"study_design_scores_gemma":[0.0004037533,0.000057572484,0.002708338,0.00012784291,0.000053405893,0.0002769775,0.000033543045,0.9945163,0.0011689854,0.0002098989,0.00032125163,0.00012209346],"about_ca_topic_score_codex":0.000014874908,"about_ca_topic_score_gemma":0.0000014486563,"teacher_disagreement_score":0.33601636,"about_ca_system_score_codex":0.0001347101,"about_ca_system_score_gemma":0.000012850783,"threshold_uncertainty_score":0.3954384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8587771,0.000033729695,0.13871375,0.00019631597,0.00090755615,0.00012594162,0.000016402402,0.00073862355,0.0004905561],"genre_scores_gemma":[0.95657396,0.00017625948,0.04305469,0.000039138577,0.00010068496,0.0000060265556,0.0000012422136,0.000033320433,0.000014646996],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991629,0.00002584762,0.00020426784,0.00021432275,0.000149076,0.00024358928],"domain_scores_gemma":[0.998727,0.00003931858,0.00006431674,0.0010536436,0.000048294016,0.00006737375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010032106,0.00017942995,0.0001924157,0.00016616144,0.00063148525,0.00012675527,0.0003389293,0.00013988352,0.000035589448],"category_scores_gemma":[0.000022870343,0.0001941258,0.00015015136,0.000100600184,0.0001452146,0.00027318293,0.000004450225,0.00038734166,0.0000069436037],"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.00031665366,0.00054404396,0.0027327854,0.00014351204,0.0012439508,0.000104804196,0.00088160293,0.054885983,0.49362358,0.028423069,0.00041654217,0.41668347],"study_design_scores_gemma":[0.0013700105,0.00020686146,0.035734173,0.00030600606,0.00026855178,0.00030319675,0.00019675234,0.026915124,0.84695685,0.08595697,0.000454449,0.0013310277],"about_ca_topic_score_codex":0.00023766063,"about_ca_topic_score_gemma":0.0001234459,"teacher_disagreement_score":0.41535246,"about_ca_system_score_codex":0.00006748992,"about_ca_system_score_gemma":0.000016671565,"threshold_uncertainty_score":0.79162204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5495202,0.0014172592,0.4469375,0.00019745514,0.00048666904,0.00031653576,0.00014679349,0.0005965195,0.0003810857],"genre_scores_gemma":[0.99187,0.00012885696,0.007200849,0.00019475831,0.00045608406,0.000026432814,0.000035510482,0.000079288046,0.000008263794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982244,0.000070918395,0.00053757045,0.0005173939,0.00030653775,0.00034321245],"domain_scores_gemma":[0.9991013,0.000053114476,0.00034946896,0.0002685721,0.00013474651,0.000092796334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017513179,0.00045228057,0.0005823915,0.00023428795,0.00011918104,0.00014216192,0.0002432977,0.00034721347,0.00002872554],"category_scores_gemma":[0.000004831569,0.00050065946,0.00010443404,0.00014184008,0.0004309074,0.00021298073,0.00009587088,0.0006376095,0.0000046985847],"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.00010140606,0.000049410224,0.00037497387,0.0006417535,0.0002725249,0.00000903819,0.0005185168,0.041624174,0.8628067,0.0000015520554,0.07081059,0.022789367],"study_design_scores_gemma":[0.000324697,0.00010762564,0.00063595356,0.0040249396,0.00018614563,0.000059077753,0.00006599306,0.21823102,0.77397627,0.0015615341,0.000110740475,0.00071598025],"about_ca_topic_score_codex":0.000049457107,"about_ca_topic_score_gemma":0.0000026631812,"teacher_disagreement_score":0.4423498,"about_ca_system_score_codex":0.0001210951,"about_ca_system_score_gemma":0.00004842237,"threshold_uncertainty_score":0.9997445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6358498,0.00069579226,0.16082093,0.01215676,0.00080269657,0.0009605572,0.00015799455,0.005978133,0.18257737],"genre_scores_gemma":[0.9901353,0.00008276401,0.009390265,0.00019284722,0.00006166291,0.0000071108366,0.000027970704,0.000046704143,0.0000553379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.000063670734,0.00018008421,0.00015256341,0.00016677933,0.00023187838],"domain_scores_gemma":[0.9973515,0.00019725405,0.00009106536,0.0022027504,0.00008955314,0.00006782878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012986029,0.00017166813,0.0001823214,0.00007392996,0.0011066798,0.00023346007,0.00094526535,0.00006589189,0.000008364727],"category_scores_gemma":[0.000036403402,0.00018721214,0.00008056472,0.000049799808,0.00019527954,0.00011642509,0.00018748501,0.00041817196,0.000027928172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001298476,0.00039054218,0.004292424,0.00013119905,0.00043286345,0.00008512469,0.005911845,0.07020143,0.15133817,0.009201093,0.00882612,0.7490593],"study_design_scores_gemma":[0.00020438666,0.000015358804,0.0027843304,0.00023225871,0.00001228866,0.0000028554841,0.00004263466,0.98478377,0.007988722,0.00022946313,0.0034849327,0.00021898092],"about_ca_topic_score_codex":0.00013021489,"about_ca_topic_score_gemma":0.000081562255,"teacher_disagreement_score":0.9145824,"about_ca_system_score_codex":0.000058429312,"about_ca_system_score_gemma":0.00002458302,"threshold_uncertainty_score":0.85117984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97579706,0.000014409569,0.022365116,0.00008365858,0.0003666952,0.000083005536,0.00008083953,0.00021365588,0.0009955395],"genre_scores_gemma":[0.99747735,0.00004378903,0.002082255,0.000037418027,0.00010907983,0.0000055489354,0.00022168111,0.000017145943,0.000005750912],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99953127,0.00001335583,0.00014060375,0.00013796274,0.00007804756,0.00009873703],"domain_scores_gemma":[0.99916726,0.000025211832,0.00009188972,0.0006475192,0.000048373546,0.000019753183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008914679,0.0000831119,0.000106761,0.000053575546,0.00008067106,0.000037366022,0.00024151345,0.000055901706,0.00006096803],"category_scores_gemma":[0.00003012069,0.00008897805,0.000018237119,0.000019784758,0.000040573454,0.00030122136,0.000044490265,0.00008392281,0.000036087054],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069890225,0.000008990997,0.0047680507,0.000048973936,0.000014163991,0.0000015463987,0.000008697588,0.00011584837,0.009973039,4.222962e-7,0.0010015849,0.9840517],"study_design_scores_gemma":[0.00041987776,0.00005495708,0.046482798,0.0005917736,0.000028867931,0.000018709308,0.000007251304,0.27992058,0.67145574,0.00047926925,0.00030436667,0.00023579726],"about_ca_topic_score_codex":0.000111838264,"about_ca_topic_score_gemma":0.000030903662,"teacher_disagreement_score":0.9838159,"about_ca_system_score_codex":0.000013179021,"about_ca_system_score_gemma":0.000005929091,"threshold_uncertainty_score":0.36284196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50878626,0.000046645397,0.48388854,0.00022123697,0.00047367252,0.000148284,0.0000031715037,0.0007959398,0.005636269],"genre_scores_gemma":[0.85517824,0.0000043385485,0.14429943,0.00007202446,0.0002940881,0.0000064068513,0.0000036303506,0.000030524254,0.00011134593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991196,0.000018085728,0.00024568415,0.00021738088,0.00014159783,0.00025769632],"domain_scores_gemma":[0.9990787,0.000029686165,0.000052515716,0.0006561438,0.00006275788,0.00012018636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008083925,0.0001460542,0.00020478532,0.000073599105,0.0004472087,0.0003030563,0.00026393193,0.00007014401,0.000019610965],"category_scores_gemma":[0.000068425,0.00014716074,0.000054651468,0.00005514646,0.000039148526,0.00016857665,0.00011165523,0.00014637405,0.00002631711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006406262,0.000040518207,0.003792346,0.00000910538,0.00006190949,0.00003769961,0.0004089958,0.77135795,0.17155339,0.0018149095,0.037548766,0.013367978],"study_design_scores_gemma":[0.00008378051,0.00001553927,0.0010263748,0.000034177574,0.000012634851,0.000007514073,0.000080797035,0.9214964,0.07480057,0.00020146505,0.0020534873,0.00018725194],"about_ca_topic_score_codex":0.0002622156,"about_ca_topic_score_gemma":0.000043802043,"teacher_disagreement_score":0.34639195,"about_ca_system_score_codex":0.000038564256,"about_ca_system_score_gemma":0.000013506732,"threshold_uncertainty_score":0.6001041},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767902,0.00026690392,0.21686986,0.00014115042,0.00042618738,0.00015237222,0.0000012656176,0.00010842024,0.0052436204],"genre_scores_gemma":[0.7579094,0.00030758427,0.2413129,0.00003348082,0.00038139054,4.9861846e-8,0.000001419568,0.000024258114,0.000029518655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.000019871193,0.00042996832,0.0001483726,0.00020565628,0.00026663067],"domain_scores_gemma":[0.99914736,0.00004127013,0.00022181848,0.00028678132,0.00022414594,0.000078604244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021036976,0.00018126931,0.00031907894,0.0001915581,0.00026734453,0.0001620568,0.00016325263,0.00013187826,0.0000011476907],"category_scores_gemma":[0.000057773657,0.00017634322,0.00004896453,0.00018733842,0.000075690405,0.0001367755,0.00002363469,0.00054922176,5.585274e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008221767,0.000091572234,0.0008544859,0.0001525714,0.00026321138,0.0002522662,0.001366644,0.046005417,0.46339238,0.0011801826,0.0006141889,0.48574486],"study_design_scores_gemma":[0.0010217741,0.00006910604,0.034467075,0.0003852336,0.00008758296,0.0005734948,0.00012603073,0.89008045,0.06345813,0.007187833,0.0019990003,0.0005442594],"about_ca_topic_score_codex":0.000057958354,"about_ca_topic_score_gemma":0.00006277897,"teacher_disagreement_score":0.8440751,"about_ca_system_score_codex":0.000055728447,"about_ca_system_score_gemma":0.000046216348,"threshold_uncertainty_score":0.7191068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5416426,0.0030118206,0.036480065,0.0012317264,0.005361801,0.0001702647,0.0005824123,0.0016565073,0.40986282],"genre_scores_gemma":[0.9795017,0.0015396373,0.007629893,0.0015992634,0.003633436,0.0010270299,0.003314661,0.0013208631,0.0004334729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98845667,0.00062515674,0.0022347271,0.002589325,0.002896649,0.0031974781],"domain_scores_gemma":[0.9901916,0.0014825194,0.002786464,0.0037490372,0.00035075654,0.0014396576],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0017196934,0.0014486222,0.0006383143,0.0008887823,0.0034191434,0.0029387437,0.0029547713,0.0032682242,0.17127243],"category_scores_gemma":[0.0010247908,0.0026629511,0.002390932,0.0017740724,0.0016057449,0.0024413345,0.0019932813,0.0031909095,0.00057880435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027731592,0.00043593405,0.00012132099,0.00076062046,0.0043771467,0.0029256348,0.00093199406,0.56404704,0.0013146427,0.17328313,0.24537507,0.0036543498],"study_design_scores_gemma":[0.0015310966,0.0013604705,0.00021854108,0.0010992907,0.0028112633,0.0007669801,0.0004573109,0.61197084,0.37596902,0.000054585675,0.002023027,0.0017375696],"about_ca_topic_score_codex":0.0023888887,"about_ca_topic_score_gemma":0.001992112,"teacher_disagreement_score":0.43785915,"about_ca_system_score_codex":0.000037081372,"about_ca_system_score_gemma":0.0009482243,"threshold_uncertainty_score":0.9998264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01616921,0.00003531734,0.8515392,0.00042529884,0.00034853336,0.0008811352,0.000024543011,0.0017120222,0.12886474],"genre_scores_gemma":[0.9258169,0.00003267238,0.06685298,0.000053969306,0.00025922852,0.00009729415,0.000017173877,0.00004905501,0.006820728],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939734,0.0000038168464,0.00014306117,0.00015749615,0.00008179625,0.00021647134],"domain_scores_gemma":[0.99934936,0.000038832928,0.000038929586,0.00047845163,0.000043564454,0.000050894963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053524174,0.0001388815,0.00014946444,0.000039096893,0.00017892999,0.00011698826,0.00021929934,0.00005979743,0.00013708191],"category_scores_gemma":[0.00002514044,0.00012852329,0.000054813074,0.000018147703,0.000028136707,0.00012136293,0.0000408443,0.00005416537,0.00007642566],"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.000013638131,0.000072849114,0.00011000468,0.000031221232,0.00008554059,0.000012366896,0.000156941,0.00030086373,0.8460368,0.00069592794,0.09714018,0.05534369],"study_design_scores_gemma":[0.00027264786,0.00009744448,0.00042855405,0.00004976297,0.000017187747,0.0000037851455,0.000009444311,0.5060848,0.4850939,0.00051051367,0.007192479,0.00023945676],"about_ca_topic_score_codex":0.00007880883,"about_ca_topic_score_gemma":0.00003341589,"teacher_disagreement_score":0.9096477,"about_ca_system_score_codex":0.000036599966,"about_ca_system_score_gemma":0.000011417228,"threshold_uncertainty_score":0.52410275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4300325,0.000121822595,0.5026662,0.0000745672,0.00025373092,0.00040245012,0.000007767586,0.0007721952,0.065668814],"genre_scores_gemma":[0.9733517,0.0000074632626,0.026164697,0.000015239625,0.000049659848,0.000013852951,7.380195e-7,0.000010050537,0.0003865799],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997887,0.000004446165,0.00006289802,0.000047864563,0.000028071334,0.00006799498],"domain_scores_gemma":[0.9996127,0.000017201493,0.000021874488,0.00030662073,0.00002819578,0.000013399547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006660026,0.000045068795,0.00008453062,0.000014355662,0.00004129702,0.0000150344495,0.0001269359,0.000028185359,0.000019124485],"category_scores_gemma":[0.00003061471,0.000037214853,0.000039949235,0.0000054060592,0.000024481185,0.000054228403,0.000019875111,0.00001999323,0.0000010244432],"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.00012812513,0.00006029021,0.00046532895,0.00013774882,0.00020690866,0.0000036272118,0.0003455535,0.0006317953,0.46495134,0.38142392,0.054973725,0.09667164],"study_design_scores_gemma":[0.00022959858,0.0000203497,0.00046545273,0.000021115578,0.000010872497,9.4538325e-7,0.00000876324,0.018202439,0.9027567,0.07396504,0.004234822,0.00008391578],"about_ca_topic_score_codex":0.000009082961,"about_ca_topic_score_gemma":0.0000031982515,"teacher_disagreement_score":0.5433192,"about_ca_system_score_codex":0.0000036066758,"about_ca_system_score_gemma":0.000003145457,"threshold_uncertainty_score":0.15175776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15014336,0.000021019503,0.84766835,0.000022483777,0.00030982573,0.0002425166,0.000010339605,0.0009687841,0.0006133298],"genre_scores_gemma":[0.9972408,0.0000040029718,0.0023220794,0.00004432102,0.00021527028,0.00008198505,4.7221693e-7,0.000051661114,0.000039447583],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917346,0.000025520474,0.00013824213,0.0002571933,0.00013486849,0.00027068786],"domain_scores_gemma":[0.99948996,0.00009004422,0.000045621717,0.00014974539,0.0001597115,0.00006489297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009738021,0.00019937514,0.00017906206,0.00015004439,0.00039498453,0.00007436103,0.00008718623,0.00012773919,0.000030123365],"category_scores_gemma":[0.000003111801,0.00020932555,0.00009576031,0.00022287173,0.0000930396,0.00031044145,5.156921e-7,0.00022839232,0.000017444601],"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.000131086,0.000064294436,0.0000013366091,0.000038519047,0.00003655528,0.0000017355184,0.00014931952,0.017947733,0.4265722,0.000003609995,0.00008023896,0.55497336],"study_design_scores_gemma":[0.00019399168,0.000172562,0.000025395106,0.00006570028,0.00003067443,0.000006863753,0.000024398068,0.29570043,0.70302296,0.0002703589,0.0003090745,0.00017760361],"about_ca_topic_score_codex":0.000011212672,"about_ca_topic_score_gemma":0.000052130654,"teacher_disagreement_score":0.8470974,"about_ca_system_score_codex":0.000102622944,"about_ca_system_score_gemma":0.000027016207,"threshold_uncertainty_score":0.8536048},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18395925,0.0017135454,0.64358544,0.0004582052,0.0019089099,0.00021899356,7.493767e-7,0.00065550685,0.16749942],"genre_scores_gemma":[0.9575101,0.00011780784,0.041892827,0.00011074385,0.0002427262,0.0000013791097,8.537516e-8,0.000013370403,0.000110961584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860203,0.0003838428,0.00031608687,0.00013268732,0.0003212374,0.00024411094],"domain_scores_gemma":[0.9990253,0.0005322722,0.00015159021,0.00010848365,0.00012232183,0.000060018316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003985188,0.00012473812,0.0003397188,0.00028369974,0.00026534055,0.00011438884,0.00029893985,0.00002255735,0.000069528774],"category_scores_gemma":[0.0004026774,0.00008939515,0.0001403497,0.0002706985,0.00065112545,0.00020801256,0.000028205859,0.00029081054,0.000012823803],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058034356,0.00014187493,0.0027268727,0.000050303883,0.000517937,0.00016270377,0.007326672,0.104435906,0.16415028,0.076434925,0.016311754,0.62193733],"study_design_scores_gemma":[0.015010837,0.00046580881,0.00033112342,0.0010410803,0.00012785994,0.00069246715,0.0013230273,0.46801814,0.36184847,0.14217712,0.00829733,0.0006667465],"about_ca_topic_score_codex":0.000003407878,"about_ca_topic_score_gemma":2.256344e-7,"teacher_disagreement_score":0.77355087,"about_ca_system_score_codex":0.000019194835,"about_ca_system_score_gemma":0.000029787301,"threshold_uncertainty_score":0.36454284},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8144211,0.000075393276,0.1842387,0.00017386682,0.00027140256,0.00020602881,0.0000053470467,0.00041713222,0.00019098152],"genre_scores_gemma":[0.9638339,0.0000065536183,0.03579809,0.000113266135,0.00019771456,0.000006833427,0.000005458297,0.000037648566,5.2864044e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99853367,0.00009491908,0.00053039653,0.00020471915,0.00027490174,0.00036139932],"domain_scores_gemma":[0.99916804,0.0003258717,0.00007531181,0.00030499516,0.000048927403,0.00007687456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057516975,0.0002144726,0.00032430288,0.00025995524,0.00004588282,0.000022182106,0.00023119742,0.00014054473,0.000022456132],"category_scores_gemma":[0.00015107481,0.00018254056,0.000073283605,0.00046979915,0.00036817917,0.000074882766,0.000071992734,0.00037610525,0.0000032051094],"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.000014230899,0.0000089117575,0.00019290493,0.0000365998,0.00003283729,0.000015324673,0.00016416726,0.0010737218,0.99199206,0.00005767092,0.0003076714,0.0061038844],"study_design_scores_gemma":[0.0005952554,0.000060262842,0.010430004,0.0013264153,0.000025621968,0.00018836417,0.00012134256,0.3126351,0.6706459,0.00010196982,0.0031996325,0.0006701456],"about_ca_topic_score_codex":0.00016547098,"about_ca_topic_score_gemma":0.000005524633,"teacher_disagreement_score":0.3213462,"about_ca_system_score_codex":0.00008244202,"about_ca_system_score_gemma":0.000016066038,"threshold_uncertainty_score":0.7443788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.754627,0.0004015715,0.23715837,0.000001783431,0.00034469736,0.0003639303,0.000044085737,0.00053584995,0.0065227016],"genre_scores_gemma":[0.99618113,0.0008381518,0.0025814443,0.000014556251,0.00010109607,8.1915294e-7,0.000025383672,0.00005323342,0.00020420771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986826,0.00006188512,0.0002450872,0.00062242965,0.000088113506,0.00029987475],"domain_scores_gemma":[0.998676,0.0001391119,0.00016949032,0.0007395643,0.00015820321,0.000117632175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013010809,0.00037130484,0.00050994207,0.00030571857,0.000057758953,0.00003944159,0.00042495254,0.00032296678,0.000021679736],"category_scores_gemma":[0.000022313396,0.0004319099,0.00015603892,0.0003012974,0.0002060012,0.000073155294,0.0005048752,0.00042019237,0.000014973285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008932845,0.00008273731,0.0001365675,0.00028782478,0.00016889902,0.00019560201,0.000120843586,0.99627817,0.00071034016,0.00038939458,0.000672432,0.00086783763],"study_design_scores_gemma":[0.00048236226,0.00007011543,0.000035445315,0.00031395315,0.00016537622,0.000016764867,0.000063266874,0.9904752,0.0061661857,0.001456625,0.00027732665,0.0004773786],"about_ca_topic_score_codex":0.00012932335,"about_ca_topic_score_gemma":0.000009337816,"teacher_disagreement_score":0.2415541,"about_ca_system_score_codex":0.00011918868,"about_ca_system_score_gemma":0.000042636468,"threshold_uncertainty_score":0.99981326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2253213,0.001331492,0.4271953,0.0014483744,0.0023983421,0.001584371,0.00003238352,0.007619536,0.3330689],"genre_scores_gemma":[0.82898325,0.00013569706,0.16560191,0.0001402899,0.00081842195,0.000029418876,0.000013149993,0.000119467564,0.004158404],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99848527,0.000010748984,0.00031317634,0.00036316767,0.00020861255,0.0006190549],"domain_scores_gemma":[0.99849725,0.00006957901,0.000092766764,0.0010337837,0.000095615724,0.0002110032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012120022,0.00035761247,0.00038541778,0.00013691893,0.00034918138,0.0003285007,0.0005941694,0.00019714332,0.00019883206],"category_scores_gemma":[0.00006169038,0.0003390623,0.00020838002,0.000079208796,0.000055815974,0.0003686666,0.00011397715,0.0001974256,0.00008415469],"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.00014492683,0.00010322401,0.00048994226,0.00010116953,0.00053657696,0.00013260193,0.00076872326,0.00087602186,0.40848425,0.07849018,0.42498666,0.0848857],"study_design_scores_gemma":[0.002075506,0.00023836625,0.002295537,0.0003056225,0.00017289775,0.00007617007,0.000068252615,0.13592568,0.58645004,0.019763418,0.2510959,0.0015326468],"about_ca_topic_score_codex":0.00014713398,"about_ca_topic_score_gemma":0.0002199328,"teacher_disagreement_score":0.60366195,"about_ca_system_score_codex":0.0000991839,"about_ca_system_score_gemma":0.00004967114,"threshold_uncertainty_score":0.9999061},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0629992,0.00008534815,0.93583745,0.00007305613,0.000022608552,0.0007027566,0.000023549735,0.0000862762,0.00016973708],"genre_scores_gemma":[0.40227187,0.000008850934,0.5971458,0.0000018453301,0.000019693245,0.00038770752,0.000020968762,0.000015977383,0.00012729611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922955,0.000040153755,0.00019825928,0.000094098104,0.00030029702,0.00013762129],"domain_scores_gemma":[0.9994805,0.0001283517,0.00001181765,0.00013885302,0.000216349,0.000024129235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008818554,0.00005665657,0.00009952688,0.00016639306,0.000339677,0.000051473624,0.00010290463,0.00002205335,0.000046701796],"category_scores_gemma":[0.00009925717,0.000058843794,0.000020773223,0.00015617754,0.00005015628,0.00007608536,0.00007423232,0.00013807724,0.0000012889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007175748,0.0001090776,0.00000736078,0.00011774274,0.00003066755,6.374201e-7,0.0012002885,0.93867546,0.040369175,0.014624141,0.0017827338,0.003075545],"study_design_scores_gemma":[0.000088162524,0.00009124371,0.000013581036,0.000013785289,0.000004299958,0.000009598796,0.00040247964,0.9778425,0.016362896,0.004770716,0.000340337,0.000060389848],"about_ca_topic_score_codex":0.0000058835967,"about_ca_topic_score_gemma":8.1318126e-7,"teacher_disagreement_score":0.33927268,"about_ca_system_score_codex":0.000043472166,"about_ca_system_score_gemma":0.000037980906,"threshold_uncertainty_score":0.26125553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02519202,0.0017600975,0.95372665,0.0019166378,0.0044995826,0.0008045457,0.000007963097,0.00084237865,0.011250124],"genre_scores_gemma":[0.98223436,0.0003910885,0.01691557,0.00020216926,0.00015386872,0.000012100956,0.000012481058,0.000042781397,0.000035587487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776804,0.0001287786,0.0005844816,0.00050355314,0.00053251407,0.0004826079],"domain_scores_gemma":[0.9989678,0.0000738991,0.00031699517,0.00037170804,0.00016793139,0.00010161074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011916548,0.00034355232,0.00037177905,0.0008491273,0.00023196278,0.00077981735,0.00067349884,0.00009902266,0.000031465006],"category_scores_gemma":[0.000058056365,0.00032120736,0.000109114204,0.0004820591,0.00023519844,0.0005355853,0.00013066689,0.0010661995,0.000020225203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040735204,0.000021073698,0.004498071,0.000044310596,0.000009202101,0.000016896538,0.00019042447,0.9879363,0.0012249172,0.000057543406,0.0016787623,0.004318414],"study_design_scores_gemma":[0.00016787568,0.000016690781,0.00026187676,0.001381778,0.0000132344185,0.000070409355,0.00013263535,0.99173516,0.0018558394,0.003636072,0.00035261447,0.0003758385],"about_ca_topic_score_codex":0.00011547438,"about_ca_topic_score_gemma":0.000011292204,"teacher_disagreement_score":0.95704234,"about_ca_system_score_codex":0.0003191878,"about_ca_system_score_gemma":0.00017523681,"threshold_uncertainty_score":0.999924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23961844,0.0005834282,0.75855964,0.00020786413,0.00004243636,0.0002398545,0.00014628164,0.000050676375,0.0005513874],"genre_scores_gemma":[0.99431986,0.0004967606,0.005002016,0.000031673797,0.000094281655,0.00002109549,0.000009002192,0.000008164483,0.000017146662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992555,0.00003310465,0.00028346578,0.00018270372,0.00014454301,0.00010070628],"domain_scores_gemma":[0.9992279,0.000016929218,0.00013991892,0.000412334,0.00013026355,0.000072659685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016094984,0.00012777685,0.00025974936,0.00009179032,0.00013715064,0.00007621689,0.00017723936,0.00008662675,0.00001005306],"category_scores_gemma":[0.000009541024,0.00009533593,0.0001373978,0.00051392755,0.00004994055,0.00002218906,0.00014788641,0.00020650233,9.1597656e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010593381,0.0006138555,0.22672504,0.0005591969,0.004294317,0.0000028113504,0.0014280642,0.6818332,0.0021765598,0.028705042,0.0077701434,0.045785815],"study_design_scores_gemma":[0.00057608134,0.00011777462,0.3744801,0.00063124986,0.004645781,0.000035571356,0.00042951765,0.40592977,0.005436327,0.1447491,0.061716657,0.0012520644],"about_ca_topic_score_codex":0.000008669202,"about_ca_topic_score_gemma":0.00008614407,"teacher_disagreement_score":0.75470144,"about_ca_system_score_codex":0.00005081269,"about_ca_system_score_gemma":0.000014832754,"threshold_uncertainty_score":0.3887686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8069895,0.0005775384,0.091989934,0.0001995331,0.0013189749,0.00029272152,0.0000012907327,0.005000177,0.09363034],"genre_scores_gemma":[0.9977586,0.000045213117,0.001788451,0.000019428811,0.00012696467,0.000006487778,0.0000014434206,0.00003309025,0.00022028016],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992892,0.00001556579,0.0001337424,0.00014207479,0.00022578586,0.0001936154],"domain_scores_gemma":[0.9994167,0.0000128351785,0.00004124546,0.0003978696,0.00007192217,0.000059389353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001344047,0.00013041777,0.00012691296,0.00005732699,0.00038380397,0.000121593344,0.00015979372,0.000058065285,0.00004729967],"category_scores_gemma":[0.00012223344,0.0001255519,0.00005945255,0.00002140147,0.000036548114,0.00016314219,0.000062596446,0.00017560335,0.00005276453],"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.000027154296,0.00009970349,0.055683266,0.000044196157,0.0003070537,0.00009271963,0.00042077817,0.05584768,0.7884209,0.000661972,0.043930836,0.05446373],"study_design_scores_gemma":[0.00054249767,0.00007359132,0.13006435,0.00022699933,0.000040540996,0.00002757604,0.00009723654,0.17962712,0.6346097,0.00059243967,0.053468235,0.0006297252],"about_ca_topic_score_codex":0.00010108941,"about_ca_topic_score_gemma":0.000038577644,"teacher_disagreement_score":0.19076917,"about_ca_system_score_codex":0.00007591911,"about_ca_system_score_gemma":0.000008746434,"threshold_uncertainty_score":0.5119858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59178805,0.010918977,0.38591158,0.00004668627,0.005742502,0.0006025164,0.000059304788,0.0014424515,0.003487885],"genre_scores_gemma":[0.9968678,0.00024105639,0.0013741013,0.00014929991,0.0012617278,0.00001280601,0.000007424737,0.00004714251,0.00003866314],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889416,0.00002243344,0.00030343406,0.00024391183,0.00023245557,0.00030362784],"domain_scores_gemma":[0.9990942,0.00013217116,0.00006927289,0.00032917634,0.00025767006,0.000117538315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022400545,0.00022136107,0.00028124786,0.00031324633,0.000114858725,0.00015574596,0.00015353813,0.00018108853,0.000014966677],"category_scores_gemma":[0.00008798563,0.00020979703,0.00003934166,0.0016174844,0.00007191432,0.000067959176,0.000041560717,0.00024271253,0.000053830874],"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.00030869202,0.0008103249,0.01914044,0.001188043,0.0011467526,0.000105497966,0.0022108757,0.19739066,0.12165341,0.19805467,0.4234268,0.03456381],"study_design_scores_gemma":[0.00025481294,0.0007139219,0.0012760591,0.00071384874,0.000044321136,0.00002453512,0.00017454312,0.54310024,0.06997253,0.0004514614,0.3823187,0.0009550397],"about_ca_topic_score_codex":0.000011109964,"about_ca_topic_score_gemma":5.900513e-7,"teacher_disagreement_score":0.4050797,"about_ca_system_score_codex":0.00007218413,"about_ca_system_score_gemma":0.000009052396,"threshold_uncertainty_score":0.85552746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015015436,0.01744809,0.9660943,0.000033554934,0.00011070015,0.0002217795,0.00031782276,0.0006952799,0.000062992476],"genre_scores_gemma":[0.92673135,0.0008269587,0.066550724,0.00006454042,0.00021665849,0.000033065342,0.005488511,0.00007332242,0.000014843621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796724,0.00013197471,0.0004756993,0.00090384734,0.00022530269,0.00029594544],"domain_scores_gemma":[0.9979906,0.00042270537,0.0001833308,0.0010736143,0.00024278279,0.00008694615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012082033,0.00039611297,0.00086618756,0.00040825206,0.00027161546,0.0008360103,0.00063038734,0.0003423047,0.000023327715],"category_scores_gemma":[0.0001577892,0.00039263055,0.0002229216,0.00048303965,0.00013588459,0.0002455726,0.0006108936,0.0004347439,5.013411e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026509407,0.00009099146,0.00035021963,0.002336266,0.0061066383,0.00001348193,0.000997572,0.66774255,0.0034333004,0.00074965245,0.00054349727,0.31737074],"study_design_scores_gemma":[0.00027578292,0.000008539681,0.000048751906,0.00065617944,0.0052948226,0.000002860786,0.00041828834,0.9634621,0.0023999286,0.026659338,0.00024810096,0.0005253212],"about_ca_topic_score_codex":0.000034859764,"about_ca_topic_score_gemma":0.000023312554,"teacher_disagreement_score":0.9117159,"about_ca_system_score_codex":0.000025995716,"about_ca_system_score_gemma":0.000077383236,"threshold_uncertainty_score":0.99985254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039264167,0.00065190194,0.99520296,0.00003724391,0.0026779503,0.00042787386,0.00002687868,0.00032234716,0.00026022914],"genre_scores_gemma":[0.1679343,0.00029370477,0.829701,0.00023248007,0.0015463418,0.000012774328,0.00010768791,0.00009683623,0.00007488911],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842733,0.000016720976,0.000270945,0.0007668789,0.00018923852,0.0003289062],"domain_scores_gemma":[0.9985214,0.00022731925,0.0000823342,0.0009208966,0.00015982015,0.00008822604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038377577,0.00033971312,0.00032908475,0.00037715214,0.00012438577,0.00020241419,0.0008367346,0.00020988745,0.000003554595],"category_scores_gemma":[0.00006626083,0.0003082929,0.000034554723,0.00019278198,0.00029703995,0.00014922634,0.0004863588,0.00025510084,0.0000014366132],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006621268,0.000009727058,0.000010522479,0.000047612313,0.000029467137,0.000005928137,0.0004289757,0.008305766,0.0033461917,0.00028000833,0.0004592285,0.98706996],"study_design_scores_gemma":[0.0001605598,0.00013042027,0.00003878531,0.0003260157,0.000029295428,0.000024476927,1.5690003e-7,0.89965636,0.028355448,0.0476725,0.02307458,0.00053140015],"about_ca_topic_score_codex":0.000008532512,"about_ca_topic_score_gemma":0.000022515886,"teacher_disagreement_score":0.9865385,"about_ca_system_score_codex":0.00010154371,"about_ca_system_score_gemma":0.00005315591,"threshold_uncertainty_score":0.99993694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726155,0.00002130918,0.6230798,0.00008933877,0.000614925,0.00043636543,0.0000028136453,0.0018930758,0.0012469119],"genre_scores_gemma":[0.882439,0.000004022633,0.116521865,0.00031239347,0.0006310516,0.000008255867,0.0000058012024,0.000052497424,0.000025075453],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902016,0.00002654076,0.0002710653,0.0002569791,0.000105756575,0.0003195067],"domain_scores_gemma":[0.99939185,0.00008895907,0.0000635532,0.00024837974,0.00015432325,0.00005291867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012606382,0.00018114223,0.000173918,0.000105829546,0.0001940019,0.00009704768,0.00016759058,0.000067760746,0.000003295467],"category_scores_gemma":[0.00009533575,0.00019626223,0.00007251559,0.00013227027,0.00003995972,0.00013248631,0.000040172858,0.0001267841,0.000019785299],"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.000016939239,0.000024803114,0.00008979641,0.00005123795,0.000018841536,0.00001740461,0.00034407986,0.0055354717,0.94765663,0.00015278236,0.023203656,0.022888364],"study_design_scores_gemma":[0.00036137603,0.00007415976,0.0008315795,0.00011852473,0.0000115527,0.000016346863,0.0000139102685,0.74876666,0.2462421,0.00009207136,0.0032589345,0.00021279983],"about_ca_topic_score_codex":0.0000062846952,"about_ca_topic_score_gemma":0.0000025798795,"teacher_disagreement_score":0.7432312,"about_ca_system_score_codex":0.00003776898,"about_ca_system_score_gemma":0.000008081616,"threshold_uncertainty_score":0.80033416},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12142136,0.000016978429,0.8733681,0.0000037269176,0.0004389235,0.000067391804,8.1082834e-7,0.00084569363,0.003837001],"genre_scores_gemma":[0.67262185,0.0000071449113,0.32708097,0.00001740211,0.0002202747,0.0000010103395,0.0000021651094,0.000016138607,0.00003305024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956167,0.000012965414,0.00012413209,0.00010948616,0.00006123827,0.00013050812],"domain_scores_gemma":[0.9997571,0.0000050725016,0.000019995721,0.000115739436,0.00007080549,0.00003127467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003739658,0.00008972865,0.00007721655,0.00007548353,0.00006462868,0.00003537045,0.00005038788,0.00006741191,0.00042036737],"category_scores_gemma":[0.000003983126,0.000092036054,0.000028137754,0.00009443896,0.000052249776,0.00015269445,0.000016110256,0.000057038997,0.00002133311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012682896,0.000020017465,0.00032982123,0.0000065016657,0.00004770946,0.0000056674226,0.0000943523,0.68895644,0.28517416,0.00018597949,0.0009240501,0.024242595],"study_design_scores_gemma":[0.000090770896,0.000012973486,0.000023521736,0.00001989463,0.00000868232,0.000034327906,0.000012202181,0.76669824,0.23282257,0.00005414568,0.00012830057,0.000094384784],"about_ca_topic_score_codex":0.00004453088,"about_ca_topic_score_gemma":0.000013015443,"teacher_disagreement_score":0.5512005,"about_ca_system_score_codex":0.00003989015,"about_ca_system_score_gemma":0.000008187615,"threshold_uncertainty_score":0.4602728},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020528971,0.0008263629,0.7406841,0.00039373498,0.00058482116,0.0016476768,0.00006753146,0.0008212752,0.2529216],"genre_scores_gemma":[0.94094706,0.00088970276,0.05745552,0.00027463955,0.000033165015,0.000029370274,0.00024300392,0.000030006151,0.00009751975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860674,0.000046218553,0.00058398565,0.000191413,0.00037168854,0.00019993715],"domain_scores_gemma":[0.99753463,0.00025165602,0.00024155005,0.0015792279,0.0003366615,0.000056243614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046202922,0.00026926838,0.0003033264,0.0011732199,0.00033911646,0.0003624971,0.0007734288,0.00013680378,0.0000041374733],"category_scores_gemma":[0.00001986295,0.00026751086,0.000024609784,0.00032468987,0.0008953684,0.0019032105,0.00030899612,0.0004553357,0.000017720262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029602475,0.000024589473,0.00003305615,0.000070774106,0.000014497931,0.0000014520557,0.0022282607,0.923152,0.0000084670155,0.051236693,0.001048315,0.022152273],"study_design_scores_gemma":[0.00027659998,0.0000607092,0.0004697668,0.001758447,0.0000071003415,0.000014488211,0.000042927506,0.98623955,0.000027986753,0.0017184891,0.009102667,0.00028126812],"about_ca_topic_score_codex":0.000052361862,"about_ca_topic_score_gemma":0.00004739819,"teacher_disagreement_score":0.93889415,"about_ca_system_score_codex":0.00025660585,"about_ca_system_score_gemma":0.00008652209,"threshold_uncertainty_score":0.9999777},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8860576,0.00014395925,0.11072077,0.00085466297,0.0002830262,0.00007364589,0.0000014212089,0.000058127116,0.001806786],"genre_scores_gemma":[0.9982836,0.00012818491,0.0005660492,0.0009984609,0.000019653422,6.510359e-8,3.191283e-7,0.0000029915955,6.803744e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.000017325257,0.00026212574,0.000020135214,0.00010445603,0.00006469403],"domain_scores_gemma":[0.99969304,0.00005213837,0.00009430317,0.000055361346,0.00007709548,0.000028085737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006752421,0.000060922244,0.00010576563,0.00006240111,0.000023084422,0.000055459324,0.00008854461,0.000030890995,0.0000064450564],"category_scores_gemma":[0.00010219556,0.0000421944,0.000026170394,0.00011541331,0.000023858966,0.0005285309,0.000021164517,0.00019757515,0.0000056066046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005367932,0.000022384169,0.00082364876,0.00009446893,0.00007137439,0.00002163757,0.0053895954,0.48112252,0.0102697015,0.0015547955,0.01227299,0.4878201],"study_design_scores_gemma":[0.0007041219,0.00028031002,0.0043662875,0.0007043953,0.000011651588,0.00008182755,0.00042480038,0.9465808,0.03716482,0.0026299497,0.0068654725,0.00018554744],"about_ca_topic_score_codex":0.000006430977,"about_ca_topic_score_gemma":0.000001750185,"teacher_disagreement_score":0.48763454,"about_ca_system_score_codex":0.000017511324,"about_ca_system_score_gemma":0.000018456967,"threshold_uncertainty_score":0.17206377},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2008037e-7,0.49194273,0.5072236,0.000005269665,0.00015981586,0.00047287327,0.000026036938,0.00015322657,0.000016337517],"genre_scores_gemma":[0.00004750721,0.6461968,0.35305965,0.00011444815,0.00024313858,0.00004431593,0.0002712459,0.000022490342,3.96799e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977534,0.000057610392,0.0005074251,0.0009470983,0.00030381844,0.00043068765],"domain_scores_gemma":[0.99745363,0.00018178922,0.00018126884,0.0020064644,0.00011554226,0.00006130441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011953559,0.00035640525,0.0012066505,0.000542392,0.00010995784,0.00013534946,0.0020814661,0.00019143969,0.000003199931],"category_scores_gemma":[0.00013757548,0.00028317797,0.00023861633,0.0033537594,0.00010123579,0.00023788112,0.00053899665,0.000319955,0.000005212921],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2171212e-7,0.000017519016,0.0000018001741,0.006211139,0.000075783835,0.0000011195344,0.000035440753,0.002424294,3.6088e-7,0.0000048922657,0.000657334,0.99057],"study_design_scores_gemma":[0.000038196922,0.000019796571,0.000001434078,0.012313317,0.0007255535,0.000013048877,6.008575e-8,0.79369015,0.000014353837,0.00016296598,0.19267441,0.0003467045],"about_ca_topic_score_codex":0.0000049954024,"about_ca_topic_score_gemma":0.000027041215,"teacher_disagreement_score":0.9902233,"about_ca_system_score_codex":0.00012113646,"about_ca_system_score_gemma":0.00011255829,"threshold_uncertainty_score":0.99996203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15448214,0.00008032151,0.7095118,0.000030118728,0.00010017135,0.00028872088,0.0000024281812,0.0020117806,0.13349248],"genre_scores_gemma":[0.8422501,0.000011812381,0.15719588,0.00004314786,0.0001176868,0.000009702183,0.000004246115,0.00004321687,0.00032421265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927074,0.0000069050466,0.00015737396,0.00015438699,0.00012716519,0.00028345248],"domain_scores_gemma":[0.9995096,0.000017353326,0.000028079216,0.00028946486,0.000102712416,0.00005281688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006729128,0.00016146203,0.00014968272,0.0001075052,0.00015394224,0.00006917245,0.00011667702,0.00006263252,0.00018116564],"category_scores_gemma":[0.0000049057376,0.00013043276,0.000026853284,0.000277115,0.00006732785,0.00022945766,0.000031203257,0.00010950517,0.000030789524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006662888,0.00030179558,0.0028064612,0.00032603898,0.000639187,0.000039708786,0.003140108,0.46360064,0.45167854,0.018219212,0.04099514,0.018186552],"study_design_scores_gemma":[0.00019829882,0.00007709765,0.0000863799,0.00017243734,0.000025583402,0.000031787604,0.000058864585,0.8908922,0.10005334,0.00071808946,0.0073867887,0.0002991384],"about_ca_topic_score_codex":0.00012937946,"about_ca_topic_score_gemma":0.00012977302,"teacher_disagreement_score":0.687768,"about_ca_system_score_codex":0.000046663532,"about_ca_system_score_gemma":0.000021374797,"threshold_uncertainty_score":0.5318893},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25645566,0.00003588313,0.708833,0.000051564766,0.000849277,0.0002718296,0.0000074593218,0.0017898652,0.03170546],"genre_scores_gemma":[0.90168977,0.0000016638804,0.09740445,0.00012613132,0.00053203345,0.000006146538,0.000004167742,0.000029301702,0.00020631732],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999425,0.0000044782078,0.00011539699,0.00014395917,0.000069523274,0.00024163665],"domain_scores_gemma":[0.99967855,0.000025313524,0.00001467104,0.00017992684,0.00005678502,0.000044762786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005333903,0.00012035685,0.00013264119,0.00006336688,0.00007697403,0.00003946287,0.00010701633,0.000072096525,0.00006918193],"category_scores_gemma":[0.000009052986,0.0001112405,0.000046973946,0.000068563284,0.000029188166,0.00008647057,0.000022623059,0.000072565635,0.0000122419815],"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.000036404097,0.000019244453,0.00022871442,0.000047414764,0.00024946127,0.0000127948115,0.0067041465,0.001340571,0.27034822,0.0029261808,0.04639139,0.6716955],"study_design_scores_gemma":[0.00040881717,0.00012938613,0.00063190114,0.00006231747,0.00002721518,0.000024262648,0.00037972894,0.2382058,0.7260949,0.0042455634,0.029349534,0.0004405789],"about_ca_topic_score_codex":0.000010928611,"about_ca_topic_score_gemma":0.000035465637,"teacher_disagreement_score":0.6712549,"about_ca_system_score_codex":0.000020595711,"about_ca_system_score_gemma":0.0000066429507,"threshold_uncertainty_score":0.4536256},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022419194,0.000040065137,0.94562453,0.00005728825,0.00032997245,0.0003484834,0.000012572293,0.00093761814,0.030230297],"genre_scores_gemma":[0.9902152,0.000012535071,0.009249232,0.00027649108,0.00015097312,0.00005452425,0.000023812572,0.000014106944,0.0000031359962],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994571,0.000009506243,0.0001802815,0.00005970736,0.00013490341,0.00015848893],"domain_scores_gemma":[0.99939907,0.000021663862,0.000032561362,0.0001438572,0.00036975168,0.000033090764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009927422,0.00010224598,0.00009027061,0.00007434215,0.00007024254,0.000049225775,0.000082546496,0.000048802292,0.00010125587],"category_scores_gemma":[0.000032665783,0.000096783624,0.000038398834,0.000053886033,0.000036129673,0.00025463707,0.000012780535,0.00004871288,0.00010083495],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002963437,0.000044459277,0.0002549951,0.00024679519,0.00024036755,0.0000019026694,0.002451174,0.00032844915,0.048093542,0.0032073886,0.081662655,0.86343867],"study_design_scores_gemma":[0.0010191532,0.00032710633,0.00070032175,0.00067769317,0.00007681587,0.000016484732,0.00037306428,0.16342393,0.7542049,0.06348518,0.014823015,0.00087232154],"about_ca_topic_score_codex":0.0000212757,"about_ca_topic_score_gemma":0.000012956758,"teacher_disagreement_score":0.96779597,"about_ca_system_score_codex":0.000050242525,"about_ca_system_score_gemma":0.000008028726,"threshold_uncertainty_score":0.39467216},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188662,0.000043092947,0.37445882,0.00011027156,0.00040697196,0.0002931783,0.0000023745322,0.0015448853,0.0042741755],"genre_scores_gemma":[0.9001858,0.000010077491,0.09915172,0.00020451655,0.00030037315,0.0000027557264,0.000010048593,0.00007660113,0.000058089052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986309,0.00010267192,0.00029614122,0.00031442754,0.00015611884,0.000499779],"domain_scores_gemma":[0.99937665,0.00008171016,0.000051242536,0.0002904374,0.00011393042,0.00008603079],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000111681715,0.00028488427,0.0003114839,0.00024292132,0.000104944396,0.000065463784,0.00009810107,0.0002089774,0.000056967965],"category_scores_gemma":[0.000019480829,0.00029312077,0.00007875359,0.0003588634,0.00010272244,0.00007829205,0.00002787573,0.00033061628,0.000029716019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000643552,0.000015606274,0.0003857123,0.000009176224,0.000033348213,0.000042690754,0.00011834395,0.9748942,0.022482546,0.000009144397,0.0011080921,0.00083676056],"study_design_scores_gemma":[0.0005581434,0.000029583658,0.00029296725,0.00013413161,0.000012635453,0.000021968108,0.000043917782,0.88905036,0.10878463,0.000062023704,0.00069843815,0.00031118115],"about_ca_topic_score_codex":0.00010326114,"about_ca_topic_score_gemma":0.00008422408,"teacher_disagreement_score":0.2813196,"about_ca_system_score_codex":0.00011780979,"about_ca_system_score_gemma":0.000014663706,"threshold_uncertainty_score":0.9999521},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7953456,0.00003620654,0.19798923,0.00045904616,0.00027040511,0.00021025901,0.000002890564,0.0006467549,0.0050396007],"genre_scores_gemma":[0.9916661,0.00007151562,0.008078571,0.000015416394,0.00013172826,2.012709e-7,0.0000014356987,0.0000068346485,0.000028217371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992807,0.0000130685,0.00008973713,0.00022648371,0.00020643881,0.00018358616],"domain_scores_gemma":[0.99926054,0.000013901553,0.00006324502,0.00025008386,0.00036342826,0.00004880259],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00016876675,0.00009900688,0.00013564841,0.0003815644,0.0004940684,0.000020615447,0.00039833857,0.00014121956,0.000039727343],"category_scores_gemma":[0.000025239156,0.00009524989,0.000020538646,0.0012970625,0.003824332,0.00043407077,0.00011208087,0.00016873168,0.0000063840766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046820292,0.00037475285,0.007697695,0.000044350974,0.00022292353,0.00018201522,0.009210277,0.0058558974,0.27842084,0.14464636,0.010019923,0.54285675],"study_design_scores_gemma":[0.0013836513,0.0018728036,0.015675623,0.0002509306,0.00015196991,0.00010077964,0.010587558,0.7462419,0.19740519,0.013570561,0.011671025,0.0010879728],"about_ca_topic_score_codex":0.000044815497,"about_ca_topic_score_gemma":0.0000728534,"teacher_disagreement_score":0.74038607,"about_ca_system_score_codex":0.000051587078,"about_ca_system_score_gemma":0.000044966117,"threshold_uncertainty_score":0.9988867},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013548632,0.00012801946,0.982227,0.00011605656,0.0005329929,0.0004929492,0.000049651477,0.0026778358,0.00022684444],"genre_scores_gemma":[0.91324,0.000031821022,0.086330116,0.00008904409,0.00013421051,0.0000637404,0.000004505514,0.000069456924,0.00003709148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987839,0.000027254897,0.00025034355,0.00036336188,0.00013979548,0.00043538352],"domain_scores_gemma":[0.9991573,0.00006379301,0.000053210006,0.0004031273,0.0002603196,0.00006221558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006552162,0.00029300633,0.0003480307,0.0005818145,0.00027351832,0.000022926743,0.00021706762,0.0004148532,0.000026859201],"category_scores_gemma":[0.0000027654614,0.00030784306,0.00015727774,0.0004775913,0.00031346982,0.00007797142,0.0000029230164,0.0004008823,0.000038468395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008547019,0.00012941886,5.759708e-7,0.0000131878705,0.00052705803,0.00007634949,0.00014596731,0.025618294,0.1437771,0.00023175002,0.0013234486,0.82807136],"study_design_scores_gemma":[0.00038158015,0.00033566885,0.0000013117897,0.000060846676,0.000052543233,0.00005699073,0.00005853793,0.5000839,0.49594605,0.0016782704,0.0011314512,0.00021282541],"about_ca_topic_score_codex":0.000018102453,"about_ca_topic_score_gemma":0.000027108632,"teacher_disagreement_score":0.8996914,"about_ca_system_score_codex":0.00008146217,"about_ca_system_score_gemma":0.000017721031,"threshold_uncertainty_score":0.99993736},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7742697,0.000088275374,0.21026182,0.0000048363227,0.00012689995,0.0000809363,0.000006285362,0.00024885367,0.014912395],"genre_scores_gemma":[0.91020566,0.0000022593397,0.089723505,0.00001067712,0.000035592635,3.9353898e-7,0.0000050497615,0.000012552232,0.000004311666],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944264,0.000016426455,0.00021656106,0.000084759195,0.00015157096,0.00008807102],"domain_scores_gemma":[0.9995245,0.000028655091,0.00006354184,0.0002103681,0.00015218998,0.000020766876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004060131,0.00008597313,0.0001628699,0.000060360315,0.000016841175,0.0000056519602,0.00007290823,0.000047525635,0.000046525693],"category_scores_gemma":[0.000023271328,0.000082643026,0.000032629574,0.000084281986,0.000064986656,0.00006988352,0.000018284347,0.000039950515,0.0000064124247],"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.000005247052,0.000014447301,0.00039592662,0.00001254362,0.00006874266,0.0000011156208,0.0002864963,0.0029079365,0.97653073,0.00010333925,0.0009264218,0.018747052],"study_design_scores_gemma":[0.00009817605,0.00002497703,0.0011403308,0.00013692083,0.000016122618,9.3758854e-7,0.000016111704,0.16457649,0.83125156,0.0026593308,0.000009769828,0.00006929101],"about_ca_topic_score_codex":0.00045634503,"about_ca_topic_score_gemma":0.000035377332,"teacher_disagreement_score":0.16166855,"about_ca_system_score_codex":0.00001695965,"about_ca_system_score_gemma":0.000007912863,"threshold_uncertainty_score":0.33700848},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074993353,0.000037118112,0.99062383,0.000012468144,0.00008960707,0.00038412286,7.735845e-7,0.0005035866,0.0008491736],"genre_scores_gemma":[0.8740554,0.0000013233577,0.12581663,0.000015239024,0.00004208994,0.000005818191,0.000002599397,0.000027175825,0.000033741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993971,0.000032566746,0.00015998917,0.00011589553,0.00015535508,0.00013908213],"domain_scores_gemma":[0.99927276,0.00007572901,0.000063027874,0.00014058403,0.00042147355,0.000026437081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014894019,0.00011438181,0.00015302039,0.00007731986,0.000054903776,0.000018425542,0.000056714227,0.000051524363,0.000015264934],"category_scores_gemma":[0.00003060413,0.00010022172,0.000032315835,0.00008159579,0.00005492904,0.000046739326,0.0000090189005,0.00007379603,0.0000035618402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002486693,0.000024771769,0.0001954757,0.000046693815,0.00009494122,0.0000021374572,0.0002475282,0.8657047,0.11969493,0.00007015313,0.0049290597,0.008740916],"study_design_scores_gemma":[0.00029189413,0.00040576994,0.000041805135,0.00021111281,0.000024119774,0.000002091318,0.00003462642,0.7203167,0.27810818,0.00008894821,0.0003745607,0.00010016621],"about_ca_topic_score_codex":0.000021000607,"about_ca_topic_score_gemma":0.0000175036,"teacher_disagreement_score":0.86655605,"about_ca_system_score_codex":0.00004989444,"about_ca_system_score_gemma":0.000021269914,"threshold_uncertainty_score":0.4086923},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3524656,0.00003479078,0.6453274,0.00000975615,0.00015308174,0.00010269699,0.0000011084452,0.00016895926,0.0017365935],"genre_scores_gemma":[0.96764475,0.000046462515,0.032081842,0.000020430458,0.000088519715,0.0000065031068,0.000004726716,0.000020533265,0.00008625624],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993079,0.000014728997,0.00027441976,0.00015242057,0.00007936195,0.0001712191],"domain_scores_gemma":[0.99946266,0.00007211734,0.0000696528,0.00016472579,0.0002094498,0.000021374472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006300514,0.0001206861,0.00018845074,0.00014093009,0.000058598544,0.00001549047,0.000067846726,0.00008761711,0.000013518904],"category_scores_gemma":[0.000026956117,0.0001216068,0.000028415696,0.00018387803,0.000058181868,0.00011178511,0.000021250222,0.00005114242,6.1669164e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060738857,0.00002329552,0.0010343601,0.00014395559,0.000048111568,0.0000010196733,0.0005551804,0.032595377,0.850433,0.0016510007,0.00021049821,0.11324349],"study_design_scores_gemma":[0.000106590924,0.000043491356,0.000621288,0.00025187375,0.00000462975,0.000004884656,0.000023176148,0.4720299,0.52569366,0.0010291182,0.0001012769,0.000090102476],"about_ca_topic_score_codex":0.000049458933,"about_ca_topic_score_gemma":0.00040878396,"teacher_disagreement_score":0.6151791,"about_ca_system_score_codex":0.000035327605,"about_ca_system_score_gemma":0.000011159307,"threshold_uncertainty_score":0.49589813},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02414461,0.00046466375,0.9577925,0.0005930182,0.0001786074,0.015145903,0.000038519316,0.0005553882,0.0010867738],"genre_scores_gemma":[0.9833126,0.0000048586735,0.009423212,0.0003192632,0.0009816487,0.0057988297,0.000014698044,0.00010455974,0.000040320036],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978423,0.00008293897,0.000648603,0.00047872588,0.00036505118,0.00058237417],"domain_scores_gemma":[0.99845666,0.00032892128,0.0003396592,0.0003787385,0.0004285042,0.00006751352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008039153,0.0004406497,0.0006581409,0.00025496056,0.00018550336,0.00036853572,0.0011220098,0.00021516414,0.000014760344],"category_scores_gemma":[0.0000694356,0.0003361256,0.00017445943,0.0004949021,0.0002637507,0.0008732669,0.00007348655,0.0003484431,0.0000020914254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009251465,0.00090674014,0.0005125569,0.007486559,0.00032982414,0.0000741772,0.015768018,0.005316015,0.23411642,0.0012573602,0.065310165,0.6596707],"study_design_scores_gemma":[0.006870391,0.0009180938,0.00019399181,0.0030546798,0.00014433532,0.000053165655,0.00020152975,0.6626635,0.27679795,0.036639266,0.01163352,0.0008295201],"about_ca_topic_score_codex":0.0000148331765,"about_ca_topic_score_gemma":0.00004794913,"teacher_disagreement_score":0.959168,"about_ca_system_score_codex":0.00006103931,"about_ca_system_score_gemma":0.00016236752,"threshold_uncertainty_score":0.9999091},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052827768,0.003140459,0.9425921,0.00045881816,0.0001669803,0.00020086451,0.00008213179,0.000496475,0.00003443576],"genre_scores_gemma":[0.99483174,0.000048794005,0.0041993116,0.0003525952,0.00046206737,0.000010346787,0.000042675,0.00005096477,0.0000015272897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848616,0.000082973755,0.0003738388,0.0004240042,0.0003896654,0.00024335444],"domain_scores_gemma":[0.9991643,0.00018085621,0.00019013503,0.00018619224,0.00008769935,0.00019083571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012650575,0.00032716006,0.0006158528,0.00009604537,0.000084179876,0.000110449386,0.00021389716,0.0007409511,0.000024123148],"category_scores_gemma":[0.00009286365,0.00030895253,0.00010022396,0.00017206525,0.00020807596,0.00006688832,0.00014319716,0.00079749204,9.868301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003762933,0.00021735205,0.001302933,0.0019441327,0.0007200158,0.00008779226,0.0011427823,0.01794304,0.30937058,0.000094478935,0.0017659026,0.6650347],"study_design_scores_gemma":[0.00040345715,0.00005069644,0.0002819913,0.0017390889,0.00014552889,0.0000025767586,0.000022440827,0.97648394,0.0065335375,0.013140379,0.0008405512,0.00035580946],"about_ca_topic_score_codex":0.00015052638,"about_ca_topic_score_gemma":0.0000012532944,"teacher_disagreement_score":0.9585409,"about_ca_system_score_codex":0.00004642071,"about_ca_system_score_gemma":0.0001139817,"threshold_uncertainty_score":0.9999363},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9817898,0.000016263371,0.017273795,0.00000700771,0.00016370876,0.00006473241,0.0000046849173,0.00013289615,0.00054706255],"genre_scores_gemma":[0.9962485,0.0000014388208,0.00362715,0.000013051926,0.00009277572,1.2278161e-7,0.0000026898006,0.000013436,8.608042e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932617,0.000056813507,0.00022301097,0.00011779921,0.00012727715,0.00014891439],"domain_scores_gemma":[0.99876803,0.000021437647,0.00013252244,0.00096493977,0.00007828348,0.000034789966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011222532,0.00010165339,0.00027996028,0.00006169174,0.00017381377,0.000054909644,0.0003071079,0.0000583009,0.000010325142],"category_scores_gemma":[0.00001030433,0.00008015379,0.0001216183,0.00015709449,0.0001048595,0.000155169,0.000059654736,0.00009140022,7.601673e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007037268,0.000021393862,0.004370187,0.000004667367,0.00015231305,0.0000013477093,0.00017753433,0.82476175,0.1691355,0.00025145366,0.000026882784,0.0010899376],"study_design_scores_gemma":[0.000026449243,0.0000104286155,0.013463254,0.000016732456,0.00022357519,7.93078e-7,0.000036975944,0.8092121,0.17635968,0.0005708787,0.0000047392787,0.00007441985],"about_ca_topic_score_codex":0.0008119411,"about_ca_topic_score_gemma":0.00066798646,"teacher_disagreement_score":0.015549682,"about_ca_system_score_codex":0.000009756625,"about_ca_system_score_gemma":0.0000062943927,"threshold_uncertainty_score":0.3268577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012007125,0.000067314715,0.9862903,0.000057590034,0.00048159738,0.0002301891,0.000043880773,0.000135754,0.00068626745],"genre_scores_gemma":[0.76668906,0.00013597166,0.2327989,0.000033241864,0.00020939685,0.0000057686384,0.00007331293,0.00003796998,0.000016383081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913937,0.000029610916,0.00038289756,0.00011322215,0.00018525889,0.00014966936],"domain_scores_gemma":[0.99889535,0.00006932451,0.00030659413,0.00017295407,0.00049645785,0.000059333466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011871686,0.00014345387,0.00023462539,0.00026576524,0.00017066284,0.000028731343,0.000114323164,0.00009433278,0.000061257975],"category_scores_gemma":[0.00002559838,0.00014577339,0.00010421201,0.00018916384,0.000045803645,0.00018475753,0.000015193768,0.00012957069,0.0000018988183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006199536,0.000072849354,0.00013382091,0.000024056431,0.000060880677,5.7718074e-7,0.0000627114,0.9950028,0.003642957,0.000109145934,0.0006141916,0.00021403271],"study_design_scores_gemma":[0.00050726987,0.00024919753,0.00028892193,0.0003946881,0.000069319976,0.0000152422035,0.00005791279,0.9776284,0.020253843,0.00008550464,0.00031428778,0.00013539108],"about_ca_topic_score_codex":0.0000027990277,"about_ca_topic_score_gemma":0.0000011944362,"teacher_disagreement_score":0.75468194,"about_ca_system_score_codex":0.000057377638,"about_ca_system_score_gemma":0.000015725527,"threshold_uncertainty_score":0.5944466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9571934,0.0004875665,0.014259953,0.000042030777,0.00058794155,0.001430873,0.0000032651515,0.0022988662,0.023696141],"genre_scores_gemma":[0.9753505,0.00005766835,0.02409202,0.000032429147,0.00006791131,0.00009510136,0.000027596234,0.00007450817,0.0002022552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835086,0.00007371107,0.00042363285,0.0005327798,0.00020141079,0.00041762396],"domain_scores_gemma":[0.99874103,0.000070198126,0.00006385716,0.0010091284,0.000057619072,0.000058150374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026887035,0.00040040276,0.00052318175,0.00018365812,0.000016503345,0.00014664263,0.00034420553,0.0004607429,0.000038048584],"category_scores_gemma":[0.000046200672,0.00038160774,0.00014570853,0.00013290395,0.000059776,0.00010016978,0.000446816,0.0009296639,0.000041472253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002974265,0.0016643009,0.28472438,0.0051499177,0.00094780483,0.0004921151,0.004302996,0.22740087,0.009647078,0.0026606808,0.017423222,0.4452892],"study_design_scores_gemma":[0.0012807619,0.00025836972,0.03130574,0.005782276,0.00016389205,0.0000582882,0.00031707305,0.7411565,0.14873044,0.05067208,0.015449615,0.0048249573],"about_ca_topic_score_codex":0.00031741633,"about_ca_topic_score_gemma":0.0001311904,"teacher_disagreement_score":0.5137556,"about_ca_system_score_codex":0.00017560966,"about_ca_system_score_gemma":0.000052731535,"threshold_uncertainty_score":0.99986356},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055407775,0.0003212093,0.99247444,0.00006826665,0.00024612035,0.00017514953,0.00016854158,0.00024560327,0.0007598759],"genre_scores_gemma":[0.90267,0.000020271915,0.09648152,0.00005318926,0.00014053733,0.0000060220523,0.0005776621,0.000043644268,0.0000071097866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.0000048697248,0.00030956947,0.00034297263,0.00038673845,0.00018070292],"domain_scores_gemma":[0.999381,0.00023405976,0.00007355343,0.0001460541,0.00008739313,0.00007792622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013231442,0.0002632905,0.0002833938,0.0002961467,0.000064006264,0.00006335271,0.0002136824,0.00014615996,0.000014966321],"category_scores_gemma":[0.000048509206,0.00027607725,0.00003977269,0.00018892769,0.00008778922,0.00015181463,0.00010134826,0.00038335394,0.0000037046984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053606664,0.0000049162613,0.000007674363,0.000041609565,0.00003166106,0.000009699083,0.0001320681,0.96864486,0.013619545,0.0038312697,0.000014996502,0.013656367],"study_design_scores_gemma":[0.00012270632,0.000015987462,0.00047208488,0.00028993792,0.000023733191,0.000009054744,0.0000010550369,0.948044,0.0017157904,0.048463795,0.00055548706,0.00028634613],"about_ca_topic_score_codex":0.000042009415,"about_ca_topic_score_gemma":0.000021071945,"teacher_disagreement_score":0.8971293,"about_ca_system_score_codex":0.000083744235,"about_ca_system_score_gemma":0.000051405415,"threshold_uncertainty_score":0.9999691},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114341184,0.00030955364,0.8840902,0.000005363486,0.00048811428,0.0004190053,0.00004644152,0.00028005554,0.000020112551],"genre_scores_gemma":[0.91540825,5.959845e-7,0.08419764,0.000010494154,0.00023136704,0.000066853194,0.000058531536,0.000023565084,0.0000027192602],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992817,0.000027040634,0.0002712967,0.00016544516,0.000047085956,0.00020741846],"domain_scores_gemma":[0.9993035,0.000257509,0.00007419138,0.00020991916,0.00012628808,0.00002856698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001425282,0.00013285219,0.00023518843,0.00010119528,0.000051523148,0.000012708777,0.00011470202,0.00019989384,0.000007003194],"category_scores_gemma":[0.00006238556,0.0001240969,0.000055101875,0.00008426964,0.000081477054,0.00002993781,0.000015205019,0.00006249086,0.000007722761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015385695,0.000076774435,0.00068324787,0.00042307997,0.00010486163,3.7185796e-7,0.00035885125,0.3758577,0.6044639,0.014347484,0.0014492634,0.002080599],"study_design_scores_gemma":[0.00022199521,0.00022746179,0.00023374129,0.00024892215,0.000018630642,0.0000046645305,0.000032669825,0.9625583,0.03293357,0.0032719835,0.00011291063,0.0001351189],"about_ca_topic_score_codex":0.00010793808,"about_ca_topic_score_gemma":0.00007453825,"teacher_disagreement_score":0.80106705,"about_ca_system_score_codex":0.000035742938,"about_ca_system_score_gemma":0.000020620198,"threshold_uncertainty_score":0.5060525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5890931,0.000041505016,0.28459308,0.000048268987,0.0008236009,0.00020145898,0.0000013650329,0.004297441,0.12090019],"genre_scores_gemma":[0.972891,0.000018438936,0.02638153,0.000081418184,0.0003958076,0.0000014235164,0.0000052299174,0.000037075864,0.00018808007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932796,0.000025445966,0.00015724504,0.0001965632,0.00008342879,0.00020934556],"domain_scores_gemma":[0.99942964,0.00001007637,0.00003326974,0.0003603929,0.0000940472,0.000072566494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041059822,0.00014988259,0.00014205014,0.000090091606,0.000100141966,0.00005689472,0.00009396394,0.00009291216,0.00004394717],"category_scores_gemma":[0.0000060336793,0.0001436805,0.000035719793,0.00010217726,0.00011760594,0.0002198511,0.000023042712,0.00011037687,0.00003162753],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008978984,0.000059326925,0.00068803167,0.000038907885,0.00013776789,0.000084910316,0.0012473274,0.001187512,0.22092055,0.0058149975,0.047049493,0.7226814],"study_design_scores_gemma":[0.00020119085,0.00011592594,0.0002905799,0.000084776555,0.000017705806,0.00055385253,0.00022678149,0.5909549,0.39760056,0.0042127455,0.0053895526,0.00035145838],"about_ca_topic_score_codex":0.00003312082,"about_ca_topic_score_gemma":0.00002036712,"teacher_disagreement_score":0.7223299,"about_ca_system_score_codex":0.000030974537,"about_ca_system_score_gemma":0.0000054225966,"threshold_uncertainty_score":0.5859121},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92686766,0.0024308218,0.06695443,0.00036269223,0.00021134103,0.00075043127,0.00008832643,0.0012617707,0.0010725238],"genre_scores_gemma":[0.9951424,0.000008151011,0.0041074376,0.0002878523,0.00016926674,0.000021390751,0.00012091927,0.000043334894,0.00009927695],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873036,0.000100899895,0.00032982358,0.00034231678,0.00012735745,0.00036922167],"domain_scores_gemma":[0.9990156,0.00026630738,0.000040300423,0.00057994487,0.000047331625,0.00005049886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062534976,0.00017817595,0.0002544384,0.00012455389,0.00017357322,0.00006139132,0.00038442988,0.000079342,0.00006004099],"category_scores_gemma":[0.0002631971,0.00020131476,0.0000362454,0.0001284339,0.000070877984,0.00016891448,0.00010725426,0.00022952749,0.000014488097],"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.00015357372,0.0000696624,0.022950197,0.0003394887,0.00007720212,0.00007701907,0.0059924554,0.0020599954,0.76117283,0.003179693,0.018743288,0.18518458],"study_design_scores_gemma":[0.0027639498,0.00019305038,0.11714865,0.0005185579,0.000013463413,0.0000115893135,0.00022498771,0.72700024,0.0034889842,0.0037919597,0.14407432,0.00077025685],"about_ca_topic_score_codex":0.000095295516,"about_ca_topic_score_gemma":0.00033590238,"teacher_disagreement_score":0.7576839,"about_ca_system_score_codex":0.000038168255,"about_ca_system_score_gemma":0.000010154799,"threshold_uncertainty_score":0.82093775},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8642584,0.000046430847,0.09865598,0.000014376346,0.00023124182,0.00006014898,0.000014873321,0.00041647887,0.036302045],"genre_scores_gemma":[0.9472903,0.000008335521,0.052275952,0.00004386092,0.00016884589,0.0000012507471,0.0000027091287,0.000013608741,0.00019510768],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995319,0.000010405908,0.00016744471,0.00011137588,0.000069541355,0.00010932509],"domain_scores_gemma":[0.9996798,0.000025319088,0.000033450953,0.00014885412,0.000091092006,0.000021476944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033110053,0.00009420839,0.00013440504,0.00005268681,0.00003454588,0.000036542748,0.00006986656,0.00005507781,0.00042702458],"category_scores_gemma":[0.000008562221,0.000087439104,0.00003684739,0.00007729083,0.000119162425,0.00012931824,0.000013601432,0.00006000958,0.00002744805],"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.000014067418,0.000010119659,0.00045798885,0.0000029669486,0.00005203681,0.000002551041,0.0005239356,0.00011754307,0.9731372,0.00033709194,0.008090057,0.017254435],"study_design_scores_gemma":[0.000094440955,0.00004527398,0.002018397,0.000070785216,0.000007762509,0.0000068143954,0.000037016383,0.010873337,0.98113316,0.0049107615,0.0006912134,0.000111033616],"about_ca_topic_score_codex":0.00016228054,"about_ca_topic_score_gemma":0.00006797375,"teacher_disagreement_score":0.0830319,"about_ca_system_score_codex":0.000017098906,"about_ca_system_score_gemma":0.000008831672,"threshold_uncertainty_score":0.46756196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3721703,0.000007796429,0.62693375,0.00007478472,0.000024747429,0.00047899535,0.0000025519266,0.00010070335,0.00020639012],"genre_scores_gemma":[0.9607218,0.0000021164005,0.03912311,0.000015030497,0.000022427372,0.0000838658,0.000007599967,0.000007849257,0.000016188114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906474,0.000014786343,0.0003296402,0.00023420049,0.00015641983,0.00020020618],"domain_scores_gemma":[0.9991833,0.00048064432,0.00003448097,0.00018628771,0.000054505555,0.000060754843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002658837,0.00011821889,0.0002737739,0.00023700717,0.00006976071,0.000105634506,0.00010498094,0.000071862414,0.000023975068],"category_scores_gemma":[0.00013938863,0.00009755544,0.00005839647,0.00059115933,0.000036659803,0.00019680115,0.000025131683,0.000070110116,0.000008743252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025027628,0.000056983554,0.0005916156,0.00010237272,0.000037617603,1.867143e-7,0.0016853234,0.93298364,0.007975123,0.054352418,0.000020463764,0.0021692093],"study_design_scores_gemma":[0.00016425652,0.000023580536,0.0005706933,0.0000199203,0.00003226674,0.000001790066,0.00046301566,0.76839477,0.00049521646,0.22971185,0.000019964584,0.00010270581],"about_ca_topic_score_codex":0.00003415444,"about_ca_topic_score_gemma":0.00007898618,"teacher_disagreement_score":0.5885515,"about_ca_system_score_codex":0.000032469357,"about_ca_system_score_gemma":0.000012624061,"threshold_uncertainty_score":0.39781955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9816681,0.000052739324,0.016955793,0.000048397804,0.000055659384,0.0002138232,0.000006209009,0.0002174451,0.0007818325],"genre_scores_gemma":[0.98811287,0.0000069071834,0.01174774,0.000008068487,0.00006140209,0.0000095727055,0.000002091745,0.000013549528,0.000037819947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926615,0.00000169544,0.00014005789,0.00022422442,0.00019398167,0.00017387794],"domain_scores_gemma":[0.9996026,0.00017318873,0.00004053154,0.000106344305,0.00004155578,0.00003578304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001403783,0.000119333636,0.00020988188,0.000011123062,0.00007272909,0.00006706203,0.00037263497,0.000044116852,0.0000025933437],"category_scores_gemma":[0.00006198382,0.000082875995,0.00008609028,0.00016355288,0.00009388919,0.0002490697,0.0001640883,0.00012842791,0.0000017603052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007260125,0.000054580203,0.0001683542,0.0004142229,0.00008777412,3.7075434e-8,0.0014877022,0.8888484,0.09297072,0.014256929,0.001348755,0.0003552401],"study_design_scores_gemma":[0.00008932937,0.00002300566,0.00009246848,0.00018401335,0.000023810468,2.8978414e-7,0.00011542349,0.95147955,0.01939048,0.02847387,0.000021365768,0.00010637647],"about_ca_topic_score_codex":0.000005921121,"about_ca_topic_score_gemma":2.8742923e-8,"teacher_disagreement_score":0.073580235,"about_ca_system_score_codex":0.000009016003,"about_ca_system_score_gemma":0.0000045484735,"threshold_uncertainty_score":0.3379585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42745095,0.0004701782,0.54086626,0.000052949585,0.001939498,0.0015039998,0.00011679392,0.0018859,0.025713475],"genre_scores_gemma":[0.99527013,0.0003738335,0.0014701193,0.000044003817,0.00012819117,0.000003854895,0.00009088247,0.00005674579,0.0025622116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988994,0.000029848792,0.0001714799,0.0005579938,0.000056412122,0.00028485927],"domain_scores_gemma":[0.99886245,0.0000686928,0.000105437975,0.00075473444,0.00013393817,0.00007476359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000079830155,0.0003538765,0.00036029416,0.00018502776,0.00007468764,0.000048021036,0.0003982757,0.00032296134,0.00004134942],"category_scores_gemma":[0.000011243924,0.00037228494,0.00021556049,0.00012798674,0.00003794972,0.000092749506,0.00036756718,0.0004044373,0.000042734613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011489867,0.000056510664,0.00036584827,0.0002985143,0.0002793913,0.00008826818,0.00023481085,0.94937456,0.0019054427,0.011475447,0.034415968,0.0013903187],"study_design_scores_gemma":[0.00070250226,0.00011271681,0.00017474535,0.0009744986,0.00016845131,0.000002481733,0.000094349394,0.93341744,0.01969801,0.020759543,0.023008676,0.0008865553],"about_ca_topic_score_codex":0.000025343421,"about_ca_topic_score_gemma":0.000012621707,"teacher_disagreement_score":0.5678192,"about_ca_system_score_codex":0.00021585489,"about_ca_system_score_gemma":0.000036952402,"threshold_uncertainty_score":0.9998729},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016905764,0.00066771056,0.977912,0.00017349278,0.0024238406,0.00037127867,0.000016930666,0.00038811273,0.0011408619],"genre_scores_gemma":[0.692149,0.0023894839,0.3033514,0.00012016473,0.0012369595,0.0000662666,0.00041049952,0.00014906068,0.00012720579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989542,0.00004687488,0.0003401634,0.00022301533,0.00019975143,0.00023600346],"domain_scores_gemma":[0.9991845,0.000044623197,0.00018397089,0.0002284832,0.00026266923,0.00009575567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001535194,0.00025269436,0.00027154633,0.00020065735,0.0001505658,0.00037260453,0.00011689629,0.00022317348,0.00006988662],"category_scores_gemma":[0.000053766602,0.0002705171,0.0001892719,0.00007567165,0.000014177993,0.00011573602,0.00006134237,0.0006377304,0.000001782361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012854961,0.000030695817,0.0000061099763,0.000047555823,0.0000935091,0.000016635233,0.00014629377,0.99323034,0.00015906761,0.00014204248,0.0048170704,0.0012977938],"study_design_scores_gemma":[0.00032843775,0.00010283312,0.000067872286,0.0014114802,0.000081181344,0.00013871401,0.000072576964,0.9808723,0.014546281,0.00088231824,0.0011024093,0.000393625],"about_ca_topic_score_codex":0.0000013437624,"about_ca_topic_score_gemma":0.0000014556526,"teacher_disagreement_score":0.6752432,"about_ca_system_score_codex":0.000275879,"about_ca_system_score_gemma":0.00006255465,"threshold_uncertainty_score":0.9999747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7738429,0.00029200598,0.22309431,0.000010481731,0.00005813107,0.00022135295,9.3238765e-7,0.0010693765,0.0014105526],"genre_scores_gemma":[0.9944964,0.0000028961242,0.0052901953,0.00003245047,0.00006143487,0.00001007017,0.0000033298668,0.000044632336,0.00005856916],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992454,0.000012976473,0.00013335496,0.00018786985,0.00016715047,0.00025322541],"domain_scores_gemma":[0.9996998,0.00002636535,0.000039766077,0.0000840479,0.0000990672,0.000051007228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048657228,0.00016799357,0.00015184702,0.00006290889,0.00008129762,0.00010701172,0.00008486261,0.00005614092,0.000057505993],"category_scores_gemma":[0.0000036228519,0.00014253434,0.000022733946,0.00020658367,0.000021151975,0.00018151867,0.000014030047,0.00017522965,0.00003148373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022766132,0.00012442411,0.0017795808,0.0003752486,0.00014591457,0.000024267852,0.00069086574,0.39390248,0.4273338,0.00016482385,0.0009463469,0.17428458],"study_design_scores_gemma":[0.00047983832,0.00020612853,0.00169992,0.00075242383,0.00004179615,0.000055312852,0.00010000405,0.8905869,0.10495276,0.00036713865,0.00028670006,0.00047109113],"about_ca_topic_score_codex":0.000010340353,"about_ca_topic_score_gemma":0.0000039450874,"teacher_disagreement_score":0.4966844,"about_ca_system_score_codex":0.000076600656,"about_ca_system_score_gemma":0.000033577573,"threshold_uncertainty_score":0.58123815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009903171,0.00019718322,0.98927575,0.00013401252,0.00008584707,0.00009254673,0.000010624849,0.00013058227,0.00017025915],"genre_scores_gemma":[0.56526923,0.000048248057,0.43437952,0.000058115325,0.00020293934,0.0000028397812,0.000009253744,0.000021714413,0.000008127058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859035,0.00009495913,0.0006646617,0.00016428679,0.00024165849,0.00024409562],"domain_scores_gemma":[0.9986286,0.0001663017,0.00029801088,0.00023172848,0.0005166317,0.00015871895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004693715,0.00018542507,0.0005594437,0.00046039742,0.00008364411,0.0000901617,0.00024825567,0.00009087197,0.00018293054],"category_scores_gemma":[0.00009350288,0.0001525352,0.00044818496,0.0009477384,0.000053121123,0.0002583788,0.000013807924,0.00017388312,0.0000029931718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005803558,0.0000833813,0.00033515308,0.000016632775,0.0012611465,0.00000954453,0.00013633953,0.9752719,0.014399206,0.000041852454,0.00074059505,0.007646208],"study_design_scores_gemma":[0.00030843855,0.0002996586,0.00011235486,0.000038499154,0.0010789857,0.00004879239,0.000048644244,0.98523915,0.011562294,0.0006544889,0.0004164999,0.0001921854],"about_ca_topic_score_codex":0.000029730681,"about_ca_topic_score_gemma":0.000003194368,"teacher_disagreement_score":0.5553661,"about_ca_system_score_codex":0.000054705986,"about_ca_system_score_gemma":0.000025651494,"threshold_uncertainty_score":0.6220205},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74122787,0.000047751757,0.24789849,0.000027108721,0.00018422784,0.00021064197,0.0000024703966,0.00031076415,0.010090692],"genre_scores_gemma":[0.9550888,0.0000087446915,0.04471242,0.0001160674,0.00003347236,0.000002655266,0.000004448622,0.0000136428125,0.000019781373],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994842,0.000009781967,0.00019568963,0.00009762807,0.00008582624,0.00012688916],"domain_scores_gemma":[0.99969214,0.000039977876,0.00003351694,0.00015827912,0.000055974186,0.00002013069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045499342,0.00008830844,0.00012483026,0.00010045097,0.00001560032,0.000009843184,0.000055118675,0.00003813209,0.000034456785],"category_scores_gemma":[0.0000059643826,0.000086643,0.000029315506,0.00010004449,0.000038426355,0.000051527135,0.000014863222,0.000048990798,0.00000626783],"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.000043734155,0.00004048892,0.0008603817,0.00003094933,0.00004296165,0.0000088752795,0.00017266981,0.052294888,0.8953212,0.00009986524,0.0036304672,0.047453504],"study_design_scores_gemma":[0.00027997635,0.00008974918,0.00064978004,0.00007263199,0.0000044513554,5.728267e-7,0.00005696194,0.17191845,0.82619953,0.00052433053,0.00010108574,0.00010244816],"about_ca_topic_score_codex":0.00011749704,"about_ca_topic_score_gemma":0.00014978084,"teacher_disagreement_score":0.21386091,"about_ca_system_score_codex":0.00003842101,"about_ca_system_score_gemma":0.000011197283,"threshold_uncertainty_score":0.35331988},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9224347,0.00049689895,0.018569792,0.00012561838,0.0006711697,0.0011612991,0.000036871923,0.00043929706,0.056064375],"genre_scores_gemma":[0.99808127,0.00011300441,0.001201041,0.000078105346,0.000093779774,0.00004862587,0.00007859878,0.000008500913,0.00029706807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892086,0.000026480795,0.00030758212,0.00006276167,0.00047669126,0.00020562347],"domain_scores_gemma":[0.99931365,0.00007281223,0.000021438704,0.00014831859,0.00038115142,0.00006260181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050294533,0.00008475074,0.000115345014,0.0002400388,0.00013575084,0.0005073224,0.000094992865,0.00007307122,0.00006102082],"category_scores_gemma":[0.0000331386,0.00007413018,0.000020734988,0.00015508509,0.00002454114,0.0011034827,0.000042609878,0.00017184083,0.00037771135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008067081,0.00001432885,0.0033218248,0.0004166534,0.00012303468,0.0000020419352,0.0021395597,0.28900766,0.015346105,0.6297959,0.0414369,0.018315295],"study_design_scores_gemma":[0.00047379365,0.00004748053,0.0011310736,0.00009484203,0.0000016277603,0.000024649173,0.00045086062,0.4469521,0.0021047934,0.00041074745,0.54812413,0.00018392301],"about_ca_topic_score_codex":0.000088908986,"about_ca_topic_score_gemma":0.0000012482922,"teacher_disagreement_score":0.6293852,"about_ca_system_score_codex":0.000056572706,"about_ca_system_score_gemma":0.000039633953,"threshold_uncertainty_score":0.48921213},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054513074,0.00025058855,0.94454557,0.00007866319,0.00009400762,0.000114318806,0.000090587455,0.00020759826,0.00010557231],"genre_scores_gemma":[0.99864227,0.000538962,0.000533856,0.000085950465,0.000011507393,0.000007838935,0.000020262434,0.000015675034,0.00014370837],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992269,0.000039922164,0.00017383407,0.0002843533,0.00011876362,0.00015622324],"domain_scores_gemma":[0.9995542,0.00011307804,0.000037133006,0.00018443388,0.000040002076,0.00007115575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080550526,0.00019910466,0.00029668747,0.00021306032,0.00008810989,0.0000572087,0.00006667733,0.00009630878,0.00014185987],"category_scores_gemma":[0.0000032854978,0.00016968229,0.00010684384,0.00033847094,0.0000499773,0.00006017879,0.0000015624629,0.00026112958,0.0000054024417],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006540547,0.00010074035,0.008882584,0.00009746202,0.0016432252,0.0000075425164,0.00025599403,0.077586,0.05761892,0.000041782296,0.0005284576,0.8531719],"study_design_scores_gemma":[0.00014686608,0.00015197258,0.0012234619,0.00008605032,0.0007190915,0.000024406454,0.00006988978,0.46323478,0.5331586,0.00022459682,0.00054832344,0.00041194624],"about_ca_topic_score_codex":0.0009904186,"about_ca_topic_score_gemma":0.0003475555,"teacher_disagreement_score":0.94412917,"about_ca_system_score_codex":0.000022442182,"about_ca_system_score_gemma":0.0000042593824,"threshold_uncertainty_score":0.69194424},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043375086,0.0010760649,0.92755,0.000013200944,0.001044574,0.0002952502,0.000002485122,0.000668272,0.025975076],"genre_scores_gemma":[0.99129087,0.00032837747,0.008212922,0.000018678096,0.00004599683,0.000004944971,0.000011412746,0.00002670047,0.000060094568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935365,0.000013626992,0.0002475994,0.00014752685,0.00008345235,0.00015417453],"domain_scores_gemma":[0.9993579,0.000081364364,0.000043670083,0.00045513496,0.000041382238,0.000020567366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054564884,0.0001658094,0.00030071754,0.000108531494,0.0000032630485,0.000015708503,0.00023200762,0.00030296453,0.000033757547],"category_scores_gemma":[0.000012717576,0.00016871371,0.00005455959,0.000054908487,0.00001697783,0.000019759254,0.00028431255,0.00046946865,0.000009735814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001338393,0.0000075337553,0.001955737,0.00007394092,0.00001843654,0.000002551671,0.000037479884,0.9947016,0.00008071091,0.0005629157,0.0005533476,0.0020043792],"study_design_scores_gemma":[0.000051359344,0.000008553031,0.0014423542,0.0004027203,0.000007968399,2.9629834e-7,0.000007691138,0.99145216,0.003557536,0.0026708287,0.00020571906,0.00019284045],"about_ca_topic_score_codex":0.0000709018,"about_ca_topic_score_gemma":0.000058971822,"teacher_disagreement_score":0.9479158,"about_ca_system_score_codex":0.0000339142,"about_ca_system_score_gemma":0.0000152104985,"threshold_uncertainty_score":0.6879946},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96125174,0.00019769272,0.035441387,0.000054344982,0.00003176696,0.00018451993,0.000007753619,0.0005319492,0.002298826],"genre_scores_gemma":[0.8824021,0.000035617526,0.11742861,0.000061172184,0.000021204347,0.0000028441696,0.000013128771,0.00001476581,0.000020529189],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99941903,0.000050458737,0.00011153561,0.0001569878,0.0001261131,0.00013585722],"domain_scores_gemma":[0.9996269,0.00008263555,0.000026845133,0.00017706896,0.00004019327,0.00004639715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015005242,0.00011761739,0.00022214481,0.00004739903,0.000032927524,0.000035878114,0.00005988372,0.00006888839,0.000044899996],"category_scores_gemma":[0.000013153365,0.00011757456,0.000031165826,0.000050408973,0.000030023004,0.0000819211,0.00003099389,0.00013507919,0.000017155347],"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.000023111861,0.00018586624,0.016529152,0.00010475941,0.00030946283,0.000010794613,0.00017744376,0.00018941004,0.9775426,0.0022365795,0.00006730424,0.0026235392],"study_design_scores_gemma":[0.00019922672,0.000047204412,0.006701302,0.00028385845,0.00009150669,0.000010224295,0.000026879083,0.07351903,0.9139816,0.0048856684,0.000048827183,0.00020463247],"about_ca_topic_score_codex":0.000031933418,"about_ca_topic_score_gemma":0.000003928927,"teacher_disagreement_score":0.08198722,"about_ca_system_score_codex":0.000023507962,"about_ca_system_score_gemma":0.0000063974217,"threshold_uncertainty_score":0.47945514},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36842874,0.000055704884,0.6203052,0.00013892965,0.00021859827,0.00017818047,0.0000015990415,0.0007036111,0.00996948],"genre_scores_gemma":[0.9692888,0.0000025914785,0.030116908,0.00039927883,0.0001163173,0.0000032051228,0.000010957355,0.000031883766,0.000030004743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992309,0.000032643864,0.00020696069,0.00018164841,0.00011283851,0.0002349937],"domain_scores_gemma":[0.99957484,0.000070617214,0.000027166112,0.00021607544,0.000070651484,0.00004063008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007846552,0.00016711335,0.00017085,0.00014776169,0.00007738169,0.0000798098,0.00006289745,0.00008363927,0.000033725184],"category_scores_gemma":[0.000020243982,0.00016326834,0.000030132975,0.00017259533,0.00005922992,0.00012769742,0.00001856127,0.00012540157,0.00002278341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027257765,0.00010363179,0.0003394749,0.00008684854,0.00011444298,0.00019447276,0.0015396831,0.64739215,0.30905566,0.00043358858,0.018288055,0.022424696],"study_design_scores_gemma":[0.00019639893,0.00003189818,0.00035895495,0.00010695115,0.0000046322893,0.000007977824,0.000030252117,0.7006499,0.29780555,0.00058674393,0.00007078881,0.00014994954],"about_ca_topic_score_codex":0.00011515219,"about_ca_topic_score_gemma":0.00013263102,"teacher_disagreement_score":0.6008601,"about_ca_system_score_codex":0.00006276273,"about_ca_system_score_gemma":0.000012163023,"threshold_uncertainty_score":0.665789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948267,0.000016925818,0.040490095,0.00006613523,0.0025118312,0.000050702278,0.0000040458103,0.00014781773,0.008445438],"genre_scores_gemma":[0.9897261,0.000015068851,0.009145183,0.000115093244,0.0007211408,5.9314493e-7,0.0000070399437,0.000020590966,0.0002491497],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992571,0.000014913687,0.00017347075,0.00010042996,0.00028904888,0.0001650743],"domain_scores_gemma":[0.9996189,0.00002923262,0.000051193394,0.000104949744,0.00012739684,0.00006835378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006033572,0.00010980427,0.00012608322,0.00009071603,0.000045497854,0.00009452804,0.0002321053,0.000054375712,0.00031479853],"category_scores_gemma":[0.000011273375,0.00009949758,0.00008049667,0.000079314865,0.000014708492,0.00026777753,0.000058866754,0.00028420103,0.00018650496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006604206,0.00012419382,0.002244233,0.000014120064,0.00034388326,0.00007502137,0.0001203424,0.18792301,0.77935296,0.006597969,0.010743781,0.0123944655],"study_design_scores_gemma":[0.0004932173,0.00006175293,0.002433472,0.00015878606,0.000020812986,0.00015312523,0.000022227749,0.9307526,0.03901464,0.012456603,0.014151441,0.00028136215],"about_ca_topic_score_codex":0.000031546933,"about_ca_topic_score_gemma":9.308023e-7,"teacher_disagreement_score":0.74282956,"about_ca_system_score_codex":0.00010140013,"about_ca_system_score_gemma":0.000022419812,"threshold_uncertainty_score":0.40573934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91836053,0.00008898238,0.004987655,0.0003066155,0.000051685427,0.00014390811,0.00002329499,0.00015718181,0.075880155],"genre_scores_gemma":[0.9983216,0.0000031943678,0.0009806223,0.00008908892,0.000013913989,0.0000037944758,0.000014653147,0.000014619951,0.0005585441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944955,0.000012374204,0.00017202394,0.00009478376,0.000106228144,0.00016505385],"domain_scores_gemma":[0.9995268,0.00006909499,0.000019916495,0.00021478144,0.00004250607,0.00012687584],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006815936,0.00008670033,0.00022400817,0.00027337568,0.000015147211,0.000014655764,0.00009678583,0.00006324584,0.010313824],"category_scores_gemma":[0.000036125868,0.00008324397,0.000095447715,0.000249742,0.000023843291,0.000012989097,0.0000074174236,0.00007157539,0.0011739609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037777976,0.00018143264,0.012695776,0.0009110878,0.0044144536,0.000108726235,0.0025783076,0.089488745,0.023992063,0.71755064,0.13358435,0.01445664],"study_design_scores_gemma":[0.00051957596,0.0001490308,0.020274058,0.00052759796,0.0014182634,0.000025073725,0.00046856527,0.8005835,0.014317634,0.03899231,0.121365346,0.0013590344],"about_ca_topic_score_codex":0.00017459353,"about_ca_topic_score_gemma":0.00037995493,"teacher_disagreement_score":0.71109474,"about_ca_system_score_codex":0.000045839064,"about_ca_system_score_gemma":0.000021838867,"threshold_uncertainty_score":0.99960375},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12677206,0.0003449479,0.870879,0.000021127536,0.00037003396,0.00041221615,0.0000060911148,0.0003854617,0.000809057],"genre_scores_gemma":[0.98902416,0.000048217018,0.010164507,0.000047542104,0.000109936555,0.00014780265,0.000008545665,0.000023859357,0.00042540807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.000008123924,0.00011660313,0.00013421968,0.00006893691,0.00015454124],"domain_scores_gemma":[0.9996279,0.000050200542,0.000018678327,0.00020525954,0.00007226123,0.000025716117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000032631513,0.000098776785,0.000116199546,0.00003884917,0.000032218344,0.000029487204,0.00007123392,0.000045113462,0.000028766017],"category_scores_gemma":[0.0000068861495,0.000094229516,0.000045162848,0.00009581312,0.000015118744,0.00008120815,0.000009664755,0.000073119954,0.000067712135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009390507,0.00027021026,0.026098298,0.00045906805,0.00029125245,0.000009130218,0.0020179097,0.6777096,0.2482657,0.004195867,0.025590042,0.014153879],"study_design_scores_gemma":[0.0020642367,0.000117541174,0.0077549866,0.0003017457,0.000057801346,0.0000039836764,0.00008510114,0.81225467,0.091565624,0.0029363115,0.08216142,0.00069656223],"about_ca_topic_score_codex":0.000011821342,"about_ca_topic_score_gemma":0.000010947962,"teacher_disagreement_score":0.8622521,"about_ca_system_score_codex":0.00003208958,"about_ca_system_score_gemma":0.000009453384,"threshold_uncertainty_score":0.3842568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72755677,0.00001902823,0.2688781,0.000007889482,0.00032784478,0.0002078804,0.000021566677,0.0004609717,0.0025199652],"genre_scores_gemma":[0.99754137,0.00005109652,0.0020333768,0.000041015723,0.00010643672,4.4073576e-7,0.00001810308,0.000037256006,0.0001708845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.00007189998,0.0001575865,0.00041897417,0.000058186073,0.00020386795],"domain_scores_gemma":[0.99881566,0.00015716339,0.000085155945,0.000671516,0.00017743827,0.00009304351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010962586,0.00024220136,0.00031578002,0.0002240967,0.000033162338,0.00001970036,0.00022613644,0.00026625587,0.000026211055],"category_scores_gemma":[0.00006608543,0.00030506073,0.0001271031,0.00027060346,0.00006980584,0.00007255113,0.00035687516,0.00024049048,0.00003725574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033773482,0.000041441475,0.0020174733,0.00009972454,0.00015270003,0.00005859825,0.00017869764,0.9878834,0.002922532,0.0007904634,0.0049896957,0.000831484],"study_design_scores_gemma":[0.00019858676,0.00006198679,0.0032459968,0.00036888578,0.00015518167,0.0000026244995,0.000031294574,0.91459566,0.07443264,0.004477483,0.0017935362,0.00063612394],"about_ca_topic_score_codex":0.00020518429,"about_ca_topic_score_gemma":0.00005843215,"teacher_disagreement_score":0.26998463,"about_ca_system_score_codex":0.00009298818,"about_ca_system_score_gemma":0.000022833374,"threshold_uncertainty_score":0.99994016},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3789944,0.0027120803,0.5932883,0.003695776,0.00046648752,0.00014142411,5.5050157e-7,0.0031590634,0.0175419],"genre_scores_gemma":[0.9957387,0.00009928365,0.0010339753,0.0029911466,0.00008940901,0.000004496396,0.0000019869854,0.000023808494,0.000017191978],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995698,0.000019795156,0.000071618066,0.000076809556,0.000053130712,0.00020885355],"domain_scores_gemma":[0.99977773,0.0000145443055,0.0000084627145,0.00017118637,0.000006166682,0.000021886537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000073054085,0.00007858732,0.00008004623,0.000034269688,0.00001833969,0.000017783408,0.000109160384,0.000023492088,0.000014664134],"category_scores_gemma":[0.0000041763715,0.00007989106,0.00003561337,0.000055875273,0.000010547002,0.00003379144,0.000011905382,0.00013085178,0.000046421344],"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.0000024159424,0.000011175136,0.00004831309,0.0000261507,0.00007298764,0.000005349612,0.000083457264,0.0055203466,0.5807571,0.009114443,0.25063702,0.15372126],"study_design_scores_gemma":[0.00010674823,0.00003846291,0.000104192666,0.000037657177,0.000010934615,0.000011724738,0.00000137694,0.038482446,0.184742,0.0016733049,0.7745548,0.00023635903],"about_ca_topic_score_codex":8.9713507e-7,"about_ca_topic_score_gemma":0.0000026056368,"teacher_disagreement_score":0.6167443,"about_ca_system_score_codex":0.000037923208,"about_ca_system_score_gemma":0.0000021518754,"threshold_uncertainty_score":0.3257863},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046604155,0.12737657,0.22965276,0.000009150112,0.004077033,0.0015116174,0.000029755007,0.0012059056,0.63147676],"genre_scores_gemma":[0.93065923,0.0253519,0.002522572,0.000047074376,0.00084928976,0.0000139316735,0.00004991229,0.00033540986,0.040170662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984594,0.000013507069,0.00055853487,0.00042677004,0.00021984047,0.0003219259],"domain_scores_gemma":[0.9991666,0.00014594864,0.000191641,0.00037656675,0.00006134419,0.000057904977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000134874,0.00046416154,0.00066822977,0.00023457993,0.000053589487,0.0000953391,0.00020069556,0.00023862385,0.000013399803],"category_scores_gemma":[0.000004076134,0.00041723804,0.00007818845,0.000049242157,0.00005124497,0.00015344123,0.00008520718,0.00046689098,0.000035269553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009618653,0.000029059223,0.00052991067,0.0029786217,0.0003693191,0.0002670216,0.0004920131,0.6436073,0.00015408201,0.09555753,0.00094735704,0.25497156],"study_design_scores_gemma":[0.0006149423,0.00063966477,0.000030681327,0.04142306,0.00013206703,0.0004723453,0.00042673317,0.19499335,0.0029764,0.008127772,0.74685204,0.0033109314],"about_ca_topic_score_codex":0.00003903905,"about_ca_topic_score_gemma":0.000041723884,"teacher_disagreement_score":0.9259988,"about_ca_system_score_codex":0.00011702333,"about_ca_system_score_gemma":0.0000202486,"threshold_uncertainty_score":0.9998279},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9485147,0.00044815778,0.04038011,0.000101016594,0.00022738046,0.00025181437,0.0000020188434,0.00006993609,0.010004869],"genre_scores_gemma":[0.9982644,0.000085798645,0.0014605747,0.000027878317,0.00005347137,0.0000015188803,6.19097e-7,0.0000145598515,0.00009118586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991924,0.000108480745,0.00033524501,0.00004747988,0.0002325196,0.00008383836],"domain_scores_gemma":[0.99903154,0.0003820485,0.00026329394,0.00017583606,0.00012661067,0.000020680367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182185,0.00008514534,0.0001923169,0.00018243499,0.000023138213,0.000021462582,0.00018850174,0.00004901737,0.000077191435],"category_scores_gemma":[0.00011216009,0.000042576932,0.00008710334,0.00019518808,0.000025054098,0.00013151251,0.000013522937,0.00020501707,0.000009522636],"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.0040409383,0.0006058192,0.0009979995,0.0005929354,0.0013947584,0.000025294208,0.003458117,0.1386545,0.37024692,0.36363468,0.03966089,0.076687165],"study_design_scores_gemma":[0.0043774215,0.0011050731,0.002321499,0.0016908668,0.00021638715,0.000116417184,0.00196892,0.12612402,0.6765573,0.18178624,0.0031611545,0.0005746976],"about_ca_topic_score_codex":0.0000011084775,"about_ca_topic_score_gemma":5.8934138e-8,"teacher_disagreement_score":0.3063104,"about_ca_system_score_codex":0.000026308247,"about_ca_system_score_gemma":0.000014752112,"threshold_uncertainty_score":0.17362368},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034424342,0.0020944348,0.9577928,0.00014939341,0.000108367385,0.0006774285,0.000004853023,0.0013282921,0.0034200565],"genre_scores_gemma":[0.8164499,0.00005046882,0.18305655,0.00015495255,0.000099992576,0.000019144158,0.00006285425,0.00007998541,0.00002618674],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987557,0.00008563284,0.00035313467,0.00024869852,0.00016858538,0.0003882542],"domain_scores_gemma":[0.9985309,0.00026487347,0.00012962022,0.00071313797,0.00029707898,0.00006437859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002667194,0.00025054105,0.00030125614,0.00007776557,0.00028961443,0.00024189356,0.00044307704,0.00012384976,0.000021439688],"category_scores_gemma":[0.000016967528,0.0002722926,0.000084575535,0.00022287718,0.00009744614,0.00041961114,0.00011798432,0.00030863006,0.000029901177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013509592,0.00009582584,0.00023149907,0.00053027045,0.00010393001,0.0000046212726,0.0010971922,0.090629265,0.5063808,0.00030917602,0.007679549,0.3928028],"study_design_scores_gemma":[0.00041688472,0.000031242005,0.000085073225,0.00056657585,0.000034339875,0.0000113339465,0.00009223852,0.95277274,0.03964313,0.0017253109,0.004289631,0.00033147534],"about_ca_topic_score_codex":0.000018206627,"about_ca_topic_score_gemma":0.000014174632,"teacher_disagreement_score":0.8621435,"about_ca_system_score_codex":0.000068766436,"about_ca_system_score_gemma":0.000023360284,"threshold_uncertainty_score":0.99997294},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50498474,0.000059637838,0.49268192,0.00000593251,0.00043457357,0.00023407023,0.000014852119,0.00023692407,0.0013473277],"genre_scores_gemma":[0.9991773,0.00021352545,0.00027397863,0.000007902232,0.000039374558,4.183921e-7,0.00010369093,0.000037654714,0.0001461723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.000040159302,0.00019732404,0.0003438711,0.000040096234,0.00021518953],"domain_scores_gemma":[0.99918395,0.000028265758,0.00010662829,0.0005793458,0.000058541318,0.000043285425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000060081,0.00022184465,0.00031951637,0.00022405664,0.000017794873,0.000012436869,0.00032506633,0.00029418213,0.000004028865],"category_scores_gemma":[0.000005883821,0.00027218836,0.00012090343,0.00028542036,0.000043075874,0.000072799194,0.0003167894,0.00046351439,0.0000017468296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016207443,0.000011598536,0.0056387438,0.000047594647,0.000034111436,0.000030422967,0.000024342062,0.98337686,0.000050247312,0.010592087,0.00004621162,0.00013156753],"study_design_scores_gemma":[0.00015939225,0.000021467946,0.0014241993,0.00016423743,0.000039937277,0.000001365177,0.000028558476,0.9931106,0.0002190255,0.0045722243,0.000013544971,0.00024546336],"about_ca_topic_score_codex":0.00014455843,"about_ca_topic_score_gemma":0.00012144446,"teacher_disagreement_score":0.49419254,"about_ca_system_score_codex":0.0002619191,"about_ca_system_score_gemma":0.000013999065,"threshold_uncertainty_score":0.99997306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7093033,0.00073786586,0.26298475,0.0015079417,0.0011781732,0.002888296,0.0000347199,0.00024222648,0.021122737],"genre_scores_gemma":[0.94714415,0.00002467973,0.052466474,0.000009846222,0.00016228211,0.000014040446,0.000017599039,0.00002610212,0.00013481565],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9978172,0.00033163364,0.00040870628,0.00016908403,0.0009640536,0.0003092983],"domain_scores_gemma":[0.99788547,0.00024718387,0.00007544014,0.0002388137,0.0014174886,0.00013561784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025850977,0.00013926618,0.00025740277,0.0004329974,0.00014762071,0.00014464601,0.00028143305,0.00008790454,0.000069795424],"category_scores_gemma":[0.00021283232,0.000108501335,0.000088989975,0.00028423616,0.000041378542,0.00037296762,0.00001946003,0.00043680443,0.000012111796],"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.00034511217,0.00023230907,0.002309903,0.00006364844,0.00022312174,0.000024114543,0.0007893942,0.014033121,0.95631015,0.0030581853,0.013381839,0.009229101],"study_design_scores_gemma":[0.0035056865,0.0036126876,0.0065475376,0.0012127685,0.00006724439,0.0005152968,0.0027659754,0.44227326,0.5199238,0.0077654007,0.011053622,0.00075672875],"about_ca_topic_score_codex":0.0000070126957,"about_ca_topic_score_gemma":0.0000038618978,"teacher_disagreement_score":0.43638638,"about_ca_system_score_codex":0.00015470678,"about_ca_system_score_gemma":0.00024423495,"threshold_uncertainty_score":0.44245562},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28514642,0.0055494616,0.03575986,0.0015274732,0.00069384585,0.011150828,0.000175782,0.0011288517,0.6588675],"genre_scores_gemma":[0.99832183,0.00041587302,0.00026620072,0.000041941483,0.00006548931,0.00033703313,0.000042218107,0.0000070196093,0.0005023894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991355,0.000023194154,0.0002517688,0.00006000927,0.00035510914,0.00017439795],"domain_scores_gemma":[0.999282,0.0001394466,0.000022818454,0.00016002075,0.0003411831,0.000054532687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064650306,0.0000713705,0.00007551329,0.00011789082,0.00036524626,0.0007386016,0.00010161993,0.000056750592,0.0000070748174],"category_scores_gemma":[0.000015712198,0.000050837745,0.000011284124,0.00016254657,0.000057039742,0.00080221053,0.00005336693,0.00016123927,0.00013723852],"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.00003701671,0.000010648547,0.003989119,0.00040131836,0.000076715376,4.7549605e-7,0.0012642548,0.015921604,0.0010690477,0.86705965,0.036479276,0.073690906],"study_design_scores_gemma":[0.00019805996,0.000033762586,0.0013257652,0.00004768346,0.0000013989109,0.000023976341,0.0010000003,0.08838241,0.00033730653,0.0009861578,0.9075545,0.00010899414],"about_ca_topic_score_codex":0.00006758629,"about_ca_topic_score_gemma":0.000008372651,"teacher_disagreement_score":0.8710752,"about_ca_system_score_codex":0.000032608605,"about_ca_system_score_gemma":0.000042403666,"threshold_uncertainty_score":0.7122352},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030183798,0.00008323808,0.9647119,0.00005940543,0.0005917181,0.0008778497,0.000051565377,0.0011383785,0.0023021582],"genre_scores_gemma":[0.99259245,0.00042841327,0.0063667255,0.000048504262,0.00012829709,0.0000073958354,0.000082531515,0.0000550522,0.00029064473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991919,0.00002614785,0.00014734459,0.00036726962,0.000038881975,0.0002284792],"domain_scores_gemma":[0.9989732,0.00014096966,0.00009303487,0.00060085976,0.00013574786,0.000056208515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001061924,0.000257362,0.00023675938,0.000108641005,0.00011844325,0.00005869627,0.0004788459,0.00040917174,0.000043968383],"category_scores_gemma":[0.000017977964,0.0002407624,0.00015036578,0.00012586704,0.00007650234,0.00007269818,0.00021599993,0.000658413,0.000007870281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025473691,0.00001216187,0.00003620056,0.000059508657,0.00010489732,0.000014333669,0.000048912523,0.9909166,0.00033304,0.0060825665,0.0021616241,0.00020469981],"study_design_scores_gemma":[0.00020789733,0.000017235909,0.000033611126,0.00011413718,0.00011494097,0.0000035549415,0.000029136876,0.9859131,0.0033920638,0.0074432637,0.002436876,0.00029419037],"about_ca_topic_score_codex":0.00005858387,"about_ca_topic_score_gemma":0.00005173888,"teacher_disagreement_score":0.96240866,"about_ca_system_score_codex":0.00006297993,"about_ca_system_score_gemma":0.00004365053,"threshold_uncertainty_score":0.98180056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9430055,0.000268228,0.0509879,0.0000034050552,0.000057084253,0.00013184435,0.000018779676,0.00040089662,0.0051263333],"genre_scores_gemma":[0.99888414,0.0004101462,0.00053042243,0.000007916253,0.000045167988,7.034311e-7,0.000011794388,0.000027590413,0.00008212373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989985,0.00003279776,0.00017198507,0.0005017817,0.00007240146,0.0002225063],"domain_scores_gemma":[0.99907494,0.00003098619,0.0001409355,0.0003935661,0.00028233285,0.00007721564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009056602,0.00028089233,0.00048614002,0.00079448795,0.000082409235,0.000029629267,0.00031659973,0.00023438934,0.000035056306],"category_scores_gemma":[0.000005303883,0.00032300086,0.00021351267,0.0009531454,0.0002123021,0.00013168775,0.00027673505,0.0003540189,0.0000029450496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008032229,0.000057885627,0.016046593,0.00021034075,0.0027522913,0.00006338276,0.0013807125,0.9754173,0.0009086633,0.0017891556,0.0002571232,0.0010361928],"study_design_scores_gemma":[0.00013796912,0.000050067734,0.0077046845,0.00025323537,0.0016928997,0.000001969247,0.00023575971,0.9832225,0.0038368215,0.0024419911,0.000032869943,0.0003892575],"about_ca_topic_score_codex":0.000106708336,"about_ca_topic_score_gemma":0.00002984043,"teacher_disagreement_score":0.055878606,"about_ca_system_score_codex":0.0001278088,"about_ca_system_score_gemma":0.000056375568,"threshold_uncertainty_score":0.9999222},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05559941,0.0016948724,0.9381021,0.00009319448,0.0012138119,0.00013875733,0.000020195128,0.00019307274,0.002944536],"genre_scores_gemma":[0.72284895,0.0026610931,0.27383408,0.00006351199,0.0004506753,0.0000025406898,0.00005816996,0.000055121025,0.000025872743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988079,0.00003723458,0.00049505674,0.00015259316,0.00033553742,0.00017168114],"domain_scores_gemma":[0.99874276,0.000016161099,0.00038400557,0.0002674357,0.0005051017,0.00008453916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011307459,0.00025374867,0.00043903128,0.000090314534,0.000030944808,0.00021207669,0.0002338813,0.00027141164,0.0000486364],"category_scores_gemma":[0.000029219573,0.00022788938,0.00017883704,0.00021152943,0.000020090236,0.0002374901,0.0000987024,0.00046806003,0.0000013560349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056126246,0.000029191186,0.000139685,0.00005670224,0.00019238885,0.00013918601,0.00002205536,0.99522096,0.00010774104,0.000018985333,0.0024524902,0.0015645127],"study_design_scores_gemma":[0.0014044467,0.0005469409,0.001110875,0.006729578,0.0007385669,0.0017213888,0.00018750451,0.9722498,0.011696015,0.0011708838,0.0010699398,0.0013740581],"about_ca_topic_score_codex":0.000014973665,"about_ca_topic_score_gemma":0.000012273066,"teacher_disagreement_score":0.6672495,"about_ca_system_score_codex":0.0003854006,"about_ca_system_score_gemma":0.0001612159,"threshold_uncertainty_score":0.9293059},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98664516,0.0006775639,0.006200962,0.0001384749,0.00030668947,0.0005148708,0.000009747571,0.00038441893,0.005122115],"genre_scores_gemma":[0.99861586,0.0008594901,0.00011374025,0.000017988892,0.00004993075,0.0000011392576,0.0000036718902,0.00001853314,0.00031966149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936736,0.000119304226,0.00013434776,0.00020032164,0.000048897404,0.00012977095],"domain_scores_gemma":[0.99900323,0.00007367202,0.0001124509,0.00069659826,0.00008274937,0.000031272342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105876476,0.00015207716,0.00019250718,0.000082126426,0.00006872774,0.000021367387,0.0004315918,0.00017729141,0.0000062349136],"category_scores_gemma":[0.000033703524,0.00008534254,0.00009389334,0.0002549368,0.00022295251,0.000066138564,0.00041509524,0.00037073746,0.0000024144454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019111042,0.00079329236,0.11503688,0.002687577,0.0041604033,0.00008905968,0.010018407,0.31128946,0.048258603,0.41354057,0.045451827,0.04676282],"study_design_scores_gemma":[0.0018667162,0.00005124518,0.117420025,0.0012004549,0.0012458494,0.000017272498,0.00044095842,0.7062892,0.0790533,0.08508793,0.0058649923,0.0014620909],"about_ca_topic_score_codex":0.00021353933,"about_ca_topic_score_gemma":0.000010351715,"teacher_disagreement_score":0.3949997,"about_ca_system_score_codex":0.00004958435,"about_ca_system_score_gemma":0.00002082228,"threshold_uncertainty_score":0.34801677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799208,0.00018749644,0.00648826,0.000045570418,0.00063241075,0.00030544662,0.000004794313,0.0016703984,0.010744804],"genre_scores_gemma":[0.9916336,0.000013737895,0.0075115156,0.000097764896,0.000045579123,0.0000054796374,0.000029080396,0.000029085371,0.0006341461],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919164,0.000012196393,0.00017189297,0.00018090935,0.00021056355,0.00023281827],"domain_scores_gemma":[0.9995359,0.00004293742,0.0000188678,0.00029605566,0.00003965169,0.00006654452],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000059189962,0.00016623625,0.00017147824,0.00019259406,0.00002216509,0.000016121221,0.00012385155,0.00007957968,0.0026682843],"category_scores_gemma":[0.0000043452646,0.00015157682,0.000060741757,0.00024815963,0.000012700289,0.00009939598,0.000041357158,0.00011289103,0.0020947207],"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.000023406748,0.00012823724,0.00088731345,0.000051856696,0.00024565155,0.00005371833,0.000072305265,0.052579917,0.85208625,0.0029330233,0.078816086,0.012122233],"study_design_scores_gemma":[0.00075572025,0.00017402357,0.0012449244,0.00006640351,0.000033090862,0.00002437743,0.000013405137,0.5280863,0.46394345,0.0015011118,0.0035408337,0.0006163358],"about_ca_topic_score_codex":0.000046161025,"about_ca_topic_score_gemma":7.6528727e-7,"teacher_disagreement_score":0.4755064,"about_ca_system_score_codex":0.000086956046,"about_ca_system_score_gemma":0.000007287314,"threshold_uncertainty_score":0.99868226},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7113171,0.011686192,0.24038218,0.000262905,0.0015549035,0.0011695583,0.00015860525,0.0056442823,0.027824227],"genre_scores_gemma":[0.98089033,0.0012459727,0.014627389,0.000028666327,0.00011341844,0.000008118161,0.00003591452,0.00009535486,0.0029548188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977742,0.000021492902,0.00053408736,0.00054567115,0.0005054824,0.00061909197],"domain_scores_gemma":[0.99800044,0.00013487253,0.00015310862,0.0014477123,0.00013195843,0.00013190595],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027953443,0.00043089865,0.00078736676,0.005048737,0.00007254562,0.00010652237,0.0006611634,0.00042533054,0.00050994556],"category_scores_gemma":[0.00012109063,0.00043468148,0.00048474412,0.01603483,0.000054522356,0.0001461529,0.00028885403,0.00058262533,0.0011684621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000162892,0.0019563928,0.28978077,0.0016122916,0.017447881,0.0007286623,0.0013443144,0.2920523,0.084874265,0.07875872,0.034291353,0.19699018],"study_design_scores_gemma":[0.0007223546,0.0004255212,0.022534836,0.00028099646,0.0049573025,0.00002018732,0.00034753242,0.8131305,0.05231346,0.001800602,0.10119729,0.0022694254],"about_ca_topic_score_codex":0.000121389516,"about_ca_topic_score_gemma":0.00000390215,"teacher_disagreement_score":0.5210782,"about_ca_system_score_codex":0.00021095278,"about_ca_system_score_gemma":0.000025184454,"threshold_uncertainty_score":0.9998105},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060745098,0.0001405568,0.93516797,0.000017789658,0.00054063916,0.00033559054,0.00018601859,0.0013419746,0.001524358],"genre_scores_gemma":[0.99361175,0.0005130859,0.005089565,0.000008932552,0.00011294416,0.0000033154254,0.00034304548,0.000045731776,0.00027159994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922013,0.000020357227,0.00011850121,0.00039149242,0.000035177763,0.00021433723],"domain_scores_gemma":[0.9988504,0.000041679286,0.00010789267,0.0007988959,0.00013420137,0.000066903165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006023915,0.00025878916,0.0002678654,0.00011148566,0.000154264,0.000099444755,0.00051749934,0.00029350226,0.000015611198],"category_scores_gemma":[0.00003266161,0.00031629935,0.00016740132,0.00006653225,0.000065441905,0.00013357204,0.00029886494,0.00022545786,0.0000047998724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001926491,0.000012200129,0.00008879971,0.000056691264,0.000083881925,0.000031896696,0.000013344904,0.9920039,0.000054070202,0.0029724299,0.0044077057,0.00025582575],"study_design_scores_gemma":[0.00024101436,0.00001590852,0.000057187273,0.0001459497,0.000109493245,0.0000010036052,0.000015543701,0.9856481,0.0025969567,0.008133907,0.0026667174,0.00036824791],"about_ca_topic_score_codex":0.00004276763,"about_ca_topic_score_gemma":0.000009567463,"teacher_disagreement_score":0.9328667,"about_ca_system_score_codex":0.00012522232,"about_ca_system_score_gemma":0.000033662396,"threshold_uncertainty_score":0.9999289},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875508,0.0102061955,0.031179968,0.0018681609,0.00070914713,0.0042134975,0.000038441285,0.00362016,0.07265641],"genre_scores_gemma":[0.9889033,0.0008840234,0.0011780888,0.008873293,0.00008467853,0.000037989656,0.000014703793,0.000020730082,0.0000032272528],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993982,0.000018990873,0.00013080955,0.00010031288,0.00018433847,0.00016734915],"domain_scores_gemma":[0.9995577,0.00003749827,0.000051167124,0.00025197174,0.000057855654,0.0000438378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026025005,0.00015886345,0.00026725815,0.000035994384,0.00001828173,0.00002225051,0.00012612985,0.000008462077,0.000012566712],"category_scores_gemma":[0.0000033898737,0.00012124913,0.00008863631,0.00017739665,0.000028889583,0.0003566986,0.000021902952,0.0001579277,0.00040144223],"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.00023274326,0.0002759231,0.0021548008,0.007992174,0.0012463847,0.000054969805,0.001427902,0.050124858,0.19369882,0.005051263,0.66022617,0.07751398],"study_design_scores_gemma":[0.0017309238,0.00084256823,0.0051748715,0.02406182,0.0004847378,0.00003720976,0.00004355135,0.20639883,0.040192902,0.00047008885,0.7177038,0.0028586937],"about_ca_topic_score_codex":0.0000045379415,"about_ca_topic_score_gemma":1.689507e-7,"teacher_disagreement_score":0.15627398,"about_ca_system_score_codex":0.000019289118,"about_ca_system_score_gemma":0.000004298902,"threshold_uncertainty_score":0.51598614},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46733707,0.0004787325,0.52542984,0.00019575693,0.0003929226,0.001590521,0.000055647284,0.0018664598,0.0026530502],"genre_scores_gemma":[0.99687284,0.0019280579,0.00087407295,0.00008348442,0.00006957416,0.0000018597929,0.000027365151,0.000037983937,0.00010476572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933124,0.00002647582,0.000120323995,0.00031666542,0.000028318413,0.00017697898],"domain_scores_gemma":[0.999354,0.00009273848,0.000067946195,0.00036600183,0.00007187855,0.00004741638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007533836,0.00021023228,0.00019185896,0.00010235742,0.0001064674,0.000054961434,0.00026567566,0.0002649794,0.0000054863945],"category_scores_gemma":[0.000012721154,0.00019873615,0.0000823566,0.00011121712,0.000052488605,0.00006821977,0.00013993944,0.00030581607,0.0000027433387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067041976,0.000028484237,0.00018074052,0.00014514837,0.0001635383,0.000029240746,0.00025563836,0.9731207,0.0007839137,0.01937415,0.0043666824,0.0014847093],"study_design_scores_gemma":[0.00023873424,0.000046342175,0.00042114558,0.00021186282,0.00010672821,0.0000058462256,0.000041860632,0.9753488,0.0010306872,0.017254889,0.0049886727,0.00030445572],"about_ca_topic_score_codex":0.00004309898,"about_ca_topic_score_gemma":0.00004002775,"teacher_disagreement_score":0.5295358,"about_ca_system_score_codex":0.000057703157,"about_ca_system_score_gemma":0.00001798322,"threshold_uncertainty_score":0.8104225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50380915,0.000053209038,0.4927607,0.00001166728,0.00034513508,0.00037668354,0.000012108942,0.0014417717,0.0011895796],"genre_scores_gemma":[0.97774124,0.00006729268,0.021797827,0.000035179088,0.00009578013,0.000001928731,0.000056440796,0.000104742954,0.00009958838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834085,0.000121905025,0.00025971953,0.000733849,0.00010352908,0.00044013842],"domain_scores_gemma":[0.9985133,0.00007748427,0.00021538962,0.00085816777,0.00018441105,0.00015127969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007865414,0.00054696813,0.0005684178,0.00031263247,0.00016516776,0.0001720765,0.00034498746,0.00039741438,0.000054533466],"category_scores_gemma":[0.000009500009,0.00058087305,0.00015574975,0.00028589787,0.00018631449,0.00018301178,0.00019134945,0.00070134545,0.000020608173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070198636,0.00002349162,0.00022773164,0.00015085767,0.00018559581,0.00017997592,0.000033830216,0.99333656,0.0031810212,0.00059771555,0.0004403136,0.0015727371],"study_design_scores_gemma":[0.0007840733,0.000033999742,0.00018964845,0.0007257002,0.00023408807,0.000024836541,0.000029453218,0.9816609,0.012701869,0.0027347826,0.00017097508,0.00070968934],"about_ca_topic_score_codex":0.00018789417,"about_ca_topic_score_gemma":0.00003734779,"teacher_disagreement_score":0.4739321,"about_ca_system_score_codex":0.00023033876,"about_ca_system_score_gemma":0.00008512008,"threshold_uncertainty_score":0.99966425},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93596345,0.00010692835,0.061043624,0.0000018244637,0.0006495306,0.00017087425,0.0000354313,0.00024631285,0.0017819966],"genre_scores_gemma":[0.9982426,0.00009174407,0.0015053487,0.0000030958067,0.00006892705,4.9381185e-7,0.000028320788,0.000031462605,0.000027966158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989737,0.0000941226,0.00029450227,0.0003730928,0.0000970469,0.00016752299],"domain_scores_gemma":[0.9988527,0.000044903194,0.0002683361,0.00060308323,0.00016675855,0.00006421796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012095274,0.00024458364,0.0004556743,0.0002537874,0.000026306254,0.000008381686,0.0003614112,0.0002937357,0.00008793274],"category_scores_gemma":[0.000011127117,0.00030610702,0.0002034354,0.00014155419,0.00011217997,0.00008502093,0.00023425103,0.0002625648,0.000008039202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010765761,0.000068245645,0.0044969087,0.0001267659,0.0004817153,0.000027885335,0.00009189561,0.7952272,0.1975764,0.00017650847,0.00046427007,0.0011544926],"study_design_scores_gemma":[0.000535225,0.000069218404,0.0019988671,0.0010403541,0.00037677048,0.000002581745,0.000067256115,0.23643728,0.7521701,0.0067390753,0.000053419542,0.00050987006],"about_ca_topic_score_codex":0.00029604873,"about_ca_topic_score_gemma":0.000021866386,"teacher_disagreement_score":0.55878997,"about_ca_system_score_codex":0.000075229815,"about_ca_system_score_gemma":0.00003445558,"threshold_uncertainty_score":0.9999391},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6527972,0.000013947449,0.34244192,0.0000037897166,0.0008140951,0.0002578913,0.000056542063,0.00096896646,0.002645612],"genre_scores_gemma":[0.9972316,0.00008618407,0.0023042075,0.000042092764,0.00015417137,0.0000010880071,0.000103274666,0.000041942807,0.00003542094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988394,0.00004357595,0.0003084065,0.00034951553,0.00009107342,0.00036807012],"domain_scores_gemma":[0.9988249,0.000053191598,0.0002078494,0.00062673824,0.00015439997,0.00013293068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011801807,0.00037239143,0.00039292424,0.00029052005,0.00011983503,0.0001338363,0.0004835262,0.00051357166,0.00015046723],"category_scores_gemma":[0.00002472302,0.00047629184,0.00018908332,0.00018939025,0.00007076726,0.00057449896,0.00048741206,0.0009398755,0.000053918775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030115698,0.00001355496,0.00027432924,0.000069337446,0.000107315616,0.00006478627,0.0001321079,0.99024683,0.007056189,0.0007869512,0.0006290623,0.00058939017],"study_design_scores_gemma":[0.00029570848,0.000020894791,0.00022660615,0.00017473118,0.0001234052,0.000010358722,0.000038585596,0.967804,0.02276192,0.0038162498,0.004110092,0.0006174315],"about_ca_topic_score_codex":0.00022265731,"about_ca_topic_score_gemma":0.000021049595,"teacher_disagreement_score":0.34443438,"about_ca_system_score_codex":0.00017463304,"about_ca_system_score_gemma":0.00008465677,"threshold_uncertainty_score":0.99976885},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78137517,0.0002381019,0.20630057,0.0000090386175,0.00045942876,0.000331894,0.000021003661,0.0019108085,0.009353966],"genre_scores_gemma":[0.9949728,0.00024173011,0.0042267377,0.00001947942,0.00014100608,0.0000014051625,0.0000818666,0.00008371436,0.00023122506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883384,0.000050396367,0.000166178,0.00048217183,0.0000768135,0.0003905871],"domain_scores_gemma":[0.99890584,0.00006842655,0.00011909686,0.0006560649,0.00011257295,0.00013801554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006337787,0.00038869798,0.00032106336,0.00021415795,0.00010280353,0.00004875903,0.00036231327,0.00034740646,0.000050708975],"category_scores_gemma":[0.0000077729555,0.0004144164,0.000106474734,0.00027292946,0.00006500999,0.00019764488,0.00027936127,0.0005294688,0.000050167684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009187179,0.0001105974,0.024358977,0.00022457361,0.00045461935,0.00032716268,0.0004613799,0.9644285,0.00097498397,0.00384241,0.002933189,0.0017917688],"study_design_scores_gemma":[0.00045175635,0.000025534917,0.001379223,0.00039747992,0.00022642795,0.000011735569,0.00006976916,0.9814504,0.0103649385,0.0024238753,0.0023449506,0.0008539343],"about_ca_topic_score_codex":0.000069668495,"about_ca_topic_score_gemma":0.000044156215,"teacher_disagreement_score":0.21359764,"about_ca_system_score_codex":0.00015845906,"about_ca_system_score_gemma":0.000032021195,"threshold_uncertainty_score":0.9998308},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7192042,0.00028510913,0.27665693,0.00002687245,0.00019806779,0.0006695956,0.00005425038,0.0016029831,0.0013020167],"genre_scores_gemma":[0.96327674,0.00008344337,0.03481414,0.00008988488,0.00028350725,0.00012275456,0.0011987652,0.00008090302,0.00004985404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811816,0.00006367892,0.0004629367,0.0006611746,0.00022682402,0.00046719884],"domain_scores_gemma":[0.99831843,0.000027803091,0.00012972725,0.001236605,0.00011444248,0.000172986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021691182,0.000498105,0.0007433175,0.00042367663,0.00009182771,0.000088646775,0.00057756394,0.00039939937,0.000016411328],"category_scores_gemma":[0.000010335813,0.0005189906,0.0004997634,0.00031769363,0.000042330856,0.00007522219,0.0001527898,0.0005210314,0.000008881937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009177923,0.00062818354,0.051439364,0.00028369098,0.0039936444,0.000037578066,0.0005307406,0.91594684,0.019857313,0.0002364879,0.0023903085,0.0045640813],"study_design_scores_gemma":[0.00043537436,0.000096397875,0.12296318,0.000106037514,0.0017893641,0.0000039788456,0.000048505244,0.8498107,0.020641,0.00033881658,0.0027131834,0.0010534187],"about_ca_topic_score_codex":0.00009895522,"about_ca_topic_score_gemma":0.000033502205,"teacher_disagreement_score":0.24407256,"about_ca_system_score_codex":0.00013046709,"about_ca_system_score_gemma":0.000024513998,"threshold_uncertainty_score":0.9997262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.717066,0.0011794113,0.26707888,0.00005987587,0.0012484872,0.00043015764,0.00006152672,0.0017412414,0.011134428],"genre_scores_gemma":[0.9705639,0.0070984466,0.021186955,0.00018822965,0.0002498334,0.00006074092,0.00024520783,0.00012680647,0.00027988193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840003,0.000041475032,0.0004393494,0.00054516207,0.00020804351,0.00036594516],"domain_scores_gemma":[0.9986534,0.000036862446,0.00014938242,0.00094529125,0.00011535699,0.00009968989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010106791,0.00045545996,0.00051329494,0.00011107568,0.000084451385,0.00005429993,0.00041044832,0.0005110141,0.000050903665],"category_scores_gemma":[0.00003397247,0.0005279913,0.00016549064,0.00014737074,0.00007748871,0.00017861913,0.00028771165,0.0007808375,0.00006408526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019073459,0.00004569548,0.0075749434,0.00008152483,0.00011375579,0.000042402848,0.00009630279,0.93967795,0.0020676448,0.0000039611914,0.049368028,0.0009086867],"study_design_scores_gemma":[0.0006489361,0.00008685124,0.013675317,0.0011812404,0.00013367996,0.00004117048,0.000030280939,0.8363987,0.12872443,0.00039655226,0.016242035,0.002440762],"about_ca_topic_score_codex":0.00009329417,"about_ca_topic_score_gemma":0.000004211454,"teacher_disagreement_score":0.2534979,"about_ca_system_score_codex":0.00017481402,"about_ca_system_score_gemma":0.000053843483,"threshold_uncertainty_score":0.9997172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5110454,0.00004490014,0.48682013,0.0000037015218,0.00044735902,0.00021533568,0.00007387487,0.0002988025,0.0010505244],"genre_scores_gemma":[0.9914699,0.000033388747,0.008157465,0.000015190858,0.00015030414,4.0004306e-7,0.000092373826,0.000046455913,0.000034482826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984979,0.0001319246,0.0003936243,0.00053484517,0.00012796471,0.0003137517],"domain_scores_gemma":[0.99817806,0.00018831938,0.00028839134,0.0005403432,0.00065147,0.00015338666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017412145,0.0003853671,0.0006318779,0.00029587065,0.00010569358,0.00005959846,0.00029741204,0.0005427541,0.00006858773],"category_scores_gemma":[0.000066076995,0.00048338025,0.00021558875,0.00022872843,0.00037259283,0.00016750503,0.0003102109,0.0006904062,0.0000065916597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024190199,0.00002257042,0.00022670034,0.000069395806,0.00024919893,0.00019029873,0.00008809797,0.99223447,0.0035375783,0.0026330918,0.00039512853,0.000111597],"study_design_scores_gemma":[0.0015308304,0.00003990163,0.00015180711,0.00050658645,0.00017334888,0.00009168421,0.000119072276,0.92264575,0.005323379,0.06888068,0.000036079466,0.00050091115],"about_ca_topic_score_codex":0.00010871283,"about_ca_topic_score_gemma":0.000022412223,"teacher_disagreement_score":0.48042458,"about_ca_system_score_codex":0.00023678676,"about_ca_system_score_gemma":0.00016370013,"threshold_uncertainty_score":0.99976176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44904226,0.000015750218,0.5480884,0.0000023853288,0.0006894698,0.00019791257,0.000012410145,0.0010384115,0.0009130035],"genre_scores_gemma":[0.965979,0.00005648921,0.03342135,0.000011849957,0.00028400955,0.0000025903682,0.000040844705,0.00006905954,0.00013485835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892503,0.000055375513,0.00014677166,0.000541188,0.0000452058,0.00028642424],"domain_scores_gemma":[0.99906564,0.000109697015,0.000105225736,0.0005235416,0.00010288561,0.00009300482],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019724297,0.000282169,0.0002780279,0.00025354556,0.00013539245,0.00007337207,0.0004138429,0.0003801799,0.000012784577],"category_scores_gemma":[0.000027957205,0.00035766314,0.0001550988,0.00017465677,0.000023046232,0.00015265786,0.00013640088,0.0006990554,0.0000035966648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021214508,0.000029109202,0.00074852235,0.00008122691,0.00014828556,0.000033986096,0.00014074676,0.9395963,0.050559517,0.0033627886,0.00035068783,0.0049276296],"study_design_scores_gemma":[0.00013794246,0.000029571469,0.00020725295,0.000092147944,0.000091968985,0.0000040015448,0.000026256028,0.9256652,0.064970165,0.0075937673,0.0007951135,0.00038663062],"about_ca_topic_score_codex":0.0002119444,"about_ca_topic_score_gemma":0.00011601805,"teacher_disagreement_score":0.5169367,"about_ca_system_score_codex":0.00014095518,"about_ca_system_score_gemma":0.000026418335,"threshold_uncertainty_score":0.9998875},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7769979,0.00011257945,0.2196119,0.0000059617087,0.00020717473,0.00014057777,0.00001685657,0.0004523411,0.0024546576],"genre_scores_gemma":[0.9974738,0.0012654492,0.000837539,0.0000047388103,0.00003841874,2.7792896e-7,0.000034287244,0.000027928978,0.00031757532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942434,0.00002379778,0.00012220988,0.00027077683,0.00003842107,0.000120448436],"domain_scores_gemma":[0.99942386,0.000019175013,0.00007318675,0.0003603541,0.00007632992,0.00004707677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033743632,0.00018247451,0.0002494812,0.00015188972,0.000034419278,0.000010534108,0.00017922535,0.00020845265,0.000014185271],"category_scores_gemma":[0.0000074387076,0.000220403,0.00006641174,0.0001395628,0.00008327758,0.000069147936,0.00020877401,0.00020607015,0.0000010865715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012985387,0.000016147927,0.0013387138,0.00010817536,0.00007111669,0.00009832485,0.00005599163,0.99384207,0.0008200419,0.0025502387,0.000677697,0.00040849604],"study_design_scores_gemma":[0.00016853848,0.000022428738,0.0019391284,0.00012293554,0.00007499885,0.00001372375,0.000009839023,0.98798835,0.0067024883,0.0024921095,0.00017026793,0.00029517178],"about_ca_topic_score_codex":0.00003656979,"about_ca_topic_score_gemma":0.000007118525,"teacher_disagreement_score":0.22047584,"about_ca_system_score_codex":0.00003662789,"about_ca_system_score_gemma":0.000023838085,"threshold_uncertainty_score":0.89877737},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15651537,0.0029123656,0.8363238,0.00007939183,0.0005565979,0.00036706912,0.00004572072,0.0017812714,0.0014184196],"genre_scores_gemma":[0.9922888,0.0014529529,0.004700748,0.000097839744,0.0004926919,0.000026980013,0.0006860278,0.000098370656,0.00015553414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987333,0.000061408355,0.00039978072,0.00037922602,0.00014961642,0.00027669503],"domain_scores_gemma":[0.999125,0.00004133962,0.00012423085,0.00052029727,0.00012666863,0.00006248013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009801093,0.0003194945,0.00033567048,0.000103113656,0.00015310584,0.000082585,0.00015617146,0.0002608101,0.00001076183],"category_scores_gemma":[0.000016791662,0.00035992937,0.00007303617,0.0002274328,0.000079911406,0.000059391718,0.00015100389,0.00031167563,0.000010118046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007025631,0.000019269393,0.28876823,0.00017454028,0.00006984747,0.000017741408,0.00006277307,0.63386,0.00016155845,0.0024770747,0.074030854,0.00035107433],"study_design_scores_gemma":[0.0005676234,0.000044350258,0.34386227,0.0022372247,0.00032659573,0.000040343784,0.000042023785,0.47861484,0.0018987453,0.04102704,0.12904662,0.0022923371],"about_ca_topic_score_codex":0.00018637667,"about_ca_topic_score_gemma":0.000104976665,"teacher_disagreement_score":0.83577347,"about_ca_system_score_codex":0.00005708623,"about_ca_system_score_gemma":0.000012807013,"threshold_uncertainty_score":0.99988526},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1619241,0.00016665037,0.8370956,0.0000062678014,0.00010056153,0.0004116325,0.00004519441,0.0002077845,0.0000421953],"genre_scores_gemma":[0.9598121,0.00007303037,0.039938767,0.00001809213,0.000015937787,0.0000019632214,0.00009614844,0.00003689016,0.0000070402243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988599,0.000108796106,0.00025546408,0.0004568189,0.000062362386,0.00025668036],"domain_scores_gemma":[0.99865794,0.00030997192,0.00016904791,0.0006439864,0.00014353907,0.00007553818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023112263,0.0002874418,0.00053958426,0.0008998187,0.000046411773,0.000026409012,0.00022625725,0.00029435012,0.000004809677],"category_scores_gemma":[0.0000193778,0.00037014022,0.00024129417,0.00068666966,0.000096020405,0.000078589306,0.00006242316,0.00023416757,5.3928505e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008418431,0.000041091436,0.0025064233,0.00012646256,0.00032231916,0.000011471371,0.000027257482,0.9932075,0.0028440168,0.00012868791,0.000031414424,0.0006691348],"study_design_scores_gemma":[0.0004831624,0.000019443669,0.002339395,0.00016988789,0.00070207,2.220598e-7,0.000015470843,0.9713248,0.022381747,0.0021968991,0.00001986114,0.0003470163],"about_ca_topic_score_codex":0.00019782457,"about_ca_topic_score_gemma":0.000024394416,"teacher_disagreement_score":0.79788804,"about_ca_system_score_codex":0.000105855564,"about_ca_system_score_gemma":0.00005552094,"threshold_uncertainty_score":0.99987507},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08627661,0.00004571823,0.90784323,0.0000028626782,0.00014568887,0.000761515,0.000053343723,0.0011437134,0.003727309],"genre_scores_gemma":[0.9576128,0.000017695183,0.041977998,0.000008099845,0.00010079623,0.000006420391,0.0001852039,0.000058146663,0.00003282177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987682,0.000065114145,0.0001893441,0.0006028002,0.00007492031,0.00029963776],"domain_scores_gemma":[0.99883515,0.000024764711,0.00010308619,0.00060303137,0.00029150074,0.00014245768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025830878,0.0003187394,0.00035933955,0.00022100595,0.000083879044,0.00009020057,0.0004067542,0.00036600922,0.0000037529544],"category_scores_gemma":[0.0000125403485,0.0003906371,0.00016571562,0.0002214101,0.000070408314,0.00010819085,0.00013624613,0.00037229405,6.07393e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003399088,0.0000622172,0.00015028537,0.00011270092,0.00009429778,0.00001475551,0.00015568538,0.99715436,0.00006720211,0.0017396392,0.0001256232,0.00028924816],"study_design_scores_gemma":[0.0003811436,0.000037834023,0.000025614132,0.000085942986,0.00012369758,0.0000041428893,0.00015560188,0.9961009,0.00035119493,0.0022685223,0.00003914971,0.0004262556],"about_ca_topic_score_codex":0.00004775866,"about_ca_topic_score_gemma":0.0000033998704,"teacher_disagreement_score":0.8713362,"about_ca_system_score_codex":0.00025143672,"about_ca_system_score_gemma":0.000085171356,"threshold_uncertainty_score":0.99985456},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63531405,0.00007379363,0.35864887,0.000016611417,0.0007162876,0.0005619657,0.00007618676,0.0010644031,0.0035278383],"genre_scores_gemma":[0.9982049,0.00012486649,0.0011046075,0.000019795672,0.00010947296,0.00000259152,0.00011525153,0.00004385408,0.00027466417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992438,0.000020536825,0.00011276594,0.0003687433,0.000038846047,0.0002153183],"domain_scores_gemma":[0.9989988,0.00005246487,0.00011305538,0.0006621244,0.00010148154,0.00007205075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006542779,0.00024550667,0.00027066033,0.00012793479,0.00014101366,0.00008776438,0.00047371292,0.00022769521,0.00002481159],"category_scores_gemma":[0.000013609815,0.0003090822,0.00015801933,0.00005175667,0.000058324225,0.00012472052,0.00017297879,0.00024579666,0.000014253815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078889316,0.00004834633,0.00074839615,0.0002526797,0.00029558042,0.00010119481,0.00013013305,0.97896606,0.0032162694,0.0049189036,0.00779205,0.0034514747],"study_design_scores_gemma":[0.00044430158,0.00002336863,0.0006128646,0.00020150183,0.00013200018,0.0000013936891,0.000040226045,0.9708607,0.011598022,0.014630805,0.0010233338,0.0004314926],"about_ca_topic_score_codex":0.000048940117,"about_ca_topic_score_gemma":0.000022140832,"teacher_disagreement_score":0.36289084,"about_ca_system_score_codex":0.00013959005,"about_ca_system_score_gemma":0.000032192842,"threshold_uncertainty_score":0.9999361},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94552153,0.00023049954,0.050690874,0.000028485481,0.0015579971,0.0007139857,0.0000052986916,0.00077700854,0.00047432145],"genre_scores_gemma":[0.9964112,0.0000073317706,0.0029588745,0.00008183105,0.0004228597,0.000018428,0.000017921458,0.000048041977,0.0000335288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998999,0.000013711164,0.00018209666,0.00025647064,0.00012804219,0.0004206585],"domain_scores_gemma":[0.9995025,0.000050621446,0.000040516126,0.00028772265,0.000045510318,0.00007315276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006466662,0.00020995826,0.00022806475,0.00006432732,0.00006885569,0.000048648813,0.0001680815,0.00012088836,0.000014689708],"category_scores_gemma":[0.0000045955153,0.0001931034,0.00010195102,0.00013662482,0.00001725238,0.000039985145,0.000049987022,0.00026616166,0.0000047251906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019942498,0.000010475923,0.00044634283,0.0000144976975,0.00002271327,0.000004942495,0.000052348016,0.9841889,0.002060823,0.00005940981,0.0013927841,0.011726809],"study_design_scores_gemma":[0.00029097564,0.00008771953,0.0016904714,0.000039165345,0.000015946853,0.000014718248,0.000009514094,0.98998487,0.0067927586,0.000043009855,0.00079976115,0.00023109262],"about_ca_topic_score_codex":0.000008558956,"about_ca_topic_score_gemma":0.0000039777847,"teacher_disagreement_score":0.050889652,"about_ca_system_score_codex":0.000053858446,"about_ca_system_score_gemma":0.000004379076,"threshold_uncertainty_score":0.7874529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08349559,0.00025785115,0.9081874,0.00001981191,0.0018958931,0.0012362158,0.000117634554,0.0015217225,0.0032679173],"genre_scores_gemma":[0.98182184,0.00068484584,0.013000504,0.00004440166,0.0003120355,0.0000062224885,0.00013965383,0.00011239204,0.0038781008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998628,0.000031822437,0.0002139768,0.00066703564,0.00007815893,0.00038101478],"domain_scores_gemma":[0.9986535,0.00005553509,0.00013350253,0.00085701636,0.0001839321,0.00011652183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000098489436,0.00042381472,0.0004565999,0.00020825659,0.000078518104,0.000036350793,0.00051860744,0.00046824734,0.00003601106],"category_scores_gemma":[0.000010151632,0.00045820232,0.0002908205,0.00016297134,0.00005248697,0.00011283284,0.00044266155,0.00051656924,0.00007179526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008121261,0.00011144261,0.00036210706,0.0004758112,0.00048322274,0.0002019621,0.00016045003,0.9467069,0.0013066102,0.0021765972,0.027581552,0.020352134],"study_design_scores_gemma":[0.00045894115,0.000060049566,0.000053336007,0.00040558437,0.00012020006,0.0000033982935,0.000038906357,0.97294915,0.012678517,0.0030838903,0.009585689,0.0005623311],"about_ca_topic_score_codex":0.000042846434,"about_ca_topic_score_gemma":0.000005239883,"teacher_disagreement_score":0.8983263,"about_ca_system_score_codex":0.00020607046,"about_ca_system_score_gemma":0.00007286267,"threshold_uncertainty_score":0.999787},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67003256,0.0009327397,0.12221176,0.00072268466,0.0005363918,0.000049968312,0.00023774848,0.00027083443,0.2050053],"genre_scores_gemma":[0.9797185,0.00028295198,0.017660715,0.00075975206,0.00039479256,0.00022462598,0.00066212245,0.00025643097,0.000040111674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99464905,0.00041232753,0.001243062,0.001134477,0.0015412583,0.0010198196],"domain_scores_gemma":[0.99455416,0.0024359976,0.0011948432,0.0012713883,0.00015359237,0.00039001036],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012945128,0.0005598788,0.00043899388,0.00088364905,0.00081246323,0.000535504,0.00088949595,0.00092131225,0.071132705],"category_scores_gemma":[0.00033723886,0.0009601719,0.0016575329,0.002392912,0.0006705242,0.00035281613,0.00067652506,0.00084246177,0.00014135844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008241894,0.00027150495,0.00006459919,0.00048591063,0.010654838,0.00022438074,0.0013753711,0.544128,0.0055492413,0.38248283,0.048346505,0.0055926708],"study_design_scores_gemma":[0.000515796,0.000117778465,0.00047736694,0.00025118122,0.0042526885,0.00005009123,0.00040692333,0.54439425,0.4485548,0.00018457744,0.000288848,0.00050568883],"about_ca_topic_score_codex":0.0018881618,"about_ca_topic_score_gemma":0.00078600284,"teacher_disagreement_score":0.4430056,"about_ca_system_score_codex":0.000018164566,"about_ca_system_score_gemma":0.0004997609,"threshold_uncertainty_score":0.99928486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7698585,0.0020983387,0.18255644,0.0012565874,0.00086610194,0.0008045465,0.00013810863,0.001442635,0.04097876],"genre_scores_gemma":[0.9954983,0.0004051436,0.003949465,0.00003623809,0.000040825926,0.0000076672695,0.000028847466,0.000025092055,0.000008428633],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982599,0.00021925973,0.0005792269,0.00026481837,0.00027322688,0.00040357205],"domain_scores_gemma":[0.9976045,0.00008903888,0.000161022,0.0017722634,0.00021292815,0.0001602454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028394777,0.00030466853,0.00046906914,0.00016007897,0.00010360344,0.00009063743,0.00097096845,0.00016628875,0.000010719814],"category_scores_gemma":[0.00005678205,0.0003445031,0.00008710898,0.00056186167,0.00047656984,0.00026392954,0.00015361804,0.00039911695,0.00003420453],"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.0007685782,0.0025171787,0.029287875,0.00056018005,0.00077941705,0.0001029269,0.004745638,0.08299743,0.6987567,0.06668551,0.023457132,0.08934142],"study_design_scores_gemma":[0.0020960574,0.00019448601,0.014188431,0.0009968174,0.00009077775,0.000118874384,0.00091312616,0.3796447,0.48279393,0.11458709,0.0030089987,0.0013667212],"about_ca_topic_score_codex":0.002085406,"about_ca_topic_score_gemma":0.008123577,"teacher_disagreement_score":0.29664725,"about_ca_system_score_codex":0.00033550544,"about_ca_system_score_gemma":0.00011281165,"threshold_uncertainty_score":0.9999007},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90748304,0.00016148147,0.08412262,0.00002403471,0.0010249205,0.0008458282,0.00005008392,0.0007522535,0.0055357204],"genre_scores_gemma":[0.9706965,0.0000043411155,0.028568791,0.000050269296,0.00010379433,0.00005086532,0.00045622909,0.000043329037,0.00002585792],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984496,0.00008720691,0.0004067947,0.0003874092,0.00041446683,0.00025447804],"domain_scores_gemma":[0.9990341,0.00006311376,0.00018509114,0.00038622544,0.00025873474,0.00007275351],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010256066,0.00029697377,0.0003193929,0.00018824406,0.0000877771,0.00007770679,0.00016968463,0.00014053423,0.000246169],"category_scores_gemma":[0.000020834164,0.00031209676,0.00007832215,0.00022620076,0.00008695319,0.00055276,0.00006282593,0.00021207353,0.0001588816],"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.0002938018,0.00021458439,0.021726532,0.00013674397,0.0009888546,0.000009889413,0.0014431551,0.032027002,0.8701826,0.013907341,0.0034828738,0.055586662],"study_design_scores_gemma":[0.0016717433,0.00006216197,0.017717,0.00039642965,0.00007760725,0.000018157138,0.00021730045,0.69542617,0.27012917,0.013489913,0.00018126464,0.0006130598],"about_ca_topic_score_codex":0.000049406026,"about_ca_topic_score_gemma":0.000005276919,"teacher_disagreement_score":0.66339916,"about_ca_system_score_codex":0.00017101574,"about_ca_system_score_gemma":0.000020471312,"threshold_uncertainty_score":0.9999331},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03432391,0.0002481845,0.9547539,0.0002306561,0.00025088392,0.00052786374,0.000014666467,0.00034843906,0.009301547],"genre_scores_gemma":[0.94428617,0.000008257427,0.05538049,0.000037064485,0.00006833701,0.0000054314373,0.0000012781991,0.00003888521,0.00017410784],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993045,0.00001325552,0.00023548458,0.000089978275,0.00013160937,0.00022517495],"domain_scores_gemma":[0.99849814,0.00039546477,0.00017371184,0.0008265468,0.000063203275,0.00004291111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024045739,0.00014592898,0.00024400892,0.000030773233,0.00027151636,0.000105159765,0.00048203018,0.00006527106,0.000013270153],"category_scores_gemma":[0.00021109037,0.00010872861,0.00010423397,0.000022790486,0.00010359248,0.000088794615,0.000096240154,0.00009407281,0.0000029172747],"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.00010302387,0.00015122378,0.00024736847,0.0012210172,0.0008390599,0.000017071523,0.012006496,0.011872545,0.41096565,0.2916761,0.08774767,0.18315278],"study_design_scores_gemma":[0.00038340501,0.00004672305,0.00005773924,0.0006821774,0.00007532276,0.000021349486,0.0007605916,0.2634937,0.3746607,0.35588202,0.0036695108,0.00026680445],"about_ca_topic_score_codex":0.000024156141,"about_ca_topic_score_gemma":0.000016656913,"teacher_disagreement_score":0.90996224,"about_ca_system_score_codex":0.000011626474,"about_ca_system_score_gemma":0.000018727076,"threshold_uncertainty_score":0.44338238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004795437,0.00012518864,0.9913116,0.000032867465,0.0010620083,0.0004978868,0.000009520082,0.0010187207,0.0011467866],"genre_scores_gemma":[0.98942214,0.0000019252907,0.009798178,0.00012662789,0.0003752537,0.00011044994,0.00006283568,0.00003463717,0.00006797578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884695,0.000015768288,0.0005004898,0.0001267183,0.00021782545,0.0002922563],"domain_scores_gemma":[0.99906695,0.000035923316,0.00016285811,0.00015762287,0.00051995396,0.000056665544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013761812,0.00020820549,0.0002103489,0.00019679366,0.00023415136,0.000423465,0.0001523936,0.0001383858,0.0000055330956],"category_scores_gemma":[0.000037261445,0.00019528205,0.000039283856,0.000282838,0.00006779923,0.0016766335,0.000024235365,0.00010715519,0.000021655907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017936043,0.000005474142,0.0000047059825,0.00022357085,0.000013206403,2.905116e-7,0.0011060387,0.95920366,0.00018891563,0.00005139583,0.0019739969,0.037210792],"study_design_scores_gemma":[0.00029129762,0.00006778437,0.000008652339,0.00031226815,0.00001586979,0.000027368884,0.0005646521,0.99408185,0.0023824794,0.00002031792,0.0019890808,0.00023838601],"about_ca_topic_score_codex":0.000010114789,"about_ca_topic_score_gemma":0.0000011198229,"teacher_disagreement_score":0.98462665,"about_ca_system_score_codex":0.0000737277,"about_ca_system_score_gemma":0.00002780441,"threshold_uncertainty_score":0.79633707},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059376457,0.0003723305,0.9909188,0.00041690993,0.0001543053,0.00020134031,0.0000043053874,0.0016254989,0.00036886797],"genre_scores_gemma":[0.97926146,0.000023386132,0.019997435,0.00033872062,0.00022738925,0.000026113265,0.0000026448906,0.00007853243,0.000044313834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991133,0.000022399745,0.00016175587,0.00025884155,0.00015940257,0.00028430292],"domain_scores_gemma":[0.9996205,0.00006318264,0.000042203093,0.000085216205,0.00007959116,0.0001093288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068290756,0.00022223189,0.00021021473,0.00010626828,0.00034590747,0.0001223312,0.000118378855,0.00012695752,0.000017867966],"category_scores_gemma":[0.000003687546,0.00023135677,0.00012885987,0.00030058078,0.00003316017,0.00021757104,8.8943483e-7,0.00053468475,0.00000859288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000919203,0.00002509335,0.0000028000845,0.0001610453,0.00005724023,0.000009921945,0.00084121205,0.6365547,0.11384796,0.000006678826,0.0013554017,0.247046],"study_design_scores_gemma":[0.00032472,0.0001617339,0.0000028356985,0.0002627335,0.00007036431,0.000015433885,0.00017222288,0.589714,0.403816,0.00022103325,0.0048934314,0.0003454745],"about_ca_topic_score_codex":0.0000016145025,"about_ca_topic_score_gemma":0.0000013916358,"teacher_disagreement_score":0.9733238,"about_ca_system_score_codex":0.00003893034,"about_ca_system_score_gemma":0.000022959646,"threshold_uncertainty_score":0.94344556},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003140606,0.000016351183,0.9780384,0.00018072285,0.00066325226,0.00008630213,0.000075634765,0.00021875957,0.017580029],"genre_scores_gemma":[0.90113807,0.00009081651,0.09822306,0.00017749883,0.00024129865,0.0000059365334,0.000026122518,0.000017444481,0.00007972698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905264,0.000036653462,0.00029446202,0.00021168827,0.00021528319,0.00018924047],"domain_scores_gemma":[0.9992926,0.00015850093,0.000048392507,0.0001386215,0.00029240362,0.000069472255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016633939,0.00015728947,0.00013789989,0.00011997744,0.00009470388,0.0001308966,0.00018675254,0.000056803157,0.00050733914],"category_scores_gemma":[0.00009282116,0.00015815951,0.000024366942,0.000086919055,0.00013206092,0.00007497558,0.000035840534,0.00015524987,0.00014476283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050678736,0.00003158859,0.000021276497,0.000005882836,0.00005499803,0.000020597752,0.0004544008,0.0002990568,0.019181846,0.43725523,0.001110046,0.5415144],"study_design_scores_gemma":[0.000021121514,0.00012246403,0.00008122988,0.00006903274,0.000011365339,0.0000134816755,0.0002132214,0.77330416,0.09063496,0.13378547,0.0015415763,0.00020191933],"about_ca_topic_score_codex":0.00006445742,"about_ca_topic_score_gemma":0.00008661671,"teacher_disagreement_score":0.8979975,"about_ca_system_score_codex":0.000029010876,"about_ca_system_score_gemma":0.000014014366,"threshold_uncertainty_score":0.6449558},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.119986914,0.000036718015,0.878489,0.000011838407,0.00007201719,0.000120512304,0.0010412835,0.00016144397,0.0000802517],"genre_scores_gemma":[0.76118857,0.000011803257,0.22545658,0.000016235028,0.00001627081,0.000004807013,0.013268754,0.000016909633,0.000020063557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879956,0.000035960093,0.0002877476,0.00033095694,0.00038329896,0.00016246807],"domain_scores_gemma":[0.99901557,0.0002916096,0.0000780105,0.00046057446,0.00010319582,0.000051053616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012498362,0.00016296541,0.00025722708,0.0003591035,0.000047199614,0.00005694746,0.00018998189,0.000050627914,0.00016227979],"category_scores_gemma":[0.000048113216,0.0001463125,0.00002922155,0.0006909356,0.000033183594,0.00023722988,0.00007787741,0.00013450332,0.00003344844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023109387,0.000030214434,0.068358235,0.000012920798,0.00028882717,0.000010781939,0.000027505164,0.92327493,0.000030577703,0.0006583242,0.0053741126,0.0019104426],"study_design_scores_gemma":[0.00024519968,0.000017999164,0.18303606,0.000034346827,0.00017449474,0.0000025174143,0.0000078638395,0.81495845,0.000031277326,0.0011415319,0.00020444221,0.00014579463],"about_ca_topic_score_codex":0.00015654617,"about_ca_topic_score_gemma":0.00029759627,"teacher_disagreement_score":0.6530324,"about_ca_system_score_codex":0.00005877602,"about_ca_system_score_gemma":0.000035150148,"threshold_uncertainty_score":0.596645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71686935,0.000092809256,0.26404274,0.00006162572,0.0001540023,0.00028608512,0.000025168669,0.0008473508,0.017620886],"genre_scores_gemma":[0.99170226,0.00003793859,0.008085487,0.0000421768,0.00005816612,0.0000044371463,0.00001899088,0.000007528277,0.000043002838],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996009,0.0000111102,0.00015384075,0.00007685484,0.00006918456,0.000088128465],"domain_scores_gemma":[0.9998022,0.000022851624,0.000023261782,0.00010660439,0.000027372673,0.000017711598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029424533,0.00007073078,0.00010633232,0.00006322818,0.000020514342,0.000013241246,0.00004496379,0.000031134456,0.00027414353],"category_scores_gemma":[0.0000018062727,0.00006721236,0.000045370998,0.000081442464,0.0000070367414,0.00009131783,0.000005558561,0.000047459253,0.0000065119884],"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.00008671011,0.00006837777,0.00069668464,0.0000059467825,0.00014452735,0.0000060910274,0.00051247486,0.012599118,0.62159896,0.0005365741,0.038510047,0.3252345],"study_design_scores_gemma":[0.0008315925,0.00012358573,0.0064307186,0.000029469002,0.00003309231,0.0000028278998,0.00032389595,0.011475102,0.9755705,0.0040394156,0.000975147,0.00016464575],"about_ca_topic_score_codex":0.00032076502,"about_ca_topic_score_gemma":0.00008493629,"teacher_disagreement_score":0.35397157,"about_ca_system_score_codex":0.000017119006,"about_ca_system_score_gemma":0.000008423798,"threshold_uncertainty_score":0.30016795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5231597,0.036591426,0.15655607,0.21675731,0.00039650142,0.014511831,0.00023012857,0.004952518,0.046844546],"genre_scores_gemma":[0.9942677,0.0030365544,0.00027455113,0.00012462496,0.0002529837,0.0002478342,0.0000024685608,0.000024252773,0.001769049],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99942344,0.000044263328,0.00013922896,0.00014463862,0.00009193916,0.0001564883],"domain_scores_gemma":[0.9991033,0.00038400502,0.000032438922,0.00038117942,0.000057221063,0.00004184049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013234942,0.00011203793,0.00010427396,0.000021529237,0.00044701181,0.00007054989,0.00021861191,0.000052180192,0.0000037970124],"category_scores_gemma":[0.00005512954,0.000029664503,0.000026002526,0.00020158986,0.0002044653,0.0000546156,0.00008063721,0.00013526127,0.000019462817],"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.00011218306,0.00007953345,0.0018424115,0.000080411715,0.00054557703,0.0000018828335,0.0012471735,0.000039346123,0.056566656,0.20211378,0.09477076,0.6426003],"study_design_scores_gemma":[0.00063668523,0.000035779532,0.0043539675,0.000060577393,0.000089045156,0.000013506805,0.00009191136,0.009189363,0.021054814,0.01018348,0.95402634,0.00026452838],"about_ca_topic_score_codex":0.000018945275,"about_ca_topic_score_gemma":0.000004421273,"teacher_disagreement_score":0.8592556,"about_ca_system_score_codex":0.000008027963,"about_ca_system_score_gemma":0.000009951782,"threshold_uncertainty_score":0.34380987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85795003,0.000026331034,0.024113212,0.00079240464,0.0010065605,0.00021240358,0.0000034755114,0.00026560208,0.11562995],"genre_scores_gemma":[0.9992937,0.000014557148,0.0003450987,0.000037932652,0.00010520465,0.000011999873,0.0000045104944,0.000010770184,0.00017626652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993836,0.00006588502,0.00016988885,0.00011918365,0.00016025316,0.00010115314],"domain_scores_gemma":[0.9995311,0.00009304995,0.000059134316,0.00015069771,0.0001483278,0.000017722288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053942,0.00007837459,0.000080358855,0.000096235584,0.000061339124,0.000034106386,0.0002449695,0.00003798195,0.00017861961],"category_scores_gemma":[0.00011757048,0.000065673245,0.000041087693,0.0001621212,0.00012569186,0.000083379484,0.000045355817,0.00024147046,0.000008036674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041138217,0.000056574365,0.0628048,0.0000039202473,0.00009133478,0.000006579926,0.0043749935,0.87291753,0.0076997895,0.032066558,0.00055651413,0.019380275],"study_design_scores_gemma":[0.00010230515,0.000027048402,0.05571064,0.00005937039,0.0000034076565,0.000002236458,0.00033083124,0.9335391,0.007282823,0.0027753697,0.00009930532,0.00006757713],"about_ca_topic_score_codex":0.00010603569,"about_ca_topic_score_gemma":0.000120282115,"teacher_disagreement_score":0.1413436,"about_ca_system_score_codex":0.000030385045,"about_ca_system_score_gemma":0.0000091424145,"threshold_uncertainty_score":0.26780772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9005697,0.000072597824,0.094952546,0.00002440291,0.0006606484,0.0005237445,0.000002612511,0.0005803945,0.0026133659],"genre_scores_gemma":[0.97461367,0.000001556243,0.024948394,0.000031800086,0.00005857724,0.00006809779,0.000022079914,0.00004531175,0.00021049676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992242,0.000016475047,0.00024895227,0.00017990671,0.00012881462,0.00020164039],"domain_scores_gemma":[0.99957067,0.00007973791,0.00006223037,0.00021772941,0.000042177566,0.00002747179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000181662,0.00015337933,0.00021915478,0.00011834035,0.000032628253,0.000024205352,0.00007884133,0.00009650573,0.00008850787],"category_scores_gemma":[0.00003135416,0.00015003484,0.00005588953,0.0001462532,0.000009474263,0.00015049466,0.000020570293,0.00013733411,0.000102441816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038021553,0.0005094023,0.0026229068,0.0013440337,0.00031810883,0.000011849657,0.0035115804,0.37536398,0.4270121,0.033670697,0.030198427,0.12505673],"study_design_scores_gemma":[0.00078145834,0.00010252171,0.0008425858,0.0003524474,0.000028625273,0.00002731701,0.00020214457,0.8683017,0.113682434,0.012998977,0.0022372915,0.00044248538],"about_ca_topic_score_codex":0.000014962674,"about_ca_topic_score_gemma":0.0000068129366,"teacher_disagreement_score":0.49293774,"about_ca_system_score_codex":0.00004458399,"about_ca_system_score_gemma":0.000008723,"threshold_uncertainty_score":0.61182433},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028106626,0.00017222272,0.9679072,0.0001814588,0.00046028456,0.001265315,0.000045055313,0.0008010371,0.0010608089],"genre_scores_gemma":[0.49678499,0.000114402785,0.5014225,0.00010123073,0.00042658762,0.00026802864,0.00015362048,0.0001383903,0.0005901957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874526,0.000025375934,0.0002757523,0.00037427773,0.00023353122,0.00034578107],"domain_scores_gemma":[0.9994149,0.00008143769,0.00006330441,0.00027173333,0.000081091275,0.000087512766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021343533,0.00026368067,0.00025336051,0.00012211992,0.00009701595,0.000101526064,0.00013085469,0.00013312325,0.000022938566],"category_scores_gemma":[0.000011176068,0.00025118992,0.00008276152,0.000101685386,0.00004444455,0.00021391595,0.00003529374,0.00015511026,0.00003410923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037442334,0.00018951867,0.00078453025,0.00047019424,0.00051183987,0.000016601252,0.0010614118,0.63208026,0.25464782,0.0058697453,0.0076995254,0.09629414],"study_design_scores_gemma":[0.00047189745,0.00033414387,0.00036486,0.00008989916,0.000029020837,0.000018130588,0.000041791183,0.9544729,0.039533794,0.0012337673,0.0030206363,0.00038918684],"about_ca_topic_score_codex":0.0000063839693,"about_ca_topic_score_gemma":2.2711095e-7,"teacher_disagreement_score":0.46867836,"about_ca_system_score_codex":0.0000619167,"about_ca_system_score_gemma":0.000019836123,"threshold_uncertainty_score":0.99999404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6009493,0.05048188,0.05901317,0.0020421804,0.0002449172,0.0036738396,0.00007741712,0.0038513876,0.27966595],"genre_scores_gemma":[0.9720669,0.0007864017,0.026637238,0.000050017,0.0000074237964,0.0000627629,0.000040083167,0.000040792365,0.00030841242],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991613,0.00006208668,0.00037117812,0.000118236334,0.00012945749,0.00015773575],"domain_scores_gemma":[0.9978535,0.0004540904,0.0000892373,0.0015128864,0.000054745266,0.000035528486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019775926,0.00017738604,0.00033186443,0.00013153972,0.000061402316,0.00006660616,0.00072361843,0.000071743874,0.000023178014],"category_scores_gemma":[0.000027013712,0.00015294194,0.000038960836,0.0002752085,0.00008774799,0.00021034232,0.000134351,0.00021382459,0.000040827825],"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.001744759,0.006862688,0.1476972,0.0045733918,0.00307304,0.00013253848,0.050874926,0.015377655,0.07463192,0.14920752,0.52396953,0.021854848],"study_design_scores_gemma":[0.013537748,0.00054819055,0.0005761197,0.0052187336,0.00015747597,0.00010424223,0.008747345,0.5973372,0.08299375,0.02682505,0.2606291,0.0033250903],"about_ca_topic_score_codex":0.00002076958,"about_ca_topic_score_gemma":0.000014756348,"teacher_disagreement_score":0.5819595,"about_ca_system_score_codex":0.000039419658,"about_ca_system_score_gemma":0.00003429322,"threshold_uncertainty_score":0.6236791},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8957005,0.000385602,0.09973631,0.0016235883,0.0002605476,0.000538414,0.0000082107745,0.0010039296,0.00074290356],"genre_scores_gemma":[0.9948285,0.00004760243,0.0028315848,0.0019497575,0.00012867873,0.00009422769,0.000021021755,0.00006349035,0.00003511762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888605,0.000014926125,0.00019310825,0.00020785053,0.00014397381,0.0005541005],"domain_scores_gemma":[0.9995155,0.000086794964,0.000040503062,0.00025786017,0.000039918068,0.00005944174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006199987,0.0001978814,0.0001765233,0.00015480681,0.00009204847,0.00012931951,0.00020087034,0.000083014806,0.000022765782],"category_scores_gemma":[0.000017759141,0.00019957643,0.00008645244,0.0001771662,0.000029168174,0.00010811431,0.000020267398,0.00032131354,0.000017822531],"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.000018130855,0.000015618614,0.000011412218,0.000011408951,0.00007575261,0.0000028511447,0.000038581402,0.0010528709,0.9616651,0.0031312539,0.02773639,0.0062406296],"study_design_scores_gemma":[0.0025519293,0.0011471584,0.0011488558,0.00023320553,0.00012180858,0.00006560333,0.0000902315,0.25031778,0.64067495,0.026518567,0.074889615,0.0022403097],"about_ca_topic_score_codex":0.000017897732,"about_ca_topic_score_gemma":0.00000640868,"teacher_disagreement_score":0.32099015,"about_ca_system_score_codex":0.00017281898,"about_ca_system_score_gemma":0.00002701248,"threshold_uncertainty_score":0.8138491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117355315,0.00031951763,0.98167527,0.00016829063,0.0001527591,0.0025731656,0.0000015001249,0.0021338367,0.001240128],"genre_scores_gemma":[0.15569396,0.0000046788855,0.84251213,0.000067969435,0.00010446673,0.0013452799,0.000011154721,0.0000965716,0.000163793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981271,0.00007484083,0.0005585021,0.00035680307,0.00018577468,0.0006969985],"domain_scores_gemma":[0.9985779,0.00054478843,0.00008887814,0.0004222436,0.00019261069,0.00017358945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000588803,0.00036060237,0.0006114008,0.00011510987,0.00017595933,0.00048499694,0.00026491354,0.00018762282,0.000107249034],"category_scores_gemma":[0.00030521041,0.0003169203,0.0002090611,0.00021943005,0.00013819893,0.0003031024,0.000086926164,0.00027751215,0.000056435656],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015541817,0.0001307675,0.000018356568,0.0005191463,0.0002516009,0.0000067825536,0.0012619648,0.00006991094,0.08173627,0.028343124,0.0016134786,0.88603306],"study_design_scores_gemma":[0.0011230162,0.00025235745,0.000021859041,0.00082045264,0.00017001682,0.00005833486,0.000649845,0.56958055,0.20829746,0.16543913,0.052460562,0.0011264466],"about_ca_topic_score_codex":0.0000058181745,"about_ca_topic_score_gemma":3.6032264e-7,"teacher_disagreement_score":0.8849066,"about_ca_system_score_codex":0.00006321763,"about_ca_system_score_gemma":0.000011744994,"threshold_uncertainty_score":0.9999283},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94637877,0.0004916504,0.050218023,0.00003537535,0.00026108333,0.00041796436,0.000027505142,0.00077513716,0.0013944777],"genre_scores_gemma":[0.9987002,0.0000650702,0.00055761874,0.0002305008,0.00022485436,0.000025563737,0.00008272125,0.000106912645,0.000006566063],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976639,0.00006457923,0.000679381,0.0004988512,0.0005695286,0.00052375917],"domain_scores_gemma":[0.99884456,0.00012296802,0.0003122438,0.00030949825,0.00028929938,0.00012139797],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029068041,0.00042098857,0.0004843322,0.00026551436,0.00014140598,0.00012934477,0.00025160165,0.0002713718,0.000026790816],"category_scores_gemma":[0.000014305757,0.00046052405,0.00017903247,0.00045887064,0.000092613736,0.00057305815,0.000069996306,0.00040528298,0.000091238435],"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.00006110493,0.00008434668,0.00008835942,0.00024409774,0.000041185955,0.000010269397,0.0002352644,0.04280116,0.9131985,0.0000121540415,0.0016847748,0.04153879],"study_design_scores_gemma":[0.00038809676,0.00018729856,0.00020335156,0.0007016205,0.000063442734,0.000036709636,0.00006584174,0.112212904,0.88480324,0.0006900282,0.0001804316,0.0004670365],"about_ca_topic_score_codex":0.000005923216,"about_ca_topic_score_gemma":0.0000032855528,"teacher_disagreement_score":0.06941175,"about_ca_system_score_codex":0.00013924547,"about_ca_system_score_gemma":0.000099006254,"threshold_uncertainty_score":0.99978465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22207153,0.00013357431,0.7758675,0.00003709839,0.00020961785,0.00012756177,0.000010787649,0.00060368754,0.0009386315],"genre_scores_gemma":[0.942399,0.00021598578,0.0570368,0.0000051744014,0.00003925329,0.000009698196,0.000008642385,0.000022625482,0.0002628173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994785,0.000013108147,0.00018125918,0.00012538614,0.00007556132,0.00012614843],"domain_scores_gemma":[0.9996485,0.00011382533,0.000039767947,0.000119928074,0.000051060433,0.000026924767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005776401,0.000093260234,0.00012729279,0.00019630416,0.000032149313,0.0000070951155,0.00006334463,0.000060923256,0.000040843213],"category_scores_gemma":[0.00003683518,0.00007084482,0.000059077352,0.00011920597,0.000027243412,0.00011115134,0.000016228812,0.000064177635,0.0000023716027],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001768069,0.00002956717,0.0012046013,0.000021323014,0.000047654907,0.0000012997024,0.0000073295673,0.0013378657,0.2828513,0.00014538699,0.00032746186,0.7140085],"study_design_scores_gemma":[0.0013278482,0.0004843048,0.020815978,0.00044450097,0.000087622924,0.00017294598,0.00014757426,0.5544489,0.41281945,0.006801376,0.0017873113,0.00066219183],"about_ca_topic_score_codex":0.000014536686,"about_ca_topic_score_gemma":0.000015034534,"teacher_disagreement_score":0.7203275,"about_ca_system_score_codex":0.00005456382,"about_ca_system_score_gemma":0.0000044504436,"threshold_uncertainty_score":0.2888968},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034574125,0.0007173594,0.9641254,0.0001571092,0.00014810696,0.000121299345,0.00010197783,0.000038339058,0.000016293712],"genre_scores_gemma":[0.87615085,0.00023385315,0.12344654,0.000018826262,0.00008609584,0.0000032815583,0.000025147985,0.000021932225,0.000013493997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.000013905778,0.00025968076,0.00007733257,0.00017187932,0.00021587737],"domain_scores_gemma":[0.9992914,0.00008063841,0.00022000601,0.00011142121,0.0002464884,0.000050026258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014567356,0.00011393254,0.0001793829,0.00007050805,0.00015438943,0.00006243038,0.0000998036,0.00005345014,0.0000041029343],"category_scores_gemma":[0.00004712166,0.00010950045,0.000028511506,0.000013170622,0.00005207506,0.00029663165,0.00000869513,0.00018539454,4.809094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026355466,0.000046793717,0.0000062058202,0.00007577834,0.00018894047,0.00005464749,0.00033420583,0.7453146,0.0053259195,0.19772886,0.008392563,0.042267915],"study_design_scores_gemma":[0.00051837,0.00025963923,0.00042169643,0.00008511023,0.00006519172,0.00008650684,0.000008454728,0.75279313,0.0018998757,0.24368969,0.00006837745,0.00010396312],"about_ca_topic_score_codex":0.000007960284,"about_ca_topic_score_gemma":0.000009122398,"teacher_disagreement_score":0.8415767,"about_ca_system_score_codex":0.00010359312,"about_ca_system_score_gemma":0.0001230328,"threshold_uncertainty_score":0.44652987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45473614,0.000010516431,0.53354824,0.00001365544,0.0001825978,0.00016339862,0.0000016155951,0.0009920615,0.01035179],"genre_scores_gemma":[0.99445635,0.000026963213,0.005359504,0.000050675662,0.00003349264,3.993569e-7,0.000009751955,0.000019155876,0.000043706536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931145,0.00003562435,0.00018097699,0.00016893308,0.000049600407,0.00025342492],"domain_scores_gemma":[0.99937826,0.00004441154,0.00007558966,0.00030349422,0.00011493246,0.000083292434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051262374,0.00017646555,0.0001743836,0.00018136342,0.00014317094,0.0001047136,0.00013650526,0.000103857965,0.000051703882],"category_scores_gemma":[0.000010532272,0.00020617474,0.00006610152,0.00029140673,0.00006860261,0.001333892,0.000050721803,0.00017513233,0.00012434868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040897263,0.000039291936,0.0017052601,0.00014319876,0.00028470965,0.00010804999,0.00059633533,0.75300103,0.112510026,0.0069564357,0.0042321985,0.12038257],"study_design_scores_gemma":[0.00026044602,0.000009691985,0.00055395963,0.00007013541,0.000025718244,0.000030235002,0.00017273637,0.96162313,0.029925225,0.0067531466,0.00031144437,0.00026412218],"about_ca_topic_score_codex":0.00016591752,"about_ca_topic_score_gemma":0.000008298804,"teacher_disagreement_score":0.5397202,"about_ca_system_score_codex":0.00009064908,"about_ca_system_score_gemma":0.0000102266995,"threshold_uncertainty_score":0.8407562},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33475456,0.000027404256,0.66340417,0.0000062513996,0.00003906385,0.00007261921,0.0000031842528,0.00033329963,0.0013594611],"genre_scores_gemma":[0.92786914,0.0000014567898,0.07204996,0.000035666195,0.0000061937435,0.0000016660855,0.000020263335,0.000013307143,0.0000023219322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927866,0.000038070368,0.0002556052,0.00015763866,0.00012512172,0.00014492036],"domain_scores_gemma":[0.9993902,0.000053191696,0.000049861992,0.00036477897,0.000109570356,0.00003243455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010490361,0.000117516705,0.0002609192,0.0005148485,0.000021974352,0.0000072191147,0.000090308014,0.000078678524,0.000037562528],"category_scores_gemma":[0.000013465667,0.00012440531,0.00009719354,0.00080223073,0.00004016169,0.00004581744,0.000008565082,0.00008332276,0.0000028457748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006812127,0.00019416766,0.050680064,0.000040326508,0.00041704468,0.000018655119,0.00028295832,0.7626358,0.18084538,0.00046131786,0.0002945558,0.0040615923],"study_design_scores_gemma":[0.00012395642,0.0000070544834,0.06820479,0.000019618938,0.00009634094,1.2287228e-7,0.000013163038,0.66476524,0.26660752,0.00006316483,0.000007049728,0.00009199063],"about_ca_topic_score_codex":0.0013577457,"about_ca_topic_score_gemma":0.00027305604,"teacher_disagreement_score":0.5931146,"about_ca_system_score_codex":0.00007216512,"about_ca_system_score_gemma":0.000020530142,"threshold_uncertainty_score":0.50731015},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796493,0.00009493292,0.015457807,0.000053510812,0.0001297641,0.00014346413,7.8154966e-7,0.00016115559,0.0043092836],"genre_scores_gemma":[0.9725074,0.000021975431,0.02739904,0.0000010087755,0.000022122294,0.000004572175,1.617431e-7,0.000009871868,0.00003380785],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928933,0.0000056149033,0.00014866491,0.00011984496,0.00029386228,0.00014269559],"domain_scores_gemma":[0.99922,0.00000596442,0.00012034284,0.0005342743,0.000083300605,0.000036093927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030305656,0.0000959138,0.0001667757,0.00006810691,0.00034845463,0.00011237763,0.00038836285,0.00002420328,0.0000026561117],"category_scores_gemma":[0.000051996547,0.00006135574,0.000022824659,0.00010939798,0.0006055501,0.0003983489,0.000060329643,0.00006374352,0.0000010645127],"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.000055316683,0.00017650642,0.00013828799,0.00068327563,0.000046401332,0.000008133877,0.0025270034,0.0645977,0.9193476,0.009066919,0.00029156636,0.0030612878],"study_design_scores_gemma":[0.00021648302,0.000027644668,0.00093913876,0.00060993293,0.000020057985,0.00003794921,0.00020586587,0.18996367,0.8050288,0.0027881868,0.0000069442067,0.00015534533],"about_ca_topic_score_codex":0.000014002849,"about_ca_topic_score_gemma":0.0000013465293,"teacher_disagreement_score":0.12536596,"about_ca_system_score_codex":0.000019788851,"about_ca_system_score_gemma":0.000031737058,"threshold_uncertainty_score":0.26800665},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31285036,0.00011891305,0.68490744,0.0001384942,0.000078356126,0.001400814,0.000011499128,0.00016212655,0.00033198445],"genre_scores_gemma":[0.4979391,0.000079692865,0.50146437,0.000005297553,0.000022974347,0.0003681262,0.000010689096,0.00003850385,0.00007121134],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852765,0.00012474779,0.0004145132,0.00022243505,0.00032153202,0.00038910063],"domain_scores_gemma":[0.9977261,0.00034667033,0.000067308785,0.0009975879,0.0007689403,0.00009342362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291945,0.00018028307,0.00039793435,0.00017608017,0.0006552477,0.00034728638,0.00048822528,0.000087385066,0.000009653707],"category_scores_gemma":[0.00068672426,0.000151499,0.00007746388,0.00014463803,0.00037044505,0.00020208397,0.00010286621,0.00021475033,0.0000065908393],"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.000041945077,0.00015106506,0.000017002203,0.00048569276,0.00020508321,0.000006486329,0.0014401717,0.012988582,0.9404802,0.035345618,0.00051570946,0.008322493],"study_design_scores_gemma":[0.00037881927,0.000101643964,0.000008565188,0.0001630783,0.00002128444,0.00000462629,0.00008561993,0.48850212,0.5074982,0.00279637,0.00031360472,0.00012607721],"about_ca_topic_score_codex":0.000031005733,"about_ca_topic_score_gemma":0.000050665418,"teacher_disagreement_score":0.47551352,"about_ca_system_score_codex":0.00003982751,"about_ca_system_score_gemma":0.00007727637,"threshold_uncertainty_score":0.617795},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030914279,0.0000028443555,0.96004605,0.00004240599,0.0005756443,0.00020816871,0.00000627708,0.000592553,0.0076117977],"genre_scores_gemma":[0.99596167,0.000005952509,0.0035284061,0.00025385883,0.00003888868,0.000038509228,0.000004917318,0.000014716849,0.00015305977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939007,0.000031459953,0.0002436835,0.000069638896,0.00011453482,0.00015058996],"domain_scores_gemma":[0.9995919,0.00003117372,0.000024705567,0.00022251121,0.000082312,0.000047381505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016479126,0.000113263006,0.00009470581,0.00040834412,0.0000760916,0.00003933056,0.000100954305,0.000083874314,0.00010629145],"category_scores_gemma":[0.000006228701,0.000119384495,0.0000311711,0.00038555704,0.000035012796,0.00059914356,8.019409e-7,0.00012400188,0.00017259427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000582608,0.00001854667,8.0933904e-7,0.000009542872,0.000010887106,4.8359703e-7,0.0009979082,0.94046664,0.0010372321,0.0034132283,0.0006327404,0.053353716],"study_design_scores_gemma":[0.00045797505,0.00013778206,0.00013217545,0.00017368786,0.000016994267,0.000010554838,0.00029303684,0.59548825,0.39204115,0.0029795903,0.007872714,0.00039609533],"about_ca_topic_score_codex":0.000004375497,"about_ca_topic_score_gemma":0.00002093961,"teacher_disagreement_score":0.9650474,"about_ca_system_score_codex":0.00008039735,"about_ca_system_score_gemma":0.0000123079335,"threshold_uncertainty_score":0.48683584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3803071,0.00009209144,0.6138133,0.00021581318,0.00014291401,0.00021579287,3.47499e-7,0.00044273454,0.0047699185],"genre_scores_gemma":[0.95378023,0.000014705893,0.04599787,0.00011647035,0.000035006004,0.0000069877324,0.0000026485525,0.000015703386,0.000030376721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954796,0.000018312418,0.00012880242,0.00010753625,0.00007661838,0.000120756675],"domain_scores_gemma":[0.99977624,0.00004242048,0.000017356593,0.00012389051,0.000021041431,0.000019044555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014698373,0.00008223382,0.00009622952,0.000057717847,0.00004772831,0.000050525738,0.000058553975,0.000039192215,0.000024793217],"category_scores_gemma":[0.0000075621015,0.000061222025,0.000013572803,0.00008099832,0.000018474058,0.0001055197,0.000045540983,0.000093795206,0.0000041970375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037641234,0.000010464119,0.0010007486,0.000022171254,0.000016215907,0.0000030589886,0.0003079062,0.97726476,0.011844507,0.0017234117,0.0018855041,0.0059174583],"study_design_scores_gemma":[0.00014403407,0.000009583738,0.0024820748,0.000090026835,0.000004437731,0.000006629287,0.00002447505,0.97741294,0.017868312,0.0017820733,0.00007384297,0.00010154641],"about_ca_topic_score_codex":0.00007251759,"about_ca_topic_score_gemma":0.000024244537,"teacher_disagreement_score":0.5734731,"about_ca_system_score_codex":0.00001592728,"about_ca_system_score_gemma":0.0000027176447,"threshold_uncertainty_score":0.24965619},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05925926,0.0001631296,0.92955464,0.00006267312,0.000063283405,0.00027219747,0.000007150218,0.00015218035,0.010465458],"genre_scores_gemma":[0.89423555,0.00013408375,0.10501383,0.000008773914,0.00012247775,0.000027973952,0.0000074663717,0.00002914022,0.0004207313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912757,0.000091173075,0.00021945742,0.00012145855,0.0002641126,0.00017620184],"domain_scores_gemma":[0.9990931,0.0001306069,0.0000102849735,0.0003517744,0.0003675313,0.00004666763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087940105,0.000083291765,0.0001391202,0.0001654196,0.00016745263,0.00008166904,0.00013764176,0.000067877256,0.000063419495],"category_scores_gemma":[0.00011712795,0.000077441175,0.000021752465,0.00022765821,0.00022962736,0.00018082595,0.000080386606,0.00012681235,0.000017419226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044246313,0.0003201977,0.00000785832,0.00023156605,0.00020698993,0.000010134067,0.0062230616,0.08357518,0.13381901,0.742843,0.0077384314,0.024980346],"study_design_scores_gemma":[0.00006398656,0.000067006455,0.000002809571,0.00005527499,0.000005725677,0.000008426606,0.00009651262,0.77207845,0.11102705,0.11637161,0.00015273993,0.00007040929],"about_ca_topic_score_codex":0.000012999862,"about_ca_topic_score_gemma":0.00001246963,"teacher_disagreement_score":0.83497626,"about_ca_system_score_codex":0.000019159002,"about_ca_system_score_gemma":0.000023458835,"threshold_uncertainty_score":0.31579596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24181412,0.024837999,0.72759336,0.000057627796,0.0005017436,0.00026253244,0.000004577908,0.0003951397,0.004532882],"genre_scores_gemma":[0.6562718,0.00084445655,0.3426491,0.000046117166,0.000090799265,0.0000029137464,0.0000012615571,0.000028056702,0.00006544824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877036,0.000053084237,0.00055911706,0.00014508201,0.00024211,0.00023023081],"domain_scores_gemma":[0.99917114,0.00003660229,0.00022994306,0.00025554554,0.00021866235,0.00008810844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021935768,0.00018030348,0.0003383525,0.00032632606,0.00006259676,0.000060618968,0.00027993193,0.00006525805,0.00021598],"category_scores_gemma":[0.000041575895,0.00016334723,0.00017025784,0.0005210959,0.00003972635,0.00026430876,0.00003356135,0.00025865348,0.00000381471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034762666,0.0007675679,0.0485442,0.00009351912,0.0008627265,0.0015188275,0.0050958353,0.20470282,0.041854158,0.0003018238,0.009090705,0.6868202],"study_design_scores_gemma":[0.00057640177,0.000111738525,0.025911706,0.00012421152,0.0002809273,0.00008697491,0.000057702066,0.9619528,0.008338984,0.00009095375,0.0022176232,0.00024999643],"about_ca_topic_score_codex":0.000019526982,"about_ca_topic_score_gemma":0.000007910637,"teacher_disagreement_score":0.75724995,"about_ca_system_score_codex":0.000046924364,"about_ca_system_score_gemma":0.000015523721,"threshold_uncertainty_score":0.6661107},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05910425,0.0011023476,0.038475487,0.00070131524,0.0016371068,0.0035903999,0.8463879,0.007608829,0.041392338],"genre_scores_gemma":[0.9367263,0.0000016492589,0.007184092,0.000049921546,0.00014477849,0.00024191866,0.055548064,0.000021431028,0.00008184628],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971235,0.0000024158173,0.00006508289,0.00007311789,0.00005109826,0.00009590913],"domain_scores_gemma":[0.999663,0.00001935958,0.0000317746,0.0002150639,0.000043929052,0.00002689038],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000010189291,0.00006563608,0.00006580539,0.000020998426,0.00013986666,0.000080213074,0.000120727374,0.000037328464,0.0051296866],"category_scores_gemma":[0.00014206019,0.00006808137,0.000040094325,0.000007666748,0.0000036255244,0.00010153631,0.000020172805,0.000032324482,0.00016089005],"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.0000025374131,0.0000045810707,0.0000034492355,0.000027593938,0.000013228966,0.0000031795519,0.000012520972,0.007455748,0.00058374135,0.0005536912,0.9879466,0.0033931218],"study_design_scores_gemma":[0.0003947613,0.0000218633,0.0030289984,0.00050332036,0.00000978482,0.000008215889,0.0000015199013,0.7107785,0.05781689,0.007879491,0.21932167,0.00023502648],"about_ca_topic_score_codex":0.0000016610546,"about_ca_topic_score_gemma":0.0000022171794,"teacher_disagreement_score":0.87762207,"about_ca_system_score_codex":0.000016232523,"about_ca_system_score_gemma":0.000005260754,"threshold_uncertainty_score":0.99577975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063515455,0.00015049295,0.93412113,0.00004944189,0.00012092903,0.000095642594,0.0000073152623,0.00050524354,0.0014343378],"genre_scores_gemma":[0.9957812,0.000025385425,0.004026482,0.000034113866,0.000037084945,0.000013600506,7.551643e-7,0.000029923902,0.00005148251],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994174,0.000010578421,0.0001306755,0.00015988818,0.00012523771,0.0001561677],"domain_scores_gemma":[0.99961793,0.000023267623,0.000044763932,0.00020916678,0.000042785654,0.000062064624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050285867,0.00014398314,0.00013541742,0.00007703258,0.0006524855,0.00027403477,0.0001220068,0.00008372603,0.000017760123],"category_scores_gemma":[0.0000016167372,0.0001451593,0.000032877764,0.000038195893,0.00009198202,0.00038580346,0.0000011325602,0.00021360164,0.0000046409486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026392123,0.000028663133,0.000011401597,0.00008427686,0.000037905702,0.0000153061,0.0003824511,0.26239154,0.05953551,0.000013099198,0.00021606204,0.6772574],"study_design_scores_gemma":[0.0001690301,0.000019902142,0.00013080509,0.00016190873,0.00002788403,0.000018054872,0.000018205525,0.6773648,0.32144016,0.0003069632,0.00018675112,0.00015552859],"about_ca_topic_score_codex":0.000022478833,"about_ca_topic_score_gemma":0.000008042909,"teacher_disagreement_score":0.9322657,"about_ca_system_score_codex":0.000024660028,"about_ca_system_score_gemma":0.000013292954,"threshold_uncertainty_score":0.5919425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012440112,0.0001363835,0.9090809,0.00004721568,0.00017670871,0.0001558572,0.0000118062935,0.00040399606,0.07754698],"genre_scores_gemma":[0.9527329,0.000016533644,0.04099283,0.000027416723,0.00006902243,0.0000013520487,0.000020721243,0.00003399223,0.006105217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994734,0.000016201946,0.00011522276,0.00013430172,0.00009754373,0.00016331286],"domain_scores_gemma":[0.9996264,0.000034366185,0.00004824072,0.00015746619,0.00006186689,0.0000716651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029545821,0.00012606046,0.00017086505,0.00009312736,0.000031395124,0.000015430289,0.00015947082,0.00006739789,0.00048150832],"category_scores_gemma":[0.0000055965165,0.00014352567,0.000063826934,0.00014834116,0.000023939205,0.00012770947,0.00004554001,0.00005389784,0.0000028410286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115507384,0.000037929993,0.000047972193,0.000049864437,0.000111122084,0.000021896725,0.00035103186,0.79957736,0.0032060319,0.007911425,0.004081461,0.18448837],"study_design_scores_gemma":[0.0007874476,0.000103624436,0.000031110547,0.00010935257,0.000054506778,0.000007741187,0.0002840448,0.7193037,0.060587876,0.0028803407,0.21559659,0.0002536244],"about_ca_topic_score_codex":0.000058756345,"about_ca_topic_score_gemma":0.00003474536,"teacher_disagreement_score":0.9402928,"about_ca_system_score_codex":0.00008348553,"about_ca_system_score_gemma":0.000016535603,"threshold_uncertainty_score":0.5852807},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027040027,0.00001844602,0.9625617,0.000040347833,0.000047576108,0.002011883,5.371465e-7,0.0015108796,0.0067685815],"genre_scores_gemma":[0.51242733,0.0000014636721,0.48688245,0.000045911896,0.00002235113,0.00033189062,0.0000030748802,0.000055718723,0.00022979654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907064,0.0000112584485,0.00021263836,0.00019819633,0.00020149302,0.00030578385],"domain_scores_gemma":[0.99949443,0.000056859684,0.000028745524,0.0002822624,0.000040049777,0.0000976308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010450685,0.0001786331,0.000259233,0.000076744465,0.000040309547,0.000117760734,0.00013608803,0.00006364758,0.00010906289],"category_scores_gemma":[0.000024460935,0.00012831137,0.000033161323,0.00022984376,0.000020808204,0.00009192918,0.000039902643,0.00011710827,0.000102129845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012602017,0.0001947019,0.0009867864,0.0012676755,0.00017607167,0.000029731364,0.002371797,0.87640816,0.0036924758,0.0023890336,0.0010262517,0.1113313],"study_design_scores_gemma":[0.00039067405,0.00022931679,0.000004640488,0.0008471286,0.000036691887,0.00003871481,0.00032617545,0.9826768,0.003632992,0.0006241821,0.010728113,0.0004645638],"about_ca_topic_score_codex":0.0000025314139,"about_ca_topic_score_gemma":0.000001797488,"teacher_disagreement_score":0.4853873,"about_ca_system_score_codex":0.0000373744,"about_ca_system_score_gemma":0.00000850667,"threshold_uncertainty_score":0.52323854},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21283329,0.00012498492,0.78634244,0.00014050087,0.000023154023,0.00016189083,0.000026547837,0.000071673814,0.00027554366],"genre_scores_gemma":[0.9887557,0.000021615775,0.011050495,0.000087221946,0.00002997796,0.0000049700957,0.000030036324,0.000013578816,0.00000638993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993307,0.00000813019,0.00015965015,0.00019641756,0.0001388219,0.00016626624],"domain_scores_gemma":[0.9993959,0.00020242702,0.00007695997,0.00024533833,0.000051122104,0.000028215874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000082873856,0.00014785185,0.0002554912,0.00010840078,0.00034962845,0.00013593568,0.0001698812,0.00005382405,0.000005051593],"category_scores_gemma":[0.0000033776441,0.000109415814,0.000067033245,0.00014458598,0.00014260935,0.00007393324,0.000042832795,0.00012498732,5.4304707e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005794202,0.0000066915322,0.00030951196,0.000009580399,0.0006927938,0.000003502952,0.000072357696,0.9708465,0.00032034653,0.0032434147,0.00008422981,0.024353163],"study_design_scores_gemma":[0.00040860876,0.000012588345,0.040821463,0.000015788095,0.0003217163,0.0000040264363,0.00008795043,0.94006383,0.0013694846,0.016610581,0.00012317863,0.00016076028],"about_ca_topic_score_codex":0.00008863386,"about_ca_topic_score_gemma":0.00029101197,"teacher_disagreement_score":0.7759224,"about_ca_system_score_codex":0.00003388054,"about_ca_system_score_gemma":0.000018055327,"threshold_uncertainty_score":0.44618475},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60122424,0.0012662489,0.32045516,0.0070615574,0.0068276688,0.0014991034,0.00016627698,0.0039596474,0.057540067],"genre_scores_gemma":[0.9861126,0.00006128052,0.012475253,0.000035683926,0.0003812852,0.000019583716,0.00019558493,0.000031496114,0.00068721944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992033,0.000028303331,0.0001735124,0.00016727902,0.00023459675,0.00019299268],"domain_scores_gemma":[0.99941343,0.00010241854,0.00008096939,0.00014355703,0.00016447026,0.0000951298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010209037,0.00016888417,0.0001551841,0.00008804061,0.00011051463,0.000059584894,0.0001398931,0.00006457783,0.00023783687],"category_scores_gemma":[0.000098081255,0.00015043415,0.00005647877,0.00007256354,0.000040803137,0.00020883093,0.000023877697,0.00029224207,0.000023310027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057394807,0.0007413255,0.021624701,0.00018429325,0.0032870055,0.00002409789,0.003424534,0.16588624,0.10571345,0.55957335,0.02050932,0.11329223],"study_design_scores_gemma":[0.0054840976,0.0010654965,0.007113613,0.00089671614,0.00020958322,0.00012129498,0.0006365299,0.6449754,0.04597703,0.0050121523,0.28689986,0.001608198],"about_ca_topic_score_codex":0.0000687682,"about_ca_topic_score_gemma":0.000011212482,"teacher_disagreement_score":0.5545612,"about_ca_system_score_codex":0.000077000615,"about_ca_system_score_gemma":0.000041375923,"threshold_uncertainty_score":0.6134526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89382577,0.00005448528,0.10039443,0.000166319,0.00027851318,0.00017712788,0.0003573733,0.00038310027,0.004362896],"genre_scores_gemma":[0.9932924,0.00007165304,0.0005797001,0.000012898504,0.000027618356,6.3989296e-7,0.000005368044,0.0000190074,0.0059906957],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993739,0.00003449662,0.000115837545,0.0001824093,0.00012147721,0.00017186369],"domain_scores_gemma":[0.9994108,0.000056070392,0.000051244042,0.00035982943,0.00006753951,0.00005450509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004984472,0.00013075153,0.00018132376,0.0001712736,0.00008948516,0.000011488248,0.00018718687,0.00007992601,0.00008064877],"category_scores_gemma":[0.000011841371,0.000121070785,0.00009468473,0.0002590533,0.000077438286,0.0006980537,0.00006626779,0.000062025945,0.000034092845],"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.0009915405,0.00053758273,0.004058149,0.00032202236,0.00078046223,0.009354404,0.0014382758,0.0043883263,0.6505891,0.12923485,0.16018583,0.03811947],"study_design_scores_gemma":[0.007663028,0.00042437844,0.02019199,0.0012766722,0.00042499448,0.0015600158,0.0030471894,0.059020374,0.7601281,0.0054493193,0.13785599,0.0029579506],"about_ca_topic_score_codex":0.000056400997,"about_ca_topic_score_gemma":0.000044190005,"teacher_disagreement_score":0.123785526,"about_ca_system_score_codex":0.00010606959,"about_ca_system_score_gemma":0.000022963308,"threshold_uncertainty_score":0.49371234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032557406,0.00013533449,0.9656794,0.00007274253,0.000059905477,0.00023066624,0.0010014137,0.00008392481,0.00017920729],"genre_scores_gemma":[0.9268854,0.00006858791,0.07287215,0.000048778773,0.000064416,0.0000041864882,0.000016260594,0.000020377252,0.000019796973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993191,0.000040040537,0.0002543006,0.00009219249,0.00011423565,0.0001801819],"domain_scores_gemma":[0.9981993,0.0011967401,0.000084848645,0.00015813562,0.00031817443,0.000042791016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017521315,0.00011066651,0.00025699416,0.000032711123,0.00006118999,0.000010402575,0.00011017313,0.000040124356,0.000018116007],"category_scores_gemma":[0.00034648905,0.00008937109,0.000022472188,0.000042950374,0.00051399384,0.000018063522,0.000023320794,0.0000936959,0.000001953188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018739607,0.00038921917,0.000587,0.0011147134,0.0014064653,0.000074856835,0.0041373656,0.044999134,0.048833873,0.4953939,0.10250507,0.29868442],"study_design_scores_gemma":[0.00036525464,0.00057670486,0.00065933773,0.000043418047,0.000057515306,0.0000073174283,0.00009141265,0.93207693,0.017155772,0.045935966,0.0028940442,0.00013629612],"about_ca_topic_score_codex":0.000031092222,"about_ca_topic_score_gemma":0.000011637463,"teacher_disagreement_score":0.89432806,"about_ca_system_score_codex":0.0000036881067,"about_ca_system_score_gemma":0.000011478226,"threshold_uncertainty_score":0.36444473},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66900724,0.000015605212,0.328766,0.000013952185,0.000034384822,0.00016969143,0.0000054416737,0.00016729657,0.001820391],"genre_scores_gemma":[0.99138916,0.000014192176,0.008202466,0.000053730535,0.000018899786,0.0000014319459,0.000002820076,0.00003094951,0.00028633326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993449,0.000025833926,0.00012517099,0.00021134136,0.00005287841,0.00023986831],"domain_scores_gemma":[0.9992213,0.00013489772,0.00007004597,0.0003550766,0.00013716515,0.000081493774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001386685,0.00015935319,0.00019395082,0.000051585772,0.000063382635,0.00002608346,0.00026472026,0.00006938724,0.000004036661],"category_scores_gemma":[0.000024107996,0.00013375051,0.00008391193,0.00020691902,0.000116109295,0.00012201635,0.00004412476,0.00011778035,0.000006732322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008466203,0.000025789928,0.0007315106,0.000019568422,0.00008469897,0.000016911996,0.00020592629,0.99363196,0.0009185826,0.0031227162,0.0009659317,0.00019173903],"study_design_scores_gemma":[0.0005245719,0.00006045289,0.000028967932,0.00008414841,0.00009283583,0.0000054308507,0.00026293044,0.9696128,0.01676761,0.012108887,0.00023358002,0.00021778618],"about_ca_topic_score_codex":0.000070523434,"about_ca_topic_score_gemma":0.000027025304,"teacher_disagreement_score":0.32238194,"about_ca_system_score_codex":0.00004589934,"about_ca_system_score_gemma":0.000036807432,"threshold_uncertainty_score":0.54541874},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93856084,0.000116822404,0.021885073,0.00025617986,0.00029574885,0.000098150296,0.0000027656251,0.0004666147,0.03831783],"genre_scores_gemma":[0.998873,0.00021062623,0.00034257522,0.000039625196,0.00009821677,0.000007794613,0.000024074536,0.000025289997,0.0003787889],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915123,0.000057956622,0.00013187237,0.00023580919,0.0002513874,0.00017172215],"domain_scores_gemma":[0.9994639,0.00008660552,0.00010977895,0.00019274795,0.000090276095,0.000056660996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649899,0.00018598295,0.00014896988,0.000078225974,0.00037122855,0.00035213056,0.00027360214,0.000060201637,0.00010367186],"category_scores_gemma":[0.00013298714,0.00015939605,0.00003069193,0.000018823976,0.0000704089,0.00014596601,0.00008647233,0.00095212494,0.000009312996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037687487,0.00006179783,0.44246075,0.000026513395,0.0002628612,0.00018556046,0.00032332414,0.25271475,0.0011678585,0.034032382,0.00009076093,0.26829654],"study_design_scores_gemma":[0.00038026867,0.0003003916,0.23487572,0.0005608885,0.000014126868,0.000032504762,0.000024068268,0.761909,0.00048610475,0.00057482923,0.0005209588,0.000321134],"about_ca_topic_score_codex":0.00005597006,"about_ca_topic_score_gemma":0.00011184991,"teacher_disagreement_score":0.50919425,"about_ca_system_score_codex":0.000035912308,"about_ca_system_score_gemma":0.0000098907185,"threshold_uncertainty_score":0.6499982},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8744451,0.000094670715,0.123481005,0.000032562453,0.00029080795,0.000977096,0.00008690232,0.00023873524,0.00035314314],"genre_scores_gemma":[0.97413605,0.000033487093,0.0033091751,0.000001721596,0.00001846483,0.0000018568405,0.00033626132,0.00003313446,0.022129849],"study_design_codex":"qualitative","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993832,0.000013044579,0.0001125603,0.00018416058,0.00016893822,0.00013809162],"domain_scores_gemma":[0.99933213,0.000020992584,0.00012057757,0.00026913482,0.00020146812,0.00005566815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026421209,0.00016843659,0.00029554212,0.0003071424,0.00004420575,0.0000064394167,0.00021826915,0.00015394116,0.000028983191],"category_scores_gemma":[0.000003910796,0.00021045358,0.00008913797,0.00021968925,0.000020728403,0.00006584326,0.000027281032,0.00011758001,0.000032112282],"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.0004922695,0.00040986692,0.0003222292,0.0028220136,0.0011535739,0.000014932368,0.442628,0.15753104,0.3521257,0.0045148027,0.0071889963,0.030796604],"study_design_scores_gemma":[0.0025874886,0.001298504,0.011719164,0.0056479154,0.0018474229,0.0000069421512,0.37171784,0.06846444,0.5261583,0.0027078544,0.0038855772,0.0039585712],"about_ca_topic_score_codex":0.002521364,"about_ca_topic_score_gemma":0.0019299925,"teacher_disagreement_score":0.17403258,"about_ca_system_score_codex":0.00009168527,"about_ca_system_score_gemma":0.000023317767,"threshold_uncertainty_score":0.8582048},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5378876,0.000079322264,0.45469385,0.000016509954,0.00064208626,0.0006143256,0.000018314791,0.001018797,0.005029174],"genre_scores_gemma":[0.99104714,0.00009347007,0.005388933,0.000037042977,0.00008241045,0.000001202472,0.000014220652,0.00003524897,0.003300357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930984,0.000013472607,0.00010269617,0.00028310457,0.00004347345,0.0002474418],"domain_scores_gemma":[0.9994279,0.000034035344,0.00003979831,0.0003426468,0.000080510705,0.00007508313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005510538,0.00016566236,0.00017869989,0.00009598278,0.00005484304,0.000013362767,0.00019838194,0.0001062038,0.00006345365],"category_scores_gemma":[0.000004343098,0.00016967139,0.000103839884,0.00018505499,0.000025781868,0.00015678488,0.000056450997,0.000116728195,0.00011988887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004316903,0.0005087083,0.00980094,0.0005245072,0.00097374234,0.00059423345,0.00077587046,0.6399845,0.07855319,0.039628625,0.0758547,0.15236934],"study_design_scores_gemma":[0.0005625081,0.00008739257,0.00013712997,0.00007772607,0.000030390593,0.0000035442224,0.000058982587,0.9483282,0.03561697,0.0010875197,0.013743938,0.00026570202],"about_ca_topic_score_codex":0.000014398518,"about_ca_topic_score_gemma":0.000002609836,"teacher_disagreement_score":0.4531595,"about_ca_system_score_codex":0.00007178215,"about_ca_system_score_gemma":0.000016510776,"threshold_uncertainty_score":0.69189984},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014088328,0.0010861992,0.014781664,0.000013252614,0.00024037341,0.00011702687,0.0000022660888,0.0017448793,0.98187345],"genre_scores_gemma":[0.1742425,0.0016541359,0.0054674787,0.0001246673,0.00033698985,6.561525e-7,0.000057812096,0.00026228107,0.8178535],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943876,0.000004797324,0.0001399085,0.00018620823,0.00010666957,0.00012363218],"domain_scores_gemma":[0.999661,0.000054506847,0.00003114796,0.00018216048,0.000032783148,0.000038357302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002608437,0.00023460221,0.00025313298,0.00010383637,0.00004659743,0.000035224726,0.00004704851,0.00022604356,0.00012605113],"category_scores_gemma":[0.0000021449666,0.00024263062,0.000051710547,0.000008263572,0.000033205553,0.000040018134,0.00005802712,0.00042950676,0.00007698997],"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.00006281394,0.000017635411,0.00017641508,0.00074170844,0.0018302138,0.00052092643,0.0005088208,0.0739167,0.037002515,0.2003726,0.21640337,0.46844628],"study_design_scores_gemma":[0.00014953739,0.000041878768,0.00004206393,0.0005835998,0.00006449735,0.000099710094,0.00000998499,0.20762518,0.0019902303,0.006375219,0.78234226,0.0006758703],"about_ca_topic_score_codex":0.0000086622495,"about_ca_topic_score_gemma":0.0000025873405,"teacher_disagreement_score":0.5659389,"about_ca_system_score_codex":0.000023402881,"about_ca_system_score_gemma":0.000007685672,"threshold_uncertainty_score":0.989419},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.576736,0.00016431815,0.4209426,0.00008171796,0.000066053515,0.00045404834,0.0000058154633,0.00014985602,0.0013996239],"genre_scores_gemma":[0.97258484,0.000015085314,0.027219767,0.00008258008,0.000012579505,0.0000032782198,9.27964e-7,0.000012613291,0.000068326546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956024,0.00001169768,0.000109853965,0.00012199531,0.000050208895,0.00014602026],"domain_scores_gemma":[0.99968207,0.00013185102,0.00001116048,0.00013856807,0.000021431655,0.00001493496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009145827,0.0000948035,0.00013912609,0.0000626357,0.0000214069,0.00002945745,0.000059997015,0.00004628352,0.0000033211386],"category_scores_gemma":[0.000005349859,0.000072947536,0.00001814855,0.00006917968,0.000017620347,0.000085367574,0.00003414011,0.00010603611,0.0000013438162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037031226,0.000028002922,0.0027108144,0.00004402822,0.00004253804,0.000010339011,0.0023662304,0.9131266,0.055467233,0.0020530594,0.000933895,0.023180211],"study_design_scores_gemma":[0.0003109817,0.000010037802,0.003160494,0.000046966597,0.0000027373342,0.0000018832503,0.000068170695,0.9769484,0.017657913,0.0016165421,0.0000739045,0.00010198357],"about_ca_topic_score_codex":0.00010347037,"about_ca_topic_score_gemma":0.00015377173,"teacher_disagreement_score":0.39584887,"about_ca_system_score_codex":0.000022547543,"about_ca_system_score_gemma":0.0000048927536,"threshold_uncertainty_score":0.2974714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03534437,0.00047015847,0.96306646,0.00011145436,0.00018718527,0.00026949408,0.0000012512915,0.00036545616,0.00018415973],"genre_scores_gemma":[0.882069,0.000014735679,0.11745545,0.00031319848,0.00006377749,0.000010372335,0.0000011966158,0.000054404147,0.000017883684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985618,0.0000794567,0.00036354188,0.00028557333,0.00040199567,0.00030761154],"domain_scores_gemma":[0.9994519,0.000046744084,0.00011918769,0.00020730833,0.000106521125,0.000068339155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006090328,0.00024506406,0.0003562817,0.00017095415,0.000047202884,0.00006212696,0.0001349161,0.000094727366,0.000042268144],"category_scores_gemma":[0.000007868156,0.00024018361,0.00006903003,0.0001410223,0.000046288023,0.00023540824,0.000023603243,0.000207557,0.000015768423],"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.000024908755,0.000013002632,0.000031344243,0.00015827584,0.000049675717,0.000012475521,0.00016976544,0.13189201,0.83754325,0.0000018252035,0.0016346176,0.028468847],"study_design_scores_gemma":[0.00028588154,0.000109705106,0.00014270618,0.0003433607,0.00006653488,0.00004982537,0.000024347079,0.48671982,0.5112321,0.00044588008,0.00021133985,0.00036848453],"about_ca_topic_score_codex":0.000014819164,"about_ca_topic_score_gemma":6.681515e-7,"teacher_disagreement_score":0.8467246,"about_ca_system_score_codex":0.00008386043,"about_ca_system_score_gemma":0.000039109116,"threshold_uncertainty_score":0.97944033},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48612776,0.00006697982,0.5071289,0.00004216653,0.0004320854,0.0010999825,0.0001092294,0.00079410797,0.004198813],"genre_scores_gemma":[0.77395463,0.0000021408416,0.22546293,0.000067433626,0.00015587274,0.000023381057,0.00013793747,0.00010132914,0.00009434775],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848795,0.000043562326,0.0003308747,0.00039434334,0.0003101111,0.00043318028],"domain_scores_gemma":[0.9987,0.00023560275,0.000131257,0.0004502484,0.00037070844,0.00011218673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007292833,0.00036906297,0.0004392229,0.000107497064,0.00010736104,0.00017778423,0.00018491718,0.00011894303,0.000020646297],"category_scores_gemma":[0.000015892077,0.00035993484,0.00009825873,0.000109239896,0.00009523223,0.00018861474,0.00006120426,0.00022679649,0.000016913733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001662652,0.000086616565,0.00037216092,0.000111562666,0.00016146255,0.00010147309,0.00052326004,0.3217153,0.67417943,0.00019042278,0.0013704083,0.0010216585],"study_design_scores_gemma":[0.0018969649,0.00028335312,0.000085222266,0.00030893853,0.00007318072,0.00011949014,0.00021885331,0.7446525,0.25007227,0.00030810788,0.0013261668,0.00065495836],"about_ca_topic_score_codex":0.00005600297,"about_ca_topic_score_gemma":0.000012964877,"teacher_disagreement_score":0.42410716,"about_ca_system_score_codex":0.000060619073,"about_ca_system_score_gemma":0.000030862957,"threshold_uncertainty_score":0.99988526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17325796,0.00024123165,0.8190732,0.00001197617,0.0011040196,0.0005274527,0.000033018285,0.0011523394,0.004598773],"genre_scores_gemma":[0.9754349,0.00022225089,0.022577688,0.000034975732,0.0001363874,0.0000027957085,0.00003971911,0.000078522244,0.0014727584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988634,0.00006575657,0.00015519583,0.0005478911,0.000038273993,0.0003294663],"domain_scores_gemma":[0.99877334,0.00016400298,0.00008009405,0.00080477074,0.000093668925,0.000084105064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002012597,0.00032291235,0.00040661776,0.00019979075,0.000056335673,0.000059227797,0.0005237713,0.0004007592,0.000032861575],"category_scores_gemma":[0.00002061803,0.00040260024,0.00027533958,0.00014313069,0.00004932593,0.000087140885,0.00049030024,0.00044129463,0.00005450542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007559642,0.000068407644,0.00029335552,0.00028812408,0.00051755353,0.000047913,0.00011715124,0.948149,0.003937442,0.030312568,0.012470638,0.0037222276],"study_design_scores_gemma":[0.0003931011,0.000055164674,0.000098484976,0.00014107014,0.00019758895,0.000004966473,0.00003594292,0.9082112,0.014918542,0.05770601,0.017592663,0.00064530084],"about_ca_topic_score_codex":0.000038067963,"about_ca_topic_score_gemma":0.0000068207296,"teacher_disagreement_score":0.80217695,"about_ca_system_score_codex":0.00019324663,"about_ca_system_score_gemma":0.00005308049,"threshold_uncertainty_score":0.9998426},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02260354,0.000018377314,0.97017115,0.00005914628,0.0018841057,0.00066892436,0.000878925,0.0017040606,0.0020117569],"genre_scores_gemma":[0.9855548,0.00023288504,0.012931364,0.00025084952,0.00016941738,0.00014064448,0.0006419985,0.000062200124,0.000015850179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984111,0.00004992647,0.0007252724,0.00022399708,0.00032555175,0.00026412186],"domain_scores_gemma":[0.998808,0.00018629493,0.00019647801,0.0005651404,0.00012646633,0.00011760834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017367021,0.0004555539,0.00048022668,0.00039475103,0.00018253124,0.00021228814,0.00035248944,0.00042146133,0.00027023721],"category_scores_gemma":[0.0000039294064,0.00048521633,0.00028124865,0.00015203578,0.00003791029,0.00054127426,0.000009833511,0.001139296,0.00036667584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034713998,0.000047871858,0.0000028582656,0.00033639852,0.00046185235,0.0000036626186,0.003320049,0.94890714,0.0028683003,0.00030214785,0.0010310845,0.042371504],"study_design_scores_gemma":[0.0010833436,0.00006231167,0.00008559619,0.0008085676,0.0001885474,0.0000053332105,0.00030803264,0.8941281,0.08776324,0.013130365,0.0016566591,0.0007799339],"about_ca_topic_score_codex":0.00010722886,"about_ca_topic_score_gemma":0.000009623444,"teacher_disagreement_score":0.96295124,"about_ca_system_score_codex":0.00018394129,"about_ca_system_score_gemma":0.000040286715,"threshold_uncertainty_score":0.99976},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.630903,0.00031721854,0.2021639,0.000036507347,0.00044858686,0.00033519522,0.000005736341,0.0016174308,0.16417243],"genre_scores_gemma":[0.98038054,0.000011354707,0.01936431,0.00006261318,0.000027910668,3.6690273e-7,0.0000064395977,0.000024140212,0.00012233686],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99944746,0.000012740299,0.00016634174,0.000107111155,0.00010790983,0.00015842803],"domain_scores_gemma":[0.9995735,0.00003856691,0.000032091837,0.00026164768,0.00006152233,0.000032634387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002943394,0.00011492373,0.00021175067,0.000061572435,0.000015414587,0.00000926768,0.00009289322,0.00005211365,0.00021879881],"category_scores_gemma":[0.000002869462,0.00010843958,0.00005192213,0.000077283,0.000026065567,0.00005474749,0.000040237526,0.00008226008,0.00006979075],"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.0000063910543,0.000012210221,0.00036942156,0.00003394244,0.000053584485,0.000007055586,0.000111636626,0.01036283,0.96976423,0.0005095827,0.0098400535,0.00892906],"study_design_scores_gemma":[0.00016115887,0.00002655778,0.0014521691,0.00005173091,0.000008098396,0.000012776088,0.000032300915,0.37528616,0.61643547,0.00082523003,0.005532288,0.000176067],"about_ca_topic_score_codex":0.00004165072,"about_ca_topic_score_gemma":0.000003821646,"teacher_disagreement_score":0.36492333,"about_ca_system_score_codex":0.0000139488375,"about_ca_system_score_gemma":0.0000036419494,"threshold_uncertainty_score":0.44220376},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016073277,0.00017816506,0.98165596,0.0011640852,0.00013349747,0.00021618075,0.0000025697414,0.00018518239,0.00039106316],"genre_scores_gemma":[0.9302442,0.0003480768,0.06867431,0.00044128016,0.00023485982,0.000004881162,0.000012393801,0.000037216014,0.0000027590593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902546,0.000041748386,0.00045919747,0.00013225146,0.00019535296,0.00014601124],"domain_scores_gemma":[0.9993675,0.00005913042,0.00014535546,0.000105119354,0.00019006108,0.00013288582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010304251,0.00017798034,0.0003408274,0.00006318311,0.00014509335,0.00014867201,0.00011767669,0.00010513806,0.000089053996],"category_scores_gemma":[0.00004207869,0.00013181141,0.00006122808,0.0003587226,0.000058472877,0.00023923017,0.000029243056,0.00023539113,0.0000011804768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024223798,0.000013504776,0.000012367183,0.0000117285,0.000049360955,0.000063894026,0.00048594555,0.9923339,0.0047076447,0.00018199118,0.00045665557,0.0014408068],"study_design_scores_gemma":[0.00082685455,0.00012936624,0.000013379045,0.00001755125,0.000068244684,0.00035288453,0.00020865974,0.99237,0.004981431,0.00004597878,0.0008246253,0.0001610257],"about_ca_topic_score_codex":0.0000021499739,"about_ca_topic_score_gemma":6.4737655e-8,"teacher_disagreement_score":0.9141709,"about_ca_system_score_codex":0.000024713983,"about_ca_system_score_gemma":0.000026154039,"threshold_uncertainty_score":0.53751135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9740233,0.00031226847,0.0022502008,0.000005561464,0.00063922425,0.00031392902,0.0000074589307,0.00026795352,0.02218014],"genre_scores_gemma":[0.99179345,0.000042758777,0.007118969,0.000025519497,0.000025444753,0.0000030325698,0.000553136,0.000059345548,0.00037831624],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912786,0.000030928702,0.00035361733,0.00018402931,0.00015713894,0.0001464407],"domain_scores_gemma":[0.9994045,0.000082199294,0.00012635409,0.00027170777,0.000090040245,0.000025197522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057753805,0.0002172463,0.00036932479,0.00035316256,0.0000102713075,0.000016038068,0.000092953516,0.00029356746,0.000027219616],"category_scores_gemma":[0.000016834501,0.00023742141,0.00007560069,0.00016989675,0.000015317264,0.00007154213,0.000006534055,0.00024782846,0.000013572239],"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.00017370257,0.000025147805,0.0013630597,0.0013924865,0.00016696638,0.000036220645,0.0013174715,0.1818169,0.7612751,0.00016717134,0.006898405,0.045367382],"study_design_scores_gemma":[0.00022217595,0.0000346883,0.0024755225,0.0017545962,0.000025729614,8.0944244e-7,0.00018399184,0.14881697,0.8454656,0.0005982722,0.00009667651,0.0003249651],"about_ca_topic_score_codex":0.00015150393,"about_ca_topic_score_gemma":0.0002132042,"teacher_disagreement_score":0.08419051,"about_ca_system_score_codex":0.000064942025,"about_ca_system_score_gemma":0.00006069603,"threshold_uncertainty_score":0.96817636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.468529,0.00005622667,0.53051704,0.0000030314689,0.0001793966,0.000063824555,0.0000010766257,0.00037808414,0.00027237082],"genre_scores_gemma":[0.91711503,0.00006830415,0.08271107,0.000003157391,0.000044242934,0.000001837881,0.000016170727,0.000019670322,0.00002052132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957585,0.0000044858966,0.00011584586,0.00011576671,0.00007016301,0.00011785922],"domain_scores_gemma":[0.99981314,0.000004873714,0.000015387903,0.00010581597,0.000021627719,0.000039183586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035358247,0.00010159806,0.00013469167,0.0002012187,0.000027701426,0.00003837446,0.00003372831,0.000052986587,0.000042041866],"category_scores_gemma":[0.000002386213,0.00011448244,0.000037553564,0.0002832034,0.000005609306,0.0001092837,0.000016476984,0.000068469584,0.000002225833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012565451,0.0000027769931,0.00020860316,0.000009633879,0.000073400166,5.230666e-7,0.00004991393,0.985021,0.014425059,0.000041641808,0.0000080331265,0.00015816647],"study_design_scores_gemma":[0.0000829075,0.000005041299,0.00058789755,0.0000149707475,0.00006181803,0.0000065898175,0.000014872051,0.9962687,0.0025838204,9.4153063e-7,0.00023872612,0.00013369917],"about_ca_topic_score_codex":0.0000069207763,"about_ca_topic_score_gemma":3.0381716e-7,"teacher_disagreement_score":0.44858605,"about_ca_system_score_codex":0.00003564094,"about_ca_system_score_gemma":0.0000024873632,"threshold_uncertainty_score":0.46684584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03315307,0.000050677445,0.88674,0.00073741516,0.00036071107,0.0007383214,0.000013248022,0.00065746036,0.07754905],"genre_scores_gemma":[0.9832084,0.000009884944,0.015307948,0.00025495025,0.00008961599,0.000020090762,0.000065221844,0.00006885768,0.00097504107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907494,0.000015541356,0.00025712486,0.0001888417,0.00014179845,0.00032177297],"domain_scores_gemma":[0.999271,0.00004960557,0.00003485142,0.00030981563,0.00008341066,0.00025135276],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000071523136,0.00017969383,0.00023393647,0.00015651989,0.000052979918,0.000066374196,0.00015772376,0.00015199924,0.012718365],"category_scores_gemma":[0.000034928187,0.00019412642,0.000046754074,0.00015067686,0.000031583066,0.000053866883,0.000014512911,0.00013305148,0.0051628184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011561043,0.00005524569,0.000690151,0.00032283584,0.00012996962,0.00004718174,0.00051716773,0.88947225,0.0017714892,0.017369052,0.087472044,0.002141033],"study_design_scores_gemma":[0.00021979268,0.000028397346,0.00009827801,0.00011139245,0.00002033737,0.000012784707,0.000045173638,0.983127,0.0019777445,0.0014814376,0.012557904,0.00031973177],"about_ca_topic_score_codex":0.00014817086,"about_ca_topic_score_gemma":0.000057202436,"teacher_disagreement_score":0.9500553,"about_ca_system_score_codex":0.0001283157,"about_ca_system_score_gemma":0.000050255654,"threshold_uncertainty_score":0.9956118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756208,0.000078836754,0.021011781,0.000003828502,0.0005944887,0.00020695214,0.000012882755,0.00049790303,0.0019724928],"genre_scores_gemma":[0.99852765,0.0007651401,0.0002089578,0.00001859975,0.00006352071,6.792458e-7,0.000041555784,0.00003776324,0.00033612133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921024,0.00004246879,0.00018767311,0.00032732834,0.000043482898,0.00018878159],"domain_scores_gemma":[0.99912137,0.000021214722,0.00014645685,0.000580347,0.0000853927,0.000045244262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008764059,0.0002324719,0.0003419059,0.0001777234,0.0000327118,0.000016237746,0.0003094581,0.00023017653,0.000030930867],"category_scores_gemma":[0.0000055020128,0.00028585093,0.00013842026,0.00013986995,0.0000399663,0.00013269883,0.00021909605,0.00032367028,0.000030466746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008019117,0.000025428593,0.0043129255,0.00035891327,0.00014737355,0.000032368403,0.00010532637,0.9393716,0.053787496,0.0008212113,0.0004640472,0.0004931275],"study_design_scores_gemma":[0.00029249166,0.000038300313,0.0053852485,0.0004305996,0.00009441658,0.0000018635845,0.000013239363,0.8691089,0.122919224,0.0005015767,0.0007660976,0.00044805225],"about_ca_topic_score_codex":0.000045873916,"about_ca_topic_score_gemma":0.0000032086496,"teacher_disagreement_score":0.0702627,"about_ca_system_score_codex":0.00013128504,"about_ca_system_score_gemma":0.00003065724,"threshold_uncertainty_score":0.99995935},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5124081,0.00003132034,0.45660013,0.00005434677,0.00021826502,0.0004674894,0.000008792248,0.0009960723,0.029215477],"genre_scores_gemma":[0.9149725,0.000012648035,0.08477097,0.000050238457,0.00002394948,0.0000066817856,0.000012178771,0.00001851868,0.00013235724],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952424,0.000011781685,0.00013486976,0.00010031717,0.000108425855,0.000120353616],"domain_scores_gemma":[0.9997032,0.000023084607,0.000023188335,0.0002029436,0.000024800112,0.000022756105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000036433583,0.00009770607,0.00013796719,0.00008510129,0.000010483531,0.000010684966,0.00007824918,0.00003869159,0.00016397655],"category_scores_gemma":[0.0000013897223,0.00008438996,0.0000481823,0.00007187486,0.000008411465,0.000031199175,0.000015471158,0.00008740283,0.000024232046],"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.00003862225,0.000039806233,0.00007080155,0.000035220408,0.00012818068,0.0000037440354,0.00027327906,0.3762447,0.09348484,0.0026443757,0.0038614399,0.523175],"study_design_scores_gemma":[0.00083164277,0.00014277191,0.0006869301,0.000040543728,0.000012910861,0.000002393491,0.00009270287,0.21152188,0.78423923,0.0015403486,0.0006869277,0.00020172392],"about_ca_topic_score_codex":0.00005422677,"about_ca_topic_score_gemma":0.0000018631117,"teacher_disagreement_score":0.69075435,"about_ca_system_score_codex":0.000014616611,"about_ca_system_score_gemma":0.000005014165,"threshold_uncertainty_score":0.34413227},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022626,0.0002009304,0.39645764,0.0000029206012,0.00022140388,0.00013214909,0.0000045988822,0.00028183527,0.00043587058],"genre_scores_gemma":[0.99749243,0.0008186672,0.0014277747,0.000022395749,0.00009541131,6.625137e-7,0.00003096375,0.000050636376,0.00006105369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987233,0.00008503136,0.00021778862,0.0005712019,0.000057373352,0.00034528924],"domain_scores_gemma":[0.9991108,0.00014821718,0.00009844795,0.0004980088,0.00006002877,0.00008445763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016574906,0.00033658737,0.00044797748,0.00036627482,0.00006535299,0.00006521166,0.00026755023,0.0003569413,0.0000074793534],"category_scores_gemma":[0.000013652747,0.00043129743,0.00009346969,0.000287453,0.00006612747,0.000096103446,0.00041133806,0.00051441754,0.000006788422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003126128,0.000018060447,0.008210044,0.000060248203,0.000031002743,0.00007850327,0.000057878722,0.98967606,0.0010153454,0.00064136967,0.000032663913,0.00014756602],"study_design_scores_gemma":[0.00030823014,0.000017146978,0.006160424,0.0004784602,0.000048251382,0.000012558886,0.00006338138,0.99133056,0.0004256275,0.0005560284,0.00014738149,0.00045193348],"about_ca_topic_score_codex":0.0009977189,"about_ca_topic_score_gemma":0.00006895413,"teacher_disagreement_score":0.3952298,"about_ca_system_score_codex":0.00018278619,"about_ca_system_score_gemma":0.000026221263,"threshold_uncertainty_score":0.99981385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55685323,0.0002537044,0.44230875,0.000023524124,0.00038860794,0.00004662969,0.000091300135,0.000012573594,0.000021691174],"genre_scores_gemma":[0.7613641,0.000010997964,0.2385194,0.000032659093,0.00004683898,1.5507578e-7,0.00000931969,0.000011903887,0.000004629413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951166,0.000013609664,0.00019656881,0.000052568197,0.00009481197,0.0001307658],"domain_scores_gemma":[0.9995229,0.00005451297,0.00007136053,0.000059407397,0.0001213241,0.0001704655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068359775,0.00007987015,0.00013482041,0.0001362227,0.000047341222,0.000047524314,0.000047898848,0.000043087482,0.00005462442],"category_scores_gemma":[0.00001998308,0.00008579604,0.000015533942,0.00005543413,0.000028901442,0.00010825928,0.0000037040975,0.00012361865,0.0000056927815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002272898,0.00000798538,0.0015430431,0.00007708617,0.00008940374,0.0004009446,0.00016552265,0.953326,0.013791181,0.01315238,0.0072644656,0.010159257],"study_design_scores_gemma":[0.00034804203,0.00005970807,0.0058240746,0.00030955655,0.00004476142,0.00055926136,0.000009206725,0.9816939,0.0021374188,0.008597923,0.00024000421,0.00017610613],"about_ca_topic_score_codex":0.00047938587,"about_ca_topic_score_gemma":0.00028323123,"teacher_disagreement_score":0.20451088,"about_ca_system_score_codex":0.00010375187,"about_ca_system_score_gemma":0.00016249433,"threshold_uncertainty_score":0.3498661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8595357,0.00016574613,0.088969864,0.0070059407,0.0011150024,0.0010340089,0.000022211625,0.0020536003,0.04009793],"genre_scores_gemma":[0.997065,0.000029459401,0.0024340628,0.00030849825,0.00011184924,0.0000111957115,7.0322653e-7,0.00002779571,0.000011439232],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99890035,0.0000055612218,0.0003360318,0.00025266403,0.000249242,0.0002561452],"domain_scores_gemma":[0.99938035,0.000042860098,0.000102898885,0.00013828767,0.00024364331,0.00009193383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010611062,0.00019840548,0.00021442755,0.000061118786,0.00008496706,0.00008922117,0.0006263398,0.00007478776,0.00006154091],"category_scores_gemma":[0.0001275022,0.0001627942,0.00010515152,0.00037083283,0.00013207445,0.000095904325,0.00007164071,0.0002777905,0.000037941016],"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.0002481574,0.00013594322,0.00077883014,0.00023924648,0.000070705304,0.0000029829118,0.0015508068,0.028326627,0.7385439,0.14750938,0.0041541285,0.07843928],"study_design_scores_gemma":[0.000011964652,0.000060655468,0.000028783845,0.000156297,0.000011238803,6.6159026e-7,0.00015306231,0.30801508,0.6850677,0.006159402,0.00019065102,0.0001445045],"about_ca_topic_score_codex":0.000011222728,"about_ca_topic_score_gemma":0.0000027291592,"teacher_disagreement_score":0.27968848,"about_ca_system_score_codex":0.000025816767,"about_ca_system_score_gemma":0.000021542062,"threshold_uncertainty_score":0.66385543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5476892,0.000048937207,0.4502609,0.000034129658,0.0012450826,0.00028340932,0.000004340741,0.00014809748,0.0002859084],"genre_scores_gemma":[0.99773276,0.0000045163815,0.0020039545,0.000019726871,0.00015188068,0.000005161076,0.0000048888633,0.000030117439,0.000047023488],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989193,0.00007218175,0.00049956504,0.00015525217,0.0001936376,0.00016003357],"domain_scores_gemma":[0.998998,0.000034093548,0.0002473533,0.0003301359,0.00032075,0.00006970228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024588112,0.00013736385,0.00027177093,0.00023654506,0.000049214013,0.000048330872,0.00011328059,0.000103207865,0.000008287398],"category_scores_gemma":[0.0000072685143,0.00012132472,0.000046363646,0.00018866468,0.000028965385,0.00009689901,0.0000055124556,0.00019485687,0.000025763216],"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.000054122884,0.000013659771,0.00083029,0.000040924155,0.000050186194,0.0000045165707,0.000079613725,0.32936937,0.6675721,0.000032551157,0.00053405087,0.0014186705],"study_design_scores_gemma":[0.0006224855,0.00028065138,0.0014000372,0.00047076427,0.00003802005,0.0007403513,0.000095627795,0.5195187,0.4750724,0.000080857186,0.0014033768,0.00027673185],"about_ca_topic_score_codex":0.000038187045,"about_ca_topic_score_gemma":0.000007939219,"teacher_disagreement_score":0.45004356,"about_ca_system_score_codex":0.00007730632,"about_ca_system_score_gemma":0.000025616364,"threshold_uncertainty_score":0.49474788},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5607392,0.000051803996,0.3663228,0.000050084338,0.00065258454,0.0006301661,0.000011361113,0.0021748499,0.069367185],"genre_scores_gemma":[0.96819055,0.00001664711,0.029716535,0.0002670317,0.000049089147,0.0000033938852,0.00001107138,0.00004896551,0.0016966909],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938315,0.000011031256,0.00014089906,0.00016392245,0.00009393851,0.00020704386],"domain_scores_gemma":[0.9993936,0.00020183109,0.000021567907,0.0003135433,0.00003629839,0.00003316617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006124889,0.00013340231,0.00020331953,0.0000765432,0.000029613131,0.00004130793,0.00008172946,0.00007298739,0.00010497521],"category_scores_gemma":[0.000015512576,0.00013132891,0.000082872364,0.000057369078,0.000008707189,0.00006711736,0.000017205497,0.000090573,0.000104683255],"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.00028669168,0.00006032473,0.000036983572,0.00013842614,0.00018662994,0.000008211099,0.00006951139,0.08948367,0.8324058,0.017578173,0.036834277,0.02291127],"study_design_scores_gemma":[0.0006829564,0.00013322037,0.00005637073,0.00014063678,0.000012218084,0.0000015766088,0.000018786652,0.46109477,0.5206961,0.0034777217,0.013381327,0.00030434388],"about_ca_topic_score_codex":0.000013307269,"about_ca_topic_score_gemma":0.000003955627,"teacher_disagreement_score":0.4074514,"about_ca_system_score_codex":0.000025604064,"about_ca_system_score_gemma":0.000005255301,"threshold_uncertainty_score":0.53554374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065726034,0.0006825362,0.9182634,0.0005092619,0.00088540785,0.0014787242,0.000027408394,0.0034301826,0.008997084],"genre_scores_gemma":[0.996321,0.0012987083,0.0010213932,0.00022120407,0.00014641625,0.000006834984,0.000028620769,0.0000942206,0.0008615686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858797,0.00006278218,0.00022099678,0.0006134379,0.00007845083,0.00043636814],"domain_scores_gemma":[0.9988284,0.00015847743,0.00012660374,0.00058746286,0.00015077795,0.00014824205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012539826,0.00037378073,0.00035222629,0.00010122742,0.00027235626,0.00013976365,0.00075002055,0.0003332335,0.00002293727],"category_scores_gemma":[0.00004583425,0.00037081217,0.0002736747,0.00027119473,0.00010634794,0.00011631187,0.0004966368,0.0009073418,0.000039693456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009686345,0.000020164802,0.00040421498,0.0001822766,0.0003329968,0.000055204375,0.00032713523,0.9645224,0.0005806927,0.020194093,0.012309101,0.0009748136],"study_design_scores_gemma":[0.0003711782,0.00006312012,0.00005056451,0.0001374499,0.00014244355,0.0000019192364,0.00014868024,0.8767327,0.00094454386,0.06365029,0.057289496,0.00046761584],"about_ca_topic_score_codex":0.000071087896,"about_ca_topic_score_gemma":0.000093178925,"teacher_disagreement_score":0.930595,"about_ca_system_score_codex":0.00016468515,"about_ca_system_score_gemma":0.000048732927,"threshold_uncertainty_score":0.99987435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23656885,0.001437541,0.47174674,0.00029118088,0.0016423465,0.0018561675,0.000020933141,0.004572407,0.2818638],"genre_scores_gemma":[0.98144436,0.000011702267,0.017723972,0.00028546673,0.00009154319,0.00002712136,0.000027279635,0.000042685915,0.000345848],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934494,0.0000070100195,0.00013873426,0.00017042864,0.000080851816,0.00025802158],"domain_scores_gemma":[0.9995128,0.00007262003,0.000020925947,0.00028125563,0.0000641587,0.000048275444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003525052,0.00014752556,0.00017548456,0.000064368345,0.0000319102,0.000041592542,0.00014901372,0.000043963835,0.0003797899],"category_scores_gemma":[0.0000085681595,0.00013467333,0.00007276422,0.000055759996,0.000016212782,0.000101502075,0.0000327099,0.000085237916,0.00007117165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010062576,0.0000964713,0.011786828,0.00023246165,0.00032057957,0.00003885403,0.0005707839,0.091723405,0.41760123,0.011508915,0.42164165,0.044378214],"study_design_scores_gemma":[0.00039891555,0.000030033572,0.0007781162,0.000052719653,0.000017388636,0.000014437072,0.00008519057,0.8133776,0.14111805,0.0013019195,0.04250452,0.00032108033],"about_ca_topic_score_codex":0.0000097140755,"about_ca_topic_score_gemma":0.000003936153,"teacher_disagreement_score":0.74487555,"about_ca_system_score_codex":0.000021753458,"about_ca_system_score_gemma":0.000004638831,"threshold_uncertainty_score":0.54918194},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43542513,0.0006430015,0.48270702,0.004628233,0.009911911,0.0019382234,0.00018726515,0.012318482,0.05224072],"genre_scores_gemma":[0.9071966,0.000045879326,0.08107373,0.009126977,0.0012769741,0.000040028306,0.00011243279,0.00017033612,0.0009570352],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984493,0.00002830843,0.00033873122,0.0005553611,0.00023556144,0.0003927282],"domain_scores_gemma":[0.99849766,0.00013700228,0.00005102392,0.0011338347,0.00005456021,0.00012592599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000056855537,0.00045231148,0.0005086891,0.00017641373,0.000035927165,0.00015915043,0.00043454094,0.0004030123,0.00039729907],"category_scores_gemma":[0.000019614596,0.0003923262,0.00012207069,0.0000776065,0.000015761627,0.00006578054,0.00091438467,0.00074054673,0.00044274176],"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.00004191136,0.000082194216,0.000040055264,0.00007643552,0.00074051716,0.00011679361,0.0019552433,0.28922766,0.13067043,0.0002823046,0.570093,0.006673476],"study_design_scores_gemma":[0.000541799,0.00012565008,0.00034766202,0.0020106856,0.00030437464,0.000007161105,0.00009760844,0.09569596,0.2534083,0.0067755366,0.63760424,0.0030810495],"about_ca_topic_score_codex":0.00081863225,"about_ca_topic_score_gemma":0.00004297125,"teacher_disagreement_score":0.47177148,"about_ca_system_score_codex":0.00016378239,"about_ca_system_score_gemma":0.00001894152,"threshold_uncertainty_score":0.99985284},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005601985,0.00035368293,0.9959652,0.0012915583,0.00056849135,0.00085797487,0.00008120889,0.0005462429,0.00027962498],"genre_scores_gemma":[0.008362647,0.00048122095,0.988614,0.00093219033,0.00015623911,0.00014368766,0.0011871038,0.000105113846,0.00001776628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880505,0.000102983686,0.0004675705,0.00033311735,0.00012986091,0.00016141737],"domain_scores_gemma":[0.99906486,0.000104875835,0.00022577234,0.000353676,0.00019923034,0.00005156335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017197011,0.00028970928,0.00044840606,0.00016494007,0.000040879826,0.00006168307,0.00022657742,0.00024748727,0.00004260284],"category_scores_gemma":[0.00011728834,0.00033381913,0.0001590305,0.00016807881,0.0000383938,0.0000788293,0.000103602724,0.00020895775,8.8970995e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013379634,0.0000064622686,0.0000021396022,0.00026053464,0.00009082727,3.5604637e-7,0.0001942838,0.9853398,0.003531866,0.000092189934,0.00731824,0.0031499106],"study_design_scores_gemma":[0.00020135572,0.000021237705,0.0000035590938,0.0002104649,0.00009393628,0.0000012366236,0.000009411776,0.9835129,0.0133188125,0.00023079113,0.002093011,0.00030331305],"about_ca_topic_score_codex":0.000004972651,"about_ca_topic_score_gemma":1.9695905e-7,"teacher_disagreement_score":0.009786946,"about_ca_system_score_codex":0.000070524,"about_ca_system_score_gemma":0.00003128668,"threshold_uncertainty_score":0.99991137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331678,0.000113232585,0.56362545,0.00023125198,0.0002861018,0.00029537146,0.00024942015,0.0009845136,0.0010468622],"genre_scores_gemma":[0.99555296,0.00017252828,0.004108312,0.000060022347,0.000051992705,0.0000068818827,0.000008172651,0.000023134744,0.000016012958],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993198,0.000014317737,0.00022010344,0.00020629294,0.00012285393,0.000116664596],"domain_scores_gemma":[0.9995135,0.000030253606,0.000034503842,0.00032341547,0.000030935313,0.0000673674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007252917,0.00011647535,0.00018414136,0.000037261118,0.000052582727,0.000019768391,0.00014452904,0.000045353292,0.000027568516],"category_scores_gemma":[0.000002768026,0.000116480056,0.000027917411,0.00011080465,0.00004095933,0.0001361068,0.0000033151587,0.000118714575,0.000007493657],"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.000048223505,0.000058157017,0.000009714553,0.00017449041,0.00006858343,0.0000033106865,0.00023180599,0.005495569,0.9065822,0.0000039761335,0.0014180978,0.08590591],"study_design_scores_gemma":[0.00029707642,0.00016122348,0.00013193971,0.00009257214,0.000056488174,0.000002752524,0.00004316868,0.15926683,0.8384224,0.000014757365,0.0012958864,0.00021486336],"about_ca_topic_score_codex":0.000074775446,"about_ca_topic_score_gemma":0.0000057897373,"teacher_disagreement_score":0.56238514,"about_ca_system_score_codex":0.000014137252,"about_ca_system_score_gemma":0.000014459533,"threshold_uncertainty_score":0.4749919},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3210444,0.000039772014,0.6750467,0.0000075262,0.0003733593,0.000159106,0.0000017636554,0.00070239103,0.0026250281],"genre_scores_gemma":[0.62290835,0.000003832403,0.37689322,0.0000487799,0.0000996111,0.0000036237261,0.000001546522,0.000026386122,0.000014605624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946517,0.000008804025,0.00012271128,0.00016271487,0.000059537393,0.0001810728],"domain_scores_gemma":[0.999602,0.00003123546,0.000022089285,0.00026676685,0.00003364615,0.000044228407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048675814,0.000117646836,0.00013432468,0.00007085044,0.000044780936,0.00005446228,0.00008614628,0.00012828883,0.00005259231],"category_scores_gemma":[0.0000050118674,0.00011387189,0.000050766015,0.00007334508,0.000009168384,0.00032576238,0.000009121747,0.00012452331,0.000005027686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002039953,0.000011377188,0.00035831615,0.00005218526,0.000056944245,0.000001845171,0.00024169049,0.7878752,0.14128509,0.04678995,0.00058794516,0.022719083],"study_design_scores_gemma":[0.00006104205,0.000020464948,0.000011012041,0.000119960976,0.000009387695,0.000021254838,0.00008037289,0.8844823,0.041735686,0.07315159,0.0001507512,0.00015612805],"about_ca_topic_score_codex":0.000013426154,"about_ca_topic_score_gemma":0.0000024899819,"teacher_disagreement_score":0.30186397,"about_ca_system_score_codex":0.000037517948,"about_ca_system_score_gemma":0.000006757213,"threshold_uncertainty_score":0.46435606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5873528,0.000024196916,0.4026337,0.0000103514585,0.00024932646,0.00015979377,0.0000034330242,0.0008344808,0.008731941],"genre_scores_gemma":[0.9882517,0.0000028442066,0.011233481,0.000020846473,0.000050333256,0.0000019553786,0.000014407507,0.000019924371,0.00040449188],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996338,0.000009782195,0.00010099592,0.000087741915,0.00006682311,0.00010084138],"domain_scores_gemma":[0.99975073,0.000019069335,0.000015726375,0.00013850484,0.00005240091,0.000023551907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015093765,0.00008587286,0.00008329185,0.00006852358,0.000031950545,0.000047750207,0.00004818004,0.000047603877,0.00016201798],"category_scores_gemma":[0.0000044534977,0.00008208251,0.000024105568,0.00014140796,0.000005973114,0.000182666,0.000013250308,0.00005780654,0.000069447444],"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.0000036291076,0.00001981447,0.0052056084,0.000019153265,0.000049588318,0.000003175873,0.000757757,0.16492924,0.8224785,0.0037332864,0.0011241914,0.0016760988],"study_design_scores_gemma":[0.00013607998,0.000019814594,0.0013948639,0.00004932617,0.000010894357,0.000005876879,0.00011247992,0.71831614,0.27857947,0.0003387714,0.00082856236,0.00020770398],"about_ca_topic_score_codex":0.00001796771,"about_ca_topic_score_gemma":0.000005444946,"teacher_disagreement_score":0.55338687,"about_ca_system_score_codex":0.000034126988,"about_ca_system_score_gemma":0.000006956816,"threshold_uncertainty_score":0.33472273},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46167096,0.0035707138,0.47848424,0.012362382,0.0036519591,0.0058661574,0.00058802764,0.0038075012,0.029998073],"genre_scores_gemma":[0.98724514,0.0007263879,0.011004743,0.00048506592,0.00020519154,0.00003584783,0.00010712792,0.00017836312,0.000012120024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963457,0.0009188764,0.0012119699,0.0004494849,0.00060675445,0.00046718688],"domain_scores_gemma":[0.9940882,0.0014776052,0.001073245,0.0022406734,0.00093757187,0.00018272374],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00028848133,0.00068973924,0.0012037785,0.0009704382,0.00029385334,0.00033922333,0.002407815,0.0005291788,0.00003257698],"category_scores_gemma":[0.00035092625,0.00069077674,0.0003335199,0.00096154644,0.0002270881,0.00013441409,0.0004252541,0.0040908265,0.000006591374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044931524,0.000271162,0.00031826456,0.0000771809,0.00046055342,0.0000761852,0.00057290593,0.9659509,0.025112614,0.000056971036,0.0047349255,0.0019190372],"study_design_scores_gemma":[0.0026152967,0.00012867623,0.0009679499,0.0049986816,0.00017657244,0.000028988747,0.00007461253,0.9270381,0.0595332,0.0028310285,0.0008415564,0.00076536724],"about_ca_topic_score_codex":0.00006463585,"about_ca_topic_score_gemma":0.00004897979,"teacher_disagreement_score":0.5255742,"about_ca_system_score_codex":0.00051060144,"about_ca_system_score_gemma":0.0004309808,"threshold_uncertainty_score":0.99955434},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030123536,0.000091853326,0.9926534,0.00063744327,0.00051564624,0.00058405154,0.00029553895,0.0013959648,0.0008136895],"genre_scores_gemma":[0.9943689,0.00023577751,0.004748245,0.00021492562,0.00014905243,0.000051611638,0.00015892385,0.00005473268,0.000017799272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878144,0.00006686094,0.00034541538,0.0003422452,0.00023089873,0.00023313414],"domain_scores_gemma":[0.9989729,0.00012331904,0.000035514648,0.00070854014,0.000036979694,0.00012272659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001584643,0.00024437197,0.0004160214,0.00010825286,0.0001043245,0.0000653896,0.0004394774,0.0001082237,0.00009208048],"category_scores_gemma":[0.0000105164,0.00023292666,0.00012741385,0.00025608478,0.00006936609,0.000307059,0.0000025712363,0.00029310264,0.00008678814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012849671,0.00029120568,0.0000019376673,0.00022720135,0.0008049574,0.00003623286,0.001497958,0.11241125,0.051207885,0.00010820237,0.016188357,0.8043751],"study_design_scores_gemma":[0.014821276,0.0000562773,0.0000049590767,0.000067996756,0.00018731605,0.0000114220165,0.000038654292,0.805138,0.17134754,0.00027066667,0.0076617277,0.00039414372],"about_ca_topic_score_codex":0.000086552056,"about_ca_topic_score_gemma":0.000092500966,"teacher_disagreement_score":0.99135655,"about_ca_system_score_codex":0.000027830789,"about_ca_system_score_gemma":0.000017537184,"threshold_uncertainty_score":0.94984734},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006375961,0.00042584876,0.99346673,0.00021375892,0.0004439282,0.0008166135,0.000049770097,0.0017436012,0.0022021306],"genre_scores_gemma":[0.70708233,0.0003662517,0.29169187,0.00015121071,0.00015191468,0.00023768081,0.0001159371,0.0000574752,0.00014534335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927425,0.000013237389,0.0002160883,0.00027967678,0.00007978556,0.00013698525],"domain_scores_gemma":[0.99937636,0.000043209777,0.000045965535,0.0002794776,0.0002045935,0.000050405666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000044506465,0.00021676511,0.00023273414,0.00004620954,0.000027595284,0.00006352808,0.00022372823,0.00019821586,0.000012821811],"category_scores_gemma":[0.000047455454,0.0002211961,0.000070186965,0.000113825496,0.000021727406,0.00003529987,0.00014300428,0.00024038974,0.000023201374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010696474,0.00017776959,0.00006992227,0.0013920616,0.0012029419,0.000024968753,0.00567807,0.5117097,0.12048754,0.04031252,0.18569617,0.1331414],"study_design_scores_gemma":[0.000043707274,0.000023519568,0.000016456168,0.000103798644,0.000024412382,4.2070374e-7,0.000078603334,0.7183295,0.26678297,0.0051567107,0.009171527,0.00026835955],"about_ca_topic_score_codex":0.000022263735,"about_ca_topic_score_gemma":0.000025054645,"teacher_disagreement_score":0.70644474,"about_ca_system_score_codex":0.00005730539,"about_ca_system_score_gemma":0.000044054304,"threshold_uncertainty_score":0.9020115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70556384,0.017678447,0.25533667,0.0012110075,0.00022278687,0.00044304068,0.000018800947,0.0011935619,0.018331856],"genre_scores_gemma":[0.9907376,0.00010301174,0.008793145,0.00023527548,0.00007704199,0.0000013892585,0.0000064236297,0.000031482203,0.000014639471],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991427,0.000047232097,0.00020822007,0.00020440882,0.00012606235,0.0002713527],"domain_scores_gemma":[0.9996586,0.00006714757,0.000024680647,0.0001348081,0.00007402792,0.000040755134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010712267,0.00017503976,0.00019677,0.00006035185,0.00015769736,0.00024594436,0.000081564474,0.00007483999,0.0000190466],"category_scores_gemma":[0.00001527794,0.00013972033,0.00003555577,0.00023707173,0.000073641924,0.0002873835,0.000031938598,0.0003280851,7.343344e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009192293,0.000006943915,0.00003917628,0.0001201632,0.000015237016,0.00017203671,0.001120952,0.0005480644,0.71299374,0.000037579128,0.00032541016,0.2846115],"study_design_scores_gemma":[0.00026325675,0.000008184326,0.0003294537,0.00046055278,0.000022834924,0.00016514266,0.00089600554,0.23608534,0.75665885,0.003525144,0.0013352331,0.00025002015],"about_ca_topic_score_codex":0.000017077291,"about_ca_topic_score_gemma":0.000046581383,"teacher_disagreement_score":0.28517377,"about_ca_system_score_codex":0.000019791343,"about_ca_system_score_gemma":0.000033093027,"threshold_uncertainty_score":0.569763},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27440155,0.0017367471,0.70075035,0.00019895085,0.009212999,0.0034316136,0.0011454172,0.0032413574,0.0058810213],"genre_scores_gemma":[0.9754722,0.00023451907,0.022643363,0.00009452974,0.0010281323,0.0001529192,0.00013460139,0.00017846136,0.000061274346],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981506,0.000049253005,0.00060717063,0.0005444949,0.0002925859,0.00035591406],"domain_scores_gemma":[0.9984007,0.00013428606,0.00030435956,0.000768171,0.0002838178,0.000108657514],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012376327,0.0004627595,0.00091176294,0.0001992706,0.000046608697,0.00018557932,0.001013191,0.00044558072,0.000012380864],"category_scores_gemma":[0.000032861804,0.00050076813,0.00033652657,0.00017603186,0.000045447723,0.00015785288,0.0003738919,0.0005074884,0.000007691562],"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.0004011034,0.00022624069,0.00040304026,0.0096766865,0.0024631468,0.00043224942,0.00057841046,0.19395478,0.2915006,0.00014685342,0.4304991,0.06971775],"study_design_scores_gemma":[0.00046567828,0.00006579666,0.00017090142,0.0011116558,0.0001454585,0.00001958467,0.000013855729,0.16955286,0.8158201,0.009555297,0.0023666415,0.00071215397],"about_ca_topic_score_codex":0.00017471524,"about_ca_topic_score_gemma":0.000015693076,"teacher_disagreement_score":0.70107067,"about_ca_system_score_codex":0.00009783292,"about_ca_system_score_gemma":0.00007211177,"threshold_uncertainty_score":0.9997444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896819,0.00044550764,0.13437362,0.0001098089,0.00012428226,0.0008608867,0.0000056139743,0.0016173766,0.172781],"genre_scores_gemma":[0.9942174,0.000109511886,0.0052349046,0.000062248895,0.000030612267,0.000027842425,0.0000023134487,0.00001473849,0.00030043325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995991,0.0000039231104,0.000081416445,0.00012881463,0.0000734524,0.00011328119],"domain_scores_gemma":[0.9997049,0.000035318735,0.000012699876,0.00019756916,0.00001240165,0.000037101996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003448228,0.00008970385,0.00010102699,0.000054014254,0.00002998296,0.00003652297,0.00008314323,0.00004707619,0.00006375606],"category_scores_gemma":[0.0000011891714,0.0000765352,0.000020225509,0.000069362824,0.000011991752,0.00006642809,0.000021689408,0.00008153894,0.00015735184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005106065,0.00037268907,0.024975391,0.0006119272,0.0006168111,0.00007911741,0.0013023778,0.16805007,0.26014787,0.050028943,0.08687387,0.40643033],"study_design_scores_gemma":[0.0034482884,0.00029689982,0.01105904,0.00027714885,0.00008450194,0.00008608666,0.0003472171,0.6315782,0.27642262,0.0032432578,0.07168081,0.0014759538],"about_ca_topic_score_codex":0.00001734287,"about_ca_topic_score_gemma":0.0000036798597,"teacher_disagreement_score":0.46352813,"about_ca_system_score_codex":0.000009527499,"about_ca_system_score_gemma":0.0000035616351,"threshold_uncertainty_score":0.3121015},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15384732,0.00021031374,0.8024207,0.000048479997,0.000537581,0.00032172166,0.0000018622708,0.0015984146,0.041013617],"genre_scores_gemma":[0.6225862,0.000010410887,0.3752802,0.000097737524,0.000061319384,0.000015923817,0.0000030131887,0.00002965164,0.0019155586],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996527,0.000008768137,0.00007725038,0.0000898077,0.000034811685,0.00013665378],"domain_scores_gemma":[0.9996987,0.00007301266,0.0000075371204,0.00017830932,0.000018985416,0.000023469163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009723345,0.000072689574,0.00010494719,0.000035039222,0.000012833433,0.000023152521,0.00007740552,0.000047101857,0.00013406693],"category_scores_gemma":[0.0000067631827,0.000066331406,0.000047407037,0.000039125352,0.0000059874733,0.00004522298,0.000020956142,0.000044811743,0.00007969712],"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.000016789952,0.000039209677,0.0003279156,0.00005892603,0.00013290657,0.0000012350426,0.00012676173,0.0021173356,0.73031837,0.038212374,0.09498821,0.13365996],"study_design_scores_gemma":[0.00019887826,0.00005052498,0.00013557209,0.000013794698,0.000010679553,0.0000066769076,0.000019191752,0.16909333,0.6532957,0.009176406,0.16781127,0.00018796927],"about_ca_topic_score_codex":0.000006687586,"about_ca_topic_score_gemma":0.0000012686955,"teacher_disagreement_score":0.46873888,"about_ca_system_score_codex":0.000016561138,"about_ca_system_score_gemma":0.000004090963,"threshold_uncertainty_score":0.2704916},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061717136,0.000037298763,0.9856253,0.000026262896,0.00017893348,0.00048987754,0.000009827191,0.00043438957,0.007026385],"genre_scores_gemma":[0.8453583,0.0000024138246,0.15444946,0.00007605909,0.00004375276,0.0000096560425,0.000004710116,0.000026939564,0.000028698552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943835,0.000014489299,0.00013395149,0.00013803,0.00011571208,0.00015947588],"domain_scores_gemma":[0.9994425,0.00022247105,0.000027373464,0.00023321783,0.000050369297,0.000024078985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009301424,0.00011867095,0.00017936816,0.00008388614,0.000018728226,0.000011062854,0.00010841385,0.00004343617,0.00006834648],"category_scores_gemma":[0.000010935115,0.000113483344,0.0000529952,0.00005464813,0.000017536277,0.000062335406,0.000012856818,0.00006073006,0.000007756746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079709454,0.0001000257,0.0005278011,0.00006436704,0.00013183986,0.000003242163,0.0001428652,0.5135018,0.4513446,0.011168284,0.011975387,0.01024266],"study_design_scores_gemma":[0.00053887436,0.00020150855,0.00008263053,0.00008312034,0.00001629439,3.868282e-7,0.000024968213,0.6321702,0.3649368,0.0014088883,0.00039186788,0.00014446284],"about_ca_topic_score_codex":0.00003124097,"about_ca_topic_score_gemma":0.0000014544167,"teacher_disagreement_score":0.8391866,"about_ca_system_score_codex":0.000029284258,"about_ca_system_score_gemma":0.000017981247,"threshold_uncertainty_score":0.46277162},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010955815,0.00012183936,0.9837163,0.00025492196,0.00025496533,0.0016678905,0.00031378207,0.0010369612,0.0016775345],"genre_scores_gemma":[0.9518576,0.000042869415,0.046351533,0.00022827965,0.00011497848,0.00041117705,0.0008237946,0.000084277424,0.00008547914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984877,0.00004759579,0.00034525638,0.0005734565,0.00023134961,0.00031464765],"domain_scores_gemma":[0.99852616,0.00018538053,0.00015586804,0.0007677833,0.00028576603,0.000079072044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000116171264,0.00046655536,0.00088501384,0.00044454192,0.000055671386,0.00022405572,0.0004105243,0.0003406058,0.00012555279],"category_scores_gemma":[0.0000119762235,0.0004019075,0.0004487069,0.00036565252,0.000040979918,0.00014635004,0.00005637036,0.00036195028,0.000004732645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064395106,0.00008466645,0.000016017568,0.00020607922,0.0018554403,0.000022068087,0.00006616381,0.9932057,0.0010481551,0.0000661893,0.0021168315,0.00066871446],"study_design_scores_gemma":[0.0052827294,0.00011804352,0.000024389023,0.00027822188,0.0018958898,9.528183e-7,0.000020950552,0.92496043,0.06587364,0.00052241836,0.0004471156,0.0005752058],"about_ca_topic_score_codex":0.00009780289,"about_ca_topic_score_gemma":0.00005525145,"teacher_disagreement_score":0.9409018,"about_ca_system_score_codex":0.00009964928,"about_ca_system_score_gemma":0.00008802269,"threshold_uncertainty_score":0.9998433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024963787,0.000062805986,0.9685506,0.00030843358,0.00025774268,0.0002721777,0.0000068185145,0.0027191255,0.0028584846],"genre_scores_gemma":[0.5430187,0.000018464514,0.45634332,0.00018234663,0.00034949515,0.0000036954746,0.0000054504185,0.00003369423,0.000044831817],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947107,0.000008415601,0.00016016861,0.00015749804,0.00006512354,0.00013772227],"domain_scores_gemma":[0.99968237,0.000051365987,0.000022158203,0.000112318994,0.000042239917,0.000089549816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025613037,0.000114365976,0.00013792931,0.000039526163,0.000045012188,0.000035613302,0.000051895095,0.00007346682,0.000036351532],"category_scores_gemma":[0.000036120182,0.00011810029,0.000061652274,0.000092521965,0.000010271339,0.00011780804,0.0000119302995,0.00007506273,0.000010038372],"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.00004721786,0.000004155304,0.000113105234,0.00003771718,0.00007936122,0.0000015272487,0.00019357851,0.0057535,0.60762364,0.00013191318,0.06703321,0.31898108],"study_design_scores_gemma":[0.00024323961,0.000024548464,0.00006400846,0.000034598546,0.000013435009,0.000008400506,0.00003141712,0.6622169,0.3285405,0.00029106307,0.008429749,0.000102157916],"about_ca_topic_score_codex":0.000026044976,"about_ca_topic_score_gemma":0.0000040845784,"teacher_disagreement_score":0.6564634,"about_ca_system_score_codex":0.000023329505,"about_ca_system_score_gemma":0.000009649504,"threshold_uncertainty_score":0.481599},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067492954,0.0060974294,0.91273266,0.0010757799,0.0017138665,0.003262506,0.00058212393,0.004011692,0.0030309677],"genre_scores_gemma":[0.8870623,0.00019577642,0.10436398,0.0026846263,0.0021851668,0.0005817122,0.0018000094,0.0005815473,0.0005448852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99045914,0.00045253566,0.0023102327,0.0029327131,0.001281404,0.0025639746],"domain_scores_gemma":[0.9945274,0.00038203844,0.0006841938,0.0021976058,0.00038843046,0.0018203264],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0005956859,0.0024086742,0.0027225066,0.0012467285,0.0010239852,0.0003618477,0.0018852138,0.0014557374,0.00017458477],"category_scores_gemma":[0.00026550508,0.002313984,0.0017327121,0.0022206923,0.00048631118,0.0014660937,0.00016236902,0.003152204,0.000088589855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0064325808,0.004815436,0.0013588115,0.0013561867,0.022781013,0.00048950687,0.010666739,0.82668763,0.06585337,0.002203922,0.01708891,0.040265884],"study_design_scores_gemma":[0.0040657897,0.0016426983,0.00032999745,0.00025261537,0.009855544,0.00014177297,0.00058121205,0.79035914,0.014410034,0.00014067531,0.1741036,0.0041169445],"about_ca_topic_score_codex":0.00014936496,"about_ca_topic_score_gemma":0.00036540627,"teacher_disagreement_score":0.81956935,"about_ca_system_score_codex":0.00082778424,"about_ca_system_score_gemma":0.0005275122,"threshold_uncertainty_score":0.99984056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12002839,0.0012711693,0.8730016,0.00027730683,0.00037619667,0.00045907687,0.0001096837,0.0015425548,0.0029340514],"genre_scores_gemma":[0.9858296,0.00003751344,0.012948417,0.0005698007,0.00026794002,0.000058123336,0.00008733685,0.00012045882,0.00008084583],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985796,0.000028460878,0.000323974,0.00038005682,0.00028810796,0.00039977947],"domain_scores_gemma":[0.9991997,0.000116883246,0.000079662066,0.00029841645,0.00011733015,0.00018801336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000061620216,0.00037203467,0.00038824457,0.00008224029,0.0000885585,0.00017739783,0.00024185701,0.00010770685,0.00030130084],"category_scores_gemma":[0.000018673145,0.00036780242,0.000107761196,0.00012417806,0.00006009555,0.00031687168,0.00006743045,0.00045145885,0.000027672502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005937328,0.00010083911,0.0007316065,0.00024443027,0.0006334054,0.00013829472,0.0012175755,0.29266658,0.6256523,0.0006088214,0.07595982,0.001452593],"study_design_scores_gemma":[0.0027578317,0.00012850575,0.00010067028,0.0003164087,0.00012226985,0.000039983297,0.00011796265,0.77465683,0.18402559,0.00014082115,0.036782924,0.00081023574],"about_ca_topic_score_codex":0.00001197437,"about_ca_topic_score_gemma":8.6496544e-7,"teacher_disagreement_score":0.86580116,"about_ca_system_score_codex":0.00003966937,"about_ca_system_score_gemma":0.000013048963,"threshold_uncertainty_score":0.9998774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36253572,0.00026528418,0.6367344,0.00007872869,0.0000675768,0.00020639066,0.0000040139857,0.00008080232,0.000027044332],"genre_scores_gemma":[0.9994508,0.00006774867,0.00039119873,0.000037757414,0.000015890819,0.000018837418,6.964025e-7,0.000014837498,0.0000022247539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927014,0.000069059446,0.00018747996,0.00014717964,0.00012432365,0.00020182114],"domain_scores_gemma":[0.9995978,0.00013725294,0.00004755342,0.00015748768,0.00002896118,0.000030928415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008456414,0.00013089119,0.00018444318,0.000060686787,0.000053529504,0.000036833353,0.00011672006,0.00006103572,0.0000018895255],"category_scores_gemma":[0.000004483177,0.00010898206,0.00003612244,0.0002196984,0.00004181735,0.00005809558,7.071044e-7,0.0002657579,0.0000011804609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461778,0.0000146671555,0.000012129966,0.00004593321,0.000015522408,0.0000011863124,0.00065892795,0.96568155,0.033030506,0.000050456216,0.000026512422,0.00043798974],"study_design_scores_gemma":[0.00018492644,0.000120769015,0.00001925605,0.00022982557,0.000018878804,0.000009097629,0.00029544148,0.92705894,0.07190655,0.00001881609,0.00003540979,0.00010210262],"about_ca_topic_score_codex":0.00016001571,"about_ca_topic_score_gemma":0.000037840622,"teacher_disagreement_score":0.6369151,"about_ca_system_score_codex":0.00004527602,"about_ca_system_score_gemma":0.000026085005,"threshold_uncertainty_score":0.44441593},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17945798,0.00066080614,0.8152809,0.000047423913,0.00006655696,0.00077968993,0.000014479574,0.00021671028,0.0034754626],"genre_scores_gemma":[0.38302016,0.000094602416,0.6165572,0.0000012973055,0.00003084209,0.00014886548,0.000019512716,0.000047148496,0.000080357306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982941,0.00019351584,0.00035885142,0.0002925427,0.0005440579,0.00031693457],"domain_scores_gemma":[0.99770045,0.0002736117,0.000030862404,0.0008527962,0.0010701852,0.000072082825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243541,0.00022405751,0.0004440989,0.00034142964,0.00013654098,0.00023134492,0.00037494028,0.0001813811,0.00003556213],"category_scores_gemma":[0.0001741976,0.00019558091,0.00008109321,0.0003548486,0.00015242942,0.00007357479,0.00048573606,0.0010267186,0.0000031483844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014935826,0.00035287777,0.000010789436,0.0011719583,0.0005269632,0.000031147603,0.010061449,0.9019302,0.062154867,0.020965835,0.0004856831,0.0022932675],"study_design_scores_gemma":[0.00008611927,0.00008914681,0.000019877536,0.0013665467,0.00003448056,0.00001650736,0.001994711,0.74588877,0.24754748,0.0026486798,0.00005246544,0.00025519848],"about_ca_topic_score_codex":0.00009028168,"about_ca_topic_score_gemma":0.00011751376,"teacher_disagreement_score":0.2035622,"about_ca_system_score_codex":0.0001182151,"about_ca_system_score_gemma":0.00020066185,"threshold_uncertainty_score":0.7975558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114862435,0.000015973117,0.88204765,0.00006250159,0.00011331684,0.00044799634,0.000002122836,0.0003998213,0.0020481711],"genre_scores_gemma":[0.8088107,0.0000024833623,0.19101249,0.000069171074,0.00007233949,0.00001637495,0.0000010448691,0.000014002507,0.0000013890759],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989765,0.0000118299395,0.000181685,0.00035655775,0.0001713761,0.00030200352],"domain_scores_gemma":[0.9996892,0.00003176726,0.00004040555,0.00011949081,0.000041137293,0.00007799259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002006474,0.00012980188,0.00016311361,0.00014214743,0.00011151806,0.000065489425,0.00014089742,0.000044587825,0.000002293321],"category_scores_gemma":[0.0000126597015,0.0001359963,0.000033310454,0.00043035988,0.00009987543,0.00013489227,0.00003311095,0.00015332618,0.0000023100345],"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.00002673108,0.0000056491094,0.000010847085,0.0000099910785,0.000003295951,0.0000022234349,0.0011086201,0.04505951,0.867029,0.00044912787,0.00005257034,0.086242415],"study_design_scores_gemma":[0.00014134863,0.00001998634,0.00005805821,0.000017088401,0.0000038323424,0.000013718504,0.00006339746,0.6672237,0.32657686,0.005725581,0.000047637215,0.00010880016],"about_ca_topic_score_codex":0.000015949629,"about_ca_topic_score_gemma":0.000012804616,"teacher_disagreement_score":0.69394827,"about_ca_system_score_codex":0.0001116446,"about_ca_system_score_gemma":0.000035365312,"threshold_uncertainty_score":0.5545768},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00068831677,0.00011154092,0.9932838,0.00016120572,0.0011173211,0.0009228251,0.00007898024,0.0024263202,0.0012096873],"genre_scores_gemma":[0.4710626,0.00017234079,0.5273334,0.00012536527,0.0005112731,0.0001214139,0.00048414464,0.00011984422,0.00006962825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988699,0.000011125503,0.0003159393,0.00038525785,0.00015425976,0.00026354298],"domain_scores_gemma":[0.9992246,0.00005654101,0.000083563005,0.0004265321,0.00012686508,0.00008188887],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005458982,0.00032611116,0.00039492873,0.00010269748,0.000055481603,0.00012736247,0.00024755416,0.0006314608,0.00011399394],"category_scores_gemma":[0.000040406583,0.0003493011,0.00016777909,0.00013086025,0.000009056232,0.00007210726,0.00017684206,0.00046116672,0.000015942947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017994602,0.00002560955,0.000057341094,0.00040162785,0.00009640777,0.0000022273928,0.00043085936,0.98642904,0.0009985948,0.002241991,0.008992004,0.00030629546],"study_design_scores_gemma":[0.00014821922,0.000019662024,0.000028413026,0.0003103587,0.000050554496,5.592085e-7,0.000031579253,0.96209514,0.021566203,0.0140990615,0.001260684,0.00038956024],"about_ca_topic_score_codex":0.000007779654,"about_ca_topic_score_gemma":0.0000022110257,"teacher_disagreement_score":0.4703743,"about_ca_system_score_codex":0.00006773997,"about_ca_system_score_gemma":0.00002943761,"threshold_uncertainty_score":0.9998959},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01129687,0.0012588596,0.9859171,0.000061217215,0.000043923126,0.00078562455,0.00003432024,0.00022386303,0.00037824654],"genre_scores_gemma":[0.6273228,0.000058106587,0.37099963,0.00006537422,0.000041437997,0.0011134007,0.00036098913,0.000027205706,0.0000110289675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998643,0.000046139303,0.00039018138,0.00054203713,0.00015927164,0.00021936993],"domain_scores_gemma":[0.99906814,0.00030895876,0.00009227153,0.00030165823,0.00013403155,0.00009491455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019540255,0.00028332786,0.0006911077,0.0004296918,0.000080895545,0.0002674989,0.00016480661,0.00015643676,0.000005757333],"category_scores_gemma":[0.0000057900475,0.00028757923,0.00015022687,0.0008082661,0.000036285404,0.000031823347,0.00013275551,0.00024849788,0.0000016006151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002638421,0.00003107155,0.00005445021,0.00007634153,0.0012684268,0.00000185311,0.00010841011,0.9820795,0.000100623096,0.0049341843,0.00009636903,0.011222392],"study_design_scores_gemma":[0.00021793586,0.000021448595,0.0010094496,0.00007684622,0.0009306888,0.0000041773274,0.00021615137,0.9759459,0.00028900144,0.019410541,0.0014059731,0.00047190997],"about_ca_topic_score_codex":0.00008952379,"about_ca_topic_score_gemma":0.000017605815,"teacher_disagreement_score":0.6160259,"about_ca_system_score_codex":0.00011658004,"about_ca_system_score_gemma":0.0000853013,"threshold_uncertainty_score":0.9999576},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2677346,0.000989761,0.7241498,0.0037150495,0.0004129368,0.00071216736,0.00014114201,0.00039104995,0.001753473],"genre_scores_gemma":[0.9873903,0.0001138661,0.011756155,0.00040500052,0.00024504753,0.0000066569683,0.00007407086,0.000008000921,9.4711606e-7],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00001366079,0.00012506136,0.00009762511,0.000020602793,0.00009307522],"domain_scores_gemma":[0.9998127,0.000051228442,0.000022589878,0.00005973969,0.00002499646,0.00002873748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000031659038,0.000072818744,0.00020291329,0.00002327091,0.000010533302,0.000001070906,0.00004403579,0.00006218367,0.0000021863061],"category_scores_gemma":[0.000009249627,0.000056395227,0.000018874867,0.00006815179,0.00007292028,0.000015554346,0.000014054059,0.00009339066,2.7958578e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059027676,0.00007655764,0.0036701038,0.00011832649,0.00009432668,0.0000060304023,0.0013145398,0.000041652533,0.64411455,0.007330385,0.005109479,0.33806503],"study_design_scores_gemma":[0.005176216,0.0014598487,0.0029760345,0.00047047256,0.00008541668,0.0000109674975,0.00031697773,0.60087854,0.27891845,0.09888954,0.010264971,0.0005525612],"about_ca_topic_score_codex":0.000025362513,"about_ca_topic_score_gemma":0.0000021437586,"teacher_disagreement_score":0.71965563,"about_ca_system_score_codex":0.000004605623,"about_ca_system_score_gemma":0.0000024185256,"threshold_uncertainty_score":0.22997306},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44634035,0.0029774052,0.5474074,0.0013232251,0.0007620121,0.00045696134,0.00021295741,0.0003679165,0.00015177498],"genre_scores_gemma":[0.9741561,0.00029632016,0.024882637,0.00019678356,0.0003178482,0.000008394632,0.00006147436,0.000057319823,0.000023156954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808466,0.00007278152,0.0008777051,0.0003184859,0.00032103292,0.0003253155],"domain_scores_gemma":[0.99854416,0.00013709163,0.00050420716,0.00030940058,0.00021397277,0.00029115484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009183402,0.0004025755,0.0014002107,0.00045949937,0.000065379696,0.00017245235,0.00037499904,0.0002261111,0.000037629772],"category_scores_gemma":[0.00009748698,0.00035798183,0.0009649344,0.0004082689,0.00004871699,0.000086038395,0.00019451963,0.0004831155,8.940421e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034935663,0.0011796163,0.0076429234,0.0021537766,0.12278848,0.0021316337,0.005316053,0.5073419,0.07794893,0.00055759394,0.12480304,0.14464246],"study_design_scores_gemma":[0.0011238253,0.00020698995,0.0014190441,0.00010433312,0.0060707214,0.000049698006,0.000056630393,0.9745034,0.00215695,0.006532462,0.007150477,0.00062549673],"about_ca_topic_score_codex":0.000042805535,"about_ca_topic_score_gemma":0.0000060055463,"teacher_disagreement_score":0.5278157,"about_ca_system_score_codex":0.000108097505,"about_ca_system_score_gemma":0.0000420764,"threshold_uncertainty_score":0.9998872},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011328414,0.00033939263,0.98706967,0.000026378388,0.000056087305,0.00056212523,0.0000015622578,0.0005720522,0.000044329772],"genre_scores_gemma":[0.9283716,0.0000014692142,0.07140587,0.000048818183,0.00009090292,0.000007445592,0.000008939648,0.00006297185,0.000001994296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988062,0.00008222033,0.00034018443,0.00022793475,0.0003270445,0.00021643484],"domain_scores_gemma":[0.99916404,0.00009211014,0.0001909722,0.000082758306,0.00040538947,0.00006473728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027902806,0.00021323789,0.0003293646,0.00008911343,0.00015443104,0.00008018045,0.0000762796,0.00008971592,0.0000061612623],"category_scores_gemma":[0.00004195468,0.00020896013,0.0000658147,0.00023162458,0.000043789314,0.00018375019,0.000012276574,0.0002042206,7.9254767e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084164017,0.000010404842,0.000053061445,0.00020962926,0.000038039176,0.000002073861,0.00019217301,0.73528624,0.25527385,0.0000010663864,0.00010505447,0.007986769],"study_design_scores_gemma":[0.0014620153,0.00033068145,0.000010849388,0.0007678077,0.00014350058,0.0000041077624,0.000091822374,0.86612165,0.13068621,0.000061052226,0.000109691675,0.000210593],"about_ca_topic_score_codex":0.00001063968,"about_ca_topic_score_gemma":0.0000011339895,"teacher_disagreement_score":0.91704315,"about_ca_system_score_codex":0.000080478276,"about_ca_system_score_gemma":0.00007869369,"threshold_uncertainty_score":0.8521147},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030285511,0.000025882122,0.9647868,0.0017175064,0.00018520857,0.00024272654,0.00003128708,0.00045872948,0.00226633],"genre_scores_gemma":[0.9949061,0.000047456666,0.004315677,0.00015429102,0.00007004766,0.000025524492,0.00045445233,0.000016780827,0.000009628919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943274,0.000023934195,0.00016819274,0.00014729988,0.00012040374,0.00010740702],"domain_scores_gemma":[0.99974966,0.00003384583,0.000039294915,0.00004960863,0.00008916731,0.000038416332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004412485,0.000105078696,0.00010363786,0.00006840677,0.00003504465,0.000074430034,0.00013629987,0.000038804494,0.00008503739],"category_scores_gemma":[0.00007694402,0.00011164252,0.000030564017,0.00007289604,0.000008868508,0.000088016095,0.000020598378,0.00019960155,0.000004934659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050519262,0.000015493022,0.0008717011,0.0000060971133,0.000013237102,0.0000024840385,0.00012524825,0.987586,0.00507065,0.0035723783,0.00018603253,0.002500109],"study_design_scores_gemma":[0.0003753522,0.00006644394,0.00051971234,0.00005240599,0.0000029838077,6.9603897e-7,0.000020806307,0.9917306,0.00496134,0.00021227315,0.0019466652,0.000110767185],"about_ca_topic_score_codex":0.000015251874,"about_ca_topic_score_gemma":0.000008274474,"teacher_disagreement_score":0.96462065,"about_ca_system_score_codex":0.00005787924,"about_ca_system_score_gemma":0.000007634398,"threshold_uncertainty_score":0.45526496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86465806,0.000044031625,0.12968464,0.00014506489,0.00032965324,0.00045098117,0.000013313712,0.00088563754,0.003788603],"genre_scores_gemma":[0.99809074,0.00023424294,0.0011387694,0.00009682835,0.00006573722,0.0000016369414,0.00004770079,0.000049179554,0.0002751456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887383,0.00012756624,0.00018664397,0.00050960644,0.000082422535,0.000219934],"domain_scores_gemma":[0.99898237,0.00012713186,0.000098952754,0.0006779035,0.00004683177,0.00006679298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009185121,0.00031624848,0.00031265558,0.00018412479,0.0000638146,0.000040890023,0.00047733838,0.00033994936,0.00004428606],"category_scores_gemma":[0.000042752537,0.0002774951,0.00013680241,0.00040616436,0.000060064598,0.00007230417,0.00035248243,0.00082858687,0.000036202593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019981313,0.000044774974,0.00008081764,0.00004402162,0.00008683099,0.00034104488,0.00015543807,0.9588854,0.0035112598,0.03430766,0.0021224471,0.0002205224],"study_design_scores_gemma":[0.0002780695,0.000036632886,0.00010966263,0.00041336718,0.000036644684,0.0000011299442,0.000022839118,0.948188,0.011392095,0.038865346,0.00034906136,0.00030715246],"about_ca_topic_score_codex":0.00002274564,"about_ca_topic_score_gemma":0.0000037393404,"teacher_disagreement_score":0.13343269,"about_ca_system_score_codex":0.00014774587,"about_ca_system_score_gemma":0.000029607403,"threshold_uncertainty_score":0.9999677},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841808,0.0008510879,0.8601931,0.000031623636,0.00009500744,0.0001666904,0.000016195208,0.00011434644,0.00011387132],"genre_scores_gemma":[0.9762227,0.00021325369,0.023423465,0.000015292515,0.0000306547,0.000032179618,8.7736214e-7,0.00003364873,0.00002792739],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991276,0.000028075527,0.00028343353,0.00020818929,0.00013097058,0.00022167599],"domain_scores_gemma":[0.9993728,0.0002423396,0.00007298985,0.00011005603,0.00017174555,0.000030103301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018179005,0.00015526738,0.00021052669,0.00010236153,0.00022692163,0.00009708634,0.000062132945,0.00007985133,0.000006502268],"category_scores_gemma":[0.0000048467255,0.0001289747,0.000042398227,0.00027845107,0.0000669288,0.0002977374,0.0000010831881,0.00020632052,2.1264131e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064731816,0.000018246214,0.000007027166,0.000059613103,0.000028611163,0.0000021449669,0.000102398284,0.4862771,0.020972285,0.000003240924,0.0000034502577,0.49246114],"study_design_scores_gemma":[0.00036926763,0.000085929896,0.000050562052,0.0011839082,0.00003755057,0.000054852288,0.0005934334,0.25373924,0.74333584,0.00033586455,0.000032537766,0.00018103313],"about_ca_topic_score_codex":0.000014989141,"about_ca_topic_score_gemma":0.00014027146,"teacher_disagreement_score":0.8378046,"about_ca_system_score_codex":0.000042383905,"about_ca_system_score_gemma":0.000070354334,"threshold_uncertainty_score":0.5259436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89852387,0.0014054786,0.086233445,0.0026860249,0.000096086784,0.00031518895,0.00010893252,0.0039319643,0.006698987],"genre_scores_gemma":[0.99345887,0.00010083952,0.00602862,0.00026564614,0.000031330164,0.000008182036,0.00007520839,0.000024430548,0.0000068660847],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952215,0.000026753545,0.000101930396,0.00011666672,0.000103257094,0.0001292216],"domain_scores_gemma":[0.9992915,0.000022583303,0.00002294156,0.0005166525,0.00004676836,0.00009956448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003802547,0.00010818998,0.00011533373,0.000023651564,0.000098407174,0.0000755768,0.00034953255,0.000055625726,0.000011927131],"category_scores_gemma":[0.0000340075,0.00009180626,0.000028421255,0.00021073483,0.00004874606,0.00016635518,0.000098463206,0.00025640533,0.000023203404],"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.00024368223,0.0003018351,0.05149027,0.00019410177,0.00059700175,0.00026635308,0.002353194,0.02059354,0.58525646,0.008252095,0.28830937,0.042142116],"study_design_scores_gemma":[0.0014593906,0.00024176328,0.029061183,0.0007572889,0.00013056736,0.00005268926,0.00025933777,0.3049257,0.3330799,0.0010874982,0.3275986,0.0013460587],"about_ca_topic_score_codex":0.0000048723023,"about_ca_topic_score_gemma":0.0000025914517,"teacher_disagreement_score":0.28433216,"about_ca_system_score_codex":0.00002287529,"about_ca_system_score_gemma":0.000008752718,"threshold_uncertainty_score":0.37437505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7130913,0.00038375464,0.1642698,0.00048006108,0.00037576904,0.0004479188,0.000022781267,0.003747968,0.11718061],"genre_scores_gemma":[0.9859178,0.00002928539,0.013663091,0.0002561902,0.000059841033,0.000001518022,0.0000029951427,0.000019906827,0.000049345363],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995759,0.000009078427,0.00014557577,0.0000975116,0.00006449431,0.000107405496],"domain_scores_gemma":[0.9997102,0.000030487954,0.000024617118,0.00014323427,0.00004081915,0.000050658895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000016470849,0.00009141608,0.00016237023,0.000025031677,0.000010001399,0.000008957986,0.000091363945,0.000048602982,0.00007853883],"category_scores_gemma":[0.000016391145,0.00008616958,0.00005332303,0.00009024305,0.000018277078,0.000048516617,0.000031315914,0.00008346902,0.000011691799],"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.000020327538,0.0000077131945,0.000027863489,0.000025636578,0.00004770633,0.000013416187,0.000103849285,0.001962121,0.9676562,0.00010233232,0.020135136,0.009897691],"study_design_scores_gemma":[0.00012425489,0.000052694668,0.000060270206,0.000016478218,0.0000076812785,0.0000032438495,0.000029373194,0.1397468,0.85797626,0.00017863706,0.0017013679,0.00010292403],"about_ca_topic_score_codex":0.000020951895,"about_ca_topic_score_gemma":0.0000019436275,"teacher_disagreement_score":0.2728265,"about_ca_system_score_codex":0.000007136234,"about_ca_system_score_gemma":0.000005597383,"threshold_uncertainty_score":0.35138935},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301045,0.000050345534,0.79573834,0.00010221725,0.0005955944,0.00010367625,0.00000448075,0.00029047436,0.0001044052],"genre_scores_gemma":[0.6097911,0.000029780751,0.3890959,0.00007544247,0.0009626859,0.0000010036955,0.0000024846306,0.000038305214,0.0000032972719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992306,0.000027003061,0.00029122163,0.00012372399,0.00012516705,0.00020228815],"domain_scores_gemma":[0.99955976,0.00003132205,0.0000982393,0.000064920125,0.00013344888,0.00011229685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009253766,0.00013699979,0.00016421008,0.00008695443,0.00016181987,0.00010692556,0.000072988005,0.000089304835,0.000060161557],"category_scores_gemma":[0.000024177054,0.00014429317,0.00009381518,0.000111381196,0.000021549915,0.00022711343,0.000005710251,0.00023744525,0.0000021122567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018510329,0.0000028805448,0.000042754462,0.000009451562,0.000029588851,0.0000051983684,0.00013142168,0.9592045,0.03437897,0.0000052171354,0.0008307143,0.005340781],"study_design_scores_gemma":[0.00022186343,0.000040928582,0.00001149523,0.00006604352,0.000027196287,0.00031655916,0.000050967723,0.948787,0.049709946,0.00021921565,0.00038639593,0.00016242971],"about_ca_topic_score_codex":0.0000035449432,"about_ca_topic_score_gemma":4.8010463e-7,"teacher_disagreement_score":0.40678063,"about_ca_system_score_codex":0.0000686273,"about_ca_system_score_gemma":0.000027733911,"threshold_uncertainty_score":0.58841044},"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":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000028579482,0.97807246,0.01772041,0.0000150028745,0.00006288095,0.0008691483,0.00006173826,0.0009719952,0.0022235045],"genre_scores_gemma":[0.0006231082,0.98744905,0.010815281,0.000022852626,0.00037455285,0.0001742991,0.00022746075,0.0002241673,0.0000892078],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850994,0.000049360857,0.0005305774,0.00042056708,0.00013090431,0.00035863076],"domain_scores_gemma":[0.9993008,0.00013949904,0.0001529184,0.00026522452,0.00005466281,0.000086901986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000057175774,0.00046694503,0.0012533194,0.00045787575,0.000074994285,0.00007225425,0.0002097665,0.0002962386,0.000007391038],"category_scores_gemma":[0.000006842121,0.00046213376,0.00033851282,0.0006754729,0.000043644093,0.00004607421,0.00004277721,0.0004566802,0.000014821371],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015519535,0.0000065299823,6.981815e-8,0.0021060775,0.00004213341,0.00002006335,0.000061104925,0.0011025436,0.000011044576,0.00002625943,0.00087353855,0.99574906],"study_design_scores_gemma":[0.00008751864,0.000012224824,3.9499952e-7,0.0050514694,0.00019753905,0.000036004334,0.000018637025,0.05996003,0.000053766616,0.000111369794,0.9340224,0.00044860353],"about_ca_topic_score_codex":0.0000056054078,"about_ca_topic_score_gemma":0.0000062209015,"teacher_disagreement_score":0.9953005,"about_ca_system_score_codex":0.00013197793,"about_ca_system_score_gemma":0.000046776193,"threshold_uncertainty_score":0.99978304},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4709159,0.0013485637,0.3768227,0.00043214296,0.00047737957,0.00058155967,0.000027873697,0.0043656374,0.14502822],"genre_scores_gemma":[0.9956385,0.00003629657,0.004005436,0.00016516887,0.0000688937,0.000003540819,0.0000038723483,0.000025003843,0.00005331942],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994223,0.000018108649,0.00020162841,0.00011637777,0.00010940586,0.0001321813],"domain_scores_gemma":[0.9996548,0.000033604745,0.000029627345,0.00017574648,0.000042713207,0.000063477244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003606292,0.000108109925,0.0002235203,0.000037611855,0.000013668163,0.00001636608,0.00014112052,0.000055190394,0.00015046136],"category_scores_gemma":[0.000009959664,0.00010275967,0.00006679301,0.00013208597,0.000013908789,0.000068896465,0.00003088998,0.000072761366,0.00003584163],"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.000021073893,0.000019011282,0.00025616522,0.00013692236,0.00009278887,0.000016542643,0.000119118304,0.028555095,0.87317854,0.00024681716,0.09346339,0.0038945416],"study_design_scores_gemma":[0.00013345969,0.000059217855,0.00006993669,0.000056598026,0.000011100404,0.0000026497116,0.00003509785,0.18010195,0.8164484,0.00031859,0.0026233129,0.00013968693],"about_ca_topic_score_codex":0.000020098163,"about_ca_topic_score_gemma":0.0000022166264,"teacher_disagreement_score":0.5247226,"about_ca_system_score_codex":0.0000103435605,"about_ca_system_score_gemma":0.0000067967476,"threshold_uncertainty_score":0.41904178},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1205453,0.00012428178,0.8751078,0.000042385214,0.00006640405,0.00014178573,0.0000137021125,0.00085716107,0.0031011328],"genre_scores_gemma":[0.98748857,0.00000613616,0.01233291,0.00012443116,0.000013019527,0.000003716694,0.000007162984,0.000016074719,0.00000799306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993769,0.00001917203,0.00020558556,0.00012797222,0.00014551841,0.00012486125],"domain_scores_gemma":[0.99964625,0.000022738117,0.00003084041,0.00018044957,0.000049750848,0.000069996815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000040125797,0.00011270118,0.00028056122,0.000111051064,0.000017914159,0.000011620123,0.00014042085,0.00004165884,0.000050517447],"category_scores_gemma":[0.000015391657,0.00010796122,0.000109516164,0.00037442593,0.000020858724,0.000030396068,0.000030736235,0.00005543482,0.0000073503106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003533617,0.000111671514,0.0022369758,0.000082003455,0.0033711023,0.000028727642,0.0011426378,0.5473729,0.4397866,0.000058790898,0.0034488721,0.0023243658],"study_design_scores_gemma":[0.00018730371,0.00002200844,0.0014413501,0.000011506395,0.0002632135,2.624873e-7,0.00003528962,0.8862381,0.111515336,0.00003926981,0.00012669651,0.00011967171],"about_ca_topic_score_codex":0.000019179213,"about_ca_topic_score_gemma":0.000016202506,"teacher_disagreement_score":0.86694324,"about_ca_system_score_codex":0.000010902742,"about_ca_system_score_gemma":0.0000038167814,"threshold_uncertainty_score":0.44025308},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9968314,0.00013563695,0.0005760294,0.00013816466,0.00007415162,0.00032375316,0.0000053609324,0.00021042378,0.0017050569],"genre_scores_gemma":[0.9969919,0.000018537092,0.0028769826,0.000036178822,0.000031745076,0.00002229587,0.0000025681513,0.000014957933,0.000004852711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993204,0.0000405806,0.00017775423,0.00016043779,0.00015359902,0.00014724424],"domain_scores_gemma":[0.99952054,0.000024158482,0.00005138428,0.0003401707,0.00003775966,0.000025964982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004325668,0.00010369309,0.00015136231,0.000034671702,0.00017359205,0.0000105501695,0.00011661383,0.000028423594,0.000023606663],"category_scores_gemma":[0.000004988119,0.0000871563,0.00003764598,0.00012483631,0.000104607345,0.000039014536,0.00016533703,0.00017501043,5.863053e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018282351,0.00007004693,0.0000128381225,0.000053028973,0.000050198374,8.2945724e-7,0.0019026363,0.5689048,0.40175095,0.001659276,0.0013678687,0.024044713],"study_design_scores_gemma":[0.00017653203,0.00009391594,0.0004814436,0.000017557262,0.00003409794,0.00002949716,0.00072473625,0.089567326,0.86350304,0.04459459,0.0005256405,0.00025165128],"about_ca_topic_score_codex":0.000030207555,"about_ca_topic_score_gemma":6.261865e-7,"teacher_disagreement_score":0.47933748,"about_ca_system_score_codex":0.000022482687,"about_ca_system_score_gemma":0.00000971499,"threshold_uncertainty_score":0.35541308},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022814794,0.00024144458,0.99708307,0.00019002327,0.00007322384,0.0009248996,0.000046773428,0.0005387754,0.00067365065],"genre_scores_gemma":[0.12646814,0.00006141793,0.8705929,0.00019913111,0.00006293607,0.0012001472,0.001336904,0.000040178496,0.00003824081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923897,0.00004797936,0.0002554081,0.00021842476,0.00010088741,0.00013833633],"domain_scores_gemma":[0.99949414,0.00011610235,0.00007124546,0.00011529835,0.00014273063,0.000060500104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012156028,0.00013490836,0.00013923494,0.00014574084,0.00044376886,0.00007493926,0.0001113973,0.000033400524,0.00007621288],"category_scores_gemma":[0.000004639928,0.00015958455,0.000041661846,0.00037856173,0.00003315454,0.00010259078,0.00004682867,0.00010449928,9.1243584e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048101206,0.000043766337,0.000018706649,0.0000113114,0.000025520405,9.632864e-8,0.00006446164,0.9910451,0.0002367222,0.004695931,0.00050937757,0.0033442047],"study_design_scores_gemma":[0.00033184243,0.000031880445,0.000060547933,0.0000049278524,0.000021421267,0.0000128029415,0.000024880228,0.9882818,0.0002546499,0.0032869277,0.007511297,0.0001770269],"about_ca_topic_score_codex":0.0000022651852,"about_ca_topic_score_gemma":1.6024276e-7,"teacher_disagreement_score":0.12649016,"about_ca_system_score_codex":0.00007524544,"about_ca_system_score_gemma":0.000023152765,"threshold_uncertainty_score":0.65076697},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8252759,0.000093361065,0.1730713,0.0004294892,0.00013850411,0.0003355152,0.000021713899,0.0004570445,0.00017715323],"genre_scores_gemma":[0.9763454,0.0000038925687,0.023357868,0.000121509016,0.000080697835,0.0000103714665,0.000053564898,0.000019268587,0.0000074174595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994294,0.000022668588,0.00020023767,0.00013605555,0.00011668311,0.0000949621],"domain_scores_gemma":[0.99958855,0.0001122398,0.000057290814,0.000069879476,0.00012554071,0.000046481608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002703393,0.00009155959,0.0001355881,0.00004448266,0.00004353718,0.000009675319,0.000049161685,0.000038170914,0.0000075392963],"category_scores_gemma":[0.000041611693,0.000085695414,0.00006167958,0.000117310876,0.000020015344,0.00008884424,0.000018078206,0.00006110245,0.0000037182683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051197898,0.000018467506,0.00025021692,0.000035063942,0.000016231601,0.0000032837272,0.0002803568,0.5914217,0.39003593,0.00009969619,0.009195271,0.008592526],"study_design_scores_gemma":[0.0002490543,0.000079370606,0.0016909498,0.00003343625,0.000012028582,0.0000027783442,0.000034907527,0.84150344,0.15584396,0.00025439012,0.00021536637,0.00008032891],"about_ca_topic_score_codex":0.000005204247,"about_ca_topic_score_gemma":6.7993903e-7,"teacher_disagreement_score":0.2500817,"about_ca_system_score_codex":0.000008489192,"about_ca_system_score_gemma":0.0000057949505,"threshold_uncertainty_score":0.34945577},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014731308,0.00011246171,0.99708235,0.0001854432,0.00051428674,0.0001630055,0.00004159251,0.00008124633,0.00034650444],"genre_scores_gemma":[0.29470748,0.000022926835,0.70507264,0.00007442916,0.000080370795,0.0000054116936,0.000014037666,0.000020168103,0.0000025230452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880475,0.00012761283,0.00048225702,0.00011829357,0.00030142334,0.00016564825],"domain_scores_gemma":[0.9986126,0.00011591203,0.00023668802,0.00013096843,0.0008362961,0.00006755829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039363946,0.00013430654,0.00028489638,0.00011295236,0.00011245043,0.000032445965,0.00018548971,0.00007620025,0.000099568],"category_scores_gemma":[0.00018554082,0.00014003363,0.00008220507,0.00045542914,0.000023961094,0.00035605681,0.000035969984,0.0001617331,1.8290844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013521286,0.00007169728,0.000036593457,0.000010395888,0.000056019144,0.000005012357,0.00006283683,0.99505067,0.00036246402,0.0024560913,0.0009320359,0.0008209857],"study_design_scores_gemma":[0.00050675665,0.0006060504,0.000041293024,0.00003981578,0.00008579774,0.000065438864,0.00018153437,0.9952391,0.0016944497,0.0012988163,0.00010271305,0.00013824806],"about_ca_topic_score_codex":0.0000118531825,"about_ca_topic_score_gemma":0.0000010808737,"teacher_disagreement_score":0.29323435,"about_ca_system_score_codex":0.00022103713,"about_ca_system_score_gemma":0.000073825395,"threshold_uncertainty_score":0.5710406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34555143,0.000102893224,0.65364146,0.0000254165,0.0001034061,0.0002958111,0.00006464626,0.00009997874,0.00011494044],"genre_scores_gemma":[0.4505169,0.00002657001,0.54897213,0.000002813841,0.000025646374,0.00002188146,0.0004038546,0.00002431773,0.000005868512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893063,0.000016154307,0.0005755661,0.00015843581,0.00021840827,0.000100787765],"domain_scores_gemma":[0.99864876,0.00027469578,0.00024424517,0.00021350042,0.000586629,0.000032141346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115648916,0.00018728359,0.00042437617,0.00017861837,0.0000505358,0.000035322624,0.00013341397,0.00013461514,0.000008038729],"category_scores_gemma":[0.00006424194,0.00021664947,0.000123491,0.00009347029,0.000077979545,0.00009693393,0.00010460462,0.00013277389,3.717586e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038173735,0.000093695286,0.0000034241796,0.00068841496,0.00012464495,3.2442162e-7,0.00049310643,0.9555742,0.00022955574,0.0425461,0.00009591387,0.00014680832],"study_design_scores_gemma":[0.00022605802,0.000025237918,0.000027909133,0.000271578,0.000086190754,0.000004512131,0.0000420878,0.77415526,0.0038287402,0.22119327,0.0000068528093,0.00013230823],"about_ca_topic_score_codex":0.0000067863093,"about_ca_topic_score_gemma":0.00000126567,"teacher_disagreement_score":0.18141894,"about_ca_system_score_codex":0.000032292617,"about_ca_system_score_gemma":0.00009714578,"threshold_uncertainty_score":0.8834709},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2407602,0.00009677588,0.7582847,0.000035965586,0.00005460658,0.00015674383,0.000043128282,0.00035260446,0.00021527408],"genre_scores_gemma":[0.9951355,0.000047042995,0.004505352,0.00013447322,0.00006135179,0.000034276527,0.000008365656,0.00004969618,0.000023928185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.000021494545,0.00040119028,0.0002874645,0.000315343,0.0002643251],"domain_scores_gemma":[0.9994506,0.000100257515,0.00010253577,0.00013328313,0.000113319744,0.00009995869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001388766,0.00023218596,0.00040285845,0.00031416395,0.000162535,0.00007311967,0.0001983596,0.000101531485,0.000101891244],"category_scores_gemma":[0.0000016621112,0.00024043523,0.0002656611,0.0006877401,0.000034908764,0.00032736958,0.0000016792688,0.0002697589,0.0000046703717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013583987,0.00003924018,0.000014955339,0.00012714877,0.00038477225,0.000002615175,0.00030498402,0.7966441,0.082793005,0.000002046552,0.000034633653,0.11951667],"study_design_scores_gemma":[0.00018729354,0.00014491,0.00005992753,0.00012560318,0.0005509463,0.0000025903632,0.000071295864,0.6146124,0.3839074,0.000061431194,0.0000579143,0.00021826176],"about_ca_topic_score_codex":0.0000056786416,"about_ca_topic_score_gemma":0.0000069738744,"teacher_disagreement_score":0.75437534,"about_ca_system_score_codex":0.000050992985,"about_ca_system_score_gemma":0.000043356547,"threshold_uncertainty_score":0.98046637},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32132396,0.00040416722,0.677617,0.000033129272,0.00009510266,0.00029240185,0.0000160686,0.00012291034,0.00009528462],"genre_scores_gemma":[0.99863255,0.0001146075,0.0011796617,0.000007954845,0.000022250597,0.0000123351565,0.0000015450097,0.00002326785,0.000005841651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993123,0.000021739857,0.00023100329,0.00013850194,0.00010612407,0.00019036303],"domain_scores_gemma":[0.99962074,0.00007282607,0.0000750003,0.00012195283,0.000064523265,0.00004497386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005406099,0.00012595135,0.00026407145,0.000056355384,0.000047837297,0.000011411855,0.000047188078,0.00007101226,0.0000010386982],"category_scores_gemma":[0.0000027604272,0.00012717846,0.00006497689,0.00012938784,0.000035209123,0.000021012658,5.0176595e-7,0.000113147216,5.9675756e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002912111,0.000015870019,0.0000014574385,0.00012203584,0.00005937741,4.422194e-7,0.00042519896,0.7745888,0.22253524,0.00022274721,0.000058862286,0.0019408222],"study_design_scores_gemma":[0.0002588587,0.00021670276,0.000005351176,0.0001679132,0.0000419463,0.0000066143457,0.00010899959,0.7533178,0.24573797,0.00003394957,0.0000128417,0.00009110059],"about_ca_topic_score_codex":0.00014411399,"about_ca_topic_score_gemma":0.000015611944,"teacher_disagreement_score":0.67730856,"about_ca_system_score_codex":0.000045680543,"about_ca_system_score_gemma":0.000026834163,"threshold_uncertainty_score":0.5186187},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04772535,0.00003087487,0.949744,0.00009136481,0.00002182229,0.001574108,0.00013883525,0.00009969246,0.00057393615],"genre_scores_gemma":[0.4378555,0.0000033743786,0.56177825,0.0000040386826,0.0000097129505,0.00019206249,0.00011136031,0.000021716713,0.000023963608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998709,0.000100748315,0.00040738378,0.00014726161,0.0004381802,0.00019737767],"domain_scores_gemma":[0.99875534,0.00017974772,0.000053441898,0.0002534779,0.0007210358,0.000036945516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008857009,0.00011144277,0.00026698777,0.00027519252,0.00030319946,0.00005711418,0.00019151556,0.000037396934,0.00009849949],"category_scores_gemma":[0.000052478517,0.00010639143,0.000045077784,0.00038224828,0.00022229955,0.000115692215,0.00007947846,0.00020476672,5.1425826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028612638,0.00021954064,0.000013237157,0.0003246197,0.00007473575,8.416966e-7,0.0019578761,0.8560645,0.1355761,0.0053356723,0.00010115786,0.00030308904],"study_design_scores_gemma":[0.00042469002,0.0002508586,0.000006788281,0.00012007708,0.000016811498,0.00001224055,0.0005137063,0.8995681,0.09859279,0.0003679524,0.000031362375,0.00009466826],"about_ca_topic_score_codex":0.00003481584,"about_ca_topic_score_gemma":0.000024734542,"teacher_disagreement_score":0.39013016,"about_ca_system_score_codex":0.00006537196,"about_ca_system_score_gemma":0.00007704062,"threshold_uncertainty_score":0.43385166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14469711,0.00026778659,0.85400504,0.00016254405,0.00022855209,0.00015480336,0.00006884741,0.00009809713,0.00031720035],"genre_scores_gemma":[0.9659047,0.000033795935,0.033478994,0.00019024906,0.00032165425,0.0000018941429,0.00003280052,0.00002825171,0.0000076512515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993008,0.000035341276,0.00027976852,0.00010590944,0.00017705897,0.00010114588],"domain_scores_gemma":[0.9993745,0.000121640645,0.00016733285,0.000197888,0.00008242974,0.00005622149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025843573,0.00010137069,0.00018944043,0.000058611346,0.00003385311,0.000052039606,0.00032944334,0.000045948927,0.000014002316],"category_scores_gemma":[0.000087594526,0.00008057991,0.000046079946,0.00005934354,0.000022795399,0.00028626592,0.000034330253,0.00013165358,0.0000029889259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012667821,0.00040883545,0.00035990443,0.00028108252,0.0026723088,0.000110693225,0.0076241414,0.282007,0.2246624,0.0028840208,0.1825429,0.2837789],"study_design_scores_gemma":[0.004524261,0.0013447313,0.00037493225,0.0006245106,0.0005378133,0.00009437511,0.0026824705,0.633632,0.32166708,0.017038433,0.016632013,0.00084738],"about_ca_topic_score_codex":0.0000013049917,"about_ca_topic_score_gemma":8.113866e-7,"teacher_disagreement_score":0.8212076,"about_ca_system_score_codex":0.000028265611,"about_ca_system_score_gemma":0.000027371083,"threshold_uncertainty_score":0.32859537},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619165,0.00002820684,0.13635646,0.0009398913,0.000101852966,0.00006513991,0.0000030480664,0.00002677826,0.0005621261],"genre_scores_gemma":[0.99722457,0.000024885769,0.0019313786,0.00079559773,0.000020741974,1.9842741e-7,2.7367378e-7,0.0000017005423,6.5504696e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963117,0.000016967666,0.00021049293,0.000013390954,0.000088952605,0.00003902271],"domain_scores_gemma":[0.99962395,0.00006420632,0.00010574046,0.000046495774,0.00012421944,0.00003539792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000735903,0.000039780363,0.00008066281,0.00003684669,0.000014559868,0.000025419564,0.000052888823,0.000019594632,0.000004316263],"category_scores_gemma":[0.00031408996,0.000027559117,0.000025312092,0.00008810022,0.0000121214,0.00044862635,0.000022158205,0.000069958085,0.0000018929663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002053357,0.00003881452,0.018895563,0.0002676985,0.00020885978,0.0000037270202,0.02831067,0.2836555,0.09197748,0.001822054,0.035521578,0.5390927],"study_design_scores_gemma":[0.0005467779,0.00023194824,0.049651176,0.00037399324,0.000041429706,0.000054152562,0.00039695375,0.55924696,0.36366022,0.00045570548,0.025111426,0.00022929204],"about_ca_topic_score_codex":0.000004991217,"about_ca_topic_score_gemma":6.266028e-7,"teacher_disagreement_score":0.5388634,"about_ca_system_score_codex":0.0000062635777,"about_ca_system_score_gemma":0.000010603175,"threshold_uncertainty_score":0.11238282},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5012033,0.0002684097,0.4976735,0.00023581617,0.00007437819,0.0004790013,0.000010437678,0.00003303877,0.000022130072],"genre_scores_gemma":[0.9946687,0.00004161932,0.005131285,0.000018411656,0.00009852467,0.000021669248,0.0000037337256,0.000015259058,7.557811e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989166,0.00011782119,0.00033013787,0.00012379281,0.00025796812,0.00025364495],"domain_scores_gemma":[0.99925894,0.00018576998,0.00007165043,0.00006873406,0.00022779593,0.00018712906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035730188,0.00009996223,0.00027813634,0.00011835282,0.00004330036,0.000067675435,0.00009015071,0.000048358397,9.727977e-7],"category_scores_gemma":[0.000049592687,0.000072384275,0.000036805068,0.00013121546,0.00008472104,0.00010589737,0.0000058312494,0.00027643924,1.4933941e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060055347,0.00003957208,0.000087086555,0.00003939322,0.000031482927,0.00004050661,0.000066374996,0.9819592,0.015802443,0.00049716653,0.000009846411,0.0008263268],"study_design_scores_gemma":[0.0022942435,0.0012841292,0.00013648582,0.00024084735,0.000010626943,0.00005251067,0.00020216728,0.9947735,0.0006960839,0.00016969716,0.000049875383,0.00008980839],"about_ca_topic_score_codex":0.0000040544137,"about_ca_topic_score_gemma":0.000002768773,"teacher_disagreement_score":0.49346545,"about_ca_system_score_codex":0.00009061012,"about_ca_system_score_gemma":0.000024404319,"threshold_uncertainty_score":0.2951745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33389345,0.00035477168,0.66399074,0.000028604363,0.00023195357,0.00044346464,0.000041259675,0.0005205854,0.00049515325],"genre_scores_gemma":[0.99503475,0.00049882015,0.0042486736,0.000036386104,0.00006615091,0.000003277711,0.000053844025,0.00004372927,0.000014392842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990367,0.000028431272,0.00018371586,0.0004991915,0.000028185103,0.0002237634],"domain_scores_gemma":[0.99941534,0.000112576774,0.00009455828,0.000253526,0.00007226259,0.00005174024],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004736264,0.000270477,0.00032961412,0.00020011517,0.000055446777,0.00011928496,0.00022119681,0.00016421205,0.0000037465077],"category_scores_gemma":[0.000021625356,0.00034874826,0.00008892071,0.00014342461,0.000053962605,0.00023908514,0.00023805337,0.00032541555,6.824074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010488545,0.000015598127,0.00056181184,0.00027694865,0.00008572309,0.00005672824,0.00034804697,0.9875247,0.0066426997,0.002837319,0.00033756375,0.0012080114],"study_design_scores_gemma":[0.00038493803,0.000020968044,0.00038925803,0.00033372035,0.000057731388,0.0000019259369,0.0004934001,0.9503102,0.0017692259,0.04574504,0.00011860082,0.00037503333],"about_ca_topic_score_codex":0.00010428758,"about_ca_topic_score_gemma":0.000054138014,"teacher_disagreement_score":0.6611413,"about_ca_system_score_codex":0.00008710235,"about_ca_system_score_gemma":0.000047651654,"threshold_uncertainty_score":0.99989647},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036111563,0.0003909278,0.9940567,0.00011404792,0.00021834635,0.00017386411,0.00002079016,0.00064415607,0.00076999346],"genre_scores_gemma":[0.8835742,0.000106730244,0.11597355,0.00006902009,0.0000417948,0.00009451085,0.000005934558,0.000037249534,0.000097029],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992866,0.00001684494,0.00018825695,0.00021356538,0.00010609857,0.0001886335],"domain_scores_gemma":[0.99932814,0.000058071077,0.000030260631,0.0001584141,0.0003810127,0.00004409242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000055360746,0.00014844589,0.00013802473,0.000065265165,0.00018603445,0.00013311899,0.00007931296,0.000070956594,0.00002192374],"category_scores_gemma":[0.000008582697,0.00016507045,0.00005496424,0.00038368636,0.00004478913,0.00029281032,6.631671e-7,0.00015585542,0.000010639233],"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.00004646947,0.000115985975,0.000001133349,0.00016255437,0.00006798807,0.000017194387,0.0011350288,0.22579406,0.3146818,0.000054557826,0.00072472607,0.4571985],"study_design_scores_gemma":[0.00007302279,0.000027307855,0.0000020729317,0.00011899425,0.000026518946,0.000009408996,0.00036718824,0.22190434,0.77635753,0.00027020666,0.0006905267,0.00015288962],"about_ca_topic_score_codex":0.0000019008918,"about_ca_topic_score_gemma":0.000011258394,"teacher_disagreement_score":0.87996304,"about_ca_system_score_codex":0.00006000481,"about_ca_system_score_gemma":0.0000819974,"threshold_uncertainty_score":0.6731378},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011873026,0.000116513256,0.98576814,0.000081715356,0.00027414976,0.0005173519,0.000016458187,0.001144236,0.0002084158],"genre_scores_gemma":[0.7536268,0.000016135498,0.24534106,0.00025827973,0.00057814294,0.000073836934,0.000036885354,0.00006527084,0.0000035557919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880457,0.00004113593,0.00023521333,0.00035759475,0.00018832476,0.00037317906],"domain_scores_gemma":[0.9994157,0.00013145563,0.00006346918,0.00019563393,0.00007781489,0.000115929084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009966782,0.0002703814,0.00026936512,0.00006052145,0.00036831433,0.00008451099,0.0001653411,0.000115496994,0.000008165807],"category_scores_gemma":[0.00000258949,0.000266847,0.00008545538,0.00031164338,0.000032716172,0.00022779003,0.000002360827,0.00032604238,0.0000032366981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017670615,0.000030175608,0.000028543116,0.000029516841,0.00007469927,0.0000019107074,0.0006465187,0.9634572,0.00028911885,0.000021921278,0.00014571499,0.035097934],"study_design_scores_gemma":[0.0003540075,0.00035888582,0.00016212644,0.00021226011,0.00009171154,0.000012692655,0.00013006652,0.99693304,0.00035424798,0.00033428942,0.00072086987,0.00033579217],"about_ca_topic_score_codex":0.000013000838,"about_ca_topic_score_gemma":0.000019082496,"teacher_disagreement_score":0.7417538,"about_ca_system_score_codex":0.000069173126,"about_ca_system_score_gemma":0.000016113012,"threshold_uncertainty_score":0.99997836},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.156753,0.00014480918,0.83877826,0.000028754266,0.0006977493,0.000735152,0.000036622027,0.0021019378,0.00072371523],"genre_scores_gemma":[0.99019265,0.00009176828,0.009289204,0.00005125355,0.00016341673,0.000005044336,0.000048455262,0.000068772075,0.0000894311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878275,0.000023993292,0.00018652092,0.0006143153,0.000049953836,0.00034247056],"domain_scores_gemma":[0.99908835,0.00006158191,0.000110164816,0.00048004897,0.000115907984,0.0001439615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000062993415,0.00034010294,0.0003682012,0.000111024194,0.00009483201,0.00007126283,0.00053083326,0.0002739638,0.000011444895],"category_scores_gemma":[0.000015991656,0.0004405924,0.0002271002,0.00018865231,0.00006779214,0.00010673787,0.000433835,0.00048061405,0.000020475203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023507161,0.00011603794,0.0029592281,0.0021967376,0.00094331655,0.0007745188,0.0006649843,0.90054977,0.046544302,0.01992838,0.0057596005,0.019328041],"study_design_scores_gemma":[0.00029187708,0.00004726647,0.00007946395,0.00017023356,0.00015528842,0.0000027766444,0.000049367874,0.97495973,0.015679505,0.0049755457,0.0030182805,0.0005706459],"about_ca_topic_score_codex":0.0000789429,"about_ca_topic_score_gemma":0.000010829421,"teacher_disagreement_score":0.83343965,"about_ca_system_score_codex":0.000133535,"about_ca_system_score_gemma":0.00004795853,"threshold_uncertainty_score":0.99980456},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050879695,0.000086314445,0.94660264,0.000029119079,0.00018412717,0.00036549987,0.000058682715,0.00050302973,0.0012908768],"genre_scores_gemma":[0.9422827,0.000108346,0.057387814,0.00002575131,0.000025010608,0.0000026743446,0.00007314192,0.000038471946,0.00005613119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878114,0.00010131884,0.0002942099,0.00053271546,0.000047660564,0.00024296297],"domain_scores_gemma":[0.998574,0.00030353264,0.00017656019,0.0006198057,0.00022040145,0.000105679894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001550885,0.00034328352,0.0008306344,0.0005424172,0.000046635367,0.000027206943,0.00048818762,0.00030184316,0.00006778615],"category_scores_gemma":[0.00008615474,0.00039505426,0.00052001793,0.0010454834,0.00018815753,0.000059083985,0.00024647397,0.00039190025,0.0000021578471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106820116,0.00007287654,0.0012024218,0.00041764605,0.006656987,0.000061397266,0.00062964315,0.96744496,0.002678249,0.014013622,0.00063531956,0.0060800714],"study_design_scores_gemma":[0.0002246658,0.000040105035,0.00030679783,0.000113237475,0.0024587843,5.587592e-7,0.0001470126,0.97471875,0.003772044,0.01738478,0.00045349778,0.00037979495],"about_ca_topic_score_codex":0.00013962734,"about_ca_topic_score_gemma":0.00011905401,"teacher_disagreement_score":0.89140296,"about_ca_system_score_codex":0.0000998716,"about_ca_system_score_gemma":0.000050071936,"threshold_uncertainty_score":0.99985015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12904744,0.00018730805,0.75723755,0.00052262354,0.00007295591,0.00015321169,0.0000015154557,0.002873085,0.10990433],"genre_scores_gemma":[0.952481,0.000011202554,0.04692407,0.0004230266,0.00008674269,0.0000040675714,0.0000013696539,0.000026025973,0.000042550833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995951,0.000005033412,0.00007103626,0.000112224756,0.000078710305,0.0001379082],"domain_scores_gemma":[0.9998052,0.000015761578,0.000008828298,0.000090181566,0.000019773712,0.000060264447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015694228,0.00010209043,0.000098263285,0.00002494578,0.00003852737,0.000047537495,0.00006880967,0.000026990658,0.00009442127],"category_scores_gemma":[0.0000047375006,0.00007922045,0.000019525694,0.00011570628,0.000012933073,0.00011947667,0.000020252162,0.00010118961,0.00001479875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010451658,0.000032170497,0.0057970784,0.00009578413,0.00047763428,0.00045451502,0.0055755996,0.6899264,0.11243406,0.021999996,0.13840006,0.024702182],"study_design_scores_gemma":[0.00020936898,0.000085372005,0.00012329771,0.00008667231,0.000017254315,0.000015367594,0.00019488162,0.7098306,0.27948585,0.00020163294,0.009426886,0.0003228301],"about_ca_topic_score_codex":0.0000029444911,"about_ca_topic_score_gemma":0.0000024753906,"teacher_disagreement_score":0.8234335,"about_ca_system_score_codex":0.000012831185,"about_ca_system_score_gemma":0.0000038054927,"threshold_uncertainty_score":0.32305163},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116457246,0.0000868914,0.88132906,0.00041375734,0.000012729097,0.00010626616,7.383286e-7,0.000553466,0.0010398327],"genre_scores_gemma":[0.8048626,0.000018032795,0.19482495,0.000126206,0.00011459404,0.000008551673,0.000022443826,0.000012127898,0.000010477678],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996697,0.000011463799,0.00008304443,0.00011429133,0.000047253616,0.00007430555],"domain_scores_gemma":[0.99981815,0.00006420376,0.000013229832,0.0000412549,0.000020989843,0.000042165273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000026110429,0.000066933135,0.00007877747,0.000012889872,0.000046519574,0.000058636677,0.000020686579,0.000047524918,0.000005319486],"category_scores_gemma":[0.000056907258,0.0000642633,0.000017686616,0.000041383828,0.000008761346,0.0001150394,0.00001130255,0.000093420145,0.0000013624148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014386854,0.000056474026,0.008812488,0.0001270283,0.00024307043,0.000011748699,0.008799947,0.11696755,0.7315818,0.004425439,0.042063154,0.0867674],"study_design_scores_gemma":[0.00009388574,0.00003795757,0.00021537064,0.000006602772,0.000015684598,0.0000027846575,0.00031731414,0.95504564,0.040483754,0.00014888118,0.0035435683,0.00008854617],"about_ca_topic_score_codex":0.000026612879,"about_ca_topic_score_gemma":0.000011840602,"teacher_disagreement_score":0.8380781,"about_ca_system_score_codex":0.000006630874,"about_ca_system_score_gemma":0.0000040356463,"threshold_uncertainty_score":0.26205814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804306,0.00013454707,0.31401968,0.00007672397,0.00005979261,0.00013026348,0.0000020246405,0.00095583027,0.0041905185],"genre_scores_gemma":[0.9945896,0.000013487892,0.005199885,0.00010840676,0.000042340558,0.0000020725995,0.0000028966622,0.00001357718,0.000027719068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960333,0.000010799411,0.00012832861,0.000092349124,0.00008030661,0.00008486795],"domain_scores_gemma":[0.9997707,0.00003537276,0.000018043671,0.000095006966,0.000039728864,0.00004116054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000015979114,0.00008424682,0.000118021686,0.000018294219,0.00001765259,0.00001571367,0.00008611387,0.000045155884,0.00005845765],"category_scores_gemma":[0.000013197411,0.000076766446,0.000024668512,0.000100392564,0.000016800956,0.00005321171,0.000017304348,0.00006182551,0.000014420349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006658616,0.0000066042453,0.00018672967,0.000015499378,0.000017726295,0.000007931711,0.00030556673,0.7924524,0.20125915,0.000058439582,0.002327061,0.003356248],"study_design_scores_gemma":[0.000042870714,0.000034728626,0.000020192188,0.000009454402,0.000004688517,0.0000013665857,0.0000322419,0.6094048,0.3896178,0.00001884817,0.00074288034,0.00007010233],"about_ca_topic_score_codex":0.000026437503,"about_ca_topic_score_gemma":0.0000068187983,"teacher_disagreement_score":0.314159,"about_ca_system_score_codex":0.000007767206,"about_ca_system_score_gemma":0.000004532435,"threshold_uncertainty_score":0.31304446},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023225004,0.000113934846,0.97090495,0.0007801195,0.00013946269,0.00037646972,0.000014534611,0.0027523914,0.001693155],"genre_scores_gemma":[0.44764623,0.000019363839,0.5506255,0.0010012182,0.0003994216,0.0000590029,0.000036955396,0.00016825629,0.00004407779],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889535,0.000021815957,0.00021935305,0.0002835808,0.00018762454,0.00039228483],"domain_scores_gemma":[0.9994125,0.00014773093,0.0000375316,0.00021195455,0.000041398966,0.00014889243],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012199182,0.00025482647,0.00028209182,0.000082099396,0.00010516343,0.0001008013,0.00022943724,0.00010649109,0.00003431787],"category_scores_gemma":[0.000018984256,0.0002633603,0.00013245054,0.00018114371,0.00002078397,0.000120018696,0.00004514449,0.00017702577,0.00006286152],"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.000016133476,0.00001827155,0.000006879475,0.000058557915,0.000074826785,0.000028234488,0.00016451541,0.091565356,0.8062519,0.00039006135,0.037009604,0.06441566],"study_design_scores_gemma":[0.0002394639,0.00003426301,0.0000039969127,0.00004569605,0.000014371194,0.0000029787552,0.000036840782,0.5459773,0.45074454,0.0004908361,0.0021864076,0.00022332874],"about_ca_topic_score_codex":0.00000761113,"about_ca_topic_score_gemma":0.0000029562239,"teacher_disagreement_score":0.45441192,"about_ca_system_score_codex":0.000065684806,"about_ca_system_score_gemma":0.000019319848,"threshold_uncertainty_score":0.9999819},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045611292,0.000077612895,0.95135206,0.00014366736,0.000060896647,0.00017958878,0.000009542647,0.0011414074,0.0014239094],"genre_scores_gemma":[0.71242464,0.00013145615,0.28672755,0.00029852116,0.00019011712,0.00000699025,0.00008168775,0.000040835286,0.00009819852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994521,0.000028429959,0.00012212757,0.00020569237,0.00007652478,0.00011509805],"domain_scores_gemma":[0.999661,0.000026292973,0.000021048945,0.00020180686,0.000019995165,0.0000698162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005438501,0.000109113134,0.000112414404,0.0000309955,0.00004194838,0.00003931267,0.00010881376,0.000053644613,0.00019357997],"category_scores_gemma":[0.000006579531,0.000111109075,0.000012707644,0.00006554316,0.000023332674,0.0002036668,0.0000808995,0.00008077226,0.00005688944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014480036,0.000022034763,0.00006114633,0.00003438114,0.00016119741,0.000019478974,0.0005062263,0.40405744,0.34457657,0.000030393994,0.11323427,0.13715208],"study_design_scores_gemma":[0.000156882,0.00007255609,0.000022597607,0.000022172268,0.000021235777,0.000033938686,0.000039868977,0.94279736,0.054203983,0.000026191678,0.002462833,0.00014037106],"about_ca_topic_score_codex":0.000003998635,"about_ca_topic_score_gemma":3.47249e-7,"teacher_disagreement_score":0.6668133,"about_ca_system_score_codex":0.000020501777,"about_ca_system_score_gemma":0.000004502974,"threshold_uncertainty_score":0.45308965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6306982,0.0010117191,0.36360314,0.000065409055,0.00020079438,0.0010252695,0.00008317903,0.0014489403,0.0018633273],"genre_scores_gemma":[0.99855345,0.0007445036,0.0003745217,0.000008991738,0.00007374904,0.0000036216456,0.00009468093,0.000037612328,0.00010884256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906045,0.00003895497,0.00017224294,0.0005246236,0.000043381366,0.00016036246],"domain_scores_gemma":[0.99938637,0.00002490857,0.0000762373,0.00038644858,0.00005167708,0.00007436297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000044811597,0.00022473205,0.00023256509,0.00020062599,0.000063642125,0.000061267565,0.00030592352,0.00018954837,0.000018254628],"category_scores_gemma":[0.000006893111,0.00028593926,0.000047484893,0.00033713647,0.00007130613,0.00007804309,0.00027418692,0.0006898926,0.00001087654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050093277,0.000065769345,0.021277549,0.00034406243,0.00013820642,0.00018649753,0.00035813786,0.9121271,0.012168682,0.04875084,0.00058089313,0.0039521833],"study_design_scores_gemma":[0.00048736285,0.000022617667,0.015667636,0.00014099214,0.000085731255,0.000009915546,0.00009834881,0.8742467,0.0092495065,0.08300196,0.016073221,0.0009160177],"about_ca_topic_score_codex":0.000036741883,"about_ca_topic_score_gemma":0.00003211392,"teacher_disagreement_score":0.36785525,"about_ca_system_score_codex":0.00008164221,"about_ca_system_score_gemma":0.00001893467,"threshold_uncertainty_score":0.9999593},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014496242,0.000102153484,0.98357004,0.000088413515,0.00007556199,0.00017196519,0.000029103297,0.00097536435,0.0004911612],"genre_scores_gemma":[0.99764013,0.000029562825,0.0021799982,0.00005135654,0.000039707535,0.000018201443,0.0000032987848,0.0000312861,0.000006434762],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99922746,0.000025111383,0.00026672892,0.00016032983,0.00015617964,0.00016420413],"domain_scores_gemma":[0.99965847,0.000056809993,0.000049372695,0.000086504435,0.00008022398,0.000068640424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005234479,0.00014958766,0.0002373104,0.000092357506,0.00014048374,0.00003765531,0.0000985609,0.00006944911,0.00003654336],"category_scores_gemma":[0.0000034772704,0.00014957314,0.00009998415,0.000438675,0.000047336944,0.0001507841,6.7460087e-7,0.0002441452,0.0000060265897],"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.00032330662,0.00009699968,0.0000074164786,0.0002393073,0.00011085262,0.000009429342,0.0008839124,0.40643615,0.5282367,0.000021567226,0.0004953996,0.063139],"study_design_scores_gemma":[0.0005426391,0.000056293728,0.000004565491,0.00015638505,0.000044434713,0.0000051809466,0.00008995117,0.42214805,0.5765732,0.00004269813,0.00020279888,0.00013384312],"about_ca_topic_score_codex":0.0000060645443,"about_ca_topic_score_gemma":0.0000016433713,"teacher_disagreement_score":0.9831439,"about_ca_system_score_codex":0.000025282721,"about_ca_system_score_gemma":0.000030025618,"threshold_uncertainty_score":0.60994154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011721574,0.00004249413,0.9827468,0.00015542257,0.0009924846,0.00029362267,0.000019830459,0.0034990197,0.0005287519],"genre_scores_gemma":[0.87254393,0.000009692422,0.12703983,0.00014476587,0.00017163232,0.0000073652022,0.0000022775232,0.000065628956,0.000014890921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893,0.000051689738,0.00028785024,0.00028774166,0.00019160406,0.00025111402],"domain_scores_gemma":[0.99922335,0.00017027456,0.000045052588,0.00026498784,0.00005210876,0.00024423818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000040280105,0.00026092705,0.00028449993,0.00014080812,0.00010766554,0.00004876183,0.00012100728,0.00015216526,0.00006031892],"category_scores_gemma":[0.0000066695006,0.00027997931,0.00014360584,0.00024605356,0.00003607113,0.00011248351,6.209583e-7,0.0003339244,0.00013988283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008735813,0.000018248202,0.000003460424,0.00006238143,0.000083086976,0.00002327508,0.0003164067,0.40901965,0.15338655,0.0000015431066,0.0013580167,0.43564],"study_design_scores_gemma":[0.0004428237,0.000029274843,0.000010963063,0.00013563655,0.000035864494,0.000012196814,0.000053051604,0.58724195,0.4114945,0.0000025966253,0.00036642278,0.00017473986],"about_ca_topic_score_codex":0.00008654783,"about_ca_topic_score_gemma":0.00001778694,"teacher_disagreement_score":0.8608223,"about_ca_system_score_codex":0.00010143774,"about_ca_system_score_gemma":0.0000356733,"threshold_uncertainty_score":0.99996525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030709323,0.000851872,0.99483556,0.00032832086,0.00022659151,0.00017807102,0.000005280536,0.00010427114,0.00039907993],"genre_scores_gemma":[0.30424342,0.0038339717,0.6910662,0.00015073421,0.0004997853,0.000014263497,0.00005083366,0.00007727283,0.00006356121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.000018107941,0.00043117505,0.00017867799,0.00017999437,0.0001881719],"domain_scores_gemma":[0.999299,0.00007848224,0.00017272886,0.00011148773,0.00021319116,0.00012514775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011837647,0.00018533535,0.00034648692,0.0001143847,0.000089531844,0.00010449748,0.00006595365,0.00014014321,0.00002491393],"category_scores_gemma":[0.000031913616,0.0001729052,0.00006826806,0.00018671475,0.000031832333,0.00018660839,0.000028638884,0.00016768523,4.0219757e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011677327,0.000047572885,0.0000057171205,0.000047959,0.000055880653,0.000010707934,0.00007453855,0.9847175,0.006278136,0.0003697859,0.0013584062,0.0069170254],"study_design_scores_gemma":[0.0008874868,0.00012251313,0.00004403007,0.00007744188,0.00008949701,0.000093661,0.00006531605,0.96734697,0.02873537,0.00076699187,0.0015579364,0.00021276898],"about_ca_topic_score_codex":9.753852e-7,"about_ca_topic_score_gemma":9.515808e-8,"teacher_disagreement_score":0.3037694,"about_ca_system_score_codex":0.00003771126,"about_ca_system_score_gemma":0.000028247481,"threshold_uncertainty_score":0.70508695},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12345509,0.00004245463,0.87334025,0.00004333222,0.0013311468,0.0008171903,0.00027380834,0.00058154494,0.00011515334],"genre_scores_gemma":[0.9943953,0.000022695198,0.0051533896,0.00005071379,0.00018188679,0.0000672854,0.00006105022,0.000052531428,0.000015125473],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859256,0.00010735239,0.0005817886,0.00030131635,0.00017986468,0.00023711988],"domain_scores_gemma":[0.9991355,0.00007692361,0.00016284086,0.00024686067,0.0002719455,0.000105918894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015377927,0.00024178314,0.0003436151,0.00016626697,0.00016243476,0.000079701094,0.00010621868,0.00015377601,0.000025345109],"category_scores_gemma":[0.0000048271936,0.00024954803,0.00015589134,0.00021527337,0.00003416144,0.00044644615,0.0000010310566,0.00021304571,0.0000051063516],"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.00018404213,0.000082828505,0.0000062935683,0.00015522545,0.00018677287,0.0000021497378,0.002473943,0.10039375,0.7170013,0.000049528462,0.0006533069,0.17881083],"study_design_scores_gemma":[0.00042385323,0.00016899734,0.000008596996,0.00011658492,0.00004092784,0.000014058936,0.0026394804,0.5064355,0.48979715,0.000023353341,0.00018398935,0.00014747323],"about_ca_topic_score_codex":0.0001524083,"about_ca_topic_score_gemma":0.00028173896,"teacher_disagreement_score":0.8709402,"about_ca_system_score_codex":0.00010163237,"about_ca_system_score_gemma":0.00003014205,"threshold_uncertainty_score":0.99999565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12327545,0.00035613374,0.8750137,0.000016249665,0.00017438715,0.00009950935,0.000021866648,0.00049373263,0.0005489452],"genre_scores_gemma":[0.99846023,0.000010320036,0.0013648211,0.000034258952,0.000022761282,0.00003250916,0.0000022163163,0.000033483186,0.000039373448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991725,0.000046005942,0.00022907932,0.00014551029,0.00023420791,0.00017269987],"domain_scores_gemma":[0.9997031,0.00003765073,0.00005101469,0.00011959785,0.000049823022,0.00003879337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011908073,0.0001264989,0.00015951658,0.00020340526,0.00026704973,0.000018489,0.00012717191,0.00004089973,0.00021882184],"category_scores_gemma":[5.9929295e-7,0.00014559648,0.000082979655,0.0003092116,0.000034845278,0.00013128246,0.0000013612689,0.00028224383,0.000004450491],"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.000033289525,0.000079538215,0.0000060111,0.000036065445,0.0000321961,0.00000463323,0.00017189402,0.6324508,0.27264944,0.000009301405,0.00029394726,0.09423287],"study_design_scores_gemma":[0.00017782384,0.00011792633,0.00002649021,0.000061447405,0.000034806366,0.000021254955,0.00013779779,0.19892362,0.79925925,0.00043415223,0.00062031875,0.00018514728],"about_ca_topic_score_codex":0.0000137507195,"about_ca_topic_score_gemma":0.0000027463705,"teacher_disagreement_score":0.87518483,"about_ca_system_score_codex":0.000080853075,"about_ca_system_score_gemma":0.000033675155,"threshold_uncertainty_score":0.5937252},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01576827,0.0007932911,0.9800278,0.00011171438,0.00029720276,0.0010951945,0.000019916955,0.00011667944,0.0017699169],"genre_scores_gemma":[0.06717279,0.0015130816,0.93071073,0.00009287161,0.0002646983,0.000026344742,0.00006472395,0.00013406115,0.000020724265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681413,0.00016966465,0.0016639954,0.00042779307,0.00051858457,0.00040584916],"domain_scores_gemma":[0.99719864,0.00040711736,0.0008739433,0.0004588426,0.000786981,0.0002744932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010862424,0.0005536229,0.0015265362,0.00044390265,0.00020903602,0.0008009006,0.0006469795,0.0005005154,0.00010253039],"category_scores_gemma":[0.00052138756,0.0005324265,0.00034674926,0.00037453743,0.000095898424,0.00091581896,0.0005782202,0.00061762944,5.6082376e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010012448,0.00013402727,0.0000014698938,0.00054755475,0.00034822625,0.00003728517,0.0006272263,0.99575907,0.00023032095,0.0012312934,0.00018463036,0.0007987874],"study_design_scores_gemma":[0.0011667317,0.00007632414,2.742766e-7,0.0026721174,0.0005568727,0.00015511877,0.0002273509,0.97929186,0.0030450835,0.012264115,0.000018484247,0.00052566035],"about_ca_topic_score_codex":0.0000025925615,"about_ca_topic_score_gemma":8.953066e-7,"teacher_disagreement_score":0.05140452,"about_ca_system_score_codex":0.0002426853,"about_ca_system_score_gemma":0.00021694694,"threshold_uncertainty_score":0.9997127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008414689,0.15079203,0.8382783,0.000015787737,0.0013004376,0.0003200243,0.00001891356,0.00026085725,0.008929514],"genre_scores_gemma":[0.64718074,0.18344131,0.11268573,0.0013210166,0.013818534,0.00022429026,0.00067303143,0.001841285,0.038814034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860334,0.00019897998,0.00037495434,0.00041702937,0.000110047724,0.00029562626],"domain_scores_gemma":[0.99814385,0.0012980318,0.000092008544,0.0003548834,0.00004349406,0.00006773623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006258517,0.00044402466,0.0008435966,0.00015514565,0.0000547341,0.00011775088,0.00010813809,0.0009709443,0.00002050636],"category_scores_gemma":[0.000044828863,0.0004010241,0.000091158305,0.00005242247,0.000086475186,0.00003600314,0.000082842635,0.0008107661,0.000001101714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075980235,0.000010609665,0.000039546216,0.000511195,0.0007008577,0.00058787235,0.0002549715,0.4054264,0.0002145176,0.034536455,0.0021341755,0.5555074],"study_design_scores_gemma":[0.00069077587,0.00017445166,0.00003774937,0.00788054,0.00032962102,0.0009201593,0.000026286814,0.807514,0.00027817595,0.115453444,0.06455694,0.0021378396],"about_ca_topic_score_codex":0.000043031556,"about_ca_topic_score_gemma":0.000047909663,"teacher_disagreement_score":0.72559255,"about_ca_system_score_codex":0.00004523307,"about_ca_system_score_gemma":0.000014199512,"threshold_uncertainty_score":0.99984413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5803619,0.00013007753,0.40894586,0.000008464708,0.0011875811,0.00025621513,0.000010882457,0.0015883594,0.0075106868],"genre_scores_gemma":[0.9984485,0.00014844383,0.0008530791,0.000011177421,0.00011416249,7.1966934e-7,0.000045090444,0.000043097167,0.00033574292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891853,0.00005054525,0.00015844328,0.00056190055,0.00006603644,0.0002445161],"domain_scores_gemma":[0.9989553,0.000020865122,0.000092158465,0.0006981375,0.00011320073,0.000120320685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000083264546,0.00031285177,0.0002781569,0.00017600988,0.000105970044,0.000018555143,0.00033094242,0.00038197546,0.00007954687],"category_scores_gemma":[0.000008830013,0.00039019942,0.00016287858,0.00018830935,0.00009843294,0.00011468971,0.00041791823,0.000591738,0.00006573432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040078605,0.000042638225,0.00007740991,0.00007746045,0.000115943454,0.00010298861,0.00007639865,0.9876205,0.0047003855,0.0030474414,0.0038359775,0.00026281038],"study_design_scores_gemma":[0.00025268912,0.000035272107,0.00028681112,0.00035218688,0.00023281857,0.000020980533,0.000056057837,0.91417474,0.015130187,0.068380274,0.00029216288,0.0007858481],"about_ca_topic_score_codex":0.00021217213,"about_ca_topic_score_gemma":0.000008855237,"teacher_disagreement_score":0.4180866,"about_ca_system_score_codex":0.00026330687,"about_ca_system_score_gemma":0.000032293057,"threshold_uncertainty_score":0.999855},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102763176,0.00006420029,0.86834675,0.00013525863,0.000051290408,0.000036480647,0.0000012784037,0.0010099417,0.027591633],"genre_scores_gemma":[0.98636276,0.000081964055,0.013345721,0.000028260316,0.000014894891,9.4648385e-7,3.1861492e-7,0.000005052684,0.00016005899],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986327,0.0000032666123,0.000033595807,0.000037557882,0.00002035747,0.000041937725],"domain_scores_gemma":[0.9999045,0.000010967369,0.0000027912706,0.000059878872,0.00000803657,0.000013802781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000016837968,0.000028580529,0.000028869026,0.000011817314,0.000008127038,0.0000061077467,0.000014070786,0.000016710692,0.00006180828],"category_scores_gemma":[0.000003766527,0.000017983886,0.0000049220994,0.000015079415,0.000008814226,0.000042585147,0.000007745987,0.000008724342,0.000004211153],"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.00001531378,0.000041060066,0.005537376,0.0000414575,0.000100533005,0.00001792444,0.00023270932,0.021617334,0.4217826,0.079063594,0.13008274,0.34146735],"study_design_scores_gemma":[0.00051363825,0.000038139096,0.0043029455,0.000105314444,0.000013677601,0.000020623433,0.0000181537,0.1979853,0.7667927,0.010868491,0.018887283,0.0004537183],"about_ca_topic_score_codex":0.0000037960544,"about_ca_topic_score_gemma":0.0000011630231,"teacher_disagreement_score":0.8835996,"about_ca_system_score_codex":0.00000449556,"about_ca_system_score_gemma":6.409873e-7,"threshold_uncertainty_score":0.073336154},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7314252,0.00015980442,0.2671172,0.0007558991,0.00015013828,0.00011749681,9.472961e-7,0.00009442434,0.00017885542],"genre_scores_gemma":[0.73203534,0.000011736094,0.26766276,0.00025438014,0.00002338574,0.0000023967934,0.0000020024156,0.0000075894864,4.2058798e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888766,0.00019409321,0.00028044792,0.0002052456,0.00024684306,0.00018572499],"domain_scores_gemma":[0.9996372,0.000055511686,0.000095384436,0.00007360704,0.000031694624,0.000106607054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565534,0.00011351254,0.00018508227,0.00019740003,0.00008482222,0.00006992444,0.00013585178,0.000037273116,0.0000032671217],"category_scores_gemma":[0.0000779515,0.00009795142,0.000023784034,0.000299285,0.0001774927,0.00038441943,0.000025934958,0.00018149955,4.6150228e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035989033,0.000094132876,0.006081483,0.000030853993,0.000020351647,0.000020190988,0.002604832,0.94086266,0.023798611,0.00029698247,0.00074399187,0.025409946],"study_design_scores_gemma":[0.00023903738,0.00017121172,0.00083245867,0.00009399113,0.000007632498,0.000055027158,0.00023703412,0.9626402,0.02485344,0.010736201,0.000014883315,0.00011885771],"about_ca_topic_score_codex":0.000008800656,"about_ca_topic_score_gemma":6.6788436e-7,"teacher_disagreement_score":0.025291089,"about_ca_system_score_codex":0.000026213556,"about_ca_system_score_gemma":0.00003173861,"threshold_uncertainty_score":0.3994343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96602684,0.00007796525,0.03167985,0.00013922183,0.00017501517,0.00029046822,0.000005432125,0.00009089064,0.0015143267],"genre_scores_gemma":[0.99564314,0.000049173603,0.004175196,0.000051483767,0.00002866609,0.000016069826,0.0000022402985,0.00001796363,0.000016086582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989339,0.000006853919,0.0004085323,0.00023548119,0.00021052147,0.00020472107],"domain_scores_gemma":[0.99930197,0.000030553365,0.00011358012,0.00017253021,0.0003361596,0.000045177894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085236185,0.00015225993,0.0002457331,0.00007565448,0.00004062117,0.0000612366,0.00035173303,0.000081212886,0.000016608992],"category_scores_gemma":[0.00005346498,0.00013462997,0.000050586,0.00041703176,0.00004526587,0.00013538996,0.0001568653,0.00019996168,0.0000015907729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007826859,0.00006511962,0.00027921033,0.000017286276,0.0000073569336,2.9431897e-7,0.0004064252,0.73874193,0.23382056,0.01539575,0.00004096385,0.011146853],"study_design_scores_gemma":[0.000015777176,0.000021761443,0.000108207605,0.0003887169,0.0000045490647,3.6334683e-7,0.000066612476,0.5101828,0.48537058,0.003767795,0.0000020050197,0.00007085311],"about_ca_topic_score_codex":0.000065343214,"about_ca_topic_score_gemma":0.000027646387,"teacher_disagreement_score":0.25155002,"about_ca_system_score_codex":0.000032959186,"about_ca_system_score_gemma":0.000022579225,"threshold_uncertainty_score":0.5490051},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083681075,0.00012099132,0.98993915,0.00021282112,0.00003130112,0.00089745625,0.000054458567,0.00030479528,0.000070930924],"genre_scores_gemma":[0.8448416,0.000015048662,0.15445521,0.00031132525,0.00015466646,0.00015430803,0.000032075088,0.000032144537,0.0000035840933],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991634,0.000022491906,0.00025909612,0.00021328276,0.0001754721,0.00016624956],"domain_scores_gemma":[0.999603,0.00009046029,0.0000462488,0.00009322454,0.00006110749,0.00010599115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115775576,0.00015178695,0.00019982172,0.000071522445,0.000045479374,0.000025108027,0.000116066316,0.000050036746,0.000037750735],"category_scores_gemma":[0.000004745595,0.00016515767,0.00005190192,0.00013059925,0.000021644128,0.00009023447,0.000030672512,0.000063589854,0.0000040197256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033340135,0.00006995815,0.000037338137,0.000072292685,0.00019599413,0.0000050352387,0.0004155152,0.15273671,0.5741558,0.0004040073,0.011064067,0.26050988],"study_design_scores_gemma":[0.0004855867,0.0006215988,0.0004156248,0.0000385395,0.000053072312,0.0000047266612,0.000023987626,0.9345948,0.056352288,0.0007234565,0.006483183,0.00020310462],"about_ca_topic_score_codex":0.000010122636,"about_ca_topic_score_gemma":6.611479e-7,"teacher_disagreement_score":0.8364735,"about_ca_system_score_codex":0.000028338465,"about_ca_system_score_gemma":0.000010994829,"threshold_uncertainty_score":0.67349344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32602352,0.000012068489,0.67190033,0.000009085674,0.00017360413,0.0006181212,0.00002539694,0.00044534486,0.0007925142],"genre_scores_gemma":[0.9973954,0.000060716273,0.002358661,0.000010672512,0.0000390166,0.0000035313983,0.00006552399,0.000033788474,0.00003271066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937254,0.000021562171,0.00014086712,0.0003126411,0.00003863009,0.0001137444],"domain_scores_gemma":[0.999374,0.000043290675,0.000094693794,0.00030340333,0.00014110854,0.000043540236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003246901,0.00017458464,0.0002504144,0.00010818712,0.000044209122,0.0000149011175,0.0002094014,0.00015055841,0.000018308787],"category_scores_gemma":[0.000017305141,0.00022844148,0.00008444552,0.00020408754,0.000024687333,0.000066568035,0.0001397729,0.00017190308,0.0000024438011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028186842,0.000063897416,0.00027154418,0.00008102886,0.00014169986,0.000020841608,0.00029488976,0.997306,0.000049191956,0.00070544024,0.0010189632,0.00001833679],"study_design_scores_gemma":[0.00053814077,0.00010844205,0.00010296958,0.00008443055,0.00017542236,5.4724757e-7,0.00038278295,0.99516046,0.0006921782,0.0024308357,0.00009310518,0.00023071471],"about_ca_topic_score_codex":0.00005487381,"about_ca_topic_score_gemma":0.000040796676,"teacher_disagreement_score":0.6713719,"about_ca_system_score_codex":0.00006671605,"about_ca_system_score_gemma":0.000018512417,"threshold_uncertainty_score":0.9315573},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02136574,0.000040402603,0.97435415,0.000013603186,0.0012057482,0.0008426246,0.00021707728,0.0014031935,0.0005574655],"genre_scores_gemma":[0.8190459,0.00003487461,0.1801926,0.00014815551,0.000069530004,0.00013835165,0.00025209412,0.00008401325,0.00003447053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998587,0.00011067449,0.00049452955,0.0002508252,0.00023863718,0.00031829491],"domain_scores_gemma":[0.9985911,0.00017254706,0.00015318024,0.00063167326,0.00033789471,0.00011355897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003285299,0.0004286324,0.00039374185,0.00035993158,0.0002409929,0.00031214432,0.0002107229,0.0003093876,0.00003455506],"category_scores_gemma":[0.0000028778543,0.0004220236,0.00018586311,0.00015147211,0.00007960022,0.00045088635,0.000005331663,0.00065425143,0.000012554139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078689314,0.0000399879,1.36741996e-8,0.000087066095,0.00014261813,0.0000035163037,0.0012624749,0.8826385,0.00044015583,0.00006221115,0.000049506634,0.11519522],"study_design_scores_gemma":[0.000478811,0.00008368479,0.0000019057668,0.00034485108,0.000114977396,0.000020283205,0.0006438238,0.8060954,0.19130392,0.00011753064,0.00036496905,0.00042982778],"about_ca_topic_score_codex":0.000012841809,"about_ca_topic_score_gemma":0.0000056469253,"teacher_disagreement_score":0.79768014,"about_ca_system_score_codex":0.0001336849,"about_ca_system_score_gemma":0.00008930976,"threshold_uncertainty_score":0.99982315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07177803,0.0010401859,0.92457616,0.00004953291,0.00032077543,0.000107611115,0.000057939946,0.0010169896,0.0010528008],"genre_scores_gemma":[0.99320966,0.00015823673,0.006069714,0.00018392301,0.00011078504,0.000029233164,0.000018994973,0.0000689193,0.00015051918],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99882084,0.000050055995,0.00030242247,0.00031740635,0.00022726753,0.00028197755],"domain_scores_gemma":[0.9993976,0.00011209775,0.000042572483,0.0002271368,0.00012717237,0.00009346769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000061668594,0.00025137354,0.00029894023,0.00011887914,0.00022577713,0.00016501882,0.00011708767,0.00013494647,0.00035709154],"category_scores_gemma":[0.000003126429,0.00026699487,0.00014438947,0.00029757028,0.000042276417,0.00029394854,0.0000012189929,0.000368802,0.000034775017],"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.00032486374,0.00028858334,0.0000010830842,0.000037167607,0.00018216476,0.0002280694,0.00023331276,0.20122287,0.32183236,0.0000021258052,0.0010832796,0.47456414],"study_design_scores_gemma":[0.0016754051,0.00005903942,0.000002619339,0.00026831668,0.00010866361,0.00006605481,0.000060964372,0.16581742,0.8299821,0.0010078262,0.00062462944,0.00032693028],"about_ca_topic_score_codex":0.00003638625,"about_ca_topic_score_gemma":0.000030336492,"teacher_disagreement_score":0.92143166,"about_ca_system_score_codex":0.00007061334,"about_ca_system_score_gemma":0.00007429531,"threshold_uncertainty_score":0.99997824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4244924,0.00013175776,0.5744297,0.000048523892,0.00020141123,0.00040802738,0.000025038793,0.0002180091,0.000045166507],"genre_scores_gemma":[0.9975891,0.000022308188,0.0020974334,0.00019647891,0.00003448728,0.00002247706,0.0000075681346,0.00002561274,0.000004534026],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992883,0.00004899047,0.00016570941,0.0001905025,0.00018544427,0.00012101247],"domain_scores_gemma":[0.9997284,0.000027349988,0.000030453491,0.000074960895,0.000054586213,0.0000842423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000067708366,0.00015825786,0.00012441957,0.00006294248,0.00015115003,0.00006232544,0.00003117672,0.00005033276,0.00003515322],"category_scores_gemma":[0.0000031077439,0.0001644596,0.000033284854,0.00005581766,0.000037274647,0.00011432992,0.0000010307423,0.00009004592,0.0000011188131],"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.00015978364,0.00001951608,0.0000048111265,0.00005246182,0.00006175121,8.177676e-7,0.0015585584,0.008354359,0.9100027,0.00004186526,0.00012298052,0.07962038],"study_design_scores_gemma":[0.00083733967,0.00023349062,0.000043896627,0.000054353564,0.000050700368,0.000006142759,0.00080344704,0.022831632,0.974688,0.00014793364,0.00013779191,0.00016525736],"about_ca_topic_score_codex":0.0000052274936,"about_ca_topic_score_gemma":0.000005434886,"teacher_disagreement_score":0.5730967,"about_ca_system_score_codex":0.0000635451,"about_ca_system_score_gemma":0.000008640613,"threshold_uncertainty_score":0.6706468},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.812249,0.000042332016,0.18691036,0.00001852118,0.000021651249,0.00012830428,0.0000018622382,0.00018011994,0.0004478172],"genre_scores_gemma":[0.9691023,0.000014770636,0.030792406,0.000046162728,0.000024239474,0.0000017487218,0.000003887962,0.000013934729,5.1169263e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945813,0.000019020716,0.00017188229,0.00015000238,0.0000874303,0.000113548536],"domain_scores_gemma":[0.9996936,0.0000949093,0.00004261072,0.00009537265,0.00003428809,0.000039235485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000023012717,0.00011409795,0.00020563617,0.00009552527,0.00002286369,0.000021409585,0.000046737146,0.000024487756,0.0000036088243],"category_scores_gemma":[0.000007981093,0.00010285085,0.000017491204,0.00019196753,0.00006313743,0.00010131886,0.000032980348,0.0000748669,1.9992693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048892334,0.000053116273,0.030955497,0.0006605159,0.00017521485,0.00021111907,0.003378283,0.39965096,0.39621735,0.000055909644,0.0005052751,0.16764785],"study_design_scores_gemma":[0.00033775094,0.000119223136,0.017801689,0.00028032673,0.000015187851,0.000018254215,0.00008683051,0.94354576,0.03764158,0.000016196715,0.0000028841819,0.00013430769],"about_ca_topic_score_codex":0.000024080206,"about_ca_topic_score_gemma":0.000003962823,"teacher_disagreement_score":0.5438948,"about_ca_system_score_codex":0.0000055557452,"about_ca_system_score_gemma":0.000004704594,"threshold_uncertainty_score":0.4194136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6168705,0.0012348269,0.37750176,0.0012383022,0.00072473456,0.00015263184,0.00023860107,0.000060202197,0.0019784044],"genre_scores_gemma":[0.9572188,0.00023417293,0.04242372,0.000061258,0.000053105505,2.828213e-7,0.0000024279466,0.0000044848052,0.0000016935829],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993929,0.000020578507,0.00031662115,0.00004749183,0.00018125014,0.000041139996],"domain_scores_gemma":[0.9992429,0.00009166658,0.00013361144,0.000041033865,0.0004394942,0.000051264342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103057486,0.000055692326,0.00015538018,0.00002606517,0.000009001599,0.000014250022,0.00010306764,0.000023726177,0.000044451637],"category_scores_gemma":[0.00017917702,0.000044373275,0.000029689469,0.000023993336,0.00006409211,0.000046133307,0.000023766417,0.000092019785,3.945243e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025947564,0.00053706265,0.05986252,0.0011205014,0.0022452923,0.0007821422,0.006755209,0.006615061,0.24014753,0.20531186,0.08625716,0.3877709],"study_design_scores_gemma":[0.004443994,0.0013742474,0.04329683,0.0013036977,0.00023595964,0.00047309496,0.00026897705,0.1480555,0.17922135,0.5906994,0.029857675,0.00076932315],"about_ca_topic_score_codex":0.0000043142827,"about_ca_topic_score_gemma":7.7830043e-7,"teacher_disagreement_score":0.38700157,"about_ca_system_score_codex":0.000012583363,"about_ca_system_score_gemma":0.000022565213,"threshold_uncertainty_score":0.18094896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29595417,0.00045404874,0.7016064,0.00032478318,0.00033595742,0.0000765568,0.00023264316,0.000104996856,0.00091044395],"genre_scores_gemma":[0.9545489,0.000017713854,0.045146417,0.00017722885,0.00008395627,2.6190312e-7,0.000006910649,0.0000147492565,0.0000038917665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993551,0.000017239397,0.00029001976,0.000050764786,0.000116197334,0.00017069199],"domain_scores_gemma":[0.9991291,0.000035616773,0.000076512435,0.00008783208,0.00010679498,0.00056412816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005393658,0.00009044573,0.0002394052,0.00020339829,0.000036221187,0.000044100158,0.0001481501,0.000032131415,0.00019817975],"category_scores_gemma":[0.00005947324,0.00009166731,0.00006401623,0.00026922714,0.000034190933,0.00004044559,0.0000049989453,0.00016451189,0.000011917688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019185558,0.00003291471,0.023222988,0.00022656431,0.005422921,0.008928396,0.006692992,0.5092666,0.002762616,0.011139944,0.36042398,0.07186089],"study_design_scores_gemma":[0.00019976168,0.000100543315,0.01726486,0.000046852856,0.0006739855,0.00006217682,0.00009306916,0.9573981,0.0009783728,0.00072413025,0.022212168,0.00024594725],"about_ca_topic_score_codex":0.00030738316,"about_ca_topic_score_gemma":0.0021895184,"teacher_disagreement_score":0.6585947,"about_ca_system_score_codex":0.00007396527,"about_ca_system_score_gemma":0.00015667798,"threshold_uncertainty_score":0.3738084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3729717,0.000037281614,0.624246,0.000030039568,0.0008575717,0.0004910917,0.000081227896,0.00061055645,0.00067449163],"genre_scores_gemma":[0.9992793,0.00006144174,0.00020161472,0.000028784387,0.00020144436,0.0000043106947,0.00013755565,0.000037277314,0.000048255242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.000033126733,0.0001912505,0.00040157177,0.000066865534,0.00016810375],"domain_scores_gemma":[0.9993035,0.000044674653,0.00014653028,0.00033204904,0.00011002656,0.00006320513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000049479157,0.00023511176,0.00025438998,0.00015262468,0.00007129652,0.000020942487,0.0001715116,0.00018630101,0.00004976932],"category_scores_gemma":[0.000008120909,0.0002636403,0.00018131001,0.0001507028,0.000033108452,0.000089402296,0.00011973252,0.00024127081,0.000010191939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094471214,0.0000727342,0.0017308845,0.00041452973,0.0004893854,0.000021800352,0.00025767414,0.9377037,0.012226171,0.022338405,0.014386112,0.009413873],"study_design_scores_gemma":[0.0022040403,0.0012232296,0.0060725785,0.0008508014,0.0009805538,0.000001752814,0.0014940476,0.78218573,0.15838344,0.0388984,0.006464613,0.0012408289],"about_ca_topic_score_codex":0.000056238332,"about_ca_topic_score_gemma":0.00001987672,"teacher_disagreement_score":0.6263076,"about_ca_system_score_codex":0.00008276848,"about_ca_system_score_gemma":0.000033729408,"threshold_uncertainty_score":0.9999816},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8411311,0.00007868343,0.15495622,0.0002763735,0.00020774976,0.00072349934,0.000032664124,0.0014363063,0.0011574464],"genre_scores_gemma":[0.9952657,0.000007129173,0.004295255,0.00009717903,0.00023972754,0.00004038744,0.000022793485,0.000025525966,0.0000062557456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993539,0.000006548519,0.0001990064,0.00015601238,0.00009798325,0.00018659141],"domain_scores_gemma":[0.9997768,0.000018647223,0.000031658645,0.00006254761,0.000041848252,0.00006853699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030643714,0.00012756446,0.00012122237,0.000036912956,0.000046030167,0.000068584275,0.000070352704,0.00003536566,0.00003589195],"category_scores_gemma":[0.000011002181,0.00012325328,0.000068083034,0.00008090018,0.000021697357,0.00012644222,0.000013200156,0.00006534906,0.0000061888672],"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.0003315368,0.00018927357,0.0023650087,0.00029440445,0.00044552347,0.000022972079,0.003173941,0.009621683,0.4417925,0.0013484827,0.037623145,0.5027915],"study_design_scores_gemma":[0.0013759802,0.0006401745,0.0015404533,0.00020510182,0.0000767655,0.000034560115,0.00030840072,0.53828835,0.4329914,0.0009809661,0.022850845,0.0007070242],"about_ca_topic_score_codex":0.0000011187389,"about_ca_topic_score_gemma":5.4525935e-7,"teacher_disagreement_score":0.5286667,"about_ca_system_score_codex":0.000035769466,"about_ca_system_score_gemma":0.000007846923,"threshold_uncertainty_score":0.5026123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06370027,0.000035864257,0.90557647,0.00037293072,0.0006025411,0.00007509891,0.000010304456,0.0002520359,0.029374454],"genre_scores_gemma":[0.9932159,0.000027261443,0.0058977366,0.000030032954,0.000042321677,0.00001252701,0.00006056713,0.0000147406745,0.0006988869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999194,0.0000674071,0.00022664684,0.00018275899,0.00022791541,0.00010122954],"domain_scores_gemma":[0.9991932,0.00015069214,0.000071518065,0.00016402401,0.00038416695,0.000036416484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006687787,0.00009799075,0.00011992727,0.00013241872,0.000044685672,0.000042860265,0.00013739544,0.000042712283,0.00065168773],"category_scores_gemma":[0.00012933853,0.00011005497,0.000059791073,0.00014365924,0.00003653554,0.00010000505,0.00004019935,0.00020571945,0.000026627955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019848501,0.00006541637,0.0011441673,0.00000861377,0.00017465826,0.000012358134,0.0015383031,0.6942421,0.16040096,0.13576052,0.0005661495,0.006066899],"study_design_scores_gemma":[0.00016372434,0.000032431602,0.0040541203,0.00013221802,0.00001676644,0.000017918706,0.0010427681,0.94422364,0.04298987,0.0069988864,0.00018570707,0.0001419708],"about_ca_topic_score_codex":0.000036331534,"about_ca_topic_score_gemma":0.000015123915,"teacher_disagreement_score":0.92951566,"about_ca_system_score_codex":0.000038391205,"about_ca_system_score_gemma":0.000035634526,"threshold_uncertainty_score":0.7135524},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9678044,0.00039645904,0.024395809,0.0000475247,0.00090036175,0.00027803006,0.000058384958,0.0008185213,0.005300516],"genre_scores_gemma":[0.99862766,0.000031303938,0.0010020952,0.0001133105,0.00006637818,0.00003199913,0.000009382597,0.000040209983,0.00007768361],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990272,0.00007434897,0.0002619512,0.00017169754,0.0002611988,0.00020359557],"domain_scores_gemma":[0.99932027,0.0001078486,0.00009803394,0.0003705886,0.000062367675,0.000040873772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011073082,0.00014452063,0.00026073935,0.00014024602,0.00008844649,0.000045291334,0.00055052305,0.000043567245,0.00018121534],"category_scores_gemma":[0.000015670923,0.00016025563,0.000087773195,0.00025199546,0.000026657282,0.00019525898,0.00017662422,0.00021142211,0.000004395389],"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.00007532989,0.00009296552,0.0008003015,0.000058128928,0.00019450986,0.000085775835,0.00025458803,0.31989554,0.57226735,0.00003914068,0.096304856,0.009931514],"study_design_scores_gemma":[0.0003497656,0.00008259632,0.0019394256,0.0000533536,0.000033833945,0.000021158183,0.000023916702,0.04393973,0.9398951,0.0025854318,0.010744407,0.000331262],"about_ca_topic_score_codex":0.00006393369,"about_ca_topic_score_gemma":0.0000019738434,"teacher_disagreement_score":0.36762777,"about_ca_system_score_codex":0.000047680984,"about_ca_system_score_gemma":0.000021330383,"threshold_uncertainty_score":0.6535035},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10445095,0.00017112844,0.8712734,0.00087893393,0.00016291701,0.00019791024,0.0000014473363,0.002154154,0.020709189],"genre_scores_gemma":[0.9971634,0.000014919424,0.0014336094,0.0011577778,0.00012989838,0.0000012815631,0.000011442641,0.00004492003,0.00004276094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992004,0.000051363822,0.00019292912,0.00021178846,0.000077654804,0.00026584862],"domain_scores_gemma":[0.9996953,0.00006567386,0.000020306496,0.00011761785,0.000021802694,0.00007928856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005054338,0.00018293363,0.00022217233,0.000066540706,0.000039799805,0.00005718443,0.000085183616,0.00005576874,0.00014159708],"category_scores_gemma":[0.000018901052,0.00018679626,0.000051282695,0.00018139115,0.000030216428,0.00007348411,0.00003477106,0.0005524434,0.00002530725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020596775,0.0000060911534,0.000108577886,0.000008320502,0.000022636463,0.00016153535,0.0001813278,0.9881719,0.0017401038,0.00006179892,0.0053399303,0.0041772164],"study_design_scores_gemma":[0.0002374903,0.00009380597,0.00009066625,0.000050813564,0.0000044931467,0.000007989462,0.00010706565,0.89992166,0.09776282,0.000071484246,0.0014423131,0.00020941399],"about_ca_topic_score_codex":0.00003487873,"about_ca_topic_score_gemma":0.00006929065,"teacher_disagreement_score":0.8927124,"about_ca_system_score_codex":0.00005412497,"about_ca_system_score_gemma":0.000021707378,"threshold_uncertainty_score":0.761733},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008598377,0.00019667928,0.98613155,0.000051807765,0.0007885204,0.0003377929,0.000003305657,0.0014759343,0.0024160496],"genre_scores_gemma":[0.8085799,0.000020308351,0.19093534,0.00010245804,0.00014648167,0.00011987838,0.000059168506,0.000027522343,0.000008936981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.000022670376,0.00035071402,0.00008332875,0.000120301615,0.00020084428],"domain_scores_gemma":[0.9993145,0.000024871904,0.00012342364,0.000114104405,0.0003581211,0.00006497057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004008793,0.00014190606,0.00014792949,0.0002197455,0.00012412692,0.00016262743,0.00008094768,0.0001068666,0.0000016711253],"category_scores_gemma":[0.00011424904,0.00014099693,0.000041721658,0.0002432712,0.000033871092,0.0018854067,0.00001417796,0.00010867663,0.000012063535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088855566,0.000018912184,0.000029262508,0.0004401257,0.00003524802,3.0788073e-7,0.0048171463,0.020871826,0.0024771385,0.011886229,0.008122215,0.9512127],"study_design_scores_gemma":[0.00029084538,0.000054226595,0.000011230651,0.00007516784,0.000013693391,0.00003378493,0.001116641,0.9359068,0.021885574,0.017588891,0.02283476,0.0001883295],"about_ca_topic_score_codex":0.000007945134,"about_ca_topic_score_gemma":3.7381523e-7,"teacher_disagreement_score":0.9510244,"about_ca_system_score_codex":0.00008896926,"about_ca_system_score_gemma":0.000063871696,"threshold_uncertainty_score":0.5749688},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26000768,0.000058449074,0.7149623,0.00022745277,0.00013404398,0.00016322137,0.0000039712286,0.002275224,0.022167634],"genre_scores_gemma":[0.9976753,0.000003481881,0.0020149439,0.00024129501,0.000033322223,0.0000021745027,0.0000015068817,0.00001321246,0.000014752571],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967676,0.0000064036426,0.00010843899,0.00006623709,0.00006702077,0.00007513496],"domain_scores_gemma":[0.9998202,0.000014936135,0.000014369777,0.000086887725,0.000024841169,0.000038817005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000022513555,0.000061016046,0.00009416564,0.000028308083,0.00000810693,0.000005249585,0.000051086066,0.00003446555,0.00017292723],"category_scores_gemma":[0.000009071373,0.000059180587,0.00003780388,0.000089332,0.000010486337,0.000027803142,0.00000718933,0.00004785628,0.000023307139],"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.0000075043768,0.0000058038445,0.000049728184,0.000015316387,0.000010912934,0.0000045867323,0.00003215575,0.015203688,0.975087,0.000025470335,0.00440101,0.00515686],"study_design_scores_gemma":[0.000063944775,0.000057830246,0.0000848922,0.0000062355307,0.000005789635,5.829822e-7,0.00000710552,0.14202958,0.8543251,0.000048200243,0.0033119812,0.000058725615],"about_ca_topic_score_codex":0.000009999361,"about_ca_topic_score_gemma":0.0000026735113,"teacher_disagreement_score":0.7376676,"about_ca_system_score_codex":0.000005939218,"about_ca_system_score_gemma":0.0000059534805,"threshold_uncertainty_score":0.24133144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8132125,0.0064851404,0.117187075,0.0016307646,0.0031442174,0.0005875329,0.000017591368,0.012751306,0.04498383],"genre_scores_gemma":[0.99714386,0.000035117817,0.001964679,0.00004205178,0.00011772497,0.000024604555,0.000022035438,0.000042044423,0.0006078955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992785,0.000109071094,0.000118184274,0.00015612626,0.00015588033,0.00018222822],"domain_scores_gemma":[0.9997405,0.00002102111,0.000032303462,0.0001625507,0.000012629995,0.00003101759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018669736,0.00011191344,0.000115727744,0.00008188779,0.00029033856,0.000026302907,0.00012935407,0.000025468416,0.00019973716],"category_scores_gemma":[0.000016556833,0.00012839258,0.000041557472,0.00018764022,0.000011683155,0.000056803612,0.000087322514,0.00046689212,0.000008631636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012997085,0.000020931038,0.00066385284,0.000012944051,0.00003775393,0.000039486604,0.00051841623,0.9111771,0.043982826,0.0011525227,0.0048388885,0.03754228],"study_design_scores_gemma":[0.00015969267,0.00006432836,0.0003625844,0.000017823277,0.000013166014,0.00011421374,0.0001237956,0.6171791,0.008511717,0.0005033537,0.37268996,0.00026024223],"about_ca_topic_score_codex":0.00008559206,"about_ca_topic_score_gemma":0.0000023131918,"teacher_disagreement_score":0.36785108,"about_ca_system_score_codex":0.0000653028,"about_ca_system_score_gemma":0.000005639982,"threshold_uncertainty_score":0.52356976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020810412,0.0003336461,0.99537283,0.00006860563,0.00066191447,0.000052288553,0.001360172,0.000016538068,0.000052985168],"genre_scores_gemma":[0.5465816,0.000007718939,0.45316935,0.000025027877,0.00008899519,5.172053e-7,0.00010205134,0.000013030643,0.000011724051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993696,0.000016736962,0.00024156806,0.00009743008,0.00009827888,0.00017635386],"domain_scores_gemma":[0.99900556,0.00016261077,0.00008695097,0.0001812902,0.0003788637,0.00018471594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012719534,0.00009063371,0.00016335338,0.00008838934,0.00009024199,0.000055578632,0.00015128698,0.000043427688,0.000039876006],"category_scores_gemma":[0.0002890843,0.00009831814,0.000018294422,0.00008145549,0.000030848743,0.0001510765,0.0000136486,0.00013494058,0.0000020997743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007162446,0.000028652637,0.00046966877,0.000092215385,0.0006064306,0.0031391706,0.0003127173,0.57613033,0.0036131165,0.09178593,0.264395,0.059355166],"study_design_scores_gemma":[0.00043885407,0.00006418569,0.0029756946,0.00024234074,0.00009710513,0.00028404497,0.000024668509,0.97188926,0.003158132,0.018750833,0.0018857567,0.00018912529],"about_ca_topic_score_codex":0.00047898368,"about_ca_topic_score_gemma":0.0025133954,"teacher_disagreement_score":0.5445005,"about_ca_system_score_codex":0.00010977491,"about_ca_system_score_gemma":0.0004888014,"threshold_uncertainty_score":0.40092975},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10528018,0.0019593243,0.8915477,0.0001427077,0.000008318649,0.00013802639,0.00015104712,0.00021273973,0.00055995793],"genre_scores_gemma":[0.97621053,0.00035215123,0.02115305,0.00019941246,0.000030209847,0.000045630975,0.0019638631,0.000014634825,0.000030517713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984412,0.000027295939,0.0003523378,0.0006579551,0.00030422103,0.00021696408],"domain_scores_gemma":[0.99880004,0.00022186847,0.00006198625,0.00058243616,0.00014991875,0.00018374184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015543624,0.0002091049,0.0006051873,0.0020163949,0.0001653907,0.00013216486,0.00025081116,0.00006427077,0.00009077683],"category_scores_gemma":[0.0000094809275,0.0002271872,0.00019319843,0.014281922,0.000028778375,0.00007204493,0.00028366715,0.000116474235,0.000014600184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006357041,0.00007200702,0.003035316,0.000016144037,0.040695775,0.0000090881085,0.0000783525,0.9353922,0.0010069623,0.004066277,0.0003576723,0.0152638685],"study_design_scores_gemma":[0.000114935814,0.0000042768097,0.07425135,0.0000017919597,0.022869427,0.0000021701126,0.00005735314,0.8998196,0.0007044315,0.0009718562,0.00092617737,0.00027660976],"about_ca_topic_score_codex":0.000033718006,"about_ca_topic_score_gemma":0.00006599239,"teacher_disagreement_score":0.8709304,"about_ca_system_score_codex":0.00003353207,"about_ca_system_score_gemma":0.000020736967,"threshold_uncertainty_score":0.92644256},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11237972,0.00013775687,0.8843014,0.00015253409,0.00034476616,0.00040884473,0.000041859712,0.0009444349,0.0012886832],"genre_scores_gemma":[0.7984111,0.00056630553,0.20035723,0.00017129717,0.00009813298,0.000003725566,0.00011045652,0.000083111445,0.00019864428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863946,0.00008638671,0.00020282296,0.00075305044,0.000058351274,0.000259951],"domain_scores_gemma":[0.9989255,0.00009688354,0.00007935475,0.0005277098,0.00016994223,0.00020061375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006608444,0.00038941173,0.00042116691,0.00020738265,0.000084490035,0.000104541316,0.00038014763,0.00033685705,0.00013521269],"category_scores_gemma":[0.000051204068,0.000489018,0.00007286254,0.0005637384,0.00004343742,0.00012517712,0.00068021816,0.00040551476,0.000019332225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000370565,0.000018955996,0.0001765891,0.000036048903,0.00018932848,0.00006413407,0.0002756115,0.9943341,0.0013803601,0.00015478594,0.0028705269,0.00046249828],"study_design_scores_gemma":[0.0002931934,0.000034590637,0.00027033233,0.00013538009,0.00014251823,8.907501e-7,0.00008328628,0.98788327,0.0063403137,0.0016918115,0.0025788168,0.00054561143],"about_ca_topic_score_codex":0.00022921705,"about_ca_topic_score_gemma":0.000019123429,"teacher_disagreement_score":0.6860314,"about_ca_system_score_codex":0.000109546505,"about_ca_system_score_gemma":0.00003497669,"threshold_uncertainty_score":0.99975616},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033510283,0.00022180233,0.9637338,0.0000477244,0.00015175679,0.0006038738,0.000020216346,0.0004811402,0.0012294138],"genre_scores_gemma":[0.76468956,0.0001000694,0.23499355,0.000021352816,0.00010340623,0.000021986087,0.00001726141,0.000030265692,0.000022543749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894196,0.000015179035,0.00030935553,0.00018153807,0.00020661078,0.0003453327],"domain_scores_gemma":[0.99923146,0.00012973753,0.00006462903,0.0002535843,0.00024998307,0.00007063498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918772,0.00016730501,0.00019247519,0.000042784985,0.00011081813,0.00003292461,0.00018833234,0.00009497735,0.000009016778],"category_scores_gemma":[0.000011209914,0.00012782641,0.000055123604,0.00028724116,0.00009927162,0.00007990045,0.00003154256,0.000116019735,0.0000016774339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016118374,0.00012267032,0.0016159161,0.00016979783,0.0003335298,0.00001859463,0.0011808752,0.91582,0.0062232832,0.0016646199,0.00040097767,0.07228853],"study_design_scores_gemma":[0.00049177493,0.00014680154,0.00012426896,0.00009424666,0.000030803858,0.000015988126,0.0002412707,0.88039076,0.117338166,0.000116610165,0.00082781236,0.00018146893],"about_ca_topic_score_codex":0.000093568764,"about_ca_topic_score_gemma":0.000055763863,"teacher_disagreement_score":0.7311793,"about_ca_system_score_codex":0.0000779714,"about_ca_system_score_gemma":0.00004574943,"threshold_uncertainty_score":0.521261},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0744092,0.0003665039,0.9108445,0.0000072015714,0.0005165931,0.00017798791,0.000006406175,0.0011374407,0.012534136],"genre_scores_gemma":[0.96206474,0.0004261349,0.036112193,0.000023255498,0.00007416201,9.919237e-7,0.000055995475,0.00005410496,0.0011883939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988517,0.00016010762,0.00014761722,0.00054253533,0.00005128808,0.00024674568],"domain_scores_gemma":[0.99884903,0.000055314817,0.000074507385,0.00073543406,0.00019971518,0.00008599677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013103244,0.00028542904,0.00033837717,0.00018391709,0.00007174547,0.00007138825,0.00034309772,0.00038665088,0.00006842144],"category_scores_gemma":[0.00002344695,0.0003733726,0.00014930357,0.00044389095,0.000058587782,0.00014958953,0.00045602652,0.0005289095,0.000015055513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012514965,0.000026620008,0.00008713157,0.000049853283,0.00020802396,0.00020371217,0.00009614308,0.9810834,0.003689658,0.011737375,0.0010710165,0.001734561],"study_design_scores_gemma":[0.00013437531,0.000016284725,0.00014710543,0.00024893894,0.00014682356,0.000004841682,0.00012002574,0.9297233,0.04635595,0.02192794,0.0007106088,0.00046380534],"about_ca_topic_score_codex":0.00006411575,"about_ca_topic_score_gemma":0.000014052808,"teacher_disagreement_score":0.88765556,"about_ca_system_score_codex":0.00019862254,"about_ca_system_score_gemma":0.00006654351,"threshold_uncertainty_score":0.99987185},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019789008,0.00024386715,0.97822875,0.0004490111,0.0003448073,0.00023808157,0.00020032751,0.00045661264,0.000049529324],"genre_scores_gemma":[0.95219153,0.00013051278,0.04725895,0.00016466418,0.000073237185,0.00006209913,0.000027726028,0.00004814235,0.00004315385],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872315,0.000044334454,0.00030722632,0.00029284388,0.00034910903,0.00028334805],"domain_scores_gemma":[0.99888116,0.0005009191,0.000047959187,0.00017402746,0.0002642177,0.00013172234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016384087,0.00019861045,0.0002801704,0.00012939399,0.00011838759,0.000029316203,0.0001126723,0.000082537605,0.0000622162],"category_scores_gemma":[0.00012291211,0.0001895931,0.00010783698,0.00022779396,0.0001519252,0.0001679488,0.0000028008046,0.0003635047,0.0000026345017],"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.00092052564,0.0028052807,0.008260422,0.0011234622,0.0014131952,0.0012718026,0.0015258271,0.10610291,0.6758488,0.00001982823,0.0037249066,0.19698304],"study_design_scores_gemma":[0.0015675285,0.00003773231,0.0012111281,0.0010288516,0.000055616605,0.000073677744,0.00011715722,0.50348294,0.4922279,0.000012847757,0.00004505557,0.00013955779],"about_ca_topic_score_codex":0.000018252442,"about_ca_topic_score_gemma":0.000042424526,"teacher_disagreement_score":0.9324025,"about_ca_system_score_codex":0.000038862177,"about_ca_system_score_gemma":0.000061957304,"threshold_uncertainty_score":0.7731382},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.897475,0.00010301331,0.10160633,0.0003736203,0.00014344229,0.00006990161,0.000006620044,0.000017277942,0.00020480069],"genre_scores_gemma":[0.9900454,0.00008922053,0.009745208,0.00009235827,0.000014950382,0.0000012331507,0.0000027155183,0.0000023157907,0.0000065900444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995719,0.000005507432,0.00026434084,0.000016893855,0.00009575136,0.000045601457],"domain_scores_gemma":[0.99940115,0.000020378764,0.00013925547,0.00007228661,0.00034838432,0.000018571927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008015913,0.00004202777,0.00008029911,0.000044757515,0.000029619132,0.000017643337,0.000060892533,0.00002865917,0.0000033580945],"category_scores_gemma":[0.00003065666,0.000029528914,0.000036409874,0.000052684747,0.000017400838,0.00039463432,0.000019689869,0.00006833565,4.5995364e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027663165,0.00007493633,0.00051449565,0.00016986363,0.00011327975,9.665292e-7,0.0012665186,0.6469796,0.2814553,0.024365082,0.00732774,0.037455622],"study_design_scores_gemma":[0.00038754815,0.000028775425,0.0011016222,0.00011383393,0.000012532432,0.000017272292,0.00004234055,0.8531578,0.14276743,0.0019267668,0.00040325103,0.00004078657],"about_ca_topic_score_codex":0.0000014387367,"about_ca_topic_score_gemma":4.669126e-7,"teacher_disagreement_score":0.20617826,"about_ca_system_score_codex":0.00001475373,"about_ca_system_score_gemma":0.000059859885,"threshold_uncertainty_score":0.12041542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1006373,0.0006144828,0.89731765,0.00019048918,0.00005776957,0.00022145557,0.00005097308,0.0003099355,0.0005999656],"genre_scores_gemma":[0.98717564,0.00003480415,0.01166269,0.00024796248,0.00004272313,0.00016946667,0.0005634274,0.000017027924,0.000086270666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993898,0.000015759593,0.00013576068,0.0001788,0.00015588308,0.00012396301],"domain_scores_gemma":[0.9997158,0.000076989876,0.000034477758,0.00009706909,0.00003706208,0.000038573293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008369274,0.00010831953,0.00019196255,0.00019136499,0.00033882557,0.000040053394,0.00007505517,0.000028750801,0.000047056084],"category_scores_gemma":[0.000001904337,0.00011600703,0.00010968648,0.00048766422,0.000020569194,0.00002787462,0.000039449977,0.00008644385,9.545727e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025113099,0.000015334685,0.000053315503,0.0000038911357,0.0004694487,8.9065867e-7,0.00011342102,0.9792174,0.001034994,0.010099795,0.0066684093,0.0022979847],"study_design_scores_gemma":[0.00057201745,0.000013854533,0.0007704067,0.0000013300643,0.00046925165,0.000003259437,0.00009829286,0.97488105,0.00037811935,0.015657699,0.0069915457,0.00016316748],"about_ca_topic_score_codex":0.0000057941807,"about_ca_topic_score_gemma":0.0000027284084,"teacher_disagreement_score":0.8865383,"about_ca_system_score_codex":0.000035982193,"about_ca_system_score_gemma":0.000014740867,"threshold_uncertainty_score":0.47306296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008435656,0.0006712808,0.9867604,0.0006046513,0.0000906067,0.00054059085,0.000019899631,0.0011457826,0.0017311788],"genre_scores_gemma":[0.7912457,0.0010326888,0.20730735,0.000064661195,0.000046106496,0.0001936685,0.000048706454,0.000035959765,0.000025166819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902326,0.00008186759,0.00028718045,0.0002903885,0.00011840412,0.00019891532],"domain_scores_gemma":[0.99764484,0.00043309372,0.00006594269,0.001567684,0.00020415304,0.000084280466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009566028,0.00020165881,0.00020492055,0.0001559727,0.0006958419,0.00010607031,0.00034838854,0.00006581227,0.000015188346],"category_scores_gemma":[0.0000107678625,0.00020829207,0.00005648652,0.00047541334,0.00020542322,0.00013938,0.000031388492,0.000394487,0.000011587096],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015681435,0.0001866118,0.00025947005,0.000020884669,0.00009734973,0.0000017894404,0.00028352923,0.0122357365,0.009824187,0.00021102806,0.00008581877,0.9767779],"study_design_scores_gemma":[0.0012609817,0.000030067995,0.0006811535,0.00022198154,0.0001266481,0.00030320586,0.000604522,0.95700413,0.024110792,0.0007976508,0.014415453,0.00044342387],"about_ca_topic_score_codex":0.00003190988,"about_ca_topic_score_gemma":0.000053787393,"teacher_disagreement_score":0.9763345,"about_ca_system_score_codex":0.000049474533,"about_ca_system_score_gemma":0.000038525803,"threshold_uncertainty_score":0.8493904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6019488,0.0012591063,0.39252496,0.00027570184,0.000067835295,0.0002536934,0.000020456677,0.0005066484,0.003142805],"genre_scores_gemma":[0.95758766,0.0004297099,0.041738607,0.00007820626,0.000067915855,0.000023804667,0.000015731384,0.000024622745,0.00003374555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942225,0.000017928973,0.00017479723,0.00019641223,0.00006768634,0.00012093217],"domain_scores_gemma":[0.99967384,0.00003053825,0.000023215409,0.00018031357,0.000026325177,0.00006576084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006433493,0.00012606427,0.00013858775,0.00006854213,0.00023116705,0.00008670197,0.00004209811,0.000061822524,0.00001844601],"category_scores_gemma":[0.0000024096223,0.00012248626,0.000030604,0.0001513652,0.0000436671,0.00008538418,0.000027757396,0.00013954307,0.0000036171496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009342242,0.00006126203,0.000444049,0.00007024603,0.000061572435,0.000010575552,0.00042141497,0.0067910627,0.41426125,0.0061590946,0.00040451993,0.57130563],"study_design_scores_gemma":[0.0012754672,0.000058137717,0.0029867003,0.00046380123,0.00016526133,0.0020175613,0.0004448457,0.6537375,0.11727051,0.055458337,0.1649774,0.0011445084],"about_ca_topic_score_codex":0.000032437427,"about_ca_topic_score_gemma":0.00003190453,"teacher_disagreement_score":0.64694643,"about_ca_system_score_codex":0.00001679298,"about_ca_system_score_gemma":0.00001148769,"threshold_uncertainty_score":0.49948448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39980394,0.0057449606,0.5856479,0.002371285,0.0013438584,0.0011198511,0.000010575197,0.00046757018,0.0034900552],"genre_scores_gemma":[0.83509254,0.000070973474,0.16451047,0.00009678954,0.00008929532,0.000015745258,0.0000108715085,0.00002464547,0.000088651985],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991758,0.000058066165,0.00034589486,0.00013642573,0.0001492504,0.00013460297],"domain_scores_gemma":[0.99927944,0.00021315439,0.000070241455,0.00028705306,0.00013339921,0.000016692124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014795005,0.000098421966,0.0002067515,0.00008558499,0.00005271525,0.000007902921,0.0000854714,0.000060937848,0.000029407767],"category_scores_gemma":[0.00024074544,0.00008126028,0.000035521192,0.00035828486,0.0001007543,0.00003272127,0.000015431802,0.00009847401,2.0760201e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060882776,0.000016361622,0.00043426614,0.00018712481,0.000003416869,0.000009010531,0.00031097143,0.001281588,0.104730405,0.00035360962,0.00084233825,0.89182484],"study_design_scores_gemma":[0.00047681166,0.00003064049,0.0052568247,0.0011967863,0.000019516481,0.000019072912,0.00006498475,0.88796806,0.10080629,0.0024735595,0.0016085263,0.000078945326],"about_ca_topic_score_codex":0.0000114550985,"about_ca_topic_score_gemma":0.00003087217,"teacher_disagreement_score":0.89174587,"about_ca_system_score_codex":0.000038682352,"about_ca_system_score_gemma":0.000027893286,"threshold_uncertainty_score":0.33136982},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018962655,0.000054539712,0.97889817,0.000033219036,0.000089168265,0.00055504654,0.000006387281,0.00097111956,0.0004296955],"genre_scores_gemma":[0.4264705,5.2080225e-7,0.57309353,0.000016900714,0.000038117516,0.00030589002,0.000022608387,0.00003745606,0.000014456972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991113,0.000045415545,0.00022053123,0.0001782552,0.00016904881,0.0002754321],"domain_scores_gemma":[0.9995349,0.000101645084,0.000034467463,0.00022522036,0.000031056767,0.0000726945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026422684,0.00013137078,0.00019317697,0.000064005646,0.00016006124,0.00006432994,0.00016463225,0.000035676865,0.000094870265],"category_scores_gemma":[0.000027778391,0.00013437566,0.00007170037,0.00011255865,0.000021319296,0.00007044979,0.000045507943,0.00013011297,0.0000024526746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008849316,0.000728439,0.000025578574,0.00036968084,0.00016001142,0.000024470995,0.003463461,0.34190822,0.0066787777,0.07655703,0.0030303684,0.56696546],"study_design_scores_gemma":[0.00018326961,0.00023059054,0.0000037262512,0.000014722684,0.000033048822,0.0000141344235,0.0004774613,0.97211456,0.0046458743,0.006338435,0.015760772,0.00018339102],"about_ca_topic_score_codex":0.000001259674,"about_ca_topic_score_gemma":2.9984426e-7,"teacher_disagreement_score":0.63020635,"about_ca_system_score_codex":0.00005739657,"about_ca_system_score_gemma":0.0000074440904,"threshold_uncertainty_score":0.54796803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56929535,0.00006941631,0.42944542,0.000008838868,0.00019023081,0.00009180425,0.000017287959,0.0004769341,0.00040472564],"genre_scores_gemma":[0.99776804,0.00016204927,0.001371668,0.000018887587,0.00006695584,0.0000012451693,0.0005078932,0.000030358344,0.00007288237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988134,0.00017786631,0.00021811144,0.00047275497,0.00006874602,0.00024912678],"domain_scores_gemma":[0.99925786,0.000063170664,0.000086168504,0.000411161,0.000108798784,0.00007283172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014488997,0.0002579224,0.00034901465,0.00017156008,0.000052415235,0.00005342116,0.00027813192,0.00032357173,0.00009380587],"category_scores_gemma":[0.000041725398,0.00034770585,0.0001377597,0.00037938618,0.000030515459,0.00010569945,0.00039084448,0.0008162744,0.0000085448455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014298211,0.000031862524,0.007183219,0.000035344787,0.00007765479,0.0002731055,0.00007402747,0.9885632,0.0007155435,0.0028161248,0.00011162412,0.00010399502],"study_design_scores_gemma":[0.00034807742,0.000008412709,0.009229883,0.00013129995,0.000042748383,0.000002935264,0.000045887118,0.9820354,0.0012136588,0.0062684086,0.0002714925,0.00040179992],"about_ca_topic_score_codex":0.0003273548,"about_ca_topic_score_gemma":0.00011630015,"teacher_disagreement_score":0.42847273,"about_ca_system_score_codex":0.0002861411,"about_ca_system_score_gemma":0.00006300423,"threshold_uncertainty_score":0.9998975},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49209455,0.00004632909,0.5048064,0.00026270287,0.0005549456,0.000099488745,0.0004573304,0.00007466136,0.0016036183],"genre_scores_gemma":[0.97586495,0.00058727915,0.023328563,0.000047309455,0.000031311014,0.0000043449595,0.00010078316,0.000009429158,0.000026062065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916804,0.000053472606,0.00032841676,0.00016145824,0.00018100209,0.00010758744],"domain_scores_gemma":[0.9993855,0.00020118774,0.00005667816,0.00010467031,0.00021309695,0.00003889005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006976262,0.00010452828,0.00015188208,0.00010683933,0.000030820276,0.00004687879,0.00008353762,0.00006006798,0.0001586265],"category_scores_gemma":[0.00020611376,0.00011059651,0.000020591551,0.00010909548,0.00008035666,0.000051101142,0.000027552991,0.00013867942,0.000010339375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018869032,0.00035377985,0.003910294,0.000018644021,0.00010559723,0.00012508777,0.00095203205,0.022398999,0.052134216,0.7861358,0.0010915712,0.13258527],"study_design_scores_gemma":[0.00007088953,0.00008355913,0.0035859162,0.000121624464,0.000016197935,0.000008464931,0.00043209048,0.6903389,0.15143423,0.15360035,0.00012772321,0.00018006975],"about_ca_topic_score_codex":0.00005044217,"about_ca_topic_score_gemma":0.00019151538,"teacher_disagreement_score":0.6679399,"about_ca_system_score_codex":0.000030287252,"about_ca_system_score_gemma":0.00003447343,"threshold_uncertainty_score":0.4509995},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022292247,0.00006512134,0.9747099,0.00024330364,0.0009117166,0.000064754444,0.000006751746,0.00044011604,0.0012660914],"genre_scores_gemma":[0.90059716,0.0000785468,0.098746754,0.00042861883,0.000062874315,6.343397e-8,0.0000013163891,0.00002202945,0.00006262212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990528,0.00003351307,0.00013987138,0.0003010267,0.0002086937,0.0002640939],"domain_scores_gemma":[0.9994916,0.00009643841,0.000018866316,0.0002621141,0.000051573985,0.000079432095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000889636,0.0001644287,0.00014686665,0.00015218036,0.00031261658,0.000093722985,0.000059895257,0.000055179666,0.000009744524],"category_scores_gemma":[0.0000075712046,0.00016344192,0.000059966722,0.00029181084,0.00010742613,0.00010778178,0.0000012868348,0.00022741922,0.000006062236],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001592505,0.00001660254,5.939146e-7,0.000009816171,0.000009144149,0.00010659371,0.00010067053,0.02383844,0.10119472,0.000006463111,0.00010031222,0.8746007],"study_design_scores_gemma":[0.00017432937,0.000023218992,0.000042463624,0.00016701675,0.00001671618,0.00006222358,0.00006736511,0.6996436,0.29833198,0.00015821122,0.0011387899,0.00017405],"about_ca_topic_score_codex":0.00011936639,"about_ca_topic_score_gemma":0.000037947742,"teacher_disagreement_score":0.87830496,"about_ca_system_score_codex":0.00004281088,"about_ca_system_score_gemma":0.00004202715,"threshold_uncertainty_score":0.66649675},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81220067,0.0005767475,0.12303073,0.0016912881,0.0008589341,0.001804152,0.00030076163,0.00036504187,0.05917169],"genre_scores_gemma":[0.99731404,0.000009119598,0.00257577,0.00003070597,0.00003322714,0.0000048153324,0.000013183713,0.000009756922,0.000009409949],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947417,0.000067778274,0.00015046765,0.00011061884,0.000105691295,0.00009125594],"domain_scores_gemma":[0.9985751,0.00007443096,0.0000604806,0.0011827057,0.00009628942,0.000010981418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020415327,0.00006094398,0.00012846438,0.0000048681927,0.00008222584,0.00005773978,0.00090713956,0.000018740699,0.000006868327],"category_scores_gemma":[0.000044674074,0.000040222178,0.000038187154,0.00020322403,0.00009000515,0.00027527096,0.0013635424,0.000111093876,9.480447e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005997529,0.00048160934,0.006581951,0.00032117084,0.000468361,0.0000024303429,0.001983146,0.1052889,0.7829262,0.032453302,0.041731756,0.027755184],"study_design_scores_gemma":[0.00022413961,0.000010724544,0.010716541,0.00039333422,0.00009056678,0.0000028085267,0.0004043661,0.43786946,0.4557747,0.09134703,0.0029648491,0.00020150244],"about_ca_topic_score_codex":0.00022314217,"about_ca_topic_score_gemma":0.00008786153,"teacher_disagreement_score":0.33258054,"about_ca_system_score_codex":0.000012969622,"about_ca_system_score_gemma":0.00006047438,"threshold_uncertainty_score":0.1699558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5268106,0.00029637336,0.4673911,0.000021325644,0.0006343124,0.00038748237,0.00003937477,0.0009768236,0.003442598],"genre_scores_gemma":[0.9974931,0.00059876434,0.0014089259,0.00004308967,0.00007701161,0.0000020395014,0.00010137129,0.000049478003,0.0002262264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855036,0.00011780606,0.00023880643,0.00068256614,0.00009863914,0.00031183896],"domain_scores_gemma":[0.99852175,0.00007204529,0.000111725254,0.0008036583,0.00037242053,0.000118402066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009027534,0.00038171047,0.0004368513,0.00021295088,0.000104202874,0.00007881912,0.00046100913,0.0003647669,0.00010997445],"category_scores_gemma":[0.000024789302,0.00047479346,0.00015097567,0.0005383062,0.0001256348,0.0001228913,0.00043532875,0.00069887895,0.000058113586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041307736,0.00006389063,0.00022441465,0.000102602586,0.00016622749,0.0005274027,0.0003268722,0.9921806,0.0026228195,0.0019984716,0.0012351472,0.00051027787],"study_design_scores_gemma":[0.00017698019,0.0000526211,0.0008711041,0.0006268011,0.00014625117,0.000009920348,0.00077216694,0.9585696,0.031959306,0.00473263,0.0012108107,0.00087182724],"about_ca_topic_score_codex":0.00010317289,"about_ca_topic_score_gemma":0.00009787242,"teacher_disagreement_score":0.4706825,"about_ca_system_score_codex":0.0002845281,"about_ca_system_score_gemma":0.00007419274,"threshold_uncertainty_score":0.9997704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68115854,0.00013398437,0.3137122,0.000011305429,0.0006425593,0.00028173227,0.0000073200868,0.0011509368,0.0029013816],"genre_scores_gemma":[0.9971758,0.0001578475,0.002051918,0.000020649892,0.00012763772,0.0000023407745,0.000042648393,0.00008262652,0.00033851122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835706,0.00015620873,0.00020855147,0.0007530217,0.00012373994,0.00040140838],"domain_scores_gemma":[0.9986378,0.000059777412,0.00011957752,0.00095001404,0.00011679778,0.00011601443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013034785,0.00044215942,0.00040599235,0.00036489827,0.00019437064,0.00013288263,0.0004820772,0.0003791313,0.00006308234],"category_scores_gemma":[0.000027216513,0.0005459402,0.00034978444,0.00045405398,0.00009056825,0.00014130288,0.00051769405,0.0009952371,0.000006389521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018986108,0.000043239612,0.002594163,0.000101411824,0.00019602655,0.0003236035,0.00010848216,0.9924194,0.003286768,0.00038930934,0.00032769056,0.00019087068],"study_design_scores_gemma":[0.00041868744,0.00004082802,0.00041728833,0.0004917148,0.0002413532,0.000008017262,0.00035467627,0.9823036,0.013096403,0.001314138,0.0005763078,0.0007369646],"about_ca_topic_score_codex":0.00032662528,"about_ca_topic_score_gemma":0.00006342772,"teacher_disagreement_score":0.31601727,"about_ca_system_score_codex":0.00045362124,"about_ca_system_score_gemma":0.00012393789,"threshold_uncertainty_score":0.99969923},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021950955,0.0004927375,0.9745572,0.0003334885,0.0006854701,0.0004894102,0.000013165217,0.00009433635,0.0013832055],"genre_scores_gemma":[0.9916468,0.00035144234,0.007777113,0.000016070968,0.000040932955,0.000022500906,0.000010584098,0.000016905238,0.00011763388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913704,0.0000059430035,0.0003666414,0.00013417054,0.00024101819,0.00011517016],"domain_scores_gemma":[0.99838346,0.00007728112,0.0002442183,0.00009621092,0.0011745668,0.00002424703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117371106,0.0001251128,0.0002482262,0.000053766824,0.00005973622,0.0001105384,0.0004077714,0.00006249709,0.0000040316145],"category_scores_gemma":[0.00025010644,0.00010262272,0.00006536857,0.00005635901,0.00004892542,0.00018848326,0.0001300933,0.000086727276,7.4808455e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032337608,0.000012439545,0.0013521464,0.00017854116,0.00015450604,2.2163883e-7,0.0001055481,0.980693,0.009871285,0.0072663072,0.000073851224,0.00025983105],"study_design_scores_gemma":[0.0007067836,0.000029932407,0.00017499263,0.00043571132,0.000058511137,0.000010089062,0.00027050718,0.992331,0.005280283,0.0005381038,0.000059608858,0.000104454986],"about_ca_topic_score_codex":0.000027397762,"about_ca_topic_score_gemma":0.000012252531,"teacher_disagreement_score":0.96969587,"about_ca_system_score_codex":0.000042008527,"about_ca_system_score_gemma":0.000025124818,"threshold_uncertainty_score":0.4184833},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060684927,0.9190127,0.064189024,0.0004360484,0.00036658152,0.00043230274,0.00003494417,0.0015696769,0.013351842],"genre_scores_gemma":[0.6967428,0.29973948,0.0025574155,0.00041133788,0.000106963475,0.0000233146,0.00011525342,0.000044605807,0.00025886274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99955803,0.00005772431,0.00013857453,0.000114244845,0.000059542494,0.000071893584],"domain_scores_gemma":[0.9997384,0.0000387795,0.000008522931,0.00014419571,0.00004144651,0.000028643066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002121766,0.00007880766,0.00015657264,0.000022148335,0.000018769773,0.00004032945,0.000038637318,0.00003045222,0.000058842557],"category_scores_gemma":[0.00005015956,0.00007142466,0.00002890571,0.00018950696,0.000041763393,0.0000505896,0.000013399122,0.000057521658,0.000011619595],"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.0000021541969,0.000013974923,0.001600687,0.0144077595,0.0002764164,0.00008169378,0.00013514093,0.0001873502,0.00044545482,0.021465199,0.4525845,0.5087997],"study_design_scores_gemma":[0.000117329655,0.00002777963,0.012652697,0.023715764,0.00023286167,0.00024675461,0.000007885375,0.019296022,0.0012836888,0.0038557334,0.9378614,0.0007020934],"about_ca_topic_score_codex":0.000004687019,"about_ca_topic_score_gemma":0.0000022953932,"teacher_disagreement_score":0.69613594,"about_ca_system_score_codex":0.000010997594,"about_ca_system_score_gemma":0.000012675623,"threshold_uncertainty_score":0.29126132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011985415,0.0003411489,0.9973314,0.00036007861,0.00007856617,0.00015943861,0.00017062707,0.000098316894,0.00026189035],"genre_scores_gemma":[0.3723753,0.00025003174,0.6260099,0.00013775182,0.000120061384,0.00005094321,0.0009090557,0.00002466013,0.00012229527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873227,0.00011071391,0.0003837444,0.0003687383,0.00024372117,0.00016083602],"domain_scores_gemma":[0.9981482,0.00040131155,0.00014812752,0.00022974021,0.0010119394,0.000060675535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422455,0.00018738162,0.00049691973,0.0005227566,0.00014159523,0.000037921007,0.0000928195,0.000115604016,0.00030799452],"category_scores_gemma":[0.00021813282,0.00018661599,0.0002938781,0.002233655,0.000038598202,0.00013826835,0.000029941379,0.00009543377,0.0000012444593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017872344,0.000056051253,0.0008100235,0.000019016481,0.006076983,4.2711903e-7,0.00032326995,0.93862855,0.0005417561,0.053360987,0.00005415801,0.000110909445],"study_design_scores_gemma":[0.0002410887,0.000032325726,0.0043751555,0.000014296288,0.0038251553,7.249313e-7,0.000081321086,0.9821864,0.0016551692,0.0071844845,0.00020051573,0.00020341574],"about_ca_topic_score_codex":0.000121050354,"about_ca_topic_score_gemma":0.000039045113,"teacher_disagreement_score":0.3713215,"about_ca_system_score_codex":0.0000802992,"about_ca_system_score_gemma":0.00006992154,"threshold_uncertainty_score":0.7609979},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16261013,0.0010284199,0.7868888,0.00010318602,0.0011710763,0.0004355361,0.000041095347,0.002209123,0.04551265],"genre_scores_gemma":[0.7227581,0.00013193762,0.27488157,0.00008972866,0.00018718022,0.0000099816625,0.000050777908,0.00008802204,0.0018027037],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987567,0.00006869419,0.0003786838,0.00026486762,0.0002494049,0.00028163992],"domain_scores_gemma":[0.9989633,0.00006422119,0.00007284573,0.00057327334,0.00024950734,0.000076882905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001033625,0.00022079608,0.00044924728,0.00010703628,0.000040605435,0.000039612893,0.00015677128,0.0001569283,0.0001526759],"category_scores_gemma":[0.000017975659,0.00022447872,0.00015536591,0.00029600062,0.00003557024,0.00010666706,0.00007693968,0.00016314826,0.00002828189],"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.00001467864,0.000055597044,0.000046148212,0.00007510405,0.00017928165,0.00035011044,0.000046685982,0.0009999347,0.93810064,0.00008735293,0.013110535,0.046933908],"study_design_scores_gemma":[0.00040047607,0.000027135378,0.00017264434,0.00012977004,0.000029337383,0.0001960014,0.00004290901,0.149133,0.84701115,0.0010447383,0.0015669354,0.00024587984],"about_ca_topic_score_codex":0.000074654476,"about_ca_topic_score_gemma":0.000017367167,"teacher_disagreement_score":0.56014794,"about_ca_system_score_codex":0.00005388108,"about_ca_system_score_gemma":0.000033875844,"threshold_uncertainty_score":0.91539764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032805152,0.0010041641,0.94080544,0.00010664964,0.00077827455,0.00025201307,0.0000135024,0.0015094484,0.022725381],"genre_scores_gemma":[0.8634217,0.000030530366,0.13496502,0.00045069566,0.0004664137,0.000009306431,0.000032259602,0.000061018363,0.0005631015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906844,0.000022681701,0.00018332925,0.00021866847,0.00011052073,0.0003963887],"domain_scores_gemma":[0.9993306,0.00011251951,0.000023713306,0.0003221562,0.0001441187,0.00006690234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000086938,0.00015561531,0.00021720673,0.000029295266,0.00012234008,0.000055123495,0.00007797864,0.0000813137,0.000057509475],"category_scores_gemma":[0.00001860314,0.00015661867,0.00010694313,0.00015106477,0.000014173582,0.000031583662,0.00006269316,0.00011149045,0.000014188608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014079424,0.00004836674,0.00002207146,0.000040797768,0.00010185483,0.000070800015,0.00034962493,0.75893575,0.02723737,0.0012138321,0.19785811,0.01410734],"study_design_scores_gemma":[0.00024035804,0.000009829794,0.00004868258,0.00007735021,0.000021650374,0.000023906498,0.000152747,0.66683143,0.29985535,0.00076254475,0.031772833,0.0002033139],"about_ca_topic_score_codex":0.0000052781566,"about_ca_topic_score_gemma":0.000036695077,"teacher_disagreement_score":0.83061653,"about_ca_system_score_codex":0.000031047897,"about_ca_system_score_gemma":0.00001538346,"threshold_uncertainty_score":0.6386724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6260431,0.00019839288,0.367626,0.00002860132,0.0006960155,0.00021692994,0.000049308852,0.0012606336,0.003881013],"genre_scores_gemma":[0.99766713,0.00032033483,0.0016814653,0.000042083306,0.00012475504,5.5560105e-7,0.000046419264,0.00006683682,0.000050422925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988296,0.00003920058,0.00024492948,0.00054947217,0.000071627204,0.0002651523],"domain_scores_gemma":[0.9989582,0.000067654924,0.00012690452,0.00066277396,0.000058314454,0.00012618865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00004422805,0.0003460114,0.0004689422,0.00016376935,0.00004853043,0.000038309292,0.0006143015,0.00031823455,0.000039774473],"category_scores_gemma":[0.000013914918,0.00042729118,0.00022571172,0.0002213094,0.00006850127,0.000113848626,0.0008970829,0.00062016107,0.000026525771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046906312,0.000015644338,0.0010626329,0.00017100877,0.00028220244,0.00024378457,0.00035911726,0.9912299,0.00451225,0.000343935,0.0008968778,0.0008357692],"study_design_scores_gemma":[0.0002513075,0.000020399835,0.00050394476,0.00046607587,0.00014522423,0.0000014208736,0.00013839861,0.9770425,0.012348796,0.008108819,0.0004442852,0.0005288377],"about_ca_topic_score_codex":0.00047314476,"about_ca_topic_score_gemma":0.000072564326,"teacher_disagreement_score":0.37162405,"about_ca_system_score_codex":0.00014241828,"about_ca_system_score_gemma":0.000030492893,"threshold_uncertainty_score":0.9998179},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5755634,0.0005580923,0.4225536,0.000041244726,0.00018603037,0.0001387516,0.000008629818,0.00035748378,0.0005928212],"genre_scores_gemma":[0.9296498,0.000004402247,0.07019948,0.000042814685,0.000049984774,0.0000011379824,0.000009036102,0.000036541514,0.0000068553095],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829775,0.00008326771,0.00041958105,0.0002531597,0.0006313269,0.0003148939],"domain_scores_gemma":[0.9989388,0.000064060725,0.00007423903,0.00037246846,0.00043429088,0.000116119765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019887838,0.00022029813,0.00037666218,0.00016574505,0.00005780417,0.000030763596,0.00010236628,0.00011448792,0.000139869],"category_scores_gemma":[0.000060425602,0.00021382578,0.00013299099,0.00036216015,0.000089417576,0.00001990526,0.00005907951,0.00015209701,0.000007467559],"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.000008425374,0.00007084134,0.000010572524,0.00003470402,0.00005971388,0.0000959464,0.00005357037,0.28836796,0.7099458,0.00002134726,0.00041046826,0.00092062046],"study_design_scores_gemma":[0.00023339782,0.000014671542,0.000030626758,0.00025940596,0.000036747395,0.000021529931,0.000057438232,0.52828187,0.47068632,0.000019853716,0.00022432208,0.00013382237],"about_ca_topic_score_codex":0.00004530756,"about_ca_topic_score_gemma":0.000005903453,"teacher_disagreement_score":0.35408637,"about_ca_system_score_codex":0.00013091753,"about_ca_system_score_gemma":0.00012800486,"threshold_uncertainty_score":0.8719562},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034382063,0.0014456235,0.007163797,0.000002427228,0.00054973655,0.00026451162,0.00018249203,0.0019259519,0.9881216],"genre_scores_gemma":[0.0070388075,0.000218097,0.0009218583,0.000043055894,0.0003460818,7.5745396e-7,0.00041808106,0.00016927373,0.990844],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984163,0.00007334294,0.00022393637,0.00055157364,0.00028660454,0.00044820958],"domain_scores_gemma":[0.99870574,0.00009020483,0.00015090054,0.0006449793,0.00023811556,0.00017003165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003571256,0.0005767781,0.00060739904,0.00022827843,0.00021316858,0.00012839181,0.0005644328,0.00039665418,0.0000088749475],"category_scores_gemma":[0.000013095996,0.0007533449,0.00025149502,0.000024656616,0.00017044155,0.00009428278,0.00041871003,0.001342018,0.0000050206],"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.000036945192,0.000012382634,0.00001574736,0.00030972352,0.0006654777,0.002068769,0.00014728679,0.005249894,0.0048256367,0.07544854,0.905849,0.0053706244],"study_design_scores_gemma":[0.0002919384,0.00001309599,0.000015018662,0.0005324178,0.00020801694,0.000064873806,0.00003842362,0.0044986303,0.008734414,0.000016349453,0.9848187,0.0007681061],"about_ca_topic_score_codex":0.000044078213,"about_ca_topic_score_gemma":0.0000014316074,"teacher_disagreement_score":0.07896975,"about_ca_system_score_codex":0.0003743609,"about_ca_system_score_gemma":0.00015536367,"threshold_uncertainty_score":0.99949175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689767,0.0008676246,0.029121716,0.000011071067,0.00015867013,0.000029861554,0.0007745235,0.000006658301,0.000053220137],"genre_scores_gemma":[0.9842552,0.00010553495,0.015560528,0.000013459388,0.00003125518,1.1112986e-7,0.000013057767,0.000015686806,0.000005160753],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929893,0.00003260886,0.00037457733,0.000057176865,0.000116024166,0.0001206778],"domain_scores_gemma":[0.9991058,0.00010362923,0.0001929166,0.00008753572,0.0002839151,0.00022620885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007691927,0.00008903533,0.00024756143,0.00013524343,0.000024566198,0.000019232175,0.000067752524,0.00007652958,0.000026987178],"category_scores_gemma":[0.00016897001,0.00009179074,0.00003033982,0.00012685744,0.00013368508,0.00006175621,0.0000071096083,0.00019293308,3.520502e-8],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058560854,0.000033111355,0.38662934,0.000630248,0.0011719506,0.0039645857,0.0017035386,0.027083958,0.4025457,0.0048502344,0.15204214,0.019286644],"study_design_scores_gemma":[0.0012040939,0.00081657,0.110388435,0.0022795922,0.000525844,0.0010121719,0.00093086855,0.021743357,0.7887572,0.07005733,0.001373772,0.0009107628],"about_ca_topic_score_codex":0.0005334648,"about_ca_topic_score_gemma":0.0051714377,"teacher_disagreement_score":0.3862115,"about_ca_system_score_codex":0.000026890262,"about_ca_system_score_gemma":0.00022949032,"threshold_uncertainty_score":0.37431177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058364585,0.00024352102,0.9063157,0.00068228925,0.00065962534,0.0005091998,0.000030988816,0.0015772658,0.08992307],"genre_scores_gemma":[0.14475773,0.0015452577,0.8088713,0.0015227331,0.002419083,0.0003756199,0.00031865455,0.00060475216,0.03958486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987807,0.000003785345,0.00030420616,0.00029827733,0.00029607245,0.00031693678],"domain_scores_gemma":[0.99928135,0.00026678585,0.00006433211,0.00024553988,0.00006492518,0.00007704467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015367329,0.0002982918,0.00034520563,0.000078239274,0.00021958131,0.00013902178,0.00030241738,0.00028785708,0.00009968551],"category_scores_gemma":[0.00022878997,0.00024077731,0.000121999656,0.00011852946,0.00028196545,0.0002383375,0.000058247853,0.00019678866,0.0000458784],"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.000008993247,0.0000073527995,2.4261027e-7,0.0001432364,0.000045180008,0.000008059115,0.00014206108,0.32855293,0.00021969361,0.6669381,0.0009481834,0.0029859196],"study_design_scores_gemma":[0.00009858013,0.00024994698,1.8674065e-7,0.00057017826,0.00008547588,0.000025449839,0.0000058941337,0.21479264,0.04028729,0.70661896,0.036688723,0.0005766929],"about_ca_topic_score_codex":0.0000067428437,"about_ca_topic_score_gemma":0.0001161817,"teacher_disagreement_score":0.14469936,"about_ca_system_score_codex":0.00003961263,"about_ca_system_score_gemma":0.000041648334,"threshold_uncertainty_score":0.9818614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92259866,0.00016053676,0.029232867,0.00002584359,0.0009389223,0.0005810473,0.000003814042,0.0025630945,0.043895204],"genre_scores_gemma":[0.9972077,0.000047577178,0.0021344342,0.000065987166,0.000109175824,0.000016164538,0.00004156913,0.00004722345,0.0003301501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923587,0.00003612826,0.00017532581,0.00027003838,0.0001609826,0.000121648794],"domain_scores_gemma":[0.999289,0.000026627718,0.000028188246,0.00057163206,0.000053470623,0.000031124502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003837984,0.00021266735,0.0002300349,0.00010450587,0.000020304533,0.00010369367,0.00014164818,0.00017414975,0.00013508309],"category_scores_gemma":[0.0000130169565,0.00021151913,0.00009023726,0.00008169059,0.000006561193,0.000025318293,0.00019473603,0.0003274117,0.000009668165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004360662,0.00068753934,0.0023459976,0.00016432074,0.0012881482,0.000517825,0.0037446527,0.9180829,0.0035949738,0.00096805906,0.058182027,0.010379974],"study_design_scores_gemma":[0.0017579814,0.00053739117,0.0656408,0.0019835813,0.0005765782,0.000017905544,0.0036068007,0.8062188,0.10565928,0.0030639663,0.0072389776,0.0036979096],"about_ca_topic_score_codex":0.00006536899,"about_ca_topic_score_gemma":0.000030457915,"teacher_disagreement_score":0.11186405,"about_ca_system_score_codex":0.000050778246,"about_ca_system_score_gemma":0.000017836725,"threshold_uncertainty_score":0.86255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052374965,0.00012450859,0.98958975,0.00083887344,0.0012806015,0.00060185377,0.00005671951,0.0009352987,0.0013348802],"genre_scores_gemma":[0.90427303,0.00065327954,0.09389504,0.000051937994,0.00004048362,0.0005957809,0.00006833623,0.000047231497,0.00037488274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908507,0.00008514503,0.00030893998,0.0002187196,0.00010987174,0.00019228066],"domain_scores_gemma":[0.99832326,0.00016067887,0.00006899419,0.0011260789,0.00026228922,0.000058714173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100481964,0.00017724327,0.00018959006,0.00019592159,0.00044548692,0.0000603327,0.00022013007,0.00013791649,0.000020645812],"category_scores_gemma":[0.000013139763,0.00020996702,0.0001523782,0.00035872537,0.00008545821,0.00021177049,0.0000033078195,0.00028428028,0.000017027276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015120207,0.0010036475,0.00000522548,0.00015121943,0.00071209064,0.000006428005,0.0021864567,0.530986,0.13647944,0.0031951324,0.005276756,0.3198464],"study_design_scores_gemma":[0.00042754438,0.000053012238,0.000019256748,0.00012545883,0.00009104932,0.000055467117,0.00020878376,0.74894637,0.2447682,0.0033442874,0.0017444481,0.00021612282],"about_ca_topic_score_codex":0.000021507261,"about_ca_topic_score_gemma":0.00016825787,"teacher_disagreement_score":0.8990355,"about_ca_system_score_codex":0.00016701037,"about_ca_system_score_gemma":0.000054628672,"threshold_uncertainty_score":0.85622066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.678191,0.0015551428,0.27377132,0.007475467,0.00039008242,0.0002550504,0.000005015974,0.00079118257,0.037565712],"genre_scores_gemma":[0.9532852,0.00049543206,0.045564406,0.0005845168,0.00001651647,0.000017588269,0.000006865648,0.0000087966955,0.00002063207],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99955183,0.000060737937,0.00013882642,0.00008305816,0.000042870415,0.00012267275],"domain_scores_gemma":[0.9988603,0.000066428955,0.000028897806,0.0009886443,0.000038133352,0.000017567101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003883065,0.000075052136,0.00011920796,0.000030907744,0.00004841447,0.00001100548,0.00040865346,0.000030155808,0.000016348446],"category_scores_gemma":[0.0000028363238,0.00006916735,0.00002486503,0.00016829139,0.0001582422,0.000034030534,0.0001285875,0.00013701613,0.000004594239],"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.000120477256,0.000534052,0.009730974,0.00022644714,0.0017796472,0.00046427618,0.0018340008,0.2065616,0.34034705,0.21813153,0.1648931,0.055376858],"study_design_scores_gemma":[0.002807876,0.0005852195,0.034886826,0.0025220427,0.0006321646,0.00063882774,0.0022700466,0.08452711,0.68287677,0.023996538,0.16115744,0.0030991528],"about_ca_topic_score_codex":0.000008033827,"about_ca_topic_score_gemma":0.000032130993,"teacher_disagreement_score":0.3425297,"about_ca_system_score_codex":0.000019763873,"about_ca_system_score_gemma":0.000004185797,"threshold_uncertainty_score":0.28205624},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6859702,0.0005359655,0.30908522,0.00003882096,0.00026286548,0.00010492523,0.000007231826,0.00062321784,0.0033715505],"genre_scores_gemma":[0.600081,0.000034953293,0.3997946,0.000014505135,0.000029781799,8.494643e-7,0.0000070562546,0.000012349962,0.000024862838],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999613,0.00000892093,0.00013401218,0.00008770779,0.000055856617,0.00010053901],"domain_scores_gemma":[0.9996662,0.00005741356,0.000023125021,0.00012970768,0.00010434865,0.000019188095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000025023004,0.000071637616,0.00013267771,0.00003226245,0.00003539349,0.00002337898,0.000033479086,0.00004678779,0.00002387794],"category_scores_gemma":[0.000008850867,0.00007438378,0.000051755174,0.000097987046,0.000036418776,0.000053513417,0.000018871968,0.00004233388,0.0000013928956],"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.000025935975,0.000022380555,0.00011894937,0.00013029201,0.00009880096,0.000021938078,0.000104552586,0.056036156,0.9101876,0.0023055065,0.008342953,0.022604937],"study_design_scores_gemma":[0.00012600145,0.0000169601,0.00008003933,0.000040382965,0.00001596493,0.0000325191,0.000086404034,0.3422225,0.65413266,0.00039416636,0.0027707284,0.00008166523],"about_ca_topic_score_codex":0.000009462073,"about_ca_topic_score_gemma":0.0000016492857,"teacher_disagreement_score":0.28618637,"about_ca_system_score_codex":0.000008454956,"about_ca_system_score_gemma":0.000013638187,"threshold_uncertainty_score":0.30332828},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04870391,0.0009187949,0.94972473,0.00012225137,0.00020662819,0.00014640564,0.000054467553,0.000092798306,0.00003004002],"genre_scores_gemma":[0.64595205,0.00032264317,0.3532375,0.000016133927,0.00014463053,0.0000053284098,0.000028619372,0.000045041197,0.00024802185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988317,0.000038691083,0.00036530147,0.00013671909,0.00026506843,0.00036254054],"domain_scores_gemma":[0.9988638,0.00012083552,0.00019829323,0.00016496671,0.00058403495,0.00006806535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001689913,0.0001811674,0.0002920434,0.00011186526,0.00011749916,0.000024617182,0.00009721759,0.00008563997,0.000009821676],"category_scores_gemma":[0.000089486006,0.00013189334,0.000058788566,0.00014885924,0.00002653748,0.000101898455,0.000019164052,0.0004711249,6.811289e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085697987,0.0001929456,0.000009707648,0.00008871391,0.00046006285,0.00018893769,0.00022682355,0.52854794,0.40531248,0.025589975,0.030206313,0.00831913],"study_design_scores_gemma":[0.0012946158,0.00040228784,0.000018484508,0.000475823,0.00013891848,0.00043999378,0.000027219283,0.79071224,0.18411738,0.021709267,0.00044863205,0.00021516925],"about_ca_topic_score_codex":0.000004920122,"about_ca_topic_score_gemma":0.000010361379,"teacher_disagreement_score":0.59724814,"about_ca_system_score_codex":0.00017081604,"about_ca_system_score_gemma":0.0005019323,"threshold_uncertainty_score":0.53784543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010840134,0.00041149065,0.98500884,0.00042698707,0.00063215644,0.00013264944,0.000031129464,0.00096151914,0.0015551173],"genre_scores_gemma":[0.9217729,0.000022893735,0.0774741,0.0004953127,0.00008865629,0.000020637895,0.000021142587,0.00006163641,0.00004273377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986719,0.00005934856,0.00028931058,0.0003677767,0.000313967,0.00029768518],"domain_scores_gemma":[0.99922526,0.00019043703,0.000043137046,0.00020655752,0.00024929634,0.000085292166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007186621,0.0002552552,0.00022932907,0.0002516485,0.00030824653,0.0001478085,0.00011914268,0.00003642637,0.00009091376],"category_scores_gemma":[0.0000024978997,0.00032702787,0.00014471714,0.00034892748,0.00006874185,0.00047253267,0.000003831408,0.00039868488,0.000046502613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001910903,0.00009079925,0.000025096466,0.000011646211,0.00012229866,0.00014558325,0.00033471923,0.9091863,0.041040983,0.00022007305,0.0007125303,0.04809084],"study_design_scores_gemma":[0.00031595174,0.000014337325,0.00033799344,0.0002108777,0.00004377308,0.000109907196,0.00012425217,0.8592714,0.13481042,0.0042159576,0.00020346943,0.00034165228],"about_ca_topic_score_codex":0.000014890068,"about_ca_topic_score_gemma":0.0000030181052,"teacher_disagreement_score":0.9109328,"about_ca_system_score_codex":0.0001647059,"about_ca_system_score_gemma":0.000054393535,"threshold_uncertainty_score":0.99991816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22431481,0.00023904578,0.7740444,0.00008985178,0.00028846742,0.00017133928,0.000024981211,0.00061565795,0.00021145203],"genre_scores_gemma":[0.8998842,0.000015893747,0.09942159,0.0002522769,0.00025065185,0.0000025456322,0.000093857954,0.00006754697,0.0000114272225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984705,0.00008752067,0.00035813262,0.0003307599,0.00033682448,0.00041628652],"domain_scores_gemma":[0.99935484,0.00010707483,0.00006131737,0.00029445373,0.00007959824,0.00010268769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018644506,0.00028186847,0.0003075856,0.00016597706,0.00013669387,0.00012083727,0.00009637148,0.000103129176,0.00045219055],"category_scores_gemma":[0.0000112967655,0.0003071142,0.0001648282,0.0002772403,0.000027073023,0.00010705107,0.000028498638,0.00018122519,0.000008746904],"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.000036357822,0.00007745189,0.0001668691,0.000057157074,0.000090828216,0.00061920274,0.00004546834,0.19474186,0.7843358,0.0000216352,0.00091677456,0.018890573],"study_design_scores_gemma":[0.00051842124,0.000031828997,0.00021290571,0.00017585942,0.000049936916,0.00003864007,0.000016446174,0.6576361,0.34006056,0.00020199502,0.0007886175,0.00026865187],"about_ca_topic_score_codex":0.00006780806,"about_ca_topic_score_gemma":0.000020414745,"teacher_disagreement_score":0.6755694,"about_ca_system_score_codex":0.00017377274,"about_ca_system_score_gemma":0.00009496986,"threshold_uncertainty_score":0.9999381},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23620081,0.0005765665,0.7615049,0.000026336993,0.0004505122,0.0002536955,0.0003131687,0.0004097349,0.00026429782],"genre_scores_gemma":[0.9890243,0.002707836,0.0067653283,0.000024780047,0.000083522005,0.0000016020499,0.0012436551,0.000038868468,0.00011015524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897134,0.00008813492,0.00017013622,0.000538741,0.000047628153,0.00018403072],"domain_scores_gemma":[0.99900603,0.00012353083,0.000075632015,0.00033815735,0.00033946423,0.000117200194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000095953495,0.00028796837,0.0003204313,0.00012602835,0.00017507229,0.00018674564,0.0001180525,0.0003232545,0.00015142374],"category_scores_gemma":[0.00006645145,0.00037131648,0.000031630687,0.0003259246,0.00013596659,0.00020443909,0.0003801385,0.00029743352,5.6736013e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012076286,0.0000146443,0.0037801934,0.00006371756,0.000117299045,0.000046756308,0.000057417725,0.9945287,0.000007228075,0.00031546483,0.0010448238,0.000011670735],"study_design_scores_gemma":[0.00050473824,0.000015927415,0.0039492543,0.0001153928,0.00010172955,0.000013305888,0.00006928429,0.9940142,0.00006686755,0.00034337546,0.00037036478,0.00043557514],"about_ca_topic_score_codex":0.00012410776,"about_ca_topic_score_gemma":0.00020357352,"teacher_disagreement_score":0.7547395,"about_ca_system_score_codex":0.000054872464,"about_ca_system_score_gemma":0.00005052943,"threshold_uncertainty_score":0.9998739},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032300266,0.0014202293,0.9402236,0.00004853319,0.0022879678,0.00060442777,0.000015295911,0.00079008756,0.054286886],"genre_scores_gemma":[0.014276698,0.00045565458,0.93019223,0.00058556284,0.001937687,0.00007316252,0.000039626295,0.00020396835,0.052235417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998653,0.000003732667,0.00025722096,0.0004822353,0.00026873752,0.00033506125],"domain_scores_gemma":[0.99924874,0.000040589268,0.000046991612,0.00046290376,0.00013312267,0.00006766116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019384766,0.00025625218,0.00031853374,0.000246211,0.00006518467,0.00013527222,0.00055646553,0.00014771483,0.000022050857],"category_scores_gemma":[0.0000038272915,0.00026809893,0.000077224104,0.00009846186,0.00021509126,0.00011481807,0.00020881818,0.00024050246,0.000010737815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030368135,0.000029068306,0.0000068935046,0.00018055641,0.000052277377,0.0001524417,0.0003661346,0.05836366,0.002704955,0.10479839,0.015904156,0.8174384],"study_design_scores_gemma":[0.00015809527,0.000055996636,0.000026424725,0.00057286327,0.000007721062,0.000034704717,3.278882e-7,0.88787663,0.0039929245,0.03091829,0.07584491,0.0005111198],"about_ca_topic_score_codex":0.0000045523498,"about_ca_topic_score_gemma":0.0000064831606,"teacher_disagreement_score":0.82951295,"about_ca_system_score_codex":0.000110046276,"about_ca_system_score_gemma":0.0000906659,"threshold_uncertainty_score":0.9999771},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61696434,0.05269529,0.31365958,0.0025014777,0.0010834846,0.00061283243,0.000024370172,0.002356779,0.010101858],"genre_scores_gemma":[0.8951199,0.000346352,0.10342451,0.00032196275,0.00022297516,0.0000074634413,0.00002710582,0.000092610375,0.00043709908],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984457,0.000109838635,0.00032531848,0.00046118704,0.00024896953,0.000408991],"domain_scores_gemma":[0.9990604,0.00014341754,0.00007245901,0.00045699626,0.0001688718,0.00009784524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012990859,0.00029808513,0.0003050842,0.000110955974,0.000167291,0.0002091299,0.00009931614,0.000081904545,0.00008305384],"category_scores_gemma":[0.00007987422,0.0003097694,0.0000587274,0.00027689565,0.000103526116,0.00028693362,0.00014341345,0.00029309766,0.0000113507485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024279067,0.000027628692,0.0005034835,0.000051114053,0.000011696103,0.0009240145,0.00081729784,0.0009620097,0.61544526,0.00007899873,0.0110000055,0.3701542],"study_design_scores_gemma":[0.0005874903,0.000023376178,0.020840917,0.0006656537,0.000032575175,0.00047229015,0.00011550578,0.8784515,0.09127143,0.0013329311,0.005712347,0.00049397285],"about_ca_topic_score_codex":0.00007115687,"about_ca_topic_score_gemma":0.000010130905,"teacher_disagreement_score":0.8774895,"about_ca_system_score_codex":0.00005955045,"about_ca_system_score_gemma":0.00002321297,"threshold_uncertainty_score":0.99993545},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32810786,0.020846402,0.25106695,0.0014671689,0.00009995423,0.0025060503,0.00015175027,0.003506706,0.39224717],"genre_scores_gemma":[0.8430116,0.0069416463,0.14935458,0.00018650758,0.000031562326,0.00029089412,0.000043486692,0.000048915124,0.000090823116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999321,0.000013764776,0.00021350679,0.0001775715,0.00011963996,0.00015451595],"domain_scores_gemma":[0.9981784,0.00042179012,0.00006048368,0.0012253147,0.000043165383,0.00007081415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008062245,0.0001730917,0.00019568075,0.00007516744,0.00024063235,0.00011138045,0.000339114,0.00010266042,0.0000021350188],"category_scores_gemma":[0.000022060787,0.00017139327,0.000027103744,0.00019977483,0.000092335256,0.000046862016,0.00019249604,0.00026942274,0.000028585671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028754873,0.0006167179,0.000023575687,0.00036810982,0.00017118714,0.000007386548,0.001646475,0.002212278,0.026581297,0.89794683,0.01263249,0.057790793],"study_design_scores_gemma":[0.0012507897,0.00017648556,0.0003979789,0.0012438631,0.00048268423,0.00031351816,0.007731581,0.10421091,0.4533213,0.21964243,0.21009816,0.0011302751],"about_ca_topic_score_codex":4.3519447e-7,"about_ca_topic_score_gemma":0.0000036965855,"teacher_disagreement_score":0.6783044,"about_ca_system_score_codex":0.000016888636,"about_ca_system_score_gemma":0.000014239926,"threshold_uncertainty_score":0.69892144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5021033,0.000118450655,0.49213627,0.000007687532,0.00019254956,0.00027209334,0.0000063694324,0.00072991353,0.004433353],"genre_scores_gemma":[0.99461216,0.00009811675,0.004848052,0.00004931713,0.000110934874,0.0000012169406,0.000102326085,0.00006593719,0.000111928464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986439,0.00006868079,0.00017708725,0.0006677687,0.00014933222,0.0002932643],"domain_scores_gemma":[0.9986346,0.000019505916,0.0001128127,0.00087256136,0.00025118608,0.00010933245],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000086584594,0.0003695695,0.00036028455,0.00016942818,0.00009490187,0.0001054247,0.00034349924,0.0002895143,0.000015193292],"category_scores_gemma":[0.0000040660907,0.000432551,0.00011451187,0.00026020783,0.00006103014,0.00012893985,0.00032891994,0.0005720142,0.000009584304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026960388,0.00003808502,0.0010013034,0.00006624297,0.00030703965,0.0002255647,0.00009028437,0.98261154,0.013871778,0.00063725945,0.00030887392,0.0008150685],"study_design_scores_gemma":[0.00056885,0.000026982603,0.0010254106,0.0003296031,0.00027163659,0.000020561889,0.00012367681,0.9428355,0.050894268,0.002731205,0.00033549825,0.00083677075],"about_ca_topic_score_codex":0.00021740448,"about_ca_topic_score_gemma":0.0001761475,"teacher_disagreement_score":0.49250886,"about_ca_system_score_codex":0.0002760792,"about_ca_system_score_gemma":0.0000644663,"threshold_uncertainty_score":0.9998126},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038230189,0.0008127297,0.9905883,0.00005354659,0.00094009726,0.00034352017,0.000004784874,0.0017355158,0.0016984621],"genre_scores_gemma":[0.71182084,0.000037614423,0.28757963,0.00012993145,0.00014219059,0.000107169886,0.00010857868,0.00003342686,0.000040628664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989379,0.000059853406,0.00053097965,0.00011494059,0.00013183749,0.00022447844],"domain_scores_gemma":[0.9990783,0.00006905096,0.0001645854,0.00018468472,0.00044861148,0.000054772125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024059044,0.000171799,0.00023061778,0.00012456995,0.00017259362,0.0004600282,0.000112251546,0.00010432539,0.0000036274066],"category_scores_gemma":[0.0000840663,0.00017247217,0.000058840884,0.00029687138,0.000012203858,0.0014840397,0.000021748336,0.00011518813,0.0000039200468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008546453,0.000014293608,0.000009253948,0.0006087227,0.000030194466,0.0000013624506,0.000984034,0.8517348,0.010472512,0.00034060783,0.0009929746,0.13480265],"study_design_scores_gemma":[0.0002077024,0.000022808352,0.000005261617,0.00018360809,0.000021175143,0.000060214814,0.00031800766,0.944812,0.0432035,0.00006027479,0.010907947,0.00019749091],"about_ca_topic_score_codex":0.0000071240934,"about_ca_topic_score_gemma":3.6979648e-7,"teacher_disagreement_score":0.7079978,"about_ca_system_score_codex":0.00008370138,"about_ca_system_score_gemma":0.00006073384,"threshold_uncertainty_score":0.70332104},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018583248,0.003462147,0.059575412,0.000008553793,0.0004303075,0.0005585973,0.00022842248,0.0008245859,0.9347261],"genre_scores_gemma":[0.035652123,0.00090260315,0.00093102973,0.00010345748,0.00033129862,0.0000037067196,0.00019339469,0.00018892335,0.96169347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989835,0.000016673877,0.00016141952,0.0004015393,0.000106216256,0.0003306209],"domain_scores_gemma":[0.99911195,0.00010171843,0.00009778602,0.00039188078,0.00017253171,0.00012413587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000036297166,0.00039912647,0.0004421308,0.00010667847,0.00016588076,0.000109634726,0.00024131317,0.00022628346,0.0000021396202],"category_scores_gemma":[0.0000038659928,0.0005063159,0.0001495368,0.000006987851,0.00012644871,0.000109573826,0.00027287545,0.00040731826,3.506918e-7],"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.0001876206,0.000012448514,0.000008018287,0.00042398865,0.0008573117,0.0015883715,0.00008529664,0.01587001,0.0013546625,0.67923385,0.28022447,0.02015392],"study_design_scores_gemma":[0.00045305505,0.0000173184,0.0000054031098,0.00040047878,0.00023579122,0.000042124695,0.000025148584,0.38739613,0.001351709,0.000019600184,0.60942554,0.0006276719],"about_ca_topic_score_codex":0.00002910489,"about_ca_topic_score_gemma":0.0000014942574,"teacher_disagreement_score":0.6792143,"about_ca_system_score_codex":0.00008314445,"about_ca_system_score_gemma":0.000019606548,"threshold_uncertainty_score":0.9997389},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0258599,0.00042211593,0.97079694,0.00044363594,0.00010707588,0.00012979658,0.000014994339,0.00003753285,0.0021880036],"genre_scores_gemma":[0.4665468,0.00016097105,0.53254914,0.00004964829,0.0004322717,0.0000040728696,0.000048728783,0.00004007452,0.00016831224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987673,0.00024079278,0.0002482261,0.00010377653,0.00044134152,0.00019854456],"domain_scores_gemma":[0.99828553,0.00008786061,0.000034047054,0.00010300992,0.0014030145,0.00008656021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009327449,0.00007926243,0.000110894434,0.00012908969,0.00017060807,0.00013786073,0.0000988306,0.000017435288,0.000039541756],"category_scores_gemma":[0.000046573703,0.00006764323,0.000049217764,0.00016865048,0.000024213285,0.00016254897,0.000029155712,0.00024226645,0.000005872818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080568425,0.00010769314,0.000029859451,0.000009724907,0.00007667156,0.00037060844,0.0002876271,0.9762212,0.0075385757,0.00054121064,0.012192791,0.002543492],"study_design_scores_gemma":[0.0015044482,0.00068178814,0.0008358771,0.00019846584,0.000019745808,0.0008937216,0.00020280333,0.9455961,0.029464183,0.00011900913,0.020291882,0.00019199113],"about_ca_topic_score_codex":3.5250068e-7,"about_ca_topic_score_gemma":0.0000019719835,"teacher_disagreement_score":0.44068688,"about_ca_system_score_codex":0.00005753458,"about_ca_system_score_gemma":0.00008787161,"threshold_uncertainty_score":0.27584112},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008499091,0.0007798633,0.0012202275,0.0000026889513,0.00028900994,0.00014778531,0.000079414545,0.0011602757,0.9962357],"genre_scores_gemma":[0.0029649201,0.00046330498,0.00030683485,0.000026959013,0.00014213068,2.8204548e-7,0.000059669917,0.00007950561,0.9959564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919015,0.00001123405,0.00012121333,0.00029974987,0.0001647638,0.00021286731],"domain_scores_gemma":[0.99923277,0.000026954482,0.00005692088,0.0005047775,0.000078889585,0.000099689816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000024437031,0.00032439988,0.00033947828,0.00012997669,0.00007691802,0.000044933076,0.0003250925,0.00033672666,0.000011661662],"category_scores_gemma":[0.0000017028016,0.00042261786,0.00017951975,0.000005498389,0.00008905807,0.000050911833,0.0002015505,0.0004179906,0.000018658679],"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.000009005714,0.0000028194079,3.1211002e-7,0.00006766795,0.00023384576,0.0011149034,0.000016769653,0.00005443408,0.0004752927,0.8114019,0.1842046,0.0024184396],"study_design_scores_gemma":[0.0001227595,0.0000112552825,0.0000017367953,0.00029246171,0.00012358332,0.00002664026,0.000012757134,0.00035214034,0.0057279547,0.000010585112,0.99288446,0.00043369093],"about_ca_topic_score_codex":0.000026503923,"about_ca_topic_score_gemma":0.0000013938545,"teacher_disagreement_score":0.81139135,"about_ca_system_score_codex":0.0001071416,"about_ca_system_score_gemma":0.00002921582,"threshold_uncertainty_score":0.99982256},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005481998,0.0003704123,0.002176808,0.00001296266,0.0005669552,0.00012475677,0.000038511414,0.0010604714,0.9955943],"genre_scores_gemma":[0.00074265344,0.00033251336,0.0003135205,0.000017383716,0.00070888235,2.4924904e-7,0.00006668995,0.000066117245,0.997752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999289,0.000010755298,0.000107532884,0.00029572233,0.00013094851,0.00016608961],"domain_scores_gemma":[0.99926955,0.000013516313,0.00004517004,0.00049482286,0.000106282765,0.000070633185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000023865357,0.00026494078,0.00027077016,0.0001179512,0.00006419868,0.00003291064,0.00019347355,0.0002900213,0.000013755379],"category_scores_gemma":[0.0000026150917,0.0003556494,0.00013984338,0.0000057905363,0.00006948654,0.00004837474,0.00012687079,0.00039568616,0.000015030071],"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.000006961374,0.0000017385462,5.7528815e-8,0.00002961852,0.00011638361,0.000251555,0.0000065785594,0.00008022221,0.00076628587,0.57598895,0.42079553,0.001956133],"study_design_scores_gemma":[0.00009483018,0.000010786984,0.0000011557199,0.00010282839,0.00010459024,0.000030133251,0.0000063020675,0.000382347,0.011364819,0.000008612249,0.98755515,0.00033847682],"about_ca_topic_score_codex":0.000013214582,"about_ca_topic_score_gemma":6.2647587e-7,"teacher_disagreement_score":0.5759803,"about_ca_system_score_codex":0.00014683507,"about_ca_system_score_gemma":0.00002257458,"threshold_uncertainty_score":0.99988955},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26445037,0.00043383238,0.7270462,0.00013966691,0.0004136879,0.00049570366,0.000024058072,0.0017710883,0.0052253623],"genre_scores_gemma":[0.78184664,0.000003696108,0.2175494,0.00010979032,0.00016218613,0.000002982416,0.00003583338,0.00008909631,0.0002003855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982997,0.00007132573,0.00041880427,0.00041682718,0.00026949987,0.00052381045],"domain_scores_gemma":[0.9986052,0.0002772193,0.000077028795,0.0005727404,0.00033864554,0.00012914886],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014204124,0.00033019786,0.000492198,0.00013943708,0.00016287375,0.00014014897,0.00010893136,0.0001637731,0.000073314695],"category_scores_gemma":[0.000053771626,0.000356555,0.00020576602,0.00024654582,0.000042029682,0.000038531198,0.00006146169,0.00017630614,0.000089812296],"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.00002832891,0.000048684873,0.000004947568,0.00011182937,0.00011414825,0.00012782215,0.000090300295,0.38020977,0.60952264,0.00026692828,0.0039777476,0.0054968754],"study_design_scores_gemma":[0.0003497909,0.00001730699,0.000008363635,0.00034237144,0.000046168072,0.000036112167,0.000054314263,0.5915572,0.4056877,0.00010097159,0.0015239621,0.00027577413],"about_ca_topic_score_codex":0.00001670893,"about_ca_topic_score_gemma":0.000009627813,"teacher_disagreement_score":0.5173963,"about_ca_system_score_codex":0.00012874453,"about_ca_system_score_gemma":0.000065835826,"threshold_uncertainty_score":0.99988866},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021193057,0.0010884405,0.015987586,0.0000035894882,0.0001983787,0.000025753672,7.5158084e-7,0.001966874,0.9807265],"genre_scores_gemma":[0.0009928443,0.00026814616,0.010332301,0.000039094393,0.00018089624,0.0000029450666,0.00003078626,0.0002810128,0.98787194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998496,0.0000020622817,0.000028478367,0.000047743953,0.000030892974,0.00004119017],"domain_scores_gemma":[0.99987537,0.000002273962,0.000005227106,0.00010455047,0.000004164864,0.000008403349],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0000034459817,0.00005785566,0.000062118284,0.00004135071,0.000002177868,0.0000075954704,0.000026046537,0.00007747204,0.004349213],"category_scores_gemma":[9.465548e-7,0.000057223995,0.000016908883,0.000026903084,0.0000028840093,0.000002639014,0.0000054764437,0.000039246886,0.00004347337],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.3664397e-8,7.5095375e-7,6.1284067e-7,0.000007971754,0.000011808224,0.0000042965994,0.0000018378117,0.00002019484,0.0005140812,0.00019890012,0.9960266,0.0032129586],"study_design_scores_gemma":[0.000012581833,9.647204e-7,0.0000043906725,0.00009842654,0.0000032844803,0.0000012907237,0.0000015814958,0.0011971019,0.0056793396,0.00005794853,0.9928622,0.00008083805],"about_ca_topic_score_codex":0.000024013261,"about_ca_topic_score_gemma":0.000033636305,"teacher_disagreement_score":0.0071454677,"about_ca_system_score_codex":0.000004905963,"about_ca_system_score_gemma":0.0000020197836,"threshold_uncertainty_score":0.99656093},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047089114,0.0002691068,0.084120564,9.2076033e-7,0.000099702695,0.000097150725,0.00012263368,0.0003379024,0.91490495],"genre_scores_gemma":[0.002721752,0.0005278594,0.0037132776,0.000009817248,0.000047654998,2.5079348e-7,0.00026871497,0.00005609835,0.99265456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932,0.000012570531,0.00015899187,0.00023049793,0.00015584129,0.00012213243],"domain_scores_gemma":[0.9991951,0.000026885504,0.000096058364,0.00044332515,0.0001826734,0.00005597892],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000026942904,0.00022232723,0.0004785662,0.00041524984,0.000035400037,0.000016036247,0.00020581551,0.00026248372,0.000010735598],"category_scores_gemma":[0.000002347874,0.0002947569,0.00029709318,0.000032802956,0.0000682839,0.00003666831,0.00011254506,0.00019582144,5.8135333e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027902866,0.000015196104,0.000004242684,0.00013327149,0.009044407,0.00054264657,0.000065434986,0.42513788,0.0005354716,0.53762674,0.021744741,0.0051220357],"study_design_scores_gemma":[0.00025106137,0.000026728729,0.000014131011,0.0003005712,0.005866156,0.0000059899244,0.000021973412,0.4922786,0.009122552,0.0000026799294,0.4913734,0.00073615066],"about_ca_topic_score_codex":0.00003592981,"about_ca_topic_score_gemma":0.0000011439685,"teacher_disagreement_score":0.53762406,"about_ca_system_score_codex":0.00008380188,"about_ca_system_score_gemma":0.00002219411,"threshold_uncertainty_score":0.99995047},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062897936,0.00020980484,0.9231265,0.000034095905,0.00047959664,0.0003341547,0.000040888273,0.0011031501,0.011773883],"genre_scores_gemma":[0.9664111,0.0002083619,0.031421706,0.00014898843,0.00020186877,0.00003456328,0.0007989257,0.00005729514,0.00071718404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911755,0.00002365836,0.00023547592,0.00033112438,0.00013473367,0.0001574405],"domain_scores_gemma":[0.9992423,0.000102275815,0.000055640146,0.00045966872,0.00010295337,0.0000371454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057372552,0.00022877326,0.00037608846,0.00031658306,0.000028344277,0.00012322213,0.00013629544,0.0002952814,0.0002992356],"category_scores_gemma":[0.000018653249,0.00023722394,0.0004765873,0.00024215302,0.000008302676,0.000040050534,0.00009208755,0.00021136522,0.0000024727296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019748735,0.00001543049,0.000038349688,0.0000436632,0.0013782039,0.0000063514562,0.00003448053,0.98437303,0.00071473076,0.00018920777,0.009657744,0.0035290525],"study_design_scores_gemma":[0.00012887621,0.000036685637,0.0006077165,0.00015185954,0.00090513943,6.185478e-7,0.00002645359,0.95228034,0.042324144,0.0015572853,0.0015197553,0.00046110316],"about_ca_topic_score_codex":0.000054292876,"about_ca_topic_score_gemma":0.00005356845,"teacher_disagreement_score":0.9035132,"about_ca_system_score_codex":0.00007850178,"about_ca_system_score_gemma":0.000026764803,"threshold_uncertainty_score":0.96737117},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3051442,0.06149456,0.35607022,0.00038688545,0.02788338,0.0073124515,0.0013602154,0.017695105,0.22265299],"genre_scores_gemma":[0.8707328,0.008095532,0.04942175,0.00012203868,0.0013438489,0.0001641645,0.051483385,0.0006032125,0.018033305],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982447,0.000052552557,0.00046466518,0.0007296266,0.00022791784,0.0002805348],"domain_scores_gemma":[0.9979763,0.000046695783,0.00014270554,0.0015351067,0.0001896867,0.000109522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014230427,0.00041817082,0.0005000671,0.00016433456,0.0001057833,0.00020439985,0.000499993,0.00046653338,0.00008528285],"category_scores_gemma":[0.00002389723,0.0004150752,0.000061540726,0.0001867274,0.000019560197,0.00026245206,0.00012884328,0.00037777808,0.00001636147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075015436,0.00013230072,0.00014371159,0.0011261469,0.00056892,0.00007576671,0.0003233309,0.00015132669,0.5328642,0.00014281986,0.17287144,0.291525],"study_design_scores_gemma":[0.00046628393,0.00005577309,0.0022365674,0.0012522453,0.00023120244,0.00006610296,0.0008748101,0.87800336,0.095515266,0.0005612782,0.019496392,0.0012407079],"about_ca_topic_score_codex":0.00020281735,"about_ca_topic_score_gemma":0.00049989094,"teacher_disagreement_score":0.877852,"about_ca_system_score_codex":0.00005990681,"about_ca_system_score_gemma":0.00005239177,"threshold_uncertainty_score":0.9998301},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8766504,0.004394269,0.07321316,0.000048630027,0.0011797968,0.00049259467,0.00003593091,0.0015745603,0.04241067],"genre_scores_gemma":[0.970098,0.000044037373,0.02749313,0.00009130927,0.00009933823,0.0000041249305,0.0016245757,0.00008869853,0.0004567894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898726,0.00002882022,0.00024460602,0.000302682,0.00024063162,0.0001960247],"domain_scores_gemma":[0.99935544,0.00009745567,0.000066166256,0.00019638598,0.00021615978,0.00006839076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000035997964,0.00031132114,0.00033784128,0.00014368657,0.000082142644,0.000107876054,0.00007183443,0.00024723195,0.000057328027],"category_scores_gemma":[0.000012274636,0.00032998214,0.000078237455,0.00011975087,0.000023292225,0.000021981998,0.000015989599,0.0003017019,0.000007736101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049594088,0.000082893974,0.000019254989,0.00063568924,0.00038804594,0.00035500128,0.0016197755,0.8903563,0.04693636,0.0007956259,0.013900911,0.044860564],"study_design_scores_gemma":[0.00024498277,0.000017243272,0.00070114003,0.00081360847,0.00007325872,0.00001666869,0.0004407263,0.9212667,0.074291326,0.00017710341,0.0014475737,0.0005096712],"about_ca_topic_score_codex":0.000017946657,"about_ca_topic_score_gemma":0.00007124571,"teacher_disagreement_score":0.09344761,"about_ca_system_score_codex":0.000040867595,"about_ca_system_score_gemma":0.000060781516,"threshold_uncertainty_score":0.99991524},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013021945,0.00039211652,0.008887056,0.000010954987,0.0002943428,0.00011374504,0.0000060747975,0.0015179578,0.9887647],"genre_scores_gemma":[0.011672197,0.00026289927,0.0023332587,0.000057077472,0.00016829323,9.88623e-7,0.00004602022,0.0000973846,0.9853619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996019,0.0000011574039,0.000110561945,0.00010667518,0.000092760936,0.00008694805],"domain_scores_gemma":[0.99966526,0.000012008058,0.000018779721,0.0002591667,0.000024943329,0.000019868214],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000015420672,0.00016373707,0.00018901858,0.00007171078,0.000010195499,0.000016600692,0.000083049585,0.00018325562,0.0010157689],"category_scores_gemma":[5.2702836e-7,0.00016123494,0.000070004215,0.0000051321695,0.000011077884,0.000019903202,0.000024105544,0.0001643191,0.0014650191],"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.0000022890988,0.0000017495629,0.000001761001,0.00004531331,0.000080379396,0.000013417366,0.000007931537,0.00088398677,0.001287998,0.6477995,0.3447739,0.0051018167],"study_design_scores_gemma":[0.000040368435,0.000012989856,0.0000060863504,0.00012359931,0.000018145776,0.000008943155,4.749357e-7,0.005480118,0.0010393317,0.013114684,0.97989047,0.00026480472],"about_ca_topic_score_codex":0.0000033422998,"about_ca_topic_score_gemma":0.0000025013615,"teacher_disagreement_score":0.6351166,"about_ca_system_score_codex":0.00003110032,"about_ca_system_score_gemma":0.0000055058626,"threshold_uncertainty_score":0.9998974},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085135165,0.00019912822,0.014463653,0.00000939366,0.0003194121,0.0018450851,0.00028598573,0.00052390504,0.98150206],"genre_scores_gemma":[0.21077773,0.0010589281,0.5191843,0.0007828757,0.004610625,0.0005175244,0.0008776395,0.0028065806,0.25938383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988484,0.000002598764,0.0005019719,0.0002185264,0.00022208948,0.00020642692],"domain_scores_gemma":[0.9992065,0.00017911133,0.00024580906,0.0002810091,0.000036886893,0.00005069033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025661336,0.0003526319,0.000583301,0.000046402827,0.00013525356,0.000025341396,0.0001394797,0.0003728225,0.00007466087],"category_scores_gemma":[0.000004001508,0.00035569826,0.00035172162,0.000008509977,0.00013352722,0.0000125071265,0.00013849292,0.00044446523,9.118415e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026574311,0.000009303426,3.1078702e-8,0.00024550257,0.00062580284,7.885483e-7,0.0007942298,0.00005200159,0.0060540736,0.95679957,0.0031043808,0.03228775],"study_design_scores_gemma":[0.0014491471,0.00010067473,2.6608008e-8,0.0005205982,0.00062441884,0.00000792738,0.00041033898,0.003988508,0.034515068,0.75399965,0.20353869,0.00084495055],"about_ca_topic_score_codex":8.754691e-7,"about_ca_topic_score_gemma":2.751174e-7,"teacher_disagreement_score":0.72211826,"about_ca_system_score_codex":0.00003863213,"about_ca_system_score_gemma":0.000018891824,"threshold_uncertainty_score":0.9998895},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99502456,0.00004762757,0.0031421264,0.0009033614,0.00052600144,0.000067911984,0.000024551733,0.000041369865,0.00022251077],"genre_scores_gemma":[0.99538743,0.00003655528,0.0042449185,0.0001800496,0.00006746909,0.0000023164932,0.0000021187038,0.000014728894,0.00006443125],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9987766,0.00026662694,0.00031877198,0.00006339698,0.0004217863,0.00015279422],"domain_scores_gemma":[0.9990567,0.00032277819,0.0004043227,0.000114035654,0.00006412036,0.00003805012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036342745,0.00007832988,0.00024148794,0.00008919982,0.00009206087,0.000014693331,0.00015424716,0.000017286236,0.00004053011],"category_scores_gemma":[0.00031987965,0.000057473488,0.00006051734,0.0003244413,0.000027381968,0.00004834475,0.000067285946,0.00045100768,0.0000019090694],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005297475,0.00054284965,0.049055655,0.000015274049,0.00044006977,0.0002948224,0.0013296816,0.14495073,0.14310093,0.0050508115,0.6070946,0.047594868],"study_design_scores_gemma":[0.0020183607,0.0007723842,0.8740019,0.0002482442,0.00027540978,0.00017436572,0.00091854227,0.05027522,0.0145812435,0.04016351,0.015873399,0.00069736957],"about_ca_topic_score_codex":0.00006668201,"about_ca_topic_score_gemma":0.0000056285467,"teacher_disagreement_score":0.8249463,"about_ca_system_score_codex":0.00060418714,"about_ca_system_score_gemma":0.000028351127,"threshold_uncertainty_score":0.23437008},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022054815,0.00038071707,0.9913272,0.00018819846,0.00007514847,0.00040065448,0.0051811566,0.00015389493,0.000087545464],"genre_scores_gemma":[0.95295334,0.00014323159,0.045776553,0.00005201087,0.00008034815,0.00045914258,0.00047554783,0.000016318516,0.000043522174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959606,0.000009336008,0.000094979485,0.00008119236,0.000060375514,0.00015804979],"domain_scores_gemma":[0.99970055,0.00010957982,0.000018552506,0.000113372495,0.000021484344,0.000036477224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000033257234,0.000066189656,0.00006124345,0.000016979919,0.00047909655,0.000033774137,0.00006061447,0.000013840911,0.0000097446255],"category_scores_gemma":[0.0000121435605,0.000060655108,0.000012292779,0.000060553346,0.000054597742,0.000034511384,0.000044034565,0.00009076228,2.4479442e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001180756,0.00004088133,0.0003635487,0.00006133991,0.00006461059,0.0000016524965,0.00036729084,0.007325384,0.0005056007,0.93728775,0.027585328,0.026384784],"study_design_scores_gemma":[0.0004904149,0.00008208714,0.01572041,0.000008971582,0.000120403114,0.00003146801,0.00033605908,0.7624057,0.0005816442,0.048894096,0.17102109,0.00030764498],"about_ca_topic_score_codex":0.000009438577,"about_ca_topic_score_gemma":0.000009053622,"teacher_disagreement_score":0.95074785,"about_ca_system_score_codex":0.00002919599,"about_ca_system_score_gemma":0.000011501193,"threshold_uncertainty_score":0.36848718},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016733796,0.00007536609,0.9926148,0.0004409506,0.0005697377,0.0003159133,0.0000508787,0.0027223283,0.0015366244],"genre_scores_gemma":[0.9787263,0.00006738061,0.020395573,0.000164426,0.00002482126,0.00046630754,0.000013722757,0.000047741032,0.00009373002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987955,0.000050854327,0.00027281352,0.0003702302,0.00024532698,0.00026528732],"domain_scores_gemma":[0.9992291,0.000082659004,0.00004652032,0.0005343238,0.00006169839,0.000045702687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000837855,0.00021031527,0.00019784794,0.0009308623,0.00034822113,0.000013124608,0.00024671928,0.00014046177,0.0005108019],"category_scores_gemma":[0.000010407555,0.00024474162,0.00010948467,0.0009659231,0.00012896812,0.000065106506,0.000010116584,0.0008334294,0.000054338358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026993168,0.000117913405,0.0000026793612,0.000001960582,0.00002757368,0.000037376627,0.000048347847,0.826552,0.00088208437,0.00064827607,0.0005993226,0.1710555],"study_design_scores_gemma":[0.00008536173,0.0005493172,0.00001494043,0.000030776904,0.000021972855,0.00006115663,0.00075277284,0.8212522,0.16991751,0.0056979656,0.0013836428,0.00023237898],"about_ca_topic_score_codex":0.000021583774,"about_ca_topic_score_gemma":0.0000038959424,"teacher_disagreement_score":0.9770529,"about_ca_system_score_codex":0.00029818917,"about_ca_system_score_gemma":0.000028513601,"threshold_uncertainty_score":0.9980274},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30534017,0.00066422904,0.6446289,0.0040533165,0.0042177094,0.0022247797,0.001448152,0.003621757,0.033801004],"genre_scores_gemma":[0.9952733,0.000082000406,0.0026674243,0.0007663155,0.00039886966,0.00016248017,0.00015323206,0.0001181655,0.00037824851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637353,0.00019642797,0.0006328173,0.00081587565,0.001398579,0.0005827857],"domain_scores_gemma":[0.9984464,0.00030940052,0.00030213257,0.00039469483,0.0003239512,0.00022341675],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005262873,0.0005672466,0.0005570045,0.0005668491,0.0006621684,0.00082215306,0.000951406,0.00015696108,0.0015673912],"category_scores_gemma":[0.000114547656,0.0005763333,0.00016115989,0.0004268184,0.00018164662,0.00029569952,0.00025939257,0.001305004,0.000014449905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020909933,0.00081018114,0.000395613,0.00026354953,0.00043011058,0.0010605622,0.00050468586,0.4770001,0.41365835,0.0011931733,0.016000532,0.086592145],"study_design_scores_gemma":[0.0015310005,0.00029339248,0.00009957811,0.00021924044,0.00006755563,0.000052380088,0.00028561795,0.97200686,0.0216133,0.001845824,0.0013144414,0.00067081064],"about_ca_topic_score_codex":0.000022760261,"about_ca_topic_score_gemma":0.0000022438003,"teacher_disagreement_score":0.68993306,"about_ca_system_score_codex":0.0003857519,"about_ca_system_score_gemma":0.0002028548,"threshold_uncertainty_score":0.99966884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075656446,0.00011228347,0.9900901,0.00005149714,0.0007105451,0.00016476796,3.8510802e-7,0.0007940101,0.00051078224],"genre_scores_gemma":[0.3004906,0.0000040329414,0.69921184,0.000116302625,0.000062156265,0.000053610867,0.0000013717967,0.000013602004,0.000046517773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.00004012802,0.0001053259,0.00022944277,0.00018209149,0.0002629677],"domain_scores_gemma":[0.99959356,0.000071326554,0.000023909673,0.00019345398,0.000064013555,0.000053720676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072937965,0.00008555115,0.00010065764,0.00014010665,0.0004256082,0.0000802364,0.00045553464,0.000012531773,0.000013800383],"category_scores_gemma":[0.000020576314,0.00009120041,0.000040436495,0.00043852077,0.00007790313,0.00013979914,0.00030907095,0.00016721539,0.0000025631248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010242987,0.0000069379034,0.00003597106,0.0000066672865,0.000004098144,0.0000012315603,0.00053585554,0.7799267,0.016636232,0.00048014589,0.00092200807,0.20144312],"study_design_scores_gemma":[0.00006866067,0.000070674956,0.00007372699,0.0000047614017,0.0000029658884,0.000014959081,0.000016402288,0.9457094,0.008429709,0.0017924869,0.043696046,0.00012019861],"about_ca_topic_score_codex":0.0000061862793,"about_ca_topic_score_gemma":9.2272734e-7,"teacher_disagreement_score":0.29292494,"about_ca_system_score_codex":0.0000739625,"about_ca_system_score_gemma":0.00002081792,"threshold_uncertainty_score":0.3719045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9935677,0.0008687567,0.004411144,0.000049489918,0.00006514601,0.00010523551,0.0000028356367,0.00033410138,0.0005956068],"genre_scores_gemma":[0.99621284,0.000027061933,0.0036203042,0.000025196196,0.000049382554,0.00002130318,4.2329302e-7,0.000028248442,0.000015246622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991974,0.0000117308455,0.0001926435,0.00015944519,0.0002677503,0.00017103132],"domain_scores_gemma":[0.9996361,0.00006567301,0.00012584907,0.00006932991,0.00007020398,0.00003284053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017168182,0.00013242458,0.00023922655,0.00015861413,0.00044592252,0.000060924973,0.000233827,0.000052825824,0.000022515367],"category_scores_gemma":[0.000027836517,0.00011867587,0.00009067568,0.00075798214,0.00007566706,0.00011067069,0.0001378702,0.00041565608,1.3826366e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018916327,0.0001971777,0.2498529,0.0005389808,0.0022291893,0.0000067968513,0.007752049,0.40622014,0.26106948,0.0033407537,0.0013105816,0.0672928],"study_design_scores_gemma":[0.00007272428,0.00003476388,0.0033464488,0.00014249084,0.00070296915,0.00003661753,0.00085765583,0.8949497,0.09222771,0.0054283976,0.001907944,0.00029260598],"about_ca_topic_score_codex":0.000029312674,"about_ca_topic_score_gemma":0.0000013638772,"teacher_disagreement_score":0.48872954,"about_ca_system_score_codex":0.00006580847,"about_ca_system_score_gemma":0.0000094810575,"threshold_uncertainty_score":0.48394614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9074559,0.0009160872,0.06791998,0.00008176774,0.0024160587,0.0007327911,0.00015878202,0.0042291186,0.016089484],"genre_scores_gemma":[0.9952659,0.00093223085,0.00052252325,0.00006565713,0.00011383512,0.0000030013364,0.00013863531,0.00007706857,0.0028811356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987134,0.00009056808,0.00013925404,0.0006357953,0.00009889123,0.00032212306],"domain_scores_gemma":[0.99872905,0.000056809473,0.00008137731,0.0009578353,0.00006297956,0.00011197087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010840006,0.0003887887,0.0004205744,0.00024909986,0.00016050291,0.000057494788,0.0006540075,0.00034979093,0.0002872625],"category_scores_gemma":[0.000013789841,0.000474762,0.00028782498,0.0002896001,0.000052793126,0.000111965695,0.00082408095,0.0012189234,0.000041181815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013654052,0.000045624955,0.00052633905,0.00009644421,0.00024138647,0.0008762308,0.00015931769,0.92191976,0.0024135306,0.0022372792,0.07077021,0.00057732034],"study_design_scores_gemma":[0.0029076063,0.00010290376,0.002438063,0.0005188207,0.00055997696,0.000030847747,0.0003254572,0.8410638,0.013732879,0.015252006,0.120621026,0.002446642],"about_ca_topic_score_codex":0.00007546242,"about_ca_topic_score_gemma":0.000012916535,"teacher_disagreement_score":0.08780998,"about_ca_system_score_codex":0.00024775,"about_ca_system_score_gemma":0.000047885016,"threshold_uncertainty_score":0.9997704},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006261522,0.00075051707,0.6937684,0.00007114826,0.0018850608,0.0017216771,0.00009909819,0.0060339323,0.28940865],"genre_scores_gemma":[0.7980476,0.0018629786,0.18628637,0.00017478364,0.0020564715,0.0001572581,0.0015557572,0.0006399967,0.0092188055],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973681,0.00005669348,0.00068430556,0.0005533275,0.00085491233,0.0004826455],"domain_scores_gemma":[0.99708766,0.00009134564,0.00025754032,0.0010922276,0.0013276032,0.00014365478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026090746,0.00065099687,0.00075058086,0.00041976856,0.00024102206,0.00020589094,0.00026638922,0.0004900886,0.00014186565],"category_scores_gemma":[0.00005776765,0.00058327604,0.00014203059,0.00045507235,0.00018661708,0.00019198099,0.00007092525,0.0005334748,0.00013038196],"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.00008990145,0.0002804958,0.00012805215,0.000886062,0.0013529748,0.00023371613,0.0007451625,0.09690188,0.007257562,0.0004954551,0.8669079,0.02472086],"study_design_scores_gemma":[0.000600211,0.00015555359,0.00025400537,0.002792173,0.00053723715,0.00070587464,0.0002100484,0.68354225,0.016571863,0.00036100118,0.29248875,0.0017810136],"about_ca_topic_score_codex":0.00043166935,"about_ca_topic_score_gemma":0.0004027466,"teacher_disagreement_score":0.7917861,"about_ca_system_score_codex":0.00038997215,"about_ca_system_score_gemma":0.00038142368,"threshold_uncertainty_score":0.99966186},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025042796,0.0017666841,0.0077530826,0.000004644739,0.00044317447,0.00009575462,0.0000120450195,0.006653809,0.9832683],"genre_scores_gemma":[0.0012634406,0.00016452293,0.015826924,0.000076731805,0.0006003626,0.0000012596516,0.000049996597,0.001033292,0.9809835],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995265,0.000009130842,0.00008190811,0.000121253644,0.00011156178,0.00014963651],"domain_scores_gemma":[0.9995989,0.000006951967,0.000023428574,0.00028855153,0.000024557647,0.00005756168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000017384642,0.00019677987,0.000221163,0.000129108,0.000007634959,0.00001993304,0.000091582144,0.00020182478,0.00060727337],"category_scores_gemma":[0.0000033586884,0.0001832981,0.0000311703,0.0000593154,0.000023139559,0.000011775233,0.0000318189,0.00014092932,0.00028052428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.9245754e-7,0.0000013650533,2.0565808e-7,0.000008540302,0.000037303274,0.000021833159,0.000009467955,0.000082139406,0.00015704712,0.000035858775,0.9967241,0.0029218441],"study_design_scores_gemma":[0.000053472057,0.000004401336,2.670097e-7,0.00018816246,0.00001360973,0.000011524726,0.0000072751336,0.006051613,0.0015168206,0.00023358133,0.99168223,0.0002370189],"about_ca_topic_score_codex":0.00007477726,"about_ca_topic_score_gemma":0.000052862546,"teacher_disagreement_score":0.008073841,"about_ca_system_score_codex":0.00002219924,"about_ca_system_score_gemma":0.000010075208,"threshold_uncertainty_score":0.747468},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007750657,0.00014472258,0.9914046,0.000200255,0.000024733114,0.00031287098,0.0000022605307,0.00009584122,0.00006405766],"genre_scores_gemma":[0.5943101,0.00004827265,0.40524846,0.00018396546,0.0001849557,0.0000033499805,0.000003920859,0.000016800026,1.84944e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940103,0.000006646846,0.0002696367,0.00011531981,0.00010055733,0.000106802596],"domain_scores_gemma":[0.99955505,0.00004875456,0.00009365337,0.00004396854,0.0001041997,0.0001543559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008430919,0.00009993125,0.0001925581,0.00005731166,0.00015224401,0.000054207314,0.00005921287,0.000051246563,0.0000011457323],"category_scores_gemma":[0.0000131471,0.00009382212,0.000021091377,0.00012227304,0.000008721091,0.00011570239,0.00006520598,0.00010273528,1.5388e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002579486,0.000011235117,9.463122e-7,0.0000229429,0.00001216553,6.125638e-7,0.0007333424,0.7560642,0.13100012,0.00005729531,0.000038891958,0.11203249],"study_design_scores_gemma":[0.00026852105,0.00011879145,0.0000052052037,0.00003486032,0.000023083403,0.0000080924,0.000048861584,0.9760865,0.022366224,0.0001916248,0.00074046466,0.00010777097],"about_ca_topic_score_codex":7.0222166e-7,"about_ca_topic_score_gemma":3.7699397e-8,"teacher_disagreement_score":0.5865594,"about_ca_system_score_codex":0.000013926082,"about_ca_system_score_gemma":0.0000063506895,"threshold_uncertainty_score":0.3825955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5506399,0.002908733,0.42881843,0.0000062433933,0.0006406526,0.0007666358,0.000021872183,0.0018146946,0.014382803],"genre_scores_gemma":[0.9585916,0.000081683276,0.03995949,0.000008477776,0.00010992248,0.000003963914,0.00041731753,0.00010358638,0.00072400534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981987,0.000041151874,0.000535694,0.00047435,0.0002986603,0.0004514782],"domain_scores_gemma":[0.9989355,0.000027683765,0.00031129085,0.00044719622,0.00020426653,0.000074026444],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117852884,0.0004972837,0.000782021,0.0009868875,0.00025725362,0.00023961616,0.00027780005,0.00050604786,0.00003901303],"category_scores_gemma":[0.000014292276,0.0005296208,0.00024717866,0.00045930376,0.000039524337,0.0003040816,0.0000247016,0.0005642348,0.0000051217876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001205838,0.00017732709,0.0009872091,0.0008452194,0.001585002,0.0005063779,0.0025805864,0.6094862,0.22024103,0.000030474543,0.00024794135,0.16319205],"study_design_scores_gemma":[0.0002390641,0.000007930803,0.0032332393,0.0012590307,0.0005215735,0.0000054975926,0.00021235216,0.9399832,0.053792875,0.000110424175,0.000037240632,0.00059757853],"about_ca_topic_score_codex":0.0009620372,"about_ca_topic_score_gemma":0.0025544025,"teacher_disagreement_score":0.40795162,"about_ca_system_score_codex":0.00021015604,"about_ca_system_score_gemma":0.00007042847,"threshold_uncertainty_score":0.9997155},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001103638,0.00017786697,0.056394458,0.000006213327,0.00039048976,0.00015902457,0.000011548811,0.0012201105,0.94162923],"genre_scores_gemma":[0.048085432,0.00025645178,0.0019560566,0.000030017767,0.0002033753,0.0000015719638,0.000064934815,0.00012082765,0.94928133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995469,0.0000016668957,0.00012376411,0.00013079117,0.0001043396,0.000092551854],"domain_scores_gemma":[0.99964476,0.000021981901,0.00003070843,0.00023264205,0.00004668046,0.000023237668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000011931528,0.00020128916,0.00019167669,0.00008644906,0.000012657229,0.00002139889,0.00008523059,0.00023902826,0.0006761322],"category_scores_gemma":[0.0000018694732,0.00019219462,0.000063916166,0.000010133136,0.000011517366,0.000045192606,0.00002380035,0.00017483205,0.0006430589],"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.0000055969035,0.0000043871023,0.000008353327,0.00008069475,0.00027507308,0.000018798622,0.000119844124,0.003016066,0.0033677241,0.8714738,0.11249247,0.009137186],"study_design_scores_gemma":[0.00013549271,0.000051883286,0.000015553702,0.00037133577,0.0000637715,0.0000069101666,0.0000061364335,0.011125593,0.021681398,0.056107607,0.9095216,0.0009127554],"about_ca_topic_score_codex":0.0000034394006,"about_ca_topic_score_gemma":0.000002949289,"teacher_disagreement_score":0.8153662,"about_ca_system_score_codex":0.00004861591,"about_ca_system_score_gemma":0.0000110414185,"threshold_uncertainty_score":0.82654357},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18769714,0.0019296407,0.80845207,0.000009311554,0.00028319325,0.00051627523,0.000017112165,0.0005656323,0.0005296489],"genre_scores_gemma":[0.85817164,0.000101726175,0.14103934,0.000021497162,0.000027708626,0.000004211257,0.00052398414,0.00008570284,0.000024176306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806833,0.00015695873,0.00067524606,0.0004142863,0.000328424,0.0003567528],"domain_scores_gemma":[0.9984406,0.00043700653,0.00028647657,0.00054764474,0.00020435783,0.0000838873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030850706,0.0004692145,0.0008648745,0.0018551655,0.00006344563,0.0000768894,0.00014086683,0.0004171005,0.000020678033],"category_scores_gemma":[0.000031840234,0.00051100727,0.00022172501,0.0013276781,0.000046876554,0.00012534478,0.000009280643,0.0002850667,0.0000020891603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016747811,0.000086164495,0.0010248667,0.0006215845,0.0010190605,0.000023722427,0.00025741316,0.8380213,0.13073316,0.000016811167,0.00019819944,0.02783028],"study_design_scores_gemma":[0.00027204596,0.00002102922,0.008711352,0.00046549193,0.00087842025,0.0000010740434,0.00008874919,0.8133636,0.1756137,0.00010753718,0.0000122498095,0.00046471905],"about_ca_topic_score_codex":0.00057242526,"about_ca_topic_score_gemma":0.00019585915,"teacher_disagreement_score":0.6704745,"about_ca_system_score_codex":0.00008204888,"about_ca_system_score_gemma":0.000067613626,"threshold_uncertainty_score":0.99973416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78306437,0.000114180846,0.20910604,0.0002678966,0.00037022308,0.00033847766,0.000015579468,0.0011995954,0.0055236258],"genre_scores_gemma":[0.9977324,0.0000038974326,0.0019743503,0.00015603544,0.000047310612,0.000043893244,0.000008923508,0.000013102725,0.000020073596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995462,0.00001818432,0.00009001756,0.000053053478,0.00014676414,0.0001457836],"domain_scores_gemma":[0.9997554,0.00002120873,0.000026142578,0.00016499271,0.000012157751,0.00002010712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004819572,0.00008121867,0.00006750767,0.000032508713,0.00016024272,0.000045840836,0.00013471549,0.000012804782,0.00006643967],"category_scores_gemma":[0.0000036954477,0.00006043714,0.000021381682,0.00006892479,0.000018937162,0.00011216214,0.00007531062,0.00015060412,0.000012069454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118747936,0.000018993542,0.00046414518,0.000026674248,0.00007742037,0.000046813966,0.0021905072,0.9539485,0.004647814,0.0019024328,0.022406459,0.014151519],"study_design_scores_gemma":[0.00040345054,0.0002543524,0.0016819836,0.000018294477,0.000032610755,0.00013138156,0.00057125324,0.8369361,0.0068442435,0.00009200433,0.152733,0.00030132892],"about_ca_topic_score_codex":0.000005262624,"about_ca_topic_score_gemma":0.0000019112376,"teacher_disagreement_score":0.21466804,"about_ca_system_score_codex":0.000052382828,"about_ca_system_score_gemma":0.000009355322,"threshold_uncertainty_score":0.2464555},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90147007,0.0004483491,0.08813105,0.00005732032,0.00067148433,0.00029085242,0.000016361608,0.0031324518,0.0057820603],"genre_scores_gemma":[0.9584657,0.000008385621,0.0410061,0.00012903975,0.00009573066,0.0000027421052,0.000011930928,0.00006317987,0.00021719243],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898285,0.000061313156,0.00020492687,0.00021989677,0.0002454406,0.00028556582],"domain_scores_gemma":[0.9994611,0.000037711958,0.00003820078,0.00035180032,0.000048278856,0.00006288288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009037757,0.00018942739,0.00021004316,0.00013031093,0.0003087471,0.000039614293,0.00015217515,0.000048342015,0.00021930713],"category_scores_gemma":[0.000010597926,0.00018274169,0.00007636779,0.00021009077,0.000030173524,0.00008783483,0.0001838828,0.0002910934,0.000007782036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023534802,0.00004032258,0.00017426236,0.000013818446,0.000035323086,0.00010679106,0.0001748094,0.41969234,0.56277645,0.00004640254,0.008781008,0.008134954],"study_design_scores_gemma":[0.0002117334,0.000020557405,0.00006179009,0.000036463283,0.000013124324,0.000080780614,0.00021010551,0.87267303,0.11452363,0.000061074104,0.011881786,0.00022590435],"about_ca_topic_score_codex":0.00008800255,"about_ca_topic_score_gemma":0.000003983466,"teacher_disagreement_score":0.45298073,"about_ca_system_score_codex":0.000092706745,"about_ca_system_score_gemma":0.000011894306,"threshold_uncertainty_score":0.74519897},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016561761,0.0003705804,0.9814814,0.00007068534,0.00013145726,0.00034403516,0.00004997594,0.00061658013,0.00037357322],"genre_scores_gemma":[0.98075616,0.000028564114,0.01860927,0.00013437291,0.00005070861,0.00020071458,0.000003695075,0.000076698896,0.00013980325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896705,0.000018426861,0.0002034391,0.0002997179,0.00022058917,0.00029080082],"domain_scores_gemma":[0.9995787,0.00009393854,0.00005041406,0.00012993562,0.00007319193,0.00007377999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121755045,0.00023065529,0.000217695,0.000197881,0.00055599504,0.00008935609,0.00011307593,0.00005658246,0.000038872327],"category_scores_gemma":[9.241375e-7,0.00023108472,0.00006487081,0.00029170178,0.000057466,0.00019751808,0.0000021522035,0.00032692577,9.473463e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015062776,0.00010970938,6.6479566e-7,0.000058184305,0.00007701772,0.0000063171747,0.00019622763,0.735005,0.054957233,0.000005719716,0.0002773179,0.20915599],"study_design_scores_gemma":[0.0012985421,0.0009195438,0.0000059580857,0.00024895987,0.00017047637,0.00021189306,0.00034466328,0.7458091,0.23743045,0.00036849637,0.012451509,0.00074041134],"about_ca_topic_score_codex":0.000013726343,"about_ca_topic_score_gemma":0.000011264236,"teacher_disagreement_score":0.9641944,"about_ca_system_score_codex":0.00007574055,"about_ca_system_score_gemma":0.00006320437,"threshold_uncertainty_score":0.94233614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52748954,0.0008059553,0.0032535645,0.000013273481,0.0012281496,0.0005290164,0.000028266524,0.004198058,0.46245417],"genre_scores_gemma":[0.9551659,0.0003112192,0.0053308313,0.00009314195,0.00021376871,0.00012551149,0.0016625663,0.00027818745,0.03681885],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991856,0.000015856853,0.00016456377,0.00021589205,0.00022104436,0.00019701062],"domain_scores_gemma":[0.9995859,0.000027601282,0.000045521283,0.00025914106,0.00003850493,0.000043311284],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000040171206,0.00025935718,0.00024174956,0.00015042486,0.00005843503,0.000041760664,0.00016248283,0.00012467134,0.002600046],"category_scores_gemma":[0.0000026886692,0.00024067835,0.000073289804,0.00014172221,0.000007539391,0.000062577965,0.000013612781,0.00038084752,0.000032747084],"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.0014319968,0.00030118745,0.00049536454,0.00077746785,0.0016302128,0.0009154889,0.0018540921,0.19953328,0.085717656,0.002114225,0.5776618,0.1275672],"study_design_scores_gemma":[0.001199408,0.0012024923,0.0051030396,0.0012635698,0.0006419071,0.0001070893,0.0030270275,0.028668389,0.78897303,0.0028902336,0.16189165,0.005032125],"about_ca_topic_score_codex":0.00008505896,"about_ca_topic_score_gemma":0.00026692767,"teacher_disagreement_score":0.7032554,"about_ca_system_score_codex":0.00006532874,"about_ca_system_score_gemma":0.000036863894,"threshold_uncertainty_score":0.9983117},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89235026,0.0045574554,0.1010028,0.00014402566,0.0005420846,0.00027418716,0.000003987258,0.00030215812,0.00082306296],"genre_scores_gemma":[0.9927396,0.000026059319,0.0062817032,0.00020596522,0.0006415775,0.000011605935,0.000013265592,0.00006501461,0.0000152063885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976949,0.0002972803,0.00065873825,0.00024966715,0.00052528275,0.000574134],"domain_scores_gemma":[0.9989493,0.000108764056,0.00027076792,0.00012122738,0.00037951831,0.00017041802],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038998885,0.0002860738,0.0004575705,0.00032977297,0.00037996809,0.00015876844,0.00046859242,0.00006666548,0.00015078155],"category_scores_gemma":[0.000025957988,0.00030918335,0.00007500351,0.0009813836,0.000040794217,0.000515085,0.000074849966,0.0016265601,4.1982227e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013548987,0.00005960275,0.0013612533,0.000016931655,0.000039712042,0.00021761813,0.001271458,0.8578408,0.086664684,0.0000053480735,0.0013421758,0.051044945],"study_design_scores_gemma":[0.00064597017,0.00040457246,0.0006245121,0.00021037142,0.0000430739,0.00030772891,0.0006594452,0.96940666,0.025449188,0.00050376327,0.0013284966,0.0004161888],"about_ca_topic_score_codex":0.000022018556,"about_ca_topic_score_gemma":0.00000937457,"teacher_disagreement_score":0.1115659,"about_ca_system_score_codex":0.00026967126,"about_ca_system_score_gemma":0.00010109275,"threshold_uncertainty_score":0.99993604},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060798705,0.0001659932,0.9379089,0.00009160431,0.000044581084,0.00011749311,0.00000732565,0.000076014236,0.00078936765],"genre_scores_gemma":[0.9073024,0.00008314996,0.092398025,0.00014347961,0.000043783737,0.0000046897358,0.000006562793,0.000013604584,0.000004309894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943,0.000013927974,0.00022659384,0.00008303162,0.00014772027,0.0000987127],"domain_scores_gemma":[0.99971795,0.000026811718,0.000112979666,0.000035071145,0.000047405472,0.000059800615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011421489,0.000090154055,0.00017219139,0.00006643334,0.000102268736,0.000030619412,0.000038343653,0.00003658212,0.00002099885],"category_scores_gemma":[0.000003933835,0.00008851583,0.000024898896,0.00006356894,0.00002258866,0.00009837513,0.00003379841,0.00020482071,1.1711547e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003421446,0.000020561574,0.0000023100915,0.0000071835143,0.000024319133,0.00000403903,0.00009898976,0.98932344,0.0047690384,0.0021733444,0.0000910144,0.0034515595],"study_design_scores_gemma":[0.00043909156,0.00007766283,0.000027250308,0.000010530299,0.000023715747,0.00008328107,0.000069843525,0.993365,0.0016250925,0.004122734,0.00005643522,0.000099345074],"about_ca_topic_score_codex":4.6877966e-7,"about_ca_topic_score_gemma":8.96875e-9,"teacher_disagreement_score":0.8465037,"about_ca_system_score_codex":0.000035536024,"about_ca_system_score_gemma":0.000017083868,"threshold_uncertainty_score":0.3609571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019881043,0.0029466203,0.9907119,0.00049340667,0.0010331289,0.0006668629,0.00007755477,0.0009899777,0.0010924077],"genre_scores_gemma":[0.99125,0.0013232116,0.006094568,0.00006435386,0.0000387711,0.0009942695,0.00010796991,0.00004987069,0.00007697877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888206,0.00021871817,0.0003568494,0.00016804911,0.00014459052,0.00022973727],"domain_scores_gemma":[0.99793845,0.00033982014,0.00008229279,0.0015040464,0.0000784776,0.00005691533],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00019749308,0.0001707871,0.00017879186,0.00019778368,0.0013741043,0.000057084202,0.00068855955,0.00007286026,0.00004680353],"category_scores_gemma":[0.000001876115,0.00021608928,0.00013383599,0.0003279947,0.00012676671,0.00015269397,0.00001158649,0.0006049066,0.0000057907405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022691247,0.000084844825,0.000010042219,0.000005089888,0.00007315224,1.8698357e-7,0.000093570234,0.97447675,0.00041925075,0.001609371,0.00028291764,0.022922117],"study_design_scores_gemma":[0.00024919695,0.00006544196,0.00005448444,0.000018368513,0.00005008346,0.0000893073,0.00017243675,0.98979783,0.000637542,0.00094127544,0.0077094226,0.00021463248],"about_ca_topic_score_codex":0.00006176325,"about_ca_topic_score_gemma":0.00014187422,"teacher_disagreement_score":0.9892619,"about_ca_system_score_codex":0.0002767194,"about_ca_system_score_gemma":0.000015972239,"threshold_uncertainty_score":0.999926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96901387,0.00021283775,0.0066220886,0.00001834458,0.00023478907,0.00026729773,0.0000032428075,0.003598507,0.020029021],"genre_scores_gemma":[0.9815243,0.00000786992,0.018103339,0.00007691478,0.000050681458,0.000038137852,0.0000049566165,0.000028760693,0.00016503868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949294,0.00002103651,0.00009704926,0.000105684805,0.000115372655,0.00016790524],"domain_scores_gemma":[0.9997868,0.000012487083,0.000012189945,0.00014777068,0.000010857831,0.000029890029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053124073,0.00008676089,0.000087366,0.000080620346,0.0000994516,0.000023152223,0.00009897055,0.000020621383,0.0005651829],"category_scores_gemma":[0.0000013660813,0.00009303859,0.000048678074,0.00016702474,0.000011575765,0.0000613404,0.00009631779,0.00014304,0.0000071847435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040961717,0.00020127236,0.00029060477,0.000017194488,0.00009677107,0.00024505172,0.00012688263,0.6930718,0.11076661,0.00037761906,0.06520925,0.12955597],"study_design_scores_gemma":[0.00017254692,0.00033558553,0.00011398028,0.000015256943,0.000017209171,0.000097227814,0.00009494841,0.929824,0.028122656,0.0009829699,0.03992104,0.00030257535],"about_ca_topic_score_codex":0.00003141529,"about_ca_topic_score_gemma":0.0000012604943,"teacher_disagreement_score":0.2367522,"about_ca_system_score_codex":0.000066254404,"about_ca_system_score_gemma":0.000011981782,"threshold_uncertainty_score":0.6188356},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.785764,0.00010549473,0.20846583,0.0000137506695,0.00019830743,0.00015121976,0.0000058781716,0.00095275434,0.004342812],"genre_scores_gemma":[0.99736,0.00034820102,0.0018116935,0.000029749503,0.00009369735,0.0000011252491,0.0000595984,0.00004652147,0.00024944902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990675,0.000043226795,0.00011962309,0.0004814762,0.00006442061,0.00022374032],"domain_scores_gemma":[0.9991325,0.00003695975,0.000039981325,0.00059601327,0.00010851342,0.00008604026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00003600715,0.00027853553,0.00029293122,0.00011118821,0.00006397863,0.00010750838,0.00027645007,0.00027497215,0.000076534394],"category_scores_gemma":[0.000006955277,0.00030626092,0.00010630988,0.0002043393,0.000060069775,0.00014954794,0.00024410781,0.0004966909,0.0000130813505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056302746,0.000077076606,0.0028162382,0.00010586264,0.00033019824,0.0011453144,0.00019013764,0.9845617,0.0032105278,0.004498248,0.0021001522,0.00090824],"study_design_scores_gemma":[0.00048901344,0.00007286025,0.0015166054,0.000496335,0.00021085005,0.000023677818,0.0003700298,0.97317183,0.019545404,0.001287883,0.0018350988,0.000980393],"about_ca_topic_score_codex":0.00008757873,"about_ca_topic_score_gemma":0.00009116231,"teacher_disagreement_score":0.21159601,"about_ca_system_score_codex":0.00011721406,"about_ca_system_score_gemma":0.000046943387,"threshold_uncertainty_score":0.99993896},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53007376,0.00034376237,0.46795595,0.000007659214,0.00047191198,0.00031556914,0.000008545039,0.00026810623,0.0005547416],"genre_scores_gemma":[0.9931254,0.0034829983,0.0027531176,0.000047476547,0.0002327918,0.0000013997667,0.000052824907,0.00012310804,0.00018087475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963309,0.00033977098,0.00064836757,0.0015969829,0.00014413455,0.0009398218],"domain_scores_gemma":[0.9974877,0.0005011723,0.00037888638,0.0011809189,0.00019592672,0.00025539947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005204938,0.0008974211,0.00115814,0.0008985003,0.00023787179,0.00017922542,0.00067394593,0.0008906485,0.000037915393],"category_scores_gemma":[0.000051154086,0.001218579,0.00029037363,0.0009237671,0.0002140395,0.00028500112,0.0011089017,0.0012484009,0.000031555697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001888804,0.000086224696,0.016063934,0.00014978703,0.00010740123,0.00025355897,0.00019107321,0.97731525,0.0025746769,0.0026313395,0.000019361965,0.00041849673],"study_design_scores_gemma":[0.000937022,0.00007317381,0.010664269,0.0016237657,0.0001858163,0.000046845616,0.0002575606,0.9833414,0.0007045727,0.0006985948,0.00028521314,0.0011817976],"about_ca_topic_score_codex":0.0037723102,"about_ca_topic_score_gemma":0.00012958865,"teacher_disagreement_score":0.4652028,"about_ca_system_score_codex":0.0005714731,"about_ca_system_score_gemma":0.000096012816,"threshold_uncertainty_score":0.9990264},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48505214,0.0004844957,0.5129062,0.000010957041,0.0005663044,0.00041078398,0.000013404511,0.00026728018,0.00028846512],"genre_scores_gemma":[0.9940823,0.0011653265,0.004327962,0.00001569679,0.00012058997,0.000002155491,0.000027131515,0.00006657824,0.00019226514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776185,0.00008734612,0.00043911886,0.0010738124,0.00010911623,0.0005287518],"domain_scores_gemma":[0.9983067,0.00017286993,0.00021949352,0.0007092361,0.00031747192,0.0002742451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040229008,0.0005923063,0.00065822114,0.00049936766,0.00012070447,0.00008199249,0.0005176896,0.00053123414,0.000038533813],"category_scores_gemma":[0.0000987858,0.000789867,0.0001140089,0.0006280132,0.0002215685,0.00032698608,0.00074889144,0.00096979935,0.0000489867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046144316,0.00005322641,0.0013934127,0.00010928754,0.00008953854,0.00018035376,0.00042277147,0.99434245,0.00018927695,0.0026203291,0.000062861385,0.0004903735],"study_design_scores_gemma":[0.0006284766,0.0000471914,0.00042320928,0.00061921426,0.00011441943,0.000010380473,0.00036819014,0.97406834,0.0008596605,0.022064006,0.000042527037,0.00075435534],"about_ca_topic_score_codex":0.00034096214,"about_ca_topic_score_gemma":0.000056613793,"teacher_disagreement_score":0.50903016,"about_ca_system_score_codex":0.0003608116,"about_ca_system_score_gemma":0.00015748432,"threshold_uncertainty_score":0.9994552},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49847916,0.00012466083,0.49959603,0.00004489595,0.0001539126,0.00085159496,0.00002725188,0.00030376203,0.00041873576],"genre_scores_gemma":[0.9956362,0.0011057099,0.0028598749,0.00005047759,0.000089069734,0.0000023570635,0.000074781055,0.00009817498,0.00008331407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974305,0.0001651842,0.00057144096,0.0011978997,0.00014779907,0.00048718217],"domain_scores_gemma":[0.997311,0.0001756506,0.0004145699,0.0012093359,0.00054233277,0.00034709065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016173154,0.000630988,0.0007908092,0.0006210201,0.00023692314,0.0000883182,0.00051807694,0.00065906224,0.00002898475],"category_scores_gemma":[0.00005858945,0.00082834286,0.00018523456,0.0008310504,0.00013533555,0.00031620846,0.00079580443,0.00065430626,0.000048599944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058931742,0.00008054562,0.0002993644,0.00023092267,0.00017381483,0.000025103716,0.00051105977,0.76640606,0.20603825,0.023896003,0.00014661493,0.0021333562],"study_design_scores_gemma":[0.00033457112,0.0000697358,0.0011500113,0.00079735345,0.00024396183,0.000005871653,0.00023151553,0.8928276,0.09772357,0.005579907,0.0003005398,0.0007353966],"about_ca_topic_score_codex":0.00073256745,"about_ca_topic_score_gemma":0.00006539025,"teacher_disagreement_score":0.49715707,"about_ca_system_score_codex":0.00016556811,"about_ca_system_score_gemma":0.00006808946,"threshold_uncertainty_score":0.99941677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52765495,0.000026508378,0.46603382,0.000010327342,0.0016130133,0.0006195361,0.00011784914,0.0007810018,0.0031429778],"genre_scores_gemma":[0.9942591,0.0004089309,0.0044720774,0.0000883148,0.00037909896,0.0000020892073,0.00017210284,0.00010358738,0.00011469834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996586,0.00019340067,0.00094538863,0.0010144934,0.00022899384,0.0010317],"domain_scores_gemma":[0.99645895,0.00020455463,0.00089557393,0.0015060446,0.00051071186,0.0004241761],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0003693153,0.0010300162,0.0010443415,0.00072574744,0.00047563761,0.00042901307,0.0012089934,0.0013178688,0.0008601494],"category_scores_gemma":[0.0001021652,0.0013976347,0.00057661935,0.0006272293,0.00025518384,0.0018692332,0.0013610888,0.0023073726,0.00025292163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018777538,0.00006397297,0.0004512417,0.00017899452,0.0003679356,0.00019962987,0.00046796654,0.9747885,0.018010298,0.0031750137,0.00034581503,0.0017628864],"study_design_scores_gemma":[0.0009114189,0.000087944056,0.00035247937,0.00058398425,0.0004813416,0.000034740868,0.00016759531,0.95037806,0.03263963,0.005057901,0.0077948365,0.0015100526],"about_ca_topic_score_codex":0.00095524744,"about_ca_topic_score_gemma":0.000048235164,"teacher_disagreement_score":0.4666041,"about_ca_system_score_codex":0.00053166365,"about_ca_system_score_gemma":0.00029706952,"threshold_uncertainty_score":0.99999434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62391925,0.00015405574,0.37356764,0.0000085285365,0.000112546615,0.0001718205,0.000012338513,0.00019313421,0.0018607004],"genre_scores_gemma":[0.9757051,0.0013852725,0.022369104,0.000015296706,0.00005236366,5.065764e-7,0.0000128268775,0.000057798374,0.0004017274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974743,0.00035378884,0.00046418843,0.001082916,0.00012440122,0.00050040707],"domain_scores_gemma":[0.9973938,0.00030651665,0.00046118128,0.0012790001,0.00031527813,0.00024425128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061176746,0.0006270972,0.0013402739,0.00087907846,0.00021795045,0.00008466049,0.0006867194,0.0005552095,0.0001278765],"category_scores_gemma":[0.00003199473,0.0007835752,0.0005177549,0.0018539681,0.00044850583,0.00020371958,0.0009414526,0.0008027173,0.0000132708465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000853376,0.0000539976,0.011008084,0.00019961594,0.0029510907,0.00004052528,0.00024846933,0.97723424,0.0026393528,0.0026072075,0.00006276892,0.0028692877],"study_design_scores_gemma":[0.00030274343,0.00012978395,0.011327284,0.00026072285,0.0050769486,0.0000050890817,0.00007675709,0.9683662,0.012085859,0.00084354414,0.000808207,0.00071685883],"about_ca_topic_score_codex":0.0004395716,"about_ca_topic_score_gemma":0.000030898445,"teacher_disagreement_score":0.35178587,"about_ca_system_score_codex":0.00013755482,"about_ca_system_score_gemma":0.00007328846,"threshold_uncertainty_score":0.99946153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3311088,0.00008105804,0.6671383,0.000010460246,0.00008799939,0.0004041184,0.000005489583,0.0003550487,0.0008087512],"genre_scores_gemma":[0.99950784,0.00011666398,0.0002480269,0.000022535878,0.000016122434,0.0000018587122,0.000014863241,0.000027356653,0.000044742115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931234,0.000050678787,0.00014046983,0.0002935076,0.00008711789,0.000115866686],"domain_scores_gemma":[0.9992324,0.000028924209,0.00010401296,0.00037942565,0.00020550704,0.000049744856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010341842,0.00018307182,0.00020511505,0.0001673792,0.000033134755,0.000019166075,0.00012634152,0.00018593053,0.000019606476],"category_scores_gemma":[0.000015656118,0.00021036193,0.000054919736,0.00010953664,0.000058239704,0.00004238685,0.000058327645,0.00017961308,0.00000859768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014878196,0.000029499133,0.0005026561,0.00019704545,0.00004913861,0.0000029976654,0.00007617599,0.9947808,0.001693311,0.0018990537,0.0004345626,0.0003199276],"study_design_scores_gemma":[0.00027861664,0.00003395519,0.00037949558,0.00039453767,0.000064630876,3.3874505e-7,0.000025258305,0.98399407,0.010423351,0.0039010358,0.00028510016,0.00021959483],"about_ca_topic_score_codex":0.00009036281,"about_ca_topic_score_gemma":0.000007314287,"teacher_disagreement_score":0.66839904,"about_ca_system_score_codex":0.000104173014,"about_ca_system_score_gemma":0.000019335415,"threshold_uncertainty_score":0.85783106},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54294384,0.0010404534,0.44660056,0.000030082598,0.0011988053,0.00060009555,0.00008346357,0.0006308373,0.006871897],"genre_scores_gemma":[0.9912524,0.0043881866,0.0035850035,0.000020536196,0.00012693078,9.654633e-7,0.000050448885,0.000070021444,0.00050545915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978201,0.00011141609,0.00047275505,0.0009061509,0.00014518521,0.00054442754],"domain_scores_gemma":[0.99746627,0.00012984236,0.0003790554,0.0011311894,0.0005481304,0.00034551832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003402388,0.0006034498,0.00076612784,0.00069147657,0.00020648919,0.00006946362,0.0006521169,0.0007429886,0.00013600288],"category_scores_gemma":[0.00009002822,0.00080089486,0.00023260062,0.0009834332,0.00040588286,0.00043738264,0.001395237,0.00074562966,0.000025372048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007010325,0.0000959754,0.0013982272,0.00019530464,0.0002547438,0.00011228034,0.00023724503,0.98683184,0.000068409565,0.0086201625,0.0016114685,0.00050422235],"study_design_scores_gemma":[0.00080358406,0.00009442219,0.00041565552,0.0005333902,0.00043695312,0.000017568738,0.000504935,0.987153,0.00072750397,0.0077464175,0.0007388564,0.00082771713],"about_ca_topic_score_codex":0.00030161205,"about_ca_topic_score_gemma":0.000035177956,"teacher_disagreement_score":0.44830862,"about_ca_system_score_codex":0.00037567527,"about_ca_system_score_gemma":0.0002185957,"threshold_uncertainty_score":0.9994442},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5766733,0.0013614602,0.38329387,0.0007265284,0.0008945262,0.0004932668,0.00009672436,0.0019440085,0.03451627],"genre_scores_gemma":[0.95164514,0.0006827256,0.046683475,0.000026102718,0.000099703626,0.000028546094,0.00022817162,0.00012296408,0.00048317504],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973622,0.00074975815,0.0004639988,0.00063771533,0.00033683985,0.00044949082],"domain_scores_gemma":[0.99505955,0.00046413488,0.00033903887,0.0028926285,0.0010783782,0.00016625875],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015763856,0.00046150523,0.00047897067,0.00019396849,0.0004895766,0.0007650455,0.0013629145,0.00039274528,0.000051457042],"category_scores_gemma":[0.0005341253,0.0005355407,0.00024184422,0.00012582136,0.0002114816,0.00014153884,0.0008750812,0.00086271175,0.000026770824],"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.000041202846,0.0008063318,0.003488773,0.0012271719,0.0010217851,0.000084967374,0.013528057,0.03974439,0.8241126,0.026376754,0.007926865,0.08164113],"study_design_scores_gemma":[0.00031887612,2.4941465e-7,0.0023776528,0.004861702,0.0001026932,0.000041009782,0.000036818394,0.18651007,0.7907019,0.0033944033,0.010611571,0.0010430189],"about_ca_topic_score_codex":0.00088381564,"about_ca_topic_score_gemma":0.00055674533,"teacher_disagreement_score":0.3749718,"about_ca_system_score_codex":0.00018974413,"about_ca_system_score_gemma":0.00012723004,"threshold_uncertainty_score":0.9997096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88533515,0.0001542084,0.102989286,0.00006161912,0.0003819908,0.00042624972,0.000016731228,0.0010136113,0.009621151],"genre_scores_gemma":[0.9985048,0.00043462752,0.0002967736,0.000108728236,0.00013233627,0.0000018483277,0.000024750685,0.00007282774,0.0004233143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986385,0.00006250793,0.00017347693,0.0006058079,0.00009567594,0.0004239941],"domain_scores_gemma":[0.9986472,0.0001208791,0.000118985416,0.0009064602,0.00007537825,0.0001311086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001622506,0.00045962937,0.0003931132,0.00019190667,0.000219831,0.000118722,0.0006277766,0.0003185621,0.00002459355],"category_scores_gemma":[0.000010841099,0.00038571144,0.00012932064,0.00024201417,0.00018515937,0.00012863493,0.0005465373,0.0008548337,0.000024488243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014459583,0.000060381786,0.0070066163,0.00038398942,0.00066505134,0.00049875455,0.00078723865,0.9738345,0.0005564779,0.010995512,0.0034609884,0.001605869],"study_design_scores_gemma":[0.0012858202,0.00016260319,0.0035099303,0.001460439,0.00059716863,0.000062037776,0.0005332253,0.97114754,0.0051952517,0.0067847497,0.007234965,0.0020262518],"about_ca_topic_score_codex":0.00015596957,"about_ca_topic_score_gemma":0.00018350646,"teacher_disagreement_score":0.11316964,"about_ca_system_score_codex":0.00013365914,"about_ca_system_score_gemma":0.000031730662,"threshold_uncertainty_score":0.99985945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15477934,0.00002304196,0.8433763,0.000016429594,0.00002671187,0.0003703193,0.000013497574,0.00044433042,0.00095006975],"genre_scores_gemma":[0.5181021,7.8368586e-8,0.48172984,0.000029448136,0.0000066542566,0.00008926285,0.00002543288,0.000015406944,0.0000018092566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987387,0.00017062097,0.00036113535,0.00022407253,0.00023791249,0.00026757352],"domain_scores_gemma":[0.99922276,0.00010438133,0.00004680178,0.00046559345,0.000028918386,0.00013152986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006576537,0.00015422929,0.00040401044,0.00034133618,0.0001396123,0.000032237604,0.00021624808,0.000026101612,0.00016753982],"category_scores_gemma":[0.000018089924,0.00015041421,0.0001600129,0.0010536761,0.00004874204,0.00003820016,0.00009883104,0.00016738381,0.0000010622616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098540346,0.005952586,0.0007588209,0.0009327359,0.004237372,0.00073717313,0.009605491,0.4647509,0.018388204,0.08029867,0.0012772699,0.41296226],"study_design_scores_gemma":[0.000087184,0.00011175363,0.00003427762,0.000010682994,0.0004567216,0.00004810517,0.00065819564,0.9897716,0.0052806446,0.0023064285,0.0010324041,0.00020197003],"about_ca_topic_score_codex":0.000042720265,"about_ca_topic_score_gemma":0.000007395387,"teacher_disagreement_score":0.5250208,"about_ca_system_score_codex":0.00008091353,"about_ca_system_score_gemma":0.00000568035,"threshold_uncertainty_score":0.6133714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044785857,0.002656354,0.9385994,0.0001592833,0.00055434275,0.0034243823,0.00025344998,0.0024822662,0.0070846872],"genre_scores_gemma":[0.714715,0.0006840639,0.28055027,0.000016063128,0.0002637448,0.0020401105,0.0007328602,0.000266143,0.00073175924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967528,0.00085415505,0.00032184026,0.0005886827,0.0006659006,0.00081664126],"domain_scores_gemma":[0.9973043,0.0013387725,0.000057025296,0.0005967847,0.0005169807,0.0001861414],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0017717604,0.00034969763,0.00051541795,0.00047789328,0.00040262492,0.00027108812,0.0005010544,0.0002123077,0.00047676766],"category_scores_gemma":[0.0003566928,0.00032229314,0.00010915244,0.00033684762,0.0001650369,0.00005664017,0.00081208773,0.003036299,0.000008900919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012516964,0.00039471305,0.0020027019,0.0065088323,0.0015853108,0.0006527701,0.004669961,0.68182194,0.006705938,0.011012785,0.06602011,0.21737325],"study_design_scores_gemma":[0.0006634508,0.0016035023,0.001353817,0.0012073664,0.0000939137,0.000029435043,0.002094784,0.7645209,0.023411484,0.012278729,0.1914465,0.0012961552],"about_ca_topic_score_codex":0.00017339131,"about_ca_topic_score_gemma":0.000017538103,"teacher_disagreement_score":0.66992915,"about_ca_system_score_codex":0.00039193753,"about_ca_system_score_gemma":0.00021845617,"threshold_uncertainty_score":0.99992293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21626453,0.008262372,0.66377914,0.0011111384,0.0055248984,0.015751675,0.0036997246,0.00718311,0.07842344],"genre_scores_gemma":[0.95065624,0.0007490898,0.044640735,0.00007234918,0.00081954454,0.00055895076,0.001689355,0.00026955115,0.0005441938],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971481,0.00045628077,0.000379181,0.000601141,0.00076108717,0.00065418857],"domain_scores_gemma":[0.9971517,0.00093721447,0.00009254703,0.00080264005,0.00090458826,0.00011131362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007775114,0.0003574435,0.00048091344,0.0005968875,0.00045543895,0.0004156231,0.00043479237,0.00026580345,0.0001756488],"category_scores_gemma":[0.00024917573,0.0004042715,0.0002489948,0.00026889588,0.00012005459,0.00011814511,0.0010255235,0.0019518742,0.000020239022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005349098,0.00024857535,0.00010238878,0.0049494808,0.001083544,0.000629828,0.006447829,0.29006588,0.06385804,0.0022637446,0.5545772,0.0752386],"study_design_scores_gemma":[0.00084661343,0.00055133953,0.0005213627,0.002972753,0.000075175485,0.000033432752,0.002102811,0.77550054,0.07401924,0.058698528,0.08308066,0.001597555],"about_ca_topic_score_codex":0.00013270052,"about_ca_topic_score_gemma":0.000019263809,"teacher_disagreement_score":0.7343917,"about_ca_system_score_codex":0.00066224835,"about_ca_system_score_gemma":0.00012904877,"threshold_uncertainty_score":0.9998409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49527335,0.000028614157,0.5025255,0.0000034689951,0.00038866315,0.00018081884,0.0005104713,0.00046620474,0.0006228832],"genre_scores_gemma":[0.98937887,0.000053511892,0.008224788,0.00001150031,0.00015121665,0.0000014679684,0.002058958,0.000049637263,0.00007006419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.00008044406,0.0002762899,0.00056860724,0.00008806017,0.00024443772],"domain_scores_gemma":[0.9986003,0.00007793017,0.00021107502,0.0008919852,0.00012444495,0.000094238276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000116076044,0.00033865537,0.0003768816,0.00024810884,0.00008795705,0.000041931988,0.0005405548,0.0003461138,0.00010852755],"category_scores_gemma":[0.000010535604,0.00040835422,0.00015397741,0.00022709457,0.00009397311,0.00015877381,0.0005879001,0.0004817627,0.000054149263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030006218,0.00038410252,0.0018131563,0.0003334836,0.0017995362,0.00030101163,0.0006520179,0.938517,0.038507394,0.008509181,0.0053827013,0.0035003922],"study_design_scores_gemma":[0.00044119972,0.00002972828,0.0020492347,0.00037471703,0.000341473,0.0000031686889,0.00004324117,0.9366061,0.0100884335,0.04868174,0.0007604209,0.0005805514],"about_ca_topic_score_codex":0.00075813645,"about_ca_topic_score_gemma":0.00016951941,"teacher_disagreement_score":0.49430072,"about_ca_system_score_codex":0.00010886038,"about_ca_system_score_gemma":0.000038110687,"threshold_uncertainty_score":0.9998368},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22152294,0.000034412424,0.7692604,0.00015441538,0.00027044324,0.00060490856,0.000027696768,0.0005486411,0.007576106],"genre_scores_gemma":[0.9870403,0.000012362562,0.0119242035,0.0008234481,0.00009630858,0.00003955021,0.000018483968,0.000022656022,0.000022705344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989001,0.00014366527,0.000329264,0.00007972424,0.00032807104,0.00021914659],"domain_scores_gemma":[0.99923664,0.0001013323,0.00011722401,0.00025400185,0.0002016303,0.00008917071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030365505,0.00015349066,0.00016355494,0.00054872304,0.0003361255,0.000100303936,0.0002677465,0.000036529113,0.000038921004],"category_scores_gemma":[0.00003288601,0.00014579356,0.000029105893,0.0007600057,0.000020466958,0.00035694256,0.00004020027,0.0006251712,0.000016007105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002486376,0.000035968034,0.00004860638,0.0000071604054,0.00006257303,0.00001553774,0.0026489727,0.96672046,0.0037291858,0.0046468065,0.008556001,0.013280085],"study_design_scores_gemma":[0.007003956,0.0021833358,0.0055101183,0.0007694656,0.00016228431,0.0036167165,0.0076269987,0.33796257,0.35805428,0.06402195,0.20977022,0.003318108],"about_ca_topic_score_codex":0.000002971835,"about_ca_topic_score_gemma":0.000005127458,"teacher_disagreement_score":0.76551735,"about_ca_system_score_codex":0.00029144395,"about_ca_system_score_gemma":0.000057415273,"threshold_uncertainty_score":0.59452885},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07557058,0.004826001,0.9186498,0.000023599943,0.000037408125,0.00019768036,0.00026243934,0.0003998334,0.000032634573],"genre_scores_gemma":[0.9926362,0.00010315897,0.005854791,0.00011273203,0.00005598164,0.00004221322,0.0011389629,0.00003762274,0.000018316048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818623,0.0001404067,0.00038197532,0.00067119696,0.00021857284,0.00040158792],"domain_scores_gemma":[0.9987659,0.00030973446,0.00014652009,0.0005978054,0.000059044178,0.00012101295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013103436,0.00027795476,0.00052329333,0.00059209875,0.00075049215,0.0003146829,0.00042140877,0.000061091945,0.000036393092],"category_scores_gemma":[0.00003240829,0.00026977985,0.00012023237,0.0019692965,0.0001074051,0.00021842332,0.00041131317,0.00028218311,1.5905557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006767398,0.000024389628,0.00041246376,0.000047254187,0.001350103,0.000004058494,0.00021022202,0.9793264,0.00024070093,0.00009159208,0.000116594965,0.018108524],"study_design_scores_gemma":[0.00018671402,0.0000357397,0.00016082053,0.000017907596,0.0058867456,0.0000066996663,0.00044958125,0.9905753,0.00002421189,0.0017273535,0.0005984524,0.0003304458],"about_ca_topic_score_codex":0.000045486686,"about_ca_topic_score_gemma":0.000041938743,"teacher_disagreement_score":0.9170656,"about_ca_system_score_codex":0.00003379973,"about_ca_system_score_gemma":0.000020290297,"threshold_uncertainty_score":0.99997544},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016543858,0.00015351347,0.9799641,0.000049819595,0.00009067829,0.00023174238,0.0000063835414,0.0016954903,0.0012644405],"genre_scores_gemma":[0.9831486,0.000009639386,0.016437523,0.00002939383,0.00018042701,0.000040110895,0.000057871977,0.00004228154,0.000054203592],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994053,0.000010416186,0.00014977762,0.00014230482,0.000110091576,0.00018210193],"domain_scores_gemma":[0.9996931,0.00003683957,0.000039538565,0.00007618124,0.0001250801,0.000029248282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008926369,0.00011054881,0.00010689508,0.000119637945,0.00012721223,0.00006940332,0.00006946131,0.000041060124,0.0000064573187],"category_scores_gemma":[0.00001368028,0.000117172334,0.00003528112,0.00023801715,0.000022508353,0.00030423957,0.000013468719,0.00006925059,0.000018999412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119176606,0.000023387209,0.000021411228,0.00023180249,0.000040636052,0.000031359832,0.0007992512,0.07352946,0.5085687,0.0001328587,0.032333814,0.38416815],"study_design_scores_gemma":[0.00014372024,0.000031734726,0.00003604444,0.000084941195,0.000012715252,0.0000041815874,0.00004113494,0.8043221,0.19065167,0.0038071824,0.00072818086,0.00013639132],"about_ca_topic_score_codex":0.0000031359687,"about_ca_topic_score_gemma":0.0000016748453,"teacher_disagreement_score":0.9666047,"about_ca_system_score_codex":0.000037727266,"about_ca_system_score_gemma":0.000020218153,"threshold_uncertainty_score":0.4778149},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8582668,0.0000534355,0.13764346,0.000021291244,0.000538338,0.00015212019,0.0000013037272,0.0017595146,0.0015637575],"genre_scores_gemma":[0.98901725,0.000040856994,0.010688594,0.000021572601,0.00013745329,0.000007889418,0.000041216193,0.000029010038,0.000016141246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941826,0.000020355157,0.00016384578,0.00013336967,0.00011893551,0.0001452265],"domain_scores_gemma":[0.9997462,0.000021136386,0.00004108409,0.00010537566,0.000052977804,0.000033237706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007417102,0.00010395919,0.000102493985,0.00019476916,0.000073635674,0.00004496781,0.000048231013,0.00006253285,0.00000926631],"category_scores_gemma":[0.00001281509,0.00011873422,0.00003451371,0.0003631429,0.000018055876,0.00015689936,0.000018213557,0.00007477923,0.000112433554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005935235,0.000009944303,0.00021315111,0.000029358007,0.000024340614,0.000008290604,0.00038263097,0.6222546,0.04765006,0.0003236907,0.0013003343,0.32779765],"study_design_scores_gemma":[0.00010813672,0.000014343821,0.0019732718,0.00005780373,0.000013079393,0.000034444023,0.00007106583,0.97107506,0.020131808,0.0060221707,0.00036212496,0.00013670562],"about_ca_topic_score_codex":0.000025768779,"about_ca_topic_score_gemma":0.0000024914611,"teacher_disagreement_score":0.34882045,"about_ca_system_score_codex":0.000084083804,"about_ca_system_score_gemma":0.000011609474,"threshold_uncertainty_score":0.4841841},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005488033,0.004194788,0.9744072,0.0012434609,0.00091889384,0.0032100684,0.00072809303,0.007885158,0.0019243013],"genre_scores_gemma":[0.11558577,0.0007743168,0.8709883,0.0010471288,0.00058122503,0.008159553,0.00059506454,0.00066372385,0.0016048885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955153,0.00035548813,0.0010255936,0.0011621921,0.0006318743,0.0013095727],"domain_scores_gemma":[0.99609095,0.00040731998,0.000392377,0.00252636,0.00022053199,0.00036245357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011968995,0.0011373608,0.001371839,0.0010003815,0.00042933683,0.00038756456,0.0015674644,0.0010689461,0.0001495991],"category_scores_gemma":[0.0002193844,0.0013185504,0.00096142484,0.0004935609,0.000093890776,0.00017695986,0.0014113925,0.0021421297,0.0000072131415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070923206,0.0005651897,0.0008525503,0.0012310894,0.0016314555,0.00022206642,0.0010099353,0.5737568,0.057607986,0.025157966,0.1891739,0.14808182],"study_design_scores_gemma":[0.00063552544,0.00019501189,0.00077940273,0.00035087435,0.00028835222,0.000107027445,0.00011872995,0.8313279,0.03688359,0.03177017,0.095800124,0.0017432995],"about_ca_topic_score_codex":0.0053336704,"about_ca_topic_score_gemma":0.00086612644,"teacher_disagreement_score":0.2575711,"about_ca_system_score_codex":0.0012268809,"about_ca_system_score_gemma":0.00042883542,"threshold_uncertainty_score":0.9989264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8682741,0.0042298636,0.11461157,0.0009869575,0.0013412327,0.0020440689,0.0009158531,0.0013130486,0.0062833247],"genre_scores_gemma":[0.9957799,0.0007164753,0.0028616434,0.00013945697,0.00003410461,0.00034859104,0.00007825925,0.00002723079,0.000014355676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982913,0.00023276376,0.00044048237,0.00036932674,0.00021256493,0.00045354155],"domain_scores_gemma":[0.99819964,0.00021524844,0.00014450384,0.0012342365,0.000108196255,0.000098170065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029712004,0.00027349265,0.00036376997,0.00013546043,0.0007440151,0.00019307464,0.0014765318,0.00009037264,0.00010460252],"category_scores_gemma":[0.000070114336,0.00034900193,0.000093454226,0.00064556085,0.000107379754,0.0002507704,0.0016138203,0.0007139638,0.0000019355748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038162048,0.00088112644,0.03827586,0.0003812078,0.0007537252,0.00010274979,0.0037477808,0.55105144,0.023016822,0.021199461,0.021815814,0.3383924],"study_design_scores_gemma":[0.0007241771,0.00010799117,0.009444493,0.0001223946,0.00004444763,0.000034353063,0.0010116148,0.97548926,0.0017314956,0.0051500266,0.005432274,0.00070744555],"about_ca_topic_score_codex":0.0005216994,"about_ca_topic_score_gemma":0.0010824052,"teacher_disagreement_score":0.42443785,"about_ca_system_score_codex":0.0004988297,"about_ca_system_score_gemma":0.00007281642,"threshold_uncertainty_score":0.99989617},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020768825,0.000064829546,0.9659263,0.00007056133,0.00079052465,0.00052930886,0.00010986019,0.0036838932,0.008055899],"genre_scores_gemma":[0.969847,0.0002901037,0.023935238,0.00015487295,0.00042004144,0.00009087137,0.0011111674,0.00015157889,0.0039990805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909693,0.000017836657,0.00024326854,0.00032524514,0.00014087291,0.00017586691],"domain_scores_gemma":[0.9992437,0.0001552373,0.000057284884,0.00043951446,0.000068063906,0.000036247446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007927846,0.00022971774,0.0003460883,0.0005064602,0.000030744315,0.000076919554,0.00016376766,0.0002935457,0.00011395357],"category_scores_gemma":[0.000022313925,0.00023237246,0.00042487247,0.00029792963,0.000009017372,0.000029858427,0.00009726205,0.00020383198,0.000017457183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021663245,0.0000074960726,0.00003977109,0.000037405385,0.0010874468,0.00000350518,0.00001982155,0.95813054,0.00022120189,0.0003087627,0.038227707,0.0018946878],"study_design_scores_gemma":[0.00010441646,0.00003874759,0.00088993856,0.00011003869,0.000662205,2.0000586e-7,0.000009653244,0.9768319,0.010728915,0.008465546,0.0017708839,0.00038753563],"about_ca_topic_score_codex":0.000077763696,"about_ca_topic_score_gemma":0.000059735456,"teacher_disagreement_score":0.9490782,"about_ca_system_score_codex":0.000076267024,"about_ca_system_score_gemma":0.000016804875,"threshold_uncertainty_score":0.9475874},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015621784,0.000109753484,0.97921383,0.000056234116,0.00012331054,0.00013309545,0.0000019275765,0.0028618327,0.0018782179],"genre_scores_gemma":[0.9081444,0.000006093282,0.09146854,0.00004478389,0.00020054045,0.0000038605917,0.00003261971,0.000056039375,0.00004310696],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897283,0.000052520834,0.00024393902,0.0002219433,0.00023150913,0.00027727516],"domain_scores_gemma":[0.9995667,0.00007655826,0.00006339455,0.00013133239,0.00010992624,0.000052095118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017577728,0.00016134011,0.00019110131,0.00019910275,0.00016272478,0.00012846357,0.00008215544,0.00010882282,0.000019838431],"category_scores_gemma":[0.000014678802,0.0001906799,0.000044738306,0.00057941535,0.000018866056,0.00026940057,0.0000372226,0.00016111298,0.000035070596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010209719,0.00001043144,0.000009133942,0.000079399695,0.000027572927,0.00001015611,0.0006150536,0.2467641,0.47959083,0.000031465053,0.00048515294,0.27236652],"study_design_scores_gemma":[0.00012965787,0.0000128334195,0.00050667336,0.000157083,0.00002648359,0.000011261599,0.000031803873,0.87017953,0.12606874,0.002542497,0.00012882652,0.00020461075],"about_ca_topic_score_codex":0.000016795697,"about_ca_topic_score_gemma":0.0000013316555,"teacher_disagreement_score":0.89252263,"about_ca_system_score_codex":0.000046814956,"about_ca_system_score_gemma":0.000021244145,"threshold_uncertainty_score":0.77757007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015818542,0.00033318787,0.94325304,0.000325215,0.0031767632,0.001317432,0.000056666046,0.0153851565,0.020334007],"genre_scores_gemma":[0.9360223,0.00038383118,0.051746413,0.00015341376,0.0005099687,0.00016298397,0.0006416805,0.00041435863,0.0099650845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985026,0.00004068946,0.00039933133,0.00046467502,0.00021030937,0.00038240114],"domain_scores_gemma":[0.9988033,0.00020637413,0.000107569576,0.0006620116,0.00011589342,0.00010480925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020934852,0.00040304536,0.00044669127,0.00030023803,0.000097906785,0.00011493382,0.0005316529,0.0006094437,0.00012489808],"category_scores_gemma":[0.00011635697,0.00043150684,0.00027671648,0.00014634372,0.00003079452,0.00007707644,0.0006154281,0.0009923552,0.00008971377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039131457,0.000012644632,0.00014311785,0.00014915338,0.00022826181,0.000042984902,0.000072017625,0.5059319,0.0013197014,0.00009919231,0.48780468,0.0041572195],"study_design_scores_gemma":[0.00034293567,0.00009739048,0.00008945163,0.00071311335,0.0000839982,0.000004760319,0.000060069047,0.954022,0.007774035,0.02679748,0.009285128,0.0007296275],"about_ca_topic_score_codex":0.00016659299,"about_ca_topic_score_gemma":0.000048409936,"teacher_disagreement_score":0.92020375,"about_ca_system_score_codex":0.00011806094,"about_ca_system_score_gemma":0.00006633592,"threshold_uncertainty_score":0.9998137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015818542,0.00033318787,0.94325304,0.000325215,0.0031767632,0.001317432,0.000056666046,0.0153851565,0.020334007],"genre_scores_gemma":[0.9360223,0.00038383118,0.051746413,0.00015341376,0.0005099687,0.00016298397,0.0006416805,0.00041435863,0.0099650845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985026,0.00004068946,0.00039933133,0.00046467502,0.00021030937,0.00038240114],"domain_scores_gemma":[0.9988033,0.00020637413,0.000107569576,0.0006620116,0.00011589342,0.00010480925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020934852,0.00040304536,0.00044669127,0.00030023803,0.000097906785,0.00011493382,0.0005316529,0.0006094437,0.00012489808],"category_scores_gemma":[0.00011635697,0.00043150684,0.00027671648,0.00014634372,0.00003079452,0.00007707644,0.0006154281,0.0009923552,0.00008971377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039131457,0.000012644632,0.00014311785,0.00014915338,0.00022826181,0.000042984902,0.000072017625,0.5059319,0.0013197014,0.00009919231,0.48780468,0.0041572195],"study_design_scores_gemma":[0.00034293567,0.00009739048,0.00008945163,0.00071311335,0.0000839982,0.000004760319,0.000060069047,0.954022,0.007774035,0.02679748,0.009285128,0.0007296275],"about_ca_topic_score_codex":0.00016659299,"about_ca_topic_score_gemma":0.000048409936,"teacher_disagreement_score":0.92020375,"about_ca_system_score_codex":0.00011806094,"about_ca_system_score_gemma":0.00006633592,"threshold_uncertainty_score":0.9998137},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072535135,0.00002279602,0.92329615,0.000093741524,0.000378802,0.00017490501,0.000004644931,0.0026008654,0.0008929528],"genre_scores_gemma":[0.7715053,0.000008843635,0.22807169,0.000030884494,0.00004336558,0.0000064284604,0.00007460383,0.00003267446,0.00022618023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994624,0.000008387822,0.00017441806,0.00008568222,0.0001419556,0.00012714755],"domain_scores_gemma":[0.9996281,0.000055601384,0.0000350309,0.00019554739,0.000059454,0.000026259937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009435567,0.000098936995,0.00012590268,0.000075404096,0.000046730278,0.000024865576,0.000066133165,0.000066018976,0.000034689863],"category_scores_gemma":[0.000052679836,0.00010040255,0.000020781172,0.00030272384,0.000025839961,0.000060805898,0.000020750667,0.00006290908,0.0001961047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055963146,0.000046354646,0.000008246104,0.00017466603,0.0000752256,0.000033072436,0.0004061103,0.7882186,0.11118627,0.06597888,0.022892911,0.010974022],"study_design_scores_gemma":[0.00008238753,0.000011382945,0.000048256894,0.00007385769,0.000011833595,0.000012777232,0.0000056568415,0.8913718,0.02976394,0.078408584,0.00010575609,0.000103785125],"about_ca_topic_score_codex":0.000001832863,"about_ca_topic_score_gemma":4.8537635e-7,"teacher_disagreement_score":0.6989702,"about_ca_system_score_codex":0.00002143596,"about_ca_system_score_gemma":0.000009192633,"threshold_uncertainty_score":0.4094297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5552812,0.0005456179,0.43945184,0.0005259235,0.00018689458,0.00078849785,0.000020190972,0.00034191288,0.0028579151],"genre_scores_gemma":[0.9957037,0.0005772059,0.0035659496,0.000040009993,0.000038020265,0.0000034246286,0.000004368109,0.000024547448,0.000042769694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994354,0.000046161887,0.00028605643,0.00007174733,0.00008799956,0.00007259997],"domain_scores_gemma":[0.9994278,0.00013926026,0.00014586396,0.00012861635,0.00012729889,0.000031157346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019006066,0.0000798866,0.00013141065,0.000110450674,0.00009607035,0.000029309445,0.00011546239,0.00007058938,0.000018387096],"category_scores_gemma":[0.00004914126,0.00006660129,0.000026882499,0.00049859646,0.0000704102,0.00013779943,0.000034820783,0.00010783166,6.649888e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022961476,0.000019435338,0.00018111872,0.00002557966,0.00001565433,0.0000014750957,0.00037743917,0.9729508,0.0018926088,0.019021394,0.000063845866,0.0054276823],"study_design_scores_gemma":[0.000484074,0.00004406406,0.0015369266,0.00020348316,0.00006114969,0.00007593625,0.000921796,0.980177,0.002792736,0.009912612,0.003585992,0.00020423435],"about_ca_topic_score_codex":0.0000016019127,"about_ca_topic_score_gemma":0.0000014821663,"teacher_disagreement_score":0.4404225,"about_ca_system_score_codex":0.000016398133,"about_ca_system_score_gemma":0.000012956486,"threshold_uncertainty_score":0.2715922},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15837549,0.0000040064306,0.84055305,0.000016031381,0.00014446207,0.00018601412,0.0000012398069,0.0005084553,0.00021125103],"genre_scores_gemma":[0.894062,0.0000514022,0.10569058,0.00006159069,0.000019699104,4.5681085e-7,0.000004634915,0.000022844604,0.00008678891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988527,0.00007232426,0.00020470798,0.0003024993,0.00027988252,0.0002878776],"domain_scores_gemma":[0.99950916,0.00008362166,0.00004466101,0.0002411005,0.000042603657,0.000078874466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031877268,0.00017593667,0.00016639358,0.00034697633,0.00028946204,0.000045938203,0.000067217625,0.000076191915,0.0000036642043],"category_scores_gemma":[0.0000024547583,0.00017108326,0.00004986505,0.00042396993,0.00009012705,0.00011992982,0.0000016905525,0.00020439496,0.0000053311087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034545992,0.00001262531,8.053613e-8,0.000014111125,0.000006920691,0.000005697426,0.0003417282,0.8977044,0.036514718,9.665818e-7,0.000013583604,0.06535058],"study_design_scores_gemma":[0.00018183011,0.00029398178,0.000014168328,0.00012101937,0.000015796695,0.0000114531185,0.00028530238,0.82492477,0.17394125,0.000010324743,0.000046547117,0.00015356544],"about_ca_topic_score_codex":0.00019793388,"about_ca_topic_score_gemma":0.0000017290148,"teacher_disagreement_score":0.7356865,"about_ca_system_score_codex":0.000049632876,"about_ca_system_score_gemma":0.000020853791,"threshold_uncertainty_score":0.6976573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5255532,0.002237958,0.434192,0.0003522987,0.0029360366,0.0006126324,0.000019845536,0.006567295,0.027528703],"genre_scores_gemma":[0.97591734,0.000015727912,0.02342259,0.00025631094,0.00004469029,0.00002896654,0.000007762376,0.000027454174,0.000279183],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993017,0.000042532898,0.0001234801,0.00014812444,0.0001665959,0.0002175865],"domain_scores_gemma":[0.99967,0.00002900382,0.0000134663,0.00022684339,0.000017035212,0.000043639484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101007885,0.00011796572,0.00012405131,0.00007632409,0.000101290214,0.000020915484,0.00016235831,0.00001147495,0.0002348919],"category_scores_gemma":[0.0000053751924,0.00011400968,0.000073713425,0.00011327587,0.000009323052,0.00003627656,0.00011328191,0.00023845049,0.000011931752],"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.00008558732,0.00028828374,0.00019689754,0.00007551222,0.00037254652,0.0006630002,0.0008732895,0.1424371,0.25070712,0.018885542,0.42104372,0.1643714],"study_design_scores_gemma":[0.00029682112,0.00006721839,0.00027144083,0.000019105464,0.000023122115,0.00021088868,0.000105308754,0.5008291,0.4201522,0.0029767181,0.07460895,0.00043915692],"about_ca_topic_score_codex":0.000037210164,"about_ca_topic_score_gemma":0.0000035276794,"teacher_disagreement_score":0.45036408,"about_ca_system_score_codex":0.00010212433,"about_ca_system_score_gemma":0.000006436218,"threshold_uncertainty_score":0.464918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052956544,0.00005853111,0.9944642,0.00029015745,0.00025619435,0.00034691996,0.000022317427,0.003267363,0.0007647413],"genre_scores_gemma":[0.7751656,0.001119085,0.22263156,0.00004984554,0.000033951477,0.0005739078,0.00008908768,0.00007722972,0.00025972383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999157,0.00011349727,0.00023535278,0.00017154565,0.00010631262,0.00021630921],"domain_scores_gemma":[0.9985017,0.00047746688,0.000041520805,0.0007957128,0.00013082699,0.000052743864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018684503,0.0001593934,0.00016787797,0.00029994213,0.0006463137,0.000054205695,0.00036403406,0.00011838894,0.00001904771],"category_scores_gemma":[0.00000819545,0.00018445704,0.00011856413,0.0007661334,0.00005058674,0.00012396886,0.0000043296463,0.0003764604,0.00002395742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008174341,0.000032343414,0.0000011234758,0.0000098456385,0.000050187606,2.3709218e-7,0.00024795902,0.9343477,0.00079965644,0.00016807322,0.00031339147,0.064021304],"study_design_scores_gemma":[0.00019493727,0.000053043335,0.0000063527186,0.000047550628,0.000041891468,0.000006196407,0.00022578432,0.9921445,0.004125512,0.00014409403,0.0028206946,0.00018944219],"about_ca_topic_score_codex":0.000052738338,"about_ca_topic_score_gemma":0.00014235679,"teacher_disagreement_score":0.77463603,"about_ca_system_score_codex":0.00009341938,"about_ca_system_score_gemma":0.00001413084,"threshold_uncertainty_score":0.7521939},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084333524,0.0008582624,0.90881896,0.00016154627,0.00017285164,0.0004673585,0.00003199433,0.0019077315,0.0032477388],"genre_scores_gemma":[0.95528895,0.000094478826,0.043933425,0.0001908518,0.00023363608,0.000018903695,0.0000668785,0.000067598136,0.000105268926],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990056,0.00003625746,0.00024275492,0.00027308727,0.00012505738,0.00031721545],"domain_scores_gemma":[0.9993162,0.00020990346,0.00007020835,0.0001147208,0.00022650637,0.00006244129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019098537,0.0002158958,0.00024620703,0.00018212959,0.0002788402,0.00039434005,0.00007465854,0.00007712512,0.0000081962935],"category_scores_gemma":[0.000049385897,0.00021757076,0.00006051976,0.00024236905,0.00008406909,0.00056414126,0.000048306796,0.00015066155,0.000014060519],"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.000045048593,0.000009878799,0.000013565783,0.00027440858,0.000045379,0.000061185674,0.0012053523,0.0009867084,0.75141436,0.000034098033,0.014761576,0.2311484],"study_design_scores_gemma":[0.00037235406,0.000063496416,0.00013677093,0.00054194743,0.00004498714,0.000036152793,0.0004437222,0.6117161,0.37732637,0.007362782,0.0015661294,0.00038916164],"about_ca_topic_score_codex":0.000009249058,"about_ca_topic_score_gemma":0.0000024559836,"teacher_disagreement_score":0.8709554,"about_ca_system_score_codex":0.000032044813,"about_ca_system_score_gemma":0.000020521677,"threshold_uncertainty_score":0.8872278},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07040574,0.00008541603,0.9241542,0.00002752063,0.0019952278,0.00068203564,0.00027397127,0.0018805562,0.00049531524],"genre_scores_gemma":[0.99125576,0.000029587252,0.007645206,0.00004033771,0.0002154435,0.00027665857,0.00013455644,0.00006966093,0.00033279211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991475,0.00001726622,0.000227084,0.00019475813,0.00012788585,0.000285505],"domain_scores_gemma":[0.99931484,0.00016832247,0.00006065694,0.00024197075,0.00016002743,0.00005420042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009063338,0.00016786865,0.00020631688,0.00016318812,0.00008206457,0.00017073804,0.00023286487,0.0000926008,0.000014500141],"category_scores_gemma":[0.000054338114,0.00017267429,0.000035394325,0.00025716095,0.00001842022,0.0002571424,0.000031301377,0.00009100092,0.000051476974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020051793,0.000019951773,0.0000530744,0.00043478532,0.0001156106,0.000039642473,0.00037088557,0.7495569,0.009931652,0.00084115687,0.23244521,0.006171097],"study_design_scores_gemma":[0.00027534517,0.000021265661,0.00034453365,0.00009827746,0.000019090445,0.0000026809778,0.000032260974,0.95944124,0.035399865,0.0026766257,0.0014665363,0.00022228666],"about_ca_topic_score_codex":0.00005102806,"about_ca_topic_score_gemma":0.00003178049,"teacher_disagreement_score":0.92085004,"about_ca_system_score_codex":0.000042809726,"about_ca_system_score_gemma":0.000015713016,"threshold_uncertainty_score":0.7041454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9446038,0.00086014596,0.03774897,0.00805826,0.00050099863,0.00045853335,0.000024687384,0.0050235884,0.0027210193],"genre_scores_gemma":[0.99245197,0.000813221,0.0057022586,0.0006217998,0.000030606196,0.0000669104,0.00020101608,0.0000658367,0.00004640178],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989618,0.00014366314,0.0002839601,0.0001591115,0.00017300557,0.0002784565],"domain_scores_gemma":[0.99668324,0.00021778775,0.00006775048,0.0028805777,0.00008839587,0.00006227079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017272873,0.00019349469,0.00019460729,0.00024754961,0.0003062155,0.0000554758,0.0012523426,0.00008176139,0.000013849902],"category_scores_gemma":[0.0000129857135,0.00021353105,0.000071099006,0.0008145541,0.00018792725,0.00005446034,0.0002442362,0.00038984724,0.00047169707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011733342,0.00008613732,0.00018950367,0.000026714817,0.00014427569,0.000007002003,0.0012844214,0.3136713,0.58203316,0.0010823305,0.08735092,0.014112499],"study_design_scores_gemma":[0.00021323409,0.000010746303,0.0006418603,0.00011934123,0.000031917192,0.000009093448,0.000063495725,0.9570534,0.018409025,0.0002048625,0.022841878,0.00040112127],"about_ca_topic_score_codex":0.000083896506,"about_ca_topic_score_gemma":0.00006112173,"teacher_disagreement_score":0.64338213,"about_ca_system_score_codex":0.00009913934,"about_ca_system_score_gemma":0.000010353258,"threshold_uncertainty_score":0.87075436},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341354,0.0001268445,0.99363035,0.00013354783,0.00010950215,0.00024348308,0.0029458054,0.00021096165,0.00025817877],"genre_scores_gemma":[0.8635741,0.0012837797,0.13370003,0.00019671122,0.00012271981,0.000027567765,0.0009928545,0.000036934158,0.000065314445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994963,0.000017051829,0.00014515186,0.000102161815,0.000107510044,0.00013182916],"domain_scores_gemma":[0.9990942,0.00023444518,0.000048646267,0.0003287116,0.0002760066,0.000017975975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014280388,0.00008837911,0.00014186923,0.000020979845,0.000047059653,0.000022567068,0.00026786583,0.00002259592,0.000012808452],"category_scores_gemma":[0.00012889548,0.00006191157,0.000013283342,0.00016478325,0.00006686349,0.00008290869,0.000050209397,0.000035683453,0.000004207527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003140174,0.000016475104,0.000094877294,0.00009019482,0.00021420277,0.000009116247,0.00042733114,0.61161673,0.00023777406,0.0074360888,0.3748192,0.004724008],"study_design_scores_gemma":[0.0003212192,0.00006807104,0.00016959145,0.00006700199,0.000026731535,0.0000014344276,0.00006809087,0.9896573,0.0043738117,0.0039111124,0.0012420914,0.000093534814],"about_ca_topic_score_codex":0.000014100822,"about_ca_topic_score_gemma":0.000010009605,"teacher_disagreement_score":0.86123276,"about_ca_system_score_codex":0.0000037907535,"about_ca_system_score_gemma":0.000015556087,"threshold_uncertainty_score":0.25246805},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19756028,0.000006547855,0.80080485,0.00003499459,0.00031292837,0.00064443937,0.000017396294,0.00055166864,0.00006686729],"genre_scores_gemma":[0.9955022,0.000020800957,0.0040677767,0.000025876667,0.00003335281,0.00023994407,0.000045949564,0.00003224516,0.00003189553],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907434,0.00003025931,0.00021913846,0.00020596533,0.0003122014,0.0001580737],"domain_scores_gemma":[0.9996135,0.000018343664,0.0000520167,0.00012646822,0.00014174245,0.000047895122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012441164,0.00016353173,0.000121754994,0.0002484701,0.00021521251,0.000072519266,0.00003390436,0.000069300535,0.000014543682],"category_scores_gemma":[0.0000037442867,0.00016448196,0.000034807923,0.0002903756,0.000025734258,0.00016405164,5.247251e-7,0.00007137318,0.0000038775565],"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.00014741332,0.00003465036,0.000004287136,0.00009564258,0.00005629009,5.119165e-7,0.00034022718,0.14394537,0.7479741,0.00009726928,0.000046201898,0.10725805],"study_design_scores_gemma":[0.0011822506,0.0003467303,0.0048141405,0.00008145298,0.00009750042,0.0000062169656,0.00012764495,0.53654975,0.45615703,0.0003838968,0.00003968446,0.00021369383],"about_ca_topic_score_codex":0.00001692736,"about_ca_topic_score_gemma":0.00007259132,"teacher_disagreement_score":0.79794186,"about_ca_system_score_codex":0.00015271625,"about_ca_system_score_gemma":0.000015657753,"threshold_uncertainty_score":0.670738},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012928947,0.00024856813,0.9622439,0.00028416593,0.0002382104,0.00030964543,0.00004997321,0.00028590398,0.036210347],"genre_scores_gemma":[0.31379887,0.0027951337,0.6783249,0.0006782687,0.00006374871,0.00011891104,0.0010035611,0.0000763442,0.0031402768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907124,0.000024624534,0.00042489107,0.00010399979,0.00027028585,0.000104969906],"domain_scores_gemma":[0.99835014,0.00033291444,0.00016065358,0.0009278921,0.00019543344,0.000032936958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383087,0.00014147586,0.00015969157,0.00040142555,0.00025385825,0.00006797686,0.00060793606,0.00009234302,0.0000046720647],"category_scores_gemma":[0.000028383392,0.00011111883,0.00003617309,0.0002526666,0.00042982923,0.0007805727,0.00033918826,0.00028067306,0.000018156263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005588801,0.000016129434,0.000013347224,0.00005033274,0.000018308761,1.7037e-7,0.000947091,0.33656737,0.00023230935,0.047185753,0.0131151,0.6018485],"study_design_scores_gemma":[0.00009369886,0.000013757779,0.00016602494,0.00030142002,0.000007769093,0.0000032988112,0.00001584113,0.97897476,0.0004298216,0.001176574,0.01870155,0.000115495386],"about_ca_topic_score_codex":0.00001217833,"about_ca_topic_score_gemma":0.000003440856,"teacher_disagreement_score":0.64240736,"about_ca_system_score_codex":0.000054176522,"about_ca_system_score_gemma":0.00006110746,"threshold_uncertainty_score":0.45312944},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055675823,0.000059054502,0.9403677,0.00018894312,0.00038071992,0.00026943226,0.00010296573,0.0011433061,0.0018120809],"genre_scores_gemma":[0.96554583,0.0000014865675,0.032790907,0.00011466025,0.000045038953,0.000030514257,0.0012977534,0.000016400732,0.00015741891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962276,0.000011120491,0.0000809011,0.00011825346,0.000089471956,0.000077464945],"domain_scores_gemma":[0.99964184,0.000021070997,0.0000113389815,0.0002929789,0.000018649213,0.000014110078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006624835,0.000051349456,0.00005555907,0.000041550105,0.00011117078,0.000012520101,0.00014607629,0.000016327402,0.000065921355],"category_scores_gemma":[0.0000034831653,0.000056161076,0.00001184824,0.000058055906,0.0000047412273,0.000076824486,0.00012078881,0.00004504537,0.0000013891339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003224373,0.00003726307,0.000005070796,0.00000775654,0.00003843088,0.0000026684575,0.000018035898,0.7024658,0.09294562,0.044275206,0.15258667,0.007585238],"study_design_scores_gemma":[0.00015320574,0.000024993233,0.000049637838,0.0000027906722,0.000009433035,0.000005989558,0.0000039955075,0.95221615,0.032746885,0.01179591,0.0029038358,0.00008718511],"about_ca_topic_score_codex":0.000010922953,"about_ca_topic_score_gemma":0.0000016413381,"teacher_disagreement_score":0.90986997,"about_ca_system_score_codex":0.000027513694,"about_ca_system_score_gemma":0.0000054498637,"threshold_uncertainty_score":0.22901823},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007245066,0.000044980083,0.9807245,0.00023572642,0.00022146422,0.00035482724,0.0000013962313,0.0042080367,0.0069639934],"genre_scores_gemma":[0.47910666,0.00004790707,0.51717997,0.0002728217,0.00014205629,0.00018138708,0.000032493954,0.00010136586,0.0029352948],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994407,0.000013412897,0.00010607855,0.00013899698,0.00007251023,0.00022825932],"domain_scores_gemma":[0.9996742,0.00006826432,0.000011011328,0.00018055327,0.00003167284,0.000034321045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013952244,0.00009668017,0.00012985963,0.00008625452,0.000040664832,0.00002225912,0.00008895629,0.000058756912,0.00002090465],"category_scores_gemma":[0.00002280768,0.00008930052,0.00006676793,0.00016409167,0.000013841033,0.000036864403,0.000024035096,0.000061897146,0.000031820717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009250468,0.00004900981,0.00013485267,0.00018985035,0.00040519985,0.00005261654,0.0011216538,0.06739963,0.37355748,0.06781854,0.33390576,0.1552729],"study_design_scores_gemma":[0.00016127838,0.000034314107,0.00008598445,0.000009849953,0.000011206713,0.000003663887,0.000062399275,0.76136714,0.21056467,0.0047173654,0.022853654,0.00012846488],"about_ca_topic_score_codex":0.000009231346,"about_ca_topic_score_gemma":0.000005010181,"teacher_disagreement_score":0.6939675,"about_ca_system_score_codex":0.000019368861,"about_ca_system_score_gemma":0.000004442287,"threshold_uncertainty_score":0.36415696},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14928658,0.00003942726,0.84540164,0.000026955378,0.0009218924,0.00054152514,0.00026549477,0.0031924797,0.00032400378],"genre_scores_gemma":[0.9954727,0.0001354642,0.0033706017,0.000016429512,0.00027361186,0.000006709735,0.0003559458,0.00009729656,0.00027123385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857074,0.00006306255,0.00019513234,0.0006850146,0.00006919478,0.00041684264],"domain_scores_gemma":[0.99867874,0.00007465515,0.00010143059,0.00072516827,0.00028071922,0.0001392782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013299969,0.00036964213,0.00034652482,0.0003012682,0.00023074985,0.00005889837,0.00041918625,0.00040703113,0.000012940104],"category_scores_gemma":[0.000017009226,0.00047065687,0.00024013674,0.0003541843,0.00012295914,0.00020807554,0.00024646596,0.0005468972,0.00004927189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012863184,0.00006204542,0.00019841596,0.000054632663,0.00020572802,0.000056853885,0.000049989907,0.9924246,0.00020095802,0.004340134,0.0020260175,0.00025199764],"study_design_scores_gemma":[0.0003189708,0.00016019147,0.0007889804,0.00014663872,0.00022083262,0.0000020741784,0.00017165247,0.9789058,0.0005754131,0.017894754,0.0003141596,0.0005005151],"about_ca_topic_score_codex":0.00030976432,"about_ca_topic_score_gemma":0.0003939537,"teacher_disagreement_score":0.8461861,"about_ca_system_score_codex":0.0002256859,"about_ca_system_score_gemma":0.00006902559,"threshold_uncertainty_score":0.9997745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95758,0.000019159088,0.039548576,0.000028465402,0.0020988847,0.00021197641,0.0000036979645,0.00019776195,0.00031148622],"genre_scores_gemma":[0.9970098,0.0000018307468,0.0025349048,0.000014837496,0.0003145883,0.0000011251796,0.0000029549303,0.000021461625,0.00009848826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891317,0.000035049998,0.00038334023,0.0001500219,0.00031726455,0.0002011451],"domain_scores_gemma":[0.9990999,0.00030588845,0.00017943923,0.00013107732,0.00023456637,0.00004912588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079655356,0.00011034348,0.00019294825,0.0004605906,0.00019647204,0.00019131944,0.00017776243,0.000035073957,0.000007761142],"category_scores_gemma":[0.00008907493,0.00010047836,0.00010964658,0.0005901701,0.000029467292,0.00014234238,0.000040625415,0.00014935985,0.000008637715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009772697,0.00022263771,0.0012436247,0.000031154843,0.00022160907,0.00009591843,0.0043632565,0.7872152,0.03522405,0.00007689335,0.111197285,0.06001066],"study_design_scores_gemma":[0.0012434166,0.00095430453,0.014621859,0.0005646533,0.0000679486,0.00003095292,0.0022494397,0.9318989,0.043454487,0.0018497563,0.002697233,0.00036707896],"about_ca_topic_score_codex":7.6531006e-7,"about_ca_topic_score_gemma":0.0000011541624,"teacher_disagreement_score":0.14468369,"about_ca_system_score_codex":0.00006789671,"about_ca_system_score_gemma":0.000028106317,"threshold_uncertainty_score":0.40973887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944296,0.00057503354,0.00021662713,0.000023735303,0.0025098945,0.00031377477,0.00010204398,0.001027889,0.00080140703],"genre_scores_gemma":[0.9990882,0.0000917857,0.0000051850734,0.00006855755,0.0005482132,0.00001100541,0.000058474576,0.000054803888,0.000073746516],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99861425,0.00024224912,0.00034493973,0.0002414001,0.00022784446,0.00032928912],"domain_scores_gemma":[0.99909556,0.00033468907,0.00008248013,0.00037004164,0.000062620726,0.000054628395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006174159,0.00024984212,0.00039745902,0.00010070159,0.00022675985,0.00062540284,0.00017931605,0.000083338375,0.00001105811],"category_scores_gemma":[0.000024285906,0.00017569146,0.00002908902,0.00024019499,0.00007057541,0.00010171272,0.00006140453,0.00008846713,0.00003858597],"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.00008015478,0.000049071023,0.029856602,0.0016215834,0.0008939203,0.00029084284,0.005286458,0.035544474,0.8237702,0.0032377592,0.0868105,0.012558389],"study_design_scores_gemma":[0.0013030375,0.0001639845,0.6645495,0.001991516,0.00014059391,0.000114567316,0.001421371,0.06640513,0.22589658,0.00044508418,0.035651162,0.0019174448],"about_ca_topic_score_codex":0.0006176725,"about_ca_topic_score_gemma":0.00011657538,"teacher_disagreement_score":0.6346929,"about_ca_system_score_codex":0.000019775967,"about_ca_system_score_gemma":0.000006163717,"threshold_uncertainty_score":0.71644896},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045855768,0.00026748521,0.94851,0.000020367708,0.000032770706,0.00024693,0.00001820222,0.003471937,0.0015765267],"genre_scores_gemma":[0.8904623,0.00028816267,0.108825475,0.00000601985,0.000028250848,0.000016296792,0.000035918143,0.000050622897,0.00028699453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994802,0.00001076921,0.00017579866,0.000085414016,0.00010636573,0.00014148706],"domain_scores_gemma":[0.9997962,0.000045285436,0.000034077006,0.00007444885,0.000025460735,0.000024507988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010216824,0.00010843781,0.00013599276,0.00015449002,0.000034171575,0.00004553288,0.00005660391,0.00006152246,0.000013985342],"category_scores_gemma":[0.00002390553,0.00010576598,0.000009555608,0.00022431421,0.000019614477,0.000055666882,0.000030764935,0.00013880081,0.000011196739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025507923,0.0004066167,0.03163532,0.006057908,0.00014532394,0.00041743074,0.023398487,0.029060138,0.1681352,0.03651627,0.036273353,0.66792846],"study_design_scores_gemma":[0.00006908924,0.000029236391,0.00028790787,0.00016637713,0.000008326112,0.000007821565,0.00007560566,0.96121615,0.018595142,0.01654515,0.0028270644,0.00017211167],"about_ca_topic_score_codex":0.0000063129987,"about_ca_topic_score_gemma":0.000007403495,"teacher_disagreement_score":0.932156,"about_ca_system_score_codex":0.000020073343,"about_ca_system_score_gemma":0.0000057874495,"threshold_uncertainty_score":0.43130118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11607291,0.00034870417,0.8816104,0.0000417041,0.00028323877,0.0005483546,0.00001496791,0.0010058004,0.000073918854],"genre_scores_gemma":[0.9666438,0.0005342116,0.032321766,0.0000040195437,0.0002775187,0.000021250793,0.00006602748,0.0000991576,0.000032251428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978303,0.00006307207,0.0008509195,0.00052036304,0.0003063274,0.00042906415],"domain_scores_gemma":[0.9984513,0.00043665458,0.00023841059,0.00050968153,0.00024653468,0.00011741593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036561114,0.00034909134,0.00043259354,0.0006109779,0.00025874857,0.00014427182,0.00022272683,0.00021671045,0.000015619114],"category_scores_gemma":[0.0002375085,0.00046183637,0.00009946187,0.0016934462,0.00010234901,0.00021040857,0.00013704596,0.0004361738,0.000051351115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007929421,0.000014257559,0.000061772575,0.00011093938,0.000048975213,0.0000030278823,0.0006686794,0.70438564,0.2524036,0.0019835297,0.000017262724,0.04029439],"study_design_scores_gemma":[0.000024907578,0.000014687763,0.00008345202,0.00028450837,0.00006233905,0.000006626539,0.00043978216,0.7261481,0.2712048,0.001102371,0.0003427192,0.00028566326],"about_ca_topic_score_codex":0.0003859376,"about_ca_topic_score_gemma":0.0000070760993,"teacher_disagreement_score":0.8505709,"about_ca_system_score_codex":0.000086973756,"about_ca_system_score_gemma":0.0000309561,"threshold_uncertainty_score":0.99978334},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69312483,0.00040329067,0.30505967,0.000045469387,0.0000617501,0.00030181225,0.000017469807,0.0005249762,0.0004607496],"genre_scores_gemma":[0.97679317,0.0011704632,0.021768726,0.000015236249,0.00003555781,0.000021866927,0.000165566,0.000023273871,0.000006141118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992111,0.000017538685,0.0003040433,0.000143443,0.00016267397,0.00016122186],"domain_scores_gemma":[0.99970174,0.000060646948,0.000059972765,0.000075234806,0.00006194755,0.00004045081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000132287,0.00013229928,0.00016331996,0.00036403883,0.00004724288,0.000027353999,0.00006333814,0.000051704614,0.00004477304],"category_scores_gemma":[0.0000034349093,0.00013876932,0.000047251877,0.00054392044,0.00002411824,0.0003018702,0.000009835354,0.00005880737,0.0000037449454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012572437,0.00007123421,0.0010616938,0.00018941645,0.00008883699,0.000008958361,0.00039894198,0.43242493,0.28372884,0.00041553075,0.00013850039,0.28134736],"study_design_scores_gemma":[0.0008163314,0.00017203193,0.03778258,0.000095105264,0.00005737874,0.0000053673243,0.00004674517,0.8348705,0.124879956,0.0006044,0.0004011813,0.00026839288],"about_ca_topic_score_codex":0.000004553647,"about_ca_topic_score_gemma":0.0000018634016,"teacher_disagreement_score":0.40244558,"about_ca_system_score_codex":0.000030775707,"about_ca_system_score_gemma":0.000005762269,"threshold_uncertainty_score":0.5658849},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9566459,0.000044885073,0.040574457,0.0003570521,0.00040424484,0.000078523684,0.0000024192582,0.00015274827,0.0017397555],"genre_scores_gemma":[0.9993083,0.00011615868,0.00045044912,0.0000792407,0.000028295604,8.155868e-7,0.00000139375,0.000002384557,0.000012983885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995925,0.000013254245,0.00021067714,0.000014493542,0.000105374085,0.00006372725],"domain_scores_gemma":[0.9997163,0.00001883621,0.000081980295,0.000061653605,0.00010072226,0.00002054322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013305452,0.000046939564,0.000063390464,0.00009227758,0.000051925756,0.00006095354,0.00007396863,0.000028791055,0.0000049594514],"category_scores_gemma":[0.000062710926,0.0000311122,0.000026030362,0.00012287432,0.000018067762,0.00087971566,0.000020588297,0.00009580516,0.000016615164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001894149,0.00003894396,0.018904934,0.00015024473,0.00026300593,0.0000070420037,0.018966105,0.42083114,0.11378403,0.010465582,0.08900037,0.3273992],"study_design_scores_gemma":[0.00043028226,0.000052484924,0.05129426,0.00018175747,0.000016750275,0.00006676511,0.00022032588,0.9025952,0.020216918,0.0025233787,0.022273796,0.00012806348],"about_ca_topic_score_codex":0.000006436344,"about_ca_topic_score_gemma":0.0000012785706,"teacher_disagreement_score":0.48176408,"about_ca_system_score_codex":0.000015699374,"about_ca_system_score_gemma":0.000014780875,"threshold_uncertainty_score":0.12687187},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0200676,0.00004571316,0.97899914,0.00033017364,0.000006208299,0.00010272871,0.000007408068,0.00007079599,0.00037024656],"genre_scores_gemma":[0.98753655,0.00015869223,0.012118894,0.0000128392285,0.00007242608,0.000017293694,0.00000820855,0.000009522572,0.00006558033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995866,0.000007898835,0.00021155387,0.000047869013,0.00008168719,0.000064388994],"domain_scores_gemma":[0.9995659,0.0001431931,0.00008525095,0.00008095898,0.00008082417,0.00004388389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014457338,0.000052165942,0.00020592727,0.00018213212,0.000046332538,0.000025021425,0.000060275994,0.000027490583,0.000011987134],"category_scores_gemma":[0.000022600405,0.000040003095,0.00013052647,0.00047126733,0.000017772516,0.000043699747,0.000009846338,0.000043776625,0.000003998159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021118096,0.00087844866,0.0060342173,0.0010183624,0.014263019,0.000033537854,0.0018153209,0.15558593,0.035417866,0.6669082,0.041376937,0.07645697],"study_design_scores_gemma":[0.0009218318,0.000044144082,0.0030321453,0.00010921064,0.002542347,0.000016995917,0.00056680344,0.75941914,0.0047659506,0.21956836,0.00878067,0.0002323819],"about_ca_topic_score_codex":2.3022815e-7,"about_ca_topic_score_gemma":8.888101e-7,"teacher_disagreement_score":0.9674689,"about_ca_system_score_codex":0.0000083347195,"about_ca_system_score_gemma":0.000002980887,"threshold_uncertainty_score":0.16312788},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019732175,0.0002270811,0.9775049,0.00012896283,0.00019019614,0.00011736024,0.0000014478153,0.00015450058,0.0019433958],"genre_scores_gemma":[0.966224,0.0007291315,0.032909743,0.00001842957,0.00008448121,0.0000025413228,0.0000021632968,0.00001440699,0.000015105839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952954,0.00000771933,0.0002168959,0.000041301762,0.00011678196,0.00008776755],"domain_scores_gemma":[0.9997,0.00006553082,0.00008959764,0.00005479605,0.000055941873,0.00003414204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008313141,0.00006261329,0.00013809623,0.000055159213,0.000046900153,0.000022863005,0.00006634745,0.000038104907,0.000002909246],"category_scores_gemma":[0.000009566397,0.00004076771,0.000028703535,0.00017078915,0.000031313128,0.000030772404,0.000016406462,0.00010083447,6.9764593e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078602585,0.000024938172,0.000044458702,0.000015414176,0.00008603324,0.000007636765,0.0002701344,0.6844741,0.00797637,0.000783251,0.0016941493,0.3045449],"study_design_scores_gemma":[0.00016765301,0.000060778253,0.00045542273,0.00002046497,0.000015262973,0.000009210905,0.00005389291,0.98841065,0.008962047,0.0011865181,0.0005983334,0.000059734713],"about_ca_topic_score_codex":4.848788e-7,"about_ca_topic_score_gemma":1.715983e-8,"teacher_disagreement_score":0.94649184,"about_ca_system_score_codex":0.000007861727,"about_ca_system_score_gemma":0.000007458001,"threshold_uncertainty_score":0.1662459},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038039774,0.00021677089,0.9604823,0.000024256327,0.000034159642,0.0006790379,0.000026055097,0.0003909404,0.000106726715],"genre_scores_gemma":[0.8813507,0.0027765294,0.11470065,0.000036855276,0.000013590803,0.00015343567,0.0009204804,0.00003174779,0.000016019734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998565,0.00008364561,0.0005967825,0.0003589188,0.00015550379,0.00024012258],"domain_scores_gemma":[0.99902546,0.0002726405,0.00023950408,0.00023133552,0.00017275046,0.00005831625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006724771,0.00023569627,0.0010929734,0.00077828084,0.00013332204,0.00008543901,0.000080143676,0.00012186405,0.000018084358],"category_scores_gemma":[0.00006739046,0.00022445143,0.00026821566,0.0028988875,0.00011754684,0.00012016732,0.000040809224,0.00006748537,4.5191712e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033517389,0.000010707199,0.00024134965,0.000042380594,0.0042015654,5.0171883e-7,0.000457611,0.9922768,0.00066294207,0.0010658338,0.00003485911,0.0006702957],"study_design_scores_gemma":[0.0042476854,0.000012621313,0.00014696569,0.000018782144,0.00939785,2.0550722e-7,0.0001550994,0.9824786,0.0030636957,0.00022835967,0.000018452856,0.00023165824],"about_ca_topic_score_codex":0.000053830063,"about_ca_topic_score_gemma":0.000011659993,"teacher_disagreement_score":0.8457816,"about_ca_system_score_codex":0.000020266305,"about_ca_system_score_gemma":0.0000080844675,"threshold_uncertainty_score":0.91528636},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098745815,0.000052130483,0.8990251,0.00009372857,0.000011883433,0.00046072566,0.000111321286,0.0006709972,0.00082832156],"genre_scores_gemma":[0.96574324,0.0004445023,0.03192151,0.00011282495,0.000048468304,0.00020176853,0.0014440019,0.000043477314,0.00004017702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894273,0.000026990701,0.00027046472,0.00035894473,0.00018550237,0.00021536075],"domain_scores_gemma":[0.9993671,0.0000888471,0.00007775187,0.00026017145,0.000096236094,0.00010987214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001307128,0.00021329783,0.00030629692,0.00061821856,0.0002320122,0.000121742756,0.000072654155,0.00009159711,0.000014430809],"category_scores_gemma":[0.0000067423034,0.00020849498,0.00004791189,0.0019164691,0.00003686317,0.000086292996,0.000046058518,0.000111248635,0.0000127695175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016898695,0.000010955733,0.0016055675,0.000016035412,0.00033149385,0.0000015503009,0.00034681716,0.99272174,0.001244067,0.002169624,0.00021957331,0.0013156545],"study_design_scores_gemma":[0.00032816848,0.000040085775,0.015080521,0.000041590076,0.0008190639,0.0000042666684,0.00029523787,0.98151183,0.0009533612,0.00028001567,0.00026632875,0.00037951415],"about_ca_topic_score_codex":0.000063234766,"about_ca_topic_score_gemma":0.000056519817,"teacher_disagreement_score":0.8671036,"about_ca_system_score_codex":0.000030920513,"about_ca_system_score_gemma":0.0000072428925,"threshold_uncertainty_score":0.8502179},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37178802,0.00039286763,0.5415066,0.000038380047,0.001949515,0.0020141923,0.000353493,0.0069085,0.07504845],"genre_scores_gemma":[0.9021954,0.000070439186,0.09403057,0.00005590637,0.00015489612,0.00010083227,0.001287101,0.0003599164,0.0017449638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815553,0.000047054207,0.00049055176,0.00051799574,0.00043040252,0.0003584581],"domain_scores_gemma":[0.99864197,0.00015202898,0.00024824272,0.00051259284,0.00036260454,0.000082537954],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008290093,0.000583796,0.00067738496,0.00054241717,0.00007646476,0.000094406714,0.00021221489,0.0003564433,0.000038682403],"category_scores_gemma":[0.00001796621,0.0005400347,0.00016378898,0.00032735852,0.000071000904,0.00018391068,0.000022198261,0.00052521634,0.000009162682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002226458,0.0000474871,0.000015086668,0.00031737535,0.00027681846,0.00008727365,0.00062766083,0.8999404,0.070493266,0.00011903634,0.0023879332,0.025465041],"study_design_scores_gemma":[0.00029702776,0.00009269595,0.000057030687,0.0010449726,0.00006786564,0.0000066628863,0.00038764207,0.6698459,0.32750392,0.0002858556,0.000008997135,0.0004014138],"about_ca_topic_score_codex":0.000060970087,"about_ca_topic_score_gemma":0.00005345916,"teacher_disagreement_score":0.53040737,"about_ca_system_score_codex":0.00013396567,"about_ca_system_score_gemma":0.00006654983,"threshold_uncertainty_score":0.99970514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614934,0.001109827,0.0006467129,0.000022480544,0.0004540603,0.00058982504,0.000015697795,0.0025828886,0.033085156],"genre_scores_gemma":[0.99243486,0.00041382774,0.0037368194,0.000017169037,0.000069526424,0.0000059955087,0.00014391831,0.00018394875,0.0029939287],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99874836,0.00002538358,0.00036214205,0.0003203648,0.00025615128,0.00028760248],"domain_scores_gemma":[0.9991417,0.00011976014,0.00012310072,0.00034613046,0.00019207656,0.00007725767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006524524,0.00041251993,0.00059050735,0.000287691,0.00005606631,0.000049004262,0.0001249359,0.00028010912,0.000015385698],"category_scores_gemma":[0.000013921096,0.00037312604,0.00007147158,0.00028343414,0.000053004136,0.00005071586,0.000024529289,0.000294779,0.0000071933755],"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.0006656719,0.00020638193,0.00020066694,0.004048153,0.0036519463,0.00052274734,0.0055705113,0.16992746,0.66380584,0.00089055946,0.099413134,0.05109694],"study_design_scores_gemma":[0.0009401054,0.0002671121,0.0009292818,0.0040811817,0.0005490586,0.000054291006,0.0015477731,0.10930285,0.8708032,0.0005468829,0.009274848,0.0017034434],"about_ca_topic_score_codex":0.00025809585,"about_ca_topic_score_gemma":0.00079757895,"teacher_disagreement_score":0.20699735,"about_ca_system_score_codex":0.000018205947,"about_ca_system_score_gemma":0.00004009251,"threshold_uncertainty_score":0.9998721},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88817054,0.000207543,0.10922934,0.00003450638,0.0001181671,0.00056960934,0.000013671989,0.0011545608,0.000502057],"genre_scores_gemma":[0.9978313,0.0008058878,0.00093350885,0.000011072608,0.000051684612,0.0000030399156,0.000028315964,0.00005983391,0.0002753492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00003714897,0.00013988305,0.0005495542,0.000059514005,0.00022331494],"domain_scores_gemma":[0.99926883,0.00003687404,0.00007775173,0.00048042389,0.000049855247,0.000086289794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000080965685,0.00027403244,0.000281903,0.00029305008,0.00005281975,0.000020272944,0.0002391085,0.0002756518,0.000003407816],"category_scores_gemma":[0.000008361857,0.00028407644,0.000044302717,0.00033793482,0.000040351675,0.00009277276,0.00026543427,0.0004832319,0.00001249804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022404683,0.000093026385,0.0124940565,0.0005201185,0.00018697476,0.0014437573,0.00047525953,0.9727883,0.0042913663,0.0039091674,0.00094345945,0.0026305155],"study_design_scores_gemma":[0.0003856418,0.000029713472,0.002423053,0.0007283041,0.000059510174,0.0000061529913,0.000060398936,0.9870815,0.005389952,0.0029962615,0.00038937066,0.00045011268],"about_ca_topic_score_codex":0.00017582675,"about_ca_topic_score_gemma":0.00029679915,"teacher_disagreement_score":0.10966077,"about_ca_system_score_codex":0.00011083788,"about_ca_system_score_gemma":0.00003249215,"threshold_uncertainty_score":0.99996114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36686993,0.000005849844,0.63024306,0.00011603826,0.0000383955,0.00032864633,0.0000012115761,0.0022110029,0.00018586141],"genre_scores_gemma":[0.99382573,0.0000014856658,0.005493817,0.0001988114,0.00012303558,0.00028364145,0.0000129660175,0.000043813383,0.000016694656],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992966,0.00004195387,0.00014257111,0.0001403168,0.00017107533,0.00020747968],"domain_scores_gemma":[0.99965316,0.000026475942,0.000039774568,0.0001745642,0.00006127183,0.000044776792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015618805,0.00013891305,0.0001060096,0.0002587999,0.00037714388,0.0001340736,0.000121123725,0.00005207378,0.0000013501111],"category_scores_gemma":[0.00000276447,0.00013652335,0.00002369297,0.0008779515,0.00003437459,0.00025674776,0.000012674095,0.0002682133,0.00004220972],"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.000020511117,0.0000144290125,0.00001342164,0.00010125707,0.000015488211,0.0000019059523,0.0005998834,0.04710478,0.87933224,0.0000074082395,0.0009621835,0.07182651],"study_design_scores_gemma":[0.0002338984,0.00012020862,0.00050302176,0.0002226582,0.000037894228,0.000031738586,0.00032896333,0.25108525,0.7443336,0.0007305682,0.0019139874,0.00045815745],"about_ca_topic_score_codex":0.000045105346,"about_ca_topic_score_gemma":0.000022997383,"teacher_disagreement_score":0.6269558,"about_ca_system_score_codex":0.0000964861,"about_ca_system_score_gemma":0.000013023697,"threshold_uncertainty_score":0.55672604},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38187683,0.000012502046,0.61710536,0.000055830707,0.000066267516,0.00035115826,0.0000089326795,0.00016678107,0.0003563239],"genre_scores_gemma":[0.74529564,0.000013362769,0.25455734,0.00002434172,0.000050844803,0.000016442653,0.000025796018,0.000010925299,0.0000053204094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993589,0.0000032425498,0.0003701206,0.000036171994,0.00015169797,0.000079869205],"domain_scores_gemma":[0.99945986,0.00013462684,0.00021668417,0.000030493442,0.00012414646,0.000034172142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001913987,0.00008258917,0.00014427617,0.00014077983,0.000058604208,0.000046890633,0.000043024633,0.00003606913,4.615008e-7],"category_scores_gemma":[0.00002260918,0.000070917275,0.00003319902,0.00014747152,0.000015585074,0.00017414281,0.00001392533,0.00007831109,0.0000021200983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077762605,0.00012507747,0.000089573216,0.0009621154,0.00018388,0.0000017511499,0.004013857,0.87769,0.017901277,0.022655705,0.042242177,0.03405678],"study_design_scores_gemma":[0.0005753321,0.00006209698,0.00006806888,0.00011532323,0.000019116962,0.000023950875,0.00028627054,0.8937641,0.003579592,0.10048201,0.0009221156,0.0001020759],"about_ca_topic_score_codex":4.04414e-7,"about_ca_topic_score_gemma":3.7318986e-7,"teacher_disagreement_score":0.36341882,"about_ca_system_score_codex":0.000025336487,"about_ca_system_score_gemma":0.000017425815,"threshold_uncertainty_score":0.28919226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05897013,0.008071082,0.9277853,0.00017010568,0.00014053755,0.00012366791,0.00021420117,0.0031739974,0.0013510085],"genre_scores_gemma":[0.99521685,0.0003256133,0.0034740272,0.00010335652,0.0002649302,0.000006267801,0.000526572,0.000037588525,0.00004479825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987342,0.000076764816,0.0002598207,0.00041596082,0.00019489667,0.00031840612],"domain_scores_gemma":[0.99864364,0.00044982028,0.000060055936,0.00073072175,0.00004923146,0.00006655523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011715471,0.00019905028,0.00029281923,0.00035411175,0.0004589985,0.0003021891,0.000549838,0.00006695302,0.00002290559],"category_scores_gemma":[0.00008031393,0.0001529969,0.00007709091,0.0015011597,0.000115164294,0.00027039082,0.00028270367,0.00020666476,0.000014398391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006439117,0.000021500675,0.0007280587,0.00018042848,0.0018784498,0.000020740035,0.0010420921,0.14907168,0.008609774,0.0024112512,0.0049723964,0.83099926],"study_design_scores_gemma":[0.00009867302,0.000012097143,0.0013708451,0.00013933862,0.0016327763,0.000009727048,0.0006382749,0.9241779,0.0013322105,0.063086785,0.0070923627,0.0004090013],"about_ca_topic_score_codex":0.000022655771,"about_ca_topic_score_gemma":0.000016125507,"teacher_disagreement_score":0.9362467,"about_ca_system_score_codex":0.00001166259,"about_ca_system_score_gemma":0.000018889094,"threshold_uncertainty_score":0.6239032},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07588424,0.004790511,0.9152682,0.00013625174,0.0000866341,0.00012091822,0.0002437271,0.003097047,0.00037247062],"genre_scores_gemma":[0.99046683,0.0004704872,0.007343947,0.00009095861,0.000120957135,0.000007039353,0.0012990877,0.00004518391,0.00015549641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986705,0.00007657349,0.00021895289,0.0005048191,0.0002150976,0.00031402535],"domain_scores_gemma":[0.99887466,0.0002309683,0.000056189598,0.0006837922,0.000060555984,0.000093821895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000936514,0.00023299786,0.00039520205,0.00046488343,0.000310755,0.00026468677,0.00041769652,0.00011935145,0.000029345149],"category_scores_gemma":[0.00006672604,0.00020390801,0.000093891256,0.0014285222,0.00007591314,0.00033516798,0.00021286005,0.00024804892,0.000017834893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040042863,0.000056549612,0.0015088938,0.00044033985,0.0029008044,0.00008940231,0.0013035637,0.1159557,0.07592299,0.0006414303,0.03052576,0.77025414],"study_design_scores_gemma":[0.00041007655,0.000015966853,0.0013214541,0.000214055,0.0017624171,0.000008992063,0.0002874452,0.9757068,0.0033216681,0.011702742,0.004765306,0.00048307277],"about_ca_topic_score_codex":0.0000128719885,"about_ca_topic_score_gemma":0.000005711052,"teacher_disagreement_score":0.9145826,"about_ca_system_score_codex":0.00001305346,"about_ca_system_score_gemma":0.000019987201,"threshold_uncertainty_score":0.83151275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061682135,0.000119947275,0.93562245,0.00031524475,0.00055976486,0.00014746297,0.0000102349995,0.0006686458,0.0008741288],"genre_scores_gemma":[0.9970413,0.0004986127,0.002050972,0.000074292155,0.00021082559,0.0000028084849,0.000019224679,0.00002159394,0.000080381404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946177,0.00003273589,0.0001587576,0.00008179799,0.0001238466,0.00014109818],"domain_scores_gemma":[0.9997146,0.00004527024,0.000046164747,0.000053806252,0.00007954547,0.000060624476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000909514,0.00010589252,0.000117924465,0.000164687,0.00011831849,0.000094511604,0.000042877764,0.00006055104,0.00002218045],"category_scores_gemma":[0.000020980042,0.0000911731,0.000034235123,0.00018004964,0.00001345448,0.00017031268,0.0000065069175,0.00014785693,0.00000944535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025908366,0.0000045802603,0.00030848995,0.0000028786092,0.000028020979,0.000014409961,0.000069432084,0.99546695,0.0010954597,0.00052203523,0.0006131356,0.0018486852],"study_design_scores_gemma":[0.00059961015,0.00007613462,0.0025310076,0.000045194603,0.000014627517,0.000026564201,0.000017669294,0.99470997,0.0004634137,0.0008411561,0.00055739435,0.00011728721],"about_ca_topic_score_codex":4.7533746e-7,"about_ca_topic_score_gemma":5.5505734e-7,"teacher_disagreement_score":0.9353592,"about_ca_system_score_codex":0.000025164427,"about_ca_system_score_gemma":0.0000087551825,"threshold_uncertainty_score":0.37179312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99078315,0.0000463351,0.0063875117,0.000022686972,0.00006975312,0.00014140285,0.000002155906,0.0013703542,0.0011766619],"genre_scores_gemma":[0.99832153,0.00012370826,0.0014545878,0.0000065182317,0.000016922095,0.000010840556,0.000006517209,0.000021209684,0.000038174727],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995224,0.000012824339,0.00014707125,0.000103991326,0.00008901717,0.0001246806],"domain_scores_gemma":[0.9997117,0.000040785526,0.000019944615,0.00015589353,0.000045661123,0.00002600274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006913558,0.00009067313,0.00013267319,0.00011769032,0.000025629235,0.000019442765,0.000055895383,0.000058660386,0.0000074165337],"category_scores_gemma":[0.000025700181,0.00008479944,0.000026248754,0.00022798267,0.00004331109,0.00009080169,0.00003772653,0.00004633438,0.0000031242932],"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.000013611461,0.000009659232,0.0017621098,0.00015365468,0.000044130556,0.000004449749,0.00033354157,0.0066071255,0.97373116,0.0017269144,0.0014792157,0.014134442],"study_design_scores_gemma":[0.00011516113,0.000019132915,0.0038149632,0.000039247465,0.000008522956,0.00000267256,0.000044525852,0.061670844,0.9301711,0.0039553368,0.000052305004,0.000106186366],"about_ca_topic_score_codex":0.000018783829,"about_ca_topic_score_gemma":0.000022695067,"teacher_disagreement_score":0.055063717,"about_ca_system_score_codex":0.000012436907,"about_ca_system_score_gemma":0.000005444531,"threshold_uncertainty_score":0.34580207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4976428,0.00068567076,0.42472813,0.0011991294,0.0038105976,0.0029269583,0.0001446777,0.019146014,0.04971606],"genre_scores_gemma":[0.9800884,0.00000964527,0.018591411,0.0004188866,0.00051101204,0.00008437761,0.00010027838,0.000070191534,0.00012579914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988629,0.000024440922,0.00018351681,0.00027634922,0.00013546806,0.00051731913],"domain_scores_gemma":[0.9993315,0.00013606693,0.000024061925,0.0003171735,0.000054135104,0.00013707888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097114265,0.00021375967,0.0002214316,0.00012011443,0.000121679,0.00007330185,0.0002256548,0.000049212653,0.00008623097],"category_scores_gemma":[0.000011474233,0.0002105626,0.000080105245,0.00031590482,0.00002979482,0.00017638602,0.00008215094,0.00012891961,0.000031566877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070705544,0.000020409016,0.00042327453,0.000013791228,0.00009470813,0.00007220496,0.00051772076,0.52113175,0.019848704,0.002957564,0.41073215,0.044117004],"study_design_scores_gemma":[0.0001923976,0.00008568341,0.0015736261,0.00004677393,0.000019780047,0.00000942106,0.00018790229,0.9624834,0.02043448,0.0025535086,0.012065089,0.00034794526],"about_ca_topic_score_codex":0.000054481792,"about_ca_topic_score_gemma":0.000044722077,"teacher_disagreement_score":0.48244563,"about_ca_system_score_codex":0.000030087882,"about_ca_system_score_gemma":0.000007786897,"threshold_uncertainty_score":0.8586494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84004796,0.00030193318,0.14848614,0.00015219767,0.00031300157,0.0006348608,0.000005435206,0.002290122,0.007768337],"genre_scores_gemma":[0.99867487,0.000084220206,0.0011232226,0.000006536133,0.000016782617,0.000022652863,0.0000024172862,0.000011855457,0.000057449994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995718,0.000020007568,0.0001266423,0.00008852133,0.000080254555,0.000112775924],"domain_scores_gemma":[0.99978733,0.000027421367,0.000016615415,0.00010876779,0.00004474327,0.000015123022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006691607,0.00007507737,0.00010581605,0.00015814778,0.000013321593,0.000009144222,0.00006645359,0.000057042434,0.000008764873],"category_scores_gemma":[0.00002479426,0.00006948775,0.000018197923,0.0008134545,0.000025379713,0.00005313293,0.000020399693,0.000101440426,0.000012754417],"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.000096524636,0.00008796363,0.001884039,0.00017491162,0.00010425355,0.00012730843,0.0058250315,0.56825626,0.19513786,0.016852075,0.005401994,0.20605181],"study_design_scores_gemma":[0.000054235596,0.000055833512,0.0032665846,0.00006247317,0.000002762428,0.0000022368108,0.00055621006,0.10553117,0.8853321,0.004728966,0.00027935556,0.0001280877],"about_ca_topic_score_codex":0.00010305225,"about_ca_topic_score_gemma":0.00026341373,"teacher_disagreement_score":0.69019425,"about_ca_system_score_codex":0.00002269818,"about_ca_system_score_gemma":0.000005453917,"threshold_uncertainty_score":0.28336284},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026342962,0.0005370085,0.9676183,0.000078209625,0.000110874855,0.0005392396,0.000017679757,0.0022054457,0.0025502667],"genre_scores_gemma":[0.8577605,0.000022491547,0.14152701,0.000028289716,0.00019875806,0.00011808238,0.000040364786,0.000078666,0.00022584722],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988933,0.000034799483,0.00022955179,0.00028476949,0.00017826204,0.00037931805],"domain_scores_gemma":[0.9995172,0.00007351949,0.0000797401,0.00013900366,0.00013511685,0.00005540399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026164934,0.00020445224,0.00023439914,0.00017776978,0.00024370466,0.0001058787,0.00010521377,0.000111328336,0.000025634334],"category_scores_gemma":[0.000021717824,0.00018238559,0.000046658497,0.0004731329,0.000048671773,0.0003410698,0.000009056488,0.00018392595,0.000011574599],"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.00014968328,0.00002293173,0.00016493173,0.000688112,0.00007586708,0.00002288072,0.0003366957,0.016426926,0.7002292,0.00037802712,0.003937855,0.27756688],"study_design_scores_gemma":[0.0011815412,0.00025323703,0.00014861044,0.0013208861,0.00010405883,0.00011976541,0.0002832519,0.21739635,0.76109314,0.01621066,0.0011707835,0.000717687],"about_ca_topic_score_codex":0.00006937939,"about_ca_topic_score_gemma":0.000013806191,"teacher_disagreement_score":0.8314175,"about_ca_system_score_codex":0.000079495105,"about_ca_system_score_gemma":0.00006896967,"threshold_uncertainty_score":0.7437469},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029020268,0.000006014617,0.9687277,0.000008305514,0.00018691164,0.0002544395,0.00027522797,0.0012499058,0.0002712392],"genre_scores_gemma":[0.9935614,0.00004832499,0.0060446616,0.00004849289,0.000013057803,0.000085244574,0.00016258107,0.00001693209,0.000019300507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.000024668574,0.00032076385,0.000067464294,0.00012332588,0.00015743857],"domain_scores_gemma":[0.99945307,0.0001571384,0.00004348782,0.00021290006,0.000088583365,0.000044794568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002451601,0.000114574636,0.00020466343,0.00089643965,0.000084840925,0.000024803661,0.00010262334,0.000086641056,0.00004291638],"category_scores_gemma":[0.0000028744607,0.00011553606,0.00016481246,0.0008957006,0.000023654884,0.00046041433,2.416168e-7,0.0000906975,0.0000151303375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047616086,0.000018511353,0.0000011338886,0.000029272394,0.0003725994,1.2888387e-7,0.0012325516,0.6923957,0.0014737529,0.00033431122,0.00007496212,0.30401945],"study_design_scores_gemma":[0.00026663629,0.00006653118,0.00014180978,0.000025122396,0.00030498067,5.746289e-7,0.0006459357,0.8956582,0.101711676,0.0005662329,0.0004747784,0.00013751759],"about_ca_topic_score_codex":0.000009202196,"about_ca_topic_score_gemma":0.000013442078,"teacher_disagreement_score":0.96454114,"about_ca_system_score_codex":0.00003982048,"about_ca_system_score_gemma":0.0000121070825,"threshold_uncertainty_score":0.47114238},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053639873,0.00009293164,0.98001,0.0023803087,0.000090526075,0.0005007355,0.00003336192,0.00092341274,0.010604762],"genre_scores_gemma":[0.93779314,0.000095875235,0.058273952,0.0004470394,0.0001368212,0.00013881085,0.00010712023,0.00011687849,0.0028903747],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995111,0.000007220182,0.00011606207,0.000111409056,0.00005265589,0.0002015013],"domain_scores_gemma":[0.99961126,0.00006863349,0.000012237459,0.00013368795,0.00003089467,0.00014329227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081677186,0.00008652223,0.000107718006,0.00009412858,0.00006874054,0.000044167657,0.000058536694,0.00006722338,0.00022263845],"category_scores_gemma":[0.00007328475,0.00009104024,0.000020849893,0.0001216204,0.0000329854,0.000019358113,0.000007871275,0.000043698197,0.00017677956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015688032,0.00002474269,0.000066426786,0.00080272823,0.00009631844,0.000046541456,0.0008600641,0.097638935,0.0013356544,0.25294998,0.62489414,0.021268763],"study_design_scores_gemma":[0.00011697186,0.000015655949,0.0000425674,0.00011955285,0.000013861075,0.0000069867388,0.00003342491,0.8755561,0.0010680238,0.024023738,0.09880393,0.00019916796],"about_ca_topic_score_codex":0.000031501047,"about_ca_topic_score_gemma":0.000115255876,"teacher_disagreement_score":0.93242913,"about_ca_system_score_codex":0.000042337633,"about_ca_system_score_gemma":0.000015561263,"threshold_uncertainty_score":0.3712513},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13726352,0.00009817135,0.8586776,0.000024978304,0.00026762366,0.0007410425,0.000009143401,0.0012752656,0.001642654],"genre_scores_gemma":[0.9760985,0.00019684133,0.023370849,0.000013638594,0.000062713596,0.00012299947,0.00004850661,0.000031919248,0.000054040076],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992084,0.000007740361,0.00027117901,0.0001971209,0.00012442262,0.00019114303],"domain_scores_gemma":[0.99942994,0.000059674207,0.000052615924,0.00035060474,0.00007372693,0.000033455643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017719633,0.00012922387,0.00018820717,0.000095112926,0.000044342243,0.0000124402795,0.00016809878,0.000095178584,0.000016831289],"category_scores_gemma":[0.000013534899,0.00012114268,0.000057376023,0.00035091382,0.000040218572,0.000038878068,0.00003955326,0.00006620631,0.000020214045],"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.00008911402,0.000023067008,0.000055508866,0.00010284807,0.000030128453,0.0000013058162,0.00026974562,0.048636023,0.8742196,0.01725313,0.005113279,0.05420625],"study_design_scores_gemma":[0.0000981553,0.00001508468,0.000093328395,0.0000402189,0.000008692956,6.4698327e-7,0.00003228653,0.20151418,0.7798098,0.01702656,0.0012468987,0.000114191535],"about_ca_topic_score_codex":0.000014502862,"about_ca_topic_score_gemma":0.0000021694784,"teacher_disagreement_score":0.838835,"about_ca_system_score_codex":0.000026088315,"about_ca_system_score_gemma":0.000009891509,"threshold_uncertainty_score":0.4940055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914028,0.0060204547,0.0005682504,0.0003565382,0.00030828037,0.00023000124,0.0000031017737,0.001053266,0.000057279416],"genre_scores_gemma":[0.99315625,0.0041378983,0.0023806232,0.00005740061,0.00010356961,0.000054888253,0.000013957999,0.000049969272,0.000045461562],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99908966,0.000017190903,0.00011375912,0.00027253132,0.00009949063,0.00040739196],"domain_scores_gemma":[0.99960315,0.000027133116,0.000025625488,0.00018244325,0.00007252343,0.00008914535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005221929,0.00018162208,0.00015935801,0.000113883674,0.00021658173,0.000107756015,0.000063964835,0.00007238965,0.0000023929044],"category_scores_gemma":[0.000014393522,0.00017463608,0.000018296136,0.00041864798,0.000034573735,0.00023099486,0.00011128988,0.00026984204,0.000007810282],"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.000058926344,0.000026386006,0.0006710287,0.00007814311,0.00011625068,0.00018152822,0.0033662468,0.003955731,0.59324336,0.0006123181,0.011576087,0.38611397],"study_design_scores_gemma":[0.0007825338,0.00018611629,0.0044799135,0.000571295,0.0000454865,0.00029650205,0.00061346544,0.0508016,0.8938388,0.0052778735,0.042151783,0.00095462165],"about_ca_topic_score_codex":0.000004420075,"about_ca_topic_score_gemma":0.000023959397,"teacher_disagreement_score":0.38515934,"about_ca_system_score_codex":0.000052310606,"about_ca_system_score_gemma":0.000015569456,"threshold_uncertainty_score":0.71214527},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5241757,0.0017017587,0.29252413,0.003372399,0.0100449,0.014730021,0.0002118689,0.07142862,0.08181059],"genre_scores_gemma":[0.95868194,0.0007655279,0.033135433,0.00074944505,0.00052887894,0.0012235007,0.000255657,0.00043902284,0.004220602],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854374,0.000022733433,0.00031322098,0.00033857822,0.00020520727,0.0005765076],"domain_scores_gemma":[0.9991985,0.000061963605,0.000056830697,0.00046019576,0.000090740934,0.00013178441],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023806476,0.00027656896,0.00026832294,0.0002712731,0.000121791556,0.00007245411,0.00027995062,0.00019044048,0.000035205696],"category_scores_gemma":[0.000040653595,0.00028856864,0.00015150239,0.00054616935,0.0000849592,0.00020790937,0.0000842931,0.00020047968,0.0003089836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027227816,0.00005727008,0.00039623934,0.00061808474,0.00030606633,0.000048837643,0.0026360902,0.35537237,0.15681705,0.0031390775,0.46745533,0.01312635],"study_design_scores_gemma":[0.0008044064,0.000091432834,0.000055569326,0.00022974568,0.000052478394,0.000012042886,0.00018854636,0.7219231,0.03336426,0.030752486,0.21192034,0.00060555123],"about_ca_topic_score_codex":0.000052401065,"about_ca_topic_score_gemma":0.00015423322,"teacher_disagreement_score":0.43450624,"about_ca_system_score_codex":0.00008659999,"about_ca_system_score_gemma":0.000023625946,"threshold_uncertainty_score":0.99995667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103482,0.00017303554,0.18757908,0.00006891151,0.000059973852,0.00022493061,0.00018008675,0.00019749737,0.0011682701],"genre_scores_gemma":[0.78942025,0.00002927296,0.21031974,0.000005310832,0.000011750059,0.0000050678327,0.00018435466,0.000018432791,0.0000058149362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000029950541,0.0006272584,0.00011979581,0.0003785506,0.00012516593],"domain_scores_gemma":[0.9976419,0.0014842486,0.00027736934,0.000120288736,0.00043597593,0.00004017097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018275711,0.00014309556,0.0003473928,0.00066614896,0.00007034922,0.000024035686,0.00013154959,0.000052113515,0.000017557477],"category_scores_gemma":[0.00010793924,0.00015772038,0.00008157658,0.0009426538,0.00024569905,0.00012419395,0.0000741621,0.00007784004,0.000010515465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010989248,0.00013606966,0.00048561158,0.0004680916,0.00019184458,0.0000020860477,0.000829945,0.6891827,0.0009298827,0.30668813,0.0002930012,0.0007816655],"study_design_scores_gemma":[0.00019103142,0.000046971487,0.008343282,0.00023250094,0.000042097763,0.000021208501,0.00010906889,0.58187836,0.0015783483,0.40744185,0.000009635445,0.0001056191],"about_ca_topic_score_codex":0.00002148662,"about_ca_topic_score_gemma":0.0000015197614,"teacher_disagreement_score":0.107304305,"about_ca_system_score_codex":0.000025445548,"about_ca_system_score_gemma":0.000059022797,"threshold_uncertainty_score":0.64316505},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050367084,0.000081810445,0.99277467,0.00024085944,0.0006258821,0.00016748748,0.0000134731345,0.0003668128,0.0006922877],"genre_scores_gemma":[0.28917715,0.00021600453,0.70981836,0.00013192798,0.00052573706,0.000008782852,0.00004639731,0.000045441677,0.000030218489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990885,0.000036266603,0.00040783698,0.00009284618,0.00019177406,0.00018274212],"domain_scores_gemma":[0.99920857,0.000053740077,0.00017466658,0.00010394326,0.00039126733,0.000067832014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001948252,0.00012914208,0.00023166076,0.00013082761,0.000048947786,0.000052071646,0.00013310212,0.00011264886,0.00001092782],"category_scores_gemma":[0.000116038274,0.00012315977,0.00012900333,0.0005927594,0.000011419566,0.0002303658,0.00001806001,0.0000794031,0.000003696602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055516375,0.000011351096,0.00007546729,0.000013702696,0.000059688642,0.000005544229,0.00004053474,0.9606068,0.0014282718,0.00013899668,0.032051604,0.0055125193],"study_design_scores_gemma":[0.0005840295,0.00013939355,0.00022233397,0.00006298782,0.000067510584,0.000050291914,0.00002397761,0.99025345,0.0045763566,0.0006243331,0.0032628966,0.00013241108],"about_ca_topic_score_codex":0.0000037403763,"about_ca_topic_score_gemma":0.000004140866,"teacher_disagreement_score":0.28414044,"about_ca_system_score_codex":0.00013919694,"about_ca_system_score_gemma":0.00004202603,"threshold_uncertainty_score":0.502231},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.767717,0.0012209143,0.20863697,0.0002791415,0.0004185641,0.00045459444,0.000005591369,0.018335663,0.0029315678],"genre_scores_gemma":[0.9919884,0.00009162866,0.0040237363,0.000028023835,0.00008813204,0.000013307581,0.0001653679,0.00012269868,0.0034786912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897736,0.00009331572,0.00013464542,0.00025984476,0.00018763382,0.0003471674],"domain_scores_gemma":[0.999589,0.000047494417,0.000052045525,0.00020084249,0.00004534645,0.00006526287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013211812,0.00023514709,0.0002063623,0.00019483444,0.00022345662,0.00008155008,0.00013040005,0.00012488628,0.000018806573],"category_scores_gemma":[0.00005245339,0.00021650038,0.000056236822,0.00048625265,0.000027784232,0.000083517065,0.000061563216,0.00062607735,0.000075638156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000132971,0.000007389858,0.0046548517,0.000022773378,0.000050483544,0.000100633275,0.00028858663,0.9637915,0.02207803,0.000015959835,0.0006038348,0.008372674],"study_design_scores_gemma":[0.00033947598,0.00009573809,0.002067372,0.0000925482,0.000023589067,0.000054379296,0.00004649257,0.9485891,0.019460306,0.000034011755,0.028880445,0.00031654353],"about_ca_topic_score_codex":0.000022787757,"about_ca_topic_score_gemma":0.000030893872,"teacher_disagreement_score":0.22427142,"about_ca_system_score_codex":0.000035219156,"about_ca_system_score_gemma":0.0000067580963,"threshold_uncertainty_score":0.8828629},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001468774,0.00021751769,0.0805836,0.00010820533,0.00082636694,0.0034813115,0.0005500258,0.0021454825,0.91194063],"genre_scores_gemma":[0.012157252,0.00083261414,0.1352957,0.0011462884,0.012061448,0.0017291764,0.00043891446,0.0025852467,0.83375335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871,0.0000016715084,0.00041380335,0.0003089735,0.0002450329,0.00032051507],"domain_scores_gemma":[0.99913263,0.00025161833,0.00015995627,0.0003314638,0.00005448311,0.00006986683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022908716,0.00049854687,0.00053636625,0.000039201197,0.00032613857,0.00017321754,0.00022191102,0.00065061444,0.000020594778],"category_scores_gemma":[0.000005545493,0.00038196886,0.00041297008,0.000015036071,0.00021439393,0.000019996252,0.00014503564,0.0007177512,0.000015814278],"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.000007843823,0.0000074302343,2.467482e-8,0.00015927403,0.0008488242,0.0000029400808,0.003495055,0.00007265256,0.0006271374,0.8526987,0.028354863,0.113725245],"study_design_scores_gemma":[0.0010875923,0.000084614156,5.4449448e-8,0.0010148342,0.000558184,0.000013299502,0.0010711816,0.026436388,0.006453975,0.74407965,0.21791925,0.0012809652],"about_ca_topic_score_codex":0.0000010074842,"about_ca_topic_score_gemma":7.6551925e-7,"teacher_disagreement_score":0.18956438,"about_ca_system_score_codex":0.000041412273,"about_ca_system_score_gemma":0.000020990485,"threshold_uncertainty_score":0.9998632},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11777742,0.008205015,0.021783173,0.0015840539,0.016628908,0.00029696568,0.0024868196,0.0022220416,0.8290156],"genre_scores_gemma":[0.95305777,0.002899406,0.007819666,0.0027403473,0.0098848725,0.0071227155,0.010748275,0.004332387,0.0013945682],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96832913,0.0027433585,0.0066835587,0.006273941,0.007353805,0.008616216],"domain_scores_gemma":[0.9739823,0.007035613,0.0067422823,0.0070752706,0.0010650347,0.0040995264],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007750067,0.0034326334,0.0013618488,0.0029347925,0.0051557207,0.005507399,0.007389166,0.009206227,0.73719203],"category_scores_gemma":[0.005563019,0.007455555,0.0067984667,0.0057197176,0.0047823833,0.0043563,0.0055499407,0.005988565,0.005227275],"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.0044668675,0.00090828305,0.000039796272,0.0045040064,0.0054647555,0.003333342,0.002619462,0.026132565,0.007278746,0.22622044,0.71501166,0.004020056],"study_design_scores_gemma":[0.00547583,0.0037844093,0.00014496621,0.005053583,0.004966471,0.003414853,0.0030927777,0.16185312,0.79104495,0.00027136574,0.015176708,0.005720964],"about_ca_topic_score_codex":0.005822212,"about_ca_topic_score_gemma":0.006282914,"teacher_disagreement_score":0.83528036,"about_ca_system_score_codex":0.00010852431,"about_ca_system_score_gemma":0.0051740585,"threshold_uncertainty_score":0.9979813},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001090169,0.000055158664,0.9931631,0.00008802578,0.00028702963,0.0006340793,0.000048985006,0.0054477113,0.00016687311],"genre_scores_gemma":[0.006083064,0.00001632407,0.99286425,0.00015103226,0.00008773359,0.00023329201,0.0003399353,0.00013403402,0.00009032888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984225,0.00030678674,0.00036287587,0.00038371028,0.00014960395,0.0003745448],"domain_scores_gemma":[0.9983961,0.000703151,0.0000810442,0.0004697233,0.00022862712,0.00012138442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080666225,0.000290082,0.00033978233,0.0003203457,0.0001487809,0.00011714136,0.00024632175,0.00019550786,0.00009836109],"category_scores_gemma":[0.00042295572,0.0002941785,0.0001341567,0.0006080022,0.000045076722,0.00022399004,0.000028154742,0.00015060874,0.0000053417716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015232813,0.000017440114,0.000032202865,0.0000693022,0.000028167267,0.0000023762386,0.00012688215,0.91483694,0.0054472075,0.00007112125,0.0010525885,0.07830055],"study_design_scores_gemma":[0.00040015072,0.00009551016,0.000024991852,0.000094774055,0.00004540219,0.000004473323,0.00007565718,0.9651379,0.030457139,0.0015709706,0.0017444915,0.00034851301],"about_ca_topic_score_codex":0.000007837021,"about_ca_topic_score_gemma":0.0000046247565,"teacher_disagreement_score":0.07795204,"about_ca_system_score_codex":0.000052323172,"about_ca_system_score_gemma":0.000051000323,"threshold_uncertainty_score":0.99995106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098514985,0.0007898674,0.98786837,0.000012336437,0.00021680296,0.00014159136,0.00003960053,0.00061868,0.0004612327],"genre_scores_gemma":[0.4991637,0.000041514497,0.5006371,0.000012104718,0.000055715034,0.000004611419,0.000026940392,0.000029650748,0.00002867281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927986,0.00003742614,0.00017598816,0.00019950896,0.00006817532,0.00023906872],"domain_scores_gemma":[0.99911577,0.0006678196,0.000019405326,0.00007054975,0.000063528496,0.0000629182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018981255,0.00015348545,0.00018556256,0.000068420675,0.00013010288,0.00021917651,0.00004954626,0.00003614752,0.0000096025315],"category_scores_gemma":[0.000036469173,0.0001320418,0.000015081092,0.00009196491,0.000055487548,0.000035273253,0.000031099986,0.00019781644,0.0000017535285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002502232,0.00001188491,0.000116243515,0.0003926683,0.00018324105,0.00008351014,0.0009788908,0.018211192,0.0017973131,0.09369816,0.004594475,0.87990737],"study_design_scores_gemma":[0.00009237989,0.0001451282,0.00016881934,0.000161944,0.000043818636,0.000030054547,0.00009980525,0.98238254,0.0017792137,0.0065232716,0.008375962,0.00019703727],"about_ca_topic_score_codex":0.000014613125,"about_ca_topic_score_gemma":0.0000029852683,"teacher_disagreement_score":0.96417135,"about_ca_system_score_codex":0.000021081109,"about_ca_system_score_gemma":0.000019345582,"threshold_uncertainty_score":0.53845084},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05044002,0.0005382172,0.9484393,0.00005081688,0.00022094908,0.000046867524,0.0000031666007,0.00008669626,0.0001739471],"genre_scores_gemma":[0.94977313,0.00010495983,0.04993551,0.0000063247803,0.00008675096,8.0202625e-7,0.0000070667825,0.000018923673,0.00006655398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897385,0.00003608298,0.00055675424,0.000096015036,0.00023248812,0.00010483994],"domain_scores_gemma":[0.99933827,0.000068477304,0.00019768927,0.00018031645,0.00017165771,0.00004356634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003077302,0.00011915876,0.00039086843,0.00066778,0.000021856917,0.000050176983,0.0001279831,0.00008574892,0.000038374117],"category_scores_gemma":[0.00003766256,0.00010467981,0.00028225107,0.001049905,0.000019035015,0.00027220577,0.00001487979,0.00016342165,0.000005493028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015180069,0.000021036029,0.00007586703,0.000046740915,0.0017332587,0.000039846185,0.00023026421,0.9085478,0.07859695,0.00032767322,0.00029794144,0.010067435],"study_design_scores_gemma":[0.000120605095,0.000027003633,0.001294705,0.00015451558,0.0012860467,0.000017483278,0.000009883694,0.9331707,0.06243578,0.0012310619,0.000158651,0.00009355962],"about_ca_topic_score_codex":0.00003638711,"about_ca_topic_score_gemma":0.0000024142828,"teacher_disagreement_score":0.8993331,"about_ca_system_score_codex":0.00005411059,"about_ca_system_score_gemma":0.000024223373,"threshold_uncertainty_score":0.4268719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948498,0.00024322465,0.10173924,0.000018303248,0.0007065557,0.00010189987,0.000005300414,0.00148718,0.0008485344],"genre_scores_gemma":[0.9834607,0.000030727464,0.01619514,0.000022058992,0.00020938722,0.000004950204,0.000013428162,0.00003241992,0.000031183794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994868,0.000009999096,0.00008277682,0.00016932588,0.00010520015,0.00014587745],"domain_scores_gemma":[0.9997549,0.00001727251,0.000008583861,0.00015347096,0.00002856465,0.000037203685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000029121386,0.00013014046,0.000107602806,0.000045968616,0.00005517947,0.00003886304,0.000047894075,0.000051120278,0.0000144703],"category_scores_gemma":[9.598959e-7,0.000114156785,0.000037507627,0.0001674932,0.000034362118,0.00016904224,0.000020641311,0.00016805252,0.000054077133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007577862,0.00012162493,0.0012900317,0.00024014828,0.0005921873,0.0003677165,0.00066194544,0.16817278,0.30998233,0.012832532,0.0126275355,0.49303538],"study_design_scores_gemma":[0.00033986248,0.0001609052,0.0039845565,0.00061070896,0.00010472694,0.00027673942,0.000058631,0.8598596,0.12188548,0.0038835625,0.0080047315,0.0008305416],"about_ca_topic_score_codex":0.00004103411,"about_ca_topic_score_gemma":0.000009254945,"teacher_disagreement_score":0.6916868,"about_ca_system_score_codex":0.000039313596,"about_ca_system_score_gemma":0.00000972018,"threshold_uncertainty_score":0.46551785},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067188576,0.0028358044,0.9250036,0.000069496804,0.0001339114,0.00045610318,0.000027319898,0.0027123576,0.0015728287],"genre_scores_gemma":[0.9397081,0.0000126776085,0.059689634,0.000055658536,0.0002113094,0.00002284549,0.000051104857,0.00015716435,0.000091493705],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983614,0.000024105797,0.0003392951,0.0004750734,0.00025836262,0.0005417719],"domain_scores_gemma":[0.999282,0.00010153354,0.00006907947,0.00020401427,0.00023291583,0.00011044899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000117300966,0.00038242605,0.00034669516,0.00016234748,0.00018134581,0.00041497988,0.00015995148,0.0001746589,0.000009326351],"category_scores_gemma":[0.0000098033115,0.00034875722,0.00010192746,0.00029069674,0.00013501784,0.000678453,0.00005216973,0.00034389316,0.000010502794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089856796,0.00002185709,0.000006785588,0.0005266417,0.000092197035,0.00009178968,0.0006751168,0.32061532,0.6399602,0.000047311572,0.0017005415,0.03617237],"study_design_scores_gemma":[0.0003028699,0.000054178578,0.00000778875,0.0010854818,0.00008673218,0.000065550725,0.000052821422,0.8110973,0.18488029,0.0017050023,0.000255777,0.00040615996],"about_ca_topic_score_codex":0.000015570266,"about_ca_topic_score_gemma":0.000008623009,"teacher_disagreement_score":0.87251955,"about_ca_system_score_codex":0.00011442,"about_ca_system_score_gemma":0.00007281731,"threshold_uncertainty_score":0.99989647},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032945693,0.002767082,0.018601626,0.000024530056,0.0006994414,0.00017256376,0.000009620722,0.008548638,0.9691732],"genre_scores_gemma":[0.0025447442,0.00035498443,0.0011654433,0.00007249246,0.000467781,0.000020249556,0.000011749355,0.00104483,0.9943177],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948853,0.0000075764174,0.00009561147,0.00017310905,0.000089956775,0.00014520808],"domain_scores_gemma":[0.9996529,0.000011264498,0.000017187203,0.0002759911,0.000007486572,0.00003517168],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00001694063,0.00021824236,0.00024374724,0.00021576564,0.0000055788655,0.0000994537,0.00021698912,0.0002181556,0.0033332948],"category_scores_gemma":[0.0000031282173,0.00018144045,0.00008247357,0.00009394154,0.000017329754,0.000018756999,0.00006561054,0.0001872575,0.0010674829],"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.0000014422034,0.0000014669445,4.0064762e-7,0.000050028153,0.000111632464,0.000034575365,0.000010187483,0.00007125351,0.00010268687,0.0002764148,0.9983388,0.0010010881],"study_design_scores_gemma":[0.00014127896,0.0000035637756,4.4346862e-7,0.00035573472,0.000036112397,0.0000031225322,0.000002573259,0.002214719,0.003061553,0.001727849,0.9921955,0.00025755883],"about_ca_topic_score_codex":0.000060429385,"about_ca_topic_score_gemma":0.000025664365,"teacher_disagreement_score":0.025144523,"about_ca_system_score_codex":0.000017237404,"about_ca_system_score_gemma":0.000004902924,"threshold_uncertainty_score":0.9997103},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09632197,0.000010495779,0.88930833,0.000005533715,0.000050717194,0.00010119896,0.000007630185,0.007796394,0.0063977223],"genre_scores_gemma":[0.8657062,0.000011671207,0.13386092,0.0000067031397,0.000015530442,0.000005148586,0.0003432121,0.00001705056,0.000033549102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945456,0.00002038276,0.00018850708,0.00012186155,0.00010830359,0.00010640664],"domain_scores_gemma":[0.99967253,0.000015650348,0.00003127403,0.00019110233,0.00006315907,0.000026278236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008741579,0.00008595603,0.00016781344,0.0005159771,0.00001963733,0.000020399031,0.00006549775,0.000063505024,0.000039137514],"category_scores_gemma":[0.000007224486,0.00008284492,0.000054064643,0.0014520702,0.000014133128,0.00013953635,0.000021456777,0.00004146011,0.0000029038902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021093738,0.00001566654,0.00019091205,0.0000051764173,0.0002256353,6.6838396e-7,0.00017788757,0.9915061,0.0058506457,0.00012703496,0.00062657724,0.0012715937],"study_design_scores_gemma":[0.000052949825,0.000017146884,0.003869941,0.0000057138495,0.00013608411,6.4346756e-7,0.00009069008,0.98916215,0.006542206,0.000017788685,0.000012947208,0.00009171781],"about_ca_topic_score_codex":0.00003585969,"about_ca_topic_score_gemma":0.0000027316314,"teacher_disagreement_score":0.76938426,"about_ca_system_score_codex":0.000016992155,"about_ca_system_score_gemma":0.000004532331,"threshold_uncertainty_score":0.33783177},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041483138,0.0014807854,0.95599455,0.0005599965,0.00018493297,0.00009807133,0.000027968023,0.00012218533,0.00004838395],"genre_scores_gemma":[0.8171424,0.000028394736,0.18252912,0.00006829475,0.0001164282,0.000014695436,0.000043257205,0.000021434078,0.000035928875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899536,0.00008088744,0.00039261754,0.00013834886,0.00023988735,0.00015289977],"domain_scores_gemma":[0.99875796,0.0005183557,0.00011437358,0.00014636108,0.00036335256,0.000099596116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889766,0.00014784957,0.00039216157,0.00050333765,0.00017171644,0.00014401416,0.00011482532,0.000057681016,0.00012908789],"category_scores_gemma":[0.000061540144,0.00011018462,0.00029989937,0.0009801413,0.00008109029,0.00020409198,0.000017696386,0.0002049663,0.0000034802856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022992521,0.00038031652,0.00043634043,0.00010966683,0.014927883,0.00016029085,0.0008591071,0.7614998,0.09179402,0.00487769,0.022362934,0.10236203],"study_design_scores_gemma":[0.00025123457,0.00017825293,0.001021904,0.00011768066,0.0025827123,0.000060263403,0.000054293432,0.98292464,0.0045048115,0.0038310606,0.0042905775,0.00018257477],"about_ca_topic_score_codex":0.00002336244,"about_ca_topic_score_gemma":0.0000035440723,"teacher_disagreement_score":0.7756593,"about_ca_system_score_codex":0.00009211451,"about_ca_system_score_gemma":0.00007329,"threshold_uncertainty_score":0.44931984},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11076812,0.0023353025,0.8861553,0.000085014646,0.00038544144,0.00008699364,0.0000041456287,0.00008454073,0.00009515696],"genre_scores_gemma":[0.9222077,0.00034034447,0.07735966,0.000005483902,0.000055949877,4.5443858e-7,0.0000058353708,0.000008355361,0.000016196198],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994588,0.000024502571,0.0001814929,0.00011859699,0.00012045005,0.000096152515],"domain_scores_gemma":[0.99945575,0.00021516369,0.00004978144,0.00018171746,0.000068040645,0.000029541668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766245,0.00005625731,0.00008063069,0.0002458734,0.000060158858,0.00012623868,0.0003726121,0.000027204665,0.000001959795],"category_scores_gemma":[0.0010340664,0.000044170316,0.000010296212,0.00030072758,0.00007057285,0.0012436735,0.00014938215,0.00017885401,2.760326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094384144,0.000022007776,0.0014979885,0.00022950725,0.000036152524,0.000080868725,0.0021743518,0.029908625,0.65924937,0.0048885117,0.0008161146,0.30100212],"study_design_scores_gemma":[0.00008700705,0.00006058814,0.0001480287,0.001268158,0.000011776492,0.000070628375,0.00017860548,0.9802243,0.010257504,0.007019254,0.0006064164,0.00006772687],"about_ca_topic_score_codex":7.6519484e-7,"about_ca_topic_score_gemma":4.7090043e-7,"teacher_disagreement_score":0.95031565,"about_ca_system_score_codex":0.00002738729,"about_ca_system_score_gemma":0.000041700132,"threshold_uncertainty_score":0.18012132},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093610835,0.0036507498,0.9920572,0.0001629488,0.00076583354,0.00075480534,0.00004656991,0.0014037295,0.00022204073],"genre_scores_gemma":[0.0011928199,0.00028527467,0.9977149,0.00008878136,0.00010959083,0.00018410316,0.00005812643,0.00012999968,0.00023644198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769074,0.00073705014,0.0005897029,0.0004674473,0.00013803988,0.00037702254],"domain_scores_gemma":[0.99608755,0.0028475523,0.00011544161,0.00044303408,0.0004008322,0.00010556454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001866698,0.00036268384,0.00053333584,0.00021173917,0.0003125479,0.00026088275,0.00019185427,0.00022571726,0.0001005038],"category_scores_gemma":[0.0009898377,0.00028622168,0.00019351872,0.0006990114,0.00020037367,0.00024350721,0.00010299558,0.0003298096,0.0000012210465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047392736,0.000026536785,0.00004319092,0.00019757787,0.00031092056,0.0000026451119,0.00091929326,0.6028715,0.012616736,0.00029649056,0.0017611706,0.38090658],"study_design_scores_gemma":[0.00024335107,0.000102551894,0.00008541126,0.00012266237,0.00031392588,0.000041231506,0.00025765406,0.92710286,0.049481887,0.0004016055,0.021516206,0.00033064515],"about_ca_topic_score_codex":0.000015492667,"about_ca_topic_score_gemma":8.583255e-7,"teacher_disagreement_score":0.38057593,"about_ca_system_score_codex":0.0000658816,"about_ca_system_score_gemma":0.000068446476,"threshold_uncertainty_score":0.999959},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36245784,0.00008232364,0.6342462,0.000010299137,0.0002998201,0.0002532424,0.00009846562,0.0020382458,0.0005136045],"genre_scores_gemma":[0.9980166,0.000038739938,0.0014622052,0.00001062476,0.00006708948,0.000002750038,0.00020273932,0.00007975911,0.00011949116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867547,0.000064760156,0.00014909601,0.00069759344,0.00007365349,0.00033941344],"domain_scores_gemma":[0.998868,0.000033703047,0.00005686976,0.0007632791,0.00010798672,0.00017017264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008208861,0.00041166434,0.00035458503,0.0002602246,0.00006533456,0.00011900505,0.00046081995,0.00024687036,0.000028694569],"category_scores_gemma":[0.0000038869725,0.0004202303,0.000103354505,0.00048001055,0.000056067925,0.0000876386,0.00034663046,0.0007849595,0.000028920513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035410325,0.000040025392,0.000018118477,0.000065659726,0.0002707366,0.00045132675,0.00008267092,0.9917243,0.0007043407,0.005633607,0.0007693472,0.0002044676],"study_design_scores_gemma":[0.00019045,0.00008563752,0.000087047614,0.00029406408,0.00029284428,0.000011414548,0.000080352125,0.97559625,0.0029111041,0.019759674,0.00015553873,0.00053559407],"about_ca_topic_score_codex":0.00009304583,"about_ca_topic_score_gemma":0.000030337369,"teacher_disagreement_score":0.6355587,"about_ca_system_score_codex":0.0002722306,"about_ca_system_score_gemma":0.000053990225,"threshold_uncertainty_score":0.99982494},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061424527,0.0018641386,0.9356441,0.00011696657,0.00007908607,0.00012068062,0.00000876613,0.00014672463,0.00059503596],"genre_scores_gemma":[0.9805673,0.0009330933,0.018286033,0.00004682164,0.00007715203,0.000014802387,0.000008765037,0.000016830332,0.000049214905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.000049788956,0.00030170023,0.00012096644,0.000091972805,0.00009260884],"domain_scores_gemma":[0.9994549,0.00014635707,0.00007986341,0.00011550408,0.00012469784,0.00007865671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030767635,0.00010863496,0.00019626098,0.00024580603,0.000089253466,0.00010027172,0.00008219856,0.00006488581,0.000048950165],"category_scores_gemma":[0.000023894507,0.00009632748,0.00007403352,0.00053563964,0.00007908875,0.00018194674,0.000021445088,0.00015550472,0.0000012432208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022940336,0.00016529328,0.001985043,0.00036575377,0.0034845946,0.00003434666,0.002071249,0.6615563,0.033367954,0.25454423,0.0014084687,0.040787365],"study_design_scores_gemma":[0.00035047083,0.00007819781,0.0012966311,0.0001288628,0.0015348565,0.0001427515,0.00027479458,0.9373457,0.014143855,0.035071045,0.009232825,0.00040003352],"about_ca_topic_score_codex":0.000001668644,"about_ca_topic_score_gemma":0.0000010496898,"teacher_disagreement_score":0.9191428,"about_ca_system_score_codex":0.000014913887,"about_ca_system_score_gemma":0.000019613617,"threshold_uncertainty_score":0.39281207},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033922564,0.0017231099,0.9622165,0.0003336636,0.0002913449,0.0003365965,0.0000059146364,0.0007018072,0.00046848675],"genre_scores_gemma":[0.92441016,0.00017677649,0.07506064,0.000093414914,0.000105532694,0.000046560628,0.00002745868,0.000034851033,0.000044605767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995267,0.000008583447,0.00013814113,0.00016338131,0.00004803188,0.00011518006],"domain_scores_gemma":[0.9997853,0.00006365931,0.000020987763,0.00006991032,0.000028804938,0.000031335778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006850135,0.00009864591,0.000088903085,0.000093838134,0.00007529656,0.00022235945,0.000026931368,0.0000385212,0.0000069088123],"category_scores_gemma":[0.000024488589,0.000101659396,0.000018864625,0.00007733922,0.000028748747,0.0003126332,0.000016616585,0.000079009194,0.0000012047151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034691224,0.000069922375,0.0039136405,0.0064218636,0.00058727915,0.00006511838,0.023766108,0.06229416,0.20607238,0.21275635,0.017368015,0.4666505],"study_design_scores_gemma":[0.000099030694,0.000010398962,0.000036148987,0.0006711731,0.000023621125,0.000016631617,0.000068413865,0.9176212,0.0060350797,0.07314395,0.0021501833,0.00012414936],"about_ca_topic_score_codex":0.000015098811,"about_ca_topic_score_gemma":0.000003515119,"teacher_disagreement_score":0.8904876,"about_ca_system_score_codex":0.000017204984,"about_ca_system_score_gemma":0.0000061669402,"threshold_uncertainty_score":0.41455498},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019170519,0.00041625075,0.95800096,0.00019019078,0.00023067984,0.00031067332,0.0000081163835,0.0038515166,0.017821074],"genre_scores_gemma":[0.96742135,0.000008529618,0.03190868,0.000084029554,0.000075270415,0.000033026958,0.00000587649,0.000059892227,0.00040335362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938875,0.0000058766386,0.00010233077,0.00019314814,0.00009275293,0.0002171224],"domain_scores_gemma":[0.999663,0.000087314846,0.000008760476,0.00016546722,0.000034745328,0.000040715302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000070466755,0.00014710851,0.00013188907,0.00010220555,0.0000516694,0.000096108335,0.000082856546,0.000051949322,0.0000386397],"category_scores_gemma":[0.000006174421,0.0001184689,0.000055252374,0.00014044358,0.000026282241,0.000095525065,0.000012071643,0.00011880828,0.000011664474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005334135,0.000084955354,0.00024124644,0.0006688441,0.0008341743,0.0004258892,0.0011343213,0.38491124,0.15423083,0.21141939,0.19818124,0.04733447],"study_design_scores_gemma":[0.00016273225,0.00010307572,0.000012553713,0.0003212186,0.000030156689,0.000005795812,0.00009009652,0.8561406,0.1272699,0.001096151,0.014551755,0.00021594265],"about_ca_topic_score_codex":0.00001444962,"about_ca_topic_score_gemma":0.000018491435,"teacher_disagreement_score":0.94825083,"about_ca_system_score_codex":0.00004669512,"about_ca_system_score_gemma":0.000021855283,"threshold_uncertainty_score":0.48310217},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32943037,0.0032803097,0.3180023,0.00032060608,0.0006814805,0.00043551018,0.00000767757,0.02071966,0.3271221],"genre_scores_gemma":[0.97881275,0.000041115665,0.020632504,0.00008976088,0.00008459584,0.000011959898,0.0000034035186,0.00006220552,0.00026167548],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994223,0.000007785126,0.00010145987,0.0001651897,0.0001084129,0.00019483658],"domain_scores_gemma":[0.99971724,0.000025081828,0.0000061573246,0.00019223546,0.000011869113,0.00004743868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000039190076,0.00014743429,0.000118960605,0.00008248961,0.000032018772,0.00013843359,0.000081104045,0.000049887643,0.000046338566],"category_scores_gemma":[0.000001588735,0.000109337016,0.00003747829,0.00017136341,0.000026777378,0.00015488057,0.000019704514,0.00016485163,0.000030380123],"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.000069500784,0.000113942246,0.00039179946,0.0011817708,0.000903048,0.0025166771,0.0020217565,0.00869583,0.71129,0.05175818,0.11290311,0.10815439],"study_design_scores_gemma":[0.00015880335,0.00006600082,0.00047529605,0.000807631,0.000063376596,0.000092418246,0.00009422852,0.41389525,0.5587552,0.0017015035,0.023257593,0.0006326876],"about_ca_topic_score_codex":0.000007330557,"about_ca_topic_score_gemma":0.0000026321545,"teacher_disagreement_score":0.6493824,"about_ca_system_score_codex":0.000027910235,"about_ca_system_score_gemma":0.000014999759,"threshold_uncertainty_score":0.4458634},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011098576,0.0018867798,0.93670815,0.0009387823,0.0020074907,0.0010534425,0.00076581514,0.0122260805,0.03331487],"genre_scores_gemma":[0.94567186,0.000027614602,0.051675133,0.00025064987,0.00024546994,0.000053882002,0.00032890492,0.00009143743,0.0016550771],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934405,0.0000043582922,0.00010866262,0.00024350887,0.00007570324,0.00022368738],"domain_scores_gemma":[0.9992429,0.00021200838,0.000006080509,0.00047844162,0.000020399688,0.000040152117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008022942,0.0001324052,0.000109425964,0.00008301566,0.000043729306,0.00010026133,0.00022780131,0.000045937693,0.000043060376],"category_scores_gemma":[0.000024467166,0.00011129795,0.00003756174,0.00012021855,0.00001584048,0.00010082277,0.000034799144,0.00008496967,0.0000637943],"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.000013317687,0.00009087662,0.000053723063,0.00016475815,0.000104953644,0.00004687631,0.00004774644,0.022681195,0.021413803,0.0022839783,0.9029051,0.050193638],"study_design_scores_gemma":[0.00007823132,0.00006142528,0.000013770861,0.00010382128,0.000014421065,0.0000021459703,0.000010939506,0.8141478,0.11175154,0.00034952327,0.07333263,0.00013374985],"about_ca_topic_score_codex":0.000019289942,"about_ca_topic_score_gemma":0.000013151902,"teacher_disagreement_score":0.93457323,"about_ca_system_score_codex":0.00002356475,"about_ca_system_score_gemma":0.000014174678,"threshold_uncertainty_score":0.45385987},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003371363,0.00019392715,0.9954346,0.000056630215,0.000054515524,0.00014663115,0.000014777258,0.0005999603,0.0001276079],"genre_scores_gemma":[0.9983849,0.00026726894,0.0010031647,0.000036374055,0.000020697033,0.0000595893,0.000008300018,0.000025120857,0.00019460006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.000016653294,0.0001641877,0.00023253165,0.000117874035,0.00011982885],"domain_scores_gemma":[0.9996774,0.000049394017,0.000012763375,0.00016510907,0.000028442028,0.00006686761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004437239,0.00014794421,0.00015290757,0.00043413107,0.000090816626,0.00012347159,0.00007375436,0.00003800574,0.00008261878],"category_scores_gemma":[4.3240402e-7,0.00012447736,0.00007280265,0.0008551518,0.000011529079,0.000073229225,9.789887e-7,0.00020111856,0.000042392363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038725157,0.000020231548,0.00014564295,0.000035420355,0.00045072075,0.0000068064155,0.00022435833,0.6725412,0.0027264867,0.000094434254,0.0000126506075,0.3237382],"study_design_scores_gemma":[0.000021155098,0.00010972983,0.00015930727,0.00009678932,0.000691865,0.0000112841735,0.00009597125,0.72067696,0.2764274,0.000117333475,0.0012934584,0.00029877675],"about_ca_topic_score_codex":0.00019236293,"about_ca_topic_score_gemma":0.00041779695,"teacher_disagreement_score":0.99501354,"about_ca_system_score_codex":0.000027906217,"about_ca_system_score_gemma":0.0000046920377,"threshold_uncertainty_score":0.50760394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83977634,0.0014714487,0.14269151,0.00016924352,0.0030471268,0.0017917486,0.0007730439,0.0038748116,0.006404736],"genre_scores_gemma":[0.9949348,0.00041045828,0.0031388924,0.000018079909,0.00012960203,0.0000027502083,0.00011949323,0.000053000524,0.001192899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989171,0.000023110635,0.00016679295,0.00060823647,0.00005128983,0.00023345379],"domain_scores_gemma":[0.99921405,0.000059858816,0.000055863336,0.00042530056,0.00015895473,0.000085985106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011145776,0.00027589334,0.00026797212,0.00018326248,0.000075939046,0.00008901939,0.00023107692,0.00026779354,0.0000030173921],"category_scores_gemma":[0.000025577985,0.00032796935,0.00009359105,0.00018508165,0.00007141549,0.000068065536,0.00042151613,0.00044106343,0.000011359888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011443361,0.0002647241,0.0007170071,0.0039928616,0.0019893984,0.001993118,0.002239428,0.75682825,0.0018289849,0.09176191,0.12139792,0.015842075],"study_design_scores_gemma":[0.00049235136,0.00007286528,0.00032598426,0.0003423515,0.00019979996,0.000009599585,0.000059735703,0.8582759,0.0018107224,0.1315542,0.00629187,0.000564657],"about_ca_topic_score_codex":0.00006591734,"about_ca_topic_score_gemma":0.000027134967,"teacher_disagreement_score":0.15515849,"about_ca_system_score_codex":0.00011176866,"about_ca_system_score_gemma":0.000058938578,"threshold_uncertainty_score":0.9999172},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7679362,0.015109135,0.1471631,0.0010438315,0.0050973524,0.0005447039,0.000049901737,0.014020519,0.049035225],"genre_scores_gemma":[0.9958398,0.00037487634,0.0015444871,0.00009797317,0.000248331,0.000013092832,0.00001241378,0.000078204364,0.0017908275],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922866,0.000014970799,0.00016719327,0.00020214755,0.00013487377,0.00025213757],"domain_scores_gemma":[0.99958384,0.000051756128,0.00001003168,0.00027748698,0.0000186693,0.00005823544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064633896,0.00017036292,0.0001575414,0.000116983414,0.000037874306,0.00009878572,0.00012661485,0.00011451388,0.00018304383],"category_scores_gemma":[0.000006424035,0.0001645939,0.00010790978,0.0001932225,0.00002394674,0.0001223567,0.000032450793,0.00020723291,0.0005075648],"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.00009872279,0.00013817316,0.00028181542,0.0007000561,0.0008681462,0.0008328943,0.00078181986,0.13158771,0.120435365,0.014775932,0.6415303,0.087969095],"study_design_scores_gemma":[0.00060837396,0.00027456693,0.0011064489,0.002281397,0.00022006915,0.0002273666,0.00021959405,0.2130919,0.3505108,0.042703584,0.38665068,0.0021052205],"about_ca_topic_score_codex":0.000026375781,"about_ca_topic_score_gemma":0.00001324773,"teacher_disagreement_score":0.2548796,"about_ca_system_score_codex":0.00007375513,"about_ca_system_score_gemma":0.000019452895,"threshold_uncertainty_score":0.6711945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8316456,0.0024227481,0.105393216,0.00006619852,0.0038220745,0.0006577394,0.00011873592,0.009079015,0.046794664],"genre_scores_gemma":[0.99666363,0.0006895864,0.00085444783,0.00003800586,0.0002248212,0.0000014316623,0.000027638507,0.00009827794,0.0014021825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.000040518826,0.0001947028,0.0006903221,0.000071231996,0.00036608448],"domain_scores_gemma":[0.9988592,0.000039441515,0.000057537574,0.0008194106,0.000083034705,0.0001413298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008446928,0.000437465,0.00042248363,0.0003906323,0.000057233978,0.000104995,0.00053903874,0.0004126395,0.000050682826],"category_scores_gemma":[0.0000085792735,0.00051901914,0.0003323829,0.00036967476,0.000094722425,0.000064176325,0.00083953247,0.0011145812,0.00022798199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006139828,0.00013345169,0.00051518076,0.0006438178,0.0015165312,0.0068119196,0.00048193405,0.8772862,0.0016436112,0.055108547,0.047300495,0.008496934],"study_design_scores_gemma":[0.000350485,0.00005753973,0.00018363446,0.0008563115,0.0004675384,0.000034101296,0.00011796254,0.68591374,0.0047114925,0.29939055,0.006575925,0.0013407249],"about_ca_topic_score_codex":0.000108596825,"about_ca_topic_score_gemma":0.000026122882,"teacher_disagreement_score":0.244282,"about_ca_system_score_codex":0.00012719561,"about_ca_system_score_gemma":0.000042569023,"threshold_uncertainty_score":0.9997261},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016671965,0.0014010603,0.9755533,0.0014928617,0.00029368684,0.00048076658,0.000018135957,0.0022873692,0.0018008862],"genre_scores_gemma":[0.88925415,0.00017221652,0.109848425,0.0004360702,0.00004252055,0.000061904946,0.0000962706,0.000065400054,0.000023067048],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992633,0.000059316728,0.00021309161,0.00017396196,0.00008435157,0.00020598185],"domain_scores_gemma":[0.99832976,0.0003479811,0.000022007052,0.0012260907,0.0000366966,0.000037440117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012224245,0.0001621335,0.00018475488,0.00017399012,0.00016966986,0.0002733249,0.0008199262,0.000060989372,0.000001918816],"category_scores_gemma":[0.000009950062,0.00016946762,0.00011453107,0.00023567927,0.000101571895,0.00017208926,0.000094142975,0.00024863298,0.000006112679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028711389,0.00004137307,0.000008484987,0.00022196848,0.00036793132,0.0000059016957,0.0007443702,0.24767676,0.6483884,0.0003973523,0.07935216,0.02276662],"study_design_scores_gemma":[0.00026382972,0.000003875857,0.000013742076,0.00010666096,0.00004784672,0.00001116055,0.000020034251,0.9683979,0.011833799,0.00017201339,0.018928327,0.00020080643],"about_ca_topic_score_codex":0.000017863735,"about_ca_topic_score_gemma":0.0000058570145,"teacher_disagreement_score":0.87258214,"about_ca_system_score_codex":0.00007001193,"about_ca_system_score_gemma":0.0000091844295,"threshold_uncertainty_score":0.6910689},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08285635,0.30030832,0.07099755,0.0049658567,0.02208117,0.028624464,0.0035122647,0.17179236,0.31486169],"genre_scores_gemma":[0.8466082,0.0033759167,0.010031018,0.00003593274,0.00095037726,0.0008916307,0.0008654473,0.0007797981,0.13646163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978441,0.000006062671,0.0008234464,0.00064989115,0.00026756123,0.00040892177],"domain_scores_gemma":[0.998271,0.00007503289,0.0002921803,0.0006635681,0.00066997454,0.000028272707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021524903,0.0006930196,0.0007515978,0.0011883593,0.0002315757,0.00024881374,0.0002909195,0.00092839426,0.0000070166475],"category_scores_gemma":[0.000046212594,0.00056590134,0.0001096281,0.00037685366,0.00021376442,0.00016823075,0.00018178565,0.00063024426,0.000022131935],"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.000057436453,0.000048181108,0.00026908005,0.0051397947,0.0010776584,0.00009509288,0.00027664605,0.00024422538,0.016414138,0.82375693,0.100452,0.052168798],"study_design_scores_gemma":[0.00047297933,0.00020430176,0.000017712024,0.009950303,0.00018012873,0.00012732603,0.00043761567,0.06652612,0.0115558375,0.054976955,0.85419554,0.001355201],"about_ca_topic_score_codex":0.000028008946,"about_ca_topic_score_gemma":0.000019984618,"teacher_disagreement_score":0.76878,"about_ca_system_score_codex":0.00009444933,"about_ca_system_score_gemma":0.00003321032,"threshold_uncertainty_score":0.99967927},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09356938,0.0004952885,0.9037929,0.000038152542,0.0000927528,0.00016155984,0.000006418467,0.001394232,0.00044932606],"genre_scores_gemma":[0.93730116,0.000043467753,0.062494576,0.000016614576,0.000035101606,0.000030018355,0.0000052856617,0.000056224224,0.000017565944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992276,0.000008186506,0.00020318701,0.00021857145,0.00012846924,0.00021400121],"domain_scores_gemma":[0.99950415,0.0002364861,0.000009443633,0.0001406501,0.000016439786,0.00009283506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010744657,0.00020967422,0.00020779968,0.000108643326,0.00004994163,0.00009531188,0.00005055649,0.00008953402,0.000011242065],"category_scores_gemma":[0.000014840572,0.00019148889,0.0000363305,0.00009551769,0.000038571492,0.00006301002,0.000016629334,0.00021929313,0.000011396933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003993862,0.000013345627,3.4095086e-7,0.000682733,0.000023644136,0.000006605312,0.00023726006,0.9823779,0.005635328,0.009893402,0.000052314113,0.0010731572],"study_design_scores_gemma":[0.000090362744,0.000047271777,0.000003832913,0.0008954414,0.000017766031,0.00000903192,0.0000045850666,0.97145116,0.0047722864,0.022356728,0.0001290736,0.000222469],"about_ca_topic_score_codex":0.0000018490714,"about_ca_topic_score_gemma":1.1402485e-7,"teacher_disagreement_score":0.84373176,"about_ca_system_score_codex":0.000023929293,"about_ca_system_score_gemma":0.0000054906823,"threshold_uncertainty_score":0.780869},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8840863,0.011328148,0.088972375,0.0047006104,0.008915097,0.00031820478,0.000017332504,0.00063306483,0.0010288513],"genre_scores_gemma":[0.9895595,0.00029095786,0.009170672,0.000105777006,0.00078982254,0.0000021665844,3.2244048e-7,0.000034580797,0.000046219495],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99952954,0.000011664071,0.00017155675,0.00004943877,0.00013019123,0.00010763054],"domain_scores_gemma":[0.9994587,0.00007888105,0.00004340873,0.00033484693,0.0000533794,0.00003081185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013135165,0.00008246,0.000115788906,0.000057891106,0.000038213075,0.000053754477,0.0005079861,0.00004543857,0.0000018157202],"category_scores_gemma":[0.00008983337,0.000046677815,0.00017614552,0.00009091745,0.000014241021,0.00009545508,0.000100172445,0.00020015532,0.000004066484],"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.000009548761,0.000007806835,0.000009727683,0.000031763502,0.00007055767,0.000021567523,0.000098787794,0.0020143092,0.6195954,0.000053569896,0.27388108,0.10420586],"study_design_scores_gemma":[0.00009965278,0.0000401547,0.00007585778,0.0006719574,0.000044674653,0.0001787966,0.00001547306,0.019098647,0.9416198,0.010326883,0.027750228,0.00007788564],"about_ca_topic_score_codex":3.3687934e-7,"about_ca_topic_score_gemma":3.4716555e-7,"teacher_disagreement_score":0.32202438,"about_ca_system_score_codex":0.00003368629,"about_ca_system_score_gemma":0.00001538045,"threshold_uncertainty_score":0.1903466},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004902343,0.0017790773,0.9926582,0.0000633038,0.00013815297,0.000056300654,0.000028600136,0.00008391831,0.00029007765],"genre_scores_gemma":[0.934203,0.000054286375,0.06560361,0.00005045606,0.00006724713,0.0000041630074,0.000005274182,0.000009713846,0.0000022504817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952,0.0000140924385,0.00018691261,0.00006546682,0.00010280752,0.0001106976],"domain_scores_gemma":[0.9985846,0.0012244681,0.000027944068,0.000054013108,0.000058375645,0.000050543713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015305508,0.000083342085,0.00012970556,0.000091365735,0.00006532,0.00012534746,0.000076543234,0.000037153557,0.0000041566764],"category_scores_gemma":[0.00006809779,0.00005347012,0.00004247625,0.00008156285,0.00005757636,0.00006150044,0.0000060329135,0.00021494657,3.177886e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046995695,0.00020513994,0.003362796,0.0011853272,0.0011868873,0.00045422788,0.0016901392,0.5654952,0.017480576,0.13757816,0.1542126,0.116679005],"study_design_scores_gemma":[0.00018802927,0.00018028097,0.0016245354,0.00036714075,0.00008373413,0.00005165561,0.000048317157,0.97745806,0.0010188897,0.017497493,0.0013643329,0.0001175265],"about_ca_topic_score_codex":0.0000026591645,"about_ca_topic_score_gemma":1.6974215e-7,"teacher_disagreement_score":0.92930067,"about_ca_system_score_codex":0.000009101529,"about_ca_system_score_gemma":0.000021322618,"threshold_uncertainty_score":0.21804483},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007166707,0.00028325678,0.99618006,0.000105752755,0.00057835056,0.00062123337,0.000015283442,0.000709052,0.0007903389],"genre_scores_gemma":[0.17036264,0.00040199715,0.8285296,0.000030263052,0.0003864481,0.00007428873,0.000050653543,0.00010005058,0.000064071435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888605,0.00006508936,0.00030089464,0.00024540286,0.00024550594,0.0002570787],"domain_scores_gemma":[0.99933136,0.00009698338,0.00009212726,0.00013981308,0.00024591965,0.00009377351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023058898,0.00023447572,0.00020402014,0.0003585905,0.00016528738,0.00023767861,0.000094254065,0.0001129569,0.000022803953],"category_scores_gemma":[0.000028431325,0.00019292976,0.00008702344,0.00034833458,0.00002306712,0.0004010428,0.000009507666,0.00033077542,0.0000022358006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018766348,0.00003314132,0.0000053005515,0.000023883742,0.00010034566,0.000018186625,0.00012786662,0.9939216,0.00021416665,0.0011248029,0.0012877466,0.002955327],"study_design_scores_gemma":[0.00048941805,0.0007944941,0.000013387828,0.00038657078,0.000081307146,0.00010672511,0.000071790935,0.992211,0.004516396,0.000102988895,0.0009915839,0.00023432812],"about_ca_topic_score_codex":0.0000030748502,"about_ca_topic_score_gemma":0.0000011864532,"teacher_disagreement_score":0.16964597,"about_ca_system_score_codex":0.00023027876,"about_ca_system_score_gemma":0.000062724066,"threshold_uncertainty_score":0.7867447},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005573892,0.00007280447,0.9926704,0.000027989247,0.00018180368,0.00014500257,0.00007242982,0.00044807605,0.00080757093],"genre_scores_gemma":[0.5348046,0.00001868567,0.4649136,0.0000108683635,0.000033055687,0.000008414946,0.00018738917,0.000010841385,0.000012583892],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993635,0.000012259317,0.000120095625,0.00023531336,0.0001366987,0.0001321331],"domain_scores_gemma":[0.9992725,0.00009259051,0.000017332946,0.0005149999,0.00006681365,0.000035747667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004884964,0.000059664708,0.00007025445,0.0001619653,0.00013858908,0.0001747943,0.0006335875,0.000017112105,0.000022440305],"category_scores_gemma":[0.000077043274,0.000058672147,0.000014628782,0.00046059114,0.00013482606,0.0016776604,0.00011049757,0.000073562405,0.000007450613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027882656,0.000030997937,0.00009483173,0.00013875628,0.000035541998,0.0000014162315,0.0007725964,0.12318147,0.69733775,0.034553792,0.0033815452,0.14046854],"study_design_scores_gemma":[0.00002807286,0.000025962217,0.00010829744,0.000043630283,0.000010537282,0.0000023302107,0.000031051466,0.9358771,0.003127319,0.002125296,0.058549967,0.00007046921],"about_ca_topic_score_codex":0.00004901022,"about_ca_topic_score_gemma":0.000050524697,"teacher_disagreement_score":0.8126956,"about_ca_system_score_codex":0.000023692228,"about_ca_system_score_gemma":0.000039915074,"threshold_uncertainty_score":0.23925807},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027649493,0.00019222105,0.9816338,0.00012741057,0.00034877792,0.00030496763,0.000006577332,0.006257948,0.0083633615],"genre_scores_gemma":[0.9445745,0.000032876538,0.05475019,0.000055843564,0.00026510647,0.000049514867,0.00001400012,0.00003668711,0.00022133016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996033,0.0000032874236,0.00010640718,0.00012595023,0.000038619135,0.00012248811],"domain_scores_gemma":[0.99979085,0.000028295854,0.000005366549,0.00013069456,0.00002713244,0.000017687476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041640385,0.000095847805,0.00008376336,0.00005938635,0.000023432067,0.00006246307,0.000054383352,0.00007037898,0.000022228336],"category_scores_gemma":[0.000004983398,0.00008544037,0.000054635602,0.00006251838,0.000009876799,0.000110470195,0.000012848341,0.0000585462,0.0000072818484],"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.0000071612685,0.000008925531,0.0000058828955,0.00006945741,0.0000526429,0.0000022882414,0.000085378466,0.0003892094,0.40304947,0.0069690966,0.04669376,0.54266673],"study_design_scores_gemma":[0.000021834172,0.000024065006,0.000024707808,0.000032024134,0.0000064200613,0.0000018553069,0.0000019577558,0.5923224,0.3636396,0.007842235,0.03599241,0.000090469526],"about_ca_topic_score_codex":0.00004387308,"about_ca_topic_score_gemma":0.000014774967,"teacher_disagreement_score":0.9418095,"about_ca_system_score_codex":0.000029375236,"about_ca_system_score_gemma":0.000006032726,"threshold_uncertainty_score":0.3484157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027187429,0.0010086253,0.9933773,0.000115120216,0.0009497009,0.00029081653,0.0000050164313,0.00033649374,0.0038896818],"genre_scores_gemma":[0.7799485,0.00016001597,0.21759711,0.000559778,0.0013766224,0.000016836577,0.000009401027,0.00008448981,0.0002472785],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905586,0.0000036557428,0.00016523675,0.0004057092,0.00013668038,0.00023283121],"domain_scores_gemma":[0.9994685,0.00018475826,0.000033953052,0.00021615895,0.000050750474,0.000045887184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010681511,0.00022437646,0.00021507422,0.00016155164,0.000066027846,0.00014523267,0.00019403145,0.00019381888,0.0000022496795],"category_scores_gemma":[0.000008487816,0.00021143927,0.000043231816,0.000099336656,0.00043007996,0.000089839945,0.00010215841,0.0002986956,0.0000014632059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010063499,0.0000029368732,0.0000071365776,0.000077542514,0.000037438796,0.000077671604,0.00029747654,0.353348,0.00020789537,0.088056535,0.0015067218,0.5563706],"study_design_scores_gemma":[0.00003931709,0.000042492313,0.000002545327,0.0004807099,0.000008785729,0.00003392994,8.374887e-8,0.6948455,0.0007217362,0.3018959,0.0017374251,0.00019156352],"about_ca_topic_score_codex":0.000002013815,"about_ca_topic_score_gemma":0.000017102668,"teacher_disagreement_score":0.7799213,"about_ca_system_score_codex":0.00007061474,"about_ca_system_score_gemma":0.0000475918,"threshold_uncertainty_score":0.86222434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2987722,0.00029413291,0.69592017,0.00001480671,0.0005814815,0.0003723207,0.00004609955,0.0017219599,0.0022768627],"genre_scores_gemma":[0.9894962,0.00009902504,0.009730812,0.000010298471,0.00018817167,0.000004323444,0.00006267372,0.000065515276,0.00034301556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910337,0.0000147239425,0.0001403064,0.00046336677,0.0000410865,0.00023715536],"domain_scores_gemma":[0.9993585,0.000056109133,0.000045706296,0.00040210286,0.00007910367,0.000058506655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007598345,0.0002635399,0.00023944295,0.00021503276,0.00006173226,0.00008779549,0.00028444408,0.00026917583,0.000014058196],"category_scores_gemma":[0.000012509181,0.00032288628,0.0002016086,0.00015072772,0.000035888897,0.00006600999,0.00034451627,0.00043118346,0.00003771011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017547894,0.000010370033,0.000011283425,0.0002915192,0.00010935352,0.000022416754,0.000085218366,0.9794745,0.00058890413,0.016765079,0.0017266662,0.0008971699],"study_design_scores_gemma":[0.00011317402,0.000020374175,0.000017832837,0.00030742525,0.00013515574,0.000002332003,0.000067664696,0.9412681,0.0038293498,0.052166354,0.0017193616,0.00035288985],"about_ca_topic_score_codex":0.000019972476,"about_ca_topic_score_gemma":0.0000058883247,"teacher_disagreement_score":0.69072396,"about_ca_system_score_codex":0.00014235219,"about_ca_system_score_gemma":0.000031750493,"threshold_uncertainty_score":0.99992234},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5811942,0.00021923555,0.41549236,0.000023301509,0.00024628305,0.0005640756,0.000036356756,0.0009157335,0.0013084196],"genre_scores_gemma":[0.99627566,0.00042018166,0.0028729155,0.0000147108785,0.00009039976,0.0000031756388,0.00013373671,0.000056295652,0.00013294925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989648,0.000032333133,0.00014795587,0.0005702506,0.00007076081,0.00021390877],"domain_scores_gemma":[0.99926066,0.000051020448,0.00008311995,0.00041050673,0.00011677782,0.00007791359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008228974,0.00030114234,0.00031176137,0.0002353447,0.00010558602,0.000085518644,0.00020054934,0.0002885,0.000007430128],"category_scores_gemma":[0.0000061556625,0.000320125,0.000079068195,0.00021182893,0.000069696005,0.0001268284,0.00030467476,0.00038308732,0.0000067973147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044749764,0.00022352624,0.0014287219,0.0030837315,0.0006524486,0.00013652981,0.0005637998,0.9208597,0.009839816,0.057430588,0.0033499398,0.0019836829],"study_design_scores_gemma":[0.00039781717,0.00006653043,0.0003779615,0.0011908337,0.00028321077,0.000003917509,0.000033632856,0.9545549,0.015683668,0.026573423,0.0003618151,0.00047225587],"about_ca_topic_score_codex":0.000034195917,"about_ca_topic_score_gemma":0.000029082787,"teacher_disagreement_score":0.41508138,"about_ca_system_score_codex":0.000101429134,"about_ca_system_score_gemma":0.000028859764,"threshold_uncertainty_score":0.9999251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064663063,0.0012071485,0.97872055,0.00033687107,0.00076343,0.00041015053,0.000011139036,0.004431631,0.0076527665],"genre_scores_gemma":[0.9057436,0.00006693405,0.091381416,0.00018521109,0.00024864418,0.00011347174,0.000019236739,0.00013403247,0.002107478],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000039104325,0.0001831472,0.00023535354,0.00013527856,0.00023487664],"domain_scores_gemma":[0.9996004,0.00006807202,0.000014401833,0.000219723,0.000033638004,0.00006377814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015107129,0.00018468684,0.0001785033,0.00015935092,0.00003966717,0.00013750042,0.00011787888,0.0000936967,0.00008152752],"category_scores_gemma":[0.00001466725,0.00017031547,0.00007972824,0.00025223492,0.00003128743,0.00016719208,0.000039158484,0.00023438185,0.00014958858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020414958,0.000034429737,0.0000035231637,0.00034841374,0.00039000894,0.00019699395,0.0034802025,0.17074828,0.6515278,0.013838907,0.12764925,0.03176173],"study_design_scores_gemma":[0.0001580107,0.000034481076,0.0000055608443,0.00048175897,0.000039941955,0.000047201815,0.000024765312,0.90248483,0.03561619,0.018480727,0.04235649,0.00027006405],"about_ca_topic_score_codex":0.000030776522,"about_ca_topic_score_gemma":0.000009729842,"teacher_disagreement_score":0.89927727,"about_ca_system_score_codex":0.00006047106,"about_ca_system_score_gemma":0.000020735017,"threshold_uncertainty_score":0.6945263},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009964388,0.00044215316,0.99801874,0.00022431025,0.000081837505,0.0000486114,0.000034345034,0.00005627492,0.00009731363],"genre_scores_gemma":[0.08885076,0.00015722578,0.9100116,0.00005462514,0.00077300164,0.0000012908166,0.000048620714,0.000018612627,0.00008429906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994159,0.000009855429,0.0002513162,0.00008723807,0.00015497733,0.00008076821],"domain_scores_gemma":[0.9995171,0.00009428929,0.00006252877,0.000052076346,0.00020045272,0.000073589224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001338914,0.000093990915,0.00021460789,0.0003197885,0.000033187687,0.00006952829,0.00005117682,0.000049693663,0.00006495109],"category_scores_gemma":[0.000012394409,0.00007151094,0.00013821467,0.00038300664,0.000021041438,0.00014489068,0.000006093148,0.0001026031,7.2493987e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002676674,0.000030524137,0.00013404475,0.000022407628,0.003791507,0.0000302284,0.00015521194,0.9355593,0.00021680187,0.0004148697,0.0015280466,0.058090314],"study_design_scores_gemma":[0.0002435916,0.000082075385,0.00020097289,0.000052753025,0.0010068059,0.00006845346,0.000014691543,0.9958964,0.00023178692,0.00023255553,0.0018801865,0.000089712055],"about_ca_topic_score_codex":0.0000057069483,"about_ca_topic_score_gemma":0.0000037739283,"teacher_disagreement_score":0.088007145,"about_ca_system_score_codex":0.000022134376,"about_ca_system_score_gemma":0.000084818246,"threshold_uncertainty_score":0.29161316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9539596,0.0040012226,0.030643104,0.0044536116,0.00036969528,0.00046279182,0.000001388371,0.00008628398,0.006022329],"genre_scores_gemma":[0.98121774,0.0017662003,0.01684698,0.00008417788,0.000012725782,0.0000054481343,7.9630456e-7,0.000010012637,0.000055902903],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993821,0.00014522478,0.00026056793,0.000055112443,0.00006348243,0.00009353853],"domain_scores_gemma":[0.99907416,0.00020599196,0.00014278622,0.00044517577,0.000110589666,0.000021291647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041158037,0.00007858953,0.00015160881,0.000041718635,0.0002652648,0.00008942203,0.0009982545,0.000060107308,0.0000018906942],"category_scores_gemma":[0.00004107811,0.00006740032,0.000081491955,0.0002496523,0.000088578876,0.0002479419,0.00034032325,0.0006184158,5.640812e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091539885,0.00032431848,0.030467173,0.00010759429,0.0014848703,0.000006759859,0.035817984,0.11920309,0.18109763,0.0019971982,0.011268645,0.6181332],"study_design_scores_gemma":[0.0022662955,0.00009577972,0.054793864,0.0025809752,0.00025665804,0.00010951589,0.0072237076,0.7724566,0.12160356,0.021167811,0.016858434,0.000586825],"about_ca_topic_score_codex":0.000040041956,"about_ca_topic_score_gemma":0.000046699777,"teacher_disagreement_score":0.6532535,"about_ca_system_score_codex":0.00011343343,"about_ca_system_score_gemma":0.000029013301,"threshold_uncertainty_score":0.27485052},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008483324,0.0024655312,0.9881256,0.00019370695,0.00013130599,0.00015216527,0.00010530596,0.00019826773,0.00014479074],"genre_scores_gemma":[0.98243856,0.00006112202,0.016802661,0.00021318758,0.000117286305,0.000011922868,0.0001783116,0.000029978262,0.0001469542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986359,0.00009332698,0.0003992175,0.00038127197,0.0002244757,0.000265832],"domain_scores_gemma":[0.9978609,0.0010464245,0.00016268,0.00075003464,0.00012899215,0.00005095841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011096046,0.00021958504,0.0003324485,0.00020211237,0.0006082873,0.00024196747,0.000708317,0.000095338146,0.000008145877],"category_scores_gemma":[0.000088431494,0.00014486519,0.00017942379,0.00091359596,0.0001447736,0.0001831216,0.00017821479,0.00021607052,4.5480806e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004949501,0.000050193295,0.00095208175,0.00023170716,0.0027592503,0.0000019716183,0.000107507236,0.1535787,0.007177078,0.002552551,0.0009806423,0.8311134],"study_design_scores_gemma":[0.00025438075,0.000023099556,0.00057877187,0.00027983723,0.0023615367,0.0000016735877,0.000093450784,0.72295314,0.0031598525,0.26887813,0.0011980187,0.00021807224],"about_ca_topic_score_codex":0.00006895239,"about_ca_topic_score_gemma":0.00008726523,"teacher_disagreement_score":0.9739553,"about_ca_system_score_codex":0.000026599122,"about_ca_system_score_gemma":0.0001336899,"threshold_uncertainty_score":0.59074306},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70672053,0.006510883,0.27887568,0.0009967356,0.00022472815,0.000512678,0.000002205831,0.0010480777,0.0051085018],"genre_scores_gemma":[0.9898542,0.0032440608,0.0049123727,0.0017854343,0.0001305907,0.000023014989,0.0000059051404,0.000033522647,0.000010902532],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915886,0.000051669373,0.00021151171,0.00022356259,0.00014573541,0.00020864703],"domain_scores_gemma":[0.9994394,0.00008165175,0.000046984813,0.00035874685,0.000034446344,0.00003874445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094049574,0.00019056986,0.0003431134,0.00008600693,0.00005202825,0.000035134533,0.00016623033,0.000013970473,0.000003732974],"category_scores_gemma":[0.00002071625,0.00016128326,0.0000921302,0.0004070929,0.000046145513,0.000114593415,0.000038842176,0.00018992706,0.000013507619],"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.000007977322,0.000040315314,0.00010917106,0.0011368946,0.00013306989,0.0000034392976,0.000060927963,0.00447385,0.9787328,0.0020223353,0.006822806,0.006456403],"study_design_scores_gemma":[0.0005538446,0.0001448781,0.0037095374,0.05342148,0.0010923976,0.000026017664,0.00007920242,0.20812966,0.7089214,0.0029882388,0.019202141,0.0017312634],"about_ca_topic_score_codex":0.000029964753,"about_ca_topic_score_gemma":0.0000012518832,"teacher_disagreement_score":0.2831337,"about_ca_system_score_codex":0.000103800274,"about_ca_system_score_gemma":0.000011518341,"threshold_uncertainty_score":0.65769404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006348781,0.0011901596,0.9906902,0.0000969279,0.00017721223,0.00009787267,0.0010674641,0.000021579805,0.00030984747],"genre_scores_gemma":[0.76173735,0.00011885398,0.23780912,0.00003265346,0.000092446746,9.677683e-7,0.00011603353,0.000020374851,0.00007218588],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999571,0.000008506399,0.00016136502,0.00007341084,0.000052208434,0.00013351116],"domain_scores_gemma":[0.99941844,0.0001106134,0.000045979985,0.0001508355,0.00016371686,0.00011042663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010450243,0.00007788063,0.00015083393,0.00015314235,0.000069533395,0.000075564196,0.00014281586,0.000029344834,0.000016449683],"category_scores_gemma":[0.00003493881,0.000072566494,0.000008683011,0.00007643932,0.000052842846,0.00006622298,0.000008255903,0.00009299551,0.0000010456658],"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.00011534461,0.000013955269,0.0066979686,0.00017709861,0.0004188361,0.0004373453,0.00019836881,0.004469609,0.0022707179,0.06615653,0.9020157,0.017028555],"study_design_scores_gemma":[0.0030924096,0.0008875122,0.060724735,0.0016593325,0.00069999235,0.0010793125,0.00023259333,0.35648954,0.0028239044,0.043226734,0.527997,0.0010869276],"about_ca_topic_score_codex":0.00029140027,"about_ca_topic_score_gemma":0.0022305562,"teacher_disagreement_score":0.75538856,"about_ca_system_score_codex":0.000051198444,"about_ca_system_score_gemma":0.00016432443,"threshold_uncertainty_score":0.29591757},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4898862e-8,0.6984627,0.29678637,0.0000068950494,0.0005221047,0.00073619577,0.00044061095,0.00041386124,0.0026312328],"genre_scores_gemma":[9.649546e-7,0.9315031,0.06492647,0.00004099656,0.00018399837,0.00009715599,0.0027697608,0.00010395221,0.0003735843],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763846,0.00017568571,0.0012498045,0.00041848497,0.0002410094,0.00027654076],"domain_scores_gemma":[0.9986529,0.0003693727,0.0003103683,0.0004501298,0.00012830687,0.0000889576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016591144,0.0006276209,0.0018236951,0.0003248822,0.00018811914,0.000112982445,0.00047073135,0.000261994,0.00011978165],"category_scores_gemma":[0.000056404187,0.0005748569,0.00039575534,0.0004723973,0.00007737312,0.00009706629,0.00046600675,0.00047577024,0.00033980946],"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.0000011721834,0.000020142234,7.520299e-8,0.0121019045,0.000096615455,0.000018243638,0.000034603876,0.0017577325,5.19547e-8,0.0049073305,0.19342007,0.78764206],"study_design_scores_gemma":[0.00004890291,0.000032663396,4.9922323e-7,0.046948437,0.0004600207,0.00004907108,0.0000037852105,0.024746954,9.9738195e-8,0.014832367,0.91238606,0.0004911406],"about_ca_topic_score_codex":6.579636e-7,"about_ca_topic_score_gemma":0.0000015085303,"teacher_disagreement_score":0.7871509,"about_ca_system_score_codex":0.00024722892,"about_ca_system_score_gemma":0.000094642885,"threshold_uncertainty_score":0.99967027},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050319105,0.0061942404,0.940425,0.000011711345,0.00003138771,0.000089887144,7.192136e-7,0.0003461771,0.0025817782],"genre_scores_gemma":[0.9737647,0.00031591137,0.02579876,0.000055194356,0.000017489907,0.0000037545808,0.0000014786972,0.000023541821,0.000019180348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993876,0.000009859553,0.00009205352,0.00015411625,0.000073716204,0.0002826464],"domain_scores_gemma":[0.99975985,0.000025424493,0.000012608044,0.00013566011,0.0000342798,0.000032149914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000041807554,0.00013649194,0.00014494172,0.00007317374,0.000067133056,0.000027899894,0.00006477237,0.00006787354,9.951491e-7],"category_scores_gemma":[0.0000016375097,0.00012650517,0.000019055693,0.00015043095,0.000045662844,0.000086359796,0.00002761498,0.00021913172,3.3449055e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046484787,0.000010654522,0.000042612995,0.000013064815,0.00009724747,0.000008548521,0.000072234296,0.94592404,0.0018302696,0.012173561,0.00014647735,0.039634828],"study_design_scores_gemma":[0.00016764033,0.000062931605,0.000010178609,0.00009265549,0.000030488103,0.000016999637,0.000033692897,0.97120285,0.021426998,0.00602651,0.0007862631,0.00014280768],"about_ca_topic_score_codex":0.000014713428,"about_ca_topic_score_gemma":0.000098351804,"teacher_disagreement_score":0.9234456,"about_ca_system_score_codex":0.00011437476,"about_ca_system_score_gemma":0.00006112514,"threshold_uncertainty_score":0.51587313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15989764,0.00051740016,0.8269763,0.00010051497,0.0002420542,0.00005404229,7.7332965e-7,0.00008074444,0.012130555],"genre_scores_gemma":[0.9925904,0.00024294753,0.006965539,0.000044631597,0.000037737194,3.651895e-7,0.0000010384352,0.000006317882,0.000110990884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.0000338479,0.00015224429,0.000032823762,0.00005547933,0.000045338496],"domain_scores_gemma":[0.9997527,0.00005256989,0.0000618656,0.0000575912,0.00005880603,0.000016456892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020744494,0.00004902493,0.00008643893,0.00015229643,0.000022759297,0.000023794286,0.000047489604,0.00003517745,0.00000806872],"category_scores_gemma":[0.00003558775,0.000043757464,0.000026629157,0.000089775756,0.00002218279,0.00019037766,0.000010760466,0.00008045923,6.4277333e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003701792,0.00006884415,0.0004162708,0.00014926033,0.00034704193,0.000023908397,0.0011046831,0.033804927,0.049622294,0.6492616,0.018618055,0.24621291],"study_design_scores_gemma":[0.00080383633,0.00011948205,0.0022054203,0.0006086755,0.00013031911,0.00007175874,0.00088356546,0.076323226,0.10913312,0.80253446,0.0069439304,0.00024220586],"about_ca_topic_score_codex":3.0988832e-7,"about_ca_topic_score_gemma":1.928526e-7,"teacher_disagreement_score":0.8326928,"about_ca_system_score_codex":0.000028336393,"about_ca_system_score_gemma":0.000011650828,"threshold_uncertainty_score":0.17843775},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003277257,0.00088108855,0.9947912,0.00012445143,0.000090531816,0.00043074018,0.00000792817,0.000088292196,0.000308511],"genre_scores_gemma":[0.22010668,0.0005285698,0.7790402,0.00009204321,0.000056940655,0.00008747308,0.000018635445,0.000021999278,0.000047434783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.0001015099,0.00034235764,0.00011221692,0.0000502254,0.0001009808],"domain_scores_gemma":[0.99889266,0.0004638138,0.0001404769,0.00017201717,0.00027640513,0.00005464541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906845,0.00011082293,0.00019865495,0.00018175789,0.00013452492,0.00006910814,0.00011086644,0.00007090851,0.000010286332],"category_scores_gemma":[0.00013547513,0.00010313298,0.000038758553,0.00022648704,0.000073163545,0.000065169435,0.000025766167,0.000101059435,7.136196e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005370409,0.000029759216,0.0000075179137,0.000020211268,0.000062011066,1.7657425e-7,0.000056442328,0.96714115,0.0007487734,0.024527444,0.00032171534,0.007031072],"study_design_scores_gemma":[0.00056082744,0.0000501187,0.00002920476,0.0000524422,0.000101748185,0.0000102666645,0.00011092118,0.9821434,0.004673144,0.010804549,0.0013662176,0.00009715184],"about_ca_topic_score_codex":3.4813547e-7,"about_ca_topic_score_gemma":8.826975e-8,"teacher_disagreement_score":0.21682942,"about_ca_system_score_codex":0.000024276358,"about_ca_system_score_gemma":0.000021185593,"threshold_uncertainty_score":0.42056412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013485043,0.0008637649,0.9838657,0.00057523686,0.00040478876,0.0003462124,0.000088191584,0.00015824015,0.00021281594],"genre_scores_gemma":[0.51520437,0.00017918514,0.4807683,0.0008324077,0.000725356,0.000020831621,0.00013912177,0.00012577337,0.002004684],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991298,0.00008561352,0.0003136378,0.000119136086,0.00017491216,0.00017692082],"domain_scores_gemma":[0.99877346,0.00020673797,0.00013121727,0.00064831617,0.00019450283,0.000045741443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954455,0.00012886965,0.00025098835,0.00006833292,0.00022434258,0.00009697741,0.0011507563,0.00006372513,0.000025187095],"category_scores_gemma":[0.00009676863,0.00009315822,0.0000759445,0.00015422012,0.000032839882,0.00023396616,0.00035411972,0.0002471866,0.0000015783838],"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.00032146624,0.0002240674,0.00025310757,0.00008513136,0.00039761854,0.000011544811,0.0007117069,0.023050813,0.002980421,0.00006171539,0.62134844,0.35055396],"study_design_scores_gemma":[0.0025075844,0.00017907881,0.0013181504,0.0013679807,0.0006063819,0.0001946132,0.0013274961,0.45257348,0.03323147,0.005700959,0.50046855,0.00052424194],"about_ca_topic_score_codex":0.00003200251,"about_ca_topic_score_gemma":0.0000063752145,"teacher_disagreement_score":0.5030974,"about_ca_system_score_codex":0.000050264414,"about_ca_system_score_gemma":0.00006797804,"threshold_uncertainty_score":0.37988818},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06347033,0.00094415434,0.9331404,0.00012141881,0.000582367,0.00033708196,0.000006003361,0.00028885435,0.0011093791],"genre_scores_gemma":[0.9903613,0.0074906037,0.001834051,0.000031113253,0.0001601133,0.000015751817,0.000041168252,0.000036234753,0.000029680881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760365,0.00010330485,0.0004947206,0.0002412405,0.00021458109,0.0013424864],"domain_scores_gemma":[0.99943024,0.000037800117,0.00012773514,0.0002506858,0.000102124905,0.00005144066],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0010134671,0.0003339123,0.0004127025,0.00047626358,0.000098793214,0.00009102283,0.0001896825,0.0003328062,0.000003909278],"category_scores_gemma":[0.0000137040215,0.00036869064,0.00016677442,0.00021523821,0.000023941258,0.00018503834,0.00006929558,0.0040159645,0.0000026493271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019072473,0.000024631547,0.00007663312,0.00007232654,0.00012662761,0.00001601781,0.00038942997,0.97580296,0.00036800213,0.0012727239,0.000026700996,0.02180489],"study_design_scores_gemma":[0.0003677832,0.000037643178,0.00014955945,0.0005968382,0.000059367278,0.00025633487,0.00014872344,0.9471101,0.0030086318,0.04778952,0.000064102205,0.000411369],"about_ca_topic_score_codex":0.00015721467,"about_ca_topic_score_gemma":0.00068850775,"teacher_disagreement_score":0.93130636,"about_ca_system_score_codex":0.0018839051,"about_ca_system_score_gemma":0.0004821326,"threshold_uncertainty_score":0.9998765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040740613,0.000073063056,0.95623344,0.001567378,0.00036706435,0.000112931986,0.000034401422,0.00060621795,0.0002649013],"genre_scores_gemma":[0.8916166,0.000041758514,0.10568012,0.002321979,0.00008088299,0.0000046956684,0.00020145485,0.000025711104,0.00002679504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992954,0.000030423931,0.00022196634,0.00015634706,0.00015399425,0.00014184904],"domain_scores_gemma":[0.9993766,0.00009153971,0.00007794547,0.00036586294,0.00006203449,0.000026051799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014501518,0.00011452696,0.00012462324,0.00012899116,0.00012569767,0.00013592074,0.00018092932,0.000081519065,0.000002749892],"category_scores_gemma":[0.00007298866,0.0001277049,0.000023065642,0.00024341344,0.000017835635,0.00018527645,0.000041913387,0.00008529318,0.000002391191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013095467,0.000007028093,0.0016355242,0.000019555022,0.000039044833,0.0000013464952,0.00001659663,0.9631397,0.0037179403,0.00041381273,0.03072374,0.00028440024],"study_design_scores_gemma":[0.00023826225,0.0000035032865,0.0011670671,0.00010394234,0.00006419033,9.961793e-7,0.0000046645187,0.99540126,0.0013981903,0.00019991171,0.0012914637,0.0001265702],"about_ca_topic_score_codex":0.000024204362,"about_ca_topic_score_gemma":0.00001054056,"teacher_disagreement_score":0.850876,"about_ca_system_score_codex":0.00012560647,"about_ca_system_score_gemma":0.000025475465,"threshold_uncertainty_score":0.5207655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38047266,0.0004363177,0.6049945,0.0043728463,0.0002491615,0.0003794407,0.0000070433107,0.0016547956,0.007433259],"genre_scores_gemma":[0.9862979,0.00008027253,0.012038302,0.001471845,0.00000927615,0.000014966177,0.000020437672,0.000034589673,0.000032391166],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992082,0.00010361988,0.00021989652,0.00015256781,0.00010459259,0.00021113598],"domain_scores_gemma":[0.99788827,0.000252672,0.00004419861,0.0017166049,0.00006395509,0.000034311655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008097509,0.0001805102,0.00021939116,0.00021010418,0.00021084501,0.00013661341,0.0009405824,0.000057787707,0.000004610163],"category_scores_gemma":[0.000009538659,0.00017589722,0.000055120137,0.00038636127,0.000170618,0.00014476711,0.00014123556,0.00031124408,0.0000073198735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015256448,0.000100763544,0.00047885216,0.000056354394,0.0006669353,0.00002640693,0.00089757907,0.3093013,0.6327687,0.0005783126,0.045213982,0.009758297],"study_design_scores_gemma":[0.0030414346,0.000030285757,0.0017958491,0.0009199347,0.00018699985,0.000020065752,0.0001770003,0.87508196,0.086193465,0.00037222388,0.031252183,0.0009286233],"about_ca_topic_score_codex":0.000064900654,"about_ca_topic_score_gemma":0.00007629085,"teacher_disagreement_score":0.60582525,"about_ca_system_score_codex":0.0000764727,"about_ca_system_score_gemma":0.000016141568,"threshold_uncertainty_score":0.717288},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024528416,0.000107150794,0.97012377,0.00047868682,0.0008203014,0.0014732962,0.00009039201,0.0015875718,0.0007903919],"genre_scores_gemma":[0.51735157,0.000037050275,0.4817434,0.00017431348,0.00012957575,0.0002564029,0.00015522288,0.00006845108,0.000084001156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980518,0.000040688872,0.00048093087,0.000695645,0.00019741527,0.0005335263],"domain_scores_gemma":[0.998428,0.0001863292,0.00013017787,0.0008314407,0.00022435324,0.00019971284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010176694,0.0005743289,0.0007389811,0.00028956286,0.00012559586,0.00009733998,0.0004620795,0.0005481965,0.00001833067],"category_scores_gemma":[0.000078645855,0.00058519543,0.00019850563,0.00034035745,0.000108668246,0.00007165215,0.00020272574,0.0008008576,0.0000061666883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013271335,0.00007614533,0.00055418094,0.00013693741,0.0002291079,0.0000062841714,0.00031058592,0.9942113,0.00013215818,0.00038485153,0.0024537088,0.0013720372],"study_design_scores_gemma":[0.0005968051,0.00023787587,0.00023776879,0.0021978053,0.00021275252,0.000003325117,0.0002424114,0.98029244,0.013625176,0.00069892925,0.00075588183,0.00089884206],"about_ca_topic_score_codex":0.00008136986,"about_ca_topic_score_gemma":0.000052014308,"teacher_disagreement_score":0.49282318,"about_ca_system_score_codex":0.00018792345,"about_ca_system_score_gemma":0.00012802101,"threshold_uncertainty_score":0.99965996},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03448578,0.000044274268,0.96230155,0.00007265158,0.00010623277,0.0002684406,0.000016559647,0.0002474148,0.0024570965],"genre_scores_gemma":[0.47407112,0.0000017041918,0.52576995,0.000009241128,0.000015278007,0.00002916659,0.00006142184,0.0000084725725,0.000033632885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994509,0.000005256081,0.0002878946,0.000073476855,0.00010111006,0.000081335],"domain_scores_gemma":[0.9992136,0.00036691802,0.000057631543,0.00011579543,0.0002334299,0.000012659626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079788486,0.000083334686,0.00013386522,0.00016002909,0.00007627762,0.000035786554,0.00009718043,0.000037038375,0.000010520452],"category_scores_gemma":[0.000077934244,0.00009174067,0.000056382618,0.00015857989,0.000033125118,0.000087815475,0.000016128293,0.000039757135,0.000004413054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023672967,0.000038219598,0.0000048732677,0.00015610928,0.00004312897,2.7589099e-8,0.00013652844,0.8097514,0.00048220457,0.18588904,0.0011104794,0.0023856163],"study_design_scores_gemma":[0.00011827598,0.000011153943,0.00009697715,0.00010808,0.000021415757,0.0000010003338,0.00006805947,0.7449395,0.0026729645,0.25107813,0.00081966055,0.00006480829],"about_ca_topic_score_codex":8.19945e-7,"about_ca_topic_score_gemma":5.366029e-7,"teacher_disagreement_score":0.43958533,"about_ca_system_score_codex":0.000028256794,"about_ca_system_score_gemma":0.00003280187,"threshold_uncertainty_score":0.3741076},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08430077,0.00047453956,0.90141606,0.00032371885,0.000570854,0.00073669554,0.000023184071,0.00036569207,0.011788489],"genre_scores_gemma":[0.96916586,0.000106178355,0.02922394,0.00022123588,0.00007147787,0.000084237436,0.00007747167,0.00003457234,0.0010150147],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985462,0.00003056847,0.0004954769,0.00037206637,0.00016727729,0.0003884384],"domain_scores_gemma":[0.99907994,0.00025806206,0.00007576063,0.00041438962,0.00012281566,0.000049054663],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014539801,0.0002937147,0.00032662885,0.00041835604,0.00015572249,0.00009565046,0.0002568656,0.00024698753,0.0000794007],"category_scores_gemma":[0.00011638726,0.00033757125,0.000115969924,0.0003351418,0.000042503703,0.00021295412,0.0001409856,0.00020837011,0.000010471261],"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.00019208706,0.00047793105,0.000043121952,0.00066749094,0.00010388459,0.000010256435,0.0007999427,0.29883543,0.6240914,0.026656505,0.028045403,0.020076567],"study_design_scores_gemma":[0.00085245015,0.000038324783,0.00037401615,0.00049679977,0.000027768696,7.154574e-7,0.000062296946,0.51046085,0.43303457,0.05427854,0.00016700865,0.0002066623],"about_ca_topic_score_codex":0.00007363086,"about_ca_topic_score_gemma":0.000049200444,"teacher_disagreement_score":0.8848651,"about_ca_system_score_codex":0.00020374024,"about_ca_system_score_gemma":0.000058218557,"threshold_uncertainty_score":0.9999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015047081,0.0003035028,0.9949183,0.00004062559,0.0007376927,0.0007539791,0.000045431698,0.00061396114,0.0010817883],"genre_scores_gemma":[0.7558741,0.000009543925,0.2430872,0.0003520331,0.00046442705,0.00001032133,0.000061692284,0.00009549328,0.000045204222],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770826,0.000023497269,0.00040052147,0.00062109577,0.0005177324,0.0007289055],"domain_scores_gemma":[0.99844587,0.0005519613,0.00016862729,0.00050530414,0.00019180974,0.00013640038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036363717,0.0005480772,0.0005883032,0.00030096143,0.00022618726,0.00017084597,0.0005515233,0.00027055413,0.00001494063],"category_scores_gemma":[0.000026568878,0.0004855074,0.00009900444,0.00012573042,0.00055245537,0.00017334089,0.000175264,0.00053846755,0.0000031628263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010582867,0.000052295887,0.00021171012,0.0001154301,0.00035318418,0.00011771573,0.0018510713,0.4441065,0.015020201,0.00095357484,0.0005435695,0.53656894],"study_design_scores_gemma":[0.0005779319,0.00013708338,0.000041192183,0.00094755436,0.00006702404,0.000026367365,5.1698123e-7,0.943769,0.040961042,0.010591279,0.0020053168,0.0008757176],"about_ca_topic_score_codex":0.00003474905,"about_ca_topic_score_gemma":0.0002285325,"teacher_disagreement_score":0.7543694,"about_ca_system_score_codex":0.00026149477,"about_ca_system_score_gemma":0.00009721944,"threshold_uncertainty_score":0.9997597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042565517,0.0007954482,0.9512322,0.000042339136,0.00014102644,0.00033186574,0.000031978787,0.000886097,0.003973557],"genre_scores_gemma":[0.7530059,0.000007870752,0.24636015,0.00008048604,0.00041246135,0.0000177788,0.000021626644,0.00007189859,0.000021816404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857235,0.000040331477,0.00033290655,0.00032625205,0.00029258124,0.00043558242],"domain_scores_gemma":[0.99921626,0.00008243526,0.00008487982,0.00017576914,0.00027230888,0.00016837718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003043913,0.0002835689,0.0003128393,0.000118582146,0.00013721093,0.00018160205,0.00016904969,0.00012628728,0.0000132314735],"category_scores_gemma":[0.000027450636,0.00023841443,0.000069748945,0.0002134162,0.00016255799,0.00030142526,0.0000355334,0.00018053346,0.0000034640123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026488246,0.00017035627,0.000028715405,0.00023289844,0.00025620416,0.00018768507,0.0011234753,0.37639445,0.08000452,0.0024061678,0.009147846,0.5273989],"study_design_scores_gemma":[0.0012255092,0.00022930061,0.0000026905172,0.00035147,0.00007198331,0.00006986967,0.00009531569,0.8808683,0.101285025,0.014375671,0.0010077676,0.0004170562],"about_ca_topic_score_codex":0.000013431784,"about_ca_topic_score_gemma":0.0000018913598,"teacher_disagreement_score":0.7104404,"about_ca_system_score_codex":0.00009557577,"about_ca_system_score_gemma":0.00014693498,"threshold_uncertainty_score":0.97222584},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018925003,0.00008302602,0.6672254,0.00022949229,0.00016826621,0.0002669715,0.000090768095,0.0030525087,0.32699105],"genre_scores_gemma":[0.9942341,0.00004686607,0.002594536,0.00015549053,0.00010077618,1.6799217e-7,0.00062448677,0.0008121601,0.0014314292],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99921876,0.000066515815,0.00015272781,0.00021342005,0.000106157284,0.00024243163],"domain_scores_gemma":[0.9992494,0.000049841423,0.00003108108,0.00027336707,0.00033960232,0.000056734163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013819436,0.00011154281,0.00010401694,0.00021298297,0.0010890593,0.0003676378,0.0003528569,0.000053069296,0.000643656],"category_scores_gemma":[0.00024929494,0.0001293518,0.000047446465,0.00034867824,0.00005903192,0.0001769013,0.00026253852,0.000121547084,0.00016893154],"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.000050146817,0.00007141113,0.0000010234597,0.00007231438,0.00017682592,0.0000053777408,0.00053278636,0.0034657135,0.021163836,0.06466773,0.44599617,0.46379668],"study_design_scores_gemma":[0.00022243708,0.00003980887,0.000052129595,0.000046787314,0.000018091487,0.000012429377,0.0000990475,0.018583504,0.013350854,0.0027259418,0.96471405,0.00013490571],"about_ca_topic_score_codex":0.000012599189,"about_ca_topic_score_gemma":0.0000012278679,"teacher_disagreement_score":0.9923416,"about_ca_system_score_codex":0.00011286079,"about_ca_system_score_gemma":0.000002840036,"threshold_uncertainty_score":0.83762735},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000787828,0.0014273676,0.0011847822,0.0000315519,0.00016030863,0.00027874755,0.0002058979,0.0026783429,0.9932452],"genre_scores_gemma":[0.5131572,0.006732789,0.0011935069,0.00008323278,0.00198274,2.8041734e-7,0.004485369,0.032347232,0.44001767],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992512,0.000058826783,0.00015760539,0.00020253581,0.00014102504,0.00018879207],"domain_scores_gemma":[0.999604,0.000004686882,0.00006158099,0.00022260612,0.000067259476,0.00003987843],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014724232,0.00013770074,0.00016552082,0.00025459312,0.00010084365,0.00022824637,0.00026300392,0.000102863814,0.015660483],"category_scores_gemma":[0.000031193456,0.00014312554,0.000021808255,0.0001378835,0.00006583281,0.000046160472,0.0002895022,0.00015188863,0.0038402372],"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.000005598836,0.000012032442,9.332493e-8,0.00042494835,0.0000950388,0.0000052075457,0.000088846195,0.000013996223,0.014986364,0.004816897,0.97447217,0.0050788177],"study_design_scores_gemma":[0.000058733356,0.00005584412,0.000009028563,0.00034800704,0.00002566914,0.000028452074,0.000018361286,0.0001123219,0.0098655075,0.00020451541,0.9891416,0.00013200406],"about_ca_topic_score_codex":0.0000137743245,"about_ca_topic_score_gemma":9.04952e-7,"teacher_disagreement_score":0.5532275,"about_ca_system_score_codex":0.0000447279,"about_ca_system_score_gemma":0.0000014736744,"threshold_uncertainty_score":0.99693537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6692802,0.00009441522,0.32614306,0.00006074087,0.00005434232,0.00020964444,0.000077636025,0.0010756169,0.0030043705],"genre_scores_gemma":[0.9938317,0.000100917285,0.005324525,0.0000255341,0.000070748814,1.33786315e-8,0.00015815425,0.00048488876,0.0000035098706],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912935,0.000053129577,0.0002630609,0.00016798833,0.00020433101,0.00018211998],"domain_scores_gemma":[0.9993953,0.000015002011,0.00008924627,0.00019911068,0.00024894607,0.000052411542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013281922,0.00010342732,0.00016589618,0.00007170532,0.00027215094,0.000082039216,0.00036271717,0.000041512227,0.00043757822],"category_scores_gemma":[0.00008729913,0.00011680186,0.000041369014,0.00025552037,0.00005371835,0.00018697626,0.00028644514,0.00015677436,0.000087684195],"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.00009401943,0.00007341976,0.00007916803,0.0012937445,0.000089220746,0.0000065262543,0.003837053,0.017400755,0.79876673,0.00051850546,0.0043982347,0.17344263],"study_design_scores_gemma":[0.00072285463,0.00052191725,0.0015431887,0.0005622383,0.000038408067,0.00005345739,0.00047748635,0.49045327,0.44970253,0.00006503231,0.05541811,0.00044150781],"about_ca_topic_score_codex":0.000017964554,"about_ca_topic_score_gemma":5.2704525e-8,"teacher_disagreement_score":0.47305253,"about_ca_system_score_codex":0.00003767682,"about_ca_system_score_gemma":0.0000013176877,"threshold_uncertainty_score":0.47911745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9937985,0.00013813522,0.000007028397,0.00000437503,0.00022226617,0.00021502664,0.005315976,0.0001416839,0.00015700617],"genre_scores_gemma":[0.9979932,0.000039999657,0.00011704793,0.000024725854,0.000050016013,0.00002047508,0.0016347724,0.000029683319,0.00009011571],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99911934,0.000048462876,0.00024846778,0.00019806802,0.00019587182,0.00018976214],"domain_scores_gemma":[0.9994132,0.00015386629,0.00006674216,0.0001742991,0.00010363273,0.00008829255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004052478,0.00015618544,0.00021054837,0.00010514532,0.00004982676,0.00006367436,0.0000677192,0.00014522493,0.000817243],"category_scores_gemma":[0.00039792803,0.00016589982,0.000021224028,0.00014007826,0.000029468034,0.00077447883,0.00005812248,0.00025070566,0.0000016120875],"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.000041044685,0.000031789423,0.037423674,0.0002030022,0.00006035834,0.00004582866,0.0050510555,0.0007354377,0.00061181217,0.000007899376,0.95482475,0.0009633495],"study_design_scores_gemma":[0.00059478974,0.000042378746,0.90664923,0.0019939642,0.000020745114,0.0000070169963,0.00021249287,0.07451466,0.005604122,0.000016106216,0.010015184,0.00032930088],"about_ca_topic_score_codex":0.11781508,"about_ca_topic_score_gemma":0.4296034,"teacher_disagreement_score":0.94480956,"about_ca_system_score_codex":0.00008411517,"about_ca_system_score_gemma":0.000066817396,"threshold_uncertainty_score":0.89482373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9551376,0.0005266095,0.00003222233,0.00000361316,0.0019452093,0.0006194429,0.0009491258,0.0014349932,0.039351195],"genre_scores_gemma":[0.98942703,0.0005647993,0.008332034,0.000030886644,0.000053473042,0.000046694604,0.00043017723,0.00021657949,0.0008983521],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975312,0.00008112744,0.0008024671,0.00057784515,0.00054271857,0.00046465232],"domain_scores_gemma":[0.99811894,0.00013137369,0.00048776632,0.0008048027,0.00030118445,0.0001559367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023806946,0.0006646787,0.0007398601,0.00047088243,0.0002604991,0.00004477717,0.00055555487,0.0007740153,0.0001623871],"category_scores_gemma":[0.00022574814,0.0006510149,0.00024479566,0.0004243813,0.00005132872,0.00058251014,0.000056958877,0.0006967641,0.0001098886],"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.00023020625,0.000072741495,0.000011804095,0.0010151977,0.00052193046,0.00008066636,0.000019611576,0.01014822,0.5898862,0.032215554,0.00017448833,0.36562338],"study_design_scores_gemma":[0.000574683,0.000070957176,0.0003881977,0.0016065632,0.0002405232,0.000020597012,0.000041709754,0.0030640657,0.9411646,0.04442901,0.00737108,0.0010280124],"about_ca_topic_score_codex":0.00010292644,"about_ca_topic_score_gemma":0.00023297983,"teacher_disagreement_score":0.36459535,"about_ca_system_score_codex":0.0003056647,"about_ca_system_score_gemma":0.000029285367,"threshold_uncertainty_score":0.9995941},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9090996,0.017451124,0.0005596054,0.0037097607,0.0036165747,0.0019044317,0.0006974209,0.0006545162,0.062306963],"genre_scores_gemma":[0.9475356,0.003927313,0.0002506998,0.00009254,0.0012918565,0.00006066954,0.00005817437,0.00020764113,0.046575543],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988815,0.000085343745,0.00030037406,0.00034024194,0.00014204127,0.0002504953],"domain_scores_gemma":[0.99890465,0.00021296187,0.00022461118,0.0005297172,0.0000389132,0.00008912403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019738008,0.00035563842,0.0004735896,0.00021166203,0.00016375043,0.00026862088,0.0001821918,0.0003181245,0.00018137376],"category_scores_gemma":[0.00003927947,0.00027772706,0.000043734624,0.000043258784,0.00017525615,0.00024014126,0.000034493205,0.00031308347,0.000003246178],"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.00001243606,0.000005693524,0.62396514,0.000105096595,0.00028676575,0.000021083064,0.00034123758,0.00004556733,0.00016108091,0.00014802256,0.36612856,0.008779279],"study_design_scores_gemma":[0.00076634,0.000023973482,0.3144525,0.0011119869,0.00013800814,0.000026228232,0.00015957784,0.002865605,0.00019625548,0.00030727865,0.6792465,0.0007057267],"about_ca_topic_score_codex":0.15945014,"about_ca_topic_score_gemma":0.96785563,"teacher_disagreement_score":0.80840546,"about_ca_system_score_codex":0.00012956194,"about_ca_system_score_gemma":0.00015919651,"threshold_uncertainty_score":0.9999675},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7574081,0.0002289785,0.08052178,0.023543198,0.00089019607,0.00073962647,0.000028240605,0.0024911645,0.13414875],"genre_scores_gemma":[0.9233123,0.00020381839,0.0058398945,0.00009545275,0.00017033196,7.3847296e-8,0.000015527321,0.0000653309,0.07029725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989194,0.00008524247,0.0001550122,0.00026309674,0.00021911247,0.00035809405],"domain_scores_gemma":[0.99891764,0.00012512428,0.00009014034,0.0006641137,0.000040104158,0.00016287979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000051694737,0.0002427338,0.00026204466,0.00014353858,0.00010447629,0.00006903043,0.0005340826,0.00013156612,0.0000992664],"category_scores_gemma":[0.000016423077,0.00022834627,0.00011345336,0.0003113953,0.00012621739,0.00050204794,0.00027838701,0.00027362604,0.00008908326],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014482359,0.000041684732,0.082258664,0.00007756917,0.00017025988,0.000055283035,0.0005576364,0.0039430596,0.00028242357,0.005529488,0.90467197,0.00226714],"study_design_scores_gemma":[0.0005628213,0.00008220429,0.025809325,0.00027051705,0.000060173894,0.000002689766,0.00015710166,0.0010013916,0.0140165,0.00052994356,0.9569664,0.0005409331],"about_ca_topic_score_codex":0.008003052,"about_ca_topic_score_gemma":0.002727508,"teacher_disagreement_score":0.16590425,"about_ca_system_score_codex":0.000033049768,"about_ca_system_score_gemma":0.000116322946,"threshold_uncertainty_score":0.99860275},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010336534,0.0012006548,0.00034808269,0.00004676247,0.0010531839,0.00035062656,0.00002352998,0.0043771067,0.99249667],"genre_scores_gemma":[0.06685025,0.00042729627,0.0015967324,0.000057473924,0.0006940359,0.000029961133,0.000084201274,0.0004627645,0.9297973],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988094,0.000018517134,0.00029286175,0.00039636175,0.00020534333,0.00027750444],"domain_scores_gemma":[0.99772274,0.000005126023,0.0002134813,0.0019471598,0.000038796894,0.00007267841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012845674,0.00036466515,0.00040522212,0.00011686705,0.00006665811,0.0001200296,0.00030557573,0.0004415995,0.00007985857],"category_scores_gemma":[0.000032649707,0.0002910614,0.00008695652,0.00002101137,0.00007474869,0.00007164718,0.000083682986,0.00027712047,0.00009045826],"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.000003916291,0.000010945308,0.000012932793,0.0000386527,0.000076438,0.00020997031,0.000034796063,0.0000042821216,0.00014513891,0.000017888526,0.9983348,0.0011102156],"study_design_scores_gemma":[0.000094714036,0.000027474833,0.00009212167,0.0006818348,0.000025927608,0.000041876625,0.000007914832,0.0002660673,0.002184182,0.0001403431,0.99594676,0.0004907831],"about_ca_topic_score_codex":0.0015914845,"about_ca_topic_score_gemma":0.0005009374,"teacher_disagreement_score":0.06674688,"about_ca_system_score_codex":0.00003803282,"about_ca_system_score_gemma":0.000024023157,"threshold_uncertainty_score":0.99995416},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94695795,0.00064811483,0.000017825396,0.0000014651959,0.0025428245,0.0007642812,0.00017762076,0.00093466276,0.04795526],"genre_scores_gemma":[0.99745995,0.00020093984,0.0006527171,0.00001573574,0.00005818508,0.00012831141,0.00056161184,0.0002315189,0.0006910172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971479,0.00018137702,0.0010468808,0.00056599145,0.0005332107,0.0005246117],"domain_scores_gemma":[0.9983737,0.00014254956,0.00039022282,0.00074926834,0.00020426407,0.00013998381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005239543,0.00065965153,0.0009843893,0.0007386094,0.00014556007,0.00006104975,0.00048486574,0.00085212174,0.000025740605],"category_scores_gemma":[0.00022215383,0.00075968355,0.0002097845,0.00048076262,0.000030020374,0.00037125376,0.00004806476,0.0009912469,0.0000835561],"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.00021664302,0.0002924099,0.00003304449,0.0038972718,0.00048240434,0.00015267642,0.000057073274,0.49313715,0.1339703,0.07893105,0.00013884618,0.28869113],"study_design_scores_gemma":[0.001252282,0.0002474659,0.0006598717,0.007857724,0.00028388068,0.00004717799,0.00023682644,0.1721868,0.7795876,0.017615402,0.017486738,0.0025382196],"about_ca_topic_score_codex":0.00045173208,"about_ca_topic_score_gemma":0.00026098007,"teacher_disagreement_score":0.6456173,"about_ca_system_score_codex":0.00036298644,"about_ca_system_score_gemma":0.00001731793,"threshold_uncertainty_score":0.99948543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084893934,0.0008679256,0.90835774,0.0012476931,0.00044830903,0.00045669693,0.0000060787042,0.0011221222,0.002599523],"genre_scores_gemma":[0.76331294,0.00022873806,0.2322339,0.00052234146,0.00039871057,0.00006422581,0.000060537943,0.00005603842,0.003122594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952054,0.000008273713,0.00011546977,0.00012203274,0.00007155268,0.00016213549],"domain_scores_gemma":[0.99970526,0.00004402766,0.000013976492,0.00009526719,0.000046880075,0.00009459975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000021380942,0.00010899989,0.0001038707,0.000038947775,0.000086070686,0.000054981312,0.000043779168,0.00004425848,0.00015935926],"category_scores_gemma":[0.0000049390205,0.00010845202,0.0000211209,0.000041735188,0.00001027433,0.00013346966,0.000020343135,0.00008489194,0.000008450802],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000038043424,0.000007442607,0.00015959227,0.000016324337,0.00004095445,0.0000039037145,0.00006491962,0.0035118954,0.009593263,0.00010125425,0.82735217,0.15914448],"study_design_scores_gemma":[0.00031313152,0.00005898167,0.0028222727,0.000067895904,0.000020496373,0.000087898356,0.000055479788,0.48510274,0.007441264,0.0015544485,0.5021133,0.00036209906],"about_ca_topic_score_codex":0.22014809,"about_ca_topic_score_gemma":0.038559195,"teacher_disagreement_score":0.678419,"about_ca_system_score_codex":0.000046266177,"about_ca_system_score_gemma":0.00003833837,"threshold_uncertainty_score":0.9789846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08989258,0.003909042,0.8927214,0.00067748915,0.0036757083,0.0008974227,0.000017366687,0.000397614,0.007811373],"genre_scores_gemma":[0.99445903,0.0000290098,0.004967137,0.00028279013,0.00020847855,0.0000013400715,5.8120906e-7,0.000017860151,0.000033797798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991205,0.000017930779,0.00014806287,0.00023352823,0.00029174783,0.00018825759],"domain_scores_gemma":[0.9991759,0.00018895116,0.00006633408,0.00049401814,0.000047626505,0.000027174707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017129726,0.00021302409,0.00018290363,0.00006813472,0.000112620706,0.00005501629,0.00044274365,0.00014337926,0.000019514684],"category_scores_gemma":[0.000021826876,0.00012061114,0.00005486989,0.00010150744,0.00043983612,0.000068052155,0.00020189531,0.00045839325,0.0000011676345],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022065575,0.000009771732,0.00063516357,0.00007916054,0.00005524563,0.0000051997113,0.0010321089,0.08125376,0.0044794357,0.011748157,0.00045322158,0.9002267],"study_design_scores_gemma":[0.000181916,0.00018118828,0.010609506,0.0012647164,0.00007132005,0.00005434241,0.0000014201986,0.48931912,0.068415634,0.4265616,0.0025602707,0.0007789778],"about_ca_topic_score_codex":0.000011833542,"about_ca_topic_score_gemma":0.00002935475,"teacher_disagreement_score":0.9045664,"about_ca_system_score_codex":0.000046105873,"about_ca_system_score_gemma":0.000023392004,"threshold_uncertainty_score":0.49183795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96280694,0.000035658624,0.0018497224,0.00003093817,0.000054028624,0.00007280827,0.0000022657662,0.00028933948,0.034858316],"genre_scores_gemma":[0.999176,0.00004867096,0.00051778305,0.000018513447,0.000013702549,0.0000037616285,4.363624e-7,0.000009864429,0.00021122616],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996446,0.000009610989,0.000078881945,0.00009866173,0.000052537816,0.00011571307],"domain_scores_gemma":[0.9998149,0.000034279285,0.0000072605117,0.00010001026,0.000015587682,0.000027923184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002763886,0.00006687536,0.00007632843,0.000065730994,0.000009485814,0.000012982653,0.000039363695,0.00003292127,0.000038280206],"category_scores_gemma":[0.000016339482,0.000044917146,0.000009753528,0.0000450431,0.000015840667,0.00010994519,0.000023858938,0.000032432315,0.000009734092],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073284544,0.00012383937,0.5891998,0.000012593846,0.00003968832,0.000030327767,0.00045138018,0.00008288819,0.024426747,0.0016570775,0.049988776,0.3339136],"study_design_scores_gemma":[0.0007603263,0.00003863971,0.96586126,0.00006037042,0.0000027100282,0.0000010472157,0.000016520684,0.0012030068,0.026048059,0.0045155003,0.0013218084,0.00017072848],"about_ca_topic_score_codex":0.00021380583,"about_ca_topic_score_gemma":0.000381078,"teacher_disagreement_score":0.37666148,"about_ca_system_score_codex":0.000029972896,"about_ca_system_score_gemma":0.0000015989423,"threshold_uncertainty_score":0.1831668},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536132,0.007677667,0.41603568,0.00063953624,0.004792322,0.00418194,0.00007141168,0.0029495978,0.4082905],"genre_scores_gemma":[0.54327744,0.013204455,0.41599146,0.000008225415,0.00017072805,0.0000047726994,0.0004900129,0.000109905995,0.02674299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984647,0.00010545152,0.00026525947,0.00055750186,0.00020914582,0.00039793883],"domain_scores_gemma":[0.99839145,0.0002085878,0.0003801424,0.00042723498,0.00048451326,0.00010808384],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015646966,0.00047602897,0.0008783139,0.00017642605,0.00048214322,0.00003871732,0.00043816862,0.0007195786,0.004495809],"category_scores_gemma":[0.00004536416,0.00073857553,0.00053737935,0.00012358445,0.000049983748,0.00052070664,0.00007788288,0.00040071344,0.000006590383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038835614,0.0003140754,0.00018049245,0.004231578,0.0044401917,0.00002594756,0.05438762,0.09960729,0.026287515,0.001908333,0.0042205625,0.80051285],"study_design_scores_gemma":[0.003687275,0.00041689616,0.0027253786,0.0025658254,0.001776066,0.00000730246,0.03929025,0.9397022,0.0055988706,0.00013734018,0.002870614,0.0012219708],"about_ca_topic_score_codex":0.030087598,"about_ca_topic_score_gemma":0.0072506666,"teacher_disagreement_score":0.8400949,"about_ca_system_score_codex":0.00063049234,"about_ca_system_score_gemma":0.00017997557,"threshold_uncertainty_score":0.99950653},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05048743,0.0032441665,0.8969522,0.00056186994,0.0025292286,0.0007316359,0.00003126115,0.0027216338,0.04274054],"genre_scores_gemma":[0.8746492,0.0008119424,0.11320038,0.00075396366,0.0003508379,0.0000055954274,0.000035644087,0.00015094878,0.010041467],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996682,0.00016875779,0.0009673831,0.0008072364,0.0003260634,0.0010485713],"domain_scores_gemma":[0.99777836,0.00032272155,0.00012873871,0.0013031681,0.00029682135,0.00017020795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000352921,0.0007069332,0.00092229125,0.00055346946,0.00033396424,0.00028943992,0.0004216813,0.0005534827,0.00044878572],"category_scores_gemma":[0.000062084415,0.00076764997,0.00037418096,0.0010680209,0.000101288446,0.000261806,0.00040831618,0.00074507843,0.00021168235],"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.0005736527,0.0008447851,0.00045904476,0.0010013555,0.002132175,0.00031749398,0.0011841044,0.0973618,0.63086325,0.003845113,0.18303777,0.07837945],"study_design_scores_gemma":[0.0008642246,0.000064941916,0.00007318627,0.0007094999,0.00019760767,0.000016278585,0.00018790594,0.7027248,0.25329575,0.0034542202,0.037762675,0.0006489047],"about_ca_topic_score_codex":0.00020636017,"about_ca_topic_score_gemma":0.00010584295,"teacher_disagreement_score":0.82416177,"about_ca_system_score_codex":0.00021274177,"about_ca_system_score_gemma":0.000112348534,"threshold_uncertainty_score":0.99947745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70543087,0.000054393186,0.29005814,0.0010962139,0.00021735227,0.00015748572,0.000003841311,0.0010965619,0.0018851777],"genre_scores_gemma":[0.98333126,0.0000017043496,0.0145829525,0.0019373862,0.00008228627,0.0000082690785,0.0000051046213,0.00004180569,0.000009242885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990891,0.00001711556,0.00016770244,0.00021325631,0.00021346688,0.00029933098],"domain_scores_gemma":[0.99958086,0.000026448299,0.00004432232,0.00016066496,0.0000608749,0.00012684795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007825225,0.0002047751,0.00018383286,0.00009404116,0.000084903724,0.000097333876,0.00014900719,0.00006094215,0.000002833995],"category_scores_gemma":[0.000028463282,0.00019473955,0.000051297,0.00013792481,0.0001106852,0.0002463852,0.000026788837,0.00023480237,0.000008258572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021656548,0.000012283143,0.00008793136,0.000039374994,0.000009117671,0.0000428876,0.0007881326,0.7243022,0.25186422,0.000010745957,0.011314156,0.0115073165],"study_design_scores_gemma":[0.00029980746,0.00001545111,0.000027537588,0.00014299116,0.00001310543,0.0000097490865,0.00009338038,0.9224958,0.076456465,0.00014491017,0.000074029886,0.00022677078],"about_ca_topic_score_codex":0.000009639742,"about_ca_topic_score_gemma":0.0000015408851,"teacher_disagreement_score":0.2779004,"about_ca_system_score_codex":0.00009034849,"about_ca_system_score_gemma":0.000039734325,"threshold_uncertainty_score":0.79412484},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011069827,0.00046454027,0.0070519624,0.002386812,0.0012254701,0.00331382,0.00012832755,0.00032194835,0.98400015],"genre_scores_gemma":[0.5064456,0.051941834,0.027063448,0.00014702266,0.0005753121,0.0036984917,0.00031164213,0.00019628716,0.40962037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9901298,0.00012332322,0.001162518,0.0018672416,0.005371004,0.0013460685],"domain_scores_gemma":[0.99629873,0.00011807256,0.000059463455,0.0013559762,0.0018686913,0.00029904975],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.006448945,0.00056122115,0.0003976294,0.0092127,0.0020891058,0.0031687925,0.0054827053,0.0001764787,0.00089967455],"category_scores_gemma":[0.00023110556,0.00060313137,0.000084758285,0.0031568205,0.007392252,0.0051708254,0.0036713963,0.0014019962,0.00023818515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052784766,0.00011482991,0.00010742578,0.00006997117,0.00008499767,0.00013371241,0.00041347562,0.04130578,0.00036026404,0.94672936,0.001353638,0.009273729],"study_design_scores_gemma":[0.0008888636,0.00019381531,0.0028781835,0.0015744511,0.000029323404,0.00007165202,0.0029435111,0.084491864,0.0012681813,0.13644055,0.7675804,0.0016392213],"about_ca_topic_score_codex":0.00039386307,"about_ca_topic_score_gemma":0.003639229,"teacher_disagreement_score":0.81028885,"about_ca_system_score_codex":0.002546595,"about_ca_system_score_gemma":0.0002510815,"threshold_uncertainty_score":0.99989814},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6077149,0.0007657054,0.35323298,0.00095156254,0.0005694901,0.0005801312,0.000077986784,0.0011573894,0.034949873],"genre_scores_gemma":[0.9956004,0.00042102105,0.0038265144,0.000045451467,0.00004386387,0.0000070671563,0.000024290144,0.000024815714,0.000006548505],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982917,0.0002561761,0.000565621,0.00027032537,0.0002190596,0.0003971518],"domain_scores_gemma":[0.9975966,0.00014563683,0.00016214412,0.0018615212,0.0001331583,0.000100920704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027097555,0.0002994118,0.00047012017,0.00015128742,0.00014353608,0.000086546876,0.0009569384,0.00016120102,0.000016820393],"category_scores_gemma":[0.000052608077,0.0003390414,0.00009634226,0.00047071403,0.0004637828,0.00020723545,0.00013133437,0.00039299182,0.000029498384],"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.00022966908,0.0010246456,0.01250134,0.00040007682,0.00033573897,0.00001573663,0.0011424284,0.031366304,0.7813586,0.07113939,0.0044714063,0.09601465],"study_design_scores_gemma":[0.0010503395,0.00011587098,0.020890916,0.00078081066,0.000059119193,0.000048642087,0.00019000725,0.47259265,0.42208463,0.07894287,0.0023376124,0.00090650725],"about_ca_topic_score_codex":0.0014257367,"about_ca_topic_score_gemma":0.0074153086,"teacher_disagreement_score":0.44122636,"about_ca_system_score_codex":0.00019666554,"about_ca_system_score_gemma":0.000046168974,"threshold_uncertainty_score":0.9999062},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6327079,0.00012877116,0.3513005,0.0000130965345,0.0010370266,0.0003086265,0.000009261781,0.0021437528,0.01235107],"genre_scores_gemma":[0.99243426,0.00038229866,0.006643681,0.000023819566,0.00013529236,4.4461277e-7,0.000021518761,0.000053295335,0.00030540596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893093,0.000055996858,0.00018120266,0.0004909445,0.000049909646,0.00029099328],"domain_scores_gemma":[0.9989577,0.00004112359,0.00009659837,0.0006857423,0.00011517803,0.00010366169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000048251743,0.00033382396,0.00034351824,0.00019961694,0.00008366492,0.00007811005,0.00030579223,0.00038197462,0.00006782398],"category_scores_gemma":[0.000007221397,0.00041910642,0.00016005072,0.00015720738,0.00009425156,0.00015194507,0.00028659392,0.0006349804,0.00010512997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011863544,0.000011426671,0.00018855919,0.000058399964,0.00014838926,0.000109305336,0.000047587455,0.98805004,0.0013375689,0.0027204251,0.003491154,0.0038252987],"study_design_scores_gemma":[0.00020508487,0.000010079511,0.00020505257,0.0002571328,0.00007727596,0.000022188011,0.000045582066,0.9656924,0.0026250968,0.029624335,0.00073899655,0.00049679016],"about_ca_topic_score_codex":0.00019956984,"about_ca_topic_score_gemma":0.000018820663,"teacher_disagreement_score":0.35972634,"about_ca_system_score_codex":0.00014886292,"about_ca_system_score_gemma":0.000025292098,"threshold_uncertainty_score":0.9998261},"labels":[],"label_agreement":null}]}