{"meta":{"query_hash":"8f9c8a7e256b","filters":{"venue":"IEEE Transactions on Neural Networks"},"cohort_total":114,"direct_labels_cover":0,"predictions_cover":114,"exported":114,"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/8f9c8a7e256b","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Neural+Networks"},"results":[{"id":"W1500616748","doi":"10.1109/tnn.2003.811562","title":"A Kohonen-like decomposition method for the euclidean traveling salesman problem - KNIES_DECOMPOSE","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Euclidean geometry; 2-opt; Self-organizing map; Heuristic; Euclidean distance; Partition (number theory); Mathematical optimization; Computer science; Artificial neural network; Traveling purchaser problem; Mathematics; Decomposition; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.020380633936201206,"score_gpt":0.28915941299335646,"score_spread":0.26877877905715525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500616748","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.0006748329,0.00018972787,0.9940377,0.0021075539,0.0013215893,0.0011486784,0.000008914648,0.00030334658,0.00020764284],"genre_scores_gemma":[0.85982776,0.00012371209,0.13697775,0.0019402684,0.00017456255,0.00058786565,0.0000051262728,0.000044076984,0.00031889288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978469,0.00022280929,0.00046519577,0.0006529655,0.00022617067,0.0005859326],"domain_scores_gemma":[0.9975971,0.0012330342,0.00014835752,0.0007655331,0.000093018265,0.00016298515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045638648,0.00031963363,0.0002567842,0.00007404257,0.0011959218,0.00030841838,0.00078728795,0.00012827481,0.000023032439],"category_scores_gemma":[0.0000022369861,0.00024708683,0.00032068574,0.00069359184,0.000062379455,0.0003378421,0.0000047240155,0.0005426383,0.000016062448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026315134,0.00012234061,0.0000010979497,0.000006676012,0.000044353616,0.0000023033851,0.00008211874,0.8607316,0.00038553812,0.006304636,0.0012095448,0.13108346],"study_design_scores_gemma":[0.00052908977,0.00016540985,0.000020206911,0.000020685924,0.000059068843,0.00008859283,0.000016806218,0.98634,0.0012653255,0.0018195873,0.009375978,0.0002992355],"about_ca_topic_score_codex":0.000015583699,"about_ca_topic_score_gemma":0.000059205064,"teacher_disagreement_score":0.8591529,"about_ca_system_score_codex":0.000049782346,"about_ca_system_score_gemma":0.000024957606,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W1971944463","doi":"10.1109/tnn.2011.2169809","title":"Parallel Programmable Asynchronous Neighborhood Mechanism for Kohonen SOM Implemented in CMOS Technology","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Self-organizing map; Computer science; Asynchronous communication; Artificial neural network; Chip; CMOS; Realization (probability); Topology (electrical circuits); Artificial intelligence; Electronic engineering; Electrical engineering; Mathematics; Engineering","score_opus":0.025429751763777934,"score_gpt":0.24847249950286876,"score_spread":0.22304274773909083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971944463","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.002628251,0.000048074544,0.99339664,0.0012129894,0.0005860031,0.0014668242,0.00000997824,0.00050078606,0.00015048026],"genre_scores_gemma":[0.95213664,0.00006392277,0.04546489,0.00048667693,0.000072770395,0.0016538313,0.0000048257643,0.00003451893,0.00008191999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978403,0.00004551915,0.00046153937,0.0006859946,0.00015070803,0.00081592525],"domain_scores_gemma":[0.9988484,0.000086314205,0.00012882298,0.0007103661,0.00008948773,0.00013665168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012441388,0.00030020534,0.00029204576,0.00024664818,0.0003348536,0.00008336525,0.00089888193,0.00021167593,0.000031094638],"category_scores_gemma":[0.0000016655447,0.00028798459,0.0001599182,0.0010888282,0.000062377614,0.00034412186,0.000011480802,0.00048562014,0.000013588744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019275967,0.0015831771,0.00012006753,0.000026848558,0.00012390527,0.00004413962,0.0003326345,0.23451944,0.000741733,0.19559717,0.00055013393,0.566168],"study_design_scores_gemma":[0.0011550564,0.0005533045,0.00004476766,0.000020002695,0.000022586708,0.000028730145,0.000033416713,0.97450995,0.002376249,0.020663116,0.00024169256,0.00035109514],"about_ca_topic_score_codex":0.000053161133,"about_ca_topic_score_gemma":0.00024931403,"teacher_disagreement_score":0.94950837,"about_ca_system_score_codex":0.00006163753,"about_ca_system_score_gemma":0.00003262385,"threshold_uncertainty_score":0.9999572},"labels":[],"label_agreement":null},{"id":"W1984461808","doi":"10.1109/72.950141","title":"Neural-network control of mobile manipulators","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Control and Dynamics of Mobile Robots","field":"Engineering","cited_by":216,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Artificial neural network; Computer science; Convergence (economics); Controller (irrigation); Estimator; Kinematics; Mobile manipulator; Motion control; Stability (learning theory); Bounded function; Mobile robot; Tracking (education); Process (computing); Control engineering; Artificial intelligence; Control (management); Robot; Mathematics; Engineering; Machine learning","score_opus":0.0068421050308280235,"score_gpt":0.1984100618241816,"score_spread":0.1915679567933536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984461808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14847036,0.00091180456,0.84693366,0.000042031355,0.002336584,0.00045867648,0.000014571822,0.00044693463,0.00038536836],"genre_scores_gemma":[0.9988553,0.00035983298,0.00007205898,0.00012741258,0.00027927462,0.000115361174,0.0000032891405,0.00006364969,0.00012381523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986088,0.000041541938,0.00042875088,0.00023568589,0.00018310537,0.0005021139],"domain_scores_gemma":[0.99922615,0.00017805591,0.000054883836,0.00035393445,0.00004125825,0.00014569757],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009051082,0.00028485295,0.0003939247,0.00009562841,0.00011212481,0.00002538371,0.00020068619,0.00016855053,0.0001339295],"category_scores_gemma":[8.759045e-7,0.0002816129,0.0002609573,0.00035957657,0.000049977287,0.0001447539,9.813372e-7,0.00045482637,0.000011232721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000910973,0.000050812152,0.00013867747,0.000011197667,0.00007338401,0.00001665966,0.000010895339,0.9387138,0.00015297315,0.000015090352,0.00016738877,0.060558014],"study_design_scores_gemma":[0.0009285793,0.00016430063,0.00038318447,0.000023291082,0.00006869013,0.000031306514,0.000006994309,0.99768543,0.000051653897,0.000033149787,0.00037506258,0.00024836833],"about_ca_topic_score_codex":0.000017757615,"about_ca_topic_score_gemma":0.00008353026,"teacher_disagreement_score":0.85038495,"about_ca_system_score_codex":0.000041882045,"about_ca_system_score_gemma":0.0000050059634,"threshold_uncertainty_score":0.9999636},"labels":[],"label_agreement":null},{"id":"W1988196484","doi":"10.1109/tnn.2011.2169808","title":"Bioinspired Neural Network for Real-Time Cooperative Hunting by Multirobots in Unknown Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Computer science; Artificial neural network; Artificial intelligence; Robotics; Motion planning; Alliance; Path (computing); Collision avoidance; Order (exchange); Collision; Computer security","score_opus":0.026455500938740276,"score_gpt":0.238045988728049,"score_spread":0.21159048778930872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988196484","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.017586544,0.00005632865,0.97962904,0.000119126744,0.00147298,0.0007309214,0.000016629798,0.00024770742,0.00014070151],"genre_scores_gemma":[0.8989496,0.00005044016,0.099396594,0.00041795196,0.00016914034,0.00021779317,0.000018736308,0.00006168726,0.0007180464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973484,0.00021120509,0.00052439235,0.00078790914,0.00023734251,0.0008907488],"domain_scores_gemma":[0.9987414,0.0003381164,0.00016422314,0.00054108957,0.000028347076,0.00018682223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002773732,0.00039027276,0.00039156998,0.00012055814,0.00038330563,0.00009015294,0.0007179283,0.00020833079,0.000017097651],"category_scores_gemma":[0.0000058886467,0.00038852004,0.00014784525,0.00058114016,0.00009868728,0.00055122917,0.000009605931,0.0004923598,0.000025095327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005957021,0.00019271972,0.00012718006,0.000003484827,0.000024804358,0.000022103315,0.00032253825,0.97258735,0.0008658709,0.000017081617,0.000462738,0.025314573],"study_design_scores_gemma":[0.0009669833,0.00035811638,0.00090768904,0.000045583824,0.00001834707,0.000013243318,0.00000799388,0.9959362,0.001278228,0.00001715849,0.000060553924,0.0003898647],"about_ca_topic_score_codex":0.00013101312,"about_ca_topic_score_gemma":0.000022976179,"teacher_disagreement_score":0.8813631,"about_ca_system_score_codex":0.00009308428,"about_ca_system_score_gemma":0.000018732919,"threshold_uncertainty_score":0.99985665},"labels":[],"label_agreement":null},{"id":"W1991360560","doi":"10.1109/tnn.2010.2050601","title":"Neural-Network-Based Adaptive Leader-Following Control for Multiagent Systems With Uncertainties","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":340,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Artificial neural network; Multi-agent system; Control theory (sociology); Constraint (computer-aided design); Tracking error; Adaptive control; State (computer science); Control (management); Artificial intelligence; Algorithm; Mathematics","score_opus":0.01990881461671435,"score_gpt":0.2318356880729288,"score_spread":0.21192687345621447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991360560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070305183,0.00016497172,0.9795939,0.00073052134,0.009327962,0.00239478,0.00006701219,0.0006619003,0.000028477318],"genre_scores_gemma":[0.99446857,0.0000019303363,0.003070902,0.000592839,0.0005261229,0.0010785889,0.000011409034,0.000068602974,0.00018102076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646825,0.00026468575,0.0006348295,0.000939913,0.0005681467,0.001124157],"domain_scores_gemma":[0.9970829,0.0010451693,0.00029843496,0.0010051086,0.00024452546,0.00032387077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047479235,0.00058555644,0.0006757903,0.00015953631,0.00071596686,0.00051146705,0.0010245846,0.0002827779,0.000006410202],"category_scores_gemma":[0.0000098877945,0.0004861897,0.00048608097,0.00058519817,0.00012072061,0.00060126564,0.000003508771,0.00092655903,0.00001046837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003297351,0.00013277064,0.000063163956,0.000019359599,0.0002110426,0.00003543516,0.000053050473,0.99064463,0.00028063628,0.00031254263,0.0003692208,0.0075484277],"study_design_scores_gemma":[0.004353331,0.0006229358,0.00007721382,0.00009146262,0.0001421393,0.000024708077,0.00005303808,0.99343145,0.00017953795,0.000008929243,0.00046567802,0.0005495483],"about_ca_topic_score_codex":0.00014963427,"about_ca_topic_score_gemma":0.0003216094,"teacher_disagreement_score":0.9874381,"about_ca_system_score_codex":0.00010214171,"about_ca_system_score_gemma":0.00008596302,"threshold_uncertainty_score":0.99975896},"labels":[],"label_agreement":null},{"id":"W1995349519","doi":"10.1109/tnn.2003.810608","title":"Bias learning, knowledge sharing","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Generalization; Artificial intelligence; Machine learning; Inductive bias; Class (philosophy); Multi-task learning; Domain (mathematical analysis); Space (punctuation); Domain knowledge; Variety (cybernetics); Task (project management); Mathematics","score_opus":0.027695966266377804,"score_gpt":0.26385655350726067,"score_spread":0.23616058724088287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995349519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009055929,0.00014761831,0.9839499,0.00014589413,0.0020051212,0.000086940934,2.402068e-7,0.0005338749,0.004074504],"genre_scores_gemma":[0.990543,0.00002709071,0.002398686,0.00016853573,0.00010660923,0.00001684696,5.092324e-7,0.000021934486,0.0067167985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985299,0.00021101351,0.00020813066,0.00048122305,0.00015791159,0.0004118356],"domain_scores_gemma":[0.9991708,0.00017038418,0.000061869585,0.00041154667,0.000039164217,0.00014623479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002877899,0.00020330604,0.00016660092,0.00012793585,0.00047113403,0.00019023007,0.0004948043,0.00009464253,0.00008833153],"category_scores_gemma":[0.000010738529,0.00018831136,0.00014334332,0.0005794154,0.00003144412,0.00024103632,0.0000034854963,0.001012424,0.000100614154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029771911,0.0000779162,0.00008875618,0.0000036443666,0.000012781918,0.000013594105,0.0002088734,0.8685144,0.0000119544075,0.0009347414,0.0001351525,0.12999521],"study_design_scores_gemma":[0.00025540098,0.00013875506,0.00006178551,0.00001699515,0.0000075061052,0.00005837839,0.00000838841,0.99081486,0.00045789283,0.00009195775,0.007871639,0.00021643101],"about_ca_topic_score_codex":0.000014675836,"about_ca_topic_score_gemma":0.000008982764,"teacher_disagreement_score":0.9815512,"about_ca_system_score_codex":0.00002904253,"about_ca_system_score_gemma":0.00001717283,"threshold_uncertainty_score":0.76791143},"labels":[],"label_agreement":null},{"id":"W2003228681","doi":"10.1109/tnn.2011.2176541","title":"Neural Network-Based Multiple Robot Simultaneous Localization and Mapping","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of New Brunswick","funders":"","keywords":"Artificial intelligence; Computer science; Simultaneous localization and mapping; Occupancy grid mapping; Computer vision; Cluster analysis; Robot; Pattern recognition (psychology); Self-organizing map; Mobile robot","score_opus":0.02040240018987655,"score_gpt":0.19345935783708074,"score_spread":0.1730569576472042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003228681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014882044,0.00014500626,0.9827873,0.000025949295,0.0012357114,0.00028749387,0.0000053595872,0.0005315502,0.0000995701],"genre_scores_gemma":[0.9970771,0.000075185526,0.0021551384,0.00041563637,0.0001324308,0.000020278889,0.000018187282,0.000080187,0.000025831645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987217,0.00006261989,0.0003355379,0.00029035725,0.00014992144,0.00043984476],"domain_scores_gemma":[0.99932534,0.0001810696,0.000044480963,0.00023683708,0.0000552956,0.00015697649],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00006750058,0.00029046315,0.00022542749,0.00011463438,0.00026099765,0.000055516342,0.00010205177,0.00019059895,0.00004981541],"category_scores_gemma":[0.0000047353415,0.0003028408,0.00008709112,0.00039560013,0.000063651416,0.0001323238,0.0000010688061,0.0003479591,0.000005687664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005012129,0.00004006906,0.00018619587,0.000022274493,0.000024274212,0.000020856543,0.0000785342,0.98169255,0.000081709186,0.000010310996,0.000082869636,0.017710218],"study_design_scores_gemma":[0.0005247094,0.000100921054,0.00011314191,0.000037436224,0.000034826804,0.0000110553665,0.000015009163,0.99812365,0.00061506033,0.00001586388,0.00009303868,0.0003153155],"about_ca_topic_score_codex":0.00003390278,"about_ca_topic_score_gemma":0.00010083267,"teacher_disagreement_score":0.9821951,"about_ca_system_score_codex":0.00004476347,"about_ca_system_score_gemma":0.000005951211,"threshold_uncertainty_score":0.99994236},"labels":[],"label_agreement":null},{"id":"W2010980582","doi":"10.1109/tnn.2004.828765","title":"Probabilistic Sequential Independent Components Analysis","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Royal Society of Canada","keywords":"Computer science; Independent component analysis; Artificial intelligence; Probabilistic logic; Projection (relational algebra); Sequence (biology); Feature (linguistics); Component (thermodynamics); Field (mathematics); Algorithm; Pattern recognition (psychology); Machine learning; Mathematics","score_opus":0.025676999232074206,"score_gpt":0.2624316476554458,"score_spread":0.2367546484233716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010980582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04137779,0.000011430201,0.9564253,0.000668054,0.0004975941,0.00027564424,0.0000037069026,0.0006034578,0.00013703582],"genre_scores_gemma":[0.993622,0.000010415873,0.005443775,0.00074568053,0.000037719823,0.00005292397,0.0000054420866,0.000012793748,0.00006926077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847424,0.00013168638,0.00031189606,0.00046387909,0.0003218337,0.00029648154],"domain_scores_gemma":[0.99907744,0.00005772776,0.00009162978,0.00057233905,0.00007041887,0.00013043577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018934443,0.00019541831,0.00022427403,0.00033159947,0.00022295948,0.00020857692,0.0005786283,0.00012693746,0.000026817166],"category_scores_gemma":[0.0000015764663,0.0001891127,0.00025937142,0.0012773599,0.00005406158,0.0004216921,0.000005127619,0.00046669872,0.000020120939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012195367,0.0001692606,0.0000069394537,0.0000017629901,0.00010320227,0.0000089123105,0.000130261,0.9936842,0.00012955954,0.0016962808,0.000013520091,0.0040439623],"study_design_scores_gemma":[0.0004431243,0.00014464548,0.00050948164,0.000009547399,0.00012417417,0.000018229664,0.000003994907,0.9944833,0.0025055786,0.001463376,0.000048161462,0.00024642298],"about_ca_topic_score_codex":0.00009399926,"about_ca_topic_score_gemma":0.00018245782,"teacher_disagreement_score":0.9522442,"about_ca_system_score_codex":0.00012197111,"about_ca_system_score_gemma":0.00003238654,"threshold_uncertainty_score":0.7711792},"labels":[],"label_agreement":null},{"id":"W2031601132","doi":"10.1109/tnn.2003.816345","title":"Kerneltron: support vector \"machine\" in silicon","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"CCD and CMOS Imaging Sensors","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Support vector machine; Computer hardware; Massively parallel; Very-large-scale integration; Parallel computing; Artificial intelligence; Embedded system","score_opus":0.008405461851561097,"score_gpt":0.20692007297401543,"score_spread":0.19851461112245433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031601132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78055274,0.0003826018,0.20751879,0.00018891276,0.0049618636,0.00037735244,0.000020137024,0.0010196296,0.004977986],"genre_scores_gemma":[0.9992608,0.00006856772,0.000048033377,0.00016176302,0.00005722759,0.00001941775,0.0000024180254,0.000048610145,0.00033315478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907005,0.000040896375,0.00021443168,0.00019914738,0.00010659436,0.00036890438],"domain_scores_gemma":[0.99961394,0.000060033188,0.000013480288,0.00021409753,0.000009537371,0.00008890824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064677704,0.00019969707,0.0001753204,0.000098642064,0.00005666186,0.000029282422,0.000088664136,0.0000909776,0.00028428552],"category_scores_gemma":[0.0000016604681,0.00020721383,0.00009522371,0.00025847513,0.000027721237,0.000108449094,2.392748e-7,0.00052507233,0.000039962448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010767372,0.00004121786,0.00015844678,0.000007504629,0.000011417881,0.00002169013,0.00005854308,0.99031657,0.00040483286,0.000017957946,0.00027596508,0.008675063],"study_design_scores_gemma":[0.00058163,0.00006397337,0.0007919215,0.000017146282,0.000017453372,0.000048242295,0.000028941357,0.9905625,0.0055289567,0.000017616623,0.0020273682,0.00031424285],"about_ca_topic_score_codex":0.000022591741,"about_ca_topic_score_gemma":0.00013812669,"teacher_disagreement_score":0.21870807,"about_ca_system_score_codex":0.00007071092,"about_ca_system_score_gemma":0.000006597557,"threshold_uncertainty_score":0.84499353},"labels":[],"label_agreement":null},{"id":"W2033640106","doi":"10.1109/tnn.2011.2173804","title":"Application of IFT and SPSA to Servo System Control","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Control Systems and Identification","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Simultaneous perturbation stochastic approximation; Linear-quadratic-Gaussian control; Control theory (sociology); Servomechanism; Computer science; Integrator; Linear-quadratic regulator; Mathematical optimization; Control engineering; Optimal control; Stochastic process; Mathematics; Engineering; Control (management); Artificial intelligence; Bandwidth (computing)","score_opus":0.008363191633463907,"score_gpt":0.17722515755277923,"score_spread":0.16886196591931532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033640106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078776754,0.00009429799,0.91970825,0.000017329201,0.00056485494,0.0004376985,0.000011403505,0.00017136293,0.00021802055],"genre_scores_gemma":[0.99965763,0.0000091904285,0.0000778188,0.00001907477,0.000060307397,0.0001238984,9.453326e-7,0.000019496823,0.000031665964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993918,0.000021429014,0.0002430998,0.00014184073,0.0000740228,0.00012780093],"domain_scores_gemma":[0.99961895,0.00002657346,0.000034566405,0.00020890207,0.000037665897,0.0000733426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077183475,0.00010281237,0.00016285198,0.000073391384,0.00004841488,0.000013353884,0.00006849766,0.000067705216,0.0000063730163],"category_scores_gemma":[4.3443688e-7,0.00010225507,0.000046872276,0.00014134726,0.00001130377,0.000077904806,3.1599134e-7,0.00007715533,0.000010153149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000666145,0.00002826666,0.000104561754,0.00009663867,0.000053599106,7.969424e-7,0.0002076532,0.9386952,0.0075571463,0.00014759821,0.000075977805,0.05296594],"study_design_scores_gemma":[0.00033328985,0.000046989102,0.0025630442,0.000029362463,0.00003899304,0.000006423395,0.00003922743,0.9950766,0.0016620911,0.0000035819521,0.000101048325,0.00009933562],"about_ca_topic_score_codex":0.00011521682,"about_ca_topic_score_gemma":0.0000897751,"teacher_disagreement_score":0.92088085,"about_ca_system_score_codex":0.000025629839,"about_ca_system_score_gemma":0.0000016573998,"threshold_uncertainty_score":0.41698408},"labels":[],"label_agreement":null},{"id":"W2036679573","doi":"10.1109/72.935086","title":"Pricing and hedging derivative securities with neural networks: Bayesian regularization, early stopping, and bagging","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Overfitting; Early stopping; Regularization (linguistics); Bayesian probability; Econometrics; Computer science; Artificial neural network; Generalization; Standard deviation; Black–Scholes model; Derivative (finance); Baseline (sea); Artificial intelligence; Mathematics; Statistics; Volatility (finance); Economics; Financial economics","score_opus":0.03771736784902873,"score_gpt":0.3041129530411983,"score_spread":0.26639558519216955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036679573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29495215,0.0002830305,0.7033162,0.0002921013,0.00047130164,0.00028432676,0.0000016739889,0.00013653688,0.00026263687],"genre_scores_gemma":[0.9933596,0.00014845237,0.0053175627,0.00043350935,0.00021597753,0.00003328789,0.0000012698545,0.00005653955,0.00043378267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965195,0.0006536616,0.0006357381,0.00086856884,0.0006851808,0.00063732127],"domain_scores_gemma":[0.99560434,0.0031919884,0.00029719283,0.00046105718,0.0001877622,0.00025763494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013855916,0.0004009111,0.00046833343,0.0004250263,0.0011109475,0.0006808786,0.00030812353,0.00016371111,0.00005706907],"category_scores_gemma":[0.00016790368,0.00032446653,0.000086998305,0.0015592867,0.00036777838,0.0008565792,0.000012258282,0.00070467487,6.25749e-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.00023283264,0.000023414392,0.006701388,0.0000059437025,0.00003568866,0.000034220942,0.000995603,0.6766234,0.000020278736,0.0000639292,0.00004358439,0.3152197],"study_design_scores_gemma":[0.000563962,0.00026909722,0.011263392,0.00012323684,0.000049150287,0.0003194903,0.00042849945,0.9858002,0.000039870687,0.0006209989,0.0001475941,0.00037452098],"about_ca_topic_score_codex":0.000061947394,"about_ca_topic_score_gemma":0.00014714376,"teacher_disagreement_score":0.6984075,"about_ca_system_score_codex":0.00004798334,"about_ca_system_score_gemma":0.000020129904,"threshold_uncertainty_score":0.9999207},"labels":[],"label_agreement":null},{"id":"W2054999339","doi":"10.1109/tnn.2005.853337","title":"Connectionist-Based Dempster–Shafer Evidential Reasoning for Data Fusion","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dempster–Shafer theory; Computer science; Artificial intelligence; Evidential reasoning approach; Artificial neural network; Connectionism; Machine learning; A priori and a posteriori; Context (archaeology); Benchmark (surveying); Multilayer perceptron; Bayesian probability; Perceptron; Sensor fusion; Decision support system","score_opus":0.057648117375027744,"score_gpt":0.3007436376198504,"score_spread":0.24309552024482267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054999339","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.0018632466,0.00009584798,0.99339974,0.002438965,0.0015493546,0.00025322332,0.000019208706,0.0003411949,0.00003919552],"genre_scores_gemma":[0.9566434,0.000022278622,0.04107624,0.0016546815,0.00035807144,0.000048649083,0.00001869079,0.000020376408,0.00015763022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983548,0.00008408277,0.0003027856,0.0006519695,0.00022039875,0.00038596976],"domain_scores_gemma":[0.99846524,0.0002479328,0.00008197842,0.0009757854,0.0000927258,0.00013635335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029036685,0.00020386334,0.00017722974,0.00009118658,0.0005877712,0.00031941553,0.001002472,0.0001363616,0.00003056634],"category_scores_gemma":[0.000008255347,0.00019973851,0.000113598624,0.00027960388,0.000040952433,0.0007851737,0.000009131357,0.00035644506,0.000018505554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058765403,0.000077474106,0.000002316626,0.0000056850554,0.000012463442,0.0000016528368,0.000021479236,0.76023954,0.00011308843,0.00023101355,0.0014391289,0.23779736],"study_design_scores_gemma":[0.0005158801,0.00014217637,0.00000835028,0.000053862925,0.000030010611,0.000015256887,0.0000026616133,0.9961,0.0011000157,0.00006899955,0.0017350297,0.00022773906],"about_ca_topic_score_codex":0.00003865954,"about_ca_topic_score_gemma":0.00016245218,"teacher_disagreement_score":0.95478016,"about_ca_system_score_codex":0.000047456157,"about_ca_system_score_gemma":0.0000523257,"threshold_uncertainty_score":0.81451005},"labels":[],"label_agreement":null},{"id":"W2057491769","doi":"10.1109/tnn.2005.863458","title":"A Stable Neural Network-Based Observer With Application to Flexible-Joint Manipulators","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":271,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Concordia University","funders":"","keywords":"Artificial neural network; Control theory (sociology); Robustness (evolution); Computer science; Nonlinear system; Backpropagation; Observer (physics); Lyapunov function; A priori and a posteriori; Artificial intelligence; Control (management)","score_opus":0.015701725084008467,"score_gpt":0.20578911031865374,"score_spread":0.19008738523464527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057491769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055537406,0.00013463,0.94125587,0.00013753673,0.000824997,0.0008748887,0.000016402759,0.0009183052,0.0002999823],"genre_scores_gemma":[0.99653494,0.0000023155396,0.0018046576,0.00030166298,0.0006649069,0.0002791679,0.000017942746,0.0001305663,0.00026385824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981962,0.0000539216,0.0004235276,0.00040013928,0.00028522965,0.0006410022],"domain_scores_gemma":[0.99914026,0.00007745083,0.00006355959,0.00046021922,0.00007754196,0.00018095676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000106905296,0.0003892583,0.00036248926,0.00012886239,0.00018041903,0.00007715322,0.00018550266,0.00014840432,0.000036963513],"category_scores_gemma":[5.724134e-7,0.00036058846,0.00014156708,0.0006637599,0.00003393469,0.00018516954,0.0000012691457,0.00044638757,0.000040196013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013594492,0.00005007069,0.00012139198,0.000017741819,0.00003957007,0.000010161738,0.000006671967,0.9938147,0.00039985433,0.000022484704,0.00088822306,0.0044931737],"study_design_scores_gemma":[0.0007351924,0.00018395486,0.001883012,0.00003734528,0.0000603033,0.000011204069,0.0000062031745,0.9944244,0.00081274466,0.0000070559495,0.0014417979,0.00039677252],"about_ca_topic_score_codex":0.00014959034,"about_ca_topic_score_gemma":0.0007339346,"teacher_disagreement_score":0.94099754,"about_ca_system_score_codex":0.00015116994,"about_ca_system_score_gemma":0.000014430436,"threshold_uncertainty_score":0.9998846},"labels":[],"label_agreement":null},{"id":"W2070592416","doi":"10.1109/tnn.2011.2167685","title":"Data-Based Virtual Unmodeled Dynamics Driven Multivariable Nonlinear Adaptive Switching Control","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Control Systems and Identification","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"State Key Laboratory of Synthetical Automation for Process Industries; Chinese Academy of Engineering; National Natural Science Foundation of China","keywords":"Control theory (sociology); Controller (irrigation); Multivariable calculus; Nonlinear system; Computer science; Convergence (economics); Control engineering; Stability (learning theory); Adaptive control; Engineering; Control (management); Artificial intelligence","score_opus":0.028713331989650433,"score_gpt":0.21492745752102882,"score_spread":0.1862141255313784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070592416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015524806,0.000033029373,0.98147357,0.000022850163,0.0016328779,0.00043842022,0.00025966144,0.00042054866,0.00019424706],"genre_scores_gemma":[0.99819654,0.000009119697,0.0013231474,0.000055434422,0.00016565522,0.00006016223,0.000060649574,0.00006257322,0.00006674252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987051,0.00007110966,0.00038159266,0.00035032406,0.00016104836,0.0003308565],"domain_scores_gemma":[0.99900305,0.00012718179,0.00006696131,0.00062917016,0.000061783,0.00011182498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014830496,0.00024641544,0.0002782707,0.000109077475,0.0001792152,0.000053782896,0.00033413095,0.00015853086,0.00004760272],"category_scores_gemma":[0.0000028290267,0.0002467376,0.000100485944,0.00019570622,0.000022464941,0.00036997168,0.0000015297038,0.0003878937,0.000022030083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013799912,0.00007953,0.0000112282805,0.0000064446876,0.00009130898,0.0000041139765,0.00005336814,0.98261875,0.00061948376,0.00003748262,0.000058688416,0.016281588],"study_design_scores_gemma":[0.0012597481,0.0000950903,0.00007337034,0.000031804277,0.000095331925,0.0000030166793,0.000041300493,0.9978971,0.00019233437,0.000005863368,0.000059219783,0.00024580368],"about_ca_topic_score_codex":0.00024168857,"about_ca_topic_score_gemma":0.00088781706,"teacher_disagreement_score":0.98267174,"about_ca_system_score_codex":0.00011310278,"about_ca_system_score_gemma":0.000017014798,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2072499402","doi":"10.1109/tnn.2005.860855","title":"A Sequential Dynamic Heteroassociative Memory for Multistep Pattern Recognition and One-to-Many Association","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Backpropagation; Artificial intelligence; Bidirectional associative memory; Pattern recognition (psychology); Associative property; Content-addressable memory; Sequence learning; Artificial neural network; Feed forward; Association (psychology); Context (archaeology); Set (abstract data type); Task (project management); Content-addressable storage; Feedforward neural network; Machine learning; Mathematics","score_opus":0.0214230759761563,"score_gpt":0.24619839756790232,"score_spread":0.224775321591746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072499402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060408786,0.000024194758,0.93587387,0.001750529,0.0007373775,0.00086599466,0.00008228508,0.00021478244,0.000042171665],"genre_scores_gemma":[0.9939383,0.000026074526,0.0039599524,0.00093864073,0.0002277175,0.00044767512,0.00003330882,0.00002555894,0.00040276608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834406,0.00009352524,0.00034277956,0.0005522681,0.00022900703,0.00043837316],"domain_scores_gemma":[0.99895686,0.00036133113,0.00019351035,0.00025186938,0.00012447307,0.000111978436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017580576,0.00021946964,0.00023043944,0.0001056229,0.00044991495,0.00022054942,0.00024394925,0.00015949724,0.000007198264],"category_scores_gemma":[0.0000029334365,0.0002368756,0.00014569925,0.0003497999,0.000022561411,0.00034677584,0.000005975185,0.0002992581,0.000014425514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006167424,0.00034363536,0.000041635936,0.000015294921,0.00008893045,0.0000036901185,0.00017211874,0.33994412,0.0015915203,0.00006869579,0.0011940281,0.65647465],"study_design_scores_gemma":[0.00088346493,0.0001738615,0.0008529269,0.00002820836,0.00004875275,0.0000052252944,0.000007785093,0.99578536,0.0009283284,0.0009021743,0.00008598992,0.00029792014],"about_ca_topic_score_codex":0.0001557842,"about_ca_topic_score_gemma":0.0007206329,"teacher_disagreement_score":0.9335295,"about_ca_system_score_codex":0.00022071363,"about_ca_system_score_gemma":0.000012556407,"threshold_uncertainty_score":0.96595067},"labels":[],"label_agreement":null},{"id":"W2086608109","doi":"10.1109/tnn.2011.2168422","title":"Hierarchical Approximate Policy Iteration With Binary-Tree State Space Decomposition","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Markov decision process; Reinforcement learning; Kernel (algebra); State space; Mathematical optimization; Tree (set theory); Algorithm; Markov process; Artificial intelligence; Mathematics","score_opus":0.018154263890840724,"score_gpt":0.24563729892052735,"score_spread":0.22748303502968664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086608109","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.011307326,0.0000067701776,0.9861984,0.00059807824,0.0004364973,0.00029801493,0.0000015643078,0.00037446644,0.00077886414],"genre_scores_gemma":[0.9660975,0.000026066087,0.032928232,0.00039583107,0.00007619476,0.000035290654,0.000004774608,0.000026969643,0.00040918338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840635,0.0001340119,0.0002711058,0.00041957572,0.00030972285,0.00045924113],"domain_scores_gemma":[0.9990567,0.00007790827,0.000115409755,0.00051743595,0.00006817144,0.00016436483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011360829,0.0002494207,0.00017322184,0.0002620808,0.00033139376,0.00019035288,0.0004452183,0.000087625376,0.00002012242],"category_scores_gemma":[0.0000015492614,0.00021445715,0.000081816346,0.00068679545,0.00008787551,0.000758876,0.0000058666446,0.0005506611,0.000022338669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011996233,0.0000817185,0.00002619478,0.000006725684,0.000024578121,0.000024216919,0.00051212084,0.98001635,0.00016235177,0.0011179372,0.000033714266,0.017874144],"study_design_scores_gemma":[0.00044707026,0.0008184926,0.00045851863,0.00003313038,0.000013974233,0.00005217161,0.000005336851,0.995848,0.0018894908,0.00015453226,0.00003334471,0.00024596116],"about_ca_topic_score_codex":0.000047067464,"about_ca_topic_score_gemma":0.00002393523,"teacher_disagreement_score":0.9547901,"about_ca_system_score_codex":0.000079822814,"about_ca_system_score_gemma":0.000039158516,"threshold_uncertainty_score":0.87453085},"labels":[],"label_agreement":null},{"id":"W2096863150","doi":"10.1109/tnn.2005.845145","title":"Blind Equalization Using a Predictive Radial Basis Function Neural Network","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Blind equalization; Radial basis function; Computer science; Artificial neural network; Deconvolution; Mean squared error; Algorithm; Clutter; Noise (video); Blind deconvolution; Equalization (audio); Radial basis function network; Perceptron; Artificial intelligence; Radar; Mathematics; Statistics; Telecommunications","score_opus":0.03052155042257175,"score_gpt":0.2712075245042388,"score_spread":0.24068597408166703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096863150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01692792,0.00008668493,0.9788944,0.0007015535,0.0017297384,0.0004993738,0.0000046515033,0.00096867874,0.00018697446],"genre_scores_gemma":[0.98269296,0.00003556542,0.013741792,0.002422504,0.0009025905,0.000060929196,0.0000072753005,0.00003778687,0.00009861698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976426,0.0003762248,0.0004775021,0.00059429073,0.0004008187,0.0005085903],"domain_scores_gemma":[0.99880797,0.0001817186,0.0001913275,0.0005204925,0.00013024804,0.00016823404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035677195,0.000309678,0.0002490271,0.00024243444,0.0005356619,0.00029115044,0.00043690234,0.00025216115,0.00004943001],"category_scores_gemma":[0.000004272824,0.0003203071,0.00019405987,0.0011553688,0.00006532433,0.001542184,0.0000068435456,0.0006235126,0.000012706355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016280284,0.00008840266,0.00001028493,0.0000019665674,0.000028041168,0.0000019294882,0.00018615025,0.9302318,0.00008415506,0.00059913914,0.00047341012,0.06813189],"study_design_scores_gemma":[0.00063981843,0.0003488557,0.00009415927,0.000020090694,0.00004811612,0.00002687461,0.000008837784,0.9968089,0.0009001332,0.00026480493,0.0005476587,0.00029173616],"about_ca_topic_score_codex":0.000021879998,"about_ca_topic_score_gemma":0.00006685519,"teacher_disagreement_score":0.965765,"about_ca_system_score_codex":0.00014705204,"about_ca_system_score_gemma":0.00004706537,"threshold_uncertainty_score":0.9999249},"labels":[],"label_agreement":null},{"id":"W2097261572","doi":"10.1109/tnn.2009.2033367","title":"Speech Enhancement Based on Nonlinear Models Using Particle Filters","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Speech enhancement; Particle filter; Computer science; Context (archaeology); Nonlinear system; Noise (video); Algorithm; Speech recognition; Artificial neural network; Filter (signal processing); Artificial intelligence; Kalman filter; Noise reduction","score_opus":0.0319381845658925,"score_gpt":0.2625605635525427,"score_spread":0.2306223789866502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097261572","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.04832566,0.000027014432,0.94956815,0.0009905589,0.00056116853,0.0001462223,0.0000015318069,0.00018644119,0.0001932659],"genre_scores_gemma":[0.9364272,0.000006765982,0.0592485,0.004134981,0.00011637482,0.0000056953218,6.810071e-7,0.00001120196,0.00004862889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985142,0.00004941907,0.00023563026,0.00042704286,0.00031643742,0.0004573243],"domain_scores_gemma":[0.999248,0.00006093919,0.000065836124,0.0004360841,0.00004321068,0.00014587566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000113346316,0.0002033041,0.00015987517,0.00008184782,0.00030447205,0.00018129958,0.00037025075,0.00007165473,0.000021397951],"category_scores_gemma":[0.0000012103457,0.00018969839,0.00011369255,0.00048623592,0.000026584461,0.000502256,0.0000014588351,0.0003107174,0.00000922824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031887987,0.00015626893,7.741458e-7,0.0000016750192,0.0000036635179,0.000015264255,0.000023256105,0.78479004,0.0030877157,0.0000068362333,0.000023962439,0.21185867],"study_design_scores_gemma":[0.00032118807,0.00028015277,0.0000046599694,0.000039225797,0.000008284121,0.0000069740745,0.000002661235,0.7881193,0.21089834,0.00014310757,0.000012691627,0.00016337392],"about_ca_topic_score_codex":0.000004403517,"about_ca_topic_score_gemma":0.0000026433738,"teacher_disagreement_score":0.89031965,"about_ca_system_score_codex":0.000068228444,"about_ca_system_score_gemma":0.00003190928,"threshold_uncertainty_score":0.7735676},"labels":[],"label_agreement":null},{"id":"W2098232303","doi":"10.1109/tnn.2006.885040","title":"A Recurrent Neural Network for Hierarchical Control of Interconnected Dynamic Systems","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":72,"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 Saskatchewan","funders":"University of Saskatchewan","keywords":"Subnetwork; Computer science; Artificial neural network; Recurrent neural network; Bounded function; Stability (learning theory); Decomposition; Stochastic neural network; Artificial intelligence; Mathematics; Machine learning","score_opus":0.013220099711196883,"score_gpt":0.2574756441492499,"score_spread":0.244255544438053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098232303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017236812,0.00031783362,0.9766512,0.000708317,0.0035264762,0.0012170564,0.000034187207,0.00027847214,0.0000296437],"genre_scores_gemma":[0.99586636,0.000040307554,0.0029978098,0.0004207978,0.0003493884,0.00021274191,0.000008609732,0.000034134784,0.00006985259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973853,0.00013067276,0.0007866736,0.0006156825,0.00027091207,0.00081076566],"domain_scores_gemma":[0.99741644,0.0012514914,0.0002490669,0.0006697723,0.00016226793,0.00025095028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045001323,0.00032745913,0.00046155773,0.00014607866,0.00033719002,0.0001080383,0.00081587175,0.00018416542,0.0000057816296],"category_scores_gemma":[0.000005410111,0.00029448836,0.0003446489,0.0008614556,0.00011418235,0.00024263322,0.0000065204636,0.00063755194,0.0000028208842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020665966,0.00015920875,0.000011055832,0.000018254063,0.00004874127,0.0000051358206,0.000029514378,0.8770551,0.00022987746,0.002985383,0.00038902962,0.11886203],"study_design_scores_gemma":[0.000977499,0.0005168011,0.00018010396,0.000063348656,0.00004223053,0.000040168008,0.000008465843,0.99706274,0.00010825087,0.0002450165,0.0004786488,0.00027672056],"about_ca_topic_score_codex":0.000016187398,"about_ca_topic_score_gemma":0.00008060071,"teacher_disagreement_score":0.9786295,"about_ca_system_score_codex":0.000062986954,"about_ca_system_score_gemma":0.000021486843,"threshold_uncertainty_score":0.9999507},"labels":[],"label_agreement":null},{"id":"W2098412053","doi":"10.1109/72.896800","title":"Experiments on the application of IOHMMs to model financial returns series","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Université de Montréal","keywords":"Hidden Markov model; Hidden semi-Markov model; Gaussian; Moment (physics); Variable-order Markov model; Series (stratigraphy); Conditional probability distribution; Generalization; Conditional expectation; Markov chain; Mathematics; Markov model; Forward algorithm; Econometrics; Applied mathematics; Mixture model; Computer science; Artificial intelligence; Statistics","score_opus":0.02458885608029223,"score_gpt":0.2592432467594541,"score_spread":0.23465439067916186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098412053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04155556,0.000015691989,0.95263654,0.0045809816,0.00032047066,0.0005230769,0.000006175373,0.00011900374,0.00024248722],"genre_scores_gemma":[0.9946448,0.000047155565,0.0022579916,0.0022251797,0.00011436208,0.00035989232,0.0000013513948,0.000015273707,0.0003339568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987326,0.000046253037,0.00028004072,0.00039779456,0.00024523892,0.00029806103],"domain_scores_gemma":[0.9988623,0.000106350584,0.00008882231,0.00077431183,0.000059817878,0.000108357366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009252518,0.00018918859,0.0001615095,0.00006657635,0.00034667127,0.00006098488,0.0007184384,0.0000834463,0.000009422011],"category_scores_gemma":[0.0000020506523,0.0001419916,0.000115738156,0.00075015717,0.0000543368,0.00021580666,0.000007103027,0.00030079423,0.000017263024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052715302,0.000119517936,0.0000027616186,0.0000011753266,0.000005618343,0.0000012561984,0.00011057612,0.95651567,0.0014956635,0.009623438,0.00085619633,0.031215383],"study_design_scores_gemma":[0.00012230543,0.00017574348,0.000046409274,0.000013379153,0.0000065533177,0.00000991518,0.000009332147,0.9875167,0.010035629,0.0009222838,0.0009870374,0.00015469683],"about_ca_topic_score_codex":0.000014319186,"about_ca_topic_score_gemma":0.00003679097,"teacher_disagreement_score":0.9530893,"about_ca_system_score_codex":0.00002964536,"about_ca_system_score_gemma":0.000017300856,"threshold_uncertainty_score":0.5790249},"labels":[],"label_agreement":null},{"id":"W2099691301","doi":"10.1109/72.925559","title":"Thresholding neural network for adaptive noise reduction","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Thresholding; Artificial neural network; Artificial intelligence; Computer science; Adaptive filter; Noise (video); Noise reduction; Reduction (mathematics); Pattern recognition (psychology); Adaptive learning; Unsupervised learning; Algorithm; Mathematics; Image (mathematics)","score_opus":0.04049094824790187,"score_gpt":0.2826696035139611,"score_spread":0.24217865526605922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099691301","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.00794415,0.0001975725,0.98503584,0.0006366755,0.0051379423,0.00046519254,0.0000029330256,0.0003730534,0.00020662959],"genre_scores_gemma":[0.9440579,0.000060005517,0.053311285,0.0008030929,0.0010208341,0.000095885356,0.0000021678152,0.000035707915,0.0006131101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791354,0.00019794572,0.0003446282,0.0006078786,0.00024496313,0.00069103565],"domain_scores_gemma":[0.9987726,0.00032394484,0.00011015591,0.00051428966,0.00012012498,0.00015886275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040871103,0.00028929042,0.00027347408,0.00013014926,0.0007259906,0.00023349334,0.0005426364,0.00015293123,0.000016954535],"category_scores_gemma":[0.000004341255,0.00027786454,0.00028221187,0.00082240783,0.000066894325,0.00080921355,0.000004603951,0.0005163121,0.0000075733283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000267035,0.000051288123,0.000003373273,0.0000024709573,0.000021700258,0.00001791637,0.00006499291,0.8075789,0.0004008661,0.00027340464,0.0011123718,0.19020565],"study_design_scores_gemma":[0.0007499224,0.00039921695,0.000058100788,0.000028177976,0.00003565091,0.0001870338,0.000012768274,0.9955711,0.0012142695,0.0009717614,0.0004673991,0.00030461344],"about_ca_topic_score_codex":0.000022785405,"about_ca_topic_score_gemma":0.000009206005,"teacher_disagreement_score":0.9361138,"about_ca_system_score_codex":0.00006675545,"about_ca_system_score_gemma":0.000021021258,"threshold_uncertainty_score":0.99996734},"labels":[],"label_agreement":null},{"id":"W2099759795","doi":"10.1109/tnn.2005.851786","title":"Constructive Feedforward Neural Networks Using Hermite Polynomial Activation Functions","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Activation function; Constructive; Sigmoid function; Hermite polynomials; Artificial neural network; Computer science; Feedforward neural network; Orthonormal basis; Polynomial; Adaptation (eye); Function (biology); Constructive proof; Topology (electrical circuits); Mathematics; Artificial intelligence; Discrete mathematics; Pure mathematics; Combinatorics; Mathematical analysis","score_opus":0.01768520251766669,"score_gpt":0.2410274838492189,"score_spread":0.2233422813315522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099759795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052556768,0.00007288246,0.94144094,0.0017055161,0.0027631405,0.00061364094,0.000014015866,0.0005873379,0.00024573016],"genre_scores_gemma":[0.99120474,0.000036843652,0.0046653217,0.001727827,0.00182702,0.00011091203,0.000011046813,0.000058993995,0.00035727036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969271,0.00017380134,0.0006470314,0.0009599675,0.0003853669,0.0009067212],"domain_scores_gemma":[0.99802196,0.0003103583,0.00027745005,0.00088761107,0.00015451701,0.00034810088],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001511622,0.0005326821,0.00040843795,0.00025460936,0.0012561053,0.0003958626,0.0007812773,0.00030377693,0.00007557874],"category_scores_gemma":[0.0000029086436,0.0005293587,0.0003719055,0.001434984,0.00020384374,0.0015818559,0.000017386956,0.0012013965,0.000026901726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005257635,0.00010824859,0.000017642615,0.0000018494816,0.000040600826,0.0000031306192,0.000033116405,0.8031057,0.00028884265,0.00015606303,0.0009025375,0.19528967],"study_design_scores_gemma":[0.0006699191,0.0001300499,0.00019869038,0.000023670644,0.00005652782,0.0001234962,0.000023265819,0.9960267,0.00080030103,0.000025898498,0.0014000678,0.00052144745],"about_ca_topic_score_codex":0.00005607261,"about_ca_topic_score_gemma":0.000060916,"teacher_disagreement_score":0.938648,"about_ca_system_score_codex":0.00023134632,"about_ca_system_score_gemma":0.000046508572,"threshold_uncertainty_score":0.9997158},"labels":[],"label_agreement":null},{"id":"W2100717332","doi":"10.1109/tnn.2010.2073481","title":"High-Performance Reconfigurable Hardware Architecture for Restricted Boltzmann Machines","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Generative Adversarial Networks and Image Synthesis","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Field-programmable gate array; Speedup; Modular design; Exploit; Parallel computing; Virtex; Embedded system; Artificial neural network; Reconfigurable computing; Computer architecture; Hardware acceleration; Hardware architecture; Computer hardware; Software; Operating system; Artificial intelligence","score_opus":0.01109397436070237,"score_gpt":0.21800306020283178,"score_spread":0.20690908584212941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100717332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025955498,0.000032023298,0.96615744,0.0014818787,0.005419212,0.00047649114,0.000026152778,0.0002869631,0.00016436838],"genre_scores_gemma":[0.96986705,0.000046106452,0.027930053,0.0006141602,0.00062919245,0.00013921679,0.000008884874,0.000033814744,0.00073152786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827075,0.00007848629,0.00031739508,0.0005947618,0.00019207229,0.00054651196],"domain_scores_gemma":[0.99860597,0.00030704172,0.00011050664,0.00068024034,0.0001342364,0.0001620273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013709706,0.00032079854,0.00028955823,0.0001463476,0.0006476154,0.00022893392,0.00073258654,0.00019441222,0.00006225833],"category_scores_gemma":[0.000010772474,0.00027176976,0.00018020922,0.00051215425,0.00007149666,0.00049912167,0.0000033702352,0.0008419091,0.000011754137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006174138,0.000049674687,0.000004383847,0.0000068353957,0.000025557854,0.0000024977292,0.000027630142,0.72907656,0.0031879959,0.000080562146,0.0013876385,0.2660889],"study_design_scores_gemma":[0.0005257236,0.00026051432,0.00020917205,0.000018171071,0.000024558754,0.000021496398,0.0000020105608,0.9737272,0.02139449,0.00018906772,0.0033012312,0.00032633005],"about_ca_topic_score_codex":0.000060781247,"about_ca_topic_score_gemma":0.00019458003,"teacher_disagreement_score":0.94391155,"about_ca_system_score_codex":0.000018047627,"about_ca_system_score_gemma":0.000030184432,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W2100914167","doi":"10.1109/tnn.2003.820829","title":"Stability analysis of bidirectional associative memory networks with time delays","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bidirectional associative memory; Content-addressable memory; Computer science; Artificial neural network; Stability (learning theory); Associative property; Content-addressable storage; Variety (cybernetics); Exponential stability; State space; Recurrent neural network; Field (mathematics); Control theory (sociology); Topology (electrical circuits); Artificial intelligence; Mathematics; Nonlinear system; Machine learning; Control (management)","score_opus":0.0125718734674755,"score_gpt":0.21400634369493843,"score_spread":0.20143447022746291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100914167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047981642,0.00007890782,0.95031744,0.000100466925,0.00055194646,0.00032172955,0.000016411252,0.00019327641,0.00043819557],"genre_scores_gemma":[0.99714065,0.000034569573,0.002378044,0.00019955859,0.00004463275,0.000036002064,0.000011377308,0.000019970495,0.00013518633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710846,0.0006604356,0.00053947757,0.00070705934,0.00049160304,0.00049295573],"domain_scores_gemma":[0.997741,0.000834885,0.00027559474,0.00068800926,0.00029773064,0.0001627716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056649465,0.00031797407,0.0005623947,0.0002593467,0.000375801,0.00008341943,0.0004043884,0.00020430385,0.00024042663],"category_scores_gemma":[0.000013537432,0.00027842887,0.00035397953,0.0040563894,0.0001709647,0.00054537784,0.0000041272842,0.00056741823,0.0000043534633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006728516,0.00026676225,0.00049518055,0.0000040098234,0.00051221903,0.0000037065993,0.00011611861,0.9907921,0.000037503112,0.00024366745,0.000053510765,0.0074079493],"study_design_scores_gemma":[0.0003677805,0.00028556355,0.0010968675,0.00001124658,0.0003484329,0.000007178573,0.00001616771,0.99645597,0.0010535606,0.000057967245,0.000018194094,0.00028109466],"about_ca_topic_score_codex":0.000036221285,"about_ca_topic_score_gemma":0.00031287948,"teacher_disagreement_score":0.949159,"about_ca_system_score_codex":0.00018562155,"about_ca_system_score_gemma":0.0000665457,"threshold_uncertainty_score":0.9999668},"labels":[],"label_agreement":null},{"id":"W2102145388","doi":"10.1109/tnn.2006.875994","title":"A Neural Network Approach to Dynamic Task Assignment of Multirobots","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Artificial neural network; Task (project management); Artificial intelligence; Time delay neural network","score_opus":0.013378527268674747,"score_gpt":0.23105934192514752,"score_spread":0.21768081465647277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102145388","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.003761131,0.00008712895,0.9927705,0.00028260806,0.0019766488,0.00050287344,0.00000809921,0.00030815726,0.00030288924],"genre_scores_gemma":[0.86866444,0.0000038393523,0.13050252,0.0003062997,0.00015198419,0.00007500025,0.0000053535887,0.000029491932,0.00026110085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973384,0.0001748921,0.0005416747,0.00071372115,0.00047828743,0.00075301423],"domain_scores_gemma":[0.9985791,0.0001992183,0.00015939031,0.0008005782,0.00006243089,0.00019930155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022651703,0.00035087037,0.00039541442,0.00016786376,0.00024951805,0.000097115946,0.0008904646,0.00015633793,0.0000035871687],"category_scores_gemma":[0.0000021452452,0.00033473264,0.00019883174,0.0010374461,0.00006826426,0.00025789806,0.000011029319,0.00051177724,0.000012778003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002306521,0.00026544897,0.000029781204,0.000007113856,0.00002087593,0.000014193585,0.0000646,0.9720879,0.00016697065,0.00006124936,0.00065495516,0.026603818],"study_design_scores_gemma":[0.0004161981,0.00022861075,0.0015178291,0.00003354488,0.000023015798,0.000036449106,0.000005885298,0.9972051,0.00013044612,0.00005429007,0.00003202682,0.00031665454],"about_ca_topic_score_codex":0.00009123396,"about_ca_topic_score_gemma":0.000010600268,"teacher_disagreement_score":0.8649033,"about_ca_system_score_codex":0.000100670666,"about_ca_system_score_gemma":0.000022817247,"threshold_uncertainty_score":0.9999105},"labels":[],"label_agreement":null},{"id":"W2102555533","doi":"10.1109/72.991418","title":"Neural data fusion algorithms based on a linearly constrained least square method","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Algorithm; Artificial neural network; Covariance intersection; Covariance matrix; Sensor fusion; Computer science; Covariance; Invertible matrix; Estimation of covariance matrices; Artificial intelligence; Mathematics; Statistics","score_opus":0.03510574400188336,"score_gpt":0.2758330014542319,"score_spread":0.24072725745234852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102555533","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.0004702925,0.0001155291,0.9947364,0.00033967532,0.0011387776,0.0004851776,0.0002648768,0.0020085631,0.00044075452],"genre_scores_gemma":[0.9302318,0.00012927587,0.06818282,0.0006919542,0.00027230507,0.00007443607,0.0000701322,0.00013757266,0.00020971918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979795,0.0001259878,0.00042474887,0.0005961035,0.00033995695,0.0005336784],"domain_scores_gemma":[0.99821466,0.00033478,0.000060076312,0.0011288938,0.00005982745,0.00020176769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014777733,0.00044456206,0.0003488128,0.00023449954,0.00024753934,0.000083937695,0.0005319644,0.00022827716,0.00075708225],"category_scores_gemma":[0.000010209493,0.00043676197,0.00015245011,0.00055718527,0.00008507948,0.00041669625,0.0000056238696,0.0011270883,0.00003680574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029607487,0.00007697963,7.220971e-7,0.000011639758,0.0000104451465,0.000029495217,0.000014981658,0.65458053,0.0007206396,8.4153334e-7,0.0013789285,0.3431452],"study_design_scores_gemma":[0.00065973523,0.00028744375,0.000009494945,0.00007049162,0.00003861136,0.00003960399,0.0000151961785,0.9936949,0.0037083656,0.000006384396,0.0010550076,0.00041477606],"about_ca_topic_score_codex":0.000011097687,"about_ca_topic_score_gemma":0.000015480946,"teacher_disagreement_score":0.92976147,"about_ca_system_score_codex":0.000069810376,"about_ca_system_score_gemma":0.0000059840386,"threshold_uncertainty_score":0.99980843},"labels":[],"label_agreement":null},{"id":"W2106485397","doi":"10.1109/tnn.2005.852861","title":"NDRAM: Nonlinear Dynamic Recurrent Associative Memory for Learning Bipolar and Nonbipolar Correlated Patterns","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Hebbian theory; Bidirectional associative memory; Content-addressable memory; Attractor; Computer science; Artificial neural network; Content-addressable storage; Hopfield network; Learning rule; Nonlinear system; Spurious relationship; Leabra; Artificial intelligence; Recurrent neural network; Competitive learning; Machine learning; Mathematics; Wake-sleep algorithm","score_opus":0.010190180093398218,"score_gpt":0.24679394345844005,"score_spread":0.23660376336504182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106485397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042643547,0.0005910819,0.9533556,0.001649832,0.0007806538,0.00061351474,0.000036527024,0.00031369738,0.00001556575],"genre_scores_gemma":[0.9920353,0.0006822976,0.0059642605,0.0005386549,0.00021058581,0.00014553337,0.000018700788,0.000037699254,0.0003669361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820244,0.00011744387,0.00035934476,0.00060600386,0.00020187405,0.00051288336],"domain_scores_gemma":[0.9987855,0.00042804997,0.00017368473,0.00033271854,0.0000952516,0.00018478378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018116456,0.0002912304,0.00027136505,0.00011031359,0.00069138565,0.00017355244,0.00040245889,0.00017713828,0.000011503211],"category_scores_gemma":[0.0000049252512,0.00028205707,0.00017172394,0.00042461613,0.000051863706,0.00043157084,0.000009089458,0.00090374314,0.000011253572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024510595,0.00012217747,0.00004150879,0.0000061387314,0.00003802015,0.0000017625948,0.0001640996,0.4435263,0.000100919075,0.00004111768,0.00010094097,0.5558325],"study_design_scores_gemma":[0.0005637292,0.0002827138,0.00030889318,0.00003508458,0.00004141665,0.000016974289,0.000019568959,0.9947966,0.00027182547,0.000027340968,0.0033341374,0.00030173763],"about_ca_topic_score_codex":0.000020863037,"about_ca_topic_score_gemma":0.00016152146,"teacher_disagreement_score":0.9493918,"about_ca_system_score_codex":0.00010973162,"about_ca_system_score_gemma":0.000018293658,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W2107370115","doi":"10.1109/tnn.2009.2022979","title":"A Multiscale Scheme for Approximating the Quantron's Discriminating Function","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Maxima and minima; Function approximation; Laplace transform; Wavelet; Artificial neural network; Convergence (economics); Function (biology); Multiresolution analysis; Scheme (mathematics); Computer science; Algorithm; Mathematics; Applied mathematics; Approximation theory; Mathematical optimization; Wavelet transform; Artificial intelligence; Mathematical analysis; Discrete wavelet transform","score_opus":0.03025656581598325,"score_gpt":0.28152300473530695,"score_spread":0.2512664389193237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107370115","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.0025109856,0.000068884896,0.99428874,0.0013591404,0.0010077717,0.00037592422,0.0000013788309,0.00028436555,0.00010279299],"genre_scores_gemma":[0.87548506,0.0000030532378,0.12292943,0.0011811542,0.00018294035,0.000052457483,9.629674e-7,0.000011189273,0.0001537461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986845,0.00015164289,0.00026576637,0.00034150825,0.0001861474,0.0003704003],"domain_scores_gemma":[0.9989145,0.0004931583,0.00009638736,0.00037542082,0.00006178398,0.00005876575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048898463,0.0001719787,0.00015772601,0.000060474867,0.00077477715,0.00024544224,0.000418086,0.00007299128,0.0000028075817],"category_scores_gemma":[0.000014087302,0.00012280079,0.00017379831,0.0003230157,0.000035627378,0.00044614193,0.0000020803557,0.00037461813,0.0000026009802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007702225,0.000082465616,0.000001000031,0.000006504461,0.000013079586,0.000002142203,0.00025084132,0.25173867,0.002909063,0.0010549121,0.00024179602,0.7436225],"study_design_scores_gemma":[0.00052418414,0.0003101272,0.00009002566,0.000022398783,0.000022611615,0.000014700466,0.000032261367,0.99604946,0.001940264,0.0007606839,0.00008117358,0.00015209484],"about_ca_topic_score_codex":0.0000066512475,"about_ca_topic_score_gemma":0.000004412016,"teacher_disagreement_score":0.8729741,"about_ca_system_score_codex":0.000026879965,"about_ca_system_score_gemma":0.000010017263,"threshold_uncertainty_score":0.59590375},"labels":[],"label_agreement":null},{"id":"W2107786698","doi":"10.1109/tnn.2005.863420","title":"A Bidirectional Heteroassociative Memory for Binary and Grey-Level Patterns","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Spurious relationship; Computer science; Recall; Noise (video); Bidirectional associative memory; Content-addressable storage; Content-addressable memory; Binary number; Artificial intelligence; Function (biology); Learning rule; Algorithm; Artificial neural network; Machine learning; Mathematics; Arithmetic; Cognitive psychology","score_opus":0.020951321730597543,"score_gpt":0.2306263238409195,"score_spread":0.20967500211032195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107786698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41359222,0.00010560216,0.5847376,0.000058350906,0.00097116455,0.00018436532,0.000055048422,0.00025805872,0.000037623802],"genre_scores_gemma":[0.99879193,0.000053099997,0.00037537958,0.00009813767,0.00032054746,0.000058925627,0.000008738731,0.00003950179,0.00025376034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921095,0.000024523846,0.00018406111,0.00021510731,0.000083233885,0.00028209298],"domain_scores_gemma":[0.99955887,0.00024152728,0.00003124666,0.00008693999,0.000027657401,0.000053755146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047972855,0.0001874077,0.00016274827,0.000072648625,0.00024827445,0.00002504798,0.00005421969,0.00008909542,0.000010586872],"category_scores_gemma":[0.0000010588941,0.00019279371,0.00009926082,0.00012215858,0.000025724088,0.00016230662,9.493211e-7,0.00028873983,0.0000013242304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036945166,0.000025570302,0.000031707248,0.000018606794,0.00002261153,0.000004566864,0.0000204779,0.9776401,0.0015855385,0.0000034380369,0.00023261092,0.020377863],"study_design_scores_gemma":[0.000620279,0.00013214613,0.0015596758,0.000034204437,0.000029557645,0.000026203275,0.000018241582,0.985032,0.012041494,0.000098716366,0.00013070632,0.000276752],"about_ca_topic_score_codex":0.000012194192,"about_ca_topic_score_gemma":0.00007418928,"teacher_disagreement_score":0.5851997,"about_ca_system_score_codex":0.000049093214,"about_ca_system_score_gemma":0.000002631928,"threshold_uncertainty_score":0.78619},"labels":[],"label_agreement":null},{"id":"W2108511354","doi":"10.1109/72.870045","title":"Signal detection using the radial basis function coupled map lattice","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Radar Systems and Signal Processing","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Calgary","funders":"","keywords":"Clutter; Constant false alarm rate; Radial basis function; Computer science; Radar; Chaotic; Artificial intelligence; Pattern recognition (psychology); Artificial neural network; Telecommunications","score_opus":0.013385151670210382,"score_gpt":0.20352976242740226,"score_spread":0.19014461075719188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108511354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22543424,0.00025165835,0.77193123,0.000031820517,0.001759849,0.00016961104,0.0000025299698,0.00027808253,0.00014098296],"genre_scores_gemma":[0.99890274,0.000031439704,0.00006804565,0.000112042115,0.0006312928,0.00001981641,0.000001086358,0.00004956334,0.00018397461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897736,0.00006847303,0.0002638658,0.00019480273,0.0001917451,0.00030373142],"domain_scores_gemma":[0.9996069,0.00009359223,0.000029980949,0.00016899133,0.00002581057,0.00007469829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013100792,0.00020530837,0.00016028559,0.000064121574,0.0005297763,0.00011556618,0.00010070462,0.00014036112,0.00046789157],"category_scores_gemma":[3.7530276e-7,0.00016701782,0.0001273929,0.00031557173,0.000037958613,0.0002597259,2.8377372e-7,0.00050709344,0.000025817237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007891011,0.000011778018,0.000001230583,0.000013262834,0.00003690214,0.0000027000503,0.00004129079,0.8646289,0.0022985903,5.3304916e-7,0.000033774213,0.1328521],"study_design_scores_gemma":[0.00027668235,0.00006709959,0.00003155104,0.00003059541,0.00008647761,0.00003784432,0.000029946425,0.99686295,0.0017224489,0.000009698248,0.0006607375,0.00018395305],"about_ca_topic_score_codex":0.000076408316,"about_ca_topic_score_gemma":0.00007667437,"teacher_disagreement_score":0.7734685,"about_ca_system_score_codex":0.00008199536,"about_ca_system_score_gemma":0.000007754434,"threshold_uncertainty_score":0.6810789},"labels":[],"label_agreement":null},{"id":"W2108934838","doi":"10.1109/tnn.2005.860834","title":"A New Synaptic Plasticity Rule for Networks of Spiking Neurons","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta Hospital; Alberta Hospital Edmonton","funders":"","keywords":"Computer science; Artificial intelligence; Segmentation; Spiking neural network; Image segmentation; Pattern recognition (psychology); Artificial neural network; Neuroscience; Biology","score_opus":0.012342132044290879,"score_gpt":0.21872629682555184,"score_spread":0.20638416478126095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108934838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09973122,0.00012251902,0.8979649,0.000019637388,0.0014092661,0.00027674384,0.000008646503,0.0003635933,0.00010350882],"genre_scores_gemma":[0.99761206,0.000015695641,0.0016416545,0.000051733532,0.00047042852,0.000020755233,0.000004399747,0.00006239416,0.00012086295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878293,0.000022984865,0.00037608098,0.00025165404,0.00010616256,0.00046021433],"domain_scores_gemma":[0.9991757,0.0004643395,0.00006376848,0.0001677501,0.000028229839,0.000100165445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000044931425,0.00025610067,0.00028666836,0.00008713132,0.00017973711,0.00002231868,0.00015090464,0.00012395778,0.00002395668],"category_scores_gemma":[0.00000303678,0.00026879695,0.00019141933,0.0002833469,0.000034598317,0.00014067754,0.000001490258,0.00045615618,0.0000017086755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006764069,0.000024949752,0.0000045626953,0.000026270805,0.000023697323,0.0000046886375,0.0000067969886,0.96779525,0.0037481682,0.00003284589,0.0002435094,0.028021635],"study_design_scores_gemma":[0.00047714636,0.00013670334,0.00010800065,0.00005154152,0.000059980874,0.000017984643,0.000003671084,0.987113,0.011589007,0.00011468268,0.000097870754,0.00023038914],"about_ca_topic_score_codex":0.000012053959,"about_ca_topic_score_gemma":0.000032417807,"teacher_disagreement_score":0.89788085,"about_ca_system_score_codex":0.000034405253,"about_ca_system_score_gemma":0.00000764993,"threshold_uncertainty_score":0.9999764},"labels":[],"label_agreement":null},{"id":"W2110569122","doi":"10.1109/tnn.2008.2011130","title":"Option Pricing With Modular Neural Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Lakehead University","funders":"","keywords":"Nonparametric statistics; Artificial neural network; Modular design; Modular neural network; Computer science; Econometrics; Valuation of options; Moneyness; Economics; Artificial intelligence; Time delay neural network","score_opus":0.016550855628434998,"score_gpt":0.20599042909944945,"score_spread":0.18943957347101445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110569122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011988414,0.00050729123,0.9852717,0.0007652881,0.0005262628,0.00037965772,0.000018937875,0.0001616898,0.00038078462],"genre_scores_gemma":[0.99727106,0.000090293724,0.0011203729,0.0009862054,0.00030497112,0.00008156388,0.000009680316,0.000033679626,0.00010216492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984656,0.0000062523486,0.00047128246,0.000532322,0.00005984807,0.00046471594],"domain_scores_gemma":[0.99919444,0.00004940366,0.0002124657,0.0003695974,0.000044673237,0.00012942115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001104193,0.00026072288,0.00034620505,0.00015470102,0.0003908514,0.00009430497,0.00022522398,0.00016583182,0.000025696947],"category_scores_gemma":[0.0000029617977,0.0002664579,0.00013502422,0.0006729494,0.000055351968,0.00027024077,0.0000013240917,0.0005027209,0.00002825725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007559513,0.00012241084,0.000023036788,0.0000033576443,0.000016364267,0.0000039923643,0.000033177195,0.93750656,0.000008468261,0.03048067,0.000018432724,0.031707928],"study_design_scores_gemma":[0.0004654678,0.00038490305,0.0016378831,0.000016557115,0.00001949594,0.000022677563,0.00000945819,0.9879995,0.000026520353,0.008916895,0.00017663302,0.00032402403],"about_ca_topic_score_codex":0.000044917357,"about_ca_topic_score_gemma":0.000015977386,"teacher_disagreement_score":0.98528266,"about_ca_system_score_codex":0.000069878806,"about_ca_system_score_gemma":0.000007006073,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W2110658950","doi":"10.1109/tnn.2011.2105888","title":"Semisupervised Learning Using Bayesian Interpretation: Application to LS-SVM","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Artificial intelligence; Support vector machine; Machine learning; Computer science; Bayesian probability; Inference; Bayesian inference; Kernel (algebra); Pattern recognition (psychology); Least squares support vector machine; Mathematics","score_opus":0.024875864552527778,"score_gpt":0.24588813345989805,"score_spread":0.22101226890737027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110658950","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.0131975915,0.000017969911,0.984811,0.00010877377,0.00070295273,0.00026693798,8.818537e-7,0.00028339302,0.000610473],"genre_scores_gemma":[0.9763034,0.000009708915,0.022467403,0.0009477376,0.00006179823,0.000075172175,0.000002225756,0.0000167506,0.000115777286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988873,0.00009247172,0.00022496127,0.00039072492,0.00015873756,0.00024579428],"domain_scores_gemma":[0.9993529,0.00004391669,0.000058859547,0.00031000684,0.00007417739,0.00016018262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087841145,0.00015914167,0.00012684223,0.00014908753,0.000284201,0.000082612576,0.0003412074,0.000100607445,0.000068556365],"category_scores_gemma":[0.00000198102,0.0001579853,0.00008912706,0.00048410514,0.000017737484,0.0004908233,0.000004625619,0.00033308752,0.00005496655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006211249,0.0001032485,0.000024072753,0.000008302872,0.000011419908,0.0000030827414,0.000835276,0.5293998,0.0030407426,0.000029495837,0.0001073823,0.46637508],"study_design_scores_gemma":[0.00014414961,0.000116559066,0.000044425746,0.00006084754,0.000011691532,0.000014701659,0.00005140713,0.9917135,0.0074345786,0.00008296461,0.00014260554,0.00018256053],"about_ca_topic_score_codex":0.000045828067,"about_ca_topic_score_gemma":0.000020251871,"teacher_disagreement_score":0.96310586,"about_ca_system_score_codex":0.000037090205,"about_ca_system_score_gemma":0.000020591548,"threshold_uncertainty_score":0.6442453},"labels":[],"label_agreement":null},{"id":"W2111525525","doi":"10.1109/tnn.2009.2025588","title":"Simple Artificial Neural Networks That Match Probability and Exploit and Explore When Confronting a Multiarmed Bandit","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Behavioral and Psychological Studies","field":"Psychology","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Alberta","funders":"","keywords":"Perceptron; Artificial neural network; Computer science; Artificial intelligence; Reinforcement learning; Multi-armed bandit; Matching (statistics); Matching law; Exploit; Simple (philosophy); Machine learning; Contingency; Operant conditioning; Reinforcement; Mathematics; Engineering","score_opus":0.1887466762966764,"score_gpt":0.3206264415080561,"score_spread":0.13187976521137967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111525525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92040795,0.00078535825,0.074354224,0.0016710222,0.0014222973,0.0008185072,0.000023450417,0.00030419556,0.00021300746],"genre_scores_gemma":[0.9979218,0.00010367467,0.00014238051,0.0012441842,0.0002926398,0.00015818008,0.000009375017,0.000029286071,0.00009843834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751467,0.00025020595,0.00046140663,0.00083134463,0.00018146959,0.0007608894],"domain_scores_gemma":[0.9989978,0.0002382931,0.00012709867,0.00034320055,0.00004249948,0.0002510825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021646183,0.00043709873,0.0004975476,0.00006147375,0.0006006327,0.00012308637,0.0001652875,0.0003460243,0.0004256327],"category_scores_gemma":[0.0000035236942,0.00035578953,0.00015437695,0.00018320975,0.00027823364,0.00020382833,0.000005700627,0.0009037191,0.00001317373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016727016,0.0009549716,0.00845096,0.000012370807,0.00011875508,0.000091640875,0.0024247323,0.030531162,0.00009994389,0.00009056177,0.00227541,0.9532768],"study_design_scores_gemma":[0.0072571607,0.0055317217,0.39007464,0.00013482447,0.0009685253,0.00040258133,0.0047630533,0.5754633,0.00023753209,0.009049314,0.0027782517,0.0033391288],"about_ca_topic_score_codex":0.00008848412,"about_ca_topic_score_gemma":0.0001770308,"teacher_disagreement_score":0.94993764,"about_ca_system_score_codex":0.000023010125,"about_ca_system_score_gemma":0.0000024962767,"threshold_uncertainty_score":0.99988943},"labels":[],"label_agreement":null},{"id":"W2112338564","doi":"10.1109/tnn.2009.2031143","title":"Semisupervised Least Squares Support Vector Machine","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Support vector machine; Computer science; Heuristics; Generalization; Margin (machine learning); Artificial intelligence; Least squares support vector machine; Machine learning; Classifier (UML); Structured support vector machine; Maximization; Pattern recognition (psychology); Algorithm; Mathematical optimization; Mathematics","score_opus":0.013967953898349527,"score_gpt":0.2336830820277411,"score_spread":0.21971512812939156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112338564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013241842,0.000056934005,0.98189056,0.0024526275,0.0011792335,0.00017978493,0.000009992738,0.00043238088,0.0005566229],"genre_scores_gemma":[0.99574965,0.00005803931,0.0010631263,0.0025607087,0.00010972137,0.000017095746,0.0000079252595,0.000011432745,0.000422292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986952,0.000069863774,0.00023240644,0.00039426523,0.0002448181,0.0003634269],"domain_scores_gemma":[0.99926114,0.0000643894,0.000046515448,0.00041230812,0.000046942634,0.0001687049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007900755,0.00020624767,0.00017287908,0.00010747584,0.00026518555,0.00013428723,0.0004285999,0.000115499104,0.0002587966],"category_scores_gemma":[0.0000013965257,0.00018131852,0.0001515236,0.000366847,0.000023910063,0.0004966504,0.0000018795706,0.00039763778,0.00009963053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001234106,0.00045561895,0.000014809247,0.000010947053,0.000023671082,0.00006567801,0.00022799194,0.27993688,0.004971825,0.00010059749,0.007364595,0.70670396],"study_design_scores_gemma":[0.00058659347,0.00049957633,0.00036278376,0.00003592397,0.000014022122,0.000047277856,0.000009569719,0.98832345,0.009011179,0.0001268043,0.00069351983,0.00028928372],"about_ca_topic_score_codex":0.000011618857,"about_ca_topic_score_gemma":0.000012201083,"teacher_disagreement_score":0.9825078,"about_ca_system_score_codex":0.000023546805,"about_ca_system_score_gemma":0.000015889047,"threshold_uncertainty_score":0.73939544},"labels":[],"label_agreement":null},{"id":"W2112830891","doi":"10.1109/72.883420","title":"On-line learning of dynamical systems in the presence of model mismatch and disturbances","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Systems, Applications & Products in Data Processing (Canada)","funders":"","keywords":"Computer science; Line (geometry); Nonlinear dynamical systems; Artificial intelligence; Nonlinear system; Mathematics; Physics","score_opus":0.018987192055971096,"score_gpt":0.2507532648143782,"score_spread":0.2317660727584071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112830891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25278115,0.00016465723,0.7461534,0.0004668005,0.00008952033,0.00021269679,0.0000035065075,0.000026794107,0.000101475605],"genre_scores_gemma":[0.9992104,0.00021546206,0.00027898088,0.000083267405,0.000021486387,0.0000434563,7.089696e-7,0.0000060986354,0.0001401026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989788,0.00011071529,0.00028515043,0.0002513064,0.00019416538,0.00017986493],"domain_scores_gemma":[0.99910724,0.00045305662,0.00007258833,0.00030707006,0.000021786378,0.00003825695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013577021,0.00011710438,0.00017923524,0.00004136392,0.00011175989,0.000038875936,0.0004353237,0.00005654143,0.000003592668],"category_scores_gemma":[0.0000013909777,0.000081930506,0.000055094348,0.0004092803,0.00009609487,0.00013216164,0.0000022108725,0.000384238,6.7262874e-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.000022507298,0.000091894486,0.00000965724,0.000008719193,0.0000037922266,0.000001166601,0.00012308588,0.9673015,0.00004651385,0.0019245794,0.00003586723,0.03043075],"study_design_scores_gemma":[0.00015743145,0.00014299498,0.00009600397,0.000051419483,0.0000057511274,0.000008580515,0.000016126163,0.99904674,0.00005830948,0.00032427692,0.000017590914,0.00007477546],"about_ca_topic_score_codex":0.000054625845,"about_ca_topic_score_gemma":0.000020060852,"teacher_disagreement_score":0.74642926,"about_ca_system_score_codex":0.000007199693,"about_ca_system_score_gemma":0.0000067904098,"threshold_uncertainty_score":0.3341029},"labels":[],"label_agreement":null},{"id":"W2113803786","doi":"10.1109/tnn.2007.902962","title":"A Generalized Least Absolute Deviation Method for Parameter Estimation of Autoregressive Signals","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Control Systems and Identification","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Autoregressive model; Least absolute deviations; Gaussian noise; Noise (video); Estimation theory; Gaussian; Artificial neural network; Mathematics; Standard deviation; Approximation error; Absolute deviation; Computer science; Algorithm; Applied mathematics; Statistics; Mathematical optimization; Artificial intelligence","score_opus":0.024037866569187327,"score_gpt":0.2593295341048331,"score_spread":0.2352916675356458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113803786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054221373,0.00015249885,0.94405144,0.00004574874,0.0008371239,0.0005154647,0.00002427296,0.00014007672,0.000011996558],"genre_scores_gemma":[0.98791456,0.000041103758,0.0114796655,0.000024056619,0.0000973793,0.0002408037,0.000016194912,0.000029922154,0.00015632424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910414,0.00005687591,0.00038002036,0.00016288662,0.0001241666,0.00017193469],"domain_scores_gemma":[0.99939257,0.0002023613,0.00010299818,0.00017331187,0.00008222522,0.00004653987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011888793,0.00014258185,0.0002359351,0.00010620609,0.00012223299,0.000019592353,0.00007033456,0.0001060261,0.00001913867],"category_scores_gemma":[0.0000060213415,0.00013914405,0.00016523169,0.00013710813,0.000018489885,0.00017429724,2.8807744e-7,0.00009132765,0.0000032860314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046253692,0.000021121234,0.0000013178437,0.000027001279,0.00005330799,4.849607e-7,0.00009534194,0.94111705,0.0057115993,0.000014742005,0.0004147262,0.05249706],"study_design_scores_gemma":[0.00057830027,0.000052596777,0.00027161837,0.000029327104,0.00005594958,0.000011100762,0.000004289024,0.9918209,0.0069236415,0.00004739746,0.00007789921,0.0001269791],"about_ca_topic_score_codex":0.00003672121,"about_ca_topic_score_gemma":0.000027015427,"teacher_disagreement_score":0.9336932,"about_ca_system_score_codex":0.000045964214,"about_ca_system_score_gemma":0.000007791805,"threshold_uncertainty_score":0.567413},"labels":[],"label_agreement":null},{"id":"W2113884043","doi":"10.1109/tnn.2004.839356","title":"Mixtures-of-Experts of Autoregressive Time Series: Asymptotic Normality and Model Specification","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Autoregressive model; Estimator; Series (stratigraphy); Asymptotic distribution; Conditional probability distribution; Mathematics; Covariate; Applied mathematics; Conditional expectation; Multinomial distribution; Model selection; Time series; Linear model; Computer science; Econometrics; Statistics","score_opus":0.014191435877500097,"score_gpt":0.2465642726845874,"score_spread":0.23237283680708729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113884043","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.0063924924,0.00019386396,0.99215657,0.0005299848,0.00020936849,0.00017072634,0.000008022643,0.00006368115,0.00027529913],"genre_scores_gemma":[0.82813996,0.000092810806,0.17131004,0.00012688627,0.000055817,0.00001024842,8.653165e-7,0.000010097033,0.0002532843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988333,0.000117201635,0.0003382245,0.00032210807,0.00018319751,0.00020598483],"domain_scores_gemma":[0.9991006,0.000106037696,0.0001561244,0.000459061,0.000082750776,0.00009542547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017604786,0.00016935928,0.00025564525,0.00008647851,0.00009659427,0.000028785567,0.00030112045,0.0001237207,0.0000127726535],"category_scores_gemma":[0.0000024668402,0.00014701349,0.00010183655,0.0001949649,0.00010430364,0.0004914491,0.0000041346957,0.00019033527,0.0000011733779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006451915,0.00014261568,0.0000035941134,0.000017332408,0.000027343865,0.0000017028631,0.0006191174,0.73851156,0.003903084,0.0021508327,0.00020253319,0.25435573],"study_design_scores_gemma":[0.00020818008,0.00009943367,0.000055281365,0.000027222277,0.000016802056,0.000018252693,0.0000022332463,0.9812207,0.017348513,0.0008376999,0.00003157343,0.00013409663],"about_ca_topic_score_codex":0.0000057661614,"about_ca_topic_score_gemma":0.000005177401,"teacher_disagreement_score":0.8217475,"about_ca_system_score_codex":0.000022481772,"about_ca_system_score_gemma":0.000023742294,"threshold_uncertainty_score":0.59950364},"labels":[],"label_agreement":null},{"id":"W2114397911","doi":"10.1109/tnn.2002.1021883","title":"Automatic machine interactions for content-based image retrieval using a self-organizing tree map architecture","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Illinois at Urbana-Champaign","keywords":"Computer science; Image retrieval; Content-based image retrieval; Relevance feedback; Artificial intelligence; Visual Word; Relevance (law); Tree (set theory); Automatic image annotation; Similarity (geometry); Pattern recognition (psychology); Information retrieval; Data mining; Image (mathematics); Computer vision","score_opus":0.04178716581228696,"score_gpt":0.26097281638139547,"score_spread":0.2191856505691085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114397911","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.0021102019,0.00007824153,0.99226743,0.0026122015,0.000925943,0.00061932736,0.000019682031,0.0013426563,0.000024346082],"genre_scores_gemma":[0.7627066,0.000013286256,0.23592612,0.00091125973,0.0001166617,0.000033394383,0.0000044989747,0.000044511653,0.00024371303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982929,0.000120729215,0.00042284603,0.0004815112,0.00025688612,0.00042513042],"domain_scores_gemma":[0.99862087,0.0003464753,0.00017392261,0.000553487,0.0001632936,0.00014194408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014871029,0.00029272947,0.00026634682,0.00025011515,0.0005260802,0.00026578503,0.00053141656,0.00011703776,0.000106343185],"category_scores_gemma":[0.000011967475,0.00026702226,0.0002748826,0.000723551,0.00006395523,0.00047587216,0.000004394772,0.00056015194,0.000014766831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004415418,0.0033649458,0.000027479895,0.0004630673,0.00048708596,0.000094809926,0.0013480694,0.102717206,0.39302093,0.00046327716,0.0014411586,0.49613044],"study_design_scores_gemma":[0.0005417564,0.00016170816,0.000009063259,0.000049730083,0.000051378174,0.000045922683,0.000010161923,0.88836277,0.11020381,0.00003655088,0.00027749702,0.0002496325],"about_ca_topic_score_codex":0.0000095714695,"about_ca_topic_score_gemma":0.000008523852,"teacher_disagreement_score":0.7856456,"about_ca_system_score_codex":0.00015056861,"about_ca_system_score_gemma":0.00002226808,"threshold_uncertainty_score":0.9999782},"labels":[],"label_agreement":null},{"id":"W2114467592","doi":"10.1109/tnn.2009.2023379","title":"Stability Analysis of Discrete-Time Recurrent Neural Networks With Stochastic Delay","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stability (learning theory); Probability distribution; Artificial neural network; Discrete time and continuous time; Recurrent neural network; Random variable; Control theory (sociology); Computer science; Stochastic process; Stochastic neural network; Probability density function; Mathematics; Artificial intelligence; Statistics; Machine learning","score_opus":0.012485482420344307,"score_gpt":0.23114540382400572,"score_spread":0.21865992140366142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114467592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074620366,0.00011648132,0.92333865,0.0005065812,0.0005744686,0.00052132615,0.00001816931,0.00027386346,0.000030077379],"genre_scores_gemma":[0.99832284,0.000022542283,0.001148926,0.0003153552,0.000094893054,0.000026164314,0.000026191656,0.000021322006,0.00002177879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965066,0.0004012429,0.0007896029,0.0009820717,0.0005815053,0.0007390059],"domain_scores_gemma":[0.99746865,0.0004998444,0.0003071317,0.0012142998,0.00022763606,0.00028243987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035199476,0.00048344085,0.0007713456,0.00031415338,0.00037951485,0.00015882454,0.00083259825,0.0002059097,0.0000924818],"category_scores_gemma":[0.0000074018426,0.0003983074,0.00045788704,0.0039177462,0.00019905313,0.0007578783,0.000008416168,0.00079850253,0.0000024446279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022259777,0.00030442415,0.00006257796,0.0000051535885,0.0001856302,0.000007884335,0.000108756365,0.93981296,0.00002447827,0.00008700792,0.000023064013,0.05915544],"study_design_scores_gemma":[0.0004388188,0.0011196559,0.001232868,0.000027840562,0.00047891826,0.000014082869,0.00000842775,0.9961359,0.00008592665,0.000049378246,0.0000026863263,0.00040549648],"about_ca_topic_score_codex":0.000025129519,"about_ca_topic_score_gemma":0.00019221676,"teacher_disagreement_score":0.9237025,"about_ca_system_score_codex":0.00012621377,"about_ca_system_score_gemma":0.000030578856,"threshold_uncertainty_score":0.9998469},"labels":[],"label_agreement":null},{"id":"W2115101923","doi":"10.1109/72.963787","title":"Compound binomial processes in neural integration","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Artificial neural network; Computer science; Stochastic process; Bernoulli's principle; Stochastic neural network; Bernoulli process; Event (particle physics); Multiplexing; Bernoulli trial; Algorithm; Mathematics; Artificial intelligence; Recurrent neural network; Statistics; Telecommunications","score_opus":0.02193154123387744,"score_gpt":0.2515548845564565,"score_spread":0.22962334332257908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115101923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096676335,0.00010587929,0.89937276,0.0019808356,0.0009466565,0.00036771694,0.0000026675452,0.00027919334,0.000267954],"genre_scores_gemma":[0.9975469,0.00017266687,0.0008141996,0.0009059648,0.00021609459,0.00013246578,0.000004650591,0.000019676143,0.00018739843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.00008105535,0.0003843503,0.00053584715,0.00021368213,0.0004581089],"domain_scores_gemma":[0.9990317,0.00021621816,0.0000896682,0.00045807144,0.00007503838,0.00012927743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009757386,0.00025694372,0.00021889171,0.00018323913,0.00028842088,0.00023810033,0.00064140285,0.00011809366,0.000024422456],"category_scores_gemma":[0.0000027941555,0.00023305687,0.00009654952,0.0016177398,0.0000659011,0.00072781,0.0000051148504,0.0005963556,0.000019675017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045389643,0.00020523189,0.00007194221,0.0000045324878,0.0000057759235,0.000037211536,0.00007990669,0.8113451,0.00016007922,0.0002566125,0.00031544754,0.18747276],"study_design_scores_gemma":[0.00042314414,0.00012498008,0.0003997759,0.00002554654,0.0000068860622,0.00010103745,0.000011372362,0.9973859,0.00046237203,0.00018884012,0.0006194786,0.00025063643],"about_ca_topic_score_codex":0.0000626582,"about_ca_topic_score_gemma":0.00064693694,"teacher_disagreement_score":0.90087056,"about_ca_system_score_codex":0.0000604052,"about_ca_system_score_gemma":0.000029162236,"threshold_uncertainty_score":0.9503783},"labels":[],"label_agreement":null},{"id":"W2116019577","doi":"10.1109/tnn.2002.806647","title":"Face recognition using LDA-based algorithms","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":799,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear discriminant analysis; Eigenface; Facial recognition system; Pattern recognition (psychology); Computer science; Artificial intelligence; Face (sociological concept); Feature (linguistics); Feature extraction; Statistical classification; Representation (politics); Principal component analysis; Machine learning","score_opus":0.04399648047983817,"score_gpt":0.2591615522076355,"score_spread":0.2151650717277973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116019577","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.015894137,0.00003791902,0.98135644,0.00017442471,0.001849389,0.00021257422,0.0000075320017,0.00026505056,0.00020253262],"genre_scores_gemma":[0.96491605,0.000021318323,0.033849265,0.0010291988,0.000053766526,0.00003280315,0.000004927734,0.000019852172,0.00007284396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855316,0.00018444749,0.00023828255,0.00042360296,0.00023719491,0.00036333047],"domain_scores_gemma":[0.9992409,0.00012649727,0.000076464494,0.00034363815,0.00007493512,0.00013757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014599659,0.00020315014,0.0001535391,0.00014609711,0.00035465093,0.00013642876,0.00023528546,0.00014720723,0.00010490011],"category_scores_gemma":[0.000003903086,0.00019592409,0.00014030321,0.0005340608,0.000035223704,0.00051090197,0.0000011117913,0.00037791583,0.000065517925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136755,0.00011148367,0.0000017399333,0.00000422893,0.000008641796,0.0000100106845,0.000029254672,0.78925014,0.00057682785,0.000007286193,0.00015968428,0.20982705],"study_design_scores_gemma":[0.00047837917,0.00010099248,0.000005262616,0.00004834839,0.000015998809,0.000027299044,0.000016956154,0.969136,0.029509362,0.00016470844,0.00025162273,0.00024509305],"about_ca_topic_score_codex":0.000014639795,"about_ca_topic_score_gemma":0.0000058541686,"teacher_disagreement_score":0.9490219,"about_ca_system_score_codex":0.000047147027,"about_ca_system_score_gemma":0.000032126725,"threshold_uncertainty_score":0.79895526},"labels":[],"label_agreement":null},{"id":"W2117319878","doi":"10.1109/tnn.2004.824248","title":"Branching Competitive Learning Network: A Novel Self-Creating Model","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Competitive learning; Vector quantization; Cluster analysis; Computer science; Learning vector quantization; Quantization (signal processing); Adaptability; Artificial intelligence; Artificial neural network; Branching (polymer chemistry); Algorithm; Theoretical computer science","score_opus":0.014163992524662574,"score_gpt":0.23384284334311212,"score_spread":0.21967885081844954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117319878","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.006937359,0.000066294444,0.9890953,0.00079070893,0.00058136863,0.0003717684,0.0000032981736,0.001048802,0.001105142],"genre_scores_gemma":[0.93831,0.00007419479,0.059871994,0.0011100286,0.00034306926,0.000095636184,0.0000032654928,0.000043046588,0.000148747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976581,0.00006708805,0.0004226692,0.00073158834,0.0003146166,0.0008059359],"domain_scores_gemma":[0.9987553,0.00024930653,0.0001664897,0.0005175764,0.0000822627,0.00022909153],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0001974732,0.00036778927,0.00031006854,0.000093203635,0.0013559394,0.00029413262,0.0007081311,0.0001498325,0.0000073541523],"category_scores_gemma":[0.0000022879947,0.00036405007,0.00023047184,0.00092875236,0.00005897883,0.00063781365,0.000013746792,0.001245866,0.000018226672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001105096,0.00015774347,0.0000045760385,0.0000040094246,0.00002986745,0.000005990352,0.00027929392,0.970925,0.0002074556,0.015298556,0.000027459786,0.013049023],"study_design_scores_gemma":[0.0007099061,0.0001182395,0.00003476169,0.00007489746,0.000026548749,0.00005367912,0.000017990775,0.9972244,0.00026532228,0.0009425588,0.00015181124,0.00037988575],"about_ca_topic_score_codex":0.00003595382,"about_ca_topic_score_gemma":0.000055835124,"teacher_disagreement_score":0.93137264,"about_ca_system_score_codex":0.00011393453,"about_ca_system_score_gemma":0.000050608436,"threshold_uncertainty_score":0.99994415},"labels":[],"label_agreement":null},{"id":"W2117439573","doi":"10.1109/tnn.2006.875985","title":"Nonlinear Spatial–Temporal Prediction based on Optimal Fusion","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Chinese University of Hong Kong; University of Hong Kong","keywords":"Computer science; Clutter; Artificial intelligence; Pattern recognition (psychology); Radar; Nonlinear system; Gaussian; Support vector machine; Sensor fusion; Statistic; Spatial analysis; Signal processing; Algorithm; Data mining; Mathematics; Statistics; Telecommunications","score_opus":0.010905054886476188,"score_gpt":0.2301694800242323,"score_spread":0.2192644251377561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117439573","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.010463168,0.000007868858,0.98552704,0.0010600955,0.0009598161,0.00033821038,0.000014752968,0.0011128571,0.0005161948],"genre_scores_gemma":[0.97487736,0.000005756088,0.02342921,0.00115963,0.0002454323,0.00005220231,0.000023193787,0.00002507626,0.0001821301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830323,0.00016579247,0.00034762608,0.00048256456,0.00039921902,0.00030155943],"domain_scores_gemma":[0.9990788,0.000115932264,0.00010547486,0.00053651223,0.00007409842,0.00008917993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021403299,0.00023820257,0.00017107761,0.00023395361,0.00029622324,0.00016838907,0.00037487494,0.0001875578,0.00003666498],"category_scores_gemma":[0.0000014863898,0.0002286562,0.00015645628,0.00047423187,0.0000451795,0.0003817389,0.0000028669244,0.0005395799,0.000019786994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059027894,0.00027451475,0.000022782442,0.0000021427243,0.0000033904494,0.000009082582,0.00001826449,0.97348714,0.00013726548,0.0000878676,0.0007826929,0.025115842],"study_design_scores_gemma":[0.00043632148,0.00058310886,0.00023409053,0.000022459004,0.000008478555,0.000008173783,0.0000016230947,0.9893575,0.008265012,0.00004495419,0.0008462487,0.0001920882],"about_ca_topic_score_codex":0.00019501155,"about_ca_topic_score_gemma":0.000111090725,"teacher_disagreement_score":0.9644142,"about_ca_system_score_codex":0.00006498682,"about_ca_system_score_gemma":0.00003539948,"threshold_uncertainty_score":0.9324329},"labels":[],"label_agreement":null},{"id":"W2119698875","doi":"10.1109/tnn.2008.2000447","title":"A Neural Model for Compensation of Sensory Abnormalities in Autism Through Feedback From a Measure of Global Perception","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Autism Spectrum Disorder Research","field":"Neuroscience","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Autism; Sensory system; Measure (data warehouse); Perception; Compensation (psychology); Computer science; Neurophysiology; Artificial neural network; Artificial intelligence; Cognitive psychology; Speech recognition; Neuroscience; Psychology; Data mining; Developmental psychology","score_opus":0.07792584610969892,"score_gpt":0.3006184927202792,"score_spread":0.22269264661058025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119698875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6350813,0.000032239484,0.36332992,0.00052924,0.00019100119,0.0004975781,0.00021681262,0.00004818032,0.00007374796],"genre_scores_gemma":[0.99893063,0.00012460139,0.0005841262,0.00016706457,0.00002511912,0.00006401884,0.0000065138843,0.000027380336,0.0000705639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790055,0.00024690572,0.0005278501,0.00044981015,0.00044098994,0.00043391087],"domain_scores_gemma":[0.99912864,0.00030581007,0.00015770385,0.00031179134,0.00003244894,0.00006359575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010199971,0.0002288091,0.00036936105,0.00008881867,0.00020312172,0.000014697798,0.00025732935,0.00017297808,0.000044060114],"category_scores_gemma":[0.000013552543,0.00023680911,0.00020989103,0.0004953559,0.00034961675,0.00043414644,0.000003915311,0.00040518926,0.0000029371784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071873714,0.00026961512,0.00029454395,0.000024760204,0.000009157769,0.000006419802,0.0014191851,0.9792657,0.015217895,0.0008273176,0.00002012992,0.0019265595],"study_design_scores_gemma":[0.0013161439,0.00021241265,0.007190385,0.000037024995,0.000018224666,0.000027883958,0.00009730287,0.98254913,0.006093016,0.0022761612,0.0000010585914,0.00018122685],"about_ca_topic_score_codex":0.00080017553,"about_ca_topic_score_gemma":0.00065914035,"teacher_disagreement_score":0.3638493,"about_ca_system_score_codex":0.00013390464,"about_ca_system_score_gemma":0.0000677864,"threshold_uncertainty_score":0.9656795},"labels":[],"label_agreement":null},{"id":"W2120271349","doi":"10.1109/72.935098","title":"Cost functions and model combination for VaR-based asset allocation using neural networks","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Asset allocation; Portfolio; Artificial neural network; Benchmark (surveying); Asset (computer security); Portfolio optimization; Hyperparameter; Artificial intelligence; Allocator; Machine learning; Mathematical optimization; Operations research; Economics; Finance","score_opus":0.1803604063505602,"score_gpt":0.3916355985386564,"score_spread":0.21127519218809623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120271349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10333512,0.00004297718,0.89242417,0.00063005043,0.0022571338,0.001021742,0.000032103897,0.00016135946,0.00009537169],"genre_scores_gemma":[0.9872316,0.000012990149,0.011115303,0.0005752125,0.00019899594,0.0002022043,0.000024515815,0.00005754166,0.0005816214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651986,0.000535692,0.0008099856,0.0008345944,0.0007044709,0.0005953812],"domain_scores_gemma":[0.99412686,0.004180856,0.0003359209,0.00060665776,0.00050416094,0.00024552832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021751302,0.00036445496,0.00040890818,0.00046966056,0.0010843148,0.00039300058,0.00037373594,0.00028684313,0.000062642335],"category_scores_gemma":[0.00023252673,0.00033657218,0.00025926947,0.0014154367,0.00015998379,0.00059050054,0.0000051284865,0.00056715397,0.0000027818785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003330577,0.00011017596,0.0001875687,0.000002500588,0.000015269052,0.0000015022227,0.000023647186,0.8025035,0.000060210747,0.00001856223,0.0003665028,0.19637744],"study_design_scores_gemma":[0.0012423045,0.00024470608,0.0004895554,0.000020192154,0.00010677249,0.000044182212,0.00004443442,0.99650955,0.00004992356,0.0007556664,0.00016996234,0.00032272423],"about_ca_topic_score_codex":0.000028457365,"about_ca_topic_score_gemma":0.00012594917,"teacher_disagreement_score":0.88389647,"about_ca_system_score_codex":0.00013472789,"about_ca_system_score_gemma":0.000052639298,"threshold_uncertainty_score":0.9999086},"labels":[],"label_agreement":null},{"id":"W2120609681","doi":"10.1109/tnn.2009.2016959","title":"Adaptive Neural Control for a Class of Nonlinear Systems With Uncertain Hysteresis Inputs and Time-Varying State Delays","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Piezoelectric Actuators and Control","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Nonlinear system; Hysteresis; Bounded function; Adaptive control; Representation (politics); Artificial neural network; Lyapunov function; Backstepping; Class (philosophy); Computer science; Mathematics; State variable; Control (management); Artificial intelligence; Mathematical analysis","score_opus":0.0074544644251497896,"score_gpt":0.1944398523086453,"score_spread":0.1869853878834955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120609681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088650346,0.00037372124,0.9097765,0.000074338415,0.00017592868,0.000687134,0.000080454,0.0001435418,0.000038055252],"genre_scores_gemma":[0.9993346,0.00003723833,0.00022518254,0.00016253653,0.00008248133,0.000071832554,0.0000032377263,0.00003730362,0.000045605844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989201,0.000043452277,0.00030256322,0.00021990419,0.00013603044,0.0003779781],"domain_scores_gemma":[0.99934936,0.00024454272,0.00007099579,0.00015637524,0.000067686065,0.00011106824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000074578944,0.0002552417,0.0004031551,0.00010171365,0.000104075945,0.000039905965,0.000096009,0.00009827328,0.0000022817928],"category_scores_gemma":[0.0000013271977,0.00021339578,0.00009124122,0.00020989837,0.00003225953,0.00015031097,3.4146058e-7,0.0002762241,6.55753e-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.0006576618,0.000031606043,0.000005557414,0.000019735442,0.000118216514,0.00000636395,0.000042321393,0.919151,0.00036523904,0.0000040203586,0.000045528628,0.07955273],"study_design_scores_gemma":[0.0019059045,0.0010523903,0.000015225562,0.000053789416,0.00011613632,0.000023213244,0.0000080819,0.99636036,0.00021708684,0.000009138587,0.00002029002,0.00021835281],"about_ca_topic_score_codex":0.000019218274,"about_ca_topic_score_gemma":0.000012912216,"teacher_disagreement_score":0.9106842,"about_ca_system_score_codex":0.000045344474,"about_ca_system_score_gemma":0.000012680662,"threshold_uncertainty_score":0.8702027},"labels":[],"label_agreement":null},{"id":"W2121235350","doi":"10.1109/tnn.2006.873285","title":"OR/AND neurons and the development of interpretable logic models","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta Hospital; Alberta Hospital Edmonton; University of Alberta","funders":"","keywords":"Fuzzy logic; Computer science; Theoretical computer science; Modular design; Mathematics; Artificial intelligence","score_opus":0.021930472644109546,"score_gpt":0.23477964709518126,"score_spread":0.2128491744510717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121235350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015524643,0.0001611898,0.98251384,0.0010144375,0.00017683525,0.0002503005,0.0000014548813,0.0000685469,0.00028872944],"genre_scores_gemma":[0.9933865,0.00008880982,0.0058267578,0.0003540561,0.000030187255,0.00006167054,4.6127067e-7,0.0000085019365,0.00024307122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.000060074657,0.00029297458,0.00028581728,0.00011765383,0.00021372458],"domain_scores_gemma":[0.9992685,0.00028625986,0.000074874115,0.000290694,0.000027772554,0.000051917534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012126427,0.00014437376,0.00017434209,0.00004386927,0.00033294354,0.00008706619,0.00030202532,0.000049006587,0.000004596709],"category_scores_gemma":[6.1010263e-7,0.00008812951,0.000048032016,0.00028850604,0.000163239,0.00022253432,0.000010535544,0.00022851767,8.0363e-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.000064874,0.00006290188,0.0000028228387,0.0000059138097,0.000012429859,0.0000014811749,0.00014455071,0.9027197,0.00007582607,0.017794192,0.00013336702,0.07898196],"study_design_scores_gemma":[0.00041727646,0.0000388204,0.00006808858,0.000013397418,0.000012369214,0.000022927572,0.0000073078545,0.9956984,0.00030268115,0.0031764482,0.00013949462,0.0001028247],"about_ca_topic_score_codex":0.000026220247,"about_ca_topic_score_gemma":0.00012084552,"teacher_disagreement_score":0.9778618,"about_ca_system_score_codex":0.000008297236,"about_ca_system_score_gemma":0.00001545818,"threshold_uncertainty_score":0.35938174},"labels":[],"label_agreement":null},{"id":"W2121404151","doi":"10.1109/tnn.2007.899128","title":"Neural Network Control for Position Tracking of a Two-Axis Inverted Pendulum System: Experimental Studies","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Inverted pendulum; Artificial neural network; Double inverted pendulum; Control theory (sociology); Position (finance); Computer science; Tracking (education); Control system; Artificial intelligence; Control (management); Nonlinear system; Physics; Engineering","score_opus":0.02831380704934414,"score_gpt":0.27775143763716376,"score_spread":0.24943763058781962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121404151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11490914,0.0023741922,0.8767329,0.000030232339,0.0043627815,0.001051157,0.0000419254,0.00044422116,0.000053488082],"genre_scores_gemma":[0.9981961,0.000014030137,0.0004694343,0.00009814264,0.00096036756,0.00014001022,0.000007470233,0.000092930626,0.00002150783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797326,0.00009536726,0.00076297746,0.00030672015,0.00024328937,0.000618377],"domain_scores_gemma":[0.99874544,0.0005495187,0.00014933183,0.00025229613,0.00017244466,0.00013095324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003752535,0.0003724116,0.00064686657,0.00014314358,0.00022115737,0.000030501109,0.00016928709,0.00015765987,0.0000063195525],"category_scores_gemma":[0.0000041074,0.00037013728,0.00032826109,0.00028946035,0.0000843031,0.0002531885,0.0000013742772,0.00035845567,0.0000026575844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004432747,0.00006493056,0.000022666243,0.000095228286,0.00037167195,0.000016982016,0.00016076436,0.9857944,0.0072723543,0.000045181016,0.00019387074,0.0055186437],"study_design_scores_gemma":[0.0029151377,0.00043411448,0.000089785106,0.00018117092,0.0001608853,0.000051797826,0.0005062671,0.989438,0.0058911215,0.0000039724255,0.000023141341,0.00030461483],"about_ca_topic_score_codex":0.000022877904,"about_ca_topic_score_gemma":0.00012574763,"teacher_disagreement_score":0.88328695,"about_ca_system_score_codex":0.00025459472,"about_ca_system_score_gemma":0.000007667739,"threshold_uncertainty_score":0.99987507},"labels":[],"label_agreement":null},{"id":"W2121472132","doi":"10.1109/tnn.2010.2046497","title":"Realization of the Conscience Mechanism in CMOS Implementation of Winner-Takes-All Self-Organizing Neural Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial neural network; Computer science; CMOS; Realization (probability); MATLAB; Winner-take-all; Mechanism (biology); Quantization (signal processing); Electronic engineering; Artificial intelligence; Control engineering; Engineering; Algorithm","score_opus":0.012075696766829336,"score_gpt":0.2522204979835713,"score_spread":0.24014480121674198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121472132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690272,0.000012427386,0.75050604,0.0004900873,0.0013919761,0.0005619187,0.0000050493086,0.00009284656,0.00003695053],"genre_scores_gemma":[0.99782485,0.000024163795,0.0015740048,0.00040153926,0.00007497363,0.000053967768,0.0000028900156,0.00002018463,0.0000234563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793375,0.0001405217,0.0006598372,0.00047998916,0.00035331325,0.0004326053],"domain_scores_gemma":[0.99843526,0.00019841745,0.00038170716,0.00075779087,0.0001301192,0.00009669468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031328358,0.00023678062,0.00026079727,0.0001328865,0.0002608078,0.00007326942,0.0010181154,0.00015002897,0.000033702603],"category_scores_gemma":[0.0000030592378,0.0001946575,0.00014770307,0.0016042249,0.00011997422,0.00047296647,0.000014624779,0.0007345484,7.3053565e-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.000012326668,0.00017684714,0.000797416,0.00000991699,0.000018716197,0.0000020775597,0.0005911728,0.9516319,0.011743056,0.010547117,0.00009258491,0.024376841],"study_design_scores_gemma":[0.00042219894,0.00009743946,0.002875759,0.000019188168,0.000026371765,0.00002166184,0.000050360573,0.98135144,0.0144153405,0.0004890333,0.00003892064,0.00019227772],"about_ca_topic_score_codex":0.0007484171,"about_ca_topic_score_gemma":0.007980985,"teacher_disagreement_score":0.7509221,"about_ca_system_score_codex":0.000050219798,"about_ca_system_score_gemma":0.000062012245,"threshold_uncertainty_score":0.7937902},"labels":[],"label_agreement":null},{"id":"W2123727571","doi":"10.1109/tnn.2004.824412","title":"Combining Expert Neural Networks Using Reinforcement Feedback for Learning Primitive Grasping Behavior","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robot Manipulation and Learning","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; GRASP; Reinforcement learning; Task (project management); Artificial intelligence; Object (grammar); Artificial neural network; Robot; Architecture; Machine learning","score_opus":0.03753288780465127,"score_gpt":0.26801828527163574,"score_spread":0.23048539746698446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123727571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08114377,0.00015656411,0.9150436,0.00003848496,0.002163943,0.0006813278,4.826507e-7,0.0006814506,0.00009039397],"genre_scores_gemma":[0.9975033,0.0000506818,0.0013924231,0.00030161437,0.0003503478,0.0001803522,0.000020017831,0.00014225558,0.00005903599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807835,0.000058435053,0.00052579783,0.00038284197,0.0002240191,0.00073057646],"domain_scores_gemma":[0.99929816,0.00013315897,0.000108290405,0.00022089251,0.000070695845,0.00016879968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013356804,0.00041820674,0.0003499615,0.00018502651,0.000733249,0.00015239768,0.00016685744,0.00023103472,0.000041912248],"category_scores_gemma":[0.000004945621,0.00046916187,0.00027226313,0.00036382614,0.0000534536,0.00039491293,0.0000031072705,0.0010885717,0.0000039301663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056480174,0.000035072022,0.00003781175,0.0000135159635,0.000048841448,0.00000874964,0.00033174513,0.9836948,0.00071569433,0.000024753526,0.000011378553,0.015021151],"study_design_scores_gemma":[0.001387411,0.00021475817,0.00019007183,0.00011242105,0.00007874395,0.000030624025,0.00020367873,0.9965595,0.0006718726,0.000003335373,0.00006111487,0.0004864417],"about_ca_topic_score_codex":0.00004371287,"about_ca_topic_score_gemma":0.000019346402,"teacher_disagreement_score":0.9163595,"about_ca_system_score_codex":0.00027847703,"about_ca_system_score_gemma":0.000012581376,"threshold_uncertainty_score":0.999776},"labels":[],"label_agreement":null},{"id":"W2123847705","doi":"10.1109/tnn.2011.2163169","title":"A New Formulation for Feedforward Neural Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial neural network; Computer science; Feedforward neural network; Regularization (linguistics); Stochastic neural network; Artificial intelligence; Backpropagation; Time delay neural network; Types of artificial neural networks; Generalization; Measure (data warehouse); Probabilistic neural network; Feed forward; Machine learning; Algorithm; Mathematics; Data mining","score_opus":0.033822963046535905,"score_gpt":0.24762515996303097,"score_spread":0.21380219691649507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123847705","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.0015632014,0.00009633168,0.9935802,0.000789715,0.0021309038,0.0010062255,0.000006670094,0.00056452694,0.00026221236],"genre_scores_gemma":[0.97543323,0.000046614776,0.021651465,0.0014085929,0.0005671532,0.0002655312,0.000008954664,0.000051776056,0.00056668353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762166,0.00005934349,0.00052301824,0.00075116206,0.0002472291,0.00079761824],"domain_scores_gemma":[0.9982604,0.00023838655,0.00018421096,0.00083523977,0.000107348584,0.00037443105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015031525,0.00040244026,0.00032429778,0.00014713258,0.0006107331,0.00019810008,0.0009597075,0.00031610686,0.000060851988],"category_scores_gemma":[0.0000021457956,0.0003744577,0.00038875197,0.0008417035,0.00003340874,0.00086232484,0.00000967254,0.00072865497,0.00001305793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008993749,0.00008858231,0.000013330425,0.0000041590038,0.000029316998,0.0000031170669,0.00008872184,0.71939486,0.000025323152,0.004755857,0.0025892747,0.2729175],"study_design_scores_gemma":[0.000700123,0.0003522828,0.0002362752,0.00001419541,0.000045108514,0.000029327848,0.0000056367057,0.99559194,0.00041603076,0.0013498544,0.00085513754,0.00040407147],"about_ca_topic_score_codex":0.00006492719,"about_ca_topic_score_gemma":0.00007884083,"teacher_disagreement_score":0.97387004,"about_ca_system_score_codex":0.000052707288,"about_ca_system_score_gemma":0.000026840105,"threshold_uncertainty_score":0.9998707},"labels":[],"label_agreement":null},{"id":"W2124588103","doi":"10.1109/72.846745","title":"Logic operations based on single neuron rational model","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Logic gate; Partition (number theory); Mathematics; Algorithm","score_opus":0.03745958330615788,"score_gpt":0.24424282436584172,"score_spread":0.20678324105968382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124588103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17958093,0.0000040060486,0.8112558,0.0034156,0.0013904487,0.00054720783,0.00007462622,0.00037549826,0.0033558626],"genre_scores_gemma":[0.9828599,0.000021874173,0.00020769342,0.013773608,0.00013066299,0.000066774315,0.0000125423085,0.00003996759,0.0028869417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981944,0.00016170843,0.00028969435,0.00061836257,0.0003612667,0.0003745622],"domain_scores_gemma":[0.9991789,0.0002710515,0.00003491579,0.00034888362,0.000032193388,0.00013404981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000064333006,0.00027046815,0.00016430674,0.00013093067,0.00067961897,0.00015019877,0.00020322217,0.00012092264,0.0008281585],"category_scores_gemma":[0.000010347194,0.0002445645,0.00016746049,0.00043240198,0.00009215827,0.00028745615,8.486498e-7,0.0005424931,0.00010636805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019463101,0.00039420815,4.8831004e-7,0.0000017965755,0.0000017289647,0.000010010671,0.0000069472003,0.9565937,0.024031807,0.00025243382,0.0002101863,0.0183021],"study_design_scores_gemma":[0.00047118976,0.0005563636,0.000019034122,0.000010470717,0.0000144948,0.000015975646,0.0000010795854,0.99027854,0.008104161,0.00014132872,0.00015022291,0.00023712282],"about_ca_topic_score_codex":0.0000065459285,"about_ca_topic_score_gemma":0.00003131479,"teacher_disagreement_score":0.81104815,"about_ca_system_score_codex":0.00006622523,"about_ca_system_score_gemma":0.000026280868,"threshold_uncertainty_score":0.99730504},"labels":[],"label_agreement":null},{"id":"W2124700032","doi":"10.1109/tnn.2004.824409","title":"Fast Converging Minimum Probability of Error Neural Network Receivers for DS-CDMA Communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Code division multiple access; Additive white Gaussian noise; Bit error rate; Artificial neural network; Algorithm; Perceptron; Multilayer perceptron; Electronic engineering; White noise; Artificial intelligence; Decoding methods; Computer network; Telecommunications; Engineering","score_opus":0.040451058940625825,"score_gpt":0.27218938545904026,"score_spread":0.23173832651841442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124700032","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.039109815,0.00011621684,0.95771885,0.00020512413,0.00090837467,0.00087886606,0.000066055545,0.00087900547,0.000117688185],"genre_scores_gemma":[0.94846636,0.000100376266,0.050924517,0.00006830998,0.0000894687,0.00024174812,0.000013645535,0.00007025489,0.000025323325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986464,0.000048608304,0.00044275587,0.00028204272,0.00012551191,0.00045468935],"domain_scores_gemma":[0.9986962,0.00022089171,0.00009196372,0.0007961036,0.00009443943,0.000100385114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012258283,0.00028767352,0.00033141137,0.00008378333,0.00023980321,0.000019596975,0.0004635854,0.00014905503,0.000012523711],"category_scores_gemma":[0.00000569748,0.00031470865,0.00021481972,0.00035491728,0.00023051123,0.00025293854,0.0000058497544,0.0005191186,0.0000015762741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000786451,0.0000634982,0.0000100925745,0.000044126922,0.000043631415,9.594212e-7,0.00009026367,0.98826575,0.0008785927,0.00017901049,0.00010836928,0.010237071],"study_design_scores_gemma":[0.000668759,0.00023547407,0.00009904242,0.000119154705,0.000051018953,0.000008656687,0.00003533669,0.99163026,0.005372725,0.0010827419,0.0003662735,0.00033053913],"about_ca_topic_score_codex":0.000014636038,"about_ca_topic_score_gemma":0.000093722876,"teacher_disagreement_score":0.90935653,"about_ca_system_score_codex":0.00018024612,"about_ca_system_score_gemma":0.000014159955,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W2124830618","doi":"10.1109/72.896802","title":"New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Algorithm; Artificial neural network; Gradient descent; Feedforward neural network; Computer science; Convergence (economics); Controller (irrigation); Feed forward; Nonlinear system; Heuristic; Least-squares function approximation; Stochastic gradient descent; Control theory (sociology); Mathematics; Machine learning; Artificial intelligence; Control (management); Control engineering","score_opus":0.024803246493477215,"score_gpt":0.2658776239057754,"score_spread":0.2410743774122982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124830618","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.025501234,0.00020853143,0.97234964,0.0000471069,0.00075390196,0.00068245624,0.0000677806,0.00037944442,0.000009909841],"genre_scores_gemma":[0.96102166,0.000127615,0.038236335,0.000064052925,0.00040266957,0.00003734621,0.0000113625765,0.0000825922,0.000016351563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988024,0.000041284475,0.00034150458,0.00029812116,0.00012514913,0.00039154125],"domain_scores_gemma":[0.9992344,0.00024255808,0.0000957799,0.00021055053,0.0000854216,0.00013133479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000058112433,0.00030990344,0.00034630336,0.00012728761,0.00015796017,0.000039369894,0.0001247486,0.00019009516,0.000013790373],"category_scores_gemma":[0.000004486442,0.00033001724,0.00013506919,0.00024430014,0.0000732314,0.00043071076,0.0000018780518,0.00041467344,2.1557707e-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.0003102873,0.000022101665,0.000007420055,0.000012763462,0.000056860663,0.0000032394773,0.00004277145,0.8933138,0.0010887206,0.000013759908,0.000020609154,0.10510761],"study_design_scores_gemma":[0.0008599759,0.00032859488,0.000051470044,0.00004887251,0.00007974532,0.00003721289,0.000029805193,0.9948104,0.0031571432,0.00023988329,0.000071968876,0.00028490048],"about_ca_topic_score_codex":0.000021863041,"about_ca_topic_score_gemma":0.000036744626,"teacher_disagreement_score":0.9355204,"about_ca_system_score_codex":0.000080276506,"about_ca_system_score_gemma":0.000007788153,"threshold_uncertainty_score":0.9999152},"labels":[],"label_agreement":null},{"id":"W2125593342","doi":"10.1109/tnn.2008.2004625","title":"Uncorrelated Multilinear Discriminant Analysis With Regularization and Aggregation for Tensor Object Recognition","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Pattern recognition (psychology); Multilinear map; Artificial intelligence; Linear discriminant analysis; Computer science; Subspace topology; Linear subspace; Discriminative model; Facial recognition system; Regularization (linguistics); Mathematics","score_opus":0.017454524189396282,"score_gpt":0.205382570848019,"score_spread":0.18792804665862273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125593342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26483756,0.000033690318,0.73448277,0.000030074672,0.00012653248,0.00022192707,0.00003582629,0.0002012176,0.000030386003],"genre_scores_gemma":[0.9975361,0.00031893948,0.0015280143,0.000051348627,0.00004783783,0.00008290326,0.00019484908,0.000034370947,0.00020563744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917287,0.00003286863,0.00023586632,0.000245714,0.00011717003,0.00019549388],"domain_scores_gemma":[0.99954784,0.00008360502,0.000048919184,0.00012851882,0.00010896106,0.00008214764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005107412,0.00018816291,0.00023405932,0.00030720193,0.00026356557,0.00003154562,0.00003663721,0.000117136115,0.0000321942],"category_scores_gemma":[0.0000032956589,0.00016107716,0.00015573624,0.0008690481,0.000050504634,0.00018178113,3.047911e-7,0.00018668978,0.000003497478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008300822,0.000040717376,0.00010822247,0.000014126889,0.00034723277,0.0000040895716,0.00008070038,0.94359773,0.00018457508,4.781498e-7,0.0000245385,0.055514604],"study_design_scores_gemma":[0.0006627656,0.00011027518,0.0011421979,0.000027106928,0.0011158286,0.000024847483,0.00004346199,0.99437064,0.0022569394,0.000011769142,0.00001746998,0.00021670049],"about_ca_topic_score_codex":0.000017377697,"about_ca_topic_score_gemma":0.00016434115,"teacher_disagreement_score":0.73295474,"about_ca_system_score_codex":0.000031015017,"about_ca_system_score_gemma":0.000004902157,"threshold_uncertainty_score":0.65685356},"labels":[],"label_agreement":null},{"id":"W2128734552","doi":"10.1109/tnn.2010.2101614","title":"MDS-Based Multiresolution Nonlinear Dimensionality Reduction Model for Color Image Segmentation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Artificial intelligence; Image segmentation; Pattern recognition (psychology); Computer science; Scale-space segmentation; Cluster analysis; Image texture; Dimensionality reduction; Segmentation-based object categorization; Segmentation; Embedding; Feature extraction; Multiresolution analysis; Computer vision; Wavelet transform; Wavelet","score_opus":0.049319042423821645,"score_gpt":0.257821001767294,"score_spread":0.20850195934347235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128734552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092433564,0.000015314661,0.9050085,0.000066045264,0.0012040847,0.0006563497,0.000039942042,0.000522336,0.00005386658],"genre_scores_gemma":[0.9090139,0.000014626287,0.09053395,0.000048497397,0.00010063367,0.000083510786,0.000060159757,0.00006297227,0.00008175316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998841,0.000047889713,0.00034093577,0.00031341735,0.0001637752,0.00029302106],"domain_scores_gemma":[0.9993434,0.00006916619,0.00007100174,0.0002865464,0.00013966861,0.0000902507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013175633,0.00022799117,0.00016541428,0.00011828737,0.00024566642,0.00003247909,0.00008285988,0.0001653446,0.000015211221],"category_scores_gemma":[0.000004497112,0.00024721082,0.00014458809,0.00020525725,0.00007694212,0.00031661344,5.462783e-7,0.00026978267,0.000011180311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021619849,0.00010862693,9.601097e-7,0.000023562918,0.000019817298,7.625398e-7,0.00007962671,0.91132796,0.076233305,0.000003966876,0.00024150328,0.011743721],"study_design_scores_gemma":[0.00066255155,0.000078698446,0.00006795165,0.00001989259,0.000061040126,0.0000052618093,0.000018014176,0.912067,0.08677479,0.00002594284,0.000008801843,0.0002100619],"about_ca_topic_score_codex":0.000016320211,"about_ca_topic_score_gemma":0.0000148493455,"teacher_disagreement_score":0.81658036,"about_ca_system_score_codex":0.00019917024,"about_ca_system_score_gemma":0.00001804354,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2131040183","doi":"10.1109/tnn.2006.890811","title":"Sensor Integration for Satellite-Based Vehicular Navigation Using Neural Networks","year":2007,"lang":"en","type":"letter","venue":"IEEE Transactions on Neural Networks","topic":"Inertial Sensor and Navigation","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Kingston Health Sciences Centre","funders":"University of Calgary","keywords":"Global Positioning System; Computer science; Sensor fusion; Artificial neural network; Inertial navigation system; Real-time computing; Satellite; Inertial measurement unit; GPS/INS; GPS signals; Assisted GPS; Precision Lightweight GPS Receiver; Artificial intelligence; Remote sensing; Inertial frame of reference; Telecommunications; Gps receiver; Geography; Engineering; Aerospace engineering","score_opus":0.021802289981344654,"score_gpt":0.24559153898731628,"score_spread":0.22378924900597164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131040183","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.010489468,0.0003060056,0.9758661,0.0043241354,0.0068043103,0.0013520309,0.00008262023,0.0007483324,0.000027000538],"genre_scores_gemma":[0.9350788,0.00008278373,0.0016613591,0.05230603,0.008080356,0.00015476525,0.0020909621,0.00043087496,0.00011405016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970638,0.00014061632,0.0008231792,0.00060652284,0.00043343796,0.00093244197],"domain_scores_gemma":[0.9985775,0.00043064955,0.00018392915,0.00046399212,0.00022044206,0.00012351229],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.00021087672,0.0008041699,0.00058298954,0.00035236185,0.0003839215,0.00017465277,0.00022445798,0.0018523019,0.000025178904],"category_scores_gemma":[0.0000037065722,0.0008319948,0.00059801916,0.0006010069,0.00008362494,0.0002629596,9.051969e-7,0.0033380073,0.000005630727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012865465,0.00002202557,0.0000014704659,0.000112864276,0.000070529895,0.000060843522,0.000020326861,0.9587808,0.0006605423,7.1512426e-7,0.006485363,0.033655863],"study_design_scores_gemma":[0.00062433496,0.00014888453,0.000005370453,0.00023077671,0.00030424073,0.000036125744,0.000006592167,0.98660886,0.0051108366,0.00000616575,0.006129746,0.0007880589],"about_ca_topic_score_codex":0.000052458443,"about_ca_topic_score_gemma":0.000027887938,"teacher_disagreement_score":0.9742047,"about_ca_system_score_codex":0.00040296113,"about_ca_system_score_gemma":0.00001561218,"threshold_uncertainty_score":0.99944353},"labels":[],"label_agreement":null},{"id":"W2133702739","doi":"10.1109/tnn.2002.1031938","title":"A recurrent neural network for solving Sylvester equation with time-varying coefficients","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":660,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"iNano Medical (Canada)","funders":"","keywords":"Recurrent neural network; Artificial neural network; Computer science; Sylvester equation; Control theory (sociology); Nonlinear system; Convergence (economics); Inverted pendulum; Applied mathematics; Time delay neural network; Mathematics; Artificial intelligence","score_opus":0.031826097085271364,"score_gpt":0.24180964027847188,"score_spread":0.2099835431932005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133702739","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.006568972,0.00020186743,0.98932016,0.0012505992,0.00114515,0.0009998726,0.000009179844,0.00040973257,0.000094438066],"genre_scores_gemma":[0.9887136,0.000067113375,0.008687274,0.0011764868,0.00045449764,0.00037830806,0.000010532041,0.000049953087,0.00046222168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759793,0.00007393673,0.00042700357,0.00075710804,0.00033634852,0.0008076515],"domain_scores_gemma":[0.99840325,0.0004395335,0.00018151451,0.0006478915,0.000115690185,0.00021211004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015790075,0.0003657688,0.00029445073,0.000103351165,0.00089422404,0.00034413819,0.00063848234,0.0001240821,0.00004868633],"category_scores_gemma":[0.0000024102353,0.00031450755,0.00019426715,0.0009372933,0.00006940698,0.0005990152,0.000008051124,0.00047785166,0.0000358874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003488516,0.00013664295,0.000007794869,0.0000063375696,0.00002055009,0.000003301696,0.000053207652,0.83618873,0.00004987701,0.00014666854,0.0018678615,0.16148412],"study_design_scores_gemma":[0.0006813939,0.00042657615,0.000022170443,0.0000787339,0.000040672192,0.000033250777,0.0000024465035,0.99737877,0.00012810445,0.00005997413,0.00077484315,0.000373071],"about_ca_topic_score_codex":0.000004256507,"about_ca_topic_score_gemma":0.000009485395,"teacher_disagreement_score":0.98214465,"about_ca_system_score_codex":0.00006189805,"about_ca_system_score_gemma":0.000009760769,"threshold_uncertainty_score":0.9999307},"labels":[],"label_agreement":null},{"id":"W2133884199","doi":"10.1109/72.883433","title":"Asynchronous self-organizing maps","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Asynchronous communication; MIMD; Computer science; Convergence (economics); Computation; Artificial neural network; Function (biology); Set (abstract data type); Algorithm; Theoretical computer science; Topology (electrical circuits); Artificial intelligence; Mathematics; Parallel computing","score_opus":0.008797966435843,"score_gpt":0.21109895450788146,"score_spread":0.20230098807203847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133884199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01655734,0.00010062846,0.9782715,0.0014661981,0.00074375374,0.0002983642,0.000004792546,0.0010574816,0.0014999586],"genre_scores_gemma":[0.99076927,0.00023859156,0.0064934026,0.0015947295,0.00026983366,0.00006449618,0.0000023832574,0.00003182276,0.00053547183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983172,0.00006973268,0.00029693666,0.0005648336,0.00022399204,0.00052734977],"domain_scores_gemma":[0.9988517,0.00012462796,0.000053506352,0.00073323434,0.000037232396,0.00019969586],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008307736,0.00025998623,0.00019738963,0.00007181859,0.00056642474,0.00021490792,0.0007709884,0.00012246912,0.00031100586],"category_scores_gemma":[3.511327e-7,0.0002469362,0.00014999113,0.00084320235,0.00004127069,0.00044035085,0.0000033235294,0.00053386745,0.0002656868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007797606,0.00015138017,0.000003626436,0.0000024543494,0.000019198671,0.00001411784,0.00005734954,0.64646053,0.0000711244,0.0006283133,0.0013258233,0.3512583],"study_design_scores_gemma":[0.0003169884,0.00013412836,0.00007426872,0.000014146545,0.000020938833,0.00009234491,0.0000036806086,0.9910248,0.0009012536,0.00036974493,0.0067014988,0.00034623418],"about_ca_topic_score_codex":0.000014526647,"about_ca_topic_score_gemma":0.000014738529,"teacher_disagreement_score":0.97421193,"about_ca_system_score_codex":0.00005512369,"about_ca_system_score_gemma":0.000019513305,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W2138393638","doi":"10.1109/tnn.2010.2048759","title":"Common Asymptotic Behavior of Solutions and Almost Periodicity for Discontinuous, Delayed, and Impulsive Neural Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Exponential stability; Artificial neural network; Sequence (biology); Applied mathematics; Computer science; Attractor; Mathematics; Cellular neural network; Discrete mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.011920951295278148,"score_gpt":0.23716505332903706,"score_spread":0.22524410203375891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138393638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41561794,0.00012944781,0.58219993,0.00029210138,0.0010376063,0.0006056203,0.000030898183,0.00008245036,0.0000040075042],"genre_scores_gemma":[0.9976238,0.00008105528,0.0017134689,0.00021864584,0.00016060783,0.00013778034,0.0000150784645,0.000027918762,0.000021643724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979255,0.00013731193,0.00052178797,0.00063119887,0.00019602623,0.00058818364],"domain_scores_gemma":[0.99839336,0.0004998693,0.00019398161,0.00053872133,0.00014094624,0.00023310882],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025675606,0.00033377105,0.00042304155,0.0001075781,0.0008252963,0.00022242746,0.0003908143,0.00025608484,0.000010488325],"category_scores_gemma":[0.000008777659,0.00031540156,0.00016416793,0.00039516744,0.00037317525,0.00064862496,0.00002190526,0.0008033233,3.0380176e-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.00020530062,0.00044201984,0.0018654371,0.000039362487,0.000060640352,0.000011382103,0.00045545417,0.7085341,0.0011420611,0.0011003414,0.00011387771,0.28603],"study_design_scores_gemma":[0.0006711376,0.0005421263,0.0044194553,0.000016294862,0.00009930292,0.000113372655,0.000037600737,0.99345994,0.00018614139,0.0001369208,0.000017948674,0.00029973462],"about_ca_topic_score_codex":0.00008099066,"about_ca_topic_score_gemma":0.0016817157,"teacher_disagreement_score":0.58200586,"about_ca_system_score_codex":0.000025075331,"about_ca_system_score_gemma":0.00002087127,"threshold_uncertainty_score":0.9999298},"labels":[],"label_agreement":null},{"id":"W2138727659","doi":"10.1109/tnn.2009.2023120","title":"BAM Learning of Nonlinearly Separable Tasks by Using an Asymmetrical Output Function and Reinforcement Learning","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; University of Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Artificial neural network; Content-addressable memory; Function (biology); Property (philosophy)","score_opus":0.020679957306906246,"score_gpt":0.2564761758607362,"score_spread":0.23579621855382993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138727659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06716838,0.00012913338,0.9317828,0.00022204025,0.00023410696,0.00020209131,0.0000010614758,0.0001736558,0.00008676867],"genre_scores_gemma":[0.9971841,0.00010459138,0.0019588205,0.00031552653,0.00009861836,0.000009892311,0.0000071618924,0.000015272572,0.00030601723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983803,0.00011861694,0.00037819316,0.00046923716,0.00027250306,0.00038113442],"domain_scores_gemma":[0.9991529,0.00012217778,0.00016771925,0.00029745416,0.00007420875,0.00018556669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018169801,0.00022090378,0.00024353518,0.00015493506,0.000524408,0.00015218125,0.00026383903,0.0001311498,0.000008860518],"category_scores_gemma":[0.000003201101,0.00021541557,0.00009433593,0.0008433892,0.00004809962,0.0006266344,0.000004921409,0.0007562051,0.0000020070074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027603695,0.00010462387,0.00002789136,0.0000023447662,0.000010282631,0.0000010524047,0.000027332539,0.8466947,0.0013147375,0.00012520817,0.00007173296,0.15159251],"study_design_scores_gemma":[0.00035372554,0.0010485022,0.00018203109,0.000018297753,0.000030403118,0.000014757484,0.000013123689,0.9968708,0.00071977434,0.00006198017,0.0004778997,0.00020868219],"about_ca_topic_score_codex":0.00004166968,"about_ca_topic_score_gemma":0.000002428478,"teacher_disagreement_score":0.93001574,"about_ca_system_score_codex":0.000035712066,"about_ca_system_score_gemma":0.000014538047,"threshold_uncertainty_score":0.8784392},"labels":[],"label_agreement":null},{"id":"W2140389641","doi":"10.1109/tnn.2004.841784","title":"Optimizing the Kernel in the Empirical Feature Space","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":318,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kernel (algebra); Measure (data warehouse); Kernel embedding of distributions; Feature (linguistics); Kernel method; Computer science; Artificial intelligence; Feature vector; Pattern recognition (psychology); Euclidean space; Variable kernel density estimation; Graph kernel; Mathematics; Tree kernel; Algorithm; Data mining; Support vector machine","score_opus":0.043998601912425904,"score_gpt":0.27858648263350055,"score_spread":0.23458788072107464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140389641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014939579,0.0001441606,0.9288535,0.054754235,0.00058621797,0.0002105901,0.0000011703661,0.00009637752,0.0004141715],"genre_scores_gemma":[0.98954505,0.00007584769,0.0029327264,0.0069459793,0.00017560157,0.000043691743,6.7267644e-7,0.000007724358,0.00027272198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989249,0.0001844872,0.00013165371,0.0002545164,0.00022344019,0.000280981],"domain_scores_gemma":[0.9991991,0.000289817,0.00003636007,0.00040981715,0.000019921423,0.000045006916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002025737,0.00013504455,0.00009440919,0.00005382947,0.00031883607,0.00017704572,0.0006506173,0.00010341906,0.000018978393],"category_scores_gemma":[0.0000019612617,0.000073334064,0.00010109433,0.00048867904,0.000040372746,0.0003399442,0.0000033515148,0.0007996017,0.00003277673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016107082,0.0000773865,0.0000064029878,0.000001062969,0.0000045590664,0.000007569562,0.0012023742,0.9045554,0.00004688437,0.000035914152,0.010243617,0.083802775],"study_design_scores_gemma":[0.00022902596,0.000044720175,0.00019570357,0.0000207891,0.0000065711492,0.000037745143,0.00012643359,0.9937591,0.00048626764,0.000048204478,0.004933865,0.00011156858],"about_ca_topic_score_codex":0.000009520311,"about_ca_topic_score_gemma":0.00009052507,"teacher_disagreement_score":0.97460544,"about_ca_system_score_codex":0.000023763982,"about_ca_system_score_gemma":0.00001050082,"threshold_uncertainty_score":0.3473916},"labels":[],"label_agreement":null},{"id":"W2141070932","doi":"10.1109/tnn.2004.824415","title":"Scalable Closed-Boundary Analog Neural Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto; Sharif University of Technology","keywords":"Computer science; Scalability; Quadratic equation; Artificial neural network; Boundary (topology); Classifier (UML); Activation function; Topology (electrical circuits); Artificial intelligence; Mathematics","score_opus":0.013883666511080792,"score_gpt":0.23672248705283175,"score_spread":0.22283882054175097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141070932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015552728,0.0003955731,0.9762159,0.0032847312,0.002735392,0.00056573225,0.000009203414,0.000837737,0.00040301066],"genre_scores_gemma":[0.9921511,0.00020945368,0.002971462,0.0035053168,0.0006138328,0.00015697182,0.000010750487,0.000060291877,0.00032086743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966182,0.00012313701,0.00062068674,0.0010632141,0.00044785344,0.0011268988],"domain_scores_gemma":[0.9977775,0.0002111897,0.00017662745,0.0012779722,0.00011049896,0.0004461834],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019491903,0.0005414555,0.0004363304,0.00019260848,0.0011722494,0.0005505447,0.001410963,0.00029061333,0.000056058256],"category_scores_gemma":[0.0000020536359,0.00050978333,0.00039505266,0.001784949,0.00021959745,0.00095152506,0.000018739185,0.0013461703,0.00005691559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002733655,0.00019751329,0.0000108344675,0.0000037240445,0.000028680226,0.00003829571,0.000025929518,0.88728267,0.000052449817,0.0015399539,0.00086609967,0.10992652],"study_design_scores_gemma":[0.00083877734,0.00027473862,0.00023450349,0.00003059227,0.000036343194,0.00012701187,0.000006393251,0.9948001,0.00035243828,0.001226888,0.0015238642,0.0005483411],"about_ca_topic_score_codex":0.00009803815,"about_ca_topic_score_gemma":0.00016741102,"teacher_disagreement_score":0.9765983,"about_ca_system_score_codex":0.00013979072,"about_ca_system_score_gemma":0.000054387237,"threshold_uncertainty_score":0.99973536},"labels":[],"label_agreement":null},{"id":"W2141200867","doi":"10.1109/tnn.2007.901277","title":"MPCA: Multilinear Principal Component Analysis of Tensor Objects","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":867,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"University of Florida; University of South Florida; Minnesota Pollution Control Agency","keywords":"Multilinear map; Principal component analysis; Pattern recognition (psychology); Artificial intelligence; Tensor (intrinsic definition); Feature extraction; Computer science; Dimensionality reduction; Projection (relational algebra); Subspace topology; Discriminative model; Feature (linguistics); Curse of dimensionality; Mathematics; Algorithm","score_opus":0.021069219309914494,"score_gpt":0.22297582927317305,"score_spread":0.20190660996325857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141200867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7326411,0.000054197793,0.2664188,0.000017979293,0.00030073393,0.00009167658,0.00003161739,0.00022010051,0.00022376826],"genre_scores_gemma":[0.99915165,0.00023903255,0.00028667744,0.00007372269,0.00004647765,0.00001551886,0.000019413656,0.000024419614,0.00014308021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899936,0.000036605405,0.00034373815,0.0001926401,0.00018841903,0.00023921991],"domain_scores_gemma":[0.9994701,0.00008481744,0.00004329938,0.0002253968,0.00006279392,0.00011354965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000043591077,0.00018449874,0.0003875177,0.00042359193,0.00011655533,0.000009283322,0.00010080588,0.000097735494,0.00025320592],"category_scores_gemma":[0.0000014358707,0.00017620223,0.00047056563,0.001163574,0.00006124312,0.00006789664,6.5176346e-7,0.0002964153,0.000016220132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018293573,0.00009859735,0.00021905571,0.000008246049,0.0008218811,0.00001280258,0.000086185595,0.9937984,0.0006949582,4.87695e-7,0.000049218714,0.004191919],"study_design_scores_gemma":[0.0003017404,0.00003255572,0.004128961,0.00000793319,0.00072474167,0.0000079959,0.000024353329,0.9914703,0.0030772649,3.994165e-7,0.00006052095,0.00016324558],"about_ca_topic_score_codex":0.000029833584,"about_ca_topic_score_gemma":0.00012344358,"teacher_disagreement_score":0.26651055,"about_ca_system_score_codex":0.000030240184,"about_ca_system_score_gemma":0.0000045852444,"threshold_uncertainty_score":0.71853185},"labels":[],"label_agreement":null},{"id":"W2141251259","doi":"10.1109/tnn.2010.2050600","title":"Recognition of Partially Occluded and Rotated Images With a Network of Spiking Neurons","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Institute of Neurological Disorders and Stroke; San Diego State University","keywords":"Computer science; Artificial intelligence; Pattern recognition (psychology); Spiking neural network; Process (computing); Artificial neural network; Support vector machine; Spike-timing-dependent plasticity; Synaptic plasticity; Computer vision","score_opus":0.011994412990190832,"score_gpt":0.2130355582378689,"score_spread":0.20104114524767808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141251259","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6825201,0.0000407059,0.3166181,0.000014241498,0.00045974914,0.000146747,0.000006544029,0.00012989022,0.000063913845],"genre_scores_gemma":[0.99828094,0.000071860224,0.001470898,0.00002830204,0.000094262745,0.000009450721,0.000002872147,0.000032403583,0.000009019399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992159,0.000029690744,0.00026029002,0.00016693055,0.00008952517,0.00023765415],"domain_scores_gemma":[0.9994978,0.0001633902,0.000072527,0.00014842642,0.000050483846,0.000067415924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006624723,0.00016475303,0.00021674181,0.000046230783,0.00009415616,0.000011218228,0.00006782728,0.0000736485,0.000017446971],"category_scores_gemma":[0.0000027476178,0.00015121128,0.00005094047,0.00027694146,0.000088501016,0.00014953439,0.0000012272443,0.0005367301,4.7362423e-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.0001046523,0.000019292454,0.00003422892,0.000031474385,0.000020125466,0.000007933528,0.000024179371,0.8936014,0.053262196,0.0000017493168,0.000011469191,0.052881286],"study_design_scores_gemma":[0.0005804603,0.00032175798,0.0007137409,0.00015598224,0.00007012376,0.00007942506,0.000011362624,0.76392996,0.23383611,0.00005299913,0.000015664269,0.00023241466],"about_ca_topic_score_codex":0.0000026816344,"about_ca_topic_score_gemma":0.000058179994,"teacher_disagreement_score":0.31576085,"about_ca_system_score_codex":0.0000045249058,"about_ca_system_score_gemma":0.0000048272113,"threshold_uncertainty_score":0.6166217},"labels":[],"label_agreement":null},{"id":"W2142100971","doi":"10.1109/72.822508","title":"A new supervised learning algorithm for multilayered and interconnected neural networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Artificial neural network; Backpropagation; Computer science; Algorithm; Time delay neural network; Types of artificial neural networks; Supervised learning; Wake-sleep algorithm; Artificial intelligence; Rprop; Generalization error","score_opus":0.014730562225411959,"score_gpt":0.23788358253301103,"score_spread":0.22315302030759906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142100971","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.008930018,0.00023525217,0.9875699,0.0010556718,0.00075590145,0.0008053641,0.000008774171,0.00060005503,0.000039010763],"genre_scores_gemma":[0.9631263,0.00026038496,0.03351758,0.0010609324,0.00049398263,0.00020656914,0.000011459423,0.00005803996,0.0012647593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759465,0.00012875363,0.00046087144,0.00086973066,0.00019057412,0.00075543096],"domain_scores_gemma":[0.9984239,0.0004890965,0.00008962847,0.0005263949,0.00007218555,0.00039879317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001249094,0.0004226076,0.00037493167,0.00011286774,0.0007214462,0.000371019,0.00064132636,0.0002166592,0.00014030962],"category_scores_gemma":[0.0000023500331,0.00040430835,0.00024388051,0.0007114418,0.00006780901,0.0005669875,0.000008542825,0.0008492557,0.000008056529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030431767,0.000034341258,0.0000022017362,0.0000017954749,0.000014286903,0.0000032932649,0.000044916902,0.47137338,0.000027628672,0.000022458593,0.000372766,0.5280725],"study_design_scores_gemma":[0.0012893507,0.0003619257,0.00005718375,0.000024852292,0.00003635374,0.000062415325,0.000011810873,0.9960353,0.00014218314,0.000060088238,0.0014967702,0.00042181154],"about_ca_topic_score_codex":0.00006942314,"about_ca_topic_score_gemma":0.000051889543,"teacher_disagreement_score":0.9541963,"about_ca_system_score_codex":0.0000336905,"about_ca_system_score_gemma":0.000018284205,"threshold_uncertainty_score":0.99984086},"labels":[],"label_agreement":null},{"id":"W2143155105","doi":"10.1109/72.950143","title":"Vector quantization of images using modified adaptive resonance algorithm for hierarchical clustering","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Ottawa","funders":"","keywords":"Vector quantization; Cluster analysis; Linde–Buzo–Gray algorithm; Adaptive resonance theory; Computer science; Image compression; Algorithm; Data compression; Learning vector quantization; Quantization (signal processing); Artificial intelligence; Computation; Pattern recognition (psychology); Image processing; Artificial neural network; Image (mathematics)","score_opus":0.04287775990973145,"score_gpt":0.298381628216452,"score_spread":0.2555038683067205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143155105","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.0005604948,0.00010163746,0.9980141,0.00008965242,0.0005066741,0.00040135058,0.000038178878,0.0002735714,0.0000143742645],"genre_scores_gemma":[0.55529773,0.00007598812,0.4444092,0.000075647586,0.000055038392,0.00004217137,0.0000025213747,0.000016547254,0.000025146088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.00008363537,0.00032432188,0.00041504766,0.00019799112,0.00029238823],"domain_scores_gemma":[0.9989744,0.00025919982,0.00013412676,0.00044937927,0.00011032604,0.00007260806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010710889,0.00017715683,0.0002232416,0.00013499167,0.00021237912,0.0000431096,0.00047632217,0.000096743635,0.000003943402],"category_scores_gemma":[0.000004547853,0.00017295385,0.00010484675,0.00045018466,0.00007325789,0.0006445735,0.0000102212225,0.00026545758,3.7496753e-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.0000689361,0.000055569744,6.9252445e-7,0.0000036950623,0.0000059752333,0.0000037055868,0.000021621647,0.56274295,0.0018212604,0.00018992808,0.00004402663,0.43504164],"study_design_scores_gemma":[0.0003208787,0.00019688702,0.000023473696,0.00007013874,0.000008567946,0.000021584481,0.0000034860418,0.9815799,0.017049592,0.00048943696,0.000069856695,0.00016619758],"about_ca_topic_score_codex":0.000018008754,"about_ca_topic_score_gemma":0.000006157536,"teacher_disagreement_score":0.55473727,"about_ca_system_score_codex":0.000037856724,"about_ca_system_score_gemma":0.00001772831,"threshold_uncertainty_score":0.7052853},"labels":[],"label_agreement":null},{"id":"W2143304877","doi":"10.1109/tnn.2002.806629","title":"Face recognition using kernel direct discriminant analysis algorithms","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":608,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Kernel Fisher discriminant analysis; Linear discriminant analysis; Kernel principal component analysis; Pattern recognition (psychology); Facial recognition system; Kernel (algebra); Artificial intelligence; Computer science; Principal component analysis; Face (sociological concept); Discriminant; Kernel method; Feature extraction; Word error rate; Algorithm; Mathematics; Support vector machine","score_opus":0.04051875161713008,"score_gpt":0.26509096159119266,"score_spread":0.22457220997406258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143304877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029665513,0.000062622756,0.96816933,0.000094204115,0.0012411365,0.0001755972,0.000014286033,0.00020456807,0.00037276748],"genre_scores_gemma":[0.98797786,0.000097113014,0.011388918,0.00027959014,0.000042997057,0.000031710762,0.00000866086,0.000017081346,0.00015609268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982308,0.00023194894,0.00030207643,0.0005558167,0.0002718743,0.00040744976],"domain_scores_gemma":[0.9991132,0.00012519684,0.00010315339,0.0004300143,0.000074598574,0.00015383831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018418701,0.00023905844,0.0002724331,0.0002994937,0.00040191834,0.00016973382,0.00026439462,0.00013563437,0.000088502595],"category_scores_gemma":[0.000004672373,0.0002126087,0.00031277057,0.0014436812,0.000038625156,0.00060742075,0.0000024184253,0.00033361322,0.000035986603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014071308,0.00014654025,0.000011951152,0.000004088762,0.000121972305,0.000014595988,0.00014225284,0.851926,0.0004516279,0.000005676131,0.000086890286,0.14707433],"study_design_scores_gemma":[0.0002599147,0.00007070063,0.00007039015,0.000028783912,0.00020418731,0.000020748499,0.00006138888,0.9888713,0.009930297,0.00010173927,0.000088135355,0.00029243715],"about_ca_topic_score_codex":0.00006694073,"about_ca_topic_score_gemma":0.000036281468,"teacher_disagreement_score":0.95831233,"about_ca_system_score_codex":0.000053948133,"about_ca_system_score_gemma":0.000017947643,"threshold_uncertainty_score":0.8669931},"labels":[],"label_agreement":null},{"id":"W2143885292","doi":"10.1109/tnn.2009.2031144","title":"Uncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":109,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"Information Technology Research Centre; Universidade Federal do Rio de Janeiro; National Technical University of Athens; Concordia University; Royal Bank of Canada","keywords":"Multilinear map; Principal component analysis; Pattern recognition (psychology); Subspace topology; Linear subspace; Artificial intelligence; Projection (relational algebra); Tensor (intrinsic definition); Mathematics; Rank (graph theory); Computer science; Algorithm; Combinatorics","score_opus":0.016316583583636097,"score_gpt":0.2362605338137632,"score_spread":0.21994395023012708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143885292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30475,0.000058685622,0.69390345,0.000085977736,0.0003077836,0.00024036499,0.00001721341,0.000584983,0.000051529292],"genre_scores_gemma":[0.9979562,0.00012156604,0.0011597788,0.0001374167,0.000100817364,0.00003629562,0.00009641565,0.00004250482,0.0003490077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985414,0.000067583016,0.000410806,0.00034952612,0.00018866558,0.00044201544],"domain_scores_gemma":[0.9992508,0.00016632063,0.000051092888,0.00023513807,0.0001009929,0.00019563828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000120272154,0.00031683745,0.00043359777,0.00038040534,0.00026729115,0.00006571688,0.00013802829,0.00019361184,0.0001510616],"category_scores_gemma":[0.000005149335,0.0003168149,0.00064837805,0.0011554131,0.000028191522,0.00011755078,6.242484e-7,0.000657514,0.000022498765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007251207,0.00011400472,0.00010169754,0.000008534687,0.00048741137,0.000004732314,0.00008419538,0.96900064,0.00081175665,8.711831e-7,0.00002534298,0.029288277],"study_design_scores_gemma":[0.001003597,0.00011927594,0.0009538971,0.000014042327,0.0007905127,0.0000026515645,0.00005603469,0.9948719,0.0015219706,0.0000017933975,0.00034587862,0.00031841034],"about_ca_topic_score_codex":0.000017635117,"about_ca_topic_score_gemma":0.00009737068,"teacher_disagreement_score":0.6932062,"about_ca_system_score_codex":0.00006305016,"about_ca_system_score_gemma":0.0000054578572,"threshold_uncertainty_score":0.9999284},"labels":[],"label_agreement":null},{"id":"W2144245426","doi":"10.1109/tnn.2010.2091428","title":"Count Data Modeling and Classification Using Finite Mixtures of Distributions","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multinomial distribution; Dirichlet distribution; Mixture model; Cluster analysis; Computer science; Pattern recognition (psychology); Artificial intelligence; Data modeling; Expectation–maximization algorithm; Data mining; Mathematics; Statistics; Maximum likelihood","score_opus":0.06841040994015102,"score_gpt":0.30705565796956996,"score_spread":0.23864524802941894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144245426","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.011642717,0.00008017186,0.9868882,0.00030283572,0.00082282437,0.00011952088,0.00005894568,0.000059342223,0.00002544704],"genre_scores_gemma":[0.8444837,0.000059204744,0.15528621,0.000083718885,0.000059498783,0.000004302088,0.000008705058,0.000007716335,0.000006964681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989723,0.000074322976,0.00024140801,0.00038332093,0.00013849714,0.00019017866],"domain_scores_gemma":[0.99874353,0.00015880314,0.000076847165,0.0008623133,0.00007226752,0.00008626264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730863,0.00012942772,0.00014906196,0.000069354144,0.00022596426,0.00008242708,0.0005216588,0.00012464872,0.0000041374906],"category_scores_gemma":[0.0000066365014,0.00011734465,0.000043739466,0.00023094437,0.00006949506,0.00045811033,0.000009456883,0.0004742753,4.1503014e-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.000021991396,0.00012524505,0.0000066706802,0.000014653169,0.000029083665,0.0000026020439,0.00009527194,0.70179915,0.02019012,0.010526487,0.000054329874,0.2671344],"study_design_scores_gemma":[0.00012566887,0.000022068842,0.000018091294,0.0000132274945,0.000026597749,0.00001760356,0.0000014595747,0.99735975,0.00081585394,0.0014460402,0.000039024082,0.00011459537],"about_ca_topic_score_codex":0.000026275846,"about_ca_topic_score_gemma":0.000031474443,"teacher_disagreement_score":0.832841,"about_ca_system_score_codex":0.0000094662155,"about_ca_system_score_gemma":0.000027308626,"threshold_uncertainty_score":0.4785176},"labels":[],"label_agreement":null},{"id":"W2144884673","doi":"10.1109/72.925566","title":"Eigenpaxels and a neural-network approach to image classification","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Centre For Cold Ocean Resources Engineering","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Computer science; Artificial neural network; Principal component analysis; Encoding (memory); Image (mathematics); Contextual image classification; Set (abstract data type); Image processing; Similarity (geometry); Face (sociological concept); Computer vision","score_opus":0.025535360179846357,"score_gpt":0.23256526395032026,"score_spread":0.2070299037704739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144884673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060196735,0.0001252178,0.93448734,0.00040408722,0.0009878787,0.0005216665,0.0000047806307,0.00072628487,0.002546024],"genre_scores_gemma":[0.99217683,0.00024947192,0.0065266127,0.00027885256,0.0003383845,0.000053190968,0.000011140261,0.000094097166,0.00027140783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983905,0.00007678799,0.00035780694,0.00046013668,0.0001989675,0.00051582034],"domain_scores_gemma":[0.99905527,0.000105597515,0.00004585112,0.0004936946,0.00006290212,0.00023669214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014101119,0.00031644225,0.00024719012,0.00015239973,0.00024602292,0.00016128391,0.00016260015,0.0001779774,0.0000150949245],"category_scores_gemma":[0.000004550248,0.00033134056,0.0000916147,0.0007478882,0.00007774371,0.0003031225,0.0000017308587,0.0005234198,0.00003057481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036503377,0.000042565738,0.000014671544,0.00001268504,0.000021459948,0.000004823385,0.00006664704,0.8979101,0.004906626,0.000014088116,0.0015042478,0.09546559],"study_design_scores_gemma":[0.0002368126,0.00005144794,0.0020677021,0.000020306112,0.000038383136,0.00008956572,0.00002911747,0.99591994,0.0004688197,0.000025870428,0.00073271245,0.00031933782],"about_ca_topic_score_codex":0.0000067856236,"about_ca_topic_score_gemma":0.000012212996,"teacher_disagreement_score":0.93198013,"about_ca_system_score_codex":0.00009591288,"about_ca_system_score_gemma":0.000005792946,"threshold_uncertainty_score":0.9999139},"labels":[],"label_agreement":null},{"id":"W2145295358","doi":"10.1109/72.991425","title":"Classification of underground pipe scanned images using feature extraction and neuro-fuzzy algorithm","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Backpropagation; Computer science; Pipeline (software); Artificial intelligence; Feature extraction; Fuzzy logic; Preprocessor; Artificial neural network; Feature (linguistics); Pattern recognition (psychology); Neuro-fuzzy; Fuzzy set; Membership function; Fuzzy control system; Data mining","score_opus":0.016173012081470765,"score_gpt":0.22946898364158666,"score_spread":0.2132959715601159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145295358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12566805,0.00036220174,0.87119234,0.000079819416,0.0021669017,0.00014827271,0.00001003071,0.0001687291,0.00020366476],"genre_scores_gemma":[0.9958781,0.00041196388,0.0032914486,0.000030757317,0.00025534883,0.000008113169,0.0000018948499,0.000039495175,0.00008286502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922186,0.000023314784,0.00018963974,0.00019504105,0.00012313464,0.00024701373],"domain_scores_gemma":[0.9996013,0.00007036533,0.00005299684,0.00016997154,0.00004234446,0.00006304153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003805923,0.00018884601,0.00016403485,0.00012034159,0.00015017483,0.000044684726,0.000065860884,0.00014787128,0.00001470924],"category_scores_gemma":[0.0000016225016,0.00018936419,0.00006806204,0.00023457615,0.00005515192,0.00030377778,7.3962843e-7,0.00045945053,9.286553e-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.000014984165,0.000021009206,0.000021854998,0.000024103265,0.000031195366,0.0000057101,0.00004656046,0.76411974,0.04146815,0.0000061298338,0.0003312304,0.19390932],"study_design_scores_gemma":[0.00023963083,0.00005656478,0.0012125426,0.000040467923,0.000052002615,0.00007132105,0.00006548648,0.98737377,0.010592885,0.00003433371,0.00008861246,0.00017240518],"about_ca_topic_score_codex":0.000015966898,"about_ca_topic_score_gemma":0.000009048106,"teacher_disagreement_score":0.87021005,"about_ca_system_score_codex":0.00006180827,"about_ca_system_score_gemma":0.0000024150288,"threshold_uncertainty_score":0.77220476},"labels":[],"label_agreement":null},{"id":"W2145722250","doi":"10.1109/tnn.2005.857949","title":"Exponential Stability of Impulsive High-Order Hopfield-Type Neural Networks With Time-Varying Delays","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":128,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Exponential stability; Convergence (economics); Artificial neural network; Hopfield network; Stability (learning theory); Exponential function; Control theory (sociology); Applied mathematics; Lyapunov function; Computer science; Rate of convergence; Exponential growth; Mathematics; Mathematical optimization; Artificial intelligence; Mathematical analysis; Nonlinear system; Physics; Machine learning","score_opus":0.01115897018912642,"score_gpt":0.21530398134877907,"score_spread":0.20414501115965264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145722250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1576873,0.00019015837,0.8394219,0.0006210779,0.0012295767,0.0005175248,0.0000065467125,0.00027314445,0.00005275274],"genre_scores_gemma":[0.99239534,0.00009192682,0.006380028,0.00057553843,0.00041712174,0.00003216131,0.00001631265,0.00004444692,0.00004714962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966621,0.0003603487,0.00074708357,0.0009164405,0.0005161198,0.00079790567],"domain_scores_gemma":[0.9975725,0.00046734733,0.00028472353,0.0010382643,0.00039601378,0.00024115723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002782981,0.0004857778,0.0005434078,0.00014790059,0.0004736907,0.000156555,0.00080361916,0.00029636544,0.00024001568],"category_scores_gemma":[0.000008125898,0.00042815114,0.00020516307,0.0015435853,0.00022046393,0.0012059858,0.000020275911,0.0009625612,0.0000106335565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000302115,0.0002590974,0.000058972157,0.000012417685,0.000051803574,0.000010460193,0.00013595007,0.9142214,0.00033600366,0.00005209055,0.00009014657,0.08446952],"study_design_scores_gemma":[0.00087061315,0.00076009455,0.00010301584,0.000032155294,0.000058775997,0.000041557563,0.000010343972,0.99425304,0.0033700615,0.000031890722,0.000033776454,0.00043466807],"about_ca_topic_score_codex":0.00008666239,"about_ca_topic_score_gemma":0.00021877515,"teacher_disagreement_score":0.83470803,"about_ca_system_score_codex":0.00011404254,"about_ca_system_score_gemma":0.000059391332,"threshold_uncertainty_score":0.999817},"labels":[],"label_agreement":null},{"id":"W2147030611","doi":"10.1109/tnn.2004.828755","title":"Learning Mixture Models With the Regularized Latent Maximum Entropy Principle","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Principle of maximum entropy; Computer science; Entropy (arrow of time); Mixture model; Artificial intelligence; Statistical physics; Mathematics; Physics; Thermodynamics","score_opus":0.013973562342100943,"score_gpt":0.23080299245883956,"score_spread":0.2168294301167386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147030611","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.0039725197,0.00008035199,0.9904511,0.0042003873,0.0004983089,0.00036578442,0.0000011293719,0.00028650387,0.00014390831],"genre_scores_gemma":[0.85335845,0.000051085182,0.1450062,0.0009021601,0.00008795919,0.00005113906,9.4524614e-7,0.000027582017,0.0005144729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982495,0.00022048384,0.00020805055,0.0005068102,0.00032836923,0.000486809],"domain_scores_gemma":[0.9989633,0.000090889385,0.00009528597,0.00064082374,0.000066713525,0.0001430025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025653467,0.0002764841,0.00023078482,0.00006741354,0.0005655685,0.00019702653,0.00065229484,0.00014597023,0.0000080577765],"category_scores_gemma":[0.0000010485012,0.00016919595,0.00016344246,0.0004856174,0.00008134442,0.00040885515,0.0000064421656,0.001038597,0.000004874359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006811162,0.000060213682,6.5900053e-7,0.0000030768028,0.000033590273,0.000024912564,0.00028400245,0.945117,0.00023834313,0.011438393,0.00002375344,0.04270794],"study_design_scores_gemma":[0.00092456123,0.00031172181,0.0000125305405,0.000030067293,0.00003460162,0.00009177977,0.000006180913,0.98602444,0.0012446116,0.010802665,0.00026787943,0.00024894188],"about_ca_topic_score_codex":0.000017860792,"about_ca_topic_score_gemma":0.000024898309,"teacher_disagreement_score":0.8493859,"about_ca_system_score_codex":0.00006160658,"about_ca_system_score_gemma":0.000042022075,"threshold_uncertainty_score":0.6899611},"labels":[],"label_agreement":null},{"id":"W2148332992","doi":"10.1109/tnn.2009.2029858","title":"Real-Time Robot Path Planning Based on a Modified Pulse-Coupled Neural Network Model","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":155,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Mobile robot; Robot; Artificial neural network; Path (computing); Motion planning; Shortest path problem; Event (particle physics); Topology (electrical circuits); Artificial intelligence; Graph; Engineering; Theoretical computer science; Physics; Computer network","score_opus":0.025007147238864467,"score_gpt":0.2536678519390162,"score_spread":0.22866070470015173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148332992","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.0071830377,0.00003063345,0.9879872,0.0009993955,0.0014326568,0.0004983093,0.000006691454,0.0012390766,0.0006229989],"genre_scores_gemma":[0.92556906,0.000009957764,0.07140836,0.0023000108,0.0003400193,0.00005057987,0.000013137607,0.000054357748,0.0002545025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959434,0.00024775552,0.0006404527,0.0011327962,0.0007247485,0.0013107907],"domain_scores_gemma":[0.9975256,0.00047266815,0.00022095651,0.0012768164,0.00008797539,0.00041599805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004029823,0.0006532076,0.00059806625,0.00026189693,0.00070599583,0.000377045,0.0012149998,0.00032659573,0.000014731421],"category_scores_gemma":[0.0000072066778,0.00063214847,0.0003280252,0.0010766704,0.000063369785,0.0006469357,0.0000060442076,0.001217319,0.000032369167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001786162,0.00020604087,0.0000038132853,0.0000033599506,0.000018840725,0.00015041932,0.00008893709,0.97738576,0.00028194647,0.00005039714,0.000600797,0.021031091],"study_design_scores_gemma":[0.0010405328,0.0007731057,0.00035856408,0.00012558448,0.00003782305,0.000037341848,0.000002646059,0.99674195,0.00006593735,0.00019420394,0.0000020849,0.0006202549],"about_ca_topic_score_codex":0.00003051446,"about_ca_topic_score_gemma":9.105311e-7,"teacher_disagreement_score":0.91838604,"about_ca_system_score_codex":0.00013738555,"about_ca_system_score_gemma":0.000077055105,"threshold_uncertainty_score":0.999613},"labels":[],"label_agreement":null},{"id":"W2148666284","doi":"10.1109/tnn.2004.837785","title":"Heterogeneous Fuzzy Logic Networks: Fundamentals and Development Studies","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interpretability; Computer science; Fuzzy logic; Artificial intelligence; Neuro-fuzzy; Transparency (behavior); Artificial neural network; Machine learning; Fuzzy control system","score_opus":0.03637206130340315,"score_gpt":0.25499311335560293,"score_spread":0.21862105205219978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148666284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014663755,0.0041194274,0.9778689,0.0005778202,0.0019408102,0.0003618871,0.0000010690908,0.00029438056,0.00017194507],"genre_scores_gemma":[0.9952492,0.0004558384,0.0024675955,0.0014918966,0.0001310535,0.000105360596,7.8026915e-7,0.000015209774,0.000083055835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982555,0.000084668194,0.0003812915,0.0005434852,0.00023438373,0.00050068414],"domain_scores_gemma":[0.9992299,0.0001109372,0.00009304169,0.000351226,0.000050932496,0.0001639415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000167267,0.00029924556,0.0003404529,0.00008080538,0.00050862844,0.00016149276,0.00038176926,0.000117082855,0.0000025820582],"category_scores_gemma":[0.0000014507151,0.00024369864,0.00009251955,0.0002567308,0.00010141334,0.0002512416,0.000010491376,0.0002816345,0.00001718924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021820075,0.00007370534,0.000007661291,0.000007823432,0.00009778932,0.00005125385,0.00023491278,0.90815187,0.00001553645,0.00047358373,0.00003045535,0.090833575],"study_design_scores_gemma":[0.006780432,0.002187128,0.00044556372,0.00036591684,0.00012346703,0.0013299123,0.00053846964,0.9734604,0.001479406,0.009325334,0.0014959879,0.0024680072],"about_ca_topic_score_codex":0.000013110223,"about_ca_topic_score_gemma":0.00005571647,"teacher_disagreement_score":0.98058546,"about_ca_system_score_codex":0.00013655968,"about_ca_system_score_gemma":0.000027291244,"threshold_uncertainty_score":0.99377424},"labels":[],"label_agreement":null},{"id":"W2148959261","doi":"10.1109/72.896810","title":"On the use of separable Volterra networks to model discrete-time Volterra systems","year":2001,"lang":"en","type":"letter","venue":"IEEE Transactions on Neural Networks","topic":"Control Systems and Identification","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Volterra series; Volterra integral equation; Volterra equations; Separable space; Cascade; Nonlinear system; Computer science; Applied mathematics; Polynomial; Mathematical optimization; Mathematics; Control theory (sociology); Integral equation; Mathematical analysis; Artificial intelligence; Physics; Control (management)","score_opus":0.030893220381689446,"score_gpt":0.21273055532292304,"score_spread":0.18183733494123358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148959261","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.00083660026,0.00024042062,0.98089,0.010683689,0.0050157723,0.0015963955,0.00016818095,0.00037681728,0.00019216235],"genre_scores_gemma":[0.95837766,0.00019341437,0.0000288001,0.023602825,0.0027923486,0.0006911676,0.00011695735,0.00031969382,0.013877105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970625,0.00019409772,0.0009076855,0.00058631797,0.00049961306,0.0007498013],"domain_scores_gemma":[0.9977924,0.00051540957,0.00019757882,0.0012508724,0.00011262404,0.00013107689],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018864265,0.0006838482,0.00079950853,0.00028478654,0.00024434994,0.0003355166,0.00051829015,0.00085519865,0.00009852747],"category_scores_gemma":[0.0000047096664,0.0005445102,0.00045397953,0.00049680215,0.000051321364,0.0002535128,0.0000031944433,0.0019045334,0.00007115624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003046144,0.000013609651,1.2536495e-7,0.000036455036,0.00010889987,0.000008261473,0.000022805838,0.5792689,0.000058841368,0.0000036454046,0.41973883,0.0007092073],"study_design_scores_gemma":[0.00019224231,0.00008860368,0.0000017321803,0.0003848378,0.00015121473,0.000015521679,0.0000034045042,0.9623705,0.000014454579,0.000004342119,0.036284223,0.0004889343],"about_ca_topic_score_codex":0.00024836458,"about_ca_topic_score_gemma":0.000053580097,"teacher_disagreement_score":0.9808612,"about_ca_system_score_codex":0.00019587165,"about_ca_system_score_gemma":0.000013957372,"threshold_uncertainty_score":0.99970067},"labels":[],"label_agreement":null},{"id":"W2149372910","doi":"10.1109/tnn.2010.2071398","title":"New Approach for the Identification and Validation of a Nonlinear F/A-18 Model by Use of Neural Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Model Reduction and Neural Networks","field":"Physics and Astronomy","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Bombardier (Canada); Université du Québec à Montréal","funders":"National Aeronautics and Space Administration","keywords":"Artificial neural network; Flutter; Fast Fourier transform; Computer science; Transonic; Perceptron; Supersonic speed; Flight test; Identification (biology); Aerodynamics; Mach number; Nonlinear system; Data reduction; Reduction (mathematics); Ranging; Artificial intelligence; Algorithm; Simulation; Engineering; Mathematics; Data mining; Aerospace engineering","score_opus":0.03737278943260773,"score_gpt":0.26724766363409025,"score_spread":0.2298748742014825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149372910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06284954,0.000033616136,0.93552244,0.00016000762,0.0006697494,0.0006365688,0.00007682603,0.000027638534,0.000023601851],"genre_scores_gemma":[0.9949915,0.000035590274,0.0037041309,0.000054581236,0.0003411129,0.000079635734,0.000077512195,0.00003480748,0.0006811628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867064,0.000050623894,0.00051551167,0.0003460711,0.00016517728,0.0002519676],"domain_scores_gemma":[0.99882,0.00027493466,0.0002916652,0.0003886874,0.00011243953,0.000112248024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016183933,0.00022212048,0.00025338243,0.00006001239,0.00023019387,0.00007480298,0.00018477527,0.00013089007,0.00006968092],"category_scores_gemma":[0.0000023031885,0.00017734217,0.00020460735,0.00024019099,0.000121487334,0.0003057475,0.0000033402268,0.00055004744,2.6074645e-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.00013909326,0.00011380767,0.000037632984,0.0000071524055,0.000048742226,1.990502e-8,0.00003261259,0.92787576,0.0029379951,0.00013350636,0.0021013315,0.066572346],"study_design_scores_gemma":[0.00048254002,0.000048794427,0.000016376387,0.000005684241,0.0001245748,0.0000019058689,0.0000227993,0.99107605,0.007905518,0.00007012788,0.00009699623,0.00014862047],"about_ca_topic_score_codex":0.000094222654,"about_ca_topic_score_gemma":0.000005463399,"teacher_disagreement_score":0.93214196,"about_ca_system_score_codex":0.0000056779336,"about_ca_system_score_gemma":0.00001732614,"threshold_uncertainty_score":0.72318035},"labels":[],"label_agreement":null},{"id":"W2149375037","doi":"10.1109/tnn.2005.845142","title":"Decision Feedback Recurrent Neural Equalization With Fast Convergence Rate","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Recurrent neural network; Extended Kalman filter; Convergence (economics); Kalman filter; Control theory (sociology); Artificial neural network; Rate of convergence; Nonlinear system; Equalization (audio); Algorithm; Artificial intelligence; Channel (broadcasting); Decoding methods; Control (management)","score_opus":0.016166194613349737,"score_gpt":0.24887757157500331,"score_spread":0.2327113769616536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149375037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033517677,0.000089021625,0.96200645,0.0022139715,0.0012987308,0.000429872,0.0000065171876,0.00035946086,0.00007827486],"genre_scores_gemma":[0.99225473,0.0002010117,0.00556404,0.0013249937,0.00027925952,0.00009929496,0.0000064169017,0.0000319599,0.00023827208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977982,0.00012632685,0.00044159885,0.0007343877,0.00035516187,0.00054431707],"domain_scores_gemma":[0.99846506,0.00026453167,0.00016038226,0.0007360595,0.00012794019,0.00024600138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015636132,0.0003441853,0.0002457483,0.00012061822,0.00047872742,0.00024900082,0.0007510342,0.00011549949,0.00007566379],"category_scores_gemma":[0.0000019260858,0.00028157112,0.00013161555,0.0011304343,0.00008612578,0.00086494605,0.00000869658,0.0005176212,0.000076246026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050917155,0.00009722518,0.0000089143305,0.0000021424994,0.000008627665,0.0000037776608,0.00004793878,0.68607724,0.0001049561,0.00037767703,0.0005919819,0.3126286],"study_design_scores_gemma":[0.0005374619,0.00025287617,0.00024044592,0.000042020853,0.000019220572,0.000039244864,0.000008667774,0.9957862,0.0011858472,0.000074354866,0.0014659081,0.00034778094],"about_ca_topic_score_codex":0.0000088308625,"about_ca_topic_score_gemma":0.00011093505,"teacher_disagreement_score":0.9587371,"about_ca_system_score_codex":0.00006689792,"about_ca_system_score_gemma":0.000023764524,"threshold_uncertainty_score":0.99996364},"labels":[],"label_agreement":null},{"id":"W2149807144","doi":"10.1109/tnn.2006.885436","title":"Face Recognition Using an Enhanced Independent Component Analysis Approach","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Independent component analysis; Linear discriminant analysis; Pattern recognition (psychology); Eigenface; Facial recognition system; Computer science; Artificial intelligence; Subspace topology; Principal component analysis; Support vector machine; Face (sociological concept); Component analysis; Dimension (graph theory); Unsupervised learning; Speech recognition; Mathematics","score_opus":0.047209158689677976,"score_gpt":0.2904797751869109,"score_spread":0.24327061649723294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149807144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12562703,0.0000102076365,0.87309396,0.00004231486,0.00027591828,0.0002656751,0.0000030714195,0.0004820823,0.00019972611],"genre_scores_gemma":[0.9430202,0.000010117471,0.056413826,0.00043801154,0.000049290044,0.000017291679,0.000014720968,0.00001510614,0.000021438558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981619,0.00020206544,0.00037892567,0.00053624157,0.00036734287,0.00035353936],"domain_scores_gemma":[0.9989732,0.00008733868,0.00013907136,0.0005357178,0.000097591554,0.00016709966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059301115,0.00020855576,0.00023553862,0.0004900159,0.00027460454,0.00018475104,0.0004407359,0.00017331257,0.000015376354],"category_scores_gemma":[0.0000010659437,0.00021316434,0.00019781443,0.0015046658,0.00003866231,0.0007439469,0.0000038062115,0.0005069802,0.000004696538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026280784,0.00028649735,0.00000351177,0.0000017485555,0.00007221226,0.0000030158408,0.00038290131,0.9310618,0.0013946526,0.000030696694,0.000003312173,0.06673338],"study_design_scores_gemma":[0.00019283974,0.000112522284,0.00022489407,0.000004955491,0.00008804906,0.000012225534,0.0000591987,0.9706004,0.028396264,0.00006664543,0.0000060334514,0.00023592166],"about_ca_topic_score_codex":0.00006157256,"about_ca_topic_score_gemma":0.00011029795,"teacher_disagreement_score":0.8173932,"about_ca_system_score_codex":0.000095379626,"about_ca_system_score_gemma":0.000015496486,"threshold_uncertainty_score":0.869259},"labels":[],"label_agreement":null},{"id":"W2150035213","doi":"10.1109/72.991413","title":"Optimization-based learning with bounded error for feedforward neural networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Backpropagation; Artificial neural network; Robustness (evolution); Feedforward neural network; Feed forward; Rprop; Convergence (economics); Bounded function; Artificial intelligence; Algorithm; Time delay neural network; Types of artificial neural networks; Mathematics; Engineering","score_opus":0.021503306138241456,"score_gpt":0.23170742515867057,"score_spread":0.21020411902042913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150035213","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.0009834364,0.00011879444,0.993652,0.002592446,0.0008258133,0.000970213,0.0000063479597,0.00071993243,0.00013100437],"genre_scores_gemma":[0.9704875,0.000043952186,0.026212739,0.0017518449,0.0003098686,0.0005255694,0.000016110766,0.00007570863,0.0005767073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973701,0.00011263583,0.00046024442,0.0008616049,0.00033341686,0.0008619498],"domain_scores_gemma":[0.9981323,0.00047898706,0.00021492774,0.0007132787,0.00016898791,0.0002915277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013634285,0.00046450592,0.00037062608,0.00016005816,0.0012719032,0.0004609587,0.0007973245,0.00020434774,0.000091895825],"category_scores_gemma":[0.0000035832486,0.00040668665,0.00028018604,0.0011971435,0.00012986182,0.00055603083,0.000005632036,0.00085303886,0.000007754143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006497209,0.00014748935,0.00001935282,0.000006614123,0.000030456828,0.000006077547,0.000025740994,0.967257,0.000004047789,0.00017133343,0.0007496957,0.031517208],"study_design_scores_gemma":[0.0011305176,0.0005844863,0.000014352088,0.000027306678,0.000053698754,0.000026731579,0.0000066380976,0.9966173,0.00005452249,0.000022794206,0.00097267394,0.00048895786],"about_ca_topic_score_codex":0.000011088186,"about_ca_topic_score_gemma":0.000034019125,"teacher_disagreement_score":0.96950406,"about_ca_system_score_codex":0.00006819369,"about_ca_system_score_gemma":0.000017486254,"threshold_uncertainty_score":0.9998385},"labels":[],"label_agreement":null},{"id":"W2150388527","doi":"10.1109/tnn.2009.2016339","title":"A Hybrid Pareto Mixture for Conditional Asymmetric Fat-Tailed Distributions","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Pareto principle; Computer science; Lomax distribution; Mathematics; Mathematical optimization","score_opus":0.015510991328141828,"score_gpt":0.2623983043234745,"score_spread":0.24688731299533268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150388527","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.0003484356,0.00013490376,0.9947357,0.0026563169,0.00097647036,0.00050306413,0.00019365441,0.00027951162,0.00017193635],"genre_scores_gemma":[0.91055435,0.000026688833,0.08707193,0.001735173,0.00025845095,0.00010697196,0.00005740837,0.000013386762,0.00017561355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824995,0.00012113243,0.00031738463,0.00055365753,0.00023970468,0.0005181594],"domain_scores_gemma":[0.99874127,0.00032893062,0.000091854716,0.00048631034,0.00013152727,0.00022010999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018189011,0.00027295435,0.00027493085,0.00018727225,0.00051722175,0.00016712578,0.0005310393,0.00014189586,0.000017086551],"category_scores_gemma":[0.000010004418,0.0002487049,0.00032947515,0.000701313,0.00004741219,0.00038342437,0.0000020465789,0.0004725703,0.000006662457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010542653,0.00050673756,0.0000031198729,0.000010112047,0.000072985735,0.000032798096,0.000045487926,0.09621127,0.00023989857,0.06194527,0.017832978,0.82299393],"study_design_scores_gemma":[0.00079973694,0.00045059307,0.00017469074,0.000015216311,0.000048696296,0.00007665025,0.0000012797199,0.9480962,0.00235801,0.04580636,0.0017968183,0.00037572123],"about_ca_topic_score_codex":0.000002133906,"about_ca_topic_score_gemma":0.0000035460719,"teacher_disagreement_score":0.91020596,"about_ca_system_score_codex":0.00006751851,"about_ca_system_score_gemma":0.000030524552,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W2150616088","doi":"10.1109/tnn.2011.2165556","title":"Delay-Independent Stability of Genetic Regulatory Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Gene regulatory network; Stability (learning theory); Computer science; Genetic network; Control theory (sociology); Gene; Mathematical optimization; Mathematics; Genetics; Biology; Artificial intelligence; Gene expression; Machine learning","score_opus":0.016732998477795955,"score_gpt":0.21638660459837544,"score_spread":0.19965360612057947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150616088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5631802,0.00058961037,0.43538323,0.0000072229473,0.00046846832,0.00020188579,0.000006450073,0.000028535473,0.00013436716],"genre_scores_gemma":[0.9984946,0.00026334287,0.00064840936,0.0001232039,0.00023298108,0.000042328964,0.000013434483,0.000059815386,0.000121876525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977394,0.00022454001,0.0005961101,0.0006621008,0.00027265798,0.0005052112],"domain_scores_gemma":[0.9983304,0.000026094933,0.00021184993,0.0010711726,0.00014360563,0.00021683608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024486016,0.00034901258,0.00036151308,0.00009458708,0.00015829143,0.000012696748,0.00037660272,0.00039436377,0.00023979881],"category_scores_gemma":[0.0000028388467,0.00034979096,0.00046397353,0.00032527093,0.0002268097,0.000008711602,0.000008966594,0.0003384151,0.0000042018696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041449393,0.0003089692,0.0036297888,0.00001386194,0.00032367517,0.000010139427,0.000047540736,0.96726847,0.007215576,0.0000060480397,0.00024030975,0.020521136],"study_design_scores_gemma":[0.0016593644,0.001623978,0.04063827,0.000045245066,0.0007223919,0.000115385905,0.000113198024,0.7053221,0.24808492,0.000060925875,0.00033208312,0.0012821505],"about_ca_topic_score_codex":0.000038767896,"about_ca_topic_score_gemma":0.00020502663,"teacher_disagreement_score":0.4353144,"about_ca_system_score_codex":0.000034570337,"about_ca_system_score_gemma":0.00004069108,"threshold_uncertainty_score":0.9998954},"labels":[],"label_agreement":null},{"id":"W2151017751","doi":"10.1109/tnn.2003.810598","title":"On the number of multilinear partitions and the computing capacity of multiple-valued multiple-threshold perceptrons","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Windsor","funders":"","keywords":"Multilinear map; Computer science; Perceptron; Artificial intelligence; Algorithm; Mathematics; Artificial neural network","score_opus":0.029490921595146106,"score_gpt":0.26580440332802663,"score_spread":0.23631348173288053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151017751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33688006,0.000009509701,0.66186696,0.00043609075,0.000162716,0.00036285282,0.000007209303,0.000087230255,0.00018734625],"genre_scores_gemma":[0.9920389,0.00001868495,0.0072788424,0.0005671183,0.000017471732,0.000037077498,6.7668793e-7,0.000013922902,0.000027270617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823004,0.0005582172,0.00041908654,0.0002910339,0.00026370972,0.00023793387],"domain_scores_gemma":[0.99696416,0.002078295,0.00017628771,0.00060805265,0.0001125168,0.00006068888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006554552,0.00018961262,0.00025578044,0.000059781585,0.00040970076,0.000056120345,0.00039190098,0.00010191359,0.000023684928],"category_scores_gemma":[0.000059056078,0.00011975171,0.000184124,0.0003706966,0.00047835434,0.00015714063,0.000005936445,0.00058078184,0.0000028313189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010857265,0.0003581472,0.00042960883,0.000011144025,0.00006359286,8.711103e-7,0.0025203284,0.9424479,0.0004922008,0.05092078,0.00017852419,0.0024683278],"study_design_scores_gemma":[0.00093396154,0.00006307415,0.00039699033,0.000031345415,0.000019815374,0.000012883345,0.000082461964,0.99048203,0.0071001244,0.00073685456,0.000023558374,0.00011690352],"about_ca_topic_score_codex":0.0000658118,"about_ca_topic_score_gemma":0.00007023115,"teacher_disagreement_score":0.6551589,"about_ca_system_score_codex":0.00001683664,"about_ca_system_score_gemma":0.000017881108,"threshold_uncertainty_score":0.4883333},"labels":[],"label_agreement":null},{"id":"W2151602183","doi":"10.1109/tnn.2006.872350","title":"A softmin-based neural model for causal reasoning","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"University of Waterloo","keywords":"Monotonic function; Computer science; Artificial intelligence; Artificial neural network; Causal model; Class (philosophy); Process (computing); Mechanism (biology); Causal reasoning; Fuzzy logic; Additive function; Machine learning; Mathematics; Cognition; Programming language","score_opus":0.024965401478727355,"score_gpt":0.2511315588216548,"score_spread":0.22616615734292742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151602183","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.0056793923,0.00005044198,0.99197346,0.00068046147,0.00079191336,0.00025650635,0.00001274461,0.0004764129,0.00007867375],"genre_scores_gemma":[0.9605795,0.0000025558172,0.037842296,0.00091904786,0.00015242254,0.0001142566,0.0000051602356,0.000029278677,0.00035548938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982744,0.00005279947,0.00031753146,0.00055683864,0.00022827061,0.000570163],"domain_scores_gemma":[0.9990172,0.00020169033,0.00008202398,0.0004689102,0.00010069089,0.00012952895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014695826,0.00027199904,0.00021970177,0.00011213894,0.00041828945,0.00021517991,0.00052135764,0.00015249659,0.000004649377],"category_scores_gemma":[0.0000027018684,0.00026515083,0.00021052462,0.00032747287,0.00005381434,0.00031322608,0.0000024236288,0.0004146805,0.0000044469552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003934785,0.00008438351,0.000004467236,0.000005790038,0.000005951694,0.0000047748313,0.000020646938,0.9704019,0.00012784725,0.0012691158,0.00043018593,0.027605603],"study_design_scores_gemma":[0.0005002368,0.00014811415,0.000013506411,0.00002416664,0.000020528554,0.0000120274135,0.0000015243411,0.99735487,0.00068258244,0.0009298242,0.000018352075,0.0002942929],"about_ca_topic_score_codex":0.00006458785,"about_ca_topic_score_gemma":0.000087191635,"teacher_disagreement_score":0.9549001,"about_ca_system_score_codex":0.00004812081,"about_ca_system_score_gemma":0.00006185583,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W2152388511","doi":"10.1109/tnn.2005.844089","title":"Refractory Pulse Counting Processes in Stochastic Neural Computers","year":2005,"lang":"en","type":"letter","venue":"IEEE Transactions on Neural Networks","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dead time; Bernoulli's principle; Bernoulli distribution; Pulse (music); Artificial neural network; Stochastic process; Computer science; Transient (computer programming); Detector; Refractory period; Control theory (sociology); Mathematics; Statistics; Physics; Artificial intelligence; Telecommunications; Random variable","score_opus":0.023204648703050924,"score_gpt":0.23983144196753792,"score_spread":0.216626793264487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152388511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10209924,0.0004099767,0.44520766,0.39929637,0.04441014,0.005016056,0.0006142432,0.0022956824,0.00065063074],"genre_scores_gemma":[0.7391389,0.00010162134,0.000018762967,0.25691596,0.0025213447,0.0001038222,0.00004354048,0.00014629187,0.0010097567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957011,0.00031217915,0.0007710025,0.0013857265,0.0007187236,0.0011112674],"domain_scores_gemma":[0.9973034,0.0015737101,0.00036803793,0.0005465006,0.00008418038,0.00012411673],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00013498613,0.0008028844,0.00065079564,0.0005738711,0.0004176303,0.00029096656,0.00064824295,0.0008530511,0.00011173076],"category_scores_gemma":[0.00004526439,0.000781981,0.00027062037,0.001108888,0.00020679695,0.00057455903,0.0000068983177,0.00584969,0.000048255748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010002565,0.00014246361,0.0000012582541,0.00009655022,0.000010784582,0.00041935724,0.000036390345,0.9467162,0.0006551701,7.265156e-7,0.026329763,0.025491327],"study_design_scores_gemma":[0.0006379913,0.00030935768,0.0000134273705,0.0002429096,0.000058291156,0.00017592154,0.0000050855983,0.98531884,0.00027543952,0.000010798794,0.012093032,0.0008588892],"about_ca_topic_score_codex":0.000043733544,"about_ca_topic_score_gemma":0.00015589064,"teacher_disagreement_score":0.63703966,"about_ca_system_score_codex":0.00026682924,"about_ca_system_score_gemma":0.0000745028,"threshold_uncertainty_score":0.99946314},"labels":[],"label_agreement":null},{"id":"W2152500150","doi":"10.1109/tnn.2002.804285","title":"Gaussian activation functions using Markov chains","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Markov chain; Gaussian; Stochastic computing; Artificial neural network; Signal processing; Nonlinear system; Offset (computer science); Stochastic resonance; Sigmoid function; Stochastic process; Algorithm; Markov process; Digital signal processing; Noise (video); Artificial intelligence; Mathematics; Machine learning; Computer hardware","score_opus":0.031213089371973087,"score_gpt":0.23627035196988516,"score_spread":0.20505726259791207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152500150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009692217,0.000041793526,0.98499745,0.002613206,0.0011657842,0.00032569707,0.0000057351303,0.00044465266,0.0007134558],"genre_scores_gemma":[0.99354476,0.000060323815,0.0031259058,0.0012643908,0.00031461375,0.00007639383,0.0000026989158,0.00002981586,0.0015811196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826825,0.0000852653,0.00032027156,0.00056765624,0.0002598694,0.00049867533],"domain_scores_gemma":[0.9987737,0.00013854232,0.00011370035,0.00071883923,0.000057254263,0.0001979406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00007771456,0.00027076257,0.00019100413,0.00017334869,0.00085337163,0.00020654571,0.00050382136,0.00019738298,0.00019322637],"category_scores_gemma":[0.0000014399966,0.0002602441,0.00018168794,0.0011945433,0.00006305446,0.0006983028,0.0000053019353,0.00077211636,0.00005693886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074535724,0.00015315897,0.000007026972,0.0000028295335,0.000021173264,0.0000044102294,0.000046529844,0.80742824,0.00063647475,0.0006317057,0.0019503459,0.18911068],"study_design_scores_gemma":[0.00024809188,0.000077847486,0.00010028831,0.000020030935,0.000018309445,0.000037967326,0.000009292305,0.9975198,0.00059349625,0.000056942466,0.001045004,0.0002729245],"about_ca_topic_score_codex":0.000023861265,"about_ca_topic_score_gemma":0.000017271834,"teacher_disagreement_score":0.9838525,"about_ca_system_score_codex":0.00008359326,"about_ca_system_score_gemma":0.000008930776,"threshold_uncertainty_score":0.999985},"labels":[],"label_agreement":null},{"id":"W2152511329","doi":"10.1109/72.846725","title":"Taking on the curse of dimensionality in joint distributions using neural networks","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Curse of dimensionality; Joint probability distribution; Artificial neural network; Computer science; Artificial intelligence; Conditional probability distribution; Random variable; Graphical model; Bayesian network; Bayesian probability; Pattern recognition (psychology); Machine learning; Mathematics; Algorithm; Statistics","score_opus":0.05487977902440835,"score_gpt":0.27586548560015645,"score_spread":0.2209857065757481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152511329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24543864,0.00004964763,0.7529111,0.00078885263,0.00049928215,0.00015704424,0.000009338598,0.000072309434,0.00007379764],"genre_scores_gemma":[0.9985753,0.000033516066,0.0006528257,0.0006102907,0.00007023541,0.00001781114,0.0000025409295,0.000012771221,0.000024705256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811083,0.0002766567,0.00046548923,0.0004235353,0.0002747253,0.0004487496],"domain_scores_gemma":[0.99881727,0.00028352728,0.00013297971,0.00060641795,0.000059436406,0.000100357785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031802035,0.00023310263,0.00024962824,0.00007860638,0.0003693685,0.000086112675,0.0004821256,0.00012856754,0.00011282866],"category_scores_gemma":[0.0000051393345,0.0001795046,0.00017714416,0.0007729732,0.00014044637,0.0002481182,0.0000054999573,0.00086692715,0.0000039996485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026611347,0.00013650882,0.000016364826,0.0000019214538,0.000009002389,0.000007229276,0.000045198347,0.947786,0.00006202351,0.0015452174,0.00002876632,0.050335195],"study_design_scores_gemma":[0.00018982927,0.00009135625,0.0008291982,0.00008156457,0.0000133291205,0.00002003427,0.000005897246,0.9979188,0.00026682086,0.00041013735,0.000007262559,0.00016577814],"about_ca_topic_score_codex":0.0001865553,"about_ca_topic_score_gemma":0.000047481724,"teacher_disagreement_score":0.7531367,"about_ca_system_score_codex":0.000066736146,"about_ca_system_score_gemma":0.000027107986,"threshold_uncertainty_score":0.7319985},"labels":[],"label_agreement":null},{"id":"W2152808281","doi":"10.1109/tnn.2007.912312","title":"Adaptive Importance Sampling to Accelerate Training of a Neural Probabilistic Language Model","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":233,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Language model; Artificial neural network; Vocabulary; Probabilistic neural network; Speedup; Artificial intelligence; Probabilistic logic; Computation; Machine learning; Feedforward neural network; Sampling (signal processing); Statistical model; Training (meteorology); Backpropagation; Importance sampling; Time delay neural network; Algorithm; Statistics; Mathematics; Monte Carlo method","score_opus":0.0677840225644307,"score_gpt":0.29191262992274414,"score_spread":0.22412860735831344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152808281","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.08499976,0.00025523696,0.91338646,0.00020655153,0.00022381973,0.00034554984,0.000009034253,0.00053534895,0.000038218597],"genre_scores_gemma":[0.7971423,0.00000846205,0.20211163,0.0005631095,0.000044086042,0.000055446846,0.0000010048395,0.00002278089,0.00005113383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982831,0.000056848607,0.00039201317,0.00052710035,0.00029323495,0.00044771182],"domain_scores_gemma":[0.9989342,0.00014165301,0.00014203003,0.0005115244,0.00011674763,0.0001538397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014027255,0.00026208002,0.0003148923,0.00017452576,0.0002485868,0.000053868112,0.0007629295,0.00011236335,0.000006295978],"category_scores_gemma":[0.00001301406,0.00023963109,0.0001327975,0.00077663554,0.000080852114,0.0005072049,0.000009942658,0.00055740605,0.000001563153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057924022,0.000052939376,0.0000040138184,0.000010350818,0.000011425503,0.00003927288,0.0023835583,0.9514742,0.0020860792,0.00025513137,0.000038097092,0.043587003],"study_design_scores_gemma":[0.00016725446,0.00019370942,0.00001599566,0.00005160719,0.000010371352,0.00007945515,0.000041131556,0.99375194,0.0048271613,0.0006092986,0.0000012164769,0.00025086533],"about_ca_topic_score_codex":0.000025534137,"about_ca_topic_score_gemma":0.000038438557,"teacher_disagreement_score":0.7121426,"about_ca_system_score_codex":0.00006161699,"about_ca_system_score_gemma":0.00005933135,"threshold_uncertainty_score":0.9771872},"labels":[],"label_agreement":null},{"id":"W2152975148","doi":"10.1109/tnn.2006.882814","title":"Basic Difference Between Brain and Computer: Integration of Asynchronous Processes Implemented as Hardware Model of the Retina","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Process (computing); Asynchronous communication; Synchronization (alternating current); Preprocessor; Retina; Receptive field; Artificial intelligence; Computer hardware; Neuroscience","score_opus":0.02941815770757968,"score_gpt":0.2619552074771494,"score_spread":0.2325370497695697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152975148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5234387,0.000004965364,0.47583562,0.0002383101,0.00019069306,0.00021267352,0.000033287084,0.000024191793,0.000021549955],"genre_scores_gemma":[0.9992972,0.00003666354,0.00010696363,0.00039234874,0.000050028553,0.000007946849,0.0000032275925,0.000015977745,0.000089645655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987474,0.000086776134,0.00037367115,0.0003170523,0.00024648983,0.0002286173],"domain_scores_gemma":[0.99882627,0.00060955517,0.0002026133,0.00022055929,0.000081283535,0.000059699756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001533752,0.0001706617,0.00020458683,0.00008327768,0.0002055373,0.000023459485,0.00020119458,0.000080891165,0.0000071988334],"category_scores_gemma":[0.000030051282,0.00012238252,0.00008077921,0.0004501225,0.0001650583,0.00011813776,0.0000060015977,0.00031869792,3.471383e-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.00034176043,0.00023701978,0.0008744662,0.00014625177,0.00002219783,0.0000029887613,0.0003755878,0.41468298,0.3133792,0.00041992476,0.000068706744,0.26944894],"study_design_scores_gemma":[0.00030026236,0.0003860507,0.0031097026,0.00007572331,0.000027290724,0.000010397278,0.00001586895,0.7834631,0.21227522,0.0002152593,0.0000051091847,0.00011600956],"about_ca_topic_score_codex":0.000032035165,"about_ca_topic_score_gemma":0.00012125427,"teacher_disagreement_score":0.47585848,"about_ca_system_score_codex":0.000026327318,"about_ca_system_score_gemma":0.000028174993,"threshold_uncertainty_score":0.49906147},"labels":[],"label_agreement":null},{"id":"W2153846939","doi":"10.1109/tnn.2006.883002","title":"The Impact of Arithmetic Representation on Implementing MLP-BP on FPGAs: A Study","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Arithmetic; Field-programmable gate array; Representation (politics); Parallel computing; Theoretical computer science; Computer architecture; Mathematics; Computer hardware","score_opus":0.035797712668031376,"score_gpt":0.36823864259842787,"score_spread":0.3324409299303965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153846939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11228161,0.000013283429,0.8861257,0.0001877417,0.0007508805,0.00040814362,0.0000025106926,0.00007518412,0.00015496089],"genre_scores_gemma":[0.99456674,0.0000135329565,0.0050916616,0.000121945704,0.00011422845,0.000023040267,4.1104275e-7,0.00001446005,0.0000539676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798626,0.0002929662,0.00043731436,0.00040436446,0.00038718223,0.0004919294],"domain_scores_gemma":[0.9976705,0.0013769444,0.00016936148,0.00060656125,0.00006514924,0.000111495574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096623914,0.00019525064,0.00021033181,0.00012814817,0.00047482882,0.00012482188,0.00047865743,0.00004796972,0.00000978048],"category_scores_gemma":[0.000013599578,0.00012500466,0.00023666344,0.00086433295,0.00004750463,0.00015665553,0.000005817405,0.0004932714,0.0000039534107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009844339,0.0004438505,0.00009721832,9.953685e-7,0.000052755182,0.000011871607,0.00016278643,0.27943462,0.00011095733,0.00008939225,0.00004536271,0.7194517],"study_design_scores_gemma":[0.0007706085,0.0036769141,0.010163772,0.000024627561,0.000025264251,0.000010269947,0.00020040946,0.9817755,0.0026408643,0.00046558867,0.000033079166,0.00021305874],"about_ca_topic_score_codex":0.00022828329,"about_ca_topic_score_gemma":0.000038906375,"teacher_disagreement_score":0.8822851,"about_ca_system_score_codex":0.00006279366,"about_ca_system_score_gemma":0.000014640381,"threshold_uncertainty_score":0.50975424},"labels":[],"label_agreement":null},{"id":"W2154338144","doi":"10.1109/72.914519","title":"STRIP - a strip-based neural-network growth algorithm for learning multiple-valued functions","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Windsor","funders":"Purdue University","keywords":"Hyperplane; Artificial neural network; STRIPS; Algorithm; Computer science; Genetic algorithm; Artificial intelligence; Mathematics; Combinatorics; Machine learning","score_opus":0.019815359783414175,"score_gpt":0.24156098461776043,"score_spread":0.22174562483434626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154338144","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.002350577,0.00013121692,0.9912608,0.0015187884,0.0023250156,0.0012366528,0.000034024506,0.0010599202,0.000082979226],"genre_scores_gemma":[0.96527195,0.00008846151,0.030112782,0.0015297629,0.0010484239,0.00084522535,0.000051153183,0.000085146086,0.00096712407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639666,0.00022756257,0.00065681455,0.001101684,0.00041961556,0.0011976871],"domain_scores_gemma":[0.99720836,0.0010810718,0.0002522483,0.00081392593,0.00024940318,0.00039497844],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00029286323,0.0005576546,0.0004566946,0.00020818402,0.0017733146,0.00038342155,0.0009533034,0.0002715962,0.000036710568],"category_scores_gemma":[0.000012175298,0.0005453993,0.00052585546,0.0019796058,0.0001149565,0.0006047446,0.000010782591,0.0011756246,0.000024936478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052151616,0.00020023694,0.000047854744,0.000004618219,0.000034925168,0.0000099015315,0.000010217548,0.7671842,0.00003330143,0.00011826422,0.002037694,0.23026665],"study_design_scores_gemma":[0.0015832668,0.0005164309,0.00016983121,0.000031975276,0.00007136792,0.000041823136,0.00001217807,0.99244267,0.00011397118,0.00020381671,0.0042551295,0.00055751915],"about_ca_topic_score_codex":0.000048845734,"about_ca_topic_score_gemma":0.00006615461,"teacher_disagreement_score":0.9629213,"about_ca_system_score_codex":0.000097588854,"about_ca_system_score_gemma":0.000054204364,"threshold_uncertainty_score":0.9996998},"labels":[],"label_agreement":null},{"id":"W2155092378","doi":"10.1109/72.977279","title":"Interpretation of artificial neural networks by means of fuzzy rules","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Neuro-fuzzy; Computer science; Artificial intelligence; Interpretation (philosophy); Fuzzy logic; Artificial neural network; Fuzzy classification; Fuzzy set operations; Operator (biology); Defuzzification; Fuzzy rule; Fuzzy control system; Antecedent (behavioral psychology); Extension (predicate logic); Fuzzy associative matrix; Fuzzy set; Data mining; Fuzzy number","score_opus":0.015683647162570504,"score_gpt":0.21480528278678826,"score_spread":0.19912163562421775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155092378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014016638,0.00055036263,0.9819361,0.00030030965,0.0018623108,0.00026672755,0.000014449166,0.00012620546,0.00092687114],"genre_scores_gemma":[0.99905807,0.00005813876,0.0003926245,0.00020496672,0.00012771462,0.00002981264,0.0000029343728,0.00001665994,0.0001090722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980378,0.00021018769,0.00066515675,0.0003941141,0.0003223591,0.0003703377],"domain_scores_gemma":[0.99879384,0.0002506723,0.00026734656,0.00048131304,0.00009994366,0.00010689382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016484757,0.00023959964,0.00040321506,0.00011702702,0.00013361324,0.000060062914,0.00060631224,0.00017161679,0.000024159222],"category_scores_gemma":[0.0000038792737,0.00021616959,0.00026270896,0.0004570389,0.000117972726,0.00037369417,0.0000045710076,0.00037157518,0.0000065342324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056345572,0.000147108,0.000009341387,0.000009241891,0.000034408098,0.0000028794948,0.00017947194,0.78883517,0.00031153558,0.0005125117,0.00055435504,0.20934764],"study_design_scores_gemma":[0.00031549306,0.0003310875,0.000030981522,0.00003092132,0.000028921899,0.0000115297935,0.000022823167,0.99841076,0.00035275597,0.00026678148,0.000019001689,0.00017896005],"about_ca_topic_score_codex":0.00005611392,"about_ca_topic_score_gemma":0.000036793033,"teacher_disagreement_score":0.98504144,"about_ca_system_score_codex":0.00002794334,"about_ca_system_score_gemma":0.0000058263513,"threshold_uncertainty_score":0.881514},"labels":[],"label_agreement":null},{"id":"W2155178156","doi":"10.1109/tnn.2005.860853","title":"Ensemble-based discriminant learning with boosting for face recognition","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Institute of Standards and Technology","keywords":"Boosting (machine learning); Linear discriminant analysis; Computer science; Artificial intelligence; Machine learning; Ensemble learning; Facial recognition system; Discriminant; Pairwise comparison; Pattern recognition (psychology)","score_opus":0.02248973911586177,"score_gpt":0.22837046837794747,"score_spread":0.2058807292620857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155178156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03314667,0.000018083474,0.96503365,0.00049209176,0.00043166,0.00037782453,0.0000058343912,0.0003061151,0.00018809657],"genre_scores_gemma":[0.98444515,0.0000051360053,0.01471979,0.00028479175,0.000094571784,0.00016662503,0.000025198686,0.00002267953,0.00023602358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987671,0.000073705676,0.00021553981,0.00039926692,0.00018093953,0.0003634815],"domain_scores_gemma":[0.9992668,0.0002864931,0.00010204432,0.0001897465,0.00008794249,0.000066981454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000111564594,0.0001906761,0.00014836992,0.0001043285,0.0005156431,0.00015021974,0.00017548818,0.00009249682,0.0000088146135],"category_scores_gemma":[0.0000028797128,0.00015629805,0.00010452384,0.0002747105,0.000030146204,0.00038983842,0.0000012754522,0.0003220233,0.000011706948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105345156,0.000081615195,0.000007386995,0.000012393635,0.0000050811805,0.0000052907185,0.000028257613,0.78978956,0.0013150083,0.000009634161,0.00019327407,0.20844714],"study_design_scores_gemma":[0.00081568083,0.00044228765,0.00005042005,0.0001248014,0.000026564217,0.000014614976,0.000031953747,0.9689517,0.028937608,0.00013914131,0.00021502147,0.00025020915],"about_ca_topic_score_codex":0.000042482963,"about_ca_topic_score_gemma":0.00006658358,"teacher_disagreement_score":0.95129853,"about_ca_system_score_codex":0.000029131825,"about_ca_system_score_gemma":0.000018749573,"threshold_uncertainty_score":0.637365},"labels":[],"label_agreement":null},{"id":"W2155876893","doi":"10.1109/tnn.2008.2004373","title":"A Recurrent Neural-Network-Based Sensor and Actuator Fault Detection and Isolation for Nonlinear Systems With Application to the Satellite's Attitude Control Subsystem","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":234,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"","keywords":"Control theory (sociology); Fault detection and isolation; Artificial neural network; Actuator; Attitude control; Nonlinear system; Computer science; Backpropagation; Observer (physics); Fault (geology); Control engineering; Engineering; Artificial intelligence; Control (management)","score_opus":0.008522673110264485,"score_gpt":0.20553219006025203,"score_spread":0.19700951694998756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155876893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13481738,0.00055646204,0.8606222,0.00016087921,0.0011172332,0.0023637693,0.000033380486,0.00032330453,0.000005373665],"genre_scores_gemma":[0.9980406,0.00008386644,0.00014234275,0.00010978988,0.0003839958,0.0011480753,0.0000058854885,0.00005676012,0.000028642882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986995,0.000104319144,0.00035700138,0.0003439673,0.00016479923,0.00033040266],"domain_scores_gemma":[0.9991859,0.00025646458,0.00008158857,0.00025203024,0.00009065177,0.00013331641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016956948,0.00028654127,0.00030106495,0.00009055212,0.00047504142,0.00009375579,0.00007457289,0.00014743181,8.8868444e-7],"category_scores_gemma":[0.0000025476518,0.00021384732,0.00007489551,0.0002974798,0.00003915797,0.000114560426,5.906935e-7,0.00028525357,0.000003501287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039905767,0.00001720764,0.000045150253,0.000065381086,0.00005938331,0.000001025444,0.00005847157,0.96964556,0.0010740657,9.993585e-7,0.000029134138,0.028604586],"study_design_scores_gemma":[0.0014907169,0.00036583067,0.00030267925,0.000056754558,0.00008053354,0.00010200115,0.000041545347,0.9947772,0.00028069605,2.0411237e-7,0.0022625753,0.00023925227],"about_ca_topic_score_codex":0.000034393233,"about_ca_topic_score_gemma":0.000297632,"teacher_disagreement_score":0.86322325,"about_ca_system_score_codex":0.000075808566,"about_ca_system_score_gemma":0.0000075348944,"threshold_uncertainty_score":0.872044},"labels":[],"label_agreement":null},{"id":"W2157540743","doi":"10.1109/72.991430","title":"Determination of neural-network topology for partial discharge pulse pattern recognition","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"High voltage insulation and dielectric phenomena","field":"Materials Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; University of Waterloo","funders":"","keywords":"Network topology; Artificial neural network; Computer science; Pattern recognition (psychology); Topology (electrical circuits); Feature (linguistics); Time delay neural network; Artificial intelligence; Pulse (music); Mathematics; Telecommunications; Computer network","score_opus":0.032644759415327115,"score_gpt":0.2556090050958931,"score_spread":0.222964245680566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157540743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23033719,0.00005283958,0.7668663,0.0002586841,0.0017952992,0.00042222007,0.000059123624,0.000097246455,0.00011106011],"genre_scores_gemma":[0.99821556,0.00003863638,0.0005611402,0.0004502121,0.0003975917,0.00014965987,0.000018548848,0.000024971325,0.00014369354],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998487,0.00013026869,0.00045650566,0.00033260416,0.0001649134,0.0004287256],"domain_scores_gemma":[0.9991236,0.00029211436,0.00018375556,0.00021094934,0.00009086208,0.000098744364],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017066962,0.00018455368,0.000246235,0.00009127062,0.00025780677,0.00003705575,0.00014468913,0.00013600367,0.0015962328],"category_scores_gemma":[0.000010206411,0.00017501466,0.0001371134,0.0002587258,0.00007654678,0.0002502133,0.000001462715,0.00017400456,0.000040078256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003149867,0.000490123,0.00008210455,0.000044156088,0.000018146322,0.00000565269,0.00027780654,0.29678157,0.01757237,0.000037485832,0.000713925,0.6836617],"study_design_scores_gemma":[0.0007390609,0.0004041662,0.00010084451,0.000016184278,0.000045579272,0.000010559055,0.000008131716,0.9833482,0.014795085,0.00021180732,0.00011453212,0.00020584292],"about_ca_topic_score_codex":0.0000198216,"about_ca_topic_score_gemma":0.00003839972,"teacher_disagreement_score":0.76787835,"about_ca_system_score_codex":0.000033802553,"about_ca_system_score_gemma":0.0000050717335,"threshold_uncertainty_score":0.99931645},"labels":[],"label_agreement":null},{"id":"W2158063174","doi":"10.1109/tnn.2011.2161999","title":"Textual and Visual Content-Based Anti-Phishing: A Bayesian Approach","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":197,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Phishing; Computer science; Naive Bayes classifier; Artificial intelligence; Classifier (UML); Web page; Machine learning; Bayes classifier; Pattern recognition (psychology); Data mining; The Internet; Support vector machine; World Wide Web","score_opus":0.046669252832073044,"score_gpt":0.22979738627587545,"score_spread":0.1831281334438024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158063174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03390646,0.00004391173,0.9640924,0.00012720887,0.0007697891,0.00019664518,0.0000020114783,0.00035059184,0.00051103294],"genre_scores_gemma":[0.9930568,0.000008670511,0.00609583,0.00063592696,0.00009297181,0.000029112114,0.0000012173302,0.000019751607,0.000059743506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986111,0.0001138342,0.000225198,0.00049940153,0.00020268848,0.0003478047],"domain_scores_gemma":[0.999332,0.000087479224,0.00007204079,0.0002888415,0.000042885942,0.00017673886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016564327,0.00021949307,0.00019606955,0.00015525092,0.00033744314,0.00018684099,0.0003267243,0.00015243811,0.000017537273],"category_scores_gemma":[0.0000024692063,0.00020433008,0.00010887563,0.00041835624,0.00008946904,0.00053686067,0.0000033709985,0.0004684671,0.0000049122123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006291369,0.0020917333,0.0014029236,0.00007785891,0.00022820629,0.00012303323,0.001908801,0.22317594,0.0033108364,0.0022382909,0.00055315293,0.76426005],"study_design_scores_gemma":[0.00052710145,0.00036804652,0.0013463706,0.000014242635,0.000021295957,0.00004785171,0.000045079425,0.99410915,0.0032246353,0.000023763369,0.000028889128,0.0002435847],"about_ca_topic_score_codex":0.000112879585,"about_ca_topic_score_gemma":0.00003163092,"teacher_disagreement_score":0.9591503,"about_ca_system_score_codex":0.000025007466,"about_ca_system_score_gemma":0.000017408349,"threshold_uncertainty_score":0.83323383},"labels":[],"label_agreement":null},{"id":"W2158247472","doi":"10.1109/tnn.2002.1000134","title":"Face recognition with radial basis function (RBF) neural networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":661,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Radial basis function; Overfitting; Artificial intelligence; Computer science; Pattern recognition (psychology); Linear discriminant analysis; Artificial neural network; Facial recognition system; Principal component analysis; Radial basis function network; Hierarchical RBF; Classifier (UML); Machine learning","score_opus":0.025577086661139226,"score_gpt":0.20844895168478164,"score_spread":0.18287186502364242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158247472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01927646,0.00014885225,0.97515607,0.0010267325,0.002962079,0.00042982594,0.000009917645,0.0006068105,0.00038322405],"genre_scores_gemma":[0.99574816,0.00023089816,0.001258955,0.0018123541,0.00039733454,0.00012756993,0.0000182165,0.00004258625,0.0003639509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997571,0.0002191852,0.0003840267,0.00075721135,0.0004108054,0.0006578008],"domain_scores_gemma":[0.99871784,0.00019902372,0.00015202825,0.0005491277,0.00011420405,0.0002677427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012747351,0.00040208813,0.00028827522,0.00022065526,0.00061280903,0.00028933346,0.00041446005,0.0002725496,0.00042277132],"category_scores_gemma":[0.0000027616682,0.00034811036,0.00020488955,0.0009305145,0.00008171005,0.0012969527,0.0000050088724,0.0008833399,0.0001356412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012142917,0.00012532457,0.0000071178397,0.0000038012595,0.000026323954,0.000015264135,0.000060357732,0.5897811,0.00003655838,0.0000035424562,0.0020290054,0.40779018],"study_design_scores_gemma":[0.0010248907,0.0007157145,0.00010225002,0.000057815356,0.00006458571,0.00009306082,0.00002900371,0.996478,0.0005668829,0.00004044754,0.00037333756,0.00045401338],"about_ca_topic_score_codex":0.000026879909,"about_ca_topic_score_gemma":0.00005419691,"teacher_disagreement_score":0.97647166,"about_ca_system_score_codex":0.00006040628,"about_ca_system_score_gemma":0.000008015206,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W2160680757","doi":"10.1109/tnn.2004.824261","title":"Dynamics of Projective Adaptive Resonance Theory Model: The Foundation of PART Algorithm","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Adaptive resonance theory; Computer science; Algorithm; Cluster analysis; Differential equation; Artificial neural network; Partial differential equation; Mathematics; Applied mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.01739360236093799,"score_gpt":0.24168147907590098,"score_spread":0.224287876714963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160680757","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.001864324,0.00007317226,0.99609095,0.00094310567,0.00031492545,0.00047542132,0.000022012891,0.00007284006,0.00014324067],"genre_scores_gemma":[0.9850298,0.00011827603,0.014378423,0.00019837562,0.00005497201,0.000109534136,0.0000028681611,0.00001467498,0.00009307208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876416,0.000097287426,0.0003388237,0.00032747263,0.00023846126,0.00023380242],"domain_scores_gemma":[0.9988216,0.00023864883,0.00020208482,0.00054607313,0.000145648,0.000045917695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020358019,0.00016616749,0.00018988363,0.00006161892,0.00024429034,0.000028654713,0.00056977145,0.00007886743,0.0000034335146],"category_scores_gemma":[0.0000018267945,0.00012374093,0.00014646357,0.0007147199,0.00020503353,0.0003022386,0.0000065887048,0.00035434126,0.0000016118521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030681,0.00009309156,3.6561997e-7,0.0000017245366,0.000013790738,4.729218e-7,0.000108214495,0.7499134,0.000016719512,0.04015844,0.00001563355,0.20964745],"study_design_scores_gemma":[0.0002507594,0.00020653935,0.000024957812,0.000035691635,0.000020644346,0.0000068432546,0.000034854696,0.9731633,0.0014702553,0.02465259,0.000018417571,0.00011514161],"about_ca_topic_score_codex":0.000033824574,"about_ca_topic_score_gemma":0.00007803987,"teacher_disagreement_score":0.9831655,"about_ca_system_score_codex":0.00007003955,"about_ca_system_score_gemma":0.000056676367,"threshold_uncertainty_score":0.5046009},"labels":[],"label_agreement":null},{"id":"W2161913203","doi":"10.1109/72.950144","title":"Prediction of noisy chaotic time series using an optimal radial basis function neural network","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Chaos control and synchronization","field":"Physics and Astronomy","cited_by":194,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Intrinsik (Canada); University of Calgary","funders":"","keywords":"Overfitting; Chaotic; Subspace topology; Artificial neural network; Radial basis function; Computer science; Radial basis function network; Algorithm; Series (stratigraphy); Nonlinear system; Time series; Mathematics; Pattern recognition (psychology); Artificial intelligence; Mathematical optimization; Machine learning","score_opus":0.01573624489250338,"score_gpt":0.20879464245053467,"score_spread":0.19305839755803128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161913203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38383043,0.00003153281,0.6144768,0.000048546997,0.0011806834,0.00021788478,0.000034761106,0.00007921432,0.00010014105],"genre_scores_gemma":[0.9972952,0.000010172302,0.00025262331,0.00004995197,0.0020468826,0.000022247199,0.00007949204,0.00004206165,0.00020133871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852836,0.00013413154,0.00040405444,0.00033619435,0.00019762332,0.0003996492],"domain_scores_gemma":[0.9993098,0.000053329248,0.00015687055,0.00026072055,0.00009153778,0.00012774703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010658881,0.0002621333,0.00029914276,0.00009273618,0.00038546836,0.000060761122,0.000110080524,0.000111015215,0.00078415254],"category_scores_gemma":[6.044261e-7,0.00026529716,0.00019637433,0.0004412748,0.00007431855,0.0006791238,0.0000018393933,0.00031424934,0.0000069028997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053476746,0.00017456846,0.0008149304,0.0000036131787,0.00007560083,0.0000015376112,0.00005043998,0.95283526,0.00057045097,0.00003003413,0.00005187606,0.044856925],"study_design_scores_gemma":[0.0008334736,0.00048312213,0.0012516805,0.000020826492,0.00018561604,0.000012874665,0.00003751579,0.9965667,0.00027373052,0.000060850358,0.00008161241,0.00019199016],"about_ca_topic_score_codex":0.0000819191,"about_ca_topic_score_gemma":0.000015987276,"teacher_disagreement_score":0.6142242,"about_ca_system_score_codex":0.00004367604,"about_ca_system_score_gemma":0.000025104284,"threshold_uncertainty_score":0.9999799},"labels":[],"label_agreement":null},{"id":"W2162560361","doi":"10.1109/tnn.2009.2030582","title":"Adachi-Like Chaotic Neural Networks Requiring <i>Linear</i>-Time Computations by Enforcing a Tree-Shaped Topology","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Artificial neural network; Computation; Computer science; Chaotic; Topology (electrical circuits); Content-addressable memory; Tree (set theory); Network topology; Quadratic equation; Time complexity; Algorithm; Spanning tree; Tree structure; Mathematics; Artificial intelligence; Discrete mathematics; Binary tree; Combinatorics","score_opus":0.014394666311383895,"score_gpt":0.24755057400835606,"score_spread":0.23315590769697217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162560361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072014905,0.00034068493,0.9839243,0.0052350787,0.0014338046,0.00066297647,0.000012067043,0.000919839,0.0002697437],"genre_scores_gemma":[0.9879487,0.00010425656,0.004296607,0.0062961592,0.00050650677,0.00008966703,0.00003623812,0.0000526322,0.00066923705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962275,0.0002262089,0.0008295403,0.0011054407,0.00039346685,0.001217854],"domain_scores_gemma":[0.9976893,0.0005106845,0.00027082916,0.0009846283,0.00011008742,0.00043447028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021390624,0.0006159494,0.00058221957,0.00022082088,0.001170888,0.00031349921,0.0012371374,0.00031053048,0.000057029636],"category_scores_gemma":[0.000003624983,0.0006133017,0.0003802831,0.001464088,0.00016711881,0.00083069335,0.000017438339,0.0012943334,0.00003845399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032384625,0.00017789436,0.000003833369,0.0000025007146,0.00002350487,0.000018664854,0.000066620916,0.8871618,0.00039914242,0.00035788893,0.0023711696,0.109384626],"study_design_scores_gemma":[0.00071856845,0.00045441114,0.00008167239,0.000030081048,0.000052087067,0.00012677381,0.000010565703,0.9971179,0.00011202938,0.00022467962,0.0004902171,0.00058101147],"about_ca_topic_score_codex":0.00003296541,"about_ca_topic_score_gemma":0.000038052527,"teacher_disagreement_score":0.9807472,"about_ca_system_score_codex":0.00008062278,"about_ca_system_score_gemma":0.000030044577,"threshold_uncertainty_score":0.9996318},"labels":[],"label_agreement":null},{"id":"W2163664861","doi":"10.1109/tnn.2007.902725","title":"Impulsive Stabilization of High-Order Hopfield-Type Neural Networks With Time-Varying Delays","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Artificial neural network; Control theory (sociology); Exponential stability; Hopfield network; Stability (learning theory); Computer science; Lyapunov function; Type (biology); Control (management); Mathematics; Mathematical optimization; Artificial intelligence; Nonlinear system; Machine learning","score_opus":0.012434610833243575,"score_gpt":0.21137847920433225,"score_spread":0.19894386837108868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163664861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113631636,0.00019282672,0.883899,0.0002697165,0.0011681371,0.000498503,0.0000044555245,0.00028236926,0.000053398275],"genre_scores_gemma":[0.9946723,0.00026964437,0.0041676275,0.00050024537,0.00019060417,0.000027887902,0.000022680542,0.00004769536,0.00010130024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971807,0.00028414058,0.0006315526,0.0007724561,0.0004819141,0.00064922683],"domain_scores_gemma":[0.9977795,0.000425458,0.0002789419,0.0008403657,0.000481894,0.0001938573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015858932,0.0004298781,0.0004903584,0.00017903539,0.0006218309,0.000084388885,0.00063774665,0.00026939934,0.00009318549],"category_scores_gemma":[0.000009322097,0.0003785673,0.00014924096,0.002165672,0.0002291098,0.0010088836,0.00001368645,0.000729642,0.0000068581026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019267946,0.00017104753,0.00012279603,0.000012446814,0.00004293571,0.000029515575,0.00016860543,0.973389,0.00010424509,0.00008061718,0.00012702601,0.025559057],"study_design_scores_gemma":[0.0007460985,0.000874301,0.00019726001,0.000035809553,0.000041276893,0.00013020869,0.000008068833,0.99655443,0.00094886555,0.00005281256,0.000016421667,0.00039444468],"about_ca_topic_score_codex":0.00009049271,"about_ca_topic_score_gemma":0.000090942594,"teacher_disagreement_score":0.8810407,"about_ca_system_score_codex":0.00008079077,"about_ca_system_score_gemma":0.00006860307,"threshold_uncertainty_score":0.9998666},"labels":[],"label_agreement":null},{"id":"W2164310911","doi":"10.1109/tnn.2010.2047512","title":"On Some Necessary and Sufficient Conditions for a Recurrent Neural Network Model With Time Delays to Generate Oscillations","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Guangxi University; Guangxi Normal University","keywords":"Artificial neural network; Control theory (sociology); Recurrent neural network; Equilibrium point; Computer science; Oscillation (cell signaling); Class (philosophy); Simple (philosophy); Stability (learning theory); Instability; Mathematics; Artificial intelligence; Differential equation; Control (management); Physics; Mathematical analysis; Machine learning","score_opus":0.012734366612742076,"score_gpt":0.23477126220077915,"score_spread":0.22203689558803708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164310911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2584806,0.000021734892,0.737042,0.0020667468,0.0011998,0.0008882871,0.000056725195,0.00021861302,0.000025492864],"genre_scores_gemma":[0.98978794,0.000016552336,0.0074168285,0.0020319615,0.00027181313,0.00026704234,0.000029843734,0.00003915095,0.00013886525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976967,0.00010028235,0.00039255022,0.00083972636,0.00030071876,0.000670047],"domain_scores_gemma":[0.99825674,0.00047632624,0.00011059723,0.00063591305,0.00016614622,0.0003542455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021709906,0.00037068306,0.00030027758,0.00016093154,0.0011188505,0.00029179253,0.0004134635,0.00016479507,0.000019163104],"category_scores_gemma":[0.0000072804664,0.00032323855,0.00012297854,0.0007537992,0.00011995051,0.0006028951,0.000010899163,0.00067698903,0.000009834581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013991435,0.00016116453,0.000006806636,0.0000064437468,0.00001784571,0.000002683425,0.00009253328,0.98431885,0.00025793276,0.0050931307,0.0012775095,0.008625211],"study_design_scores_gemma":[0.00054478936,0.001001681,0.00007572721,0.000028369872,0.000035052264,0.000026606423,0.000003223473,0.99627614,0.00013130819,0.0014425183,0.000055158944,0.00037944844],"about_ca_topic_score_codex":0.0000049771993,"about_ca_topic_score_gemma":0.00016235231,"teacher_disagreement_score":0.7313073,"about_ca_system_score_codex":0.00005266551,"about_ca_system_score_gemma":0.000053806645,"threshold_uncertainty_score":0.999922},"labels":[],"label_agreement":null},{"id":"W2164554122","doi":"10.1109/tnn.2009.2027319","title":"Granular Neural Networks and Their Development Through Context-Based Clustering and Adjustable Dimensionality of Receptive Fields","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Curse of dimensionality; Cluster analysis; Receptive field; Artificial neural network; Artificial intelligence; Context (archaeology); Pattern recognition (psychology)","score_opus":0.02072436511733904,"score_gpt":0.2366613044974035,"score_spread":0.21593693938006445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164554122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06270111,0.0005630622,0.934515,0.0013968537,0.00032336137,0.00035536298,0.0000046929563,0.00010972468,0.00003080892],"genre_scores_gemma":[0.9938734,0.00013140168,0.0034796624,0.0023719417,0.000058964633,0.000034020653,0.00000431165,0.0000130925655,0.00003320105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983552,0.00010555087,0.0004212018,0.00054511195,0.00016706789,0.00040585044],"domain_scores_gemma":[0.9989366,0.00030434708,0.00013685107,0.00039846767,0.00007919951,0.00014451868],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015482021,0.00030387292,0.00034529014,0.00005623369,0.00043917756,0.00009064583,0.00029564684,0.00015434493,0.000009073114],"category_scores_gemma":[0.0000016269158,0.00025371058,0.00009481072,0.00039470228,0.000120351884,0.00036151466,0.0000116584,0.00047800492,3.9192037e-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.0000565388,0.000090607806,0.000021827505,0.0000073191736,0.000012013801,0.0000029130872,0.00017050997,0.7861222,0.00008522908,0.00023492324,0.000116515504,0.21307941],"study_design_scores_gemma":[0.0005180611,0.00023162957,0.00072158786,0.000051611216,0.000014255084,0.000018412517,0.000027773232,0.9961193,0.0015356258,0.00026476223,0.00023707251,0.00025989496],"about_ca_topic_score_codex":0.000036014164,"about_ca_topic_score_gemma":0.00014492414,"teacher_disagreement_score":0.9311723,"about_ca_system_score_codex":0.000024993316,"about_ca_system_score_gemma":0.000019047553,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2165866200","doi":"10.1109/tnn.2002.1031943","title":"Application of adaptive constructive neural networks to image compression","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Constructive; Computer science; Artificial neural network; Quantization (signal processing); Artificial intelligence; Feedforward neural network; Data compression; Image compression; JPEG; Feed forward; Generalization; Image (mathematics); Pattern recognition (psychology); Algorithm; Image processing; Mathematics; Engineering; Control engineering","score_opus":0.01646623996808614,"score_gpt":0.23656812362640053,"score_spread":0.2201018836583144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165866200","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.0054613575,0.000111836234,0.9911685,0.0009525393,0.0007792987,0.0008999761,0.000020696138,0.0002946095,0.00031119306],"genre_scores_gemma":[0.9893968,0.00005360054,0.009203267,0.0007937323,0.00019526004,0.00024108856,0.0000039413653,0.000033453274,0.00007887505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976031,0.00014497063,0.00055713387,0.0007876373,0.00034476252,0.00056240003],"domain_scores_gemma":[0.998003,0.0003193986,0.00024177608,0.00094096444,0.00018878108,0.00030605812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010116028,0.00036878066,0.0003951531,0.00017443327,0.00041709378,0.00010372105,0.00093246147,0.00017192813,0.000048030266],"category_scores_gemma":[0.0000021436924,0.00034649376,0.00022380095,0.001341965,0.00018113684,0.0005273909,0.000019558547,0.0006582469,0.000027294052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003798687,0.00015069322,0.000010873435,0.00000293596,0.000019070034,0.0000034936538,0.000064926186,0.7803366,0.0006042231,0.00094283617,0.0008992012,0.21692714],"study_design_scores_gemma":[0.00038870223,0.0002841795,0.00017130097,0.000025759991,0.000025019193,0.00003266554,0.000017065806,0.99698174,0.0014114977,0.00014449602,0.00018985436,0.00032772863],"about_ca_topic_score_codex":0.000037426846,"about_ca_topic_score_gemma":0.000018629722,"teacher_disagreement_score":0.9839354,"about_ca_system_score_codex":0.000054341468,"about_ca_system_score_gemma":0.0000062819117,"threshold_uncertainty_score":0.99989873},"labels":[],"label_agreement":null},{"id":"W2166329820","doi":"10.1109/tnn.2010.2054109","title":"An Extension of the Standard Mixture Model for Image Segmentation","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Artificial intelligence; Mixture model; Image segmentation; Pixel; Robustness (evolution); Computer science; Pattern recognition (psychology); Markov random field; Segmentation; Grayscale; Scale-space segmentation; Computer vision; Mathematics","score_opus":0.015014905269373057,"score_gpt":0.2822433391842295,"score_spread":0.26722843391485646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166329820","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.011088671,0.000008923623,0.9863969,0.00055618625,0.0014538204,0.0003882661,0.00002217435,0.000064692584,0.000020377218],"genre_scores_gemma":[0.6319228,0.0000049003484,0.36765033,0.000293652,0.000044880384,0.000022583305,7.68332e-7,0.00000979949,0.000050306808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990573,0.00008036769,0.00019223904,0.00030018398,0.00017710488,0.00019279335],"domain_scores_gemma":[0.9990021,0.0000818672,0.00008583773,0.00063484564,0.00012335413,0.00007201947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024747849,0.00013254143,0.0001396586,0.000042791642,0.00023375243,0.0000610979,0.00045459566,0.000119826145,0.000004465231],"category_scores_gemma":[0.0000025117238,0.00009134087,0.00014793551,0.00019394713,0.000057224293,0.000387235,0.000002243423,0.00038465805,2.2048715e-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.00008424265,0.00009194595,0.000001029056,0.0000097880475,0.000009948801,7.181211e-7,0.00028726232,0.5197641,0.13923362,0.002290339,0.00028221615,0.33794475],"study_design_scores_gemma":[0.00028765603,0.00011275614,0.000015666854,0.0000079445,0.000017655015,0.000007874145,0.0000027839762,0.94741386,0.047662683,0.004360668,0.000013016652,0.00009742014],"about_ca_topic_score_codex":0.0000033319347,"about_ca_topic_score_gemma":0.000040840474,"teacher_disagreement_score":0.6208341,"about_ca_system_score_codex":0.000011097854,"about_ca_system_score_gemma":0.0000275295,"threshold_uncertainty_score":0.37247726},"labels":[],"label_agreement":null},{"id":"W2167011086","doi":"10.1109/tnn.2003.820618","title":"Real-time collision-free motion planning of a mobile robot using a neural dynamics-based approach","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Guelph","funders":"","keywords":"Artificial neural network; Computer science; Mobile robot; Motion planning; Robot; Collision; Artificial intelligence; Stability (learning theory); Control theory (sociology); Machine learning","score_opus":0.02357518814957928,"score_gpt":0.25696351778645976,"score_spread":0.23338832963688047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167011086","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.042724643,0.00003431952,0.9552565,0.000032207063,0.00097529823,0.00047297272,0.000016358395,0.0002997972,0.00018788312],"genre_scores_gemma":[0.7813134,0.0000031165594,0.21845682,0.00005044926,0.000036998586,0.00004438951,0.000007686694,0.000034183257,0.00005294257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738085,0.00035678895,0.0005526882,0.0006581368,0.00048045669,0.0005710865],"domain_scores_gemma":[0.9980837,0.0003386956,0.0002587032,0.0010256676,0.00011319543,0.00018004037],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039168636,0.00034786802,0.00043980408,0.00030125404,0.0003493159,0.00011114074,0.0008112577,0.00021373152,0.000008135309],"category_scores_gemma":[0.000013416712,0.0003498227,0.00021395623,0.0011267388,0.00009969665,0.00041245233,0.000006914773,0.0005300656,0.0000030345705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003247247,0.00022173853,0.000034328405,0.000015294421,0.000021585716,0.000024413597,0.00011315088,0.99500257,0.0004417237,0.000040958534,0.00002898273,0.004022796],"study_design_scores_gemma":[0.0007924455,0.0002812061,0.00008250222,0.00007063992,0.000037758855,0.000091334965,0.00002931472,0.99740165,0.0008721744,0.000032901542,0.0000013166672,0.00030676796],"about_ca_topic_score_codex":0.00007173444,"about_ca_topic_score_gemma":0.0000017561372,"teacher_disagreement_score":0.73858875,"about_ca_system_score_codex":0.00017563872,"about_ca_system_score_gemma":0.00007348698,"threshold_uncertainty_score":0.9998954},"labels":[],"label_agreement":null},{"id":"W2168599920","doi":"10.1109/tnn.2002.806949","title":"A neural-network appearance-based 3-D object recognition using independent component analysis","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Independent component analysis; Computer science; Principal component analysis; Artificial intelligence; Pattern recognition (psychology); Cognitive neuroscience of visual object recognition; Artificial neural network; Facial recognition system; Object (grammar); Feature extraction; Computer vision","score_opus":0.0341544514731379,"score_gpt":0.26286028180864285,"score_spread":0.22870583033550496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168599920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047086697,0.000101621175,0.9506502,0.00019830263,0.0007783343,0.00042536113,0.000004716936,0.0006171283,0.00013762014],"genre_scores_gemma":[0.9754465,0.000023120418,0.022743022,0.0016026255,0.000065917084,0.00006369775,0.000007122555,0.000028059278,0.000019895198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703074,0.0008020905,0.0005104165,0.00068636023,0.00042052407,0.0005498959],"domain_scores_gemma":[0.9986056,0.00016530616,0.00021660652,0.0007086513,0.00012813891,0.00017567149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006108773,0.00033775117,0.00039437905,0.00046322058,0.00047684,0.00029475425,0.0004480939,0.00020539665,0.00004845914],"category_scores_gemma":[0.0000040869836,0.0003447162,0.0004432057,0.0026648967,0.000060941315,0.0005010961,0.0000033223769,0.000719679,0.000012221334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031118318,0.00014310161,0.000054234257,0.0000040687455,0.00010884556,0.000009123501,0.00005680003,0.9854166,0.00009048891,0.00007328799,0.00003502803,0.013977322],"study_design_scores_gemma":[0.0004429656,0.00013808101,0.00022903104,0.000030384195,0.00017484515,0.000020685413,0.000006771541,0.9957772,0.0025180622,0.0002282318,0.00006784847,0.00036589694],"about_ca_topic_score_codex":0.000052256095,"about_ca_topic_score_gemma":0.00010892636,"teacher_disagreement_score":0.92835987,"about_ca_system_score_codex":0.00012287054,"about_ca_system_score_gemma":0.00005467794,"threshold_uncertainty_score":0.99990046},"labels":[],"label_agreement":null},{"id":"W2169077345","doi":"10.1109/tnn.2010.2050333","title":"Quaternion-Based Adaptive Output Feedback Attitude Control of Spacecraft Using Chebyshev Neural Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":142,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Quaternion; Adaptive control; Spacecraft; Controller (irrigation); Computer science; Attitude control; Artificial neural network; Backstepping; Mathematics; Control engineering; Artificial intelligence; Engineering; Control (management)","score_opus":0.018974768730073102,"score_gpt":0.23049629620319972,"score_spread":0.21152152747312664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169077345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14179495,0.00023381771,0.8521175,0.000092394024,0.004628905,0.00065180485,0.0000530271,0.00037651346,0.000051082796],"genre_scores_gemma":[0.99767756,0.000010823855,0.0009840396,0.0001575644,0.0008741616,0.000051920797,0.0000068426057,0.0001602111,0.00007684367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752116,0.00015370797,0.0007297701,0.0004697095,0.00037547658,0.000750196],"domain_scores_gemma":[0.99828863,0.0004518836,0.00019644854,0.0005953348,0.00018969654,0.0002779979],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024481106,0.00058596337,0.0007742003,0.00021699682,0.00018161495,0.00006450737,0.00037319667,0.00044058944,0.00006846229],"category_scores_gemma":[0.0000071966374,0.000579106,0.00043440316,0.00037724164,0.0001925189,0.0002579444,0.0000024700755,0.0016071034,0.000012213081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030730228,0.00010659791,0.00027859514,0.000022733582,0.00019352468,0.000018839151,0.000029247318,0.9882973,0.0031385154,0.000005701599,0.000046688532,0.007554974],"study_design_scores_gemma":[0.0021428356,0.00021606073,0.0006368114,0.000069086054,0.0001613289,0.000022985303,0.000020751471,0.99534595,0.0008198325,0.000002153244,0.00006852898,0.0004936745],"about_ca_topic_score_codex":0.00010135052,"about_ca_topic_score_gemma":0.00041199126,"teacher_disagreement_score":0.85588264,"about_ca_system_score_codex":0.00010336664,"about_ca_system_score_gemma":0.000030621515,"threshold_uncertainty_score":0.99966604},"labels":[],"label_agreement":null},{"id":"W2169116170","doi":"10.1109/tnn.2004.839357","title":"Incremental Communication for Adaptive Resonance Theory Networks","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Adaptive resonance theory; Computer science; Convergence (economics); Artificial neural network; Implementation; Process (computing); Communications system; Bounded function; Telecommunications network; Artificial intelligence; Algorithm; Mathematics; Telecommunications","score_opus":0.02048169323534046,"score_gpt":0.25192284606960763,"score_spread":0.23144115283426717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169116170","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.0011469626,0.0008868454,0.993822,0.0022767868,0.00044261682,0.00079487974,0.000012764972,0.00033861518,0.00027852162],"genre_scores_gemma":[0.9743063,0.00035597774,0.021361608,0.0026929094,0.0003397884,0.0005260464,0.000007681674,0.000032590644,0.0003771057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819183,0.00017882127,0.0003882142,0.00053609227,0.00019545043,0.00050960574],"domain_scores_gemma":[0.99800277,0.0006617667,0.00014090093,0.000955294,0.000092142654,0.00014714537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000337559,0.00027453978,0.00022191853,0.00007710609,0.00080888555,0.00014943125,0.0010566257,0.00014708648,0.000024046318],"category_scores_gemma":[0.0000020451168,0.00026388868,0.00020521128,0.00051705405,0.00011404312,0.00062217837,0.000012167127,0.00055154786,0.0000139209305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000725724,0.000102449725,0.00000153269,0.0000010148772,0.000014443565,4.5196342e-7,0.000034958695,0.63277733,0.000023108549,0.013578679,0.0016724288,0.35172102],"study_design_scores_gemma":[0.0005286889,0.00016845118,0.000072747534,0.000026696674,0.000021408898,0.00001226427,0.000013095013,0.99202955,0.0004566646,0.0011204807,0.005268352,0.00028158794],"about_ca_topic_score_codex":0.000009274028,"about_ca_topic_score_gemma":0.00009854704,"teacher_disagreement_score":0.9731593,"about_ca_system_score_codex":0.00009222853,"about_ca_system_score_gemma":0.00001670638,"threshold_uncertainty_score":0.99998134},"labels":[],"label_agreement":null},{"id":"W2169421521","doi":"10.1109/tnn.2009.2016842","title":"Lag Synchronization of Unknown Chaotic Delayed Yang–Yang-Type Fuzzy Neural Networks With Noise Perturbation Based on Adaptive Control and Parameter Identification","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Chaotic; Control theory (sociology); Fuzzy logic; Artificial neural network; Computer science; Synchronization (alternating current); Adaptive control; Perturbation (astronomy); Secure communication; Fuzzy control system; Noise (video); Artificial intelligence; Control (management); Encryption; Telecommunications","score_opus":0.010099435683366529,"score_gpt":0.21201180661893748,"score_spread":0.20191237093557096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169421521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038922366,0.00013507616,0.9576666,0.0013289384,0.0007748482,0.0009138816,0.000008341581,0.00022375632,0.000026240274],"genre_scores_gemma":[0.9974586,0.000050463186,0.0010533483,0.0011567856,0.00013683118,0.000036811998,0.000034545254,0.000032991884,0.000039663002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971375,0.00041676062,0.00063655636,0.0008265172,0.0004842535,0.0004984369],"domain_scores_gemma":[0.99775416,0.0006128246,0.0003660282,0.00071295263,0.00037404595,0.00017999162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028909068,0.00043417848,0.00042710747,0.00023946063,0.00040856283,0.0001973249,0.00038367612,0.00026006612,0.000011070583],"category_scores_gemma":[0.000018681276,0.0003789413,0.00012854466,0.0012841315,0.00015702433,0.0008495347,0.0000035654396,0.0005652832,0.0000020471648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076531695,0.0002487883,0.00006414098,0.000010801644,0.000029981893,0.000006169539,0.000080794925,0.9357463,0.000111088855,0.00052240636,0.000028376848,0.062385842],"study_design_scores_gemma":[0.0014102521,0.0025622924,0.0023140574,0.00006476574,0.00010120332,0.000017220988,0.000008104796,0.99270433,0.00023091525,0.00021425866,0.000004716694,0.00036786956],"about_ca_topic_score_codex":0.0000150606675,"about_ca_topic_score_gemma":0.000059024096,"teacher_disagreement_score":0.9585362,"about_ca_system_score_codex":0.00013066902,"about_ca_system_score_gemma":0.000043498832,"threshold_uncertainty_score":0.99986625},"labels":[],"label_agreement":null},{"id":"W2170857480","doi":"10.1109/tnn.2006.883005","title":"Model Risk for European-Style Stock Index Options","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Valuation of options; Nonparametric statistics; Black–Scholes model; Econometrics; Stochastic volatility; Artificial neural network; Computer science; Parametric statistics; Volatility (finance); Implied volatility; Mathematical optimization; Economics; Mathematics; Artificial intelligence; Statistics","score_opus":0.03438829206074718,"score_gpt":0.23936557050658439,"score_spread":0.2049772784458372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170857480","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.0034395966,0.00026329063,0.9927915,0.00016257721,0.00068641297,0.0004810381,0.00037995577,0.00011995151,0.0016756877],"genre_scores_gemma":[0.99233663,0.00009853883,0.0062437854,0.00031310282,0.00023295167,0.00014167637,0.000010409615,0.000050740782,0.0005721624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986036,0.000004865899,0.0005240703,0.00042403032,0.00003666698,0.00040681372],"domain_scores_gemma":[0.9991303,0.00014692162,0.00022659017,0.00031928788,0.000051981515,0.00012489189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040776972,0.0001827917,0.00023325297,0.00017352273,0.000510519,0.00004957268,0.00022752638,0.00011495248,0.000026075615],"category_scores_gemma":[0.000011422474,0.00021521676,0.00020289072,0.00036640075,0.000055858323,0.00013636988,0.000002047874,0.00036101814,0.00006807382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009027709,0.00019134497,0.00008155477,0.000007561592,0.000031072574,8.292513e-7,0.00008257685,0.9214949,0.00000885524,0.049653154,0.00026601495,0.028091831],"study_design_scores_gemma":[0.00051179534,0.000094424206,0.0007828123,0.0000057940533,0.00001835185,0.0000026028874,0.00001312462,0.9763045,0.00001725755,0.02042937,0.001572488,0.00024747947],"about_ca_topic_score_codex":0.000044358232,"about_ca_topic_score_gemma":0.00009775744,"teacher_disagreement_score":0.988897,"about_ca_system_score_codex":0.000058300513,"about_ca_system_score_gemma":0.00000901486,"threshold_uncertainty_score":0.87762845},"labels":[],"label_agreement":null},{"id":"W2170902875","doi":"10.1109/tnn.2009.2034851","title":"A Dirichlet Process Mixture of Generalized Dirichlet Distributions for Proportional Data Modeling","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Concordia University","funders":"","keywords":"Hierarchical Dirichlet process; Dirichlet process; Dirichlet distribution; Cluster analysis; Gibbs sampling; Concentration parameter; Latent Dirichlet allocation; Mixture model; Generalized Dirichlet distribution; Mathematics; Pattern recognition (psychology); Computer science; Algorithm; Artificial intelligence; Applied mathematics; Bayesian probability; Topic model; Dirichlet series; Mathematical analysis","score_opus":0.04578269611782361,"score_gpt":0.3189366009787135,"score_spread":0.2731539048608899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170902875","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.0012266627,0.00025077493,0.9947136,0.0022736539,0.0005134922,0.000575154,0.00025470852,0.00015706623,0.000034885197],"genre_scores_gemma":[0.7946364,0.0000660504,0.20439434,0.0005381557,0.00014624209,0.000060045993,0.00008856377,0.000013274128,0.000056874982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980525,0.00009940183,0.00047764427,0.00066340284,0.00029553988,0.0004115242],"domain_scores_gemma":[0.9984281,0.0000896938,0.0001496073,0.00097404816,0.00021711468,0.00014140653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034473444,0.00025150058,0.00033007702,0.0001005624,0.00030527406,0.00008166713,0.0010724737,0.00016224342,0.0000072231123],"category_scores_gemma":[0.000008304538,0.00021483938,0.00017312892,0.0005227831,0.000043871372,0.0005895107,0.0000064545516,0.00035174616,5.227436e-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.000112907524,0.00040117893,0.0000012219555,0.000025954676,0.000046545196,0.000004212013,0.000077477314,0.8508575,0.00038787164,0.010365533,0.0011937842,0.13652581],"study_design_scores_gemma":[0.00051386387,0.0001667506,0.000006472836,0.000029662111,0.00005273393,0.000020824145,0.0000015655414,0.9872735,0.00082429795,0.010741117,0.00013827243,0.00023091646],"about_ca_topic_score_codex":0.000005192543,"about_ca_topic_score_gemma":0.0000050266067,"teacher_disagreement_score":0.79340976,"about_ca_system_score_codex":0.000026553767,"about_ca_system_score_gemma":0.00007327527,"threshold_uncertainty_score":0.8760896},"labels":[],"label_agreement":null}]}