{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":71,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":71,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"7785ef991964","filters":{"venue":"Pattern Analysis and Applications"}},"results":[{"id":"W2171498274","doi":"10.1007/s10044-002-0169-3","title":"Large vocabulary off-line handwriting recognition: A survey","year":2003,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Vocabulary; Lexicon; Handwriting; Intelligent character recognition; Handwriting recognition; Key (lock); Natural language processing; Word recognition; Artificial intelligence; Software deployment; Speech recognition; Process (computing); Word (group theory); Line (geometry); Character recognition; Feature extraction; Linguistics; Reading (process); Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02886706353236065,"gpt":0.2801902910180454,"spread":0.2513232274856847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008861933,0.0001415904,0.0002472228,0.0002996908,0.000283627,0.0002184938,0.0002708131,0.00006285479,0.0001687794],"category_scores_gemma":[0.0000444324,0.000141513,0.0001236026,0.001641997,0.00003197829,0.0002034886,0.00008314208,0.00011924,0.00009977875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001475409,"about_ca_system_score_gemma":0.00002102945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008495145,"about_ca_topic_score_gemma":0.0004634061,"domain_scores_codex":[0.9985718,0.0001979766,0.0003290962,0.000488173,0.0001738015,0.0002391613],"domain_scores_gemma":[0.9989027,0.0001504464,0.0001274617,0.0004910392,0.0002053276,0.0001229591],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001010746,0.0002995559,0.07998347,0.00002069062,0.0003678484,0.000004095826,0.0001440997,0.000002155652,0.0002421356,0.003197909,0.0003027577,0.9154343],"study_design_scores_gemma":[0.004461076,0.0004003713,0.5022442,0.0002289974,0.003329195,0.0002295593,0.0008154893,0.1253541,0.09851772,0.07393754,0.1851194,0.005362283],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008993214,0.0002964354,0.9886625,0.0001925455,0.000009720437,0.000220959,0.0001007471,0.0001962279,0.001327686],"genre_scores_gemma":[0.9871905,0.0002975621,0.01100031,0.0007206158,0.00004043575,0.0003380431,0.0002766949,0.000009940047,0.0001259019],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9781973,"threshold_uncertainty_score":0.5770732,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092353981","doi":"10.1007/s10044-003-0191-0","title":"A brief taxonomy and ranking of creative prototype reduction schemes","year":2003,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; sort; Ranking (information retrieval); Reduction (mathematics); Taxonomy (biology); Set (abstract data type); Data reduction; Artificial intelligence; Class (philosophy); Machine learning; Data mining; Pattern recognition (psychology); Information retrieval; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02025541410322381,"gpt":0.2641137965063549,"spread":0.2438583824031311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001782221,0.00005783982,0.0001172976,0.0001278878,0.0001092794,0.00005881875,0.00009334963,0.00002045424,0.00001389971],"category_scores_gemma":[0.00001386397,0.00005241771,0.00003096321,0.0005751369,0.00004092342,0.0001156921,0.00002740372,0.00004961284,0.000001788859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005008712,"about_ca_system_score_gemma":0.00001089974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001362164,"about_ca_topic_score_gemma":0.00001094528,"domain_scores_codex":[0.999423,0.00005161445,0.0001428879,0.0002504422,0.00007012237,0.00006195241],"domain_scores_gemma":[0.9994854,0.0000232317,0.0001237096,0.0002803612,0.0000528109,0.00003451736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00000241212,0.000095957,0.1512158,0.0000379984,0.0002521229,1.021713e-7,0.0003149908,0.00003636082,0.002278652,0.1105338,0.00002429382,0.7352075],"study_design_scores_gemma":[0.001159838,0.0001712842,0.5671945,0.00005254282,0.00123235,0.0000280634,0.0006240052,0.1213181,0.01948551,0.006902289,0.2810299,0.0008016918],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01246238,0.0001308996,0.985604,0.0001926911,0.000003087445,0.0002695846,0.000003665085,0.00002159023,0.001312105],"genre_scores_gemma":[0.9871511,0.00005802764,0.01232689,0.00001996671,0.00001097035,0.0003473592,0.00001914524,0.000002132551,0.00006442167],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9746887,"threshold_uncertainty_score":0.2137532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151096815","doi":"10.1007/pl00010988","title":"Endocardial Boundary E timation and Tracking in Echocardiographic Images using Deformable Template and Markov Random Fields","year":2001,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Montreal Heart Institute; Computer Research Institute of Montréal","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Artificial intelligence; Markov random field; Segmentation; Image segmentation; Pattern recognition (psychology); Active contour model; Hidden Markov model; Prior probability; Computer science; Computer vision; Tracking (education); Point distribution model; Level set (data structures); Boundary (topology); Mathematics; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.0133095999705841,"gpt":0.2882200417957176,"spread":0.2749104418251335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366606,0.00008864965,0.0001998789,0.0003742253,0.0001675362,0.000331368,0.0001014308,0.00003975085,0.000008950024],"category_scores_gemma":[0.000007491025,0.0000831861,0.00005532962,0.0007826196,0.00006782107,0.0005051923,0.00007636919,0.00008697731,7.393505e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001123861,"about_ca_system_score_gemma":0.000008665626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003188407,"about_ca_topic_score_gemma":0.00006398409,"domain_scores_codex":[0.9991832,0.00005614277,0.0002322817,0.0002708027,0.0001268941,0.0001306741],"domain_scores_gemma":[0.9995608,0.00007225628,0.00007637218,0.0001904528,0.00003076268,0.00006933863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003483983,0.00002285195,0.1830606,0.00002200903,0.000123876,0.000004731899,0.0002122133,0.00006948624,0.001140721,0.00003653605,0.00002166562,0.8152818],"study_design_scores_gemma":[0.002090578,0.00004061357,0.4231471,0.0000599118,0.0006845383,0.0001041571,0.0001916764,0.5629509,0.005294362,0.004252148,0.0006203449,0.0005636056],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08100115,0.0003633371,0.9180935,0.0001545304,0.000006145189,0.0001940772,0.00000401848,0.00004281595,0.000140419],"genre_scores_gemma":[0.9730347,0.001192896,0.0254424,0.0002040667,0.00002289634,0.00007713143,0.0000153171,0.000003788854,0.000006794769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8926511,"threshold_uncertainty_score":0.339223,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077649826","doi":"10.1007/s10044-005-0252-7","title":"A multi-population genetic algorithm for robust and fast ellipse detection","year":2005,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Ellipse; Artificial intelligence; Hough transform; Genetic algorithm; Pattern recognition (psychology); Computer science; Cluster analysis; Algorithm; Noise (video); Population; Image (mathematics); Computer vision; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01133171118335079,"gpt":0.2518491895343575,"spread":0.2405174783510067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008654097,0.00008492874,0.0001163416,0.0002195546,0.0002276349,0.0001389874,0.0001018925,0.00004005314,0.000002963738],"category_scores_gemma":[0.000002257817,0.00008266637,0.00006581249,0.0004572622,0.00001615406,0.0001609005,0.00003929677,0.00004288667,0.000003093029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001955084,"about_ca_system_score_gemma":0.000002857053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002109171,"about_ca_topic_score_gemma":0.000483841,"domain_scores_codex":[0.9993317,0.00001651381,0.0001696071,0.0003096398,0.00006599057,0.0001065469],"domain_scores_gemma":[0.9995631,0.00002301623,0.00007536021,0.0002306225,0.00005729317,0.00005058276],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.097651e-7,0.0000222186,0.0008853676,0.000003468657,0.00003336331,5.002904e-8,0.00004013155,0.0001194114,0.0005253511,0.00000598812,0.000003749651,0.9983607],"study_design_scores_gemma":[0.0001397896,0.00001933707,0.04580134,0.000001351205,0.0001356687,0.000003957633,0.00001427262,0.9377775,0.01467542,0.0001335212,0.001179395,0.000118464],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002349945,0.0001161991,0.9969772,0.0001288838,0.000006853999,0.0002892244,0.000006906629,0.0001168084,0.000007986734],"genre_scores_gemma":[0.6123543,0.0000829666,0.3869022,0.0001186128,0.00007955777,0.0003748942,0.000009223162,0.000005071328,0.00007319336],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9982422,"threshold_uncertainty_score":0.3371037,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036578773","doi":"10.1007/s10044-012-0307-5","title":"Bayesian classification and unsupervised learning for isolating weeds in row crops","year":2012,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Remote Sensing in Agriculture","field":"Environmental Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Agriculture and Agri-Food Canada; Université Laval","funders":"Agriculture and Agri-Food Canada","keywords":"Pattern recognition (psychology); Artificial intelligence; Weed; Cluster analysis; Classifier (UML); Computer science; Unsupervised learning; Bayesian probability; Feature extraction; Mathematics; Machine learning; Agronomy; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.0116826153286394,"gpt":0.2409331729865128,"spread":0.2292505576578734,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001747605,0.00007481974,0.0001095659,0.00005174592,0.000184103,0.00004107532,0.00004708044,0.00004367978,0.00004834117],"category_scores_gemma":[0.000009622485,0.00006257163,0.00003691838,0.0004735117,0.000043427,0.0000970524,0.00003381231,0.00007446435,0.00001031988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003090756,"about_ca_system_score_gemma":8.943616e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000357155,"about_ca_topic_score_gemma":0.0005401872,"domain_scores_codex":[0.9994013,0.00002957776,0.0001465629,0.0001994853,0.00007219152,0.0001508594],"domain_scores_gemma":[0.9996991,0.00005019782,0.00006595397,0.0001106234,0.000006268804,0.00006786034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[5.398755e-7,0.0000242423,0.8882805,0.000004309587,0.0000178916,1.696517e-8,0.0002901211,0.0004780243,0.01173606,0.00002417963,0.00001412246,0.09912997],"study_design_scores_gemma":[0.00007782486,0.000004828015,0.8620281,0.000002622492,0.00009856428,7.681861e-7,0.0002824272,0.1354872,0.0001399771,0.00003987168,0.001756344,0.0000815145],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4912499,0.00005537238,0.5072352,0.0003900476,0.000004347655,0.000222804,0.000002150814,0.00001680863,0.0008233495],"genre_scores_gemma":[0.997013,0.00002473454,0.002661454,0.00006586673,0.00004346896,0.00003336937,0.00004002584,0.000005801244,0.0001122256],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5057631,"threshold_uncertainty_score":0.2551597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060556149","doi":"10.1007/s10044-008-0111-4","title":"On Bayesian analysis of a finite generalized Dirichlet mixture via a Metropolis-within-Gibbs sampling","year":2008,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke; Concordia University","funders":"","keywords":"Dirichlet distribution; Gibbs sampling; Conjugate prior; Mathematics; Hierarchical Dirichlet process; Metropolis–Hastings algorithm; Generalized Dirichlet distribution; Latent Dirichlet allocation; Kernel (algebra); Applied mathematics; Bayesian probability; Pattern recognition (psychology); Computer science; Artificial intelligence; Algorithm; Statistics; Posterior probability; Markov chain Monte Carlo; Topic model; Dirichlet's energy; Combinatorics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02449743636263198,"gpt":0.2922775395972536,"spread":0.2677801032346216,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003479118,0.0002265118,0.0007208004,0.001237613,0.0002833618,0.0000677151,0.0005385085,0.00009374013,0.00005052088],"category_scores_gemma":[0.00001969058,0.0001878675,0.0005425556,0.00585479,0.00008317703,0.000100805,0.0001151199,0.0001526562,0.000004342291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000224125,"about_ca_system_score_gemma":0.00002451405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004388175,"about_ca_topic_score_gemma":0.0002058167,"domain_scores_codex":[0.9980947,0.0001522551,0.0005284224,0.0006693059,0.0003119336,0.0002433701],"domain_scores_gemma":[0.9980926,0.0002353952,0.000330972,0.001040819,0.0001255409,0.0001747106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003661118,0.001540823,0.09275573,0.0001098019,0.03478738,0.00002675192,0.006506668,0.03677123,0.008125968,0.3863713,0.0004708662,0.4324969],"study_design_scores_gemma":[0.000301823,0.00004081285,0.02029153,0.000007127809,0.005217182,0.00000428215,0.00001279666,0.9595532,0.001345529,0.01215691,0.0006611017,0.0004077376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01034166,0.0001961025,0.9885517,0.0003404028,0.00001510082,0.0001703549,0.00006227932,0.00005254511,0.0002698934],"genre_scores_gemma":[0.765613,0.0001049377,0.2332534,0.0007166491,0.00003925332,0.00008973679,0.00007052508,0.000009472137,0.00010303],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9227819,"threshold_uncertainty_score":0.7661015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043650904","doi":"10.1007/s10044-014-0367-9","title":"Topology-oriented self-organizing maps: a survey","year":2014,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Self-organizing map; Resource (disambiguation); Artificial intelligence; Tree (set theory); Asset (computer security); Architecture; Data science; Artificial neural network; Geography; Computer security; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01083747804990627,"gpt":0.2440613321117897,"spread":0.2332238540618835,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002812348,0.0001111323,0.0001914227,0.0001294081,0.0002898671,0.0001178059,0.0003988565,0.0000408629,0.00001641559],"category_scores_gemma":[0.000005623928,0.0001002494,0.00007253965,0.001683863,0.00003373699,0.00008970856,0.000160086,0.00008471658,0.00005293626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000010395,"about_ca_system_score_gemma":0.000007518366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002713842,"about_ca_topic_score_gemma":0.0003214223,"domain_scores_codex":[0.9989586,0.00008430174,0.0002135315,0.0004475878,0.0001061278,0.0001897825],"domain_scores_gemma":[0.9989082,0.0001529469,0.00009814985,0.0006487733,0.00008146116,0.0001104749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00000107121,0.0003389427,0.470563,0.00001673755,0.0006366822,6.130293e-7,0.0003015233,0.0002179203,0.0007731937,0.1689432,0.002157875,0.3560492],"study_design_scores_gemma":[0.0003337398,0.00003800765,0.6372274,0.000004857608,0.0004565043,0.000007151627,0.00003099479,0.2115105,0.000616576,0.005393099,0.1438302,0.0005509831],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01102038,0.00004205398,0.9867806,0.00137461,0.00001516698,0.0001465948,0.00001383453,0.000155765,0.0004509298],"genre_scores_gemma":[0.9929844,0.00004460121,0.005831802,0.0007067077,0.0001060198,0.0001509029,0.00007746513,0.000006577186,0.00009155541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.981964,"threshold_uncertainty_score":0.4088052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998227249","doi":"10.1007/s10044-008-0120-3","title":"Towards a measure of biometric feature information","year":2008,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Biometrics; Pattern recognition (psychology); Feature (linguistics); Artificial intelligence; Entropy (arrow of time); Linear discriminant analysis; Population; Measure (data warehouse); Computer science; Mathematics; Facial recognition system; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.01859572080059288,"gpt":0.2433341003508717,"spread":0.2247383795502788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001684745,0.0000657441,0.000150259,0.001581583,0.0001329731,0.00005939566,0.0003199319,0.00004875868,0.00001535438],"category_scores_gemma":[0.00001666413,0.00005769704,0.00009932824,0.01030118,0.00004535037,0.0002932753,0.00006605876,0.0000549798,0.00002191892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001213517,"about_ca_system_score_gemma":0.00002518917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001618659,"about_ca_topic_score_gemma":0.00001161682,"domain_scores_codex":[0.9992718,0.00002141911,0.0002101657,0.0001555275,0.0002578423,0.00008328746],"domain_scores_gemma":[0.9991549,0.00002182924,0.0001521697,0.0003975435,0.0002100247,0.00006356119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[7.590818e-7,0.0001186552,0.03968619,0.00002771546,0.0002725074,2.856227e-7,0.0006927263,0.000006759871,0.0003024919,0.008092633,0.0009739862,0.9498253],"study_design_scores_gemma":[0.0002877578,0.00001927579,0.902093,0.000003338874,0.000234693,0.000012088,0.00006039111,0.02037959,0.002903469,0.0004012797,0.07336769,0.0002374128],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006262507,0.000230595,0.9920004,0.0006972856,0.00001229779,0.0001121866,0.00002758235,0.00003598662,0.0006211286],"genre_scores_gemma":[0.9951513,0.0001697979,0.00435792,0.0001492971,0.00001260425,0.00004099857,0.00005541165,0.000001341819,0.00006128046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9888889,"threshold_uncertainty_score":0.4949376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007769114","doi":"10.1007/s10044-006-0028-8","title":"Rotation invariant feature extraction using Ridgelet and Fourier transforms","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pattern recognition (psychology); Fourier transform; Artificial intelligence; Invariant (physics); Short-time Fourier transform; Feature extraction; Fractional Fourier transform; Mathematics; Rotation (mathematics); S transform; Gaussian; Noise (video); Computer science; Computer vision; Fourier analysis; Wavelet transform; Image (mathematics); Physics; Mathematical analysis; Wavelet; Discrete wavelet transform","retraction":null,"screen_n_in":null,"score":{"opus":0.01248287243295153,"gpt":0.2647739473047341,"spread":0.2522910748717825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001276083,0.0000845465,0.0001149718,0.0001637295,0.000203535,0.000190784,0.00010598,0.0000492815,0.000008111181],"category_scores_gemma":[0.000001646252,0.00007182891,0.00005359395,0.0007400785,0.00003093429,0.000284005,0.00002015267,0.00006946083,0.000002301117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001688653,"about_ca_system_score_gemma":0.000009644179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002711342,"about_ca_topic_score_gemma":0.00006951041,"domain_scores_codex":[0.9993352,0.00002050782,0.0001535764,0.0002737598,0.0001204209,0.00009653962],"domain_scores_gemma":[0.9995642,0.00002215092,0.00009025056,0.0002216014,0.00006176354,0.00004006976],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002473911,0.0001377683,0.01555507,0.00003193739,0.0001526882,0.000001528708,0.0001457163,0.00004955988,0.06039478,0.03419512,0.0001224744,0.8892109],"study_design_scores_gemma":[0.0003312976,0.00002781963,0.2626364,0.00001275133,0.0006477035,0.00003267976,0.00006475607,0.6520754,0.05981676,0.01060605,0.01326568,0.0004826803],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008203891,0.000127164,0.9900513,0.001134406,0.000005141254,0.0001732776,0.000009039079,0.0000620069,0.000233805],"genre_scores_gemma":[0.9797354,0.00008437921,0.01977132,0.0001085821,0.00005358058,0.00007403343,0.00004220425,0.000004300599,0.0001261868],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9715315,"threshold_uncertainty_score":0.2929098,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973759055","doi":"10.1007/s100440070003","title":"An HMM-MLP Hybrid Model for Cursive Script Recognition","year":2000,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Kyungil University","keywords":"Cursive; Hidden Markov model; Computer science; Pattern recognition (psychology); Artificial intelligence; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.02367950298016299,"gpt":0.2816651684398643,"spread":0.2579856654597013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000165593,0.0001207423,0.0001818907,0.0002201903,0.0002315927,0.000203146,0.0003480503,0.00003804344,0.000125421],"category_scores_gemma":[0.000002818757,0.0001217076,0.0001330119,0.0005037763,0.00003506973,0.0003844103,0.00002448538,0.00006364378,0.00005771587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000166701,"about_ca_system_score_gemma":0.00001453821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005250483,"about_ca_topic_score_gemma":0.00005258145,"domain_scores_codex":[0.9989535,0.00003084231,0.0002322056,0.0004865869,0.0001193049,0.000177604],"domain_scores_gemma":[0.9991353,0.0000332757,0.00007654407,0.0004832754,0.0001504974,0.0001210655],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001138971,0.00009380476,0.000179321,0.000005465154,0.00008326764,1.989492e-7,0.00009139929,0.00009309489,0.0003316618,0.00044924,0.0002563336,0.9984151],"study_design_scores_gemma":[0.0001482972,0.00003469571,0.0004066632,0.000005798554,0.0003121758,0.000003484084,0.00001484505,0.9468176,0.006369988,0.043896,0.001769936,0.0002204784],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009972707,0.0000337363,0.9882452,0.0004466292,0.000004485584,0.0004238558,0.000183115,0.0002140185,0.0004761842],"genre_scores_gemma":[0.9423528,0.0002340479,0.05423729,0.001021031,0.00006623003,0.001441629,0.00043189,0.00001088268,0.0002041994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9981946,"threshold_uncertainty_score":0.4963092,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1656023708","doi":"10.1007/s10044-015-0492-0","title":"Automated hippocampal segmentation in 3D MRI using random undersampling with boosting algorithm","year":2015,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"National Institute on Aging; National Institute of Biomedical Imaging and Bioengineering; Canadian Institutes of Health Research; National Institutes of Health; Genentech; IXICO; Servier; Eisai; Northern California Institute for Research and Education; University of California, San Diego; Pfizer; Biogen; BioClinica; Alzheimer's Disease Neuroimaging Initiative; Eli Lilly and Company; U.S. Department of Defense; Meso Scale Diagnostics; Synarc; University of Southern California; Medpace; Novartis Pharmaceuticals Corporation; Bristol-Myers Squibb; F. Hoffmann-La Roche; Alzheimer's Drug Discovery Foundation; University of California, San Francisco; Foundation for the National Institutes of Health","keywords":"Undersampling; Boosting (machine learning); Pattern recognition (psychology); Artificial intelligence; Segmentation; Computer science; Algorithm; Hippocampal formation; Random forest; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.03224919150146756,"gpt":0.3183575597015484,"spread":0.2861083682000808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003903086,0.0001016334,0.0001855883,0.0003033178,0.00009400151,0.0001684409,0.0001821885,0.00003115457,0.00000733665],"category_scores_gemma":[0.000009175912,0.00008866537,0.00003003531,0.001319892,0.00004242488,0.0002737594,0.00006526636,0.0000755988,0.000003553269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000714194,"about_ca_system_score_gemma":0.00003971697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004836211,"about_ca_topic_score_gemma":0.00009841025,"domain_scores_codex":[0.9989322,0.00006928346,0.0002742727,0.0003233176,0.000249742,0.0001512133],"domain_scores_gemma":[0.9993424,0.00007455144,0.0001398499,0.0002357029,0.00008548939,0.0001220415],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004798117,0.0001312437,0.04564197,0.00001969518,0.0002479769,0.000007240148,0.001480999,0.008842665,0.001885606,0.00006405346,0.00005172752,0.941622],"study_design_scores_gemma":[0.000649152,0.00001376091,0.001821716,0.00001359013,0.0001120075,0.000004354361,0.0002980626,0.994903,0.001855596,0.0001959666,0.00001350157,0.0001193283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003987968,0.00003934693,0.9952041,0.0001747394,0.000006877032,0.0002890641,0.000003541965,0.0002564341,0.00003794632],"genre_scores_gemma":[0.3015001,0.00001247612,0.6979319,0.0003412213,0.00002457272,0.0001273347,0.00004864387,0.000006828278,0.000006894928],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9860603,"threshold_uncertainty_score":0.3615669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159760851","doi":"10.1007/s10044-005-0020-8","title":"Concealed weapon detection and visualization in a synthesized image","year":2005,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Army Research Office","keywords":"Artificial intelligence; Computer vision; Computer science; Image fusion; Visualization; Pixel; Image (mathematics); Cluster analysis; Process (computing); Feature detection (computer vision); Pattern recognition (psychology); Image processing","retraction":null,"screen_n_in":null,"score":{"opus":0.004138618208844329,"gpt":0.2524191939722611,"spread":0.2482805757634168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006179493,0.00007234532,0.0001286327,0.0002099137,0.0000408645,0.00002767068,0.00003114019,0.00003071861,0.00002830382],"category_scores_gemma":[0.000005806297,0.0000752509,0.00002419773,0.0004457836,0.00002179807,0.0001044129,0.00001291275,0.00004544566,0.000004332817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002349818,"about_ca_system_score_gemma":0.000001081713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002892324,"about_ca_topic_score_gemma":0.0003705378,"domain_scores_codex":[0.9995687,0.00001318379,0.0001585369,0.0001383958,0.00004516648,0.0000760099],"domain_scores_gemma":[0.9997805,0.00003093755,0.00002748569,0.0001123034,0.00001802819,0.00003072617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001598093,0.0000242609,0.004357172,0.00002235453,0.00005052278,2.61067e-7,0.0001019945,0.0003856085,0.2074628,0.00005421968,0.000008619318,0.7875306],"study_design_scores_gemma":[0.0003541222,0.00001094919,0.04913335,0.0000162241,0.0002583241,0.000002858134,0.0001415195,0.7877989,0.1573455,0.0003206992,0.004321624,0.0002959453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09582854,0.000156354,0.9034508,0.00003774211,0.00000180014,0.0001594286,0.000005896847,0.0001526483,0.0002067879],"genre_scores_gemma":[0.9964718,0.0005250661,0.00267352,0.00003320981,0.0000242712,0.0002325403,0.00001254974,0.00001044989,0.00001660996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9007773,"threshold_uncertainty_score":0.3068643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977336359","doi":"10.1007/s10044-011-0229-7","title":"Iris recognition using shape-guided approach and game theory","year":2011,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Biometric Identification and Security","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Artificial intelligence; Computer science; Iris recognition; Pattern recognition (psychology); Computer vision; Eyelash; Biometrics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1049174784842013,"gpt":0.284609656669814,"spread":0.1796921781856126,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003507603,0.00008427824,0.0001384379,0.0004419781,0.0001503103,0.0001370301,0.0002128599,0.00004543805,0.00005870574],"category_scores_gemma":[0.000007207387,0.00007804261,0.00006273988,0.001708899,0.00006270769,0.0001621646,0.00009366505,0.00005879588,0.00001606769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001018251,"about_ca_system_score_gemma":0.000007908945,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001813204,"about_ca_topic_score_gemma":0.000007394932,"domain_scores_codex":[0.9991373,0.00006583605,0.0002006189,0.0003780186,0.0001077508,0.000110439],"domain_scores_gemma":[0.9993457,0.00003218999,0.00010509,0.0003536994,0.00007832722,0.00008502857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000109743,0.0001887529,0.0164395,0.00002146343,0.0002542438,3.746181e-7,0.001297509,0.00000146378,0.0003524495,0.00952363,0.00003733391,0.9718822],"study_design_scores_gemma":[0.0003966797,0.00001836883,0.2641447,0.00000711444,0.001088579,0.00002848518,0.0004038248,0.7017059,0.001123508,0.02773509,0.002764739,0.0005829894],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0370312,0.0001582157,0.9615756,0.00004938522,0.000008237892,0.0001351817,0.00001352487,0.00004617098,0.0009824623],"genre_scores_gemma":[0.9714202,0.00009758276,0.02810518,0.000206153,0.0000220926,0.00006190679,0.00003900212,0.00000397617,0.0000438918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9712992,"threshold_uncertainty_score":0.3182485,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2889064910","doi":"10.1007/s10044-018-0747-7","title":"Gabor filter-based texture for ancient degraded document image binarization","year":2018,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; McGill University","funders":"Ministère de l'Enseignement Supérieur et de la Recherche","keywords":"Artificial intelligence; Gabor filter; Computer science; Pattern recognition (psychology); Preprocessor; Computer vision; Filter (signal processing); Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01281852346325284,"gpt":0.2781765914422702,"spread":0.2653580679790173,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001800485,0.000115893,0.0001571154,0.0002813725,0.000258677,0.0002479608,0.0003101865,0.00004600693,0.00005437628],"category_scores_gemma":[0.000008886224,0.0001031952,0.0001167196,0.001070229,0.00006694743,0.0001622661,0.00005838905,0.00004233812,0.00002842173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002541123,"about_ca_system_score_gemma":0.00002155544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000351009,"about_ca_topic_score_gemma":0.00006300864,"domain_scores_codex":[0.9990094,0.00002889692,0.0002209711,0.0004268174,0.0001417771,0.0001721165],"domain_scores_gemma":[0.999023,0.00004346845,0.0001209977,0.0004649233,0.0002615119,0.00008614618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004277058,0.0002744178,0.005323446,0.00005079264,0.0002316987,5.810098e-7,0.0002820671,0.00000599809,0.01652897,0.005623233,0.002013004,0.9696615],"study_design_scores_gemma":[0.001461717,0.0004747778,0.04214451,0.00006098204,0.001220588,0.000004970065,0.00007881007,0.5060285,0.3199775,0.01759402,0.1097987,0.001154878],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002010553,0.00004396405,0.9957403,0.001357477,0.00001237553,0.0004959494,0.00004208239,0.0001656101,0.0001316791],"genre_scores_gemma":[0.9234537,0.00001176179,0.07386218,0.001209012,0.00008930282,0.001155516,0.0001321267,0.000007753473,0.00007861324],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9685066,"threshold_uncertainty_score":0.4208178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321788863","doi":"10.1007/s10044-023-01148-w","title":"Bounded multivariate generalized Gaussian mixture model using ICA and IVA","year":2023,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Independent component analysis; Mixture model; Bounded function; Computer science; Gaussian; Pattern recognition (psychology); Multivariate statistics; Component analysis; Artificial intelligence; Principal component analysis; Covariance; Independence (probability theory); Cluster analysis; Component (thermodynamics); Mathematics; Algorithm; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03369455221902559,"gpt":0.3169119121925454,"spread":0.2832173599735198,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001889426,0.0001015377,0.0001701597,0.0002920814,0.000239983,0.0002669043,0.0002098582,0.00005295514,0.000004838437],"category_scores_gemma":[0.000003291634,0.00009219124,0.00006542428,0.001231153,0.0000336216,0.0001485168,0.0001519728,0.00007110302,0.0000065742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001052019,"about_ca_system_score_gemma":0.0000164858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002019168,"about_ca_topic_score_gemma":0.00007603077,"domain_scores_codex":[0.9991507,0.00004647454,0.0001792594,0.0003648901,0.0001209459,0.0001377433],"domain_scores_gemma":[0.9993683,0.00002818295,0.00008259718,0.0003981499,0.00004169664,0.00008112302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008915109,0.0004413157,0.0294682,0.0001215915,0.002383502,0.00001029973,0.01367747,0.05257077,0.1008125,0.4568283,0.001566993,0.3421101],"study_design_scores_gemma":[0.00009975646,0.00000296689,0.004264294,0.000002450617,0.0001025527,0.000001151524,0.00001545208,0.98278,0.000710592,0.01128941,0.0006147574,0.0001166253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04361698,0.00003046918,0.9543582,0.001448145,0.000003686919,0.0001545848,0.00001280331,0.0002348349,0.0001402732],"genre_scores_gemma":[0.9390913,0.00008103739,0.05994381,0.0005483836,0.00002137464,0.00009778292,0.00003713469,0.000007411354,0.0001717678],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9302092,"threshold_uncertainty_score":0.3759449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2946689049","doi":"10.1007/s10044-020-00901-9","title":"Spatio-temporal adversarial learning for detecting unseen falls","year":2020,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Toronto Rehabilitation Institute; University Health Network","funders":"","keywords":"Autoencoder; Adversarial system; Classifier (UML); Deep learning; Rendering (computer graphics); Modalities; Class (philosophy); Adversarial machine learning; Feature learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03176615309929862,"gpt":0.2679380683893751,"spread":0.2361719152900765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001746721,0.00009665205,0.0002151429,0.0001069801,0.0002464986,0.0001935626,0.0002388996,0.0000364853,0.000015696],"category_scores_gemma":[0.00003384744,0.00009992331,0.0001477141,0.0007495352,0.00001462093,0.0001889793,0.00009375659,0.00009014511,0.00002745146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001371245,"about_ca_system_score_gemma":0.00001702952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002351621,"about_ca_topic_score_gemma":0.000314986,"domain_scores_codex":[0.9990476,0.00005576361,0.0002311548,0.0004054078,0.0001246859,0.0001354147],"domain_scores_gemma":[0.9992396,0.0001924473,0.0001710645,0.0001936286,0.00009343476,0.0001098434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004453317,0.00002855445,0.12819,0.00002859213,0.0003240897,4.937931e-7,0.001118123,0.0002340975,0.0005080523,0.0002500885,0.00004249091,0.869271],"study_design_scores_gemma":[0.0007823273,0.00008915424,0.01210079,0.00001045905,0.000526776,0.000002809656,0.0004763305,0.9279351,0.001613045,0.0003181306,0.0556938,0.0004512274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01035058,0.00002348635,0.9877846,0.001265718,0.00001576143,0.0003287274,0.00001252203,0.0001167792,0.0001018485],"genre_scores_gemma":[0.9958867,0.000003687822,0.003215714,0.0003358384,0.0002028132,0.0002559695,0.00005510859,0.000006815195,0.0000373379],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9855362,"threshold_uncertainty_score":0.4074754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974230797","doi":"10.1007/s10044-007-0060-3","title":"Periodicity and stability issues of a chaotic pattern recognition neural network","year":2007,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Chaotic; Artificial neural network; Eigenvalues and eigenvectors; Computer science; Stability (learning theory); Lyapunov exponent; Control theory (sociology); Artificial intelligence; Pattern recognition (psychology); Topology (electrical circuits); Mathematics; Control (management); Machine learning; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02468098660401145,"gpt":0.2704438658288962,"spread":0.2457628792248847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638717,0.0001193198,0.0002423778,0.00009295047,0.0002156984,0.00008686902,0.0002166801,0.00004184549,0.0000247489],"category_scores_gemma":[0.00000350982,0.0001081793,0.00008694694,0.0009765265,0.0001026002,0.0001194919,0.000131203,0.00009329665,0.000003847255],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000832024,"about_ca_system_score_gemma":0.000005146921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003414404,"about_ca_topic_score_gemma":0.0006096975,"domain_scores_codex":[0.9988641,0.00003697017,0.0003398191,0.0004120942,0.0001359269,0.0002110545],"domain_scores_gemma":[0.999081,0.0001166676,0.0001604776,0.0004400874,0.0000880795,0.0001136573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.000001429586,0.00008644778,0.1988928,0.00002280294,0.00009157922,4.894455e-7,0.000189536,0.00007734552,0.0004506211,0.0004762112,0.00002976774,0.799681],"study_design_scores_gemma":[0.0002300324,0.00005379228,0.8493076,0.00001504326,0.0004031154,0.00000693953,0.0001106632,0.1426274,0.001417825,0.004075256,0.001408652,0.0003437466],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3238958,0.0002465078,0.6748261,0.000738037,0.000007975776,0.00018928,0.00001429148,0.00003333589,0.00004862474],"genre_scores_gemma":[0.9972087,0.0001515265,0.0021398,0.0002721575,0.0001116802,0.0000727173,0.00003171437,0.000004769785,0.000006928055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7993372,"threshold_uncertainty_score":0.4411424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913645927","doi":"10.1007/s10044-019-00790-7","title":"Applying adversarial auto-encoder for estimating human walking gait abnormality index","year":2019,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Gait Recognition and Analysis","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Abnormality; Point cloud; Point (geometry); Gait; Perspective (graphical); Adversarial system; Pattern recognition (psychology); Index (typography)","retraction":null,"screen_n_in":null,"score":{"opus":0.01151257743378788,"gpt":0.2560082191448838,"spread":0.2444956417110959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001815714,0.0001437804,0.0002884408,0.0002369844,0.00021106,0.0001058469,0.0001074812,0.00006161696,0.0003015173],"category_scores_gemma":[0.000003843179,0.0001472038,0.0002250048,0.0005191769,0.00001697343,0.00009876081,0.00002712517,0.0001018543,0.0000393678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002690967,"about_ca_system_score_gemma":0.000004235215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001055176,"about_ca_topic_score_gemma":0.0001236586,"domain_scores_codex":[0.9990889,0.00001390585,0.000309073,0.0002700648,0.0001209008,0.0001971365],"domain_scores_gemma":[0.9994939,0.00006063587,0.00007573082,0.0002371795,0.00005533838,0.00007719992],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003378141,0.0001099839,0.2955665,0.0004413757,0.003134038,7.004132e-7,0.0004115462,0.1207235,0.006580988,0.0005868869,0.0001754731,0.5722656],"study_design_scores_gemma":[0.0003060868,0.00000458249,0.01564948,0.00001161028,0.0008430485,7.400011e-7,0.0001465163,0.9800357,0.0001824982,0.0003871291,0.002202908,0.0002297246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06832945,0.00002761478,0.9296694,0.0000224505,0.00002760838,0.0004602403,0.00004332112,0.0001446939,0.001275155],"genre_scores_gemma":[0.9954381,0.000006804047,0.003020559,0.00008500592,0.0001543156,0.000904961,0.0002580087,0.00001859862,0.000113662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9271086,"threshold_uncertainty_score":0.6002795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000218629","doi":"10.1007/s10044-006-0023-0","title":"A new approach for breast skin-line estimation in mammograms","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"AI in cancer detection","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Line (geometry); Thresholding; Pixel; Artificial intelligence; Boundary (topology); Standard deviation; Computer science; Ground truth; Pattern recognition (psychology); Euclidean distance; Enhanced Data Rates for GSM Evolution; Mathematics; Computer vision; Image (mathematics); Statistics; Geometry; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01149908097912117,"gpt":0.2594957440866683,"spread":0.2479966631075471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001169282,0.00007389422,0.0001228113,0.0002069318,0.00007506734,0.0001081704,0.0001849799,0.00003244232,0.000007146929],"category_scores_gemma":[9.601315e-7,0.00007293262,0.00006926896,0.001185928,0.00001173237,0.0001199798,0.00003490314,0.00004005561,0.000004666676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003457059,"about_ca_system_score_gemma":0.00001311767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001629066,"about_ca_topic_score_gemma":0.0006930201,"domain_scores_codex":[0.9992691,0.0000116792,0.0001867042,0.000327263,0.00009164571,0.0001136524],"domain_scores_gemma":[0.9995319,0.00002651727,0.00007743578,0.0002951523,0.00003160962,0.00003742585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.572065e-7,0.00005180454,0.007946063,0.000008815132,0.00003171856,4.519883e-8,0.0000262148,0.01448618,0.00005661791,0.001796808,0.00007563821,0.9755191],"study_design_scores_gemma":[0.0001862635,0.000005926938,0.06402218,0.000001755983,0.00008660383,0.000003447768,0.000007331704,0.9303793,0.0002080585,0.00447248,0.0005317588,0.00009491246],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000939812,0.00003672159,0.9980251,0.0004390515,0.000006794536,0.0002755359,0.0000125698,0.000044829,0.0002195631],"genre_scores_gemma":[0.8434645,0.000005339221,0.1557608,0.00005047687,0.00007865959,0.0004126358,0.00007266324,0.000004410675,0.0001504729],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9754242,"threshold_uncertainty_score":0.2974106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058372030","doi":"10.1007/s10044-002-0182-6","title":"MDL estimation of a dense map of relative depth and 3D motion from a temporal sequence of images","year":2003,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Vision and Imaging","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Optical flow; Mathematics; Minimum description length; Motion estimation; Motion (physics); Boundary (topology); Sequence (biology); Algorithm; Stereoscopy; Depth map; Artificial intelligence; Computer vision; Computer science; Image (mathematics); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01793122051175456,"gpt":0.2959869581346372,"spread":0.2780557376228827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001038218,0.00005796739,0.0001758101,0.0001298661,0.0000383214,0.0000128341,0.0000847757,0.00001669061,0.000007242683],"category_scores_gemma":[0.00001622796,0.00005250085,0.00004278094,0.0003971545,0.00007328153,0.0002114669,0.00003382469,0.00003303368,8.748002e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005510128,"about_ca_system_score_gemma":0.000008732625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002585948,"about_ca_topic_score_gemma":0.00003026381,"domain_scores_codex":[0.9993766,0.00003907263,0.0002463904,0.0001889077,0.0000978354,0.00005117548],"domain_scores_gemma":[0.9993281,0.0000693282,0.0002567367,0.0002312434,0.00008454861,0.00003008228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002246486,0.0001248592,0.301003,0.00005179259,0.0001945721,4.134312e-7,0.000871148,0.001497808,0.02201598,0.006040073,0.000007145046,0.668191],"study_design_scores_gemma":[0.0003399511,0.00003269318,0.1875892,0.00005415364,0.0003255819,0.000001804395,0.0001642347,0.7546682,0.04041046,0.01618121,0.00007267896,0.0001598096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03902717,0.0002245204,0.9604909,0.00008161693,0.000002858296,0.00008224211,0.00002423919,0.000007342605,0.0000591184],"genre_scores_gemma":[0.8516253,0.00003277566,0.1482898,0.0000153477,0.000001809272,0.00001099362,0.00001211634,0.000001775777,0.00001004795],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8125982,"threshold_uncertainty_score":0.2140923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150409896","doi":"10.1007/s10044-006-0044-8","title":"On poem recognition","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Poetry; Lyrics; Computer science; Fuzzy logic; Field (mathematics); Artificial intelligence; Literature; Art; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01473626661556572,"gpt":0.2438153654769004,"spread":0.2290790988613347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005235128,0.0000588982,0.00007816021,0.0002147049,0.0001133147,0.0001202775,0.0002047222,0.00002814499,0.00002902757],"category_scores_gemma":[0.000002375621,0.00005186606,0.00005139247,0.0007671721,0.00002304859,0.00008939455,0.00004015203,0.00003997536,0.0001244696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000969931,"about_ca_system_score_gemma":0.000002947863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006194532,"about_ca_topic_score_gemma":0.00002907751,"domain_scores_codex":[0.9994586,0.00000991362,0.0001224115,0.0002414654,0.00008751408,0.00008010717],"domain_scores_gemma":[0.9995054,0.00003793932,0.00006259294,0.0003462684,0.00002809645,0.00001969964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[3.172887e-7,0.0000988627,0.01314135,0.000002549382,0.00005153546,2.505573e-7,0.0000106221,0.00002000047,0.0004138309,0.2388507,0.001077826,0.7463322],"study_design_scores_gemma":[0.000351588,0.00003896307,0.3807792,0.00000707989,0.0003033077,0.000002088785,0.00004867815,0.0292265,0.009945336,0.5554556,0.02334417,0.0004975338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01267944,0.00003185915,0.9810527,0.001802506,0.000004480947,0.00007864759,0.000004699059,0.00020884,0.004136806],"genre_scores_gemma":[0.9979672,0.00002943987,0.001317683,0.0002407636,0.00002053201,0.0001529203,0.00004526664,0.000002081775,0.0002241385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9852877,"threshold_uncertainty_score":0.2115036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792572138","doi":"10.1007/s10044-018-0680-9","title":"Gene clustering with hidden Markov model optimized by PSO algorithm","year":2018,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Hidden Markov model; Pattern recognition (psychology); Computer science; Sequence (biology); Artificial intelligence; Similarity (geometry); Particle swarm optimization; Hierarchical clustering; Correlation clustering; CURE data clustering algorithm; Single-linkage clustering; Canopy clustering algorithm; Algorithm; Data mining; Biology; Genetics","retraction":null,"screen_n_in":null,"score":{"opus":0.008168033288264294,"gpt":0.2528534536027069,"spread":0.2446854203144427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005998888,0.00010396,0.0001189729,0.00006057048,0.0001371576,0.00003941703,0.0001151964,0.00005645204,0.00003765376],"category_scores_gemma":[0.000001118199,0.00008670505,0.00005428302,0.0002317384,0.00006631001,0.000003190369,0.00005600313,0.00003333126,0.000005500421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006699793,"about_ca_system_score_gemma":0.00001563674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003042177,"about_ca_topic_score_gemma":0.00005359933,"domain_scores_codex":[0.9992791,0.00001723387,0.0001337864,0.000363277,0.00008732691,0.0001192997],"domain_scores_gemma":[0.9994053,0.000002585132,0.00007636669,0.0003586572,0.00007756442,0.00007955747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002855972,0.00008160481,0.002628307,0.000006843335,0.0004704489,1.283269e-7,0.00004583431,0.0003281668,0.4484499,0.000003214252,0.004129965,0.5438271],"study_design_scores_gemma":[0.001438533,0.0001557876,0.003766,0.000009741999,0.001002355,0.00000717158,0.0001713478,0.5934256,0.3621567,0.00005108327,0.03715774,0.0006579353],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01998761,0.0001891364,0.9789253,0.0002616294,0.000005433616,0.0001332351,0.00005812564,0.00001154807,0.0004279821],"genre_scores_gemma":[0.9607555,0.0003256975,0.0356188,0.0004432304,0.0001641573,0.0003085431,0.0005545703,0.00001634819,0.00181312],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9433065,"threshold_uncertainty_score":0.3535729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249000472","doi":"10.1007/s10044-005-0247-4","title":"Estimation of generalized entropies with sample spacing","year":2005,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Robarts Clinical Trials","funders":"Ostravská Univerzita v Ostravě","keywords":"Mathematics; Kernel density estimation; Rényi entropy; Nonparametric statistics; Entropy (arrow of time); Tsallis entropy; Computation; Kernel (algebra); Density estimation; Joint entropy; Applied mathematics; Statistics; Principle of maximum entropy; Algorithm; Discrete mathematics; Tsallis statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.007552408055228806,"gpt":0.2515704940165722,"spread":0.2440180859613434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002654783,0.00005836774,0.0001364531,0.00005382968,0.00006005657,0.00002152292,0.00003506722,0.000007793622,0.0003611018],"category_scores_gemma":[0.000001145204,0.00004580841,0.00004316581,0.0002067448,0.00001797288,0.0000275693,0.00001156379,0.00002457877,0.000004867772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004056235,"about_ca_system_score_gemma":0.000004058869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005807639,"about_ca_topic_score_gemma":0.00002566559,"domain_scores_codex":[0.9996063,0.000007658649,0.0001271663,0.0001167357,0.00006640753,0.00007577419],"domain_scores_gemma":[0.9997022,0.00004441404,0.00007096452,0.0001182647,0.00002580431,0.0000383357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000247667,0.00006551843,0.06625498,0.000006289062,0.0003797654,2.547094e-8,0.00006691545,0.004985777,0.000207867,0.3174681,0.00001718316,0.6105451],"study_design_scores_gemma":[0.0004415597,0.00002380149,0.01627938,0.000007320214,0.001133816,1.877967e-7,0.0001420949,0.9643022,0.003532858,0.01181382,0.002150401,0.0001725512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07898986,0.00001476864,0.9204973,0.0001318421,0.000001528182,0.00007113198,0.0001003926,0.000005962871,0.0001872239],"genre_scores_gemma":[0.9827986,0.000004553192,0.01689809,0.00002410986,0.00005850765,0.00006056363,0.0001278657,0.000004088667,0.00002359738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9593164,"threshold_uncertainty_score":0.3953812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144837664","doi":"10.1007/s10044-011-0256-4","title":"Expectation-maximization algorithms for inference in Dirichlet processes mixture","year":2011,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Markov chain Monte Carlo; Computer science; Mixture model; Expectation–maximization algorithm; Algorithm; Inference; Dirichlet distribution; Bayes' theorem; Model selection; Artificial intelligence; Pattern recognition (psychology); Machine learning; Mathematics; Maximum likelihood; Bayesian probability","retraction":null,"screen_n_in":null,"score":{"opus":0.03564797153838353,"gpt":0.3036950860393177,"spread":0.2680471145009341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000136321,0.00009308243,0.0001657396,0.0002260663,0.00008718725,0.00006500939,0.000257327,0.00004438799,0.00001022197],"category_scores_gemma":[0.00003055594,0.0000819688,0.00004773494,0.001349798,0.00001910176,0.000189761,0.00004063888,0.00004553205,0.000001720882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008363189,"about_ca_system_score_gemma":0.00002452898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008423576,"about_ca_topic_score_gemma":0.0002444919,"domain_scores_codex":[0.9992263,0.00002842746,0.0001963519,0.0003472795,0.0000763661,0.0001253053],"domain_scores_gemma":[0.9993255,0.0001294154,0.0000921759,0.0002730921,0.0001285711,0.00005130062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002267597,0.0002081592,0.05734837,0.00007053511,0.000134156,6.520544e-7,0.003921148,0.00008269483,0.0001215829,0.03043927,0.00002974973,0.9076414],"study_design_scores_gemma":[0.0008895488,0.00009637821,0.1795413,0.00004346821,0.0006461685,0.000002879046,0.0002190279,0.6122115,0.005508071,0.1975641,0.002285684,0.0009918314],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006604475,0.0001451741,0.9984118,0.0001775786,0.000008423762,0.0002813815,0.00001144471,0.00003522634,0.0002685592],"genre_scores_gemma":[0.6642392,0.00008867033,0.3347835,0.0001511638,0.0000252939,0.0006392258,0.00002826679,0.000004438196,0.00004026427],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9066496,"threshold_uncertainty_score":0.3342591,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040405999","doi":"10.1007/s10044-012-0303-9","title":"Efficient steganalysis of images: learning is good for anticipation","year":2012,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Steganalysis; Steganography; Artificial intelligence; Pattern recognition (psychology); Computer science; Anticipation (artificial intelligence); Embedding; Mathematics; Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01475364422384242,"gpt":0.2871244033667694,"spread":0.272370759142927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002646552,0.0000844002,0.0001951515,0.0003122337,0.0001597114,0.00003802585,0.000196911,0.00002997583,0.000004594652],"category_scores_gemma":[0.000004938039,0.00007452547,0.0001904772,0.001061671,0.00003057359,0.00009466404,0.00006171945,0.00004643033,0.000001445212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006815119,"about_ca_system_score_gemma":0.000003338876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002677567,"about_ca_topic_score_gemma":0.000002748104,"domain_scores_codex":[0.9992564,0.00002922345,0.0002266629,0.0002104055,0.0001131831,0.0001641086],"domain_scores_gemma":[0.999289,0.00007431051,0.000179901,0.0003118597,0.00008955514,0.00005536272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002564595,0.0003216477,0.6756158,0.00007696573,0.0009107307,6.989274e-8,0.001658121,0.0023399,0.004229936,0.01173718,0.00003440973,0.3030727],"study_design_scores_gemma":[0.0004699223,0.0001082894,0.2210041,0.00003232442,0.003422602,0.000002067472,0.0002613279,0.6446123,0.1157972,0.003583988,0.009978482,0.0007274107],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02535333,0.0001520591,0.9740139,0.000105132,0.00000541981,0.0001651992,0.00001343932,0.00005861611,0.0001329599],"genre_scores_gemma":[0.9741265,0.0000317221,0.02552602,0.00005265151,0.00002475202,0.0001762595,0.00001929307,0.000004172638,0.0000386717],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9487731,"threshold_uncertainty_score":0.3039061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010748082","doi":"10.1007/s10044-013-0323-0","title":"Beyond hybrid generative discriminative learning: spherical data classification","year":2013,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Discriminative model; Categorization; Generative grammar; Computer science; Probabilistic logic; Artificial intelligence; Generative model; Machine learning; Pattern recognition (psychology); Contrast (vision)","retraction":null,"screen_n_in":null,"score":{"opus":0.04171890366918496,"gpt":0.3063761530275938,"spread":0.2646572493584088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002103772,0.0001252381,0.0002045972,0.00009296722,0.0002356637,0.0002821011,0.000700062,0.00003102492,0.00007018371],"category_scores_gemma":[0.00001278343,0.000102171,0.00006089481,0.0006414891,0.00006431146,0.0004198297,0.0003348462,0.0001383013,0.00005437113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001409749,"about_ca_system_score_gemma":0.0000152515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001475094,"about_ca_topic_score_gemma":0.00002631089,"domain_scores_codex":[0.9986854,0.0001430809,0.0002157339,0.0006462266,0.0001500022,0.0001595766],"domain_scores_gemma":[0.9986328,0.00008660464,0.0001262769,0.0009341678,0.0001010041,0.0001191854],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[1.999688e-7,0.00006391964,0.002657709,0.000003704766,0.0001637916,3.340386e-7,0.0001780566,0.000014461,0.001041629,0.03096222,0.0007651282,0.9641489],"study_design_scores_gemma":[0.0001063256,0.0000254068,0.03295707,0.000002135755,0.0003114798,0.000002924657,0.00009871204,0.9284629,0.000810872,0.03179048,0.005173701,0.0002579893],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008846442,0.0001001683,0.9945978,0.002249321,0.00001073866,0.0002423618,0.00001814665,0.00005247438,0.001844368],"genre_scores_gemma":[0.7306558,0.00006561622,0.267897,0.0003330783,0.0000778642,0.0002753526,0.000256897,0.000006595575,0.0004317172],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9638909,"threshold_uncertainty_score":0.4166414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007932135","doi":"10.1007/s10044-004-0226-1","title":"Feature dimensionality reduction for the verification of handwritten numerals","year":2004,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society of Canada","keywords":"Pattern recognition (psychology); Dimensionality reduction; Artificial intelligence; Computer science; Linear discriminant analysis; Feature extraction; Principal component analysis; Classifier (UML); Curse of dimensionality; Artificial neural network; Discriminant","retraction":null,"screen_n_in":null,"score":{"opus":0.01589830207079675,"gpt":0.2761278753260146,"spread":0.2602295732552179,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002436553,0.00007210993,0.0001363342,0.0001043505,0.0002253052,0.00005903191,0.0002471161,0.00004119085,0.00000516431],"category_scores_gemma":[0.000007713475,0.00005247151,0.0001223539,0.0006758588,0.00005393073,0.0001178365,0.00003963095,0.00005167197,0.000002981738],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001616689,"about_ca_system_score_gemma":0.00001584104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073925,"about_ca_topic_score_gemma":0.00002306371,"domain_scores_codex":[0.9993561,0.00002084962,0.0001631444,0.0002550841,0.0001215301,0.00008332966],"domain_scores_gemma":[0.9991444,0.000065343,0.0001414365,0.0004413789,0.0001743889,0.00003302396],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000005486295,0.0002501932,0.001777284,0.0000474124,0.0006820756,1.066623e-7,0.0003648705,0.0002505799,0.03089269,0.07631987,0.0007700649,0.8886394],"study_design_scores_gemma":[0.001688219,0.0001822133,0.1800691,0.00007598828,0.002987809,0.00003181686,0.0004394902,0.03130155,0.5536984,0.1834639,0.04510172,0.0009598003],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003058822,0.0001778928,0.9878209,0.008389909,0.00001095637,0.0004202968,0.00002794319,0.00005586249,0.00003747069],"genre_scores_gemma":[0.9779797,0.0001283974,0.02094563,0.0001395474,0.00004587081,0.0006380694,0.00005620462,0.000003803627,0.00006277806],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9749209,"threshold_uncertainty_score":0.2139726,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285494617","doi":"10.1007/s10044-022-01091-2","title":"User grouping and power allocation in NOMA systems: a novel semi-supervised reinforcement learning-based solution","year":2022,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Noma; Computer science; Reinforcement learning; Task (project management); Learning automata; Power (physics); Artificial intelligence; Salient; Channel (broadcasting); Scheme (mathematics); Theoretical computer science; Automaton; Distributed computing; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01146273681962976,"gpt":0.2258307935951641,"spread":0.2143680567755343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001392195,0.00009845745,0.0001560874,0.0003449355,0.0002127037,0.00003521649,0.0001371921,0.00003338468,0.00002016093],"category_scores_gemma":[0.000005649157,0.0001144451,0.00003250204,0.000759956,0.00002807782,0.00007274342,0.0001042307,0.0001815899,0.000001607703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001086206,"about_ca_system_score_gemma":0.000005145424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001409613,"about_ca_topic_score_gemma":0.00008146225,"domain_scores_codex":[0.999314,0.00002434947,0.000249868,0.0001810205,0.0001091378,0.000121644],"domain_scores_gemma":[0.9995189,0.00004719508,0.000065545,0.0003177137,0.00002492326,0.00002576729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.860895e-7,0.00002355592,0.01445265,0.00002404574,0.00006058558,9.005677e-8,0.0001109301,0.9762702,0.003388959,0.0004233507,0.000004867921,0.005239795],"study_design_scores_gemma":[0.00022523,0.00001179403,0.0107484,0.000007932177,0.00004928829,7.16665e-7,0.0008210777,0.9854972,0.0002278444,0.0000124192,0.002266736,0.0001313143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0735218,0.0005648432,0.9252085,0.0001784544,0.000006390133,0.0002623297,0.00000757943,0.0001880863,0.00006202936],"genre_scores_gemma":[0.9978656,0.0001642163,0.0003922781,0.0000371458,0.000004440449,0.001353021,0.0001489899,0.0000133573,0.00002101869],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9248162,"threshold_uncertainty_score":0.4666935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3198387749","doi":"10.1007/s10044-021-01023-6","title":"Batch and online variational learning of hierarchical Dirichlet process mixtures of multivariate Beta distributions in medical applications","year":2021,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Interpretability; Latent Dirichlet allocation; Computer science; Cluster analysis; Machine learning; Artificial intelligence; Multivariate statistics; Health care; Process (computing); Task (project management); Hierarchical clustering; Data mining; Topic model","retraction":null,"screen_n_in":null,"score":{"opus":0.01116913613225032,"gpt":0.3109120249882963,"spread":0.299742888856046,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346045,0.00009851401,0.000317498,0.0001689527,0.00009980915,0.00002985592,0.0002495704,0.00008279944,0.00002318589],"category_scores_gemma":[0.00005234392,0.00009170989,0.00007873622,0.001502252,0.00009746453,0.00007117795,0.0001567757,0.0002059488,3.009715e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008004838,"about_ca_system_score_gemma":0.00009112826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009511895,"about_ca_topic_score_gemma":0.0001283502,"domain_scores_codex":[0.9986493,0.0001438889,0.0004265633,0.0003921351,0.0002594625,0.0001286494],"domain_scores_gemma":[0.9989432,0.000301734,0.000162773,0.0002933979,0.0001852437,0.0001136462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002789533,0.0009519847,0.08469644,0.0001262793,0.0003923005,0.000002619196,0.0005842773,0.0002801572,0.002347483,0.4886882,0.000005833188,0.4219217],"study_design_scores_gemma":[0.0006952076,0.00002656105,0.3731379,0.00005089171,0.0004742341,0.00001608083,0.00006242499,0.5578048,0.002925722,0.06332409,0.001161487,0.0003206388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008518641,0.0003017513,0.9890569,0.001774403,0.000003837405,0.0001445165,0.0001046443,0.00001385335,0.00008143803],"genre_scores_gemma":[0.9210544,0.0001604609,0.07825914,0.00006885496,0.00003152611,0.00014972,0.0002521323,0.000004142853,0.00001962609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9125357,"threshold_uncertainty_score":0.373982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023711680","doi":"10.1007/s10044-005-0012-8","title":"Estimation of generalized entropies with sample spacing","year":2005,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Statistical Mechanics and Entropy","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Robarts Clinical Trials","funders":"","keywords":"Sample (material); Mathematics; Statistics; Pattern recognition (psychology); Artificial intelligence; Chromatography; Computer science; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.007552408055228806,"gpt":0.2515704940165722,"spread":0.2440180859613434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002654783,0.00005836774,0.0001364531,0.00005382968,0.00006005657,0.00002152292,0.00003506722,0.000007793622,0.0003611018],"category_scores_gemma":[0.000001145204,0.00004580841,0.00004316581,0.0002067448,0.00001797288,0.0000275693,0.00001156379,0.00002457877,0.000004867772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004056235,"about_ca_system_score_gemma":0.000004058869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005807639,"about_ca_topic_score_gemma":0.00002566559,"domain_scores_codex":[0.9996063,0.000007658649,0.0001271663,0.0001167357,0.00006640753,0.00007577419],"domain_scores_gemma":[0.9997022,0.00004441404,0.00007096452,0.0001182647,0.00002580431,0.0000383357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000247667,0.00006551843,0.06625498,0.000006289062,0.0003797654,2.547094e-8,0.00006691545,0.004985777,0.000207867,0.3174681,0.00001718316,0.6105451],"study_design_scores_gemma":[0.0004415597,0.00002380149,0.01627938,0.000007320214,0.001133816,1.877967e-7,0.0001420949,0.9643022,0.003532858,0.01181382,0.002150401,0.0001725512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07898986,0.00001476864,0.9204973,0.0001318421,0.000001528182,0.00007113198,0.0001003926,0.000005962871,0.0001872239],"genre_scores_gemma":[0.9827986,0.000004553192,0.01689809,0.00002410986,0.00005850765,0.00006056363,0.0001278657,0.000004088667,0.00002359738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9593164,"threshold_uncertainty_score":0.3953812,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092619501","doi":"10.1007/s10044-007-0094-6","title":"Ensemble of HMM classifiers based on the clustering validity index for a handwritten numeral recognizer","year":2007,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hidden Markov model; Codebook; Pattern recognition (psychology); Computer science; Vector quantization; Artificial intelligence; Cluster analysis; Linde–Buzo–Gray algorithm; Speech recognition","retraction":null,"screen_n_in":null,"score":{"opus":0.03782214546971913,"gpt":0.2895338379360944,"spread":0.2517116924663753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008208588,0.0001118246,0.0002038149,0.0002686071,0.0001974397,0.00008809115,0.0003548658,0.0000583859,0.00002600683],"category_scores_gemma":[0.00002232559,0.00008433367,0.0001850051,0.0007991619,0.00005323017,0.00007389409,0.00006248289,0.00009022156,0.000004259269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001988636,"about_ca_system_score_gemma":0.00001620733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000855956,"about_ca_topic_score_gemma":0.0002220875,"domain_scores_codex":[0.998969,0.00004552555,0.0003021486,0.000322058,0.0001760842,0.0001852085],"domain_scores_gemma":[0.9986808,0.0004560315,0.0001657285,0.0004849117,0.0001433653,0.0000691479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001721559,0.0002273114,0.02902679,0.0000464071,0.0002629618,6.556921e-7,0.0001830509,0.00008566801,0.002545107,0.00179198,0.0005735855,0.9652393],"study_design_scores_gemma":[0.000744908,0.0001727254,0.05016731,0.00005061974,0.0005061055,0.00000267304,0.0001511348,0.8583084,0.07400125,0.008575822,0.006818311,0.0005007749],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005995407,0.000007047099,0.9914974,0.001223127,0.00001109667,0.0004692686,0.00002380366,0.00006762745,0.0007052043],"genre_scores_gemma":[0.9860153,0.000008165718,0.01249562,0.0009725033,0.00004012472,0.000383738,0.00002045743,0.00000724031,0.00005683419],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9800199,"threshold_uncertainty_score":0.3439027,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2405162173","doi":"10.1007/s10044-016-0554-y","title":"A comparative study of the performance of local feature-based pattern recognition algorithms","year":2016,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Noise (video); Algorithm; Feature (linguistics); Pattern recognition (psychology); Transformation (genetics); Artificial intelligence; Similarity (geometry); Image (mathematics); Point (geometry); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02512775064174129,"gpt":0.2977534430160425,"spread":0.2726256923743012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001045819,0.00007946964,0.0002067307,0.0001026926,0.00007491522,0.00001282889,0.0003145405,0.00002161925,0.000005237995],"category_scores_gemma":[0.00000205824,0.00004385719,0.00007648546,0.0008229165,0.00008328634,0.0001169358,0.00008488591,0.00004724025,0.00000189761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000111881,"about_ca_system_score_gemma":0.0000106373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005525921,"about_ca_topic_score_gemma":0.00005601681,"domain_scores_codex":[0.9992928,0.00005059327,0.0001977888,0.0002188945,0.0001618766,0.00007804184],"domain_scores_gemma":[0.9991107,0.00007624674,0.0002035659,0.0004360368,0.0001475002,0.00002597107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002083785,0.0002283612,0.07699275,0.00001004509,0.0001019767,8.471022e-8,0.000157082,0.00002024074,0.001287593,0.000009376168,0.00001022677,0.9211802],"study_design_scores_gemma":[0.0008224803,0.0004506629,0.44114,0.00008064522,0.0004859935,0.000001254563,0.0002956708,0.06611028,0.489742,0.0003749481,0.000230504,0.0002655887],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1961175,0.00002214903,0.8034375,0.000131812,0.000003678232,0.0002368724,0.00001828339,0.00001714385,0.00001508632],"genre_scores_gemma":[0.9979643,0.00002245657,0.001820926,0.00005527163,0.000009310163,0.0001089011,0.000003212836,0.000002435362,0.00001320391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9209146,"threshold_uncertainty_score":0.1788444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093156537","doi":"10.1007/s10044-007-0088-4","title":"Hierarchical clustering of subpopulations with a dissimilarity based on the likelihood ratio statistic: application to clustering massive data sets","year":2007,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Cluster analysis; Mathematics; Statistic; Hierarchical clustering; Multinomial distribution; Poisson distribution; Multivariate normal distribution; Statistics; Data mining; Computer science; Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03091776160389113,"gpt":0.3354578783523037,"spread":0.3045401167484125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006673663,0.0001554515,0.0002239947,0.0003152659,0.0003491359,0.0001376444,0.001032978,0.00003784699,0.000008308174],"category_scores_gemma":[0.00004234431,0.0001144804,0.00004171809,0.001742317,0.00008122114,0.0001556197,0.0005849554,0.0001888452,0.0000049594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000480169,"about_ca_system_score_gemma":0.0000390021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002676315,"about_ca_topic_score_gemma":0.00263137,"domain_scores_codex":[0.9981647,0.00006993183,0.000360239,0.0006531398,0.0004560215,0.0002959718],"domain_scores_gemma":[0.997193,0.0005433051,0.0001592143,0.001776598,0.0001427892,0.0001851279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004004299,0.0002845246,0.01822561,0.00006918236,0.000274301,0.000004575236,0.0004672343,0.1810209,0.001194415,0.003080185,0.0000299329,0.7953091],"study_design_scores_gemma":[0.0001318638,0.00004298945,0.06852243,0.00001458852,0.00007491389,0.000001242111,0.00005397433,0.9303702,0.0002021109,0.0002937263,0.0001625529,0.0001294797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001596481,0.000006336986,0.9946455,0.002746436,0.000006355433,0.0006715439,0.0001959178,0.00004629654,0.00008512827],"genre_scores_gemma":[0.8774816,0.000002919872,0.1217878,0.000276229,0.00002873138,0.0002365725,0.0001654137,0.00001134169,0.000009360572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8758851,"threshold_uncertainty_score":0.4668376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175858202","doi":"10.1007/s10044-015-0494-y","title":"A biologically inspired framework for contour detection","year":2015,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Artificial intelligence; Computer science; Pattern recognition (psychology); Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.04008665302426928,"gpt":0.3272895018711384,"spread":0.2872028488468691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002259746,0.00006261568,0.0001261756,0.0001095547,0.00007799057,0.00009529354,0.0002283173,0.00005059562,0.0000080476],"category_scores_gemma":[0.00006440814,0.0000511643,0.00006463046,0.0005632084,0.00003355729,0.00008736714,0.00005622306,0.0000489352,0.000008508363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001594258,"about_ca_system_score_gemma":0.00001060306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005774952,"about_ca_topic_score_gemma":0.00003317964,"domain_scores_codex":[0.9993542,0.00002903491,0.0001665064,0.0002529224,0.0001019624,0.00009535087],"domain_scores_gemma":[0.9993157,0.00009852043,0.0000851154,0.0002646553,0.0001117307,0.0001242698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001304846,0.00004696953,0.003574867,0.000004291493,0.00009103711,1.76056e-7,0.00009699698,0.000003885094,0.001312002,0.005481867,0.00009480273,0.9892918],"study_design_scores_gemma":[0.001954554,0.0006586679,0.0803435,0.00003576772,0.001367244,0.00001023277,0.000556463,0.3182828,0.1470525,0.4203304,0.02801534,0.001392602],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007404609,0.00003850629,0.9980201,0.0006987035,0.00001111961,0.0002745813,0.000006538653,0.00014555,0.00006442364],"genre_scores_gemma":[0.7428777,0.00001599023,0.255161,0.001109057,0.00005382072,0.0007418012,0.00001559069,0.000002619946,0.00002238406],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9878992,"threshold_uncertainty_score":0.208642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2309123164","doi":"10.1007/s10044-016-0535-1","title":"The design of absorbing Bayesian pursuit algorithms and the formal analyses of their ε-optimality","year":2016,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical proof; Bayesian probability; Conjugate prior; Algorithm; Convergence (economics); Prior probability; Computer science; Discretization; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02446107674362364,"gpt":0.2927837950562803,"spread":0.2683227183126566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106718,0.00009191009,0.000230442,0.00007859446,0.0003083355,0.00008297052,0.0005016924,0.00002156695,0.000005124303],"category_scores_gemma":[0.0000187245,0.00003693439,0.0001201876,0.0005251199,0.000259152,0.0001019644,0.0001698714,0.00005590851,7.029741e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003924958,"about_ca_system_score_gemma":0.00001094127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000339014,"about_ca_topic_score_gemma":0.0000238153,"domain_scores_codex":[0.9990435,0.0001606515,0.0002859612,0.0002114734,0.000158419,0.0001399963],"domain_scores_gemma":[0.9983968,0.0007486959,0.0002382881,0.000503051,0.0000716806,0.00004154066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004180259,0.0000243516,0.008170648,0.000007311261,0.0004368166,8.322575e-8,0.0002776169,0.0003993029,0.0008022187,0.006664991,0.000007878355,0.9832046],"study_design_scores_gemma":[0.0005702919,0.00003462413,0.04338437,0.00001429963,0.0004456863,0.000003249282,0.0001412469,0.9460732,0.003293042,0.005436002,0.0004588633,0.0001451741],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003048018,0.0003815015,0.9943008,0.002020574,0.000005656678,0.0001397415,0.000009712973,0.00001430355,0.00007971089],"genre_scores_gemma":[0.993435,0.000322736,0.006053689,0.00004281132,0.00002506954,0.00005915442,0.000001303047,0.000003108054,0.00005712035],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.990387,"threshold_uncertainty_score":0.2371499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054767096","doi":"10.1007/s10044-006-0032-z","title":"Breadth-first search strategies for trie-based syntactic pattern recognition","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Computer science; Computation; Prefix; String (physics); Heuristic; Representation (politics); Algorithm; Element (criminal law); Dynamic programming; Data structure; Theoretical computer science; Pattern recognition (psychology); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02461615076739881,"gpt":0.2738431311713298,"spread":0.249226980403931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001608286,0.0001205184,0.0001777053,0.0002056648,0.0003442424,0.0004349707,0.0003051549,0.00004459034,0.00002702647],"category_scores_gemma":[0.000001849119,0.0001067724,0.0001161565,0.0006189088,0.00003112468,0.0002964814,0.00006608079,0.0000641689,0.00002164333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001857851,"about_ca_system_score_gemma":0.00003236026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001643335,"about_ca_topic_score_gemma":0.000711787,"domain_scores_codex":[0.9989454,0.00002838211,0.0002275453,0.0004368024,0.0001695039,0.0001923747],"domain_scores_gemma":[0.9991153,0.0001565067,0.00009233112,0.0004597691,0.0001117374,0.00006437319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003770628,0.0002821013,0.01375005,0.0000687064,0.00013924,0.000001369386,0.00005755384,0.001014238,0.0002807435,0.001744814,0.000454016,0.9822034],"study_design_scores_gemma":[0.0006569474,0.00005809819,0.04629894,0.0000263305,0.0004399238,0.000003012147,0.0001031909,0.9372141,0.001388822,0.007179364,0.006237799,0.0003934414],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00624664,0.00006668633,0.9921411,0.000843682,0.00001353678,0.0003067078,0.000176847,0.00007223095,0.000132574],"genre_scores_gemma":[0.9899319,0.00002347822,0.008655149,0.0001803066,0.0001169041,0.00044803,0.0006136992,0.00000768337,0.00002281468],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9836853,"threshold_uncertainty_score":0.4354052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000095052","doi":"10.1007/s10044-009-0170-1","title":"Representation and classification of high-dimensional biomedical spectral data","year":2009,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Spectroscopy and Chemometric Analyses","field":"Chemistry","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; National Research Council Institute for Biodiagnostics; University of Alberta","funders":"","keywords":"Pattern recognition (psychology); Artificial intelligence; Dimensionality reduction; Principal component analysis; Computer science; Linear subspace; Perceptron; Classifier (UML); Feature vector; k-nearest neighbors algorithm; Random subspace method; Support vector machine; Subspace topology; Artificial neural network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03573797126209471,"gpt":0.332521243984583,"spread":0.2967832727224883,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007900575,0.00008218666,0.0002267158,0.0002009205,0.00007617033,0.00002467964,0.0001566463,0.00005378142,0.0003730028],"category_scores_gemma":[0.00001619342,0.00007435754,0.00004672862,0.00100534,0.00008913078,0.00006869418,0.00004679949,0.00006727965,0.000003901794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001031801,"about_ca_system_score_gemma":0.000009396861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001877773,"about_ca_topic_score_gemma":0.00002962258,"domain_scores_codex":[0.9991014,0.000008519316,0.0002536343,0.0003738381,0.0001685364,0.00009407365],"domain_scores_gemma":[0.9991704,0.00005788044,0.0001394717,0.0005196707,0.00003821543,0.00007436846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00002054473,0.0008448958,0.2149686,0.00006733861,0.00178439,0.00000185219,0.00009526749,0.00002800972,0.4710004,0.004352421,0.0009633357,0.3058729],"study_design_scores_gemma":[0.0005061171,0.00002990178,0.9123905,0.000007749125,0.004597095,0.000008940266,0.00022181,0.02781286,0.05043207,0.00296626,0.0007561157,0.0002705643],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7862712,0.0004878661,0.210486,0.001577136,0.000004431596,0.00006792161,0.0002359564,0.00003581948,0.0008337258],"genre_scores_gemma":[0.9975212,0.0001360772,0.0007012528,0.00006019762,0.00007067549,0.00001061229,0.001381451,0.000003383444,0.0001152013],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6974219,"threshold_uncertainty_score":0.4084119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2910497671","doi":"10.1007/s10044-018-00767-y","title":"A nonparametric Bayesian learning model using accelerated variational inference and feature selection","year":2019,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Feature selection; Artificial intelligence; Nonparametric statistics; Bayesian inference; Inference; Computer science; Selection (genetic algorithm); Pattern recognition (psychology); Machine learning; Model selection; Feature (linguistics); Bayesian probability; Mathematics; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.02184809992247997,"gpt":0.2973083864084134,"spread":0.2754602864859335,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002091026,0.000114232,0.0001921239,0.0003490587,0.0002025331,0.0002529499,0.0001538983,0.00007415227,0.00001456554],"category_scores_gemma":[0.000008888158,0.0001055475,0.00005244515,0.001937111,0.00001391306,0.0002335293,0.00008353684,0.0001726644,0.00000333898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001962027,"about_ca_system_score_gemma":0.00003314341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000719622,"about_ca_topic_score_gemma":0.00001778508,"domain_scores_codex":[0.9990861,0.00006415819,0.0001441598,0.000429455,0.0001334747,0.0001425923],"domain_scores_gemma":[0.9994358,0.00007915503,0.0001086809,0.0001995315,0.00009789026,0.00007894747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000330347,0.0001052807,0.2201459,0.00004140263,0.0004996579,4.26165e-7,0.000535994,0.1092101,0.009320337,0.05534911,0.00001498877,0.6047735],"study_design_scores_gemma":[0.00009573801,0.000009001047,0.01545583,0.000003304006,0.0001255464,0.000002937427,0.00000366113,0.9768555,0.0001037894,0.007170724,0.00004969701,0.0001242578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01865391,0.00006742631,0.9806695,0.0002065151,0.000006654512,0.0001631034,0.000003303024,0.00004422427,0.0001853482],"genre_scores_gemma":[0.7159106,0.00002748189,0.2837658,0.0001151176,0.00001812479,0.00001667098,0.00001042528,0.000004224599,0.0001315777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8676454,"threshold_uncertainty_score":0.4304103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3090026837","doi":"10.1007/s10044-020-00917-1","title":"Efficient integration of generative topic models into discriminative classifiers using robust probabilistic kernels","year":2020,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université TÉLUQ; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Discriminative model; Artificial intelligence; Dirichlet distribution; Pattern recognition (psychology); Decision boundary; Latent Dirichlet allocation; Computer science; Generative model; Support vector machine; Mathematics; Classifier (UML); Prior probability; Machine learning; Bayesian probability; Topic model; Generative grammar","retraction":null,"screen_n_in":null,"score":{"opus":0.07222202404860935,"gpt":0.2936769322880273,"spread":0.221454908239418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000997291,0.0001073428,0.0002095357,0.0001191405,0.0001244452,0.00007542097,0.0002635128,0.00003647571,0.000006958529],"category_scores_gemma":[0.0000149306,0.00008843645,0.00009565858,0.001107188,0.00009171492,0.0001063297,0.00009444798,0.00007330823,0.000001483754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000385729,"about_ca_system_score_gemma":0.00002733273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009869604,"about_ca_topic_score_gemma":0.00001422328,"domain_scores_codex":[0.9990318,0.00005641296,0.0002869786,0.000365049,0.0001668407,0.00009294687],"domain_scores_gemma":[0.9992505,0.00003835445,0.0001812669,0.000259113,0.0001920752,0.00007869931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000798789,0.0004296858,0.001369776,0.0001747114,0.0005905245,0.000001406551,0.01666267,0.09469941,0.1033522,0.2765231,0.00002748674,0.506161],"study_design_scores_gemma":[0.00005020502,0.00001984027,0.0006796833,0.000006048657,0.0001560941,3.089932e-7,0.0002435219,0.9758483,0.01881086,0.004072512,0.0000164233,0.00009619216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008966197,0.00005789061,0.9892574,0.001231465,0.000005120789,0.0002851181,0.000009688141,0.00004951127,0.0001376055],"genre_scores_gemma":[0.9601209,0.0000169182,0.03955846,0.0001533654,0.00002341256,0.00009206901,0.00001578536,0.000003947689,0.00001516248],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9511547,"threshold_uncertainty_score":0.3606334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4319304668","doi":"10.1007/s10044-023-01131-5","title":"Learning automata-based partitioning algorithms for stochastic grouping problems with non-equal partition sizes","year":2023,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Partition (number theory); Theoretical computer science; Heuristic; Key (lock); Context (archaeology); Reinforcement learning; Learning automata; Constraint (computer-aided design); Automaton; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02746727101606721,"gpt":0.2880990985261506,"spread":0.2606318275100833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003527169,0.0001118097,0.0001751657,0.0003085634,0.0005476651,0.0003113092,0.0001832952,0.00003223216,0.00001117534],"category_scores_gemma":[0.00001221604,0.00009867996,0.00007371755,0.001770124,0.00004036064,0.0002109196,0.00005135454,0.00008347054,0.00002500452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001657965,"about_ca_system_score_gemma":0.00002834906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004162789,"about_ca_topic_score_gemma":0.00005624179,"domain_scores_codex":[0.9988839,0.00003717498,0.0002201837,0.0004005561,0.0002019826,0.0002562221],"domain_scores_gemma":[0.9992489,0.0001636311,0.0001182783,0.0002429922,0.0001279937,0.00009816889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001637005,0.00005472893,0.00380621,0.00004977807,0.0001429999,4.336607e-7,0.0003432845,0.9357932,0.0001239908,0.001561629,0.00003485956,0.0580873],"study_design_scores_gemma":[0.0003512198,0.00007269331,0.003414832,0.00002150657,0.0001058686,5.057619e-7,0.00006536572,0.9949371,0.00006585431,0.0005055325,0.0003192597,0.0001402464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001396882,0.000008072127,0.9968182,0.0008999391,0.000008022047,0.0005016487,0.00001259616,0.0003146783,0.0000399516],"genre_scores_gemma":[0.9793949,0.00001234943,0.0181501,0.0001247771,0.00004014195,0.00182888,0.0003402341,0.00001185034,0.00009676142],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9786681,"threshold_uncertainty_score":0.4212252,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968620120","doi":"10.1007/s10044-011-0199-9","title":"On utilizing dependence-based information to enhance micro-aggregation for secure statistical databases","year":2011,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Random variable; Partition (number theory); Data mining; Variables; Heuristic; Algorithm; Mathematics; Artificial intelligence; Machine learning; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.04062258526704,"gpt":0.3130670910758171,"spread":0.2724445058087771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001969606,0.0001039898,0.0001311464,0.000293749,0.0001665476,0.0001084799,0.002689027,0.00003650283,0.00002175637],"category_scores_gemma":[0.0008319565,0.00009870663,0.00003966307,0.0007319656,0.00003300299,0.0004290413,0.002144123,0.00007231088,0.00003690982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000025639,"about_ca_system_score_gemma":0.00001981839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001322069,"about_ca_topic_score_gemma":0.0001202514,"domain_scores_codex":[0.9990771,0.00001943457,0.0002361163,0.0003483301,0.0001525182,0.0001664541],"domain_scores_gemma":[0.9972219,0.000204446,0.0001133749,0.002303434,0.00009010555,0.00006670506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000151648,0.0001556674,0.009655295,0.00008333822,0.0001637171,6.738538e-7,0.0002181812,0.00007285145,0.0007529515,0.04872031,0.009873833,0.930288],"study_design_scores_gemma":[0.000375893,0.0001703571,0.02398563,0.00007841575,0.0003705699,0.000001991638,0.0001515299,0.74804,0.1213395,0.0963889,0.008372179,0.0007250142],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003680751,0.0000124943,0.9934945,0.001714101,0.00001298668,0.0003802901,0.0004669999,0.0001437934,0.00009414738],"genre_scores_gemma":[0.6105676,0.000008754603,0.388183,0.0005323003,0.000007769428,0.0003857691,0.0003099979,0.000002947028,0.000001810523],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.929563,"threshold_uncertainty_score":0.4996927,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2933135745","doi":"10.1007/s10044-019-00817-z","title":"On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm","year":2019,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Deadlock; Computer science; Cellular automaton; Automaton; Object (grammar); Property (philosophy); Field (mathematics); Distributed computing; Theoretical computer science; Learning automata; Artificial intelligence; State (computer science); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01497652865383123,"gpt":0.2765915064644349,"spread":0.2616149778106036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005168678,0.00008658897,0.0001137748,0.0001048745,0.0004506941,0.0004549297,0.0005096526,0.000024456,0.00003672661],"category_scores_gemma":[0.000007230513,0.00005084204,0.00009361264,0.0009803895,0.00002407211,0.0001303405,0.0001135219,0.0001001059,0.00004057179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001980579,"about_ca_system_score_gemma":0.00002033347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001792765,"about_ca_topic_score_gemma":0.0002978699,"domain_scores_codex":[0.9990185,0.00009951776,0.000205759,0.0002754936,0.0002456235,0.000155091],"domain_scores_gemma":[0.9990474,0.0001841495,0.0001224439,0.0005705638,0.00003836801,0.00003707007],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000421934,0.000338444,0.09823907,0.00008037083,0.001382098,0.000001127615,0.006137709,0.3298463,0.01286272,0.2207498,0.0003604159,0.3299977],"study_design_scores_gemma":[0.00006409227,0.000009213102,0.006246415,0.000008461308,0.00008257101,0.000001486937,0.00007698382,0.9903165,0.0007460854,0.001334582,0.001025976,0.00008759564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0682421,0.00004923956,0.9286332,0.002415669,0.00001538478,0.0003545121,0.000001745735,0.00004375341,0.0002444332],"genre_scores_gemma":[0.9977152,0.00002733673,0.001294697,0.0006705836,0.00002721118,0.00008639224,0.000008932323,0.000004805659,0.0001648531],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9294731,"threshold_uncertainty_score":0.4386898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047848293","doi":"10.1007/s10044-006-0036-8","title":"A novel look-ahead optimization strategy for trie-based approximate string matching","year":2006,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Computer science; String (physics); String searching algorithm; Matching (statistics); Pattern recognition (psychology); Artificial intelligence; Algorithm; Pattern matching; Mathematics; Data structure; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02068117720156099,"gpt":0.2668556260348765,"spread":0.2461744488333155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001366988,0.0001089112,0.0001640966,0.0001655654,0.0002694524,0.0002975411,0.0002706487,0.00003620972,0.000007070279],"category_scores_gemma":[0.000001408954,0.0000979971,0.00008789724,0.0005752218,0.00001632923,0.0002069161,0.00006827917,0.00004572707,0.000001493169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001408953,"about_ca_system_score_gemma":0.00001844029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004527892,"about_ca_topic_score_gemma":0.0000641115,"domain_scores_codex":[0.9990889,0.00001098695,0.0002363845,0.000384019,0.0001227574,0.0001569872],"domain_scores_gemma":[0.9993103,0.00005923007,0.0001299949,0.0003852282,0.00006551576,0.00004969272],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002368237,0.0001923257,0.001266957,0.0000306982,0.00007387656,2.481314e-7,0.00001902776,0.8612311,0.001264507,0.01576217,0.00004275333,0.1201139],"study_design_scores_gemma":[0.0003050072,0.000009517796,0.001690336,0.000006068098,0.0001081882,6.053278e-7,0.00001220748,0.9957336,0.000433345,0.001207175,0.0003691204,0.0001248157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009664464,0.00005952648,0.9982688,0.000179569,0.00000783965,0.000284815,0.00009040062,0.00007368875,0.00006885765],"genre_scores_gemma":[0.7591498,0.00000789971,0.2399257,0.00009361569,0.0000816887,0.0003074328,0.0003830809,0.00000854148,0.00004224807],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7583432,"threshold_uncertainty_score":0.3996206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400936793","doi":"10.1007/s10044-024-01306-8","title":"Causal generative explainers using counterfactual inference: a case study on the Morpho-MNIST dataset","year":2024,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Explainable Artificial Intelligence (XAI)","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Counterfactual thinking; Artificial intelligence; Machine learning; Computer science; Generative grammar; Classifier (UML); Inference; Interpretability; MNIST database; Generative model; Pattern recognition (psychology); Artificial neural network; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.08872213112094182,"gpt":0.3729687433924339,"spread":0.2842466122714921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003485131,0.000157369,0.0001651924,0.0002149813,0.0005396509,0.0008931896,0.0004100658,0.00002669942,0.00006081442],"category_scores_gemma":[0.00001287395,0.0001089142,0.00006067738,0.001345557,0.00008088781,0.0002329222,0.0001855596,0.0001544919,0.00007705175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004648171,"about_ca_system_score_gemma":0.00004524907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003279159,"about_ca_topic_score_gemma":0.0020453,"domain_scores_codex":[0.9986703,0.0001069486,0.0002573168,0.0005507873,0.0002245815,0.0001900426],"domain_scores_gemma":[0.9987242,0.000339037,0.00005776813,0.0007412119,0.00006043983,0.00007733525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002374371,0.004492841,0.05799557,0.0001500707,0.01273452,0.008330988,0.1211572,0.06562826,0.01754677,0.3056397,0.01511467,0.3911857],"study_design_scores_gemma":[0.00004846331,0.00008378532,0.0002642879,0.00001040315,0.0004940514,0.0001033973,0.01185285,0.9803253,0.002120084,0.0005159533,0.003895183,0.0002862082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2536964,0.00005222173,0.7450216,0.0005674763,0.00002236211,0.0002991227,0.0002624891,0.00004144123,0.00003695189],"genre_scores_gemma":[0.9988388,0.00001133824,0.0003019091,0.0004047139,0.00007017414,0.0002480928,0.00008878558,0.000007196324,0.00002894019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9146971,"threshold_uncertainty_score":0.8613048,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977559714","doi":"10.1007/s10044-011-0253-7","title":"Joint segmentation and pairing of multispectral chromosome images","year":2011,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Multispectral image; Segmentation; Artificial intelligence; Grayscale; Computer science; Pattern recognition (psychology); Chromosome; Image segmentation; Multispectral pattern recognition; Computer vision; Pixel; Biology; Genetics; Gene","retraction":null,"screen_n_in":null,"score":{"opus":0.02111232406596122,"gpt":0.2579642343865197,"spread":0.2368519103205585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004830086,0.00005331348,0.00008077009,0.00006354134,0.00004331161,0.000007892539,0.00003529275,0.00002731867,0.00003169442],"category_scores_gemma":[0.000001866012,0.00004874505,0.00004175022,0.0001185792,0.000040708,0.000002865984,0.00002738632,0.000018661,9.172525e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002461122,"about_ca_system_score_gemma":0.000004533091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006369494,"about_ca_topic_score_gemma":0.0000295938,"domain_scores_codex":[0.9995844,0.00001423201,0.0001256074,0.000180137,0.00004118454,0.00005440899],"domain_scores_gemma":[0.9997059,0.000001904867,0.0000776443,0.0001493013,0.00002915681,0.00003613141],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002306826,0.0000330176,0.07450911,0.00001082651,0.0000961214,4.060917e-8,0.00008207811,0.000002865811,0.8901629,0.00004103403,0.00002738013,0.03503236],"study_design_scores_gemma":[0.0001178636,0.00001862481,0.3558138,0.000002462041,0.0001284397,7.39251e-7,0.0001605619,0.0001359383,0.6432142,0.00004751254,0.0002995038,0.00006034423],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5824506,0.0003773619,0.4166459,0.00004812042,0.000004935153,0.0001116871,0.00001819063,0.000005306839,0.0003378243],"genre_scores_gemma":[0.9981697,0.0004049455,0.001129195,0.00003782374,0.00002665956,0.00008324948,0.0000666058,0.000004091123,0.00007771258],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4157191,"threshold_uncertainty_score":0.1987765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401536395","doi":"10.1007/s10044-024-01318-4","title":"Multilinear principal component analysis-based tensor decomposition for fabric weave pattern recognition from high-dimensional streaming data","year":2024,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Industrial Vision Systems and Defect Detection","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Artificial intelligence; Computer science; Computer vision; Principal component analysis; Pattern recognition (psychology); Dimensionality reduction; Local binary patterns; Tensor (intrinsic definition); Multilinear map; Image (mathematics); Histogram; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03777358483708904,"gpt":0.2957096521503148,"spread":0.2579360673132257,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000225317,0.0001950736,0.0003683901,0.000592389,0.0001738739,0.000192195,0.0001253243,0.0001135621,0.0001001706],"category_scores_gemma":[0.000005673987,0.0001823963,0.0002394915,0.001057115,0.00001746785,0.0001150393,0.0000400369,0.0001357779,0.00003757865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005942408,"about_ca_system_score_gemma":0.00001090021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001410044,"about_ca_topic_score_gemma":0.0006187984,"domain_scores_codex":[0.9985926,0.00004328458,0.000422428,0.000566102,0.00020048,0.0001751152],"domain_scores_gemma":[0.9990132,0.000246604,0.0000743535,0.0004905871,0.00008167016,0.00009358258],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001492271,0.0001199732,0.007735169,0.00009310477,0.005226951,0.000003150875,0.00004901043,0.06984391,0.00522262,0.000003695865,0.0001666841,0.9115208],"study_design_scores_gemma":[0.0002923576,0.00001530294,0.02076125,0.00003374727,0.004391389,7.119464e-7,0.00002689908,0.9709424,0.002232744,0.00001648727,0.001074331,0.0002124136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3051885,0.0001356865,0.6910768,0.00004526351,0.00007386715,0.0003509288,0.002965367,0.0001573569,0.000006237446],"genre_scores_gemma":[0.9830095,0.00001465216,0.001192742,0.00003482695,0.0003887241,0.0003102855,0.01501279,0.00002649119,0.000009950545],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9113084,"threshold_uncertainty_score":0.7437904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051699617","doi":"10.1007/s10044-007-0095-5","title":"Estimation of distributions involving unobservable events: the case of optimal search with unknown Target Distributions","year":2007,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Unobservable; Object (grammar); Computer science; Bin; Function (biology); Set (abstract data type); Probability distribution; Task (project management); Joint probability distribution; Distribution (mathematics); Data mining; Probability density function; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Statistics; Econometrics","retraction":null,"screen_n_in":null,"score":{"opus":0.00948003686215223,"gpt":0.2830994655818897,"spread":0.2736194287197375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003435017,0.0000786134,0.0001273094,0.00006499411,0.0002078802,0.0000134706,0.0001153896,0.00004384976,0.00001716339],"category_scores_gemma":[0.00001338102,0.00005618637,0.0000834227,0.0005994739,0.00014735,0.00000552263,0.00007773716,0.00006408142,6.531479e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001064287,"about_ca_system_score_gemma":0.00003254836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003467376,"about_ca_topic_score_gemma":0.0008906859,"domain_scores_codex":[0.9993123,0.00003432346,0.0002324391,0.0001784838,0.00009864427,0.0001438318],"domain_scores_gemma":[0.9992998,0.000038699,0.00009769834,0.0003239618,0.0001720966,0.00006777021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001897485,0.003008522,0.4343855,0.0003435144,0.004691183,0.00002887111,0.000732512,0.07650894,0.218378,0.0589961,0.0002171076,0.20252],"study_design_scores_gemma":[0.001978775,0.0006163869,0.2782456,0.00006943267,0.003067223,0.000201655,0.004391712,0.5300559,0.1727561,0.001028846,0.006655398,0.0009329265],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4652262,0.00006331571,0.5342422,0.00006709476,0.000001564837,0.0001064283,0.0002578953,0.000002265728,0.00003305043],"genre_scores_gemma":[0.9963726,0.00007899579,0.001895215,0.00001654223,0.00001506975,0.00003688341,0.001511426,0.000005109395,0.00006815013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.532347,"threshold_uncertainty_score":0.2291214,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2577832877","doi":"10.1007/s10044-016-0591-6","title":"Fuzzy-based algorithm for Fongbe continuous speech segmentation","year":2017,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Speech and Audio Processing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Agence Universitaire de la Francophonie","keywords":"Segmentation; Speech segmentation; Computer science; Speech recognition; Domain (mathematical analysis); Syllable; Fuzzy logic; Set (abstract data type); Algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01613108445661661,"gpt":0.2933312859123837,"spread":0.2772002014557671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001455478,0.00008766565,0.0001570808,0.0001071473,0.00068195,0.0006627634,0.0004434556,0.00002912064,0.000005469286],"category_scores_gemma":[0.000005772788,0.00008121703,0.0001021358,0.0001859566,0.00003724424,0.0002114631,0.00005932908,0.00003556097,0.000009303899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001134642,"about_ca_system_score_gemma":0.00001833276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006570506,"about_ca_topic_score_gemma":0.0000834629,"domain_scores_codex":[0.999254,0.000008812019,0.0001513904,0.0003290389,0.0001119865,0.0001448023],"domain_scores_gemma":[0.9990504,0.00003814657,0.000202522,0.0005479719,0.00009408982,0.00006683794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[2.499719e-7,0.00002691913,0.009966811,0.000006157024,0.00006313877,3.685992e-7,0.0000169236,0.000004792765,0.000679078,0.00009368377,0.00004095255,0.9891009],"study_design_scores_gemma":[0.002185442,0.00009824136,0.08056776,0.00003134159,0.001352794,0.000004726415,0.0001512354,0.5475252,0.3416764,0.013963,0.01152686,0.0009170441],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002245862,0.00007626354,0.9959502,0.001080066,0.00001738308,0.0002391449,0.00002447205,0.00004599121,0.0003206453],"genre_scores_gemma":[0.5812334,0.00001937107,0.4174703,0.0005335271,0.0001224329,0.0003949291,0.00006244241,0.000007132402,0.0001564014],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9881839,"threshold_uncertainty_score":0.6391042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4406848163","doi":"10.1007/s10044-025-01411-2","title":"Separability and scatteredness (S&S) ratio-based efficient SVM regularization parameter, kernel, and kernel parameter selection","year":2025,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McGill University","funders":"","keywords":"Kernel (algebra); Pattern recognition (psychology); Mathematics; Artificial intelligence; Regularization (linguistics); Support vector machine; Radial basis function kernel; Kernel method; Selection (genetic algorithm); Applied mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.0136791031785723,"gpt":0.2721746611905991,"spread":0.2584955580120268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002589581,0.0001640082,0.0002439895,0.0003169856,0.0003418148,0.0003628378,0.0001490617,0.00008726699,0.00001523155],"category_scores_gemma":[0.00002932131,0.0001495766,0.00007286925,0.001138807,0.00009383089,0.0001496256,0.0001030124,0.0000964652,0.000006692772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002520409,"about_ca_system_score_gemma":0.00002451479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001294422,"about_ca_topic_score_gemma":0.00009015838,"domain_scores_codex":[0.9985847,0.0001099067,0.0003068909,0.0006774384,0.000152084,0.0001689334],"domain_scores_gemma":[0.9990308,0.0002093809,0.0001249184,0.0004210231,0.0001214968,0.00009242649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000279828,0.0007438242,0.4157819,0.0002914542,0.0006292732,6.212679e-7,0.0006044692,0.006783557,0.01232102,0.004076758,0.0004642024,0.5582749],"study_design_scores_gemma":[0.0004247039,0.00002080305,0.1324356,0.00003313082,0.0004101241,0.000002017073,0.00003222581,0.8570362,0.005070315,0.003264688,0.001014529,0.0002555547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2954213,0.00007925391,0.7033027,0.0008093686,0.00001612324,0.0002686462,0.00001035421,0.00005472021,0.00003753377],"genre_scores_gemma":[0.9934025,0.00004625789,0.005354874,0.0006211972,0.00001543684,0.0002996156,0.00009004598,0.000005234756,0.0001648331],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8502527,"threshold_uncertainty_score":0.6099557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048541556","doi":"10.1007/s10044-014-0382-x","title":"Discriminative learning of generative models: large margin multinomial mixture models for document classification","year":2014,"lang":"en","type":"article","venue":"Pattern Analysis and Applications","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Discriminative model; Generative model; Artificial intelligence; Computer science; Margin (machine learning); Multinomial distribution; Generative grammar; Pattern recognition (psychology); Machine learning; Mixture model; Support vector machine; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02957985219689971,"gpt":0.2820173542255078,"spread":0.2524375020286081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000294901,0.0001347633,0.0002490946,0.0002530944,0.0002426942,0.0001077029,0.0003966263,0.00006998677,0.00000538273],"category_scores_gemma":[0.00001641545,0.000116978,0.0001316991,0.0005332108,0.0000595283,0.0003582662,0.0001236693,0.00009125947,0.000002274602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742094,"about_ca_system_score_gemma":0.00001187665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002523541,"about_ca_topic_score_gemma":0.00002637869,"domain_scores_codex":[0.998834,0.00006525381,0.0003199813,0.0004582686,0.0001539438,0.0001686096],"domain_scores_gemma":[0.9989088,0.0001241664,0.000301801,0.0004493441,0.0001680454,0.00004781478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002654861,0.0001010817,0.00146544,0.00002071497,0.0001655189,1.838582e-8,0.0008248245,0.00516559,0.001291843,0.7823889,0.00007590415,0.2084975],"study_design_scores_gemma":[0.0002559019,0.00002289489,0.002249185,0.000003673556,0.0001481292,1.139363e-7,0.0003205627,0.9414019,0.002181077,0.05207989,0.001205978,0.0001307069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002300551,0.00007001024,0.9950989,0.001554741,0.000008433798,0.0003865246,0.00001952535,0.000100441,0.000460826],"genre_scores_gemma":[0.9768834,0.00007421656,0.02177983,0.00007704757,0.00002888936,0.0008431073,0.00010593,0.000006615158,0.0002010046],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9745828,"threshold_uncertainty_score":0.4770224,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}