{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":19,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":19,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"0444b23d62fe","filters":{"venue":"European Signal Processing Conference"}},"results":[{"id":"W2116622845","doi":"","title":"Automatic crack detection on road imagery using anisotropic diffusion and region linkage","year":2010,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Artificial intelligence; Computer vision; Histogram; Pixel; Computer science; Segmentation; Image segmentation; Binary image; Anisotropic diffusion; Pattern recognition (psychology); Mixture model; Image processing; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01368970734993826,"gpt":0.2179766185272002,"spread":0.2042869111772619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001224453,0.000203854,0.0001439013,0.00009875771,0.000226293,0.0002265919,0.0001191745,0.00005976936,0.000020566],"category_scores_gemma":[0.0000277657,0.000184985,0.00002620899,0.0001063551,0.00007161742,0.0002638971,0.00004265787,0.0004902916,0.00001769428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002882723,"about_ca_system_score_gemma":0.00002108322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000506317,"about_ca_topic_score_gemma":0.000002342908,"domain_scores_codex":[0.999122,0.00004314725,0.0002058253,0.0002379277,0.0001379864,0.0002531491],"domain_scores_gemma":[0.9996117,0.0000174644,0.00007127427,0.0001491589,0.00007263514,0.00007778066],"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.000006042802,0.000005503851,0.0001883056,0.000111383,0.00000328648,0.00003556902,0.0002989736,0.0002378892,0.446562,0.00001290441,0.000005991035,0.5525321],"study_design_scores_gemma":[0.0004768583,0.0001326149,0.04118864,0.0008652986,0.00003323569,0.0001695129,0.0001456517,0.8997494,0.05597637,0.0002616948,0.0004500325,0.0005507084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9020336,0.00004321519,0.09340902,0.000008329208,0.0004026447,0.00008038684,5.143316e-7,0.0003599433,0.003662364],"genre_scores_gemma":[0.9973114,0.00001334034,0.002107353,0.00003224682,0.0004445265,0.000001648732,0.00000125535,0.00005140299,0.00003687085],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8995115,"threshold_uncertainty_score":0.7543467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493379811","doi":"","title":"1-D Local binary patterns based VAD used INHMM-based improved speech recognition","year":2012,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal College of Physicians and Surgeons of Canada","funders":"","keywords":"Hidden Markov model; Speech recognition; Computer science; Voice activity detection; Pattern recognition (psychology); Binary number; Segmentation; Local binary patterns; Artificial intelligence; Speech processing; Mathematics; Histogram","retraction":null,"screen_n_in":null,"score":{"opus":0.04706988872752636,"gpt":0.2519290702826704,"spread":0.2048591815551441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001146052,0.0004364956,0.0003122626,0.0002540577,0.0004228768,0.0008638399,0.001180387,0.00009323826,0.0001862015],"category_scores_gemma":[0.00006384241,0.0004126842,0.0001093581,0.0006345169,0.0001611043,0.002029791,0.0002234231,0.0004845672,0.000388657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008575607,"about_ca_system_score_gemma":0.0005460926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001313844,"about_ca_topic_score_gemma":0.000003461827,"domain_scores_codex":[0.9968145,0.0004204364,0.0005201154,0.0007518135,0.0005600328,0.0009330586],"domain_scores_gemma":[0.9982041,0.0001158345,0.0003837674,0.0004864366,0.0003979695,0.0004119007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003811877,0.0002768032,0.002212172,0.000221172,0.000008635722,0.00008351567,0.0003974277,0.00006608966,0.06239508,0.00001016134,0.000107027,0.9341838],"study_design_scores_gemma":[0.001981723,0.0003980422,0.006410628,0.001283911,0.00004380128,0.00005351515,0.0001489497,0.3051821,0.6815835,0.0002703801,0.001294025,0.00134949],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07943658,0.0002080663,0.9153067,0.0004366298,0.0002100463,0.0001903117,0.000009225166,0.0006464341,0.003556027],"genre_scores_gemma":[0.9317164,0.000001891131,0.06616947,0.001655415,0.000266111,0.00001158572,0.00004214006,0.00005805799,0.00007886489],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9328343,"threshold_uncertainty_score":0.9998325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1482783311","doi":"","title":"A robust narrowband active noise control system for accommodating frequency mismatch","year":2004,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Narrowband; Active noise control; Noise (video); SIGNAL (programming language); Computer science; Tachometer; Electronic engineering; Signal generator; Acoustics; Control theory (sociology); Engineering; Channel (broadcasting); Physics; Detector; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03475712932488928,"gpt":0.2321749467407545,"spread":0.1974178174158652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000259404,0.0003361909,0.0003185256,0.00009018245,0.0002333265,0.0001795637,0.0004277234,0.00005749417,0.00001021203],"category_scores_gemma":[0.00004470088,0.0003416431,0.00006980465,0.0001498527,0.00008065336,0.0005181614,0.00004402544,0.0002960016,0.00002313522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002256978,"about_ca_system_score_gemma":0.00007974976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005706247,"about_ca_topic_score_gemma":0.00000214467,"domain_scores_codex":[0.9985642,0.00005956966,0.0003836193,0.00038329,0.0001760996,0.0004332266],"domain_scores_gemma":[0.9991935,0.00006439561,0.0001454348,0.0002234198,0.0002579162,0.0001152619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001343,0.00006918644,0.00005870316,0.001927297,0.00009793595,0.0001174488,0.002609563,0.1390087,0.7514941,0.004224246,0.00007477181,0.1001838],"study_design_scores_gemma":[0.01058524,0.0009445063,0.001498118,0.01402807,0.0002686648,0.0003023157,0.003010577,0.3524118,0.5988861,0.01200084,0.001574027,0.004489799],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042583,0.0001774212,0.9647813,0.00003843267,0.00008109399,0.0004716473,0.00005721063,0.001993507,0.01197358],"genre_scores_gemma":[0.9142177,0.000002839339,0.08534902,0.00003294934,0.0001678162,0.00006823617,0.00001351941,0.0001210234,0.00002691489],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8937919,"threshold_uncertainty_score":0.9999036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554393788","doi":"","title":"Least squares solution for error correction on the real field using quantized DFT codes","year":2012,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Overdetermined system; Quantization (signal processing); Algorithm; Decoding methods; Mean squared error; Mathematics; Error detection and correction; Computer science; Applied mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1190871327407715,"gpt":0.3408139011529427,"spread":0.2217267684121711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008316578,0.0002020135,0.0001639102,0.00008292959,0.0006348377,0.0003243557,0.0008661401,0.00004305361,0.00002117993],"category_scores_gemma":[0.0001982237,0.0001464823,0.00005551226,0.0002064367,0.00008224116,0.0010989,0.0002568761,0.0002445288,0.00002300331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004157385,"about_ca_system_score_gemma":0.00008328295,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002175653,"about_ca_topic_score_gemma":0.000002353423,"domain_scores_codex":[0.9983447,0.0003273571,0.0002822629,0.0003753232,0.0002769673,0.0003934269],"domain_scores_gemma":[0.9986036,0.0004005514,0.0002786063,0.000412113,0.0002172902,0.00008787034],"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.0002042569,0.0002025146,0.0003642269,0.00008132512,0.00001433459,0.000004235556,0.001779153,0.0001966275,0.1113938,0.03430255,0.007243891,0.8442131],"study_design_scores_gemma":[0.0004081341,0.0004077911,0.0009295785,0.0008764729,0.00002223146,0.00002666001,0.0001996203,0.8692465,0.1183826,0.002598593,0.006320707,0.0005811408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003911732,0.00008177328,0.9904901,0.0003680686,0.0003524918,0.0002847279,0.00000503085,0.0004731772,0.004032856],"genre_scores_gemma":[0.9367292,0.000007514687,0.06249697,0.0003672267,0.000203222,0.00001721064,0.000006342465,0.00002204536,0.0001502953],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9328175,"threshold_uncertainty_score":0.5973374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151013122","doi":"","title":"Sum rate maximization in multi-operator two-way relay networks with a MIMO AF relay via POTDC","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; MIMO; Beamforming; Maximization; Computer science; Mathematical optimization; Transmitter power output; Optimization problem; Operator (biology); Relay channel; Convex optimization; Power (physics); Algorithm; Mathematics; Regular polygon; Computer network; Telecommunications; Transmitter","retraction":null,"screen_n_in":null,"score":{"opus":0.03918453283932458,"gpt":0.2532808421147827,"spread":0.2140963092754581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008969344,0.0003215605,0.0002675808,0.0001599525,0.0004093132,0.001079159,0.001360143,0.0000510162,0.0001296853],"category_scores_gemma":[0.00004465401,0.0002680682,0.00003511307,0.0009770073,0.000136724,0.001391287,0.0004557494,0.0005741244,0.0002113919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006352255,"about_ca_system_score_gemma":0.000169386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002575804,"about_ca_topic_score_gemma":0.00009126872,"domain_scores_codex":[0.9970656,0.001062738,0.0004952524,0.0006728048,0.000231166,0.0004724616],"domain_scores_gemma":[0.9982318,0.00009867513,0.0002500557,0.0006414524,0.0006026181,0.0001754038],"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.00008721064,0.0004863093,0.008512939,0.00007580345,0.00004501333,0.0001676824,0.008466375,0.1483692,0.02060978,0.003927294,0.0008302004,0.8084222],"study_design_scores_gemma":[0.00102679,0.00009180897,0.01129249,0.000406671,0.000005457341,0.00001750489,0.00003918056,0.9857107,0.000340235,0.00003271314,0.0006097616,0.0004266681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02113176,0.0006402272,0.9724246,0.0006609943,0.00007150001,0.0003672086,3.929597e-7,0.0002602877,0.004443053],"genre_scores_gemma":[0.960601,0.0001273263,0.03755875,0.0008131337,0.00005921072,0.0000330818,0.00001009434,0.0000423883,0.0007549693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9394693,"threshold_uncertainty_score":0.9999772,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1557290754","doi":"","title":"Coherent and incoherent interference reduction using a subband tradeoff beamformer","year":2011,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Interference (communication); Computer science; Reduction (mathematics); Perspective (graphical); Distortion (music); Noise (video); Noise reduction; Beamforming; Speech recognition; Set (abstract data type); Acoustics; Signal-to-noise ratio (imaging); Algorithm; Mathematics; Artificial intelligence; Telecommunications; Physics; Bandwidth (computing); Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.08395056231313583,"gpt":0.2503585055145274,"spread":0.1664079432013916,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004659744,0.0003263823,0.0002599004,0.0001629516,0.0003828967,0.0006670437,0.0008118043,0.00005436286,0.00008444123],"category_scores_gemma":[0.00001778057,0.0002906882,0.0000472875,0.0003666646,0.0002242877,0.001487384,0.0003381567,0.0003341882,0.00003194283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004816013,"about_ca_system_score_gemma":0.0002238464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002218783,"about_ca_topic_score_gemma":0.000003464336,"domain_scores_codex":[0.9978706,0.0001734285,0.0004389109,0.0007431559,0.0002985628,0.0004752971],"domain_scores_gemma":[0.9989344,0.00001617803,0.0003034339,0.0002987859,0.0002158242,0.0002314101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005427755,0.0001568402,0.000923174,0.0001713211,0.00002432693,0.00004902301,0.01092554,0.00000899949,0.1499981,0.0006574015,0.00004784477,0.8369831],"study_design_scores_gemma":[0.003623993,0.001819443,0.02043213,0.00522622,0.00020557,0.002655643,0.003422512,0.08721618,0.8482038,0.02087414,0.002009303,0.004311045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445007,0.0005999456,0.7395241,0.00006438941,0.0001507556,0.0001607044,0.000001193963,0.0002621903,0.01473609],"genre_scores_gemma":[0.9302889,0.00002100256,0.06931349,0.0001003138,0.0001018484,0.000004546046,0.00000162071,0.0000278928,0.000140408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8326721,"threshold_uncertainty_score":0.9999545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116739232","doi":"","title":"Majorization-minimization technique for multi-static radar code design","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Clutter; Metric (unit); Code (set theory); Minification; Computer science; Divergence (linguistics); Convex optimization; Radar; Majorization; Constraint (computer-aided design); Algorithm; Optimization problem; Mathematical optimization; Mathematics; Regular polygon; Engineering; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05568020140906792,"gpt":0.2548403574114084,"spread":0.1991601560023405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004017274,0.0002882538,0.000251662,0.0001255638,0.0002637097,0.000484272,0.0003061409,0.00006818154,0.00009359591],"category_scores_gemma":[0.0000562388,0.0002769145,0.00004662459,0.0002508663,0.00006151351,0.0006522036,0.00002428949,0.00016963,0.00009392329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005038747,"about_ca_system_score_gemma":0.000101948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000497424,"about_ca_topic_score_gemma":7.029354e-7,"domain_scores_codex":[0.9984602,0.0001398537,0.0005015154,0.000331993,0.000203415,0.0003630363],"domain_scores_gemma":[0.9991168,0.00007873997,0.0001413492,0.0001555585,0.0003843957,0.0001230918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003348358,0.0001165474,0.00008294724,0.002661589,0.00007220612,0.00002195288,0.00315664,0.05956775,0.6847502,0.0005286494,0.008595944,0.2404121],"study_design_scores_gemma":[0.0004942128,0.00006946945,0.0001145367,0.0005421364,0.00002312027,0.00001550536,0.000177568,0.9689653,0.0271574,0.0005075703,0.001454025,0.0004791543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000332355,0.0002895658,0.9941636,0.00003614247,0.00008844806,0.001028495,0.000009366172,0.0005546505,0.003497433],"genre_scores_gemma":[0.7878144,0.000008543966,0.2112206,0.00005860465,0.0001098453,0.0001372319,0.00002340047,0.0001102175,0.0005170964],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9093975,"threshold_uncertainty_score":0.9999683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167894290","doi":"","title":"Subspace-based speech enhancement by updating noise characteristics in the presence of speech","year":2008,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Moncton; Institut National de la Recherche Scientifique","funders":"","keywords":"Subspace topology; Signal subspace; Speech enhancement; Speech recognition; Computer science; Noise (video); Principal component analysis; Distortion (music); Variance (accounting); Pattern recognition (psychology); Noise reduction; Noise measurement; SIGNAL (programming language); Selection (genetic algorithm); Signal-to-noise ratio (imaging); Artificial intelligence; Algorithm; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03058665329831157,"gpt":0.2454176022873812,"spread":0.2148309489890696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00125456,0.0002806019,0.0003080317,0.0001248042,0.000313137,0.000342095,0.002000352,0.00004149498,0.00004549241],"category_scores_gemma":[0.000153076,0.0002223777,0.00005378553,0.0007683424,0.0002520261,0.0006339429,0.0002049007,0.0003877725,0.00004172556],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003342576,"about_ca_system_score_gemma":0.0004367094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001811959,"about_ca_topic_score_gemma":0.000003169746,"domain_scores_codex":[0.997127,0.000383948,0.000634292,0.0005900412,0.00076911,0.0004956122],"domain_scores_gemma":[0.9983941,0.0001601156,0.0005326994,0.0005022833,0.0003174411,0.00009338028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004986767,0.0004223232,0.007752987,0.0003407096,0.00001018636,0.0006198949,0.0059603,0.00004318227,0.2767316,0.0001863775,0.001299315,0.7065832],"study_design_scores_gemma":[0.001167657,0.0003469761,0.009258183,0.001429211,0.00001653378,0.0001737575,0.0003503305,0.04916725,0.9341198,0.0002935398,0.002783417,0.0008933342],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4257541,0.0003237477,0.560376,0.0009154858,0.00008053971,0.0002686092,0.00000607479,0.0001182891,0.0121571],"genre_scores_gemma":[0.9644376,0.00002653074,0.03469006,0.0005477562,0.00008631514,0.000006670949,0.00001101542,0.00002060849,0.0001734173],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7056898,"threshold_uncertainty_score":0.90683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1565673794","doi":"","title":"Single-carrier equalization and distributed beamforming for asynchronous two-way relay networks","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Relay; Transceiver; Beamforming; Computer science; Channel (broadcasting); Asynchronous communication; Equalization (audio); Interference (communication); Relay channel; Intersymbol interference; Electronic engineering; Power (physics); Telecommunications; Engineering; Wireless","retraction":null,"screen_n_in":null,"score":{"opus":0.04953907120453908,"gpt":0.2650630082704354,"spread":0.2155239370658963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005252153,0.0002037575,0.0001791472,0.00006358328,0.0006094948,0.001129136,0.0006984408,0.00003595535,0.00003752836],"category_scores_gemma":[0.00008076066,0.0001903822,0.00003494764,0.0003256268,0.0001072888,0.001032127,0.0003940413,0.0001846744,0.00001452325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004307125,"about_ca_system_score_gemma":0.00006702806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003017043,"about_ca_topic_score_gemma":0.000004006399,"domain_scores_codex":[0.9984703,0.0002571331,0.0003546325,0.0004307976,0.0001498492,0.000337292],"domain_scores_gemma":[0.9986423,0.0001550493,0.0002115536,0.0003402729,0.0005090632,0.0001418037],"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.000006140281,0.0000411117,0.0001396096,0.00003077091,0.00001136695,0.000001946826,0.001216777,0.004283524,0.006927875,0.01288495,0.0003261797,0.9741297],"study_design_scores_gemma":[0.0004452727,0.0001031706,0.0004920859,0.000198472,0.000008494139,0.00001053853,0.00005182476,0.9933807,0.0004622765,0.0005046428,0.004040994,0.0003015911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004617355,0.000752475,0.9903768,0.0003707955,0.00006877864,0.00032183,0.000002779899,0.0002239441,0.003265211],"genre_scores_gemma":[0.9707062,0.00005981734,0.02853354,0.0003542392,0.0001136329,0.00002797951,0.00003882891,0.00002403607,0.0001417329],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9890971,"threshold_uncertainty_score":0.9999078,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126349270","doi":"","title":"Processing of low quality document images: Issues and directions","year":2008,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Digital Media Forensic Detection","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Preprocessor; Quality (philosophy); Document image processing; Scale (ratio); Historical document; Information retrieval; Image quality; Degradation (telecommunications); Data mining; Artificial intelligence; Image (mathematics); Image segmentation; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.03518356667216791,"gpt":0.279084193577136,"spread":0.2439006269049681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004737604,0.0001808767,0.0002246216,0.0001177937,0.0002649563,0.000338081,0.0004286972,0.00002551885,0.000008446266],"category_scores_gemma":[0.0001015161,0.000166704,0.00003682012,0.0003940542,0.0003849946,0.001494264,0.0002217824,0.0001527354,0.00002243009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002320787,"about_ca_system_score_gemma":0.0001643003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003143867,"about_ca_topic_score_gemma":0.000002399045,"domain_scores_codex":[0.998322,0.0001731163,0.0004083972,0.0004609974,0.0003969592,0.0002385156],"domain_scores_gemma":[0.9989434,0.00005046125,0.0002777771,0.0002441282,0.0003660273,0.0001181535],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001195202,0.00007671095,0.0005154837,0.0002381047,0.000007547324,0.00003286986,0.003112411,0.0000112815,0.00898911,0.0007012345,0.0001571533,0.9861462],"study_design_scores_gemma":[0.005399303,0.002723053,0.2458462,0.008578891,0.0001234028,0.002115601,0.00232094,0.06941751,0.5939673,0.03514163,0.02868555,0.005680607],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1737973,0.002365622,0.7474211,0.0005127468,0.0002663422,0.0002920379,0.000004626047,0.0007581753,0.07458206],"genre_scores_gemma":[0.9857683,0.00006522401,0.01328553,0.00005961368,0.00006694763,0.00000434625,0.000001326672,0.00001589546,0.0007328512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9804655,"threshold_uncertainty_score":0.6797993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129105667","doi":"","title":"Distortion estimation for reference frame modification methods","year":2011,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Encoder; Distortion (music); Channel (broadcasting); Algorithm; Transmission (telecommunications); Rate–distortion theory; Rate–distortion optimization; Reference software; Software; Real-time computing; Artificial intelligence; Data compression; Telecommunications; Multiview Video Coding; Bandwidth (computing); Video processing","retraction":null,"screen_n_in":null,"score":{"opus":0.2301197313659844,"gpt":0.3618827158159812,"spread":0.1317629844499968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505851,0.0001658202,0.0001473444,0.0001200954,0.0002995502,0.0002668341,0.001165898,0.00006015414,0.00001592481],"category_scores_gemma":[0.0001503101,0.000147304,0.00004030509,0.0002459197,0.00008509633,0.00072994,0.000189856,0.0001828978,0.0000441362],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002860614,"about_ca_system_score_gemma":0.00007975901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000809582,"about_ca_topic_score_gemma":3.44491e-7,"domain_scores_codex":[0.9985603,0.0002126336,0.0003171919,0.0005029485,0.0001732876,0.0002336288],"domain_scores_gemma":[0.9988351,0.00006933657,0.0002836707,0.0004458019,0.0003038516,0.00006224062],"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.00001058468,0.00003675247,0.00001405251,0.00003469715,0.000003004787,0.000001105245,0.00110399,0.00003681458,0.00844869,0.0342735,0.0001026771,0.9559341],"study_design_scores_gemma":[0.0002890491,0.0002400515,0.002421263,0.0002746074,0.00001741815,0.000009832897,0.0001664687,0.8120202,0.07392552,0.1077987,0.002362266,0.0004745821],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001667894,0.0001417063,0.9854837,0.0001328651,0.0000839355,0.000156925,0.000001410643,0.0009608637,0.01137066],"genre_scores_gemma":[0.5831003,0.000004839326,0.4166896,0.00004159221,0.00001293842,0.00002350858,0.000003889125,0.000008870947,0.0001143861],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9554595,"threshold_uncertainty_score":0.6006882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1675199867","doi":"","title":"Automated Gaussian filtering VIA Gaussian scale space and linear diffusion","year":2012,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Scale space; Gaussian; Gaussian noise; Noise reduction; Gaussian filter; Algorithm; Convolution (computer science); Non-local means; Estimator; Noise (video); Computer science; Gaussian blur; Artificial intelligence; Mathematics; Filter (signal processing); Anisotropic diffusion; Pattern recognition (psychology); Computer vision; Image (mathematics); Image processing; Image restoration; Statistics; Image denoising; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02851690265120286,"gpt":0.2772865265401332,"spread":0.2487696238889304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001168172,0.0003134822,0.0002708451,0.0001197953,0.0004761732,0.0006680773,0.0007170795,0.00006044675,0.00004280583],"category_scores_gemma":[0.00003747985,0.0002727703,0.00004927478,0.0003894895,0.000149842,0.00143883,0.000550965,0.0003162057,0.0001379286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002587148,"about_ca_system_score_gemma":0.00006916302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001376264,"about_ca_topic_score_gemma":6.463813e-7,"domain_scores_codex":[0.9975473,0.0005569135,0.0003429936,0.0005362898,0.0003559003,0.0006605766],"domain_scores_gemma":[0.9988693,0.00006810324,0.0001901747,0.000382226,0.0001237474,0.0003664667],"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.00003672792,0.0001537352,0.001325709,0.0001928677,0.00001410589,0.0001166259,0.006796079,0.00002671307,0.3960674,0.001196065,0.0002889641,0.5937849],"study_design_scores_gemma":[0.001369498,0.0002416072,0.04060213,0.0009316233,0.00004214913,0.0004757605,0.0001506255,0.9027161,0.0458023,0.0007335998,0.005629314,0.0013053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02816207,0.0005150161,0.947594,0.0003417646,0.0001733818,0.0001101349,0.000001132124,0.0009402556,0.02216225],"genre_scores_gemma":[0.8436506,0.00001160274,0.1552149,0.000252904,0.0002361733,0.000002219139,0.000002902018,0.0000351977,0.0005935099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9026894,"threshold_uncertainty_score":0.9999725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1485477320","doi":"","title":"Adaptive regularization in frequency-domain NLMS filters","year":2012,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Regularization (linguistics); Regularization perspectives on support vector machines; Adaptive filter; Frequency domain; Bin; Algorithm; Kernel adaptive filter; Mathematics; Computer science; Mathematical optimization; Digital filter; Filter (signal processing); Inverse problem; Artificial intelligence; Mathematical analysis; Tikhonov regularization","retraction":null,"screen_n_in":null,"score":{"opus":0.02926880428191338,"gpt":0.2337782970489587,"spread":0.2045094927670453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003492072,0.0002288857,0.0001702125,0.0001408173,0.00006145419,0.00006012336,0.0002591902,0.00004512394,0.00006086046],"category_scores_gemma":[0.00001980039,0.0002435289,0.0000271133,0.0002676923,0.0000865149,0.0007722532,0.00006113348,0.0002830703,0.00006040449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131026,"about_ca_system_score_gemma":0.00002447412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002433797,"about_ca_topic_score_gemma":0.000001733419,"domain_scores_codex":[0.9987922,0.000119695,0.0002789402,0.000216405,0.0001666718,0.0004261326],"domain_scores_gemma":[0.999576,0.00002358387,0.00006668355,0.0001683182,0.00006432857,0.0001011266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008669288,0.0002298424,0.005409465,0.0005002848,0.00005598164,0.0001757008,0.01457175,0.006963999,0.5989055,0.08180026,0.0005771363,0.2907234],"study_design_scores_gemma":[0.004603613,0.001109975,0.1124783,0.01033876,0.0001207594,0.0002899186,0.004840447,0.2430684,0.1970933,0.4030432,0.01295597,0.01005741],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01736566,0.0003711621,0.8821876,0.0000148864,0.00007496649,0.0001500226,0.000005787328,0.000821229,0.09900866],"genre_scores_gemma":[0.8842887,0.00001015646,0.115358,0.00003390623,0.0001072366,0.0000119664,0.0000107482,0.00006847041,0.000110928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.866923,"threshold_uncertainty_score":0.9930822,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153734993","doi":"","title":"Spatio-temporal object recognition using variational learning of an infinite statistical model","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Inference; Artificial intelligence; Bayesian inference; Machine learning; Statistical model; Bayes' theorem; Object (grammar); Statistical inference; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Feature (linguistics); Activity recognition; Nonparametric statistics; Bayesian probability; Key (lock); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06534754987773936,"gpt":0.2898479345544215,"spread":0.2245003846766822,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008414881,0.0001756006,0.00020106,0.0001178849,0.0001916984,0.0004061332,0.0004446809,0.00004503919,0.0001063339],"category_scores_gemma":[0.00008627408,0.0001679372,0.000032417,0.0002242686,0.00008522079,0.001389266,0.000130764,0.0002844805,0.00003338438],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002031374,"about_ca_system_score_gemma":0.0003536725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004607708,"about_ca_topic_score_gemma":0.000001243234,"domain_scores_codex":[0.9979164,0.0006557794,0.0004170711,0.0004246979,0.0003365532,0.0002495263],"domain_scores_gemma":[0.9987342,0.00009074823,0.0003057156,0.0001833234,0.0005486829,0.0001373593],"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.0000159729,0.00009066865,0.0001727015,0.0000768996,0.00001034148,0.00001146592,0.001834031,0.007275467,0.007461374,0.01906949,0.00001876279,0.9639629],"study_design_scores_gemma":[0.0001905255,0.00009933995,0.0007627788,0.0001083224,0.000009546175,0.0000130349,0.00001501494,0.9415504,0.0004519337,0.05657899,0.00001183734,0.0002083126],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02311837,0.00001818089,0.97075,0.0000318879,0.0000321243,0.0001195026,0.000006520918,0.0001072273,0.005816173],"genre_scores_gemma":[0.5110486,7.316858e-7,0.4887945,0.00005648016,0.0000361345,0.000001905501,0.00002114694,0.00001133426,0.00002921745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9637545,"threshold_uncertainty_score":0.684828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1597835510","doi":"","title":"Efficient design of waveforms for robust pulse amplitude modulation using mean square error criteria","year":2000,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Robustness (evolution); Mean squared error; Computer science; Filter design; Waveform; Bandwidth (computing); Control theory (sociology); Convex optimization; Electronic engineering; Mathematics; Algorithm; Filter (signal processing); Regular polygon; Telecommunications; Engineering; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08757771919209903,"gpt":0.2846696933449917,"spread":0.1970919741528927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004099644,0.0002300408,0.0002252542,0.0001128436,0.0001536386,0.0001250058,0.0002297914,0.00004632709,0.0003953702],"category_scores_gemma":[0.00001968345,0.0002240322,0.00005830167,0.000208897,0.00008623752,0.0001749442,0.00001898435,0.000126086,0.00002413796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007637175,"about_ca_system_score_gemma":0.00005806177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004255935,"about_ca_topic_score_gemma":3.116486e-7,"domain_scores_codex":[0.9986296,0.00008699597,0.0004590189,0.0002884917,0.0002229538,0.0003128823],"domain_scores_gemma":[0.9993649,0.00003209044,0.0001014251,0.0001905915,0.0002234336,0.00008758046],"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.00004206844,0.0000284984,0.00000698361,0.0002314873,0.00001158489,0.000001992433,0.001006882,0.8433925,0.08867574,0.00001932757,0.00002572667,0.06655724],"study_design_scores_gemma":[0.0003419508,0.00005497488,0.000409657,0.0003273709,0.00002412124,0.00001459166,0.0001209269,0.9929323,0.005300486,0.0001004821,0.0001060556,0.0002670446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2212651,0.00009190496,0.7754628,0.00000921266,0.00009775048,0.0002953598,0.00001355855,0.0002268618,0.002537433],"genre_scores_gemma":[0.9503917,0.000002983553,0.04924526,0.00001072118,0.0001367823,0.000009401441,0.00001354741,0.00007615118,0.000113436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7291266,"threshold_uncertainty_score":0.9135769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1854882488","doi":"","title":"Game-theoretic learning for activation of diffusion least mean squares","year":2013,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Diffusion; Mathematical optimization; Set (abstract data type); Game theory; Energy (signal processing); Function (biology); Control (management); Activation function; Mathematics; Artificial intelligence; Statistics; Artificial neural network; Mathematical economics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01731784369583357,"gpt":0.25447582284939,"spread":0.2371579791535564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001737865,0.0001215943,0.0001487835,0.00003871675,0.0001736273,0.0001469513,0.0001699177,0.00001793903,0.0002789109],"category_scores_gemma":[0.00001247757,0.0001118425,0.00005743819,0.00008767503,0.0001131739,0.0002331092,0.00004715659,0.0001375704,0.00002602851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008551293,"about_ca_system_score_gemma":0.00005809581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000582285,"about_ca_topic_score_gemma":2.350218e-7,"domain_scores_codex":[0.9991663,0.00009526313,0.0002370235,0.0001953399,0.0001326896,0.0001733771],"domain_scores_gemma":[0.9992142,0.0000596726,0.0002401732,0.00007826991,0.0003547696,0.00005293014],"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.00004171867,0.0001890557,0.01823613,0.0002984662,0.00003231038,2.957448e-7,0.007762178,0.001597604,0.08892594,0.09628944,0.00006478467,0.7865621],"study_design_scores_gemma":[0.002857862,0.000870078,0.05375075,0.002845005,0.00008548483,9.74818e-7,0.01228629,0.7783406,0.02224028,0.121525,0.003528704,0.001668915],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6456875,0.00001159378,0.3343491,0.00006599827,0.00002702968,0.0002111404,0.000004035747,0.00003496139,0.01960866],"genre_scores_gemma":[0.9989302,0.000001245573,0.0004149956,0.00002265119,0.0001306834,0.0000128482,0.00003096585,0.00002313845,0.000433286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7848932,"threshold_uncertainty_score":0.4560804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1532658419","doi":"","title":"A modified Viterbi algorithm for non-Gaussian interference scenarios","year":2000,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Viterbi algorithm; Soft output Viterbi algorithm; Iterative Viterbi decoding; Computer science; Viterbi decoder; Algorithm; Turbo; Interference (communication); Gaussian noise; Speech recognition; Telecommunications; Sequential decoding; Decoding methods; Channel (broadcasting); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0243667041949315,"gpt":0.2569751470570925,"spread":0.232608442862161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000207351,0.0002810899,0.0002397285,0.00009414736,0.0001807558,0.0002099733,0.0007746553,0.00005508071,0.0001620813],"category_scores_gemma":[0.00000834533,0.0002880625,0.00005823031,0.0001882389,0.0001106252,0.0004145732,0.00006264007,0.0003207704,0.00009895444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004916902,"about_ca_system_score_gemma":0.00004367014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578372,"about_ca_topic_score_gemma":0.000001238412,"domain_scores_codex":[0.9987401,0.0000636129,0.0003801885,0.0003215983,0.0001365984,0.0003579306],"domain_scores_gemma":[0.999222,0.00004785365,0.00006964834,0.0004083694,0.0001374257,0.0001146595],"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.00001130472,0.00002366769,0.000002688227,0.00007602644,0.000008770715,0.000004579001,0.0005590052,0.002344821,0.007008296,0.00006269444,0.000145925,0.9897522],"study_design_scores_gemma":[0.0003723036,0.00008583124,0.00006782324,0.000541649,0.00001134524,0.00001087707,0.00006430607,0.9819938,0.01062317,0.0007209082,0.00504462,0.0004633997],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003185424,0.0001866331,0.9480862,0.0000444777,0.00002940208,0.0003043332,0.00001688392,0.001179631,0.04696704],"genre_scores_gemma":[0.9087231,0.00009637918,0.09010836,0.00009940883,0.0000777887,0.0000634247,0.00002544817,0.00009119363,0.0007149483],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9892888,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1542153889","doi":"","title":"Statistical analysis of adaptive neural network inversion of Hammerstein systems for Gaussian inputs","year":2002,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Artificial neural network; Multilayer perceptron; Adaptive filter; Kernel adaptive filter; Computer science; Backpropagation; Adaptive system; Gaussian; Perceptron; Algorithm; Nonlinear system; Wiener filter; Filter (signal processing); Least mean squares filter; Activation function; Control theory (sociology); Deconvolution; Inversion (geology); Mathematics; Artificial intelligence; Filter design","retraction":null,"screen_n_in":null,"score":{"opus":0.05691095865527767,"gpt":0.2564117848771848,"spread":0.1995008262219071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000270136,0.0001410807,0.0003280436,0.0001194045,0.0001368575,0.0001049702,0.0006113686,0.00002702951,0.00002019651],"category_scores_gemma":[0.00001303466,0.0001240399,0.00008498063,0.001027284,0.0001290888,0.0002188221,0.000127992,0.0001064722,0.000004756745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001188095,"about_ca_system_score_gemma":0.00002418091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001234252,"about_ca_topic_score_gemma":0.000002361193,"domain_scores_codex":[0.9985337,0.0001760708,0.0004364863,0.0003646629,0.0002379525,0.0002511772],"domain_scores_gemma":[0.9988453,0.0001753564,0.0003840971,0.0002614564,0.0002334187,0.0001003938],"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.0001254458,0.0003673205,0.002638746,0.0004886939,0.0006680394,0.00003893114,0.002692825,0.3486159,0.007265226,0.1942345,0.009479628,0.4333848],"study_design_scores_gemma":[0.0001650948,0.000183573,0.001047471,0.00009611376,0.0001250888,0.000001297343,0.00002427989,0.9975256,0.000159117,0.0001940403,0.0003460918,0.0001321786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005684447,0.0003289553,0.9910545,0.0001820774,0.00004628023,0.0001910982,0.00002244213,0.00004488312,0.002445363],"genre_scores_gemma":[0.9886237,0.000009883867,0.01110512,0.00006409031,0.00006492685,0.000007135991,0.00001063238,0.00001048259,0.0001039649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9829393,"threshold_uncertainty_score":0.50582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1560411157","doi":"10.5281/zenodo.39157","title":"The Use Of Decorrelation And Code Division Multiplexed Pilots For Ds-Cdma Systems With Multiantenna Receivers","year":2005,"lang":"en","type":"article","venue":"European Signal Processing Conference","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Decorrelation; Code division multiple access; Computer science; Bit error rate; Rayleigh fading; Channel (broadcasting); Electronic engineering; Division (mathematics); Fading; Code (set theory); Multiplexing; Telecommunications; Algorithm; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06301900237684964,"gpt":0.2512832077057425,"spread":0.1882642053288928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002131907,0.0001343272,0.0001298769,0.00004639151,0.0002056295,0.0001355263,0.0002106382,0.00002504568,9.361452e-7],"category_scores_gemma":[0.00005881315,0.00009842513,0.00001510752,0.00008783763,0.0001250351,0.0004413648,0.00004074127,0.0001285162,0.000002287027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002702872,"about_ca_system_score_gemma":0.00001680084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003522803,"about_ca_topic_score_gemma":0.00001703166,"domain_scores_codex":[0.9992414,0.00007955886,0.0002697908,0.0001495272,0.000115316,0.0001444795],"domain_scores_gemma":[0.9990627,0.000287613,0.0001511682,0.0002127392,0.0002437528,0.00004204418],"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.0001195941,0.00002863583,0.0008111463,0.0002268212,0.00002460768,0.000001074279,0.001060631,0.1440343,0.05421946,0.0003327622,0.0001449635,0.798996],"study_design_scores_gemma":[0.0003810804,0.00006877485,0.001579069,0.0005647998,0.00001031965,0.000003033937,0.0001417132,0.9841276,0.003349091,0.00001265187,0.009599583,0.0001622516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03945563,0.0007474249,0.9586373,0.00004300544,0.0000218183,0.0003869945,0.00001818954,0.0003425515,0.0003471065],"genre_scores_gemma":[0.9575015,0.0002138852,0.04210926,0.000008819856,0.00001716402,0.0000175411,0.00001032986,0.00004108307,0.00008041252],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9180459,"threshold_uncertainty_score":0.401366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}