{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"ce3ab122ca18","filters":{"venue":"Sampling Theory Signal Processing and Data Analysis"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Esha Saha","is_ca":true},{"name":"Hayden Schaeffer","is_ca":false},{"name":"Giang Tran","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05151404994003881,"gpt":0.2981990023618142,"spread":0.2466849524217754,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001234844,0.0008666964,0.0008726594,0.0007400076,0.0004062465,0.00105111,0.001103581,0.001367509,0.01131444],"category_scores_gemma":[0.005272556,0.0003477026,0.0005191789,0.0008756696,0.00082408,0.001219469,0.001732825,0.002312652,0.006142247],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003168795,"about_ca_system_score_gemma":0.00056729,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113746,"about_ca_topic_score_gemma":0.001782269,"domain_scores_codex":[0.99901,0.000260758,0.00003471396,0.0001384884,0.0004863613,0.00006975928],"domain_scores_gemma":[0.998722,0.0005843387,0.00006443395,0.0003561336,0.0002053293,0.00006769261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004363058,0.0001836306,0.0004927807,0.0001691692,0.00007173774,0.0002665926,0.00006238154,0.08109733,0.01321162,0.08800384,0.07304961,0.742955],"study_design_scores_gemma":[0.00004332473,0.00006268264,0.0002725231,0.00002294981,0.000009404509,0.0001986528,0.00001094744,0.920887,0.01010859,0.04868014,0.01967742,0.00002642452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001843342,0.0002733448,0.9918229,0.0002575769,0.0001419881,0.00003697571,0.0002467405,0.003464888,0.001912324],"genre_scores_gemma":[0.1150854,0.0004937614,0.8595657,0.0007000855,0.0002615592,0.0002569774,0.001876793,0.001757296,0.02000242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01131444,"threshold_uncertainty_score":0.0378505,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Maksym Neyra-Nesterenko","is_ca":true},{"name":"Ben Adcock","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05595914766946054,"gpt":0.2875084498350968,"spread":0.2315493021656362,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006370319,0.0006942718,0.0006166394,0.0004661001,0.0003251769,0.0007586227,0.001298297,0.0008840368,0.003322748],"category_scores_gemma":[0.003482885,0.0003823273,0.0003516502,0.0004735105,0.0005353153,0.001375213,0.001617066,0.001620794,0.0008700503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004143076,"about_ca_system_score_gemma":0.0005978445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921354,"about_ca_topic_score_gemma":0.00629668,"domain_scores_codex":[0.9996752,0.00007181338,0.00001321928,0.00004495154,0.000171584,0.00002323488],"domain_scores_gemma":[0.9994099,0.0002730022,0.00005029605,0.000099072,0.0001310706,0.00003663291],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005704919,0.0001197714,0.0007857213,0.0002941511,0.0001205263,0.0002165596,0.00009918628,0.4580145,0.01937626,0.05535388,0.02462726,0.4404217],"study_design_scores_gemma":[0.00001398686,0.00002592453,0.00007826364,0.000006479531,0.000005013233,0.00002751505,0.000005156296,0.9862715,0.003005291,0.007982233,0.002572912,0.000005720141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007169745,0.000243078,0.9883283,0.0001772608,0.0001135367,0.00004216898,0.00026063,0.001720168,0.001945204],"genre_scores_gemma":[0.1590529,0.0003912531,0.8282684,0.0001990294,0.00008484973,0.0002376594,0.0008884471,0.0005269967,0.01035044],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003322748,"threshold_uncertainty_score":0.01111573,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4306411814","doi":"10.1007/s43670-022-00040-8","title":"CAS4DL: Christoffel adaptive sampling for function approximation via deep learning","year":2022,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Sampling (signal processing); Deep learning; Function approximation; Adaptive sampling; Function (biology); Parameterized complexity; Artificial intelligence; Artificial neural network; Algorithm; Multivariate statistics; Sample (material); Monte Carlo method; Mathematical optimization; Mathematics; Machine learning; Statistics","authors":[{"name":"Ben Adcock","is_ca":true},{"name":"Juan M. Cardenas","is_ca":true},{"name":"Nick Dexter","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1460865793261805,"gpt":0.3546864623493639,"spread":0.2085998830231834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149095,0.001025188,0.00111432,0.0009143897,0.0004646557,0.001310712,0.002512031,0.00169605,0.007320353],"category_scores_gemma":[0.005924946,0.00049565,0.0008072047,0.0009489435,0.0009601937,0.001032492,0.00228665,0.003100588,0.002142398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001266311,"about_ca_system_score_gemma":0.001775856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006228613,"about_ca_topic_score_gemma":0.01056008,"domain_scores_codex":[0.9990746,0.0002388507,0.00003885481,0.0001080701,0.0004621868,0.00007747272],"domain_scores_gemma":[0.9987077,0.0006109208,0.00006075222,0.0002602844,0.0002654586,0.0000949535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004289702,0.0001459177,0.0009330381,0.000319776,0.0001727039,0.0001427159,0.00008596275,0.3714184,0.008328754,0.1482629,0.02942166,0.4403392],"study_design_scores_gemma":[0.00001384434,0.0000115793,0.00003108678,0.000006707727,0.000004280407,0.00001151126,0.000002582121,0.9843727,0.001426424,0.01243666,0.001678456,0.000004222828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001982931,0.0001616972,0.9942362,0.00009219256,0.00006121631,0.00003098371,0.0001026669,0.002210584,0.001121565],"genre_scores_gemma":[0.1523681,0.0003313799,0.8387521,0.00039307,0.0001180405,0.000341895,0.0009079486,0.001424228,0.005363246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007320353,"threshold_uncertainty_score":0.02448899,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; 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","authors":[{"name":"Kateryna Melnykova","is_ca":true},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06026650454885625,"gpt":0.3222777198996381,"spread":0.2620112153507819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134673,0.0006523986,0.0006509825,0.000768558,0.0002772482,0.001357679,0.0007055091,0.00104964,0.00341047],"category_scores_gemma":[0.006292424,0.0003144511,0.0002552728,0.001129226,0.0011289,0.002190751,0.0009881058,0.00150238,0.0007103708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006561427,"about_ca_system_score_gemma":0.0005021807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001076772,"about_ca_topic_score_gemma":0.0009831523,"domain_scores_codex":[0.9991936,0.000311536,0.0000471936,0.000127161,0.0002715926,0.00004895934],"domain_scores_gemma":[0.9985921,0.0007795469,0.0001293393,0.0002450566,0.0002048804,0.00004898524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008258555,0.00001956894,0.00008574853,0.0001241013,0.0000124664,0.00004380371,0.00006170301,0.06115612,0.003458299,0.871613,0.003797323,0.05954526],"study_design_scores_gemma":[0.00001832814,0.00003665463,0.00009530809,0.00003732949,0.00000651438,0.00005955929,0.00002176342,0.4974833,0.001674488,0.4956492,0.004899784,0.00001778924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006339578,0.001387103,0.9872557,0.0005012727,0.0001536157,0.00001736027,0.000135258,0.00009899594,0.004111113],"genre_scores_gemma":[0.5052375,0.006587188,0.4607329,0.0007358238,0.001026589,0.0002231485,0.0008746348,0.0002062225,0.02437599],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00341047,"threshold_uncertainty_score":0.0114091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387164540","doi":"10.1007/s43670-023-00069-3","title":"Nonlinear expansions in reproducing kernel Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Reproducing kernel Hilbert space; Hilbert space; Banach space; Bounded function; Hardy space; Cover (algebra); Pure mathematics; Nonlinear system; Norm (philosophy); Kernel (algebra); Series expansion; Analytic function; Mathematical analysis; Space (punctuation)","authors":[{"name":"Javad Mashreghi","is_ca":true},{"name":"William Verreault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1120317754779758,"gpt":0.373069305053445,"spread":0.2610375295754692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023815,0.0007239508,0.0007229841,0.001249751,0.0002983377,0.00147345,0.0007249673,0.001018306,0.002102702],"category_scores_gemma":[0.008886538,0.00040937,0.0005112691,0.0009336855,0.001938583,0.002786424,0.001299447,0.001887374,0.0004779311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007573561,"about_ca_system_score_gemma":0.0004163441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009855489,"about_ca_topic_score_gemma":0.0006204614,"domain_scores_codex":[0.9989261,0.0006189526,0.00004841729,0.00009542605,0.0002603627,0.00005072343],"domain_scores_gemma":[0.9946919,0.003704567,0.0004252122,0.0003415624,0.0006197915,0.0002169484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003522916,0.00002883278,0.0002615652,0.0001027827,0.00001847668,0.00009521875,0.0001947361,0.0225556,0.00423716,0.9571003,0.0008541986,0.01451582],"study_design_scores_gemma":[0.00001056075,0.00002624157,0.0003527902,0.00002041599,0.000007571038,0.0001020817,0.0000508398,0.4301733,0.0007514621,0.5666044,0.001883019,0.00001718351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04697483,0.001427951,0.9443221,0.0006402872,0.0001276031,0.00001969671,0.00007305147,0.0001094161,0.006304982],"genre_scores_gemma":[0.7825905,0.003589085,0.1877469,0.0003099382,0.0008472882,0.0001224361,0.0003220027,0.0002400564,0.02423187],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0023815,"threshold_uncertainty_score":0.01259476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4319943411","doi":"10.1007/s43670-023-00047-9","title":"Publisher Correction: NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems","year":2023,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Advanced Algorithms and Applications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Inverse; Artificial neural network; Computer science; Inverse problem; Artificial intelligence; Algorithm; Mathematics; Mathematical analysis; Geometry","authors":[{"name":"Maksym Neyra-Nesterenko","is_ca":true},{"name":"Ben Adcock","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05166243762495248,"gpt":0.2995868959844977,"spread":0.2479244583595452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002557194,0.002033335,0.001996769,0.00411573,0.002640628,0.004348303,0.003565293,0.004293356,0.1092581],"category_scores_gemma":[0.04863051,0.0009831851,0.00122913,0.00331327,0.002469535,0.00401956,0.002564511,0.007745122,0.06184374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002641144,"about_ca_system_score_gemma":0.003519366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00870303,"about_ca_topic_score_gemma":0.0126165,"domain_scores_codex":[0.9967803,0.0004670106,0.0003837596,0.0004975499,0.001687366,0.0001840271],"domain_scores_gemma":[0.9730866,0.003763379,0.0008549872,0.002755419,0.01856359,0.0009759419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00003339669,0.000005059983,0.00005134035,0.0001183932,0.0000136316,0.00009413497,0.00001975897,0.0002790478,0.0001038162,0.00294594,0.983705,0.01263061],"study_design_scores_gemma":[0.00003570617,0.00002507599,0.0004612544,0.0001967583,0.00004095975,0.0004639617,0.0000481887,0.002333009,0.001275518,0.006106623,0.9889624,0.00005059103],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"other","genre_scores_codex":[0.0003692063,0.001601204,0.009319986,0.02215077,0.9531578,0.00003065237,0.002086083,0.002070421,0.009213869],"genre_scores_gemma":[0.03126696,0.008319139,0.03167188,0.02090103,0.2421615,0.0002362373,0.008636536,0.00857414,0.6482325],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.1092581,"threshold_uncertainty_score":0.3655047,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Óscar López","is_ca":false},{"name":"Özgür Yılmaz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06496448420519808,"gpt":0.3055116528807253,"spread":0.2405471686755272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002313624,0.0005035261,0.0007323044,0.0002743082,0.0002878412,0.0008864048,0.0009332729,0.0009400553,0.001388506],"category_scores_gemma":[0.01273521,0.000323192,0.0003546304,0.0005474725,0.001468297,0.001959403,0.001732898,0.001138062,0.0003651461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004450399,"about_ca_system_score_gemma":0.0006849745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001733647,"about_ca_topic_score_gemma":0.001880538,"domain_scores_codex":[0.9983828,0.0006734621,0.00008216224,0.0003582399,0.00038629,0.0001170499],"domain_scores_gemma":[0.9952098,0.002680494,0.0004816723,0.001131268,0.0003604811,0.000136444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008935529,0.0001266638,0.008461938,0.0002017193,0.0001075436,0.0006623197,0.0003372471,0.7248224,0.01967555,0.1354904,0.002415424,0.1068052],"study_design_scores_gemma":[0.00002495199,0.00008985247,0.0007267249,0.00001511351,0.000008852008,0.0001440959,0.00007437923,0.9600747,0.004712147,0.03269267,0.001421892,0.00001461073],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09538897,0.0001890789,0.9009486,0.0003470001,0.00005557945,0.00003308132,0.0001103414,0.0001960672,0.002731304],"genre_scores_gemma":[0.8769648,0.0001964492,0.1204242,0.0002417588,0.00006164106,0.00004804041,0.0002469563,0.00005728732,0.00175886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002313624,"threshold_uncertainty_score":0.01223576,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Sina Mohammad-Taheri","is_ca":true},{"name":"Simone Brugiapaglia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02961198463878358,"gpt":0.2807382421831374,"spread":0.2511262575443538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003109981,0.001805374,0.001539106,0.0009437784,0.0004897815,0.001467675,0.001974381,0.001987944,0.002008392],"category_scores_gemma":[0.007709956,0.0008814928,0.0009051511,0.001803071,0.001929626,0.003247513,0.003740438,0.004040399,0.001451467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004146358,"about_ca_system_score_gemma":0.0009771334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006645493,"about_ca_topic_score_gemma":0.0007335225,"domain_scores_codex":[0.9978111,0.0009141408,0.00008438209,0.0002613558,0.0008199871,0.0001090238],"domain_scores_gemma":[0.9981748,0.001006327,0.0001825844,0.0002808587,0.0002560657,0.00009947667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005322177,0.0001795325,0.0005452469,0.0004176539,0.00021107,0.0001467766,0.0002061914,0.2153709,0.02182183,0.2421811,0.01986319,0.4985243],"study_design_scores_gemma":[0.00002947406,0.00008146249,0.00009460021,0.0000238425,0.0000140695,0.00008680929,0.00001584034,0.9337825,0.002778447,0.05868513,0.004379869,0.00002793919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009833912,0.0002428756,0.9978603,0.0001852756,0.00005986027,0.00001119673,0.00002595778,0.0001154002,0.0005157781],"genre_scores_gemma":[0.06421984,0.001403354,0.9272134,0.0005485335,0.0005120482,0.000205282,0.0002523015,0.0003774766,0.005267742],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003109981,"threshold_uncertainty_score":0.01644731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3194315893","doi":"10.1007/s43670-023-00067-5","title":"Adaptive group Lasso neural network models for functions of few variables and time-dependent data","year":2023,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial neural network; Lasso (programming language); Property (philosophy); Computer science; Constraint (computer-aided design); Matrix (chemical analysis); Algorithm; Nonlinear system; Penalty method; Function (biology); Set (abstract data type); Artificial intelligence; Mathematical optimization; Mathematics; Pattern recognition (psychology)","authors":[{"name":"Lam Si Tung Ho","is_ca":true},{"name":"Nicholas J. Richardson","is_ca":true},{"name":"Giang Tran","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08933312037186174,"gpt":0.312323117612736,"spread":0.2229899972408743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003309139,0.001314171,0.001753123,0.0005264191,0.0004631112,0.001259418,0.002100602,0.001749375,0.001624897],"category_scores_gemma":[0.01048863,0.0006439774,0.001051775,0.001174464,0.001308038,0.001620537,0.001374136,0.003027649,0.0006340822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006758393,"about_ca_system_score_gemma":0.001156572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003213033,"about_ca_topic_score_gemma":0.003756702,"domain_scores_codex":[0.9982805,0.0009731035,0.00006279884,0.0003133579,0.0002736957,0.00009648059],"domain_scores_gemma":[0.9958657,0.002913211,0.000364939,0.0003897318,0.0003795048,0.00008689954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001465807,0.00008696008,0.0005140364,0.0001920515,0.0001476442,0.00005221664,0.00008834761,0.8895932,0.001903544,0.0350635,0.003897806,0.06831409],"study_design_scores_gemma":[0.00000414968,0.00000685206,0.0000552456,0.000004675909,0.000004156646,0.000005136274,0.000002918072,0.9924314,0.0001125074,0.007101486,0.0002677682,0.000003729673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003753309,0.000306285,0.9951923,0.0002060111,0.00004140246,0.00001807098,0.00007886392,0.0001168094,0.0002869086],"genre_scores_gemma":[0.3926446,0.001837605,0.5899956,0.0005976128,0.0007115635,0.0008130631,0.001605831,0.0004294018,0.01136476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003309139,"threshold_uncertainty_score":0.01750064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396762500","doi":"10.1007/s43670-024-00088-8","title":"On the monotonicity of left and right Riemann sums","year":2024,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Monotonic function; Mathematics; Riemann hypothesis; Pure mathematics; Mathematical analysis; Mathematical economics","authors":[{"name":"Ludovick Bouthat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.118952190468566,"gpt":0.3868058791166078,"spread":0.2678536886480418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01040646,0.001093851,0.001460223,0.002955943,0.001364467,0.005121578,0.00204758,0.001856853,0.007525517],"category_scores_gemma":[0.05754092,0.0008362326,0.001307089,0.001585882,0.008140248,0.01306639,0.004765522,0.006382572,0.001239953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013092,"about_ca_system_score_gemma":0.001116114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001259903,"about_ca_topic_score_gemma":0.0007489399,"domain_scores_codex":[0.994535,0.002708279,0.0003498254,0.0006860974,0.001209576,0.0005112145],"domain_scores_gemma":[0.9409669,0.04618397,0.002256367,0.003821799,0.005037228,0.001733796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001863591,0.00003612816,0.0008837475,0.0001346984,0.00002383275,0.0002183264,0.0003405272,0.003456805,0.003568045,0.9646185,0.001556884,0.02497617],"study_design_scores_gemma":[0.00001947292,0.00005134808,0.001074136,0.00008330403,0.000024418,0.0004643703,0.000130561,0.05521526,0.002557433,0.9355128,0.0048289,0.00003805536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1227917,0.009609267,0.7744524,0.007313573,0.0007928232,0.00005428019,0.0004025697,0.0002717737,0.08431166],"genre_scores_gemma":[0.843378,0.007180429,0.121366,0.002333328,0.00263991,0.0001442832,0.0005496353,0.0007678226,0.0216405],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01040646,"threshold_uncertainty_score":0.05503529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4392385397","doi":"10.1007/s43670-024-00082-0","title":"Nonlinear expansions in Banach spaces","year":2024,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Advanced Banach Space Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Banach space; Nonlinear system; Mathematics; Interpolation space; Eberlein–Šmulian theorem; Lp space; Pure mathematics; Physics; Functional analysis; Chemistry","authors":[{"name":"Mostafa Nasri","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07906280035724488,"gpt":0.3874601253208776,"spread":0.3083973249636328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410546,0.0009875995,0.0006533309,0.00136552,0.0003435896,0.001467844,0.0004562633,0.0008495208,0.003667181],"category_scores_gemma":[0.003451556,0.0003850073,0.0004720791,0.00101844,0.001745605,0.002346434,0.001407033,0.00220433,0.0008170459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008700726,"about_ca_system_score_gemma":0.0003486836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007063528,"about_ca_topic_score_gemma":0.0005212923,"domain_scores_codex":[0.9993734,0.0003101045,0.00002907374,0.00007161275,0.0001837037,0.00003212543],"domain_scores_gemma":[0.9985811,0.0008551442,0.0001128429,0.00009602544,0.0002753203,0.00007960227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001965954,0.00001099868,0.00008641722,0.00007348914,0.00001115313,0.00005232609,0.0001291051,0.008442225,0.002539334,0.9766568,0.001277795,0.01070076],"study_design_scores_gemma":[0.0000102391,0.00002535219,0.0002814706,0.00003811383,0.00001164599,0.0001374823,0.00006092734,0.1402056,0.0009499247,0.8487692,0.009494569,0.00001530281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04545682,0.006905177,0.8804249,0.001960017,0.0007152074,0.00003551939,0.0001370125,0.0001668361,0.0641986],"genre_scores_gemma":[0.6875086,0.01154569,0.1767353,0.0007331549,0.002444118,0.000212714,0.0003497576,0.0002732514,0.1201974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003667181,"threshold_uncertainty_score":0.01226795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4411577251","doi":"10.1007/s43670-025-00103-6","title":"Bounds and limiting minimizers for a family of interaction energies","year":2025,"lang":"en","type":"article","venue":"Sampling Theory Signal Processing and Data Analysis","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Limiting; Mathematics; Statistical physics; Physics; Engineering; Mechanical engineering","authors":[{"name":"Cameron Davies","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05160219670206482,"gpt":0.3377534679285526,"spread":0.2861512712264878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007417422,0.00323388,0.002167787,0.00438438,0.001890863,0.005639691,0.003833592,0.003657535,0.00754788],"category_scores_gemma":[0.03426608,0.001363105,0.002072275,0.002444739,0.004276547,0.005695529,0.005620002,0.005914852,0.0009510081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00245256,"about_ca_system_score_gemma":0.001239252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001183256,"about_ca_topic_score_gemma":0.0008499742,"domain_scores_codex":[0.9968708,0.00144589,0.0001374741,0.0004287471,0.0007283905,0.0003886823],"domain_scores_gemma":[0.9752714,0.02027884,0.001294592,0.0008511997,0.001148209,0.001155721],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001573593,0.0001293467,0.0006912097,0.000288905,0.0001315932,0.0001917544,0.0003389054,0.07709175,0.002363067,0.9022042,0.002670965,0.01374089],"study_design_scores_gemma":[0.00002274076,0.00006467388,0.0004897941,0.0001103392,0.00005334524,0.0002740427,0.0001265052,0.3638165,0.001224971,0.6312959,0.002472375,0.00004892416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06224043,0.001886608,0.9093304,0.002418431,0.00009899855,0.0000912662,0.000220092,0.0003254453,0.02338832],"genre_scores_gemma":[0.745998,0.004165425,0.2106859,0.00136626,0.000669151,0.001068269,0.001019662,0.001331709,0.03369567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00754788,"threshold_uncertainty_score":0.03922755,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}