{"meta":{"query_hash":"ce3ab122ca18","filters":{"venue":"Sampling Theory Signal Processing and Data Analysis"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/ce3ab122ca18","api":"https://metacan.xera.ac/api/v1/cohort?venue=Sampling+Theory+Signal+Processing+and+Data+Analysis"},"results":[{"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":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.08933312037186174,"score_gpt":0.312323117612736,"score_spread":0.22298999724087426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194315893","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.0054168217,0.0006940687,0.99173313,0.000055250617,0.000039351926,0.0001256822,0.0017083547,0.000060891536,0.00016647208],"genre_scores_gemma":[0.98822623,0.000037028207,0.004964765,0.000027629687,0.0003571554,0.000012981094,0.0060320245,0.000020501253,0.0003217079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854004,0.000099873425,0.0002922945,0.0006602776,0.00014124172,0.0002662803],"domain_scores_gemma":[0.9986188,0.00044896727,0.00018538223,0.0005889347,0.00006800647,0.00008994968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562994,0.00016792322,0.00035199604,0.00013755535,0.0004545895,0.00013768196,0.00037705954,0.00004550064,0.000066051056],"category_scores_gemma":[0.00001129027,0.0001458045,0.00005964754,0.0007077066,0.00010109702,0.000575836,0.0005062398,0.00013177456,0.0000015506059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024224097,0.00005673369,0.0005392756,0.000055680273,0.0011733554,3.3621905e-7,0.0000966438,0.8193814,0.00015034318,0.009572956,0.0012310713,0.16749997],"study_design_scores_gemma":[0.00019484822,0.000025766703,0.000037692593,0.000034623346,0.0015259462,5.673651e-7,0.000337349,0.9161226,0.0000035027665,0.08141598,0.00015910288,0.0001420184],"about_ca_topic_score_codex":0.000058375845,"about_ca_topic_score_gemma":0.000005156166,"teacher_disagreement_score":0.98676836,"about_ca_system_score_codex":0.000003898158,"about_ca_system_score_gemma":0.00003202319,"threshold_uncertainty_score":0.5945735},"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,"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); 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","score_opus":0.14608657932618052,"score_gpt":0.3546864623493639,"score_spread":0.20859988302318339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306411814","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.0023242056,0.002194061,0.9948381,0.000046088284,0.000094996234,0.00020172831,0.00010601451,0.00013685384,0.00005793434],"genre_scores_gemma":[0.93800044,0.000007551743,0.060917977,0.00007332669,0.00013458787,0.00006499629,0.0006054935,0.000026739346,0.0001688661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965664,0.00044498025,0.0006668573,0.0011244654,0.0008483473,0.00034894526],"domain_scores_gemma":[0.9955967,0.0029055187,0.00045555222,0.0006479967,0.00027683226,0.00011740144],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.011667033,0.00023441664,0.00048465983,0.00070112356,0.0021261917,0.00042510632,0.0008677627,0.00007240895,0.00017348152],"category_scores_gemma":[0.0017212724,0.00020007072,0.00015135497,0.0019927945,0.00011184141,0.00056547875,0.0005112684,0.00038366544,0.0000049527453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033020496,0.000038385086,0.00025624657,0.00003153637,0.00024802267,7.4234487e-7,0.0005495916,0.6691461,0.00032754216,0.0024771006,0.000034903365,0.32655963],"study_design_scores_gemma":[0.00021481811,0.00011415068,0.000319777,0.000010985553,0.0011073805,0.0000069127423,0.0023787124,0.86290693,0.000005926334,0.13103788,0.0016535509,0.00024295281],"about_ca_topic_score_codex":0.000025198708,"about_ca_topic_score_gemma":0.0000061341775,"teacher_disagreement_score":0.9356763,"about_ca_system_score_codex":0.000075874115,"about_ca_system_score_gemma":0.00008135158,"threshold_uncertainty_score":0.9991729},"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":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05166243762495248,"score_gpt":0.2995868959844977,"score_spread":0.24792445835954524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319943411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00789439,0.0011879889,0.9900602,0.00004242753,0.00011157774,0.00017239379,0.000099080105,0.00039394878,0.000038003334],"genre_scores_gemma":[0.9902156,0.00021854557,0.0061377734,0.000052330128,0.0001321668,0.00008156474,0.0029130087,0.000040687795,0.00020831836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856937,0.000034287084,0.00032461737,0.00058050983,0.00013478161,0.00035641377],"domain_scores_gemma":[0.99892306,0.00033411398,0.00010030023,0.00043045418,0.000076561104,0.00013552359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008555925,0.00021564025,0.00036738924,0.000483573,0.00047575514,0.00046828415,0.00024411756,0.0000770837,0.0000147171595],"category_scores_gemma":[0.00005100216,0.0001962717,0.00008230846,0.003971234,0.00009339368,0.0004697208,0.0001278042,0.00017138223,0.0000010400598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013669978,0.000011433337,0.00030139,0.0000539473,0.00067795475,7.082126e-7,0.00010666068,0.9473457,0.000020827405,0.00006196045,0.00046056623,0.050945204],"study_design_scores_gemma":[0.0001528305,0.00000967951,0.0005075181,0.000016599746,0.0029586684,0.000001771673,0.00048037377,0.9926919,0.0000015735284,0.0019686818,0.0009713377,0.00023907359],"about_ca_topic_score_codex":0.000021266405,"about_ca_topic_score_gemma":0.00007468489,"teacher_disagreement_score":0.9839224,"about_ca_system_score_codex":0.000018915498,"about_ca_system_score_gemma":0.000014585141,"threshold_uncertainty_score":0.8003728},"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":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.11203177547797584,"score_gpt":0.373069305053445,"score_spread":0.26103752957546916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387164540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8784356,0.0012465386,0.11868467,0.00044429328,0.000043722815,0.00015525297,0.00019119517,0.00039486797,0.00040387415],"genre_scores_gemma":[0.98244864,0.000119079334,0.01620072,0.00011645947,0.0001433839,0.000009562837,0.00045905221,0.000040732146,0.00046236426],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761456,0.0002631405,0.0004696228,0.0010029876,0.00026431974,0.00038537846],"domain_scores_gemma":[0.9973894,0.0011334532,0.00015050243,0.0011439684,0.000070803035,0.00011190352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051546246,0.00022434723,0.0005134267,0.0006085272,0.00037553022,0.00019772585,0.0005084572,0.00010713896,0.000104515675],"category_scores_gemma":[0.0013418002,0.00018823786,0.00007814776,0.0023475362,0.00015664489,0.00035012484,0.0004313578,0.00028715873,0.000027241706],"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.0018254992,0.002205832,0.1352195,0.004210529,0.0072064567,0.00078761944,0.0632944,0.01938948,0.021629212,0.13276637,0.0048433044,0.6066218],"study_design_scores_gemma":[0.000891891,0.00006172995,0.0016564891,0.00072515506,0.0034634492,0.00002340571,0.023327922,0.33457166,0.0005631019,0.6323145,0.0012552539,0.0011454711],"about_ca_topic_score_codex":0.00008572335,"about_ca_topic_score_gemma":0.00011334201,"teacher_disagreement_score":0.6054763,"about_ca_system_score_codex":0.00001960045,"about_ca_system_score_gemma":0.000086202024,"threshold_uncertainty_score":0.7676117},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07906280035724488,"score_gpt":0.38746012532087765,"score_spread":0.30839732496363276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392385397","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.06969282,0.009301051,0.9197116,0.0002920131,0.000036548776,0.00011062455,0.00019978346,0.0003265881,0.0003289627],"genre_scores_gemma":[0.8946567,0.00014620117,0.104356155,0.00007004582,0.00013662918,0.000008882409,0.00027297947,0.000051480376,0.00030088093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792844,0.00020219505,0.00040157043,0.0008402092,0.00026631914,0.0003612849],"domain_scores_gemma":[0.99725056,0.0017076605,0.00009535686,0.00079009344,0.000048577713,0.00010773463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002472261,0.0002574651,0.00048657312,0.00076167844,0.00021834901,0.00032227163,0.0004945799,0.000100584795,0.00013877418],"category_scores_gemma":[0.00052118837,0.00021319442,0.0000938062,0.0018952175,0.00018727046,0.0006534421,0.0003321231,0.0003756789,0.0000114528875],"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.0005197482,0.00074884226,0.0035872709,0.003954773,0.0040156497,0.00032984576,0.012095931,0.0074323933,0.0055728485,0.30804908,0.0006820749,0.6530115],"study_design_scores_gemma":[0.00015430323,0.000022454667,0.000039487728,0.0004678729,0.0021514466,0.000010085236,0.004559215,0.25042972,0.0001052375,0.7407495,0.00093525,0.00037543455],"about_ca_topic_score_codex":0.00003862581,"about_ca_topic_score_gemma":0.0002048359,"teacher_disagreement_score":0.8249639,"about_ca_system_score_codex":0.000038670318,"about_ca_system_score_gemma":0.00010266933,"threshold_uncertainty_score":0.8693816},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Monotonic function; Mathematics; Riemann hypothesis; Pure mathematics; Mathematical analysis; Mathematical economics","score_opus":0.11895219046856605,"score_gpt":0.3868058791166078,"score_spread":0.26785368864804177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396762500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102173194,0.0017039707,0.89362955,0.000714555,0.000008126303,0.00013436496,0.0003037119,0.000084389016,0.0012481154],"genre_scores_gemma":[0.9935239,0.000048315058,0.0060247513,0.000080567836,0.0000293906,0.0000058528635,0.000055860623,0.00001312665,0.00021822177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892765,0.00009446329,0.00031900188,0.00035215606,0.00017241809,0.00013433532],"domain_scores_gemma":[0.9955251,0.0037407652,0.00009335305,0.0005504271,0.00004118864,0.000049153386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020129352,0.00012894325,0.00028551367,0.00010214521,0.00025443002,0.0002042006,0.00028163442,0.00004627578,0.00038702376],"category_scores_gemma":[0.00030044353,0.00007364901,0.000063221465,0.00034403315,0.00020566073,0.00011455151,0.00016924355,0.0001488108,0.0000026936984],"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.000011019652,0.00003968615,0.000015939082,0.0005598723,0.00033686394,5.858151e-7,0.0006392527,0.000022059878,0.00010227948,0.992952,0.00017489235,0.0051455777],"study_design_scores_gemma":[0.00002828051,0.000011503227,0.000012862915,0.00016580377,0.0011509579,0.0000020434463,0.00042788245,0.11668749,0.00017431534,0.88088536,0.00036416212,0.00008930837],"about_ca_topic_score_codex":0.000013503748,"about_ca_topic_score_gemma":0.000007728629,"teacher_disagreement_score":0.89135075,"about_ca_system_score_codex":0.000005682015,"about_ca_system_score_gemma":0.000024594954,"threshold_uncertainty_score":0.42376387},"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":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Limiting; Mathematics; Statistical physics; Physics; Engineering; Mechanical engineering","score_opus":0.05160219670206482,"score_gpt":0.3377534679285526,"score_spread":0.28615127122648776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411577251","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.01153278,0.0013734346,0.98682976,0.00004421168,0.00002333252,0.00004213598,0.000011499813,0.000064974265,0.00007786548],"genre_scores_gemma":[0.6043828,0.0000225579,0.39552248,0.000032064178,0.000009078531,0.0000045428046,0.000012554733,0.0000036280044,0.000010283399],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991003,0.000024310133,0.0002703282,0.00038577008,0.000084587395,0.00013468617],"domain_scores_gemma":[0.9984269,0.0010021504,0.000111235124,0.00034825035,0.00008055835,0.00003091779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078106305,0.00010439455,0.0002572475,0.00028165162,0.00015897182,0.00017409911,0.00037564803,0.000035001278,3.9033097e-7],"category_scores_gemma":[0.00032929506,0.00009459466,0.000040329116,0.00051526306,0.00006737752,0.0005308641,0.00031907696,0.00006880873,4.5717652e-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.0000863499,0.000051406452,0.00011892175,0.0012322745,0.00071090314,5.97508e-7,0.00091564807,0.24261568,0.009427606,0.16767816,0.000010430301,0.577152],"study_design_scores_gemma":[0.00010137957,0.000011168403,0.000026655003,0.00017274047,0.00036754616,7.050232e-7,0.00040979745,0.8862745,0.00031385612,0.112201266,0.000036551748,0.0000838425],"about_ca_topic_score_codex":0.000003454437,"about_ca_topic_score_gemma":6.9975897e-7,"teacher_disagreement_score":0.6436588,"about_ca_system_score_codex":0.000009777204,"about_ca_system_score_gemma":0.000030840627,"threshold_uncertainty_score":0.38574582},"labels":[],"label_agreement":null}]}