{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":17,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":17,"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":"a99c1240e7e7","filters":{"venue":"Journal of Experimental & Theoretical Artificial Intelligence"}},"results":[{"id":"W2012971775","doi":"10.1080/0952813x.2012.721010","title":"Naive Bayes text classifiers: a locally weighted learning approach","year":2012,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Naive Bayes classifier; Computer science; Artificial intelligence; Machine learning; Conditional independence; Bayes error rate; Bayesian programming; Bayes' theorem; Benchmark (surveying); Complement (music); Bayes classifier; Bayesian probability; Support vector machine; Bayes factor","retraction":null,"screen_n_in":null,"score":{"opus":0.03611338585351168,"gpt":0.3060859303784622,"spread":0.2699725445249506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144688,0.0002396505,0.0003270722,0.0002373482,0.0002104802,0.0002729346,0.00129126,0.0001748619,0.000334693],"category_scores_gemma":[0.0002728032,0.0001832922,0.0002104095,0.0005143788,0.0008898595,0.001155233,0.0003285641,0.0006530599,0.0001733914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001372996,"about_ca_system_score_gemma":0.00006618175,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001892644,"about_ca_topic_score_gemma":6.110972e-8,"domain_scores_codex":[0.9974698,0.0002028163,0.0008520248,0.0002797174,0.0006692237,0.0005264455],"domain_scores_gemma":[0.998501,0.0002479359,0.0004200476,0.0003423505,0.0002055335,0.0002831216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00008547059,0.0006060054,0.00008845663,0.000003448251,0.0000280587,0.000006149906,0.001583429,0.00002433447,0.02626935,0.9285442,0.00009306895,0.04266809],"study_design_scores_gemma":[0.00008786885,0.0007957029,0.00003389224,0.00003979126,0.00001526116,0.0001254545,0.007202719,0.02843588,0.781793,0.1800135,0.001139314,0.0003176664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0531248,0.001223829,0.9367777,0.0009313916,0.0006039502,0.0001450908,4.246142e-7,0.0001577846,0.007035095],"genre_scores_gemma":[0.9550135,0.00004376105,0.04449932,0.0001358083,0.0002338697,0.0000109438,8.113285e-7,0.00001443847,0.00004756886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9018887,"threshold_uncertainty_score":0.7474439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2015688842","doi":"10.1080/09528130903010295","title":"Warning: statistical benchmarking is addictive. Kicking the habit in machine learning","year":2009,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; National Research Council Canada","funders":"","keywords":"Benchmarking; Computer science; Addiction; Set (abstract data type); Habit; Machine learning; Test (biology); Artificial intelligence; Measure (data warehouse); Psychology; Data mining; Social psychology; Psychiatry; Management","retraction":null,"screen_n_in":null,"score":{"opus":0.02424670070729992,"gpt":0.3166015831447657,"spread":0.2923548824374658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001677868,0.0002003828,0.0002806414,0.0001724031,0.0002648459,0.0002981327,0.001013515,0.00008272116,0.0004273102],"category_scores_gemma":[0.0006561424,0.0001389889,0.0001121732,0.0004407742,0.0003522598,0.0004225407,0.0001559327,0.001131993,0.00004108958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001105614,"about_ca_system_score_gemma":0.00006359275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001848711,"about_ca_topic_score_gemma":0.000001968152,"domain_scores_codex":[0.9973153,0.0004706288,0.0008691084,0.0003293922,0.0006490539,0.0003665079],"domain_scores_gemma":[0.9983812,0.0006913312,0.0003639679,0.0002948119,0.0001161405,0.0001525546],"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.00009188477,0.0001849358,0.000313997,0.000001549976,0.000008653268,0.00005499535,0.002990052,0.0004102418,0.009732835,0.8472567,0.00003398388,0.1389202],"study_design_scores_gemma":[0.0001153658,0.001597889,0.001405316,0.0001314313,0.00001487034,0.0002116793,0.001315134,0.6883076,0.1017802,0.2036632,0.001137713,0.0003195994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04075523,0.0006506664,0.9502326,0.005781055,0.0003580335,0.0001339672,0.000002673893,0.00004226702,0.002043497],"genre_scores_gemma":[0.984014,0.000034142,0.01513745,0.0005791128,0.0002104492,0.000002420632,0.000003488336,0.00000899907,0.000009881352],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9432588,"threshold_uncertainty_score":0.5667804,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2772583926","doi":"10.1080/0952813x.2017.1413140","title":"Reproducible research: a minority opinion","year":2017,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Argument (complex analysis); Computer science; Interpretation (philosophy); Code (set theory); Epistemology; Scientific misconduct; Engineering ethics; Data science; Set (abstract data type); Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.565419335672116,"gpt":0.5673036619183319,"spread":0.001884326246215928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.03186251,0.0001501014,0.000347107,0.0003992341,0.001221174,0.002348596,0.003867161,0.00007545779,0.00182438],"category_scores_gemma":[0.02377937,0.0001039322,0.0002374229,0.0004189759,0.002622807,0.0007047793,0.001454953,0.0005235947,0.0007989561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008837458,"about_ca_system_score_gemma":0.00009666212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004391312,"about_ca_topic_score_gemma":0.000003205024,"domain_scores_codex":[0.9933096,0.0005738012,0.001453669,0.0007961137,0.003403989,0.0004628584],"domain_scores_gemma":[0.9940013,0.001223372,0.0007379874,0.002560086,0.00116855,0.0003086766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002386367,0.0004411242,0.0001750802,0.000001865994,0.00001248334,0.00003978948,0.0006550382,0.00002590235,0.008639794,0.910007,0.007633472,0.07212979],"study_design_scores_gemma":[0.0000444164,0.0004484723,0.0002806605,0.00004629085,0.000004617325,0.00003648667,0.003878614,0.004480969,0.2708713,0.712347,0.007431343,0.0001297425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8101813,0.001065035,0.06434745,0.01150539,0.01559011,0.0005466552,0.00001568706,0.00004377194,0.09670459],"genre_scores_gemma":[0.9962366,0.00001593124,0.002381849,0.0000621332,0.0009546083,0.000002320492,5.415832e-7,0.000007291625,0.0003387184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2622315,"threshold_uncertainty_score":0.999979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964479549","doi":"10.1080/0952813021000055162","title":"Cognitive evolutionary psychology without representational nativism","year":2003,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Cognition; Organism; Psychological nativism; Cognitive psychology; Cognitive science; Evolutionary psychology; Selection (genetic algorithm); Animal cognition; Psychology; Biology; Computer science; Social psychology; Genetics; Artificial intelligence; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.06384524336725118,"gpt":0.4290747127252897,"spread":0.3652294693580386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00163967,0.0001341321,0.0002134524,0.0001205438,0.0004878872,0.00005386571,0.0002354062,0.000126338,0.005490529],"category_scores_gemma":[0.001522865,0.0001225787,0.0001423522,0.0002948446,0.002375754,0.000425484,0.00002348266,0.0003214688,0.0001545864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001302255,"about_ca_system_score_gemma":0.0002822343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001057729,"about_ca_topic_score_gemma":0.000005184193,"domain_scores_codex":[0.9970219,0.001167098,0.0006325416,0.0002149703,0.0006782788,0.0002852111],"domain_scores_gemma":[0.9983962,0.0005248603,0.0002351231,0.00009672154,0.0005505091,0.0001965485],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004501511,0.0005408928,0.0002147497,8.679318e-7,0.00003083045,0.00001706717,0.003866334,0.00002606784,0.01034096,0.9829181,0.0001005698,0.001493385],"study_design_scores_gemma":[0.0001130699,0.0004697657,0.0001469032,0.00004158291,0.00002413536,0.00009474881,0.01789158,0.0001684312,0.0798034,0.9001149,0.0009498888,0.0001816122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6752692,0.001392517,0.1259001,0.002820294,0.002110143,0.0004620349,0.000009686737,0.00005155836,0.1919844],"genre_scores_gemma":[0.9969036,0.00006630911,0.001992146,0.0004300212,0.0004269021,0.00001003692,0.00000249804,0.00001082924,0.0001576395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3216344,"threshold_uncertainty_score":0.9954186,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3002919848","doi":"10.1080/0952813x.2020.1716857","title":"Communicative bottlenecks lead to maximal information transfer","year":2020,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Partition (number theory); Information transfer; Signalling; Theoretical computer science; Simple (philosophy); Stability (learning theory); Property (philosophy); Empirical evidence; Mathematical economics; Machine learning; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.1671358117420929,"gpt":0.4177336989091323,"spread":0.2505978871670393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001700311,0.0001610901,0.0003431893,0.0001345527,0.0001685777,0.0002533986,0.001454172,0.00007679629,0.003009385],"category_scores_gemma":[0.001580481,0.0001168115,0.0002217752,0.0006786085,0.0007131463,0.0006789105,0.0001763536,0.0003911656,0.002078262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004354207,"about_ca_system_score_gemma":0.00005534402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001897169,"about_ca_topic_score_gemma":4.858441e-7,"domain_scores_codex":[0.9967738,0.0003033575,0.001460547,0.0001829712,0.001046405,0.0002329538],"domain_scores_gemma":[0.9977168,0.0008269601,0.0002044817,0.0003399621,0.0004895529,0.0004221778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006535482,0.0001559428,0.000006691172,8.768721e-7,0.00001139497,0.000002886401,0.009514542,0.0002341248,0.07140709,0.8849811,0.0002286934,0.03280311],"study_design_scores_gemma":[0.00004360992,0.0007380012,0.00001323816,0.00001297174,0.00000921317,0.00001650631,0.01492909,0.002096054,0.6331732,0.3458143,0.003027865,0.0001258546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3816027,0.00008585463,0.5936683,0.0156928,0.0001792457,0.0002591904,0.0000183526,0.0000205836,0.008472991],"genre_scores_gemma":[0.9927682,0.000006437559,0.003981285,0.003073336,0.0001439836,0.000008950701,0.000001186491,0.000008007857,0.000008606686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6111655,"threshold_uncertainty_score":0.9986987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039928111","doi":"10.1080/09528131003713002","title":"A framework to support qualitative reasoning about COAs in a dynamic spatial environment","year":2010,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Qualitative reasoning; Action (physics); Spatial intelligence; Space (punctuation); Human–computer interaction; Model-based reasoning; Conceptual framework; Artificial intelligence; Data science; Knowledge representation and reasoning; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.02200161216332055,"gpt":0.3596012339910946,"spread":0.337599621827774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009888879,0.0001602459,0.0002422599,0.0001962521,0.00007984663,0.0001434236,0.0004983793,0.0001132319,0.001535079],"category_scores_gemma":[0.0004337541,0.000144639,0.0001071425,0.00024554,0.0003775829,0.0002906649,0.0001538888,0.000617173,0.0001198797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222565,"about_ca_system_score_gemma":0.00008933023,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000172446,"about_ca_topic_score_gemma":0.00002571889,"domain_scores_codex":[0.9980239,0.0001734573,0.0007729085,0.0002658058,0.0004897708,0.0002742113],"domain_scores_gemma":[0.9989072,0.000313704,0.0002152287,0.0002307842,0.00007819274,0.0002548818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001095439,0.0002399787,0.0000516938,0.000001233068,0.000008002756,0.00003830844,0.01582857,0.0006314903,0.03995165,0.8874552,0.000004462249,0.05567987],"study_design_scores_gemma":[0.0001533734,0.001787142,0.0004471502,0.0001543868,0.0000111829,0.0002060558,0.01026717,0.1329422,0.4257189,0.4276379,0.0001508117,0.0005237208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1925417,0.00001710111,0.8052976,0.0009751949,0.0006280158,0.0001329923,0.000001713866,0.00001377621,0.0003918603],"genre_scores_gemma":[0.8373714,0.000007741865,0.162281,0.000250651,0.00006832458,0.000007012528,5.828973e-7,0.000008150674,0.000005071456],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6448297,"threshold_uncertainty_score":0.9993777,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321369875","doi":"10.1080/0952813x.2023.2178516","title":"The future of endoscopy – what are the thoughts on artificial intelligence?","year":2023,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Colorectal Cancer Screening and Detection","field":"Medicine","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Endoscopy; Healthcare system; Medicine; Quality (philosophy); Quarter (Canadian coin); Computer science; Quality assurance; Health care; Radiology; Pathology; External quality assessment","retraction":null,"screen_n_in":null,"score":{"opus":0.04079855129188353,"gpt":0.3500763572420568,"spread":0.3092778059501733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001326468,0.000240657,0.000416599,0.0001624534,0.0004045731,0.0001801446,0.0004357865,0.0001447942,0.0001568027],"category_scores_gemma":[0.0003649721,0.0001257491,0.0004068766,0.0008133664,0.001250616,0.0001753463,0.0001000415,0.0007527332,0.0001066888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001205946,"about_ca_system_score_gemma":0.0001019647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005215734,"about_ca_topic_score_gemma":0.0000115439,"domain_scores_codex":[0.9970971,0.0002311913,0.001049414,0.0002494031,0.0009857209,0.0003871683],"domain_scores_gemma":[0.9976774,0.0009435128,0.0004807022,0.000377017,0.0003307165,0.0001906099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.01966164,0.0005425707,0.00002975626,0.00001861422,0.0001419994,0.0001167511,0.002822908,0.0002771278,0.05608929,0.6058462,0.0003039535,0.3141492],"study_design_scores_gemma":[0.00003922964,0.003916959,0.00004372217,0.0002558504,0.00004940498,0.0001112427,0.0457932,0.002338797,0.8150111,0.131716,0.0006106045,0.0001138366],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.965682,0.005109271,0.006271232,0.01459226,0.006853584,0.0006142675,0.000006184115,0.00007552136,0.0007956573],"genre_scores_gemma":[0.995273,0.001028601,0.0001806345,0.0002701389,0.003170063,0.00001714134,0.000001327364,0.00002620525,0.00003291463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7589219,"threshold_uncertainty_score":0.5127901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080075719","doi":"10.1080/0952813x.2014.924588","title":"Coupling Gaussian generalised regression neural network and mutable smart bee algorithm to analyse the characteristics of automotive engine coldstart hydrocarbon emission","year":2014,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Advanced Combustion Engine Technologies","field":"Chemical Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Automotive engine; Computer science; Automotive industry; Artificial neural network; Identification (biology); SPARK (programming language); Gaussian; Coupling (piping); Algorithm; Machine learning; Artificial intelligence; Automotive engineering; Mechanical engineering; Engineering; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01494379321309965,"gpt":0.2809704708934667,"spread":0.2660266776803671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383185,0.0002480454,0.0004687821,0.0001094576,0.0001172533,0.00003668182,0.000362723,0.0001300564,0.00007310308],"category_scores_gemma":[0.0005661104,0.0001663787,0.0001195784,0.0003543267,0.0003907264,0.0001167056,0.0001900567,0.000494393,0.000002847028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008730485,"about_ca_system_score_gemma":0.00001433843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004691803,"about_ca_topic_score_gemma":2.012676e-7,"domain_scores_codex":[0.9981375,0.00004859973,0.0008563009,0.0002242605,0.0003892276,0.0003441148],"domain_scores_gemma":[0.9987599,0.0003062122,0.0003182601,0.0002227854,0.0001883965,0.0002045008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002855385,0.0001582541,0.00006219443,0.00001398312,0.00005115737,0.00001717577,0.0004927212,0.2253123,0.6934621,0.05525678,0.00003029821,0.02485751],"study_design_scores_gemma":[0.00004153793,0.000254903,0.00002137536,0.0001113311,0.00002259091,0.00001637852,0.0003968273,0.5009738,0.4928932,0.005142961,0.00001959701,0.0001055297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6353276,0.0002155816,0.3635534,0.0004269899,0.0002409029,0.0001302419,0.000003233511,0.00005378725,0.00004818468],"genre_scores_gemma":[0.9797984,0.00002502369,0.01976135,0.0000759288,0.0002933506,0.000006285673,0.000002195183,0.0000280748,0.00000939046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3444707,"threshold_uncertainty_score":0.6784725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2570355113","doi":"10.1080/0952813x.2016.1264088","title":"Comparisons of several variants of continuous quantum-inspired evolutionary algorithms","year":2017,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Robustness (evolution); Evolutionary algorithm; Chaotic; Curse of dimensionality; Quantum; Convergence (economics); Algorithm; Exploit; Context (archaeology); Sensitivity (control systems); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04356117225472432,"gpt":0.3270788794935786,"spread":0.2835177072388542,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006655274,0.0001858869,0.0005645161,0.00009871309,0.0002914459,0.0001277268,0.001990916,0.00009643131,0.00007713734],"category_scores_gemma":[0.0001661556,0.0001450553,0.000291952,0.0001379734,0.001197292,0.0004650346,0.000619136,0.0003294292,0.000006887414],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004008458,"about_ca_system_score_gemma":0.0000952316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003668587,"about_ca_topic_score_gemma":6.625464e-7,"domain_scores_codex":[0.9974128,0.0001568848,0.001216065,0.0002437013,0.0006442455,0.0003262745],"domain_scores_gemma":[0.9974415,0.000257775,0.001178832,0.0005510586,0.0003863024,0.0001845884],"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.0002006256,0.0007529186,0.0002233764,0.000009900947,0.00005788116,0.00007784883,0.0004872463,0.002012494,0.04207823,0.9458414,0.0001196098,0.008138414],"study_design_scores_gemma":[0.0001236504,0.001050929,0.0008613191,0.0002010432,0.00001521659,0.0001340648,0.0003667711,0.5915051,0.3125756,0.09295484,0.00002692545,0.0001845758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3419043,0.0006646019,0.6545464,0.0006138158,0.001429435,0.0001330025,0.00000428339,0.00001487676,0.000689341],"genre_scores_gemma":[0.9652195,0.00002399656,0.03446076,0.00003336296,0.0002449743,0.000001019146,3.38365e-7,0.000009431902,0.00000662711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8528866,"threshold_uncertainty_score":0.5915184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040248557","doi":"10.1080/0952813x.2012.693686","title":"Modelling and simulating early stopping of RCTs: a case study of early stop due to harm","year":2012,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Meta-analysis and systematic reviews","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Interim; Harm; Early stopping; Computer science; Randomized controlled trial; Set (abstract data type); Publication; Interim analysis; Operations research; Medical physics; Risk analysis (engineering); Medicine; Artificial intelligence; Law; Political science","retraction":null,"screen_n_in":null,"score":{"opus":0.6478130151682211,"gpt":0.535393356659427,"spread":0.1124196585087941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.03298111,0.0002496648,0.002220576,0.0003911523,0.0001226873,0.0002347564,0.000708716,0.00006895565,0.001146756],"category_scores_gemma":[0.005045917,0.0001399016,0.0006143891,0.0007314726,0.0002741656,0.0004301439,0.0002199866,0.0002491979,0.00004592496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003385161,"about_ca_system_score_gemma":0.00002728673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001017266,"about_ca_topic_score_gemma":0.00000206083,"domain_scores_codex":[0.9856083,0.002634394,0.008173862,0.0003605774,0.002918599,0.000304261],"domain_scores_gemma":[0.9913663,0.003147864,0.003275391,0.0007469584,0.001070118,0.0003933877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.001003721,0.006220315,0.01561688,0.00008827091,0.0009002387,0.0007600861,0.3630746,0.07452063,0.06656391,0.4229659,0.00003910925,0.04824637],"study_design_scores_gemma":[0.0002921154,0.006294918,0.0003096656,0.0004458155,0.0006417232,0.00158391,0.4515492,0.2720401,0.2071626,0.05895901,0.00004066107,0.00068021],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8271614,0.0005027968,0.1715126,0.00003333727,0.0001916606,0.000393425,0.000002129904,0.000001290697,0.0002013121],"genre_scores_gemma":[0.992323,0.000001920448,0.007483464,0.0000280972,0.0001329738,0.000004408939,5.556745e-8,0.00001252085,0.00001360328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3640068,"threshold_uncertainty_score":0.9997663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029216481","doi":"10.1080/0952813x.2015.1020574","title":"Mixed continuous/binary quantum-inspired learning system with non-negative least square optimisation for automated design of regularised ensemble extreme learning machines","year":2015,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Evolutionary algorithm; Extreme learning machine; Ensemble learning; Quantum; Quantum computer; Artificial intelligence; Theoretical computer science; Algorithm; Mathematics; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.06153675217879966,"gpt":0.2997632748872603,"spread":0.2382265227084606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045772,0.0003086867,0.000625103,0.0002161936,0.0002664837,0.0001825582,0.0006410226,0.0001342348,0.00001660653],"category_scores_gemma":[0.0007595811,0.0002373302,0.000178567,0.0003966306,0.0004106421,0.0004368722,0.0001261945,0.0004377294,0.00001016411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001632691,"about_ca_system_score_gemma":0.000192047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003368227,"about_ca_topic_score_gemma":7.70012e-7,"domain_scores_codex":[0.9966748,0.0007885726,0.001037024,0.000370847,0.0007297134,0.0003990777],"domain_scores_gemma":[0.9970372,0.0006545763,0.0009628333,0.0002371394,0.000830853,0.0002774229],"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.003012355,0.0005268435,0.0001194334,0.00006780665,0.0001093089,0.00006960247,0.00927867,0.4429485,0.1208761,0.4140902,0.00005138148,0.008849913],"study_design_scores_gemma":[0.0003534747,0.004485108,0.00001722233,0.0002769055,0.00002823331,0.0001032244,0.007884274,0.7631962,0.219907,0.003523368,0.000009257152,0.0002157834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050245,0.0001091422,0.7936808,0.0001879754,0.0002893708,0.0003413372,8.516686e-7,0.0001621986,0.0002038262],"genre_scores_gemma":[0.903881,0.000001850429,0.0959107,0.00001407977,0.0001097335,0.00001842729,0.000002795171,0.00003155577,0.00002993838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6988564,"threshold_uncertainty_score":0.9678046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2089872474","doi":"10.1080/0952813031000064567","title":"Planning under uncertainty as G<scp>OLOG</scp>programs","year":2003,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Situation calculus; Computer science; Logic programming; Artificial intelligence; Popularity; Belief revision; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0449648265644681,"gpt":0.3262701779266343,"spread":0.2813053513621662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190992,0.0003113883,0.000427029,0.0001461282,0.0002505803,0.0003686709,0.001200477,0.0001854478,0.0002376797],"category_scores_gemma":[0.0007814512,0.0002367948,0.0003114633,0.0004658788,0.0008729469,0.0004207945,0.0002031292,0.0005709651,0.0002681178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001538032,"about_ca_system_score_gemma":0.0001842467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007138217,"about_ca_topic_score_gemma":8.914275e-7,"domain_scores_codex":[0.9970307,0.0003404195,0.0008809993,0.0004176478,0.0006765667,0.000653673],"domain_scores_gemma":[0.9979335,0.0006129614,0.0003619657,0.0003767465,0.0002826173,0.0004321837],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002704902,0.000573846,0.00007680838,0.000002858351,0.00003983442,0.0001382935,0.003009052,0.0008361446,0.01127014,0.9779989,0.0000857644,0.005941313],"study_design_scores_gemma":[0.00007839,0.001164777,0.000009612827,0.00005950349,0.00001430217,0.0004303364,0.005231159,0.006021883,0.3847556,0.6008579,0.001233292,0.0001432482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4038844,0.001939769,0.5549797,0.0002110364,0.001819916,0.0001978185,5.457962e-7,0.00008650922,0.03688027],"genre_scores_gemma":[0.9899931,0.00002186893,0.009213541,0.0004114178,0.0002503284,0.000006903666,6.875144e-7,0.00001850273,0.00008365205],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5861087,"threshold_uncertainty_score":0.9656212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4293052826","doi":"10.1080/0952813x.2022.2080868","title":"Blind separation of speech from aortic regurgitation signals using Dhoulath’s method","year":2022,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"Computer science; Separation (statistics); Speech recognition; Regurgitation (circulation); Blind signal separation; Telecommunications; Cardiology; Medicine; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.07129861354360725,"gpt":0.4128806467085715,"spread":0.3415820331649643,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002019542,0.0001557693,0.0003329923,0.0002560642,0.0001668087,0.0001265339,0.0007680642,0.00006753154,0.0006606543],"category_scores_gemma":[0.0001621562,0.0001481803,0.000200453,0.0005212975,0.0002098081,0.0005851116,0.0002748241,0.0003711466,0.000006661926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001592974,"about_ca_system_score_gemma":0.0001504639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002821628,"about_ca_topic_score_gemma":5.377159e-7,"domain_scores_codex":[0.9966397,0.0007569363,0.001189541,0.0002626324,0.0009628973,0.0001883057],"domain_scores_gemma":[0.9980628,0.0004632039,0.0007693439,0.0002945886,0.0003020825,0.0001080063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001853457,0.0002415822,0.000004159645,0.000001267489,0.00002040298,0.00001059288,0.003004845,0.005035805,0.4657572,0.5161311,0.00001110742,0.009596617],"study_design_scores_gemma":[0.00004119346,0.000417886,0.000002507259,0.00001230982,0.00001139574,0.00003372062,0.0009257588,0.1780597,0.5599029,0.2604889,0.00001894022,0.00008481351],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3153467,0.0001270206,0.6836004,0.0002999608,0.0002372032,0.0001384357,0.000003580785,0.00002302343,0.0002236835],"genre_scores_gemma":[0.7591624,0.000003435176,0.2405683,0.0001562534,0.00008814182,0.000005387928,0.000001899932,0.00001017889,0.000003989795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4438157,"threshold_uncertainty_score":0.7233701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4212937252","doi":"10.1080/0952813x.2021.1960630","title":"HLA: a novel hybrid model based on fixed structure and variable structure learning automata","year":2022,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Learning automata; Variable (mathematics); Dropout (neural networks); Convergence (economics); Automaton; Artificial intelligence; Artificial neural network; Margin (machine learning); Stability (learning theory); Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0225732030678148,"gpt":0.2877095505486438,"spread":0.265136347480829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005527256,0.0001861583,0.0002476104,0.0001750758,0.000445205,0.0002541556,0.0007814965,0.00004794305,0.001033957],"category_scores_gemma":[0.000158925,0.0001568371,0.00007766094,0.0003230066,0.0002616353,0.0002878664,0.0004131804,0.0008225659,0.000002251307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001158145,"about_ca_system_score_gemma":0.0001669741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002398632,"about_ca_topic_score_gemma":9.792501e-8,"domain_scores_codex":[0.9978184,0.0002044602,0.0005220762,0.0003163732,0.0008326072,0.0003061041],"domain_scores_gemma":[0.9989942,0.0001898919,0.00022144,0.0002463145,0.0001335053,0.0002146391],"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.00009713178,0.0001565238,0.000003273574,0.000002427733,0.000007471019,0.00001165157,0.0004209335,0.4519267,0.06482437,0.4810418,0.0000216444,0.001486058],"study_design_scores_gemma":[0.0001101223,0.0007384844,0.000001220581,0.00001482025,0.000004575524,0.00009200809,0.0002465742,0.7768483,0.1347353,0.08701205,0.00006136292,0.0001351902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04278912,0.00005347883,0.9554714,0.0008097663,0.0003083344,0.0001527581,0.00002434378,0.00004084219,0.000349978],"genre_scores_gemma":[0.8993683,0.000002726789,0.09992583,0.0006119294,0.00005232896,0.00000377912,0.00000360807,0.00001412568,0.00001740486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8565791,"threshold_uncertainty_score":0.9998792,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055186188","doi":"10.1080/0952813x.2010.535706","title":"Testing variation of attention capacities in a complex auto-adaptive system: a Stroop task simulation","year":2011,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Stroop effect; Computer science; Task (project management); Variation (astronomy); Cognition; Cognitive psychology; Artificial intelligence; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1543578522498606,"gpt":0.3222387473193616,"spread":0.1678808950695009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964931,0.0001356147,0.000253166,0.0001881404,0.00008093935,0.00003035044,0.0001787351,0.00006772153,0.0001255606],"category_scores_gemma":[0.0005713289,0.0001151672,0.0001001145,0.0003397602,0.0005166936,0.000311894,0.00004464284,0.0002082579,0.000009672262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001478028,"about_ca_system_score_gemma":0.00003067981,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004834662,"about_ca_topic_score_gemma":0.000001981606,"domain_scores_codex":[0.9980281,0.0002606224,0.0009160642,0.0001971397,0.0004072325,0.0001908407],"domain_scores_gemma":[0.9986697,0.0004373257,0.0005350073,0.0001003598,0.0001894248,0.00006817094],"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.000330814,0.0002023892,0.00003542265,0.000007642476,0.000003085755,0.00001222801,0.001177672,0.001398584,0.5793427,0.4166165,2.21155e-7,0.0008726923],"study_design_scores_gemma":[0.00006360681,0.0009483146,0.0009919595,0.00009404868,0.00001221405,0.00003707834,0.003184987,0.4672903,0.4806285,0.04665079,4.617713e-7,0.00009779912],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9053561,0.00001108724,0.09257738,0.00002000881,0.0003368222,0.0001917483,0.000006888404,0.00001603545,0.001483913],"genre_scores_gemma":[0.9978644,9.753666e-7,0.002004914,0.00003179395,0.00007895003,0.000003983852,7.456832e-7,0.00001150951,0.0000027125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4658917,"threshold_uncertainty_score":0.4696382,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964840444","doi":"10.1080/0952813021000028621","title":"A case study in the meta-reasoning procedure ND","year":2003,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Case-based reasoning; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06558557338037674,"gpt":0.3429439148182543,"spread":0.2773583414378775,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00156573,0.0001411781,0.0002335691,0.0001195479,0.0001361023,0.0002230424,0.0004285593,0.00004286594,0.000484326],"category_scores_gemma":[0.0004250734,0.00008614761,0.0001488835,0.0004584828,0.0002115815,0.0003564155,0.00004130969,0.0003181945,0.00001062954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004790997,"about_ca_system_score_gemma":0.00009780402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009687342,"about_ca_topic_score_gemma":0.00001284196,"domain_scores_codex":[0.9980776,0.0004808627,0.0006237425,0.0001903111,0.0004345153,0.000192973],"domain_scores_gemma":[0.9991346,0.0002544532,0.0001806746,0.0002111787,0.0001124564,0.0001066361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002187708,0.0007397389,0.0001828778,0.000001101574,0.00005602958,0.001697524,0.009738346,0.0005972329,0.0006670036,0.9832425,0.000007631397,0.003048155],"study_design_scores_gemma":[0.0005085146,0.003922486,0.0001137845,0.00006430507,0.0004172236,0.06736706,0.2457209,0.08810017,0.3215816,0.2712002,0.0001219647,0.0008817366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5638318,0.0003055825,0.4330084,0.0005209704,0.0003312436,0.0003744433,3.496647e-7,0.00001614885,0.001611044],"genre_scores_gemma":[0.9896849,0.000002844009,0.009996548,0.0002599239,0.00003501735,0.00001267308,5.225332e-8,0.000005221121,0.000002806797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7120423,"threshold_uncertainty_score":0.530303,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065798393","doi":"10.1080/09528130701475617","title":"Weighting strategy for non-clausal resolution","year":2008,"lang":"en","type":"article","venue":"Journal of Experimental & Theoretical Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Weighting; Satisfiability; Resolution (logic); Propositional formula; Propositional calculus; Algorithm; Propositional variable; Artificial intelligence; Theoretical computer science; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.06308542882193925,"gpt":0.3289339133434027,"spread":0.2658484845214634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007244505,0.0001968684,0.0003124072,0.0001156258,0.0003381478,0.0001218621,0.0008620864,0.0001174549,0.0001337451],"category_scores_gemma":[0.0002332686,0.0001532253,0.0002566523,0.0002480369,0.0005961036,0.0004828984,0.0001493405,0.0002887993,0.00006562663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001083717,"about_ca_system_score_gemma":0.0001563055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004035706,"about_ca_topic_score_gemma":8.098675e-7,"domain_scores_codex":[0.9979655,0.0000946475,0.0007933337,0.0002881239,0.0004322059,0.0004261681],"domain_scores_gemma":[0.9985752,0.0003149792,0.0003037193,0.0002368862,0.0003329719,0.0002362794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001517775,0.0003500255,0.00001492952,0.000003848393,0.00001697288,0.00005422253,0.001515984,0.000101353,0.05069203,0.9401452,0.0001906539,0.006763017],"study_design_scores_gemma":[0.0000914762,0.001459058,0.00002193945,0.00003858507,0.000008561588,0.0003299736,0.0005281459,0.0840838,0.6749897,0.2380568,0.0001894146,0.0002025711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1169928,0.0004582732,0.8749865,0.0002380379,0.0009215635,0.0001815638,0.00000124446,0.00003351659,0.00618649],"genre_scores_gemma":[0.9706243,0.00003088195,0.02854249,0.00009436258,0.0006432206,0.000008312844,6.585616e-7,0.00001262601,0.00004319765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8536314,"threshold_uncertainty_score":0.6248345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}