{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":168,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":168,"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":"8bdf710f9008","filters":{"venue":"National Conference on Artificial Intelligence"}},"results":[{"id":"W2284070151","doi":"","title":"What's in a Name? Using First Names as Features for Gender Inference in Twitter","year":2013,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Authorship Attribution and Profiling","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Classifier (UML); Inference; Computer science; Artificial intelligence; Social media; Natural language processing; Baseline (sea); Information retrieval; Machine learning; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.2696613820475069,"gpt":0.4140428855734447,"spread":0.1443815035259378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007564912,0.000221959,0.0002251841,0.0004307184,0.0001577659,0.0008565188,0.0007394249,0.0001806797,0.0003452779],"category_scores_gemma":[0.001184518,0.0002191452,0.00006773289,0.0006438184,0.00009315644,0.001575068,0.0001197377,0.0003809399,0.0003485966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000224015,"about_ca_system_score_gemma":0.0004374832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002697832,"about_ca_topic_score_gemma":0.0003640529,"domain_scores_codex":[0.9977378,0.0001164857,0.0005473691,0.0005889277,0.0005698897,0.0004395349],"domain_scores_gemma":[0.9980236,0.0008139715,0.0001446928,0.0002376325,0.0006765059,0.0001036131],"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.00003038254,0.000120014,0.0006435221,0.00001765581,0.000005344865,0.000003860294,0.002334476,0.007276491,0.0005901304,0.9589701,0.00005722823,0.02995074],"study_design_scores_gemma":[0.00005930999,0.00005802558,0.003060196,0.0001343322,0.000001187667,0.000003195648,0.000715495,0.4526847,0.007317478,0.5355757,0.0001269691,0.0002633804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1411749,0.0001654101,0.842651,0.01142354,0.001181064,0.001256201,0.000008435592,0.0001093411,0.002030144],"genre_scores_gemma":[0.9894788,0.00003751522,0.008753578,0.001350547,0.00007497396,0.0001620183,0.000009792398,0.000009419875,0.0001233978],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8483039,"threshold_uncertainty_score":0.8936483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W83133245","doi":"","title":"Thresholding for making classifiers cost-sensitive","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"","keywords":"Thresholding; Computer science; Artificial intelligence; Balanced histogram thresholding; Pattern recognition (psychology); Machine learning; Sensitivity (control systems); Histogram; Image (mathematics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1945087779740975,"gpt":0.3871194660419463,"spread":0.1926106880678488,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410741,0.000198229,0.0001764227,0.0002810632,0.0003037255,0.0004031119,0.0008458019,0.0001194509,0.0000315303],"category_scores_gemma":[0.0004026912,0.0002068172,0.00008104472,0.0004576385,0.0001434378,0.0005680525,0.00009416509,0.0002022475,0.0001396801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002429974,"about_ca_system_score_gemma":0.000267366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001487132,"about_ca_topic_score_gemma":0.00003227656,"domain_scores_codex":[0.9978239,0.00005808276,0.0004826392,0.0006250776,0.0006569392,0.0003533873],"domain_scores_gemma":[0.9977926,0.0004408709,0.0002291568,0.0003612912,0.001124047,0.00005205492],"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.00002153006,0.00006001296,0.000009546999,0.000003918525,0.000004168054,0.000001523458,0.00004353057,0.00042839,0.006044582,0.9192563,0.001435378,0.07269118],"study_design_scores_gemma":[0.00002502334,0.00005540259,0.0002910609,0.00003777448,0.000002217589,0.000003280962,0.00005667808,0.2909472,0.1518375,0.5535893,0.002930142,0.0002244495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002139609,0.000006200183,0.9706386,0.003659766,0.0002974159,0.0005790643,0.00007109621,0.0003419329,0.0241919],"genre_scores_gemma":[0.9190659,0.000004639559,0.07944835,0.0008642934,0.0001798584,0.0002007986,0.00005654,0.00001242043,0.0001672281],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9188519,"threshold_uncertainty_score":0.8433762,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2591794136","doi":"","title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16)","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1620840183145195,"gpt":0.3370774050326261,"spread":0.1749933867181065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001077037,0.0004314996,0.0004322725,0.0003072432,0.0003543565,0.0003518826,0.003002517,0.0002510699,0.0004164105],"category_scores_gemma":[0.001868207,0.0002677974,0.0002152199,0.0009466424,0.0008175321,0.0006440904,0.0004154257,0.0004492326,0.0006790655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002216305,"about_ca_system_score_gemma":0.0006423155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000571211,"about_ca_topic_score_gemma":0.0001199973,"domain_scores_codex":[0.9954046,0.0001053754,0.001055822,0.0009993372,0.001824533,0.000610321],"domain_scores_gemma":[0.9958293,0.0007514117,0.0005659446,0.0005846347,0.002112463,0.0001561966],"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.00008486435,0.000196104,0.00007720604,0.00001200197,0.0000162603,0.00000139519,0.0003803109,0.00004652433,0.01126157,0.8323689,0.0003056294,0.1552493],"study_design_scores_gemma":[0.00002469317,0.0002826024,0.0006692949,0.0002564832,0.000006960637,0.000006133382,0.0003867577,0.01222373,0.3431734,0.6424562,0.0002037012,0.0003100705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08614654,0.00006265093,0.7278299,0.05780819,0.003560549,0.001531241,0.00008948195,0.0005940369,0.1223774],"genre_scores_gemma":[0.9961903,0.00006132558,0.002096662,0.0008367788,0.0001967916,0.00005248295,0.000001486873,0.00001691809,0.000547247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9100438,"threshold_uncertainty_score":0.9999774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167994996","doi":"","title":"Partial pathfinding using map abstraction and refinement","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Pathfinding; Computer science; Heuristic; Domain (mathematical analysis); Process (computing); Path (computing); Function (biology); Motion planning; Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Programming language; Mathematics; Shortest path problem; Robot","retraction":null,"screen_n_in":null,"score":{"opus":0.1908300048191129,"gpt":0.3618077080581525,"spread":0.1709777032390396,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020961,0.0001369859,0.0001082739,0.0001506978,0.0003047046,0.0002869339,0.0002643669,0.00007478159,0.0001296878],"category_scores_gemma":[0.0001030239,0.0001395699,0.00002982535,0.0001693964,0.0000488965,0.0004351197,0.00006393177,0.0002177938,0.0001924998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125068,"about_ca_system_score_gemma":0.0001756344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003824419,"about_ca_topic_score_gemma":0.00001974616,"domain_scores_codex":[0.9984971,0.00005267314,0.0003337686,0.0003795312,0.0005022947,0.0002345825],"domain_scores_gemma":[0.9992464,0.0001561051,0.0001357597,0.0001419869,0.0002323063,0.00008742409],"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.00002017558,0.00006894961,0.0000820284,0.000007458731,0.000007959638,0.0000038191,0.0005553389,0.02238016,0.004778466,0.7219204,0.0001142854,0.2500609],"study_design_scores_gemma":[0.0000267854,0.00007355007,0.0002017848,0.00006967636,0.000003519275,0.000008403925,0.00006339703,0.9318553,0.02677323,0.03836534,0.00235012,0.0002089332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04485276,0.00005637815,0.9451666,0.005632508,0.0004412541,0.0001463107,0.000008560251,0.000134902,0.003560674],"genre_scores_gemma":[0.9670293,0.000007858142,0.0322697,0.0003685495,0.0002305802,0.000007698942,0.000005924791,0.000005347178,0.00007501959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9221765,"threshold_uncertainty_score":0.5691494,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1604446916","doi":"","title":"Bayesian reputation modeling in E-marketplaces sensitive to subjecthity, deception and change","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":114,"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":"Deception; Computer science; Reputation; Heuristics; Interpretation (philosophy); Probabilistic logic; Artificial intelligence; Subjectivity; Bayesian probability; Machine learning; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.3735827409160826,"gpt":0.4420146932122569,"spread":0.06843195229617433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002684964,0.0001296519,0.0001586185,0.000509516,0.0001751431,0.0003219369,0.0002161924,0.00008097004,0.0001651906],"category_scores_gemma":[0.001506273,0.0001214897,0.00003183897,0.0008746834,0.000084635,0.0004300856,0.00005365265,0.0001483009,0.0003644906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007865379,"about_ca_system_score_gemma":0.00007466379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002718026,"about_ca_topic_score_gemma":0.00255751,"domain_scores_codex":[0.9975265,0.0002301989,0.0005822986,0.0005346597,0.0009400001,0.0001863321],"domain_scores_gemma":[0.9981279,0.0006997781,0.0001209684,0.0001568319,0.0008198122,0.00007469556],"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.0001562565,0.0001076714,0.0001907952,0.00000170067,0.000001771387,0.000002078573,0.001335393,0.03855959,0.003766466,0.7838349,0.00005049768,0.1719929],"study_design_scores_gemma":[0.00001436882,0.00003108987,0.002758577,0.00001782592,0.000001202068,0.000001795387,0.001000109,0.4281565,0.003810327,0.5640832,0.00002657872,0.00009841295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5557781,0.000005484882,0.4293205,0.005246829,0.00008443541,0.0004049985,0.00002132348,0.00003426988,0.009104028],"genre_scores_gemma":[0.9979765,0.000005058059,0.001241992,0.0004157918,0.0001221343,0.0000778108,0.00001408736,0.000006256171,0.0001403476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4421984,"threshold_uncertainty_score":0.4954207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W209492218","doi":"","title":"Hidden naive Bayes","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":98,"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; Bayesian programming; Artificial intelligence; Bayesian network; Machine learning; Computer science; Conditional independence; Bayes' theorem; Bayesian probability; Estimator; Bayes error rate; Pattern recognition (psychology); Algorithm; Data mining; Mathematics; Bayes factor; Bayes classifier; Statistics; Support vector machine","retraction":null,"screen_n_in":null,"score":{"opus":0.1332457761803776,"gpt":0.3481089768628088,"spread":0.2148632006824312,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005105722,0.0002257719,0.0001837818,0.0002171076,0.0002315678,0.0004001784,0.00123113,0.0001234514,0.0004247722],"category_scores_gemma":[0.0002785027,0.0002182316,0.00008259813,0.0004505684,0.0001160157,0.0006452909,0.0001372354,0.0003349476,0.003147845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001281393,"about_ca_system_score_gemma":0.0003935029,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001930996,"about_ca_topic_score_gemma":0.00003817644,"domain_scores_codex":[0.9975525,0.00008389781,0.0004623935,0.0006148189,0.0009177798,0.0003685869],"domain_scores_gemma":[0.9983137,0.0002080462,0.0001248044,0.0003542783,0.000833093,0.0001661394],"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.000007979001,0.0000760165,0.000003979003,0.000001490445,0.000005357285,0.00000179401,0.0001984478,0.0008738412,0.0007008198,0.6893758,0.0003481296,0.3084063],"study_design_scores_gemma":[0.00002005938,0.0000918946,0.00008714061,0.00003109207,0.000002126517,0.000006797943,0.0000466778,0.4772179,0.02894075,0.4922667,0.00102187,0.0002669569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002207579,0.00003933614,0.9378863,0.01196043,0.000301369,0.0001337771,0.000009955771,0.0002652136,0.04719605],"genre_scores_gemma":[0.9603268,0.0000283172,0.03703853,0.001800926,0.0003225366,0.00002802164,0.000006123391,0.000009622076,0.0004391147],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9581192,"threshold_uncertainty_score":0.9976283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W19153916","doi":"10.1080/00048670802607154","title":"A framework for representing and solving NP search problems","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Constraint satisfaction problem; Answer set programming; Constraint programming; Parameterized complexity; Computer science; Constraint satisfaction; Extension (predicate logic); Satisfiability; Boolean satisfiability problem; Set (abstract data type); Theoretical computer science; Solver; Strengths and weaknesses; Backtracking; Constraint (computer-aided design); Mathematical optimization; Programming language; Mathematics; Artificial intelligence; Algorithm; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.2083022900782457,"gpt":0.3866366578885083,"spread":0.1783343678102626,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009645208,0.0001502718,0.0001524644,0.0001491809,0.0003555831,0.0004894396,0.0005948741,0.0001124307,0.00006720248],"category_scores_gemma":[0.001352691,0.0001412029,0.00005788861,0.0003037931,0.0001092156,0.0004107865,0.0001793735,0.0002613326,0.0001170001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006389032,"about_ca_system_score_gemma":0.0002094692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001367171,"about_ca_topic_score_gemma":0.00004961733,"domain_scores_codex":[0.9981775,0.00006033606,0.0003325891,0.0005692844,0.0005023201,0.0003580163],"domain_scores_gemma":[0.9979953,0.0008015443,0.00009865077,0.0002296977,0.0007628423,0.0001119186],"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.000008458258,0.00006072026,0.00005900293,0.00001048513,0.000005858249,5.296998e-7,0.0009449069,0.0006875041,0.0005532519,0.8416809,0.00007571036,0.1559126],"study_design_scores_gemma":[0.00001965027,0.00006729896,0.0001080255,0.00004953081,0.000001661474,0.000004450539,0.00007024685,0.4523407,0.007587567,0.5384727,0.001132256,0.0001458974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245312,0.00009548604,0.9782361,0.004834598,0.0001975451,0.0003234149,0.000004053729,0.0001121786,0.01295132],"genre_scores_gemma":[0.9019688,0.0000263159,0.0969623,0.0003437997,0.0003441234,0.00005437749,0.000002777247,0.000007847427,0.0002896302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8987235,"threshold_uncertainty_score":0.5758089,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125336041","doi":"","title":"Generalized nogoods in CSPs","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":84,"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":"Solver; Computer science; Boolean satisfiability problem; Mathematical optimization; Yield (engineering); Artificial intelligence; Theoretical computer science; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1145998237209562,"gpt":0.3476652843411281,"spread":0.2330654606201719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854817,0.0001306389,0.0001228227,0.0003131708,0.00009213348,0.000184638,0.0004305058,0.00007813715,0.0007465421],"category_scores_gemma":[0.0001938194,0.0001359837,0.00004427219,0.0005435183,0.00005961433,0.0004912778,0.00005111668,0.0001877977,0.0006811395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001556507,"about_ca_system_score_gemma":0.0002457108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002114101,"about_ca_topic_score_gemma":0.0003390549,"domain_scores_codex":[0.9984223,0.00007768898,0.0003981447,0.0003673489,0.000524693,0.0002098341],"domain_scores_gemma":[0.999227,0.0001083102,0.00008696192,0.0001831595,0.0003190459,0.00007555398],"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.000008170186,0.00005651918,0.00006331361,7.503559e-7,0.000001724894,0.000001160195,0.0001393375,0.0183187,0.0003856324,0.7184158,0.00006182664,0.2625471],"study_design_scores_gemma":[0.00005816862,0.00003708455,0.001527327,0.00001696569,8.460962e-7,0.000004765955,0.00003519097,0.8696401,0.01286407,0.1143181,0.001295974,0.0002014121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007964488,0.00001372893,0.9436952,0.01270048,0.0003265194,0.0001917076,0.000005328826,0.0001432688,0.03495928],"genre_scores_gemma":[0.9621134,0.00002652579,0.03623861,0.001291452,0.0001051049,0.00002114734,0.000006625835,0.000004910748,0.0001922158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9541489,"threshold_uncertainty_score":0.8754898,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2408500447","doi":"","title":"Telepresence Robot for Home Care Assistance.","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Healthcare Technology and Patient Monitoring","field":"Medicine","cited_by":73,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Teleoperation; Telerobotics; Telehealth; Robot; Telemedicine; Variety (cybernetics); Mobile robot; Computer science; Human–computer interaction; Aging in place; Videoconferencing; Multimedia; Health care; Medicine; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.2237908590550581,"gpt":0.4398887783827019,"spread":0.2160979193276438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005234234,0.0001450279,0.0001996753,0.0002376908,0.0002070166,0.00002187244,0.0001654895,0.0002205136,0.00009980861],"category_scores_gemma":[0.0008298457,0.0001405479,0.000073841,0.0003045424,0.0001417598,0.00007366007,0.00002036819,0.0003427773,0.0001170454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002259838,"about_ca_system_score_gemma":0.0003647324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001903938,"about_ca_topic_score_gemma":0.0001084436,"domain_scores_codex":[0.9983221,0.00001873284,0.0004167499,0.000360626,0.0005284855,0.000353332],"domain_scores_gemma":[0.9977812,0.0003927189,0.00009821425,0.0001891578,0.001400428,0.0001383308],"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.000825702,0.0001539939,0.005870007,0.00009746677,0.00002002242,0.0000157558,0.0004450807,0.0001171432,0.004654925,0.5237831,0.0001113273,0.4639055],"study_design_scores_gemma":[0.0004907644,0.003529982,0.07003824,0.001020261,0.0000664175,0.00004651631,0.007416526,0.008456294,0.6615977,0.2362854,0.009916119,0.001135743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3779593,0.0003782104,0.5744125,0.008004108,0.002505791,0.002156939,0.0001059145,0.0005627299,0.03391449],"genre_scores_gemma":[0.9933788,0.00001927165,0.005551339,0.0003857721,0.0003703371,0.00005295759,0.00004302618,0.00001308659,0.0001854234],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6569428,"threshold_uncertainty_score":0.5731379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W26302103","doi":"10.1037/pas0000140","title":"Coordination and adaptation in impromptu teams","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Fundación Florencio Fiorini","keywords":"Impromptu; Computer science; Teamwork; Joins; Adaptation (eye); Robot; Adversarial system; Key (lock); Multi-agent system; Human–computer interaction; Domain (mathematical analysis); Knowledge management; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.1242522798037863,"gpt":0.3337074939629375,"spread":0.2094552141591512,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406448,0.0001174798,0.0001131264,0.0002672599,0.00009781923,0.0001765404,0.0002491736,0.00007639336,0.00005055995],"category_scores_gemma":[0.0002052727,0.0001180758,0.000022453,0.000326224,0.00003595492,0.0006845994,0.00004155933,0.0001342427,0.000189099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001507568,"about_ca_system_score_gemma":0.000127103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009357456,"about_ca_topic_score_gemma":0.0006178651,"domain_scores_codex":[0.9984763,0.00007668272,0.0004244595,0.0003684733,0.0004901813,0.0001639301],"domain_scores_gemma":[0.9992238,0.0001216121,0.0001384724,0.0001284883,0.0003307642,0.00005682554],"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.000007410503,0.00006982928,0.0001281532,0.000003364215,0.000001779371,5.549931e-7,0.0006380827,0.002341144,0.001756318,0.6919901,0.0000300643,0.3030332],"study_design_scores_gemma":[0.00004743092,0.000054221,0.003928248,0.00002876082,8.049377e-7,0.00000240085,0.0001376241,0.9455524,0.005579915,0.04424347,0.0002912817,0.0001334094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.095767,0.00004862598,0.8889371,0.007940492,0.0003336853,0.0004558826,0.000005660998,0.0001100085,0.006401609],"genre_scores_gemma":[0.9911941,0.00001418288,0.008265118,0.0002469039,0.0001040978,0.00003108125,0.000007649629,0.000004528254,0.0001322963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9432113,"threshold_uncertainty_score":0.481499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113932434","doi":"","title":"Clause learning can effectively P-simulate general propositional resolution","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":49,"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":"DPLL algorithm; Mathematical proof; Computer science; Resolution (logic); Class (philosophy); Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1641521181636323,"gpt":0.3675864209641359,"spread":0.2034343028005036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000883504,0.0002124215,0.0001747254,0.0002826897,0.0006644881,0.0001419168,0.0006716935,0.000134221,0.00007863159],"category_scores_gemma":[0.0008523706,0.000217288,0.00007879912,0.0006237621,0.0002326784,0.0005660066,0.0001077465,0.0004844342,0.0004028694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003173907,"about_ca_system_score_gemma":0.0004663067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004844966,"about_ca_topic_score_gemma":0.00001310598,"domain_scores_codex":[0.9971208,0.000402107,0.0004547645,0.0005933681,0.001090853,0.000338095],"domain_scores_gemma":[0.9981141,0.0002235509,0.0002079539,0.0002570842,0.00107675,0.0001205367],"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.00005269765,0.0001063072,0.00006589812,0.000004411057,0.000009491743,0.000007885247,0.0003960788,0.03530156,0.004547385,0.9363451,0.00005380775,0.02310938],"study_design_scores_gemma":[0.00004284507,0.0002601304,0.004379443,0.00002755444,0.000002542346,0.00003591526,0.00001801493,0.817826,0.04702513,0.1298658,0.0002548607,0.0002617272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04774278,0.00001281876,0.9415364,0.001039643,0.0004548326,0.0003241331,0.000009462222,0.0002512403,0.008628651],"genre_scores_gemma":[0.8815755,0.00002129262,0.117518,0.0002836619,0.0001861966,0.00005349231,0.00002288745,0.00001094427,0.0003281226],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8338327,"threshold_uncertainty_score":0.8860749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165796360","doi":"","title":"Distance metric learning vs. Fisher discriminant analysis","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":49,"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":"Metric (unit); Linear discriminant analysis; Discriminant; Computer science; Semidefinite programming; Artificial intelligence; Class (philosophy); Kernel Fisher discriminant analysis; Iterative method; Machine learning; Optimal discriminant analysis; Mathematical optimization; Algorithm; Mathematics; Pattern recognition (psychology)","retraction":null,"screen_n_in":null,"score":{"opus":0.1373598051135781,"gpt":0.3309964840608148,"spread":0.1936366789472366,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003467289,0.0001777258,0.0002307186,0.0006053225,0.0004421214,0.0001807696,0.0006492216,0.00008418535,0.0004298315],"category_scores_gemma":[0.0004871529,0.0001582526,0.0001490219,0.002298491,0.0001111299,0.0005286722,0.00009679663,0.000299479,0.0007517807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008089351,"about_ca_system_score_gemma":0.000159722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006313965,"about_ca_topic_score_gemma":0.00005692513,"domain_scores_codex":[0.9978019,0.0001192308,0.0003985559,0.0005504058,0.0008470072,0.0002829084],"domain_scores_gemma":[0.9985793,0.0002513451,0.0001591107,0.0002461747,0.0006472588,0.0001168713],"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.00008041418,0.0003852652,0.001713762,0.000009401915,0.000115498,0.00003225163,0.001156406,0.01926563,0.00128996,0.8381364,0.001268923,0.1365461],"study_design_scores_gemma":[0.00004981942,0.0002158073,0.01275509,0.00004493711,0.00004305588,0.00001026435,0.0002193081,0.8766533,0.02458731,0.08140088,0.003463313,0.0005569278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01391991,0.00003070317,0.9696442,0.001906639,0.0002421377,0.0001128839,0.000006850473,0.0001422973,0.01399438],"genre_scores_gemma":[0.9942145,0.00009071775,0.004228186,0.0004347352,0.00006083679,0.0000285832,0.0000258259,0.000006431922,0.0009101698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9802946,"threshold_uncertainty_score":0.966287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W15128715","doi":"10.1093/heapro/dah211","title":"Design of a mechanism for promoting honesty in E-marketplaces","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":41,"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":"Eunice Kennedy Shriver National Institute of Child Health and Human Development","keywords":"Reputation; Honesty; Forward auction; Business; Profit (economics); Incentive; Mechanism (biology); Order (exchange); Trustworthiness; Ask price; E-commerce; Internet privacy; Computer science; Marketing; World Wide Web; Microeconomics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3735224080372475,"gpt":0.4656751373509016,"spread":0.09215272931365409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009219293,0.0001040114,0.0001783108,0.0003999644,0.0001354044,0.0000665328,0.0004602877,0.00008493966,0.0003146419],"category_scores_gemma":[0.006975885,0.00008957854,0.00005434973,0.0008195111,0.0001266123,0.0001668891,0.00002807144,0.0001200595,0.0001252989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004870845,"about_ca_system_score_gemma":0.0001911579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007165766,"about_ca_topic_score_gemma":0.00006298209,"domain_scores_codex":[0.9974607,0.0001400351,0.0008930841,0.0003694459,0.0009406446,0.0001960919],"domain_scores_gemma":[0.9935266,0.004275966,0.0003511367,0.0001736411,0.001615046,0.00005763417],"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.0001946947,0.0001219567,0.00002088092,0.000002139843,0.000002464031,3.287447e-7,0.0003981171,0.00167015,0.01566315,0.9185079,0.00002280888,0.06339546],"study_design_scores_gemma":[0.00002165988,0.000068309,0.0001307213,0.0000145749,0.000001218297,9.383762e-7,0.0008259094,0.07068575,0.2071111,0.7210293,0.00004107375,0.00006951817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02385339,0.000002907564,0.9714028,0.0009227455,0.0001326057,0.0005008235,0.00001526431,0.0000188212,0.003150592],"genre_scores_gemma":[0.9898163,0.00000239925,0.009706237,0.0001204172,0.00005637893,0.00006301353,0.000002745163,0.00000563271,0.0002268716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9659629,"threshold_uncertainty_score":0.835129,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2912371510","doi":"","title":"Inconsistent heuristics","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Consistency (knowledge bases); Computer science; Mathematical optimization; Quality (philosophy); Field (mathematics); Incremental heuristic search; Consistent heuristic; Null-move heuristic; Artificial intelligence; Mathematics; Algorithm; Beam search; Search algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1535880570324106,"gpt":0.353923593111494,"spread":0.2003355360790834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137887,0.0001532541,0.0001292514,0.0002146952,0.0002412476,0.0002171479,0.0006896973,0.00009240538,0.000102448],"category_scores_gemma":[0.0005346451,0.0001513523,0.00005453379,0.0004278469,0.0000851149,0.0001920521,0.00009082241,0.0002864956,0.0006749113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009825225,"about_ca_system_score_gemma":0.0002912795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002251176,"about_ca_topic_score_gemma":0.00004028708,"domain_scores_codex":[0.9980426,0.00005164325,0.0004304535,0.0003900651,0.0007563249,0.0003288631],"domain_scores_gemma":[0.9981987,0.0006157865,0.0001287454,0.0002504465,0.0006684188,0.0001379292],"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.00001623961,0.00006048625,0.00006910803,0.000003403903,0.000005386828,0.00001481921,0.0001969012,0.00105834,0.0003715126,0.8905107,0.0003039524,0.1073891],"study_design_scores_gemma":[0.00003327517,0.0002155466,0.000944539,0.0000815984,0.000003995863,0.00001774349,0.0001351007,0.2883888,0.03038204,0.6761181,0.003259766,0.000419399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001643813,0.00002418704,0.9496124,0.00218558,0.0004897408,0.00009865915,0.000006896587,0.0001575928,0.04578113],"genre_scores_gemma":[0.9700342,0.000004949286,0.02853072,0.001027787,0.0001369271,0.000004859271,0.000008209756,0.000006275321,0.0002460503],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9683904,"threshold_uncertainty_score":0.8674845,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2403646712","doi":"","title":"Assistive Technologies and Children-Robot Interaction.","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Social Robot Interaction and HRI","field":"Psychology","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Human–computer interaction; Modalities; Mobile robot; Multitude; Humanoid robot; Variety (cybernetics); Robot; Computer science; Autism; Social robot; Mobile interaction; Artificial intelligence; Robot control; Psychology; Mobile device; Developmental psychology; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.1813624204816834,"gpt":0.445239510840964,"spread":0.2638770903592806,"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.0004485663,0.0001669767,0.0001540381,0.000320166,0.0002196023,0.00009952428,0.0001898493,0.0001895608,0.002398041],"category_scores_gemma":[0.000552443,0.0001656272,0.00005546302,0.0002928238,0.0002587174,0.000142827,0.00004395649,0.0004520188,0.001426803],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001146353,"about_ca_system_score_gemma":0.0000544832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001173668,"about_ca_topic_score_gemma":0.0002108502,"domain_scores_codex":[0.9985461,0.00004873327,0.0003810963,0.0004000158,0.0003594741,0.0002645633],"domain_scores_gemma":[0.9987199,0.0004743582,0.0001538014,0.0001342938,0.0004520457,0.00006561585],"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.0001693808,0.0001454037,0.0005707406,7.814374e-7,0.00003479741,0.000003918168,0.0004078227,0.00001478924,0.0004553555,0.6837975,0.000505791,0.3138937],"study_design_scores_gemma":[0.0003073181,0.001057218,0.3913048,0.0001810707,0.00005764371,0.0001909054,0.05823866,0.002008397,0.0600566,0.4766127,0.008413096,0.001571625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.183119,0.0002134023,0.2047645,0.01044397,0.005300275,0.0008974425,0.00007018558,0.001151874,0.5940393],"genre_scores_gemma":[0.9979199,0.00001839619,0.0004605921,0.0005009382,0.0001866059,0.0000245986,0.0000137513,0.00001183447,0.0008634396],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8148009,"threshold_uncertainty_score":0.9993507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1666476","doi":"","title":"Speeding up learning in real-time search via automatic state abstraction","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Abstraction; Heuristic; Path (computing); Beam search; State (computer science); Search algorithm; Bidirectional search; Domain (mathematical analysis); Artificial intelligence; Incremental heuristic search; Machine learning; Algorithm; Programming language; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1356894275948526,"gpt":0.3713096644721848,"spread":0.2356202368773322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00145085,0.0001933736,0.0002026783,0.000479977,0.0001863887,0.0003051513,0.0006512057,0.00009334555,0.0002230469],"category_scores_gemma":[0.0003809694,0.0002089169,0.00004586501,0.0006734386,0.0000694149,0.0007591053,0.00009347584,0.0005687453,0.002953625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003689937,"about_ca_system_score_gemma":0.0003424292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001236414,"about_ca_topic_score_gemma":0.00002326503,"domain_scores_codex":[0.9972048,0.0001593392,0.0005867786,0.0005305751,0.001088248,0.0004302335],"domain_scores_gemma":[0.9986137,0.0004650853,0.0001622912,0.0001990351,0.0004431724,0.000116703],"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.00001352717,0.0001087592,0.00008188446,0.000007374518,0.000007348375,0.00001519598,0.001445232,0.3438849,0.01003977,0.04896372,0.00004593795,0.5953863],"study_design_scores_gemma":[0.000033119,0.00007973662,0.002623888,0.00007279104,0.000001169907,0.00001205536,0.00007047093,0.962328,0.01502866,0.01950496,0.00003624996,0.0002089604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08302116,0.000008759369,0.896251,0.003032662,0.0005235338,0.0003174663,0.000003779642,0.0005188519,0.01632275],"genre_scores_gemma":[0.9493226,0.00001747826,0.04960012,0.00008847412,0.0001402076,0.00001370462,0.000008611313,0.00001179293,0.0007970121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8663014,"threshold_uncertainty_score":0.9978227,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W165596894","doi":"","title":"A polynomial-time algorithm for action-graph games","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":28,"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":"Graph; Time complexity; Representation (politics); Mathematics; Polynomial; Bounded function; Theoretical computer science; Context (archaeology); Computer science; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.275005480657108,"gpt":0.4442738635759108,"spread":0.1692683829188028,"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.001790717,0.0001830321,0.0002301914,0.0003844682,0.0003973072,0.0003950776,0.0006933276,0.0001113625,0.002154955],"category_scores_gemma":[0.001186717,0.0001575089,0.0001733949,0.0007841294,0.0002557827,0.0002566307,0.00003813329,0.000152009,0.003623519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006150048,"about_ca_system_score_gemma":0.000241583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000382283,"about_ca_topic_score_gemma":0.00006005174,"domain_scores_codex":[0.9970394,0.0001173818,0.0007520819,0.0005961537,0.001217379,0.0002775687],"domain_scores_gemma":[0.99568,0.002110654,0.0002687743,0.0003131659,0.001538501,0.00008884898],"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.00004640556,0.0001713672,0.000006906972,7.395284e-7,0.000006268843,3.276891e-7,0.00003776781,0.0009561442,0.005621312,0.5474086,0.01306276,0.4326814],"study_design_scores_gemma":[0.00003512753,0.00007216541,0.00025959,0.000007107263,0.000005466434,0.000002442318,0.0002234814,0.0878851,0.03216468,0.8612128,0.01794606,0.0001859262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01577238,0.00002067143,0.9234517,0.005708926,0.0004723719,0.0007244367,0.0003936121,0.0001444512,0.0533115],"genre_scores_gemma":[0.9823365,0.0000036499,0.008741152,0.00037283,0.0005319407,0.0001962829,0.00004927987,0.00001310752,0.007755314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9665641,"threshold_uncertainty_score":0.9987572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2171494278","doi":"","title":"Software testing by active learning for commercial games","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Correctness; Video game; Context (archaeology); Software engineering; Software performance testing; Artificial intelligence; White-box testing; Software; Active learning (machine learning); Machine learning; Human–computer interaction; Software construction; Software system; Multimedia; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1677952999861552,"gpt":0.367221644746226,"spread":0.1994263447600709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492026,0.0001975351,0.0001775171,0.0001561435,0.0004196099,0.0002746581,0.0007443546,0.0001048541,0.000038535],"category_scores_gemma":[0.00638142,0.0002044574,0.00007922899,0.0003884084,0.00009354356,0.0003947336,0.0001062781,0.0003285767,0.0000902721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001396919,"about_ca_system_score_gemma":0.0002497496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003012149,"about_ca_topic_score_gemma":0.00001151094,"domain_scores_codex":[0.9981986,0.00007444854,0.0003519996,0.0005054307,0.0005392061,0.0003302945],"domain_scores_gemma":[0.9962119,0.002224769,0.0001820749,0.000192988,0.001096351,0.00009185479],"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.00002027314,0.00009055308,0.0001461742,0.000004307231,0.000006952087,3.965962e-7,0.0002069431,0.001208571,0.0003215058,0.1177773,0.004473443,0.8757436],"study_design_scores_gemma":[0.00004746905,0.0003573811,0.0004891561,0.00009350755,0.000005122787,0.000004809984,0.00002556935,0.5101072,0.03686424,0.4477446,0.003842157,0.0004187551],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001462937,0.00002045603,0.9905042,0.001944,0.0001419034,0.0002421065,0.00001742238,0.003142001,0.002524942],"genre_scores_gemma":[0.7733667,0.000002830809,0.2254465,0.000751526,0.0001910056,0.00008542607,0.00001681928,0.00001246042,0.0001267431],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8753248,"threshold_uncertainty_score":0.8337532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W27158770","doi":"10.1002/mus.25180","title":"Lookahead Pathology in Real-Time Path-Finding.","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Computer science; Heuristic; Path (computing); Artificial intelligence; Machine learning; Limit (mathematics); Minimax; Iterative deepening depth-first search; Search algorithm; Mathematical optimization; Beam search; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1042930468839758,"gpt":0.3498257379447338,"spread":0.2455326910607579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001171769,0.0003542688,0.0003737606,0.0006530509,0.0002064275,0.0003356184,0.00153266,0.0002538752,0.0004892964],"category_scores_gemma":[0.0005046328,0.0003699083,0.0001158103,0.001139432,0.0003226463,0.0006012116,0.0002033183,0.0004484988,0.004088068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003113867,"about_ca_system_score_gemma":0.000450569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004304119,"about_ca_topic_score_gemma":0.0004889253,"domain_scores_codex":[0.995916,0.0002486872,0.00105672,0.0009975324,0.001082249,0.0006987849],"domain_scores_gemma":[0.9977551,0.0006211197,0.0002653379,0.0005452834,0.0006948423,0.0001183452],"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.00002863354,0.0002927858,0.0002308547,0.000003768778,0.000003443839,0.00007796364,0.0002524237,0.00316566,0.01365742,0.9317919,0.0003663514,0.0501288],"study_design_scores_gemma":[0.00002708598,0.0001627094,0.001872595,0.00005856797,0.000002256238,0.0000178933,0.00008948873,0.2109129,0.05897317,0.7271907,0.0002679073,0.0004247635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1702236,0.00007646389,0.5812294,0.008655443,0.001601749,0.001052371,0.00004623393,0.0008813078,0.2362334],"genre_scores_gemma":[0.9893902,0.00003518972,0.0091066,0.0003544683,0.0002472441,0.00006894255,0.00001893757,0.00002081989,0.000757602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8191665,"threshold_uncertainty_score":0.9998753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W167277932","doi":"","title":"Dual search in permutation state spaces","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Dual (grammatical number); Duality (order theory); State (computer science); Permutation (music); Computer science; Symmetry (geometry); Search algorithm; Theoretical computer science; Mathematics; Algorithm; Combinatorics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.07908508805931216,"gpt":0.3512358228709673,"spread":0.2721507348116552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006688187,0.0001290554,0.0001159231,0.0003121823,0.000122637,0.0003536716,0.0003808269,0.00004883665,0.000103439],"category_scores_gemma":[0.0001359313,0.0001264323,0.00003382333,0.0005760358,0.00006947054,0.0003153152,0.00006371716,0.0003045941,0.0004469521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008657825,"about_ca_system_score_gemma":0.0002341377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005652992,"about_ca_topic_score_gemma":0.0003257468,"domain_scores_codex":[0.9980892,0.0001346016,0.0003233088,0.000397078,0.0007913481,0.0002644882],"domain_scores_gemma":[0.999175,0.0001960066,0.00006989841,0.0001437981,0.0003667827,0.00004857729],"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.00001032454,0.0001034464,0.0002417917,0.000003045937,0.000001594075,0.00001259059,0.0003434255,0.05437947,0.0006979308,0.8347312,0.00004503984,0.1094301],"study_design_scores_gemma":[0.00002544697,0.00006668628,0.005198099,0.00001792282,4.061532e-7,0.000003645438,0.00006446303,0.6982551,0.007533861,0.2885625,0.0001302312,0.0001416306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1663788,0.00002358403,0.8006171,0.007211635,0.0003659668,0.0002145138,0.0000115262,0.000175422,0.02500148],"genre_scores_gemma":[0.9937832,0.000004947341,0.005308911,0.0001363852,0.0001235237,0.00001246028,0.00001371266,0.000005734155,0.0006110612],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8274045,"threshold_uncertainty_score":0.5744814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W35529797","doi":"10.21037/tlcr-21-765","title":"A logical theory of coordination and joint ability","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Logical consequence; Joint (building); Situation calculus; Plan (archaeology); State (computer science); Logical framework; Artificial intelligence; Algorithm; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1509613474423319,"gpt":0.3399982285619941,"spread":0.1890368811196622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002565332,0.0001211082,0.0001707973,0.0001567519,0.0001096475,0.00007534408,0.0003232177,0.00009573934,0.0001181072],"category_scores_gemma":[0.00138194,0.0001017841,0.00005290553,0.0003174065,0.0002640936,0.0002052003,0.0001089416,0.0001641643,0.00006158263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006291333,"about_ca_system_score_gemma":0.0001466811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000925602,"about_ca_topic_score_gemma":0.0000281036,"domain_scores_codex":[0.9984095,0.0001088135,0.0004293509,0.0003672999,0.0004885627,0.0001964804],"domain_scores_gemma":[0.9981329,0.0005952515,0.0001532389,0.0001803168,0.0008473202,0.00009097539],"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.00002896401,0.0001252688,0.0001076368,0.000005903483,0.000003927663,0.000001466016,0.0003659538,0.00001816309,0.003382999,0.8482387,0.00001417446,0.1477069],"study_design_scores_gemma":[0.00002673952,0.0001721166,0.01386251,0.00001896171,0.000002171276,0.000004802847,0.0001361854,0.02836512,0.04524888,0.9119624,0.00007328991,0.0001268298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04406537,0.00003761843,0.916885,0.0006363944,0.0001907882,0.0001500826,0.000003280892,0.00005682229,0.03797462],"genre_scores_gemma":[0.9957293,0.000007677598,0.003961544,0.0001441832,0.0000579178,0.000005332707,0.000002217047,0.000002945278,0.00008884623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.951664,"threshold_uncertainty_score":0.4150636,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575473210","doi":"","title":"An Exploratory Study into the Use of an Emotionally Aware Cognitive Assistant.","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI in Service Interactions","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":"University of Waterloo","funders":"","keywords":"Computer science; Cognition; Exploratory research; Human–computer interaction; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.3810335401888722,"gpt":0.4166106884691983,"spread":0.0355771482803261,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009712911,0.0001952461,0.0001768376,0.0002178972,0.0002624668,0.0004559703,0.001299315,0.00007338173,0.0000930463],"category_scores_gemma":[0.0007650235,0.0001603714,0.00005008709,0.0006373668,0.0001950666,0.002472729,0.0001564788,0.0003170409,0.0002127749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001456334,"about_ca_system_score_gemma":0.0009338372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002352614,"about_ca_topic_score_gemma":0.003409627,"domain_scores_codex":[0.9967237,0.0005669143,0.0005492179,0.0005400681,0.001424663,0.0001954233],"domain_scores_gemma":[0.9937655,0.0006722399,0.0002637357,0.0005279455,0.004576236,0.0001943776],"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.0002580233,0.004123268,0.000495413,0.000006053951,0.00007837894,0.00002137372,0.0572731,0.01454933,0.0008874299,0.8096933,0.0001970372,0.1124173],"study_design_scores_gemma":[0.0001108592,0.002112839,0.004136452,0.0000796955,0.0000207559,0.000008557773,0.03670453,0.7760561,0.009041635,0.170972,0.0003058139,0.0004507905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4301061,0.000005296642,0.5662671,0.001651032,0.0006211912,0.0005052254,0.00003904918,0.0001301081,0.0006748745],"genre_scores_gemma":[0.9950468,0.000001688024,0.004003128,0.0006933285,0.0001160261,0.00006772959,0.00002534376,0.00001130886,0.00003465741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7615067,"threshold_uncertainty_score":0.6539756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W112014004","doi":"","title":"Optimal scheduling of contract algorithms for anytime problems","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Computer science; Acceleration; Computation; Algorithm; Scheduling (production processes); Mathematical optimization; Schedule; Matching (statistics); Approximation algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1439905611302124,"gpt":0.3591819608483168,"spread":0.2151913997181044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007602522,0.0001554722,0.0002011537,0.0002201306,0.0001529998,0.0002032204,0.0006449497,0.00009376388,0.0001173647],"category_scores_gemma":[0.0002726204,0.0001519511,0.00009052898,0.000416678,0.0001191445,0.0004022568,0.00005999851,0.0001502601,0.00005339747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005762712,"about_ca_system_score_gemma":0.0003732424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004634455,"about_ca_topic_score_gemma":0.00002014357,"domain_scores_codex":[0.9979568,0.0000541321,0.0005843118,0.0004116403,0.0006944349,0.0002986778],"domain_scores_gemma":[0.9975334,0.0003259288,0.0002156826,0.0001962078,0.001654409,0.00007436932],"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.0000158597,0.0001625128,0.000008198255,0.00001021778,0.000006365688,4.381483e-7,0.00007602879,0.2457654,0.003536176,0.7307557,0.00004321631,0.01961984],"study_design_scores_gemma":[0.00006127539,0.0001705136,0.00006959971,0.00003404821,0.000001960556,0.000001535602,0.00001798708,0.8380256,0.02722263,0.133985,0.0002610901,0.0001487985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001594672,0.0000245051,0.9902942,0.001565497,0.0001728007,0.0005000458,0.00003135376,0.00008605063,0.005730875],"genre_scores_gemma":[0.7954805,0.000008099284,0.2040283,0.0001190269,0.0000936854,0.00006213038,0.00002475058,0.00000815506,0.0001753124],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7938859,"threshold_uncertainty_score":0.6196386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2572086656","doi":"","title":"Activity Recognition Through Complex Event Processing: First Findings","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":13,"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 à Chicoutimi","funders":"","keywords":"Complex event processing; Leverage (statistics); Computer science; Abstraction; Activity recognition; Event (particle physics); Process (computing); Data stream mining; Task (project management); Representation (politics); Real-time computing; Human–computer interaction; Artificial intelligence; Data mining; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.3207599459611574,"gpt":0.3764314079622704,"spread":0.055671462001113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006544952,0.0002760118,0.0002698061,0.0002155349,0.0004036786,0.0003849908,0.0008070242,0.000141768,0.0006649151],"category_scores_gemma":[0.0006679818,0.0002248337,0.000116953,0.0005818898,0.0001693561,0.001795782,0.000151302,0.0002089916,0.001969427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003394835,"about_ca_system_score_gemma":0.0003918956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004289059,"about_ca_topic_score_gemma":0.0001881491,"domain_scores_codex":[0.997002,0.0001606887,0.0005138695,0.0008008485,0.001134175,0.0003884394],"domain_scores_gemma":[0.9972651,0.0006573892,0.0002748585,0.0003210221,0.001358227,0.0001234287],"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.0000637488,0.0003111753,0.00005390825,0.00001771983,0.00001529862,0.000004472555,0.0004139441,0.00002052118,0.008964181,0.1230996,0.0004645828,0.8665708],"study_design_scores_gemma":[0.0002676811,0.0005018964,0.003619851,0.0008686946,0.00001327591,0.00005675888,0.0001696588,0.1228858,0.2839505,0.5789932,0.007405006,0.001267611],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873508,0.000007183457,0.9559235,0.01318631,0.0004227724,0.0003882522,0.00005429966,0.0002829361,0.01099966],"genre_scores_gemma":[0.9964685,0.00001767592,0.002468756,0.0005059775,0.0001739107,0.0001134844,0.000009816005,0.00001452975,0.00022737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9777334,"threshold_uncertainty_score":0.9988077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2411176276","doi":"","title":"What Does Consciousness Bring to CTS","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":13,"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":"Consciousness; Computer science; TUTOR; Task (project management); Human–computer interaction; Context (archaeology); Simple (philosophy); Artificial intelligence; Space (punctuation); Psychology; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09538882220650284,"gpt":0.3521461515632766,"spread":0.2567573293567737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001258725,0.0002080029,0.0001906426,0.0003033557,0.0002417729,0.0008482138,0.001095571,0.0001061647,0.0001690723],"category_scores_gemma":[0.00069086,0.0001698654,0.00006940498,0.0006700804,0.0001110498,0.0008366507,0.0002113458,0.0002251197,0.001828264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001432626,"about_ca_system_score_gemma":0.0002889365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002883483,"about_ca_topic_score_gemma":0.0007580505,"domain_scores_codex":[0.9975817,0.00005485979,0.0004354716,0.0006275338,0.0008299092,0.0004705729],"domain_scores_gemma":[0.99778,0.0004729308,0.0001106635,0.0003234735,0.001057241,0.0002557253],"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.00001944915,0.00007914971,0.00005017824,0.000003616598,0.000005384626,0.00001155785,0.001156644,0.0001697817,0.001528416,0.8315149,0.0000845008,0.1653764],"study_design_scores_gemma":[0.00005677472,0.00023575,0.002096024,0.0001936153,0.000004683714,0.00001683542,0.001383297,0.03989764,0.2535573,0.6970776,0.004756735,0.0007237668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02518591,0.00005251525,0.9272248,0.003161691,0.003058105,0.000288157,0.000003290605,0.0002206407,0.04080491],"genre_scores_gemma":[0.9931678,0.00002609036,0.004372847,0.001363986,0.0002920681,0.00001126615,0.000002853695,0.00000880802,0.0007542902],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9679819,"threshold_uncertainty_score":0.9989489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W32549655","doi":"10.4103/iju.iju_84_20","title":"Solving a stochastic queueing design and control problem with constraint programming","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":13,"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":"Queueing theory; Computer science; Mathematical optimization; Constraint programming; Constraint (computer-aided design); Stochastic programming; Decomposition; Benders' decomposition; Variety (cybernetics); Constraint satisfaction; Operations research; Mathematics; Artificial intelligence; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.06487848277850274,"gpt":0.3006697614736803,"spread":0.2357912786951776,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00118622,0.0001768815,0.0001509992,0.0002430312,0.0002647054,0.0003923448,0.00022772,0.00007241316,0.0000474982],"category_scores_gemma":[0.0002132476,0.0001602532,0.00002527986,0.0003684686,0.0002206406,0.0004006771,0.00003248174,0.0002209505,0.00002476849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009093934,"about_ca_system_score_gemma":0.0003586957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001607535,"about_ca_topic_score_gemma":0.00007369498,"domain_scores_codex":[0.9982493,0.00006993715,0.000376195,0.0004330503,0.0005569634,0.0003145424],"domain_scores_gemma":[0.9983531,0.0005792431,0.0001607474,0.0001241327,0.0006434471,0.0001393804],"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.00005062202,0.00003612407,0.00003352103,0.000004039177,0.00001061633,0.000006262332,0.0003223201,0.02407938,0.0005914552,0.6041545,0.000001796041,0.3707094],"study_design_scores_gemma":[0.0001301717,0.0002895451,0.000422806,0.0001161616,0.000007738885,0.00006256757,0.0003531795,0.9420835,0.003177702,0.05301795,0.00002552209,0.0003131896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006572545,0.0000102252,0.9958259,0.00108959,0.00008121823,0.0005518762,0.000001690343,0.0001537803,0.001628433],"genre_scores_gemma":[0.7935084,0.000002055805,0.2061797,0.0002354048,0.00003114197,0.00002334911,0.000001452743,0.000006373325,0.00001221529],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9180041,"threshold_uncertainty_score":0.6534934,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1919500120","doi":"","title":"Vesselness features and the inverse compositional AAM for robust face recognition sing thermal IR","year":2013,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Infrared Thermography in Medicine","field":"Medicine","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é Laval","funders":"","keywords":"Artificial intelligence; Image warping; Facial expression; Computer science; Pattern recognition (psychology); Computer vision; Face (sociological concept); Active appearance model; Expression (computer science); Facial recognition system; Local binary patterns; Image (mathematics); Histogram","retraction":null,"screen_n_in":null,"score":{"opus":0.1169496569331896,"gpt":0.3279421512288578,"spread":0.2109924942956683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422017,0.0001816147,0.0002329079,0.0001619086,0.0003067811,0.0001047098,0.0001333989,0.0001201298,0.0006434519],"category_scores_gemma":[0.0005824815,0.0001271687,0.00008708076,0.0002109274,0.0006482866,0.0001656022,0.00002297686,0.000330123,0.0001040027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005477729,"about_ca_system_score_gemma":0.0001456123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004591051,"about_ca_topic_score_gemma":0.00001689156,"domain_scores_codex":[0.9984847,0.00009547054,0.0003403276,0.0002917803,0.0005664021,0.0002213622],"domain_scores_gemma":[0.9976808,0.0007491162,0.0001281118,0.0001305139,0.001211043,0.0001004202],"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.004856808,0.0006220879,0.0001964047,0.0001818895,0.0002849293,0.000009161692,0.003734213,0.002064776,0.06461538,0.5966624,0.006715726,0.3200562],"study_design_scores_gemma":[0.002149115,0.001024523,0.02167635,0.0009491817,0.0002385024,0.0001769306,0.005867646,0.2057213,0.09420174,0.6668566,0.0003369651,0.000801082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8304457,0.0002593526,0.08233833,0.05163546,0.0009713756,0.004845782,0.0001905913,0.0002074107,0.02910599],"genre_scores_gemma":[0.9923354,0.00002146819,0.003647028,0.003002573,0.0003923816,0.0002539262,0.0001744865,0.00001654586,0.0001562227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3192551,"threshold_uncertainty_score":0.7045348,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2574286572","doi":"","title":"Efficient Appliances Recognition in Smart Homes Based on Active and Reactive Power, Fast Fourier Transform and Decision Trees.","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Smart Grid Energy Management","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; AC power; Decision tree; Fourier transform; Artificial intelligence; Power (physics); Computer vision; Speech recognition; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07435391982588865,"gpt":0.2919110322226138,"spread":0.2175571123967252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106268,0.0001785081,0.0001565299,0.0003186691,0.00005001993,0.0000659601,0.00008475226,0.00008059818,0.00005122669],"category_scores_gemma":[0.0001409714,0.0001759189,0.00002212323,0.0002581346,0.00008664991,0.000102018,0.00001407966,0.0001845879,0.00004999619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002079265,"about_ca_system_score_gemma":0.00005604138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002834212,"about_ca_topic_score_gemma":0.0003292576,"domain_scores_codex":[0.9987139,0.00002548229,0.0002503485,0.00030853,0.0005201022,0.0001816627],"domain_scores_gemma":[0.9993409,0.0002474566,0.000036577,0.00008831864,0.0001856226,0.0001011505],"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.0003945637,0.0001177559,0.00004015724,0.000007956165,0.00001141089,0.000004459152,0.0004443736,0.3396997,0.0001668274,0.01099061,0.00005548414,0.6480666],"study_design_scores_gemma":[0.0001565659,0.0001977286,0.002198825,0.0001231032,0.000005340414,9.477909e-7,0.000881508,0.9500877,0.01093822,0.03493841,0.0002433215,0.0002283515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7580152,0.0000564097,0.1799256,0.0007730667,0.0006983255,0.0006975532,0.00008115834,0.0001522787,0.05960041],"genre_scores_gemma":[0.9984506,0.00003242932,0.001278404,0.00008825715,0.00003875286,0.00006831787,0.00001935051,0.00001391346,0.000009910794],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6478383,"threshold_uncertainty_score":0.7173764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W125764232","doi":"","title":"Exploring more realistic evaluation measures for collaborative filtering","year":2004,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":12,"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":"Collaborative filtering; Computer science; Quality (philosophy); Simple (philosophy); Empirical research; Recommender system; Data mining; Artificial intelligence; Information retrieval; Machine learning; Mathematics; Epistemology; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.5878091667199781,"gpt":0.4241198399079391,"spread":0.163689326812039,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110971,0.0001565546,0.0001649006,0.0001954546,0.0002315771,0.0002987216,0.0005010564,0.00005430425,0.00001486209],"category_scores_gemma":[0.0006027396,0.0001516285,0.00005382713,0.0004097227,0.00004593863,0.0006772749,0.00005316991,0.0001103592,0.00002786922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002992136,"about_ca_system_score_gemma":0.0005093128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006561182,"about_ca_topic_score_gemma":0.00008873727,"domain_scores_codex":[0.9980232,0.00007389516,0.0003876654,0.0004276109,0.0008765535,0.0002110683],"domain_scores_gemma":[0.9973768,0.0001768833,0.000146388,0.000229896,0.002002695,0.00006736235],"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.00001356693,0.00004438739,0.000001058683,0.000006593938,0.000008828762,7.112062e-7,0.0008447774,0.004488743,0.001533996,0.8574138,0.00005394395,0.1355896],"study_design_scores_gemma":[0.00006664205,0.0002076407,0.000106553,0.0001292252,0.000005681357,0.000003260049,0.00047165,0.1161746,0.1473501,0.7345959,0.0006295951,0.0002591371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001452084,0.00002212625,0.9884026,0.003513216,0.0004723563,0.0006894202,0.00002225214,0.000163479,0.005262442],"genre_scores_gemma":[0.9657739,0.00002374193,0.03306332,0.0001891657,0.0001369183,0.0007758665,0.00001465528,0.000008610902,0.00001378985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9643219,"threshold_uncertainty_score":0.6183231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W585824775","doi":"","title":"Geometric ordering of concepts, logical disjunction, and learning by induction","year":2004,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mereology; Computer science; Distributive property; Theoretical computer science; Convexity; Distributive lattice; Representation (politics); Boolean algebra; Closure (psychology); Artificial intelligence; Algorithm; Mathematics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1009347353087491,"gpt":0.3290345827263336,"spread":0.2280998474175845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004246933,0.0001059014,0.0001156601,0.0002404527,0.0001621376,0.0001641372,0.0003285134,0.00005249178,0.00006077906],"category_scores_gemma":[0.0004063049,0.0001004669,0.00002389543,0.0007766929,0.0001224702,0.0005661846,0.0001230792,0.0002160041,0.00005006064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004866396,"about_ca_system_score_gemma":0.0000608178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004575654,"about_ca_topic_score_gemma":0.000005730781,"domain_scores_codex":[0.9987045,0.00004434597,0.000272746,0.0003346607,0.0004961139,0.0001476452],"domain_scores_gemma":[0.9993235,0.00009555685,0.0001210504,0.0001083704,0.0002986316,0.00005290422],"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.000006477135,0.00007635309,0.00003795194,0.0000049416,0.000006475404,7.478725e-7,0.00009647039,0.002625106,0.001241481,0.7465611,0.00004808642,0.2492948],"study_design_scores_gemma":[0.0002814994,0.00119589,0.004305908,0.0001371227,0.00001601303,0.00001416748,0.001130783,0.1876722,0.09386558,0.7053829,0.005141131,0.0008567385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02133041,0.00004249223,0.9745063,0.001102579,0.0002249702,0.0001012753,0.000005352055,0.00006573808,0.002620932],"genre_scores_gemma":[0.993511,0.00006920581,0.006132955,0.00009491937,0.00004785381,0.000007677532,0.00001860747,0.000003509857,0.0001143184],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9721805,"threshold_uncertainty_score":0.4096923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576053140","doi":"","title":"Self-Driving Aircraft Towing Vehicles: A Preliminary Report","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Towing; Runway; Crew; Workload; Engineering; Aeronautics; Work (physics); Computer science; Simulation; Automotive engineering; Marine engineering; Transport engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08285315254577422,"gpt":0.2975444781248063,"spread":0.2146913255790321,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004498687,0.000160692,0.0001271939,0.0001685918,0.00008283702,0.0001098544,0.0002026691,0.00008504305,0.0001143434],"category_scores_gemma":[0.0003032672,0.0001747734,0.0000427923,0.0002828568,0.00003436198,0.0002807907,0.00003643869,0.0001741329,0.00032191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001671927,"about_ca_system_score_gemma":0.0001123383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003742475,"about_ca_topic_score_gemma":0.00001165749,"domain_scores_codex":[0.9985144,0.00002614558,0.0003861607,0.0002530768,0.0006082973,0.0002118988],"domain_scores_gemma":[0.9991993,0.00008656765,0.00005632682,0.0001491084,0.0003980683,0.0001106778],"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.00003265056,0.0001145158,0.0001061339,0.00003365978,0.00003986369,0.00005469541,0.001027688,0.7989087,0.0001021793,0.1570983,0.002668757,0.0398128],"study_design_scores_gemma":[0.00002701029,0.00007708662,0.0001240448,0.00004304421,0.000009661277,0.000009054577,0.0005144672,0.9830245,0.001809915,0.01200238,0.002142486,0.0002163004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02664912,0.00006846406,0.7741804,0.001123179,0.001239522,0.0005062546,0.000005553204,0.001661562,0.194566],"genre_scores_gemma":[0.9910306,0.00002249122,0.008258689,0.00008044721,0.0001947457,0.00003010042,0.0000362522,0.00002106478,0.0003256499],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9643815,"threshold_uncertainty_score":0.7127054,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W246639213","doi":"","title":"Prediction Driven Behavior: Learning Predictions that Drive Fixed Responses","year":2014,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Robot; Computer science; Artificial intelligence; Adaptive behavior; Behavior-based robotics; Adaptive control; Reinforcement learning; Latency (audio); Control (management); Control theory (sociology); Simulation; Mobile robot; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.1552435306461609,"gpt":0.3359340618331985,"spread":0.1806905311870376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007930947,0.0002304654,0.0001865882,0.0003677543,0.0005716047,0.0004274694,0.0008614371,0.0001539828,0.0001987906],"category_scores_gemma":[0.001415551,0.0002399035,0.00009180193,0.000459064,0.0001664909,0.0006285617,0.0001673078,0.0005936932,0.0006388389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001835061,"about_ca_system_score_gemma":0.000247466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001349207,"about_ca_topic_score_gemma":0.00001167328,"domain_scores_codex":[0.9969625,0.0003362664,0.0004796925,0.0005861063,0.001281902,0.0003534615],"domain_scores_gemma":[0.9978317,0.0006422936,0.0002571953,0.0003732533,0.0007520555,0.0001434792],"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.00002385349,0.00006603239,0.001545016,0.000003135105,0.00001155376,0.000001769368,0.0003727057,0.427545,0.0009932461,0.5521036,0.0001264246,0.0172076],"study_design_scores_gemma":[0.00004252137,0.0004167537,0.006823893,0.00004645137,0.00001076959,0.000007203506,0.0001221755,0.972721,0.005629609,0.01215781,0.00179672,0.0002250417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004874456,0.000003220761,0.977384,0.001017595,0.0007589433,0.0002802704,0.000009327013,0.0004542234,0.01521792],"genre_scores_gemma":[0.9906122,0.00001957263,0.007575217,0.0002131974,0.0001972311,0.00008881339,0.00003544388,0.00001506979,0.001243228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9857377,"threshold_uncertainty_score":0.9782981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3013856963","doi":"","title":"PURSS: Towards Perceptual Uncertainty Aware Responsibility Sensitive Safety with ML.","year":2020,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Perception; Computer science; Psychology; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.1126075843978926,"gpt":0.3412883355305449,"spread":0.2286807511326523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009410538,0.0003274508,0.0003314079,0.000132752,0.0004012662,0.0002840396,0.001099519,0.0001425821,0.000343481],"category_scores_gemma":[0.002249592,0.0002884689,0.00009169534,0.0008956552,0.0003484529,0.0005798494,0.0003159035,0.0007651215,0.0003935876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002908225,"about_ca_system_score_gemma":0.001256269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009152474,"about_ca_topic_score_gemma":0.00008443227,"domain_scores_codex":[0.9960615,0.0004732637,0.0005279413,0.001058972,0.001468379,0.0004099431],"domain_scores_gemma":[0.9970314,0.0005871727,0.0002066535,0.0003946371,0.001506121,0.0002740201],"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.0008832268,0.00008691153,0.00004009608,0.000008851131,0.00002651666,0.0000404045,0.003478331,0.1435341,0.0004436683,0.7592189,0.00009078095,0.09214829],"study_design_scores_gemma":[0.00009196299,0.0005414578,0.00103688,0.00005197293,0.000007738397,0.00001138132,0.00164344,0.9658916,0.004501927,0.0251801,0.000573613,0.0004679377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006558728,0.000003533793,0.9577022,0.0252642,0.0002191712,0.0003437159,0.00004148065,0.0002925541,0.009574379],"genre_scores_gemma":[0.9808699,0.000004668484,0.0159743,0.002804732,0.0002191822,0.00001531234,0.00002581229,0.00001666263,0.00006944823],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9743112,"threshold_uncertainty_score":0.9999567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W105450294","doi":"","title":"A Pragmatic Global Vision System for Educational Robotics","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Machine vision; Robot; Cognitive neuroscience of visual object recognition; Robot vision; Object (grammar); Overhead (engineering); Server; Computer vision; Human–computer interaction; Mobile robot; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.05808737164227477,"gpt":0.3414758550813853,"spread":0.2833884834391105,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004846123,0.000156176,0.0001391689,0.0001139236,0.0001297414,0.0001033322,0.0001594898,0.0001114326,0.00005602194],"category_scores_gemma":[0.0002398667,0.0001629849,0.00005871186,0.0002979552,0.00004730009,0.00009995756,0.000009365468,0.00009892567,0.0001790755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004063235,"about_ca_system_score_gemma":0.0001442808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005158394,"about_ca_topic_score_gemma":0.00005363782,"domain_scores_codex":[0.9985725,0.00001864581,0.0004706542,0.0002095825,0.00048171,0.0002468777],"domain_scores_gemma":[0.9987309,0.0003100135,0.00006573292,0.000113492,0.0006812531,0.00009863677],"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.00002004454,0.00004102756,0.0000106035,0.00004326645,0.000007696489,4.136814e-7,0.00002795735,0.3932906,0.0004493261,0.5963259,0.0001613527,0.009621846],"study_design_scores_gemma":[0.00003577317,0.00007020233,0.0002358004,0.00009067704,0.000008489334,0.000004069595,0.0001856009,0.9084106,0.004929528,0.0856697,0.0001739622,0.0001855591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002041118,0.00002032578,0.9800568,0.0006598498,0.000879045,0.0003449414,0.00005577237,0.0001395052,0.01580268],"genre_scores_gemma":[0.9867098,0.000004638636,0.01272293,0.00008209278,0.0002805161,0.00002091935,0.000113592,0.00001632839,0.0000491223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9846687,"threshold_uncertainty_score":0.6646331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2287802714","doi":"","title":"An Intelligent Nutritional Assessment System","year":2012,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Nutritional Studies and Diet","field":"Medicine","cited_by":9,"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":"Dementia; Computer science; Cognition; Gerontology; Artificial intelligence; Meal; Medicine; Psychiatry","retraction":null,"screen_n_in":null,"score":{"opus":0.1805094647003256,"gpt":0.417440160831716,"spread":0.2369306961313904,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005852647,0.0002089211,0.0002671099,0.0001777538,0.0002696079,0.00006501424,0.0001452329,0.0001094826,0.001129675],"category_scores_gemma":[0.0001046642,0.0001897352,0.0001190954,0.0002522456,0.0001327051,0.0002234749,0.00003221197,0.0002804906,0.0007451918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004863179,"about_ca_system_score_gemma":0.0002454403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002109954,"about_ca_topic_score_gemma":0.000006897969,"domain_scores_codex":[0.9975485,0.00007154733,0.0004836824,0.0003246866,0.001185584,0.0003860192],"domain_scores_gemma":[0.9981632,0.0001502867,0.0001014326,0.0001781695,0.001055149,0.0003517789],"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.0002053094,0.001690167,0.001589939,0.00004971447,0.0000401371,0.000005432265,0.00005208972,0.00005642507,0.00172572,0.9854672,0.0006683076,0.008449583],"study_design_scores_gemma":[0.001259969,0.006885326,0.2501403,0.002420582,0.0003952051,0.0006861624,0.02099604,0.1236184,0.1119473,0.4323521,0.04601498,0.003283682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2793182,0.0009730923,0.1819182,0.02070631,0.004378439,0.003455232,0.0008358632,0.001059351,0.5073554],"genre_scores_gemma":[0.9932814,0.00005746859,0.004204702,0.0008399416,0.001190229,0.0001145895,0.0002039947,0.00001662385,0.00009104312],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7139633,"threshold_uncertainty_score":0.9997835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404370375","doi":"","title":"Security Games on Social Networks.","year":2012,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":9,"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":"Adversary; Computer science; Misinformation; Oracle; Heuristics; Computer security; Stochastic game; Game theory; Normal-form game; Social network (sociolinguistics); Repeated game; Mathematical economics; Social media; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1596646090725766,"gpt":0.3518188858133328,"spread":0.1921542767407562,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006915026,0.0001612526,0.0001302486,0.0001481168,0.0003273126,0.0002496103,0.0005504328,0.0001270645,0.0001827701],"category_scores_gemma":[0.0002264049,0.0001578852,0.00007480534,0.0004341729,0.00007718281,0.0005279505,0.00007008738,0.0003396986,0.0007366431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140292,"about_ca_system_score_gemma":0.00008840485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001824944,"about_ca_topic_score_gemma":0.00001439494,"domain_scores_codex":[0.9982129,0.0001161869,0.0002636023,0.0003242861,0.000726462,0.0003565995],"domain_scores_gemma":[0.9990483,0.000223187,0.0001105399,0.0001789877,0.0003247755,0.0001141975],"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.00002309175,0.0001424625,0.00004168359,0.000001545546,0.000005588665,5.442398e-7,0.0004759461,0.00070398,0.00008943906,0.9037209,0.0008650178,0.09392976],"study_design_scores_gemma":[0.0000492266,0.000245911,0.00600232,0.000037641,0.000006148276,0.000007383628,0.0001466255,0.425245,0.02047329,0.542231,0.004975828,0.0005796214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02713487,0.00006680821,0.9001271,0.006142938,0.003967074,0.0003078477,0.0000127295,0.0004586237,0.06178208],"genre_scores_gemma":[0.9973427,0.00001141607,0.0004340216,0.001053945,0.001056869,0.00002042836,0.000005511876,0.000007298403,0.00006778562],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9702079,"threshold_uncertainty_score":0.9468302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576392126","doi":"","title":"A Trust Establishment Model in Multi-Agent Systems.","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Access Control and Trust","field":"Social Sciences","cited_by":9,"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":"","keywords":"Computer science; Multi-agent system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.3871755904016859,"gpt":0.4279853317056506,"spread":0.0408097413039647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001603586,0.0001483529,0.0001962953,0.0002324003,0.000232548,0.0003308968,0.0004421668,0.0001308896,0.0001377034],"category_scores_gemma":[0.001200737,0.0001451946,0.00004546319,0.0004286783,0.0002052218,0.0003985308,0.00004493096,0.0002277477,0.0004338816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005341553,"about_ca_system_score_gemma":0.001370204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002980402,"about_ca_topic_score_gemma":0.004941787,"domain_scores_codex":[0.9973869,0.0001926689,0.0004490514,0.0003521304,0.001256489,0.0003627508],"domain_scores_gemma":[0.998426,0.0001243539,0.0001238326,0.0001258783,0.0009586689,0.0002412849],"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.00005673957,0.0002455304,0.0003433109,0.000002948617,0.000005164723,0.000005235539,0.003063234,0.06343184,0.00002187064,0.9226073,0.0001940242,0.01002283],"study_design_scores_gemma":[0.0001137589,0.00004501866,0.0002382557,0.00004105406,0.000004369092,4.030556e-7,0.007542541,0.8907297,0.0001508947,0.09891856,0.001977325,0.00023809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.06094528,0.0003796935,0.3565643,0.01411176,0.003027827,0.002414973,0.0001366006,0.0003719616,0.5620477],"genre_scores_gemma":[0.9975402,0.00003405962,0.0005514377,0.0002725828,0.0001551353,0.0001000433,0.000009064791,0.000008560613,0.001328955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9365949,"threshold_uncertainty_score":0.5920863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2577609954","doi":"","title":"Explorations of Quantum-Classical Approaches to Scheduling a Mars Lander Activity Problem","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":9,"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; Mars landing; Mathematical optimization; Scheduling (production processes); Quantum; Quantum computer; Mars Exploration Program; Algorithm; Theoretical computer science; Mathematics; Exploration of Mars","retraction":null,"screen_n_in":null,"score":{"opus":0.4940878730991244,"gpt":0.3803586932931276,"spread":0.1137291798059968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009036741,0.0001575507,0.000209242,0.0003692025,0.0001335243,0.0001610139,0.0008098346,0.0000810833,0.0002112897],"category_scores_gemma":[0.001397243,0.0001176866,0.00006007122,0.0008316388,0.0001446012,0.0004915978,0.0001952545,0.0001617775,0.0004303203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001047769,"about_ca_system_score_gemma":0.0005660072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008803863,"about_ca_topic_score_gemma":0.0000153108,"domain_scores_codex":[0.9973372,0.0001943285,0.0004390192,0.0005390812,0.001205611,0.0002847108],"domain_scores_gemma":[0.9977773,0.0006251982,0.0001463163,0.0003472934,0.0009197162,0.0001842189],"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.00003036462,0.0001874108,0.00001108904,0.000005750896,0.000009785523,9.197909e-7,0.0001556018,0.00557941,0.003219622,0.8363376,0.00005807723,0.1544044],"study_design_scores_gemma":[0.00003946278,0.0001395593,0.0001587301,0.00005452146,0.000001975816,0.000001521192,0.00004130751,0.767632,0.0476335,0.1840246,0.0001065714,0.0001662651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001889972,0.000002877715,0.976422,0.01712904,0.0001182426,0.0003355893,0.00001976492,0.00006736878,0.004015161],"genre_scores_gemma":[0.869601,0.000008051005,0.1299253,0.00007981045,0.00005451412,0.00008627427,0.000002352289,0.000008188813,0.0002345572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.867711,"threshold_uncertainty_score":0.553104,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2703543743","doi":"","title":"Towards Tractable Inference for Resource-Bounded Agents","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":9,"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; Inference; sort; Commonsense reasoning; Epistemic modal logic; Commonsense knowledge; Semantics (computer science); Non-monotonic logic; Artificial intelligence; Common sense; Rule of inference; Epistemology; Theoretical computer science; Description logic; Cognitive science; Knowledge representation and reasoning; Programming language; Multimodal logic; Psychology; Philosophy; Information retrieval","retraction":null,"screen_n_in":null,"score":{"opus":0.2847474463153415,"gpt":0.3935910568604578,"spread":0.1088436105451163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001227811,0.0002656823,0.0002673219,0.0002233889,0.0002700777,0.0005917724,0.001409432,0.0001640804,0.0001296425],"category_scores_gemma":[0.002538052,0.00024573,0.0001146539,0.0005394471,0.0001422539,0.0005812339,0.000175269,0.0002545435,0.00066275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002471794,"about_ca_system_score_gemma":0.001356702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004707355,"about_ca_topic_score_gemma":0.00007629424,"domain_scores_codex":[0.997185,0.0001118359,0.0005018824,0.0006812552,0.001032002,0.0004880299],"domain_scores_gemma":[0.9969007,0.000410093,0.000196579,0.0003885129,0.001787422,0.000316645],"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.00005496336,0.0001874558,0.00001662804,0.000006345989,0.00001109076,0.000002689668,0.0008601703,0.0004806115,0.0001307186,0.9164745,0.002179891,0.07959494],"study_design_scores_gemma":[0.00009773661,0.0003226377,0.0001398794,0.00003025695,0.000005033693,0.000004492174,0.0001964493,0.2453744,0.01204645,0.7183626,0.02309383,0.0003261875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0022568,0.00004017397,0.8394925,0.002305336,0.0007462423,0.0004342695,0.00002282059,0.0002183142,0.1544835],"genre_scores_gemma":[0.9840254,0.000008236376,0.01359936,0.0007719101,0.0002785922,0.0001088659,0.00002652728,0.00001378787,0.001167383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9817685,"threshold_uncertainty_score":0.9999995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2483647133","doi":"","title":"The Implementation of a Planning and Scheduling Architecture for Multiple Robots Assisting Multiple Users in a Retirement Home Setting","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":9,"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":"Robot; Scheduling (production processes); Architecture; Computer science; Schedule; Plan (archaeology); Human–computer interaction; Artificial intelligence; Engineering; Operations management; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.22448834479338,"gpt":0.3970640635213852,"spread":0.1725757187280053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683971,0.0001306149,0.0001618366,0.000183242,0.0002041358,0.0002362237,0.0003250223,0.0000518867,0.000001855825],"category_scores_gemma":[0.001789224,0.0001156087,0.00003875562,0.0002841626,0.00007006136,0.0002967189,0.00009927711,0.0001644664,0.000002755568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001287534,"about_ca_system_score_gemma":0.0003011737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001946134,"about_ca_topic_score_gemma":0.001657227,"domain_scores_codex":[0.9981974,0.0001452176,0.0005324514,0.0003523974,0.0005387481,0.0002337959],"domain_scores_gemma":[0.9968871,0.001840987,0.0003076438,0.0001405814,0.0007518503,0.00007186031],"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.0002053726,0.0001012333,0.02240389,0.00005141466,0.00003556206,0.000002804828,0.01025827,0.03075719,0.006847596,0.08755426,0.00002756247,0.8417549],"study_design_scores_gemma":[0.0002857473,0.0001719169,0.006114574,0.0002289252,0.000003760561,0.000004503484,0.006804527,0.9206029,0.02175936,0.04371921,0.00007645055,0.000228125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2039843,0.00004438397,0.7932817,0.001702157,0.0002230217,0.0005925833,0.00002224832,0.0000382602,0.0001113479],"genre_scores_gemma":[0.9825435,0.000001660123,0.01720357,0.00006746584,0.00005169641,0.0001112626,0.00001002137,0.000006817852,0.000004055995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8898457,"threshold_uncertainty_score":0.4714386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2576201175","doi":"","title":"Discovering Relevant Hashtags for Health Concepts: A Case Study of Twitter","year":2016,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Advanced Text Analysis Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thomson Reuters (Canada)","funders":"","keywords":"Computer science; Search engine indexing; Baseline (sea); Cluster analysis; Information retrieval; Social media; Word (group theory); Natural language processing; Artificial intelligence; Data science; World Wide Web; Linguistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1941573157858804,"gpt":0.4542740632284499,"spread":0.2601167474425695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006494205,0.0001763479,0.0002960192,0.0002399345,0.0001621133,0.00007774543,0.0006293086,0.00004680061,0.0000328407],"category_scores_gemma":[0.0004446402,0.0001294776,0.00008590865,0.0003704631,0.0001137401,0.0004817258,0.0001273958,0.00009761561,0.00002119325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001713363,"about_ca_system_score_gemma":0.0002867841,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000125473,"about_ca_topic_score_gemma":0.0004205715,"domain_scores_codex":[0.9977708,0.0001011596,0.0006963488,0.0005522319,0.0006092938,0.0002701239],"domain_scores_gemma":[0.9977849,0.0005587689,0.00036816,0.0004061537,0.000792928,0.00008911957],"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.00004672485,0.0005949838,0.00007754128,0.00001287968,0.0000341067,0.00003295467,0.002719512,0.0003018763,0.003833623,0.7117636,0.0001483081,0.2804339],"study_design_scores_gemma":[0.0004267312,0.004615711,0.000196526,0.0004044492,0.00002136263,0.0001334493,0.006349756,0.1211429,0.1317112,0.7332522,0.0008353141,0.0009103942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06189565,0.0000101425,0.9343851,0.002732156,0.00009617804,0.0005653545,0.0000172074,0.000103589,0.0001946019],"genre_scores_gemma":[0.9769977,0.00001134715,0.02238269,0.0003330643,0.00004897033,0.0001277514,0.000001346132,0.000009900367,0.00008724225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9151021,"threshold_uncertainty_score":0.5279945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W26292495","doi":"","title":"Decision Making under Uncertainty: Operations Research Meets AI (Again)","year":2000,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":8,"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; Exploit; Artificial intelligence; Machine learning; Probabilistic logic; Markov decision process; Representation (politics); Partially observable Markov decision process; Bayesian network; Automated planning and scheduling; Influence diagram; Markov process; Markov chain; Markov model; Decision tree; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2736602822281722,"gpt":0.4565537726636735,"spread":0.1828934904355012,"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.001869382,0.0002459593,0.0002125181,0.0004192356,0.0008291237,0.00103172,0.001552178,0.0001855375,0.001722726],"category_scores_gemma":[0.0005043851,0.0002349728,0.00008421324,0.001204705,0.0002417609,0.0007265515,0.0001525908,0.0007558518,0.00297373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002451575,"about_ca_system_score_gemma":0.0008937279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000887767,"about_ca_topic_score_gemma":0.0003778595,"domain_scores_codex":[0.9956841,0.0003133698,0.0006114916,0.0008842164,0.001924511,0.0005822999],"domain_scores_gemma":[0.9965058,0.0006768487,0.00003990692,0.0005603886,0.002039702,0.0001773511],"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.00002312183,0.00007558773,8.958152e-7,0.000001172148,0.000004256639,0.000003059211,0.0001402485,0.1828203,0.0002224263,0.5188541,0.0001731805,0.2976816],"study_design_scores_gemma":[0.00001737533,0.00007948123,0.00004537573,0.00008885215,0.000001191916,0.000004758435,0.00003915969,0.5385236,0.0008967171,0.4597761,0.0003632844,0.0001640993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01022527,0.00003679705,0.9595007,0.01190779,0.0003079787,0.0002537765,0.00001286594,0.0001871764,0.01756768],"genre_scores_gemma":[0.9755259,0.00006668552,0.0211371,0.002549238,0.0001667011,0.00005491321,0.000009601605,0.00001420234,0.0004756643],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9653006,"threshold_uncertainty_score":0.9991899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398865566","doi":"","title":"AutoFolio: Algorithm Configuration for Algorithm Selection.","year":2015,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":8,"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":"Folio; Algorithm; Benchmark (surveying); Computer science; Selection (genetic algorithm); Parameterized complexity; Set (abstract data type); Hyperparameter; State (computer science); Weighted Majority Algorithm; Variety (cybernetics); Machine learning; Artificial intelligence; Artificial neural network; Wake-sleep algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1703789994464963,"gpt":0.3755070636843442,"spread":0.205128064237848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000837479,0.0001817187,0.0001557929,0.0002417889,0.000237567,0.0005254003,0.0006121334,0.0001146215,0.0001088649],"category_scores_gemma":[0.0007841315,0.0001795837,0.0000570786,0.0005303937,0.00006310288,0.0007036471,0.00004815837,0.0002190216,0.001179103],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001698429,"about_ca_system_score_gemma":0.0006116724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007157496,"about_ca_topic_score_gemma":0.00001358111,"domain_scores_codex":[0.9978758,0.000115438,0.000424778,0.0005462086,0.000770197,0.0002675748],"domain_scores_gemma":[0.9970872,0.0002357275,0.0001913835,0.0002347821,0.00207343,0.0001774279],"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.00000510962,0.00004145965,0.000002092956,0.000001448489,0.000004761306,2.069235e-7,0.00008382308,0.0004736187,0.0002156175,0.5078351,0.001499785,0.489837],"study_design_scores_gemma":[0.00004698525,0.0001810843,0.0000857777,0.000008601192,0.000002615154,0.000004686455,0.00007706311,0.7813656,0.006508143,0.2029138,0.008633219,0.0001724456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003939918,0.00001412431,0.9857579,0.004540468,0.0005259911,0.0003795029,0.00004130404,0.0002528507,0.008448466],"genre_scores_gemma":[0.4274206,0.00001306045,0.5682419,0.001119968,0.0006261648,0.0003778682,0.0003792068,0.00002203519,0.001799193],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.780892,"threshold_uncertainty_score":0.9995986,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W33587638","doi":"10.1021/acs.jpclett.1c00121","title":"Topological mapping with weak sensory data","year":2007,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Science and Engineering Research Board; Vetenskapsrådet","keywords":"Vertex (graph theory); Computer science; Robot; Bounded function; Topology (electrical circuits); Heuristic; occam; Process (computing); Set (abstract data type); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.2422840541084506,"gpt":0.3409676202144604,"spread":0.09868356610600978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004482442,0.0001399954,0.0001194877,0.000138709,0.00009566107,0.00007107051,0.0002875544,0.00009612299,0.0002585549],"category_scores_gemma":[0.0001510957,0.0001231193,0.00001762833,0.0002597713,0.00009946999,0.0001239213,0.00003022273,0.0002084024,0.0002048267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007107564,"about_ca_system_score_gemma":0.00005617203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009498666,"about_ca_topic_score_gemma":0.0001048232,"domain_scores_codex":[0.9986972,0.0000202351,0.000302741,0.000273739,0.0004678986,0.0002382219],"domain_scores_gemma":[0.9991854,0.000176674,0.00003686755,0.0002405654,0.0002788634,0.00008156053],"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.00005102265,0.00005940137,0.00008495864,0.00001197914,0.0000193165,0.00001417833,0.00008884891,0.2233756,0.003654656,0.7246581,0.0001943549,0.04778755],"study_design_scores_gemma":[0.00002939256,0.00007082496,0.000667268,0.00003932825,0.0000047842,0.000008067831,0.0004785392,0.9580509,0.01707256,0.02176074,0.001554058,0.0002635556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01604773,0.00001762713,0.9390507,0.000389548,0.0002341159,0.0001279851,0.00002983331,0.0001788946,0.04392356],"genre_scores_gemma":[0.994752,0.00002153567,0.004679598,0.000166464,0.0001696235,0.00000224068,0.00009221833,0.00001431655,0.0001019551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9787043,"threshold_uncertainty_score":0.502066,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809942986","doi":"","title":"Predicting the performance of IDA* with conditional distributions","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Set (abstract data type); Computer science; Sample (material); Distribution (mathematics); Algorithm; Mathematics; Mathematical optimization; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.09917547778702003,"gpt":0.2979532252419059,"spread":0.1987777474548859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003896142,0.0001138155,0.0001063323,0.00007741118,0.0005825134,0.00005371273,0.0005807569,0.0000448524,0.0000572229],"category_scores_gemma":[0.0001560388,0.00008040389,0.000035127,0.0004202416,0.0002915541,0.0002756477,0.00005028088,0.0002418126,0.00006341987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004061824,"about_ca_system_score_gemma":0.0004906793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002187501,"about_ca_topic_score_gemma":0.000009437121,"domain_scores_codex":[0.9985039,0.00005973415,0.0002942598,0.0002424929,0.0007145986,0.0001850543],"domain_scores_gemma":[0.9984475,0.0004307742,0.0001651381,0.0001958264,0.0007105297,0.00005024236],"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.00002853181,0.00006701595,0.003149191,0.000006211021,0.00001267908,0.000003067185,0.0004624829,0.0176123,0.0003150222,0.9745822,0.0001107972,0.003650502],"study_design_scores_gemma":[0.00004491864,0.0004239685,0.01274987,0.0001191371,0.000005478913,0.00006988343,0.00009676897,0.8841427,0.04117569,0.06073464,0.0002152335,0.0002217189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.210285,0.000018371,0.7824112,0.002551215,0.0001126531,0.0001497184,0.0000691381,0.000080962,0.004321837],"genre_scores_gemma":[0.9960842,0.000009864797,0.003563689,0.0001488242,0.00006001805,0.00002231107,0.00003731215,0.000003708006,0.00007011005],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9138476,"threshold_uncertainty_score":0.4480281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902215381","doi":"","title":"Proposal to Add Emotion to the Standard Model","year":2017,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Emotions and Moral Behavior","field":"Psychology","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Standard Model (mathematical formulation); Cognitive psychology; Psychology; History","retraction":null,"screen_n_in":null,"score":{"opus":0.2958282815921013,"gpt":0.4649269419966776,"spread":0.1690986604045762,"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.0005466552,0.0001441668,0.0001265011,0.0001206076,0.0007444939,0.000309669,0.0006933752,0.00008561364,0.001944276],"category_scores_gemma":[0.000421889,0.0001105642,0.00005690087,0.0001152914,0.0001073953,0.0001182652,0.0000950314,0.0002150017,0.004467445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009564865,"about_ca_system_score_gemma":0.0002354547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001029876,"about_ca_topic_score_gemma":0.0006303198,"domain_scores_codex":[0.998423,0.000058456,0.0002858248,0.0003973439,0.0005737075,0.0002616703],"domain_scores_gemma":[0.998391,0.00004271617,0.0001025361,0.0005298077,0.0007882363,0.000145724],"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.000152057,0.0001005596,0.0000591475,9.133648e-7,0.000005862029,0.00000206818,0.0007987545,0.002361031,0.0006755493,0.8467243,0.005156207,0.1439636],"study_design_scores_gemma":[0.000269527,0.002976698,0.05066986,0.0002746183,0.00007363201,0.00002116262,0.004133219,0.07165603,0.04443469,0.7994612,0.02432796,0.001701421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2705919,0.000007387913,0.5016962,0.08430158,0.002670372,0.001827447,0.0004828346,0.0001390981,0.1382832],"genre_scores_gemma":[0.9923693,0.000001153073,0.002255947,0.001140564,0.0002441162,0.0001381363,0.00001076647,0.0000130308,0.003826974],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7217774,"threshold_uncertainty_score":0.9989681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400441446","doi":"","title":"The Role of Prompting and Feedback in Facilitating Students' Learning about Science with MetaTutor.","year":2010,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Innovative Teaching and Learning Methods","field":"Psychology","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Session (web analytics); Context (archaeology); Metacognition; Computer science; Self-regulated learning; Hypermedia; Adaptive hypermedia; Software deployment; Control (management); Human–computer interaction; Multimedia; Cognition; Knowledge management; Artificial intelligence; Psychology; Mathematics education; World Wide Web; Software engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08264740034874508,"gpt":0.4359997725158407,"spread":0.3533523721670956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006672725,0.0001207078,0.0001448542,0.0002164386,0.0005103364,0.0001539411,0.0003852691,0.00005720906,0.00009793341],"category_scores_gemma":[0.003353718,0.00008644425,0.00001672883,0.0006234783,0.0009546174,0.0001123516,0.00005704839,0.00108041,0.0000279756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002977667,"about_ca_system_score_gemma":0.0001954039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001448237,"about_ca_topic_score_gemma":0.0001274043,"domain_scores_codex":[0.9979047,0.0003860372,0.0003722534,0.0003512287,0.0007104013,0.000275408],"domain_scores_gemma":[0.9976239,0.001272582,0.000223083,0.0001295614,0.0007101941,0.00004067862],"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.00009765589,0.00006980549,0.01719701,0.000003020121,0.00001036264,6.951244e-7,0.007150642,0.0003324686,0.03373841,0.4290227,4.215648e-7,0.5123768],"study_design_scores_gemma":[0.0001512702,0.0004778817,0.8306544,0.0001587991,0.000009253853,0.00001150776,0.03821547,0.02461942,0.02994403,0.07426902,0.001085425,0.0004035235],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9720343,0.00003132723,0.004711388,0.0001329795,0.0001692821,0.0001615515,0.000001358178,0.00002383322,0.02273392],"genre_scores_gemma":[0.995911,0.000001671921,0.003744104,0.00002373856,0.0000384643,0.00002532666,0.000001071241,0.000007634104,0.0002470057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8134574,"threshold_uncertainty_score":0.4693904,"prediction_status":"machine_predicted_unvalidated"},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"observational","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W2283744749","doi":"","title":"Complex AI on Small Embedded Systems: Humanoid Robotics using Mobile Phones","year":2010,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Humanoid robot; Robotics; Payload (computing); Computer science; Accelerometer; Mobile robot; Embedded system; Robot; Artificial intelligence; Mobile phone; Human–computer interaction; Real-time computing; Telecommunications; Computer security; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.1559145963562388,"gpt":0.3359073205466848,"spread":0.179992724190446,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573662,0.0002313949,0.000211784,0.0002162788,0.0001842483,0.0002207063,0.0002341853,0.0001672684,0.0002663455],"category_scores_gemma":[0.0001340536,0.0002411364,0.00005730535,0.0002501317,0.00009494783,0.00008725464,0.00001717213,0.0004148983,0.000315792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009979273,"about_ca_system_score_gemma":0.0001125986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003109884,"about_ca_topic_score_gemma":0.00009352134,"domain_scores_codex":[0.9984532,0.00004839628,0.0004626109,0.0002831592,0.0004876905,0.0002649401],"domain_scores_gemma":[0.9988165,0.0001617923,0.00007355608,0.0002150711,0.0006322122,0.0001008732],"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.00001125137,0.00005860035,0.000006727275,0.00001720578,0.000009223467,0.000001824955,0.00007381968,0.6886843,0.03518254,0.2740443,0.00007580841,0.001834319],"study_design_scores_gemma":[0.000027181,0.00006839206,0.00003495699,0.00004590915,0.000007389596,0.000003316286,0.0001389074,0.9627901,0.02824684,0.008135254,0.000241964,0.0002598166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1277019,0.00002085729,0.8590177,0.0001896635,0.002794614,0.0006323519,0.00006703477,0.0003771656,0.009198731],"genre_scores_gemma":[0.9968262,0.00001020706,0.002478235,0.0001827548,0.0003125937,0.00002107135,0.00006683927,0.00003539591,0.00006670687],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8691243,"threshold_uncertainty_score":0.9833257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090036526","doi":"","title":"Distance Metric Learning Versus Fisher Discriminant Analysis.","year":2008,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Face and Expression Recognition","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":"University of Waterloo","funders":"","keywords":"Linear discriminant analysis; Optimal discriminant analysis; Metric (unit); Artificial intelligence; Statistics; Kernel Fisher discriminant analysis; Mathematics; Discriminant; Computer science; Multiple discriminant analysis; Fisher kernel; Pattern recognition (psychology); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1979443978086781,"gpt":0.3505868042994003,"spread":0.1526424064907221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000313963,0.000172582,0.0002097341,0.0005267131,0.0004194108,0.0001631129,0.0006229585,0.00008164126,0.0003636695],"category_scores_gemma":[0.0005923878,0.0001555986,0.0001393332,0.002077351,0.0001092251,0.0005058103,0.00009359536,0.0002960317,0.0007587821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008968449,"about_ca_system_score_gemma":0.000166594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000512161,"about_ca_topic_score_gemma":0.00007132759,"domain_scores_codex":[0.9978889,0.0001114775,0.0003680915,0.0005290324,0.0008249262,0.0002776106],"domain_scores_gemma":[0.9985489,0.0003547342,0.0001497616,0.0002386673,0.0005946936,0.0001132747],"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.0001710933,0.0002917988,0.0004348766,0.000005931656,0.0001171953,0.00002482728,0.0007867382,0.0167631,0.0008956029,0.8626682,0.0008383855,0.1170022],"study_design_scores_gemma":[0.0001305264,0.0003665696,0.007215251,0.00004150918,0.00005886985,0.000006659055,0.0003579101,0.9027795,0.02314134,0.06111208,0.004119809,0.0006699489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01411098,0.00003883367,0.9602107,0.001392873,0.0005163891,0.0001160394,0.0000064701,0.0001506235,0.02345712],"genre_scores_gemma":[0.9953536,0.00007863323,0.003627987,0.0002069453,0.0000685544,0.00002553279,0.00002630826,0.000006055293,0.0006063633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9812427,"threshold_uncertainty_score":0.9752862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W14532928","doi":"10.1155/2003/213213","title":"Mining and re-ranking for answering biographical queries on the web","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Topic Modeling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Canadian Association of Gastroenterology","keywords":"Computer science; Bootstrapping (finance); Ranking (information retrieval); Information retrieval; Question answering; Knowledge base; Web mining; World Wide Web; Web page; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.146808381603242,"gpt":0.3276615497888354,"spread":0.1808531681855934,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006071382,0.0001320259,0.0001095014,0.0001631111,0.0003377909,0.0003379351,0.0004421149,0.00006550486,0.00002137315],"category_scores_gemma":[0.0002899997,0.0001045196,0.0000517823,0.0002798811,0.0001255607,0.0001782488,0.00006768326,0.0001301516,0.000008854798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002898802,"about_ca_system_score_gemma":0.0001007602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002794272,"about_ca_topic_score_gemma":0.0001705736,"domain_scores_codex":[0.9985937,0.00004677613,0.0002945001,0.0003995538,0.0004481245,0.0002173701],"domain_scores_gemma":[0.998651,0.0007645458,0.00008209413,0.000196151,0.0002706998,0.00003553577],"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.00001357657,0.00002193817,0.00005503845,0.000003289901,0.00000339385,7.102278e-7,0.0001446601,0.001091575,0.001234917,0.9596836,0.00006697733,0.03768034],"study_design_scores_gemma":[0.00001885127,0.00007044496,0.0001650067,0.00004835734,0.00000175984,0.000001543107,0.0001401124,0.6293617,0.009682511,0.3597496,0.0006258074,0.0001341999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08903495,0.00003483098,0.8905358,0.01318959,0.0003027495,0.0002634934,0.000007552352,0.000105423,0.006525575],"genre_scores_gemma":[0.9830821,0.00001072519,0.01606672,0.0005846606,0.0001657013,0.00004461558,0.000002389783,0.000006134954,0.00003702033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8940471,"threshold_uncertainty_score":0.4262187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}