{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":23,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":23,"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","author_layer_release":"2026-06-26"},"query_hash":"6a96cabb7b09","filters":{"venue":"International Conference on Artificial Intelligence"}},"results":[{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"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":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","authors":[{"name":"Santiago Ontañón","is_ca":false},{"name":"Michael Buro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2196141500131067,"gpt":0.3844458776644416,"spread":0.1648317276513349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673571,0.0009428684,0.0008605099,0.0005359966,0.0006067909,0.0007429241,0.001320283,0.0007561723,0.003800185],"category_scores_gemma":[0.00686293,0.0003755555,0.0006135935,0.0006007868,0.001317901,0.002233011,0.001561657,0.001663691,0.0003176051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179096,"about_ca_system_score_gemma":0.001865946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.011899,"about_ca_topic_score_gemma":0.01345698,"domain_scores_codex":[0.9992285,0.0003424017,0.00003494546,0.0001372136,0.0001564209,0.0001005917],"domain_scores_gemma":[0.9955583,0.003667763,0.0002428907,0.0001827218,0.0001400335,0.0002082907],"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.00005689155,0.0000340409,0.0003110099,0.00004306756,0.00001698665,0.00003356813,0.00006294162,0.9558778,0.0002818358,0.03057133,0.0007596906,0.01195076],"study_design_scores_gemma":[0.000006158169,0.00001221078,0.00003210011,0.000002913566,0.000002651383,0.000005643222,0.00000684285,0.9837036,0.00007848453,0.0159035,0.0002433628,0.000002483794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03679334,0.0002591226,0.9568267,0.0002871021,0.00003182156,0.0001031354,0.0001010358,0.0003246814,0.005272948],"genre_scores_gemma":[0.8025454,0.0003503318,0.1925594,0.0001465667,0.00003212614,0.0002459135,0.0002559138,0.0001169837,0.003747279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.011899,"threshold_uncertainty_score":0.02365947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2290243003","doi":"","title":"Using a recursive neural network to learn an agent's decision model for plan recognition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"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":"Computer science; Plan (archaeology); Artificial intelligence; Benchmark (surveying); Machine learning; A priori and a posteriori; Key (lock); Artificial neural network; Decision model; State (computer science); Algorithm","authors":[{"name":"Francis Bisson","is_ca":true},{"name":"Hugo Larochelle","is_ca":true},{"name":"Froduald Kabanza","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.4943415044693059,"gpt":0.4136130999912715,"spread":0.08072840447803431,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008049076,0.0006922797,0.00068064,0.0004482293,0.0003436332,0.0008008501,0.001452781,0.001049604,0.002041099],"category_scores_gemma":[0.0031259,0.0004759124,0.0006000972,0.0005098233,0.0006052479,0.001644,0.0006323279,0.001651759,0.000447108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001241291,"about_ca_system_score_gemma":0.001315428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01995114,"about_ca_topic_score_gemma":0.02777042,"domain_scores_codex":[0.9996719,0.00008055503,0.00002021337,0.0001198434,0.00006342415,0.00004404334],"domain_scores_gemma":[0.9990964,0.0005656116,0.00008619863,0.0001050468,0.0001147209,0.00003208976],"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.0001235497,0.00009448644,0.001374813,0.00005978778,0.00006458888,0.00008308196,0.00009504741,0.8566927,0.004084538,0.008160129,0.001269017,0.1278982],"study_design_scores_gemma":[0.00000353964,0.00001041483,0.0000722281,0.00000296974,0.000005318475,0.000005986461,0.000003149879,0.9973252,0.0004765819,0.00195263,0.0001382934,0.000003634783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04871958,0.0002625708,0.9464267,0.0003016948,0.00004061487,0.00007052663,0.0001517521,0.001625278,0.002401274],"genre_scores_gemma":[0.6931954,0.0002746875,0.302488,0.0001968153,0.00003043575,0.0001797754,0.0004822695,0.0001052707,0.003047425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01995114,"threshold_uncertainty_score":0.03966999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293616274","doi":"","title":"Maximizing the coverage of information propagation in social networks","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"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":"Submodular set function; Computer science; Node (physics); Maximization; Set (abstract data type); Popularity; Theoretical computer science; Mathematical optimization; Mathematics","authors":[{"name":"Zhefeng Wang","is_ca":false},{"name":"Enhong Chen","is_ca":false},{"name":"Qi Liu","is_ca":false},{"name":"Yang Yu","is_ca":true},{"name":"Yong Ge","is_ca":false},{"name":"Biao Chang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0992775265964285,"gpt":0.3408353436913399,"spread":0.2415578170949114,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003042893,0.00200685,0.002329751,0.002210153,0.001049268,0.001921134,0.002964328,0.00236498,0.001657309],"category_scores_gemma":[0.0148732,0.001169017,0.001246631,0.002682561,0.001576102,0.004227543,0.002209741,0.001463693,0.0003618276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001978753,"about_ca_system_score_gemma":0.00100183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003573617,"about_ca_topic_score_gemma":0.002837891,"domain_scores_codex":[0.997449,0.001127944,0.00009998182,0.0005675595,0.0005120234,0.0002434623],"domain_scores_gemma":[0.9856332,0.01207448,0.0009498539,0.000522692,0.0004712203,0.0003485396],"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.0002236625,0.0001257052,0.002699734,0.0004568885,0.0001478922,0.0002577813,0.0002994682,0.9046268,0.002929449,0.01843615,0.003303505,0.06649294],"study_design_scores_gemma":[0.00001784312,0.00004543622,0.0004046996,0.00001744832,0.00002931757,0.00008286416,0.00004380946,0.9805002,0.00111216,0.01703159,0.0007049078,0.000009815491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07695448,0.0018472,0.9144939,0.000921631,0.00004157168,0.0002336623,0.0004210432,0.0004829121,0.004603607],"genre_scores_gemma":[0.8151181,0.002231729,0.1777136,0.0002333743,0.0002276493,0.0004857222,0.0009295805,0.0002222955,0.002837959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003573617,"threshold_uncertainty_score":0.01609254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2265246327","doi":"","title":"On the empirical time complexity of random 3-SAT at the phase transition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; DPLL algorithm; Scaling; Exponential function; Context (archaeology); Computer science; Boolean satisfiability problem; Solver; Time complexity; Constant (computer programming); Function (biology); Algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Jitter","authors":[{"name":"Zongxu Mu","is_ca":true},{"name":"Holger H. Hoos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3905235528133467,"gpt":0.397099776394029,"spread":0.006576223580682272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00512607,0.0009124386,0.0009273748,0.001672046,0.0008650409,0.001866586,0.001757813,0.001380256,0.003113965],"category_scores_gemma":[0.06872711,0.0006321257,0.0008590729,0.002784123,0.002152267,0.004369623,0.001593738,0.003454671,0.0008396363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002027652,"about_ca_system_score_gemma":0.001774031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003854351,"about_ca_topic_score_gemma":0.002837378,"domain_scores_codex":[0.9950933,0.001714229,0.000263082,0.001328346,0.0009951808,0.0006057986],"domain_scores_gemma":[0.9176026,0.06723917,0.003266335,0.007892534,0.00291402,0.00108534],"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.002423751,0.0008651401,0.0648841,0.001438086,0.000432073,0.0005213312,0.0008792125,0.6988919,0.01415054,0.07243251,0.03342837,0.1096529],"study_design_scores_gemma":[0.0001197171,0.0003465635,0.01787718,0.0001388229,0.00007899514,0.0004950469,0.0002777716,0.9227089,0.007785523,0.04495322,0.005150468,0.00006779088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8347362,0.01027812,0.1272233,0.003960146,0.0002765638,0.0001793457,0.005541967,0.003048894,0.01475557],"genre_scores_gemma":[0.9563138,0.001687263,0.03110878,0.0004833915,0.0001970694,0.0002850509,0.007879261,0.000742244,0.001302991],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00512607,"threshold_uncertainty_score":0.02710962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2200051882","doi":"","title":"Data sparseness in linear SVM","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","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":"Western University","funders":"","keywords":"Support vector machine; Computer science; Inference; Machine learning; Convergence (economics); Artificial intelligence; Data mining; Bayes' theorem; Pattern recognition (psychology); Bayesian probability","authors":[{"name":"Xiang Li","is_ca":true},{"name":"Huaimin Wang","is_ca":false},{"name":"Bin Gu","is_ca":true},{"name":"Charles X. Ling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.3493317464406938,"gpt":0.4170538751309196,"spread":0.06772212869022581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008235198,0.0005635389,0.001251244,0.000806233,0.0006420108,0.001532376,0.001310453,0.001430628,0.001037855],"category_scores_gemma":[0.05540423,0.0006452515,0.000477498,0.001120447,0.001799428,0.002955123,0.001802412,0.002784267,0.0003306901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001119458,"about_ca_system_score_gemma":0.0008379112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001497889,"about_ca_topic_score_gemma":0.0009411935,"domain_scores_codex":[0.9950042,0.00256801,0.0002349155,0.0006884239,0.001310983,0.0001932734],"domain_scores_gemma":[0.9711778,0.02378675,0.00123134,0.001505465,0.001985297,0.0003134082],"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.0004442187,0.0001515549,0.006849531,0.0004290402,0.0001098462,0.0002934247,0.0003973904,0.7008481,0.004596523,0.1218651,0.004397065,0.1596182],"study_design_scores_gemma":[0.00000879397,0.00003098865,0.000265185,0.00001190871,0.000004298397,0.0000490116,0.00001412706,0.96733,0.0006265535,0.03136486,0.0002891719,0.000005199036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02128887,0.0005033699,0.9762304,0.0006752763,0.00003740301,0.00004932426,0.00005399473,0.0002502894,0.0009111441],"genre_scores_gemma":[0.7455817,0.0008065338,0.2503433,0.0005979073,0.0002288789,0.0002752937,0.0004393006,0.0001635784,0.001563623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008235198,"threshold_uncertainty_score":0.0435524,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293319454","doi":"","title":"Correcting covariate shift with the Frank-Wolfe algorithm","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","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 Alberta","funders":"","keywords":"Covariate; Kernel (algebra); Matching (statistics); Computer science; Algorithm; Mathematics; Statistics; Econometrics","authors":[{"name":"Junfeng Wen","is_ca":true},{"name":"Russell Greiner","is_ca":true},{"name":"Dale Schuurmans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1779524532938985,"gpt":0.3415912475879936,"spread":0.1636387942940951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004249881,0.000741112,0.001519375,0.0009976574,0.0008834894,0.001214006,0.001824933,0.002179965,0.001827091],"category_scores_gemma":[0.01961635,0.0007177065,0.0008733697,0.001017793,0.001238775,0.002787111,0.002594838,0.001901896,0.000823914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000779003,"about_ca_system_score_gemma":0.001980985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00258281,"about_ca_topic_score_gemma":0.002420301,"domain_scores_codex":[0.9978312,0.0008242122,0.0001366211,0.0005212782,0.0005631434,0.0001235906],"domain_scores_gemma":[0.9960167,0.001877487,0.0003418229,0.001034382,0.0006124683,0.000117214],"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.000238553,0.0001353235,0.002757785,0.0001512959,0.0001385306,0.0001830466,0.0003122327,0.4554793,0.008195565,0.05838688,0.005405824,0.4686157],"study_design_scores_gemma":[0.00001997276,0.00004674588,0.0003116935,0.0000101506,0.00001122584,0.000105825,0.00002002303,0.9676068,0.003221706,0.02686654,0.001759855,0.00001936923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00491892,0.00009243187,0.9942337,0.00009123355,0.00002149102,0.00002293241,0.00001739925,0.0003553128,0.0002465985],"genre_scores_gemma":[0.1777825,0.0001349806,0.8195819,0.0001998369,0.00004898597,0.0001262608,0.0001441399,0.0001697146,0.001811714],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004249881,"threshold_uncertainty_score":0.02247584,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2217140526","doi":"","title":"Modular systems with preferences","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rotation formalisms in three dimensions; Modular design; Formalism (music); Computer science; Preference; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","authors":[{"name":"Alireza Ensan","is_ca":true},{"name":"Eugenia Ternovska","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1857159101851297,"gpt":0.3284845900494835,"spread":0.1427686798643538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004337571,0.0007253714,0.0005240803,0.001549297,0.001143482,0.002603967,0.001709435,0.001053539,0.005456102],"category_scores_gemma":[0.006597974,0.0006898085,0.001816611,0.001555689,0.002435127,0.006541499,0.005147651,0.002033686,0.001085349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001068244,"about_ca_system_score_gemma":0.001173872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001601624,"about_ca_topic_score_gemma":0.001473695,"domain_scores_codex":[0.9965322,0.001237483,0.0003399932,0.0006438056,0.0009026687,0.0003439129],"domain_scores_gemma":[0.9970433,0.0009820119,0.0003926918,0.0008641251,0.0004603365,0.0002574823],"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.00001826357,0.00001928409,0.0002493482,0.00006587755,0.0000416818,0.000170444,0.0003474655,0.009035399,0.001519574,0.9670703,0.0007073486,0.020755],"study_design_scores_gemma":[0.00002891714,0.00004900916,0.0001600317,0.0000404224,0.00005434663,0.0001873707,0.0001197172,0.053827,0.00202198,0.9247153,0.01876938,0.00002642734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008321784,0.000152233,0.9828744,0.000367193,0.000035281,0.00007998884,0.0000725387,0.0002807906,0.007815885],"genre_scores_gemma":[0.3226842,0.0004008941,0.6684826,0.0003400595,0.0001593681,0.0003720915,0.0002736197,0.000108956,0.007178182],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005456102,"threshold_uncertainty_score":0.0229395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W16563081","doi":"10.1521/pedi.2006.20.1.81","title":"Evolutionary Computing for Fuzzy System Optimization in Intelligent Control.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Fuzzy control system; Intelligent control; Fuzzy logic; Evolutionary computation; Control (management); Distributed computing; Artificial intelligence","authors":[{"name":"Oscar Castillo","is_ca":false},{"name":"Gabriel Huesca","is_ca":false},{"name":"Fevrier Valdez","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06437064323099818,"gpt":0.3006360433241824,"spread":0.2362654000931843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002208024,0.00105862,0.001581242,0.001023954,0.0005281501,0.001553645,0.001313926,0.001631557,0.007773347],"category_scores_gemma":[0.003033135,0.0005239283,0.00117084,0.001254906,0.0008141967,0.0008720833,0.001398005,0.001743981,0.001410733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001225471,"about_ca_system_score_gemma":0.001263937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006206099,"about_ca_topic_score_gemma":0.006010275,"domain_scores_codex":[0.9995226,0.0001767505,0.0000417667,0.00009677564,0.0001202267,0.00004181537],"domain_scores_gemma":[0.9991893,0.0005126463,0.0000514082,0.00007021316,0.0001448524,0.00003149832],"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.00009452535,0.0000795427,0.0009575007,0.000531604,0.0002344734,0.0001561499,0.0001839948,0.5911812,0.00113091,0.09958208,0.00804763,0.2978203],"study_design_scores_gemma":[0.0000176883,0.0000389286,0.0002014666,0.00005840555,0.0000226528,0.00002891858,0.00002768685,0.958536,0.000204443,0.03373965,0.00711392,0.0000101644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004110718,0.005782815,0.9775987,0.000597178,0.0002861203,0.0001247573,0.0001033582,0.0004892843,0.01090702],"genre_scores_gemma":[0.2770635,0.0046851,0.6984801,0.0004780998,0.0004143738,0.0008715871,0.0004283767,0.0002300575,0.01734873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007773347,"threshold_uncertainty_score":0.02600443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2274259390","doi":"","title":"Center-based initialization for large-scale black-box problems","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Initialization; Population; Computer science; Mathematical optimization; Benchmark (surveying); Latin hypercube sampling; Differential evolution; Particle swarm optimization; Algorithm; Monte Carlo method; Mathematics; Statistics","authors":[{"name":"Shahryar Rahnamayan","is_ca":true},{"name":"G. Gary Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1344271892125133,"gpt":0.3802287657734609,"spread":0.2458015765609476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238477,0.0007785981,0.000987909,0.0007988118,0.0007584369,0.0007702814,0.001122182,0.0009105582,0.002477072],"category_scores_gemma":[0.005054564,0.000354133,0.0004996722,0.0007522223,0.0008399877,0.001059892,0.001042306,0.0008857374,0.0005018971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000702564,"about_ca_system_score_gemma":0.0009593081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001665861,"about_ca_topic_score_gemma":0.001199316,"domain_scores_codex":[0.9992186,0.0003940015,0.0000340952,0.00009160297,0.0002030718,0.00005866063],"domain_scores_gemma":[0.9981504,0.001061578,0.0002126013,0.0001793599,0.0003255342,0.00007043334],"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.0001624999,0.00007391413,0.001021372,0.0001085485,0.00003931818,0.0001103356,0.0001041509,0.8988178,0.003623814,0.02955879,0.001833917,0.06454547],"study_design_scores_gemma":[0.00002219413,0.00003592021,0.0001196937,0.00001011123,0.000008153569,0.00003490908,0.00001296178,0.9911243,0.002085194,0.004912046,0.001626143,0.00000843083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01468108,0.0003358498,0.9815084,0.00009254165,0.00003343837,0.00008011234,0.00002033118,0.0003637539,0.002884472],"genre_scores_gemma":[0.4834228,0.0004210042,0.5135127,0.0001181982,0.00004455386,0.0003314661,0.0001481418,0.0001708773,0.001830481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002477072,"threshold_uncertainty_score":0.01183838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W89723526","doi":"","title":"The AntSynNet Algorithm: Network Syntheses Using Ant Colony Optimization.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"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":"Ant colony optimization algorithms; Computer science; Heuristics; Metaheuristic; Routing (electronic design automation); Heuristic; Mathematical optimization; Domain (mathematical analysis); Ant colony; Process (computing); Set (abstract data type); Parallel metaheuristic; Algorithm; Artificial intelligence; Meta-optimization; Mathematics; Computer network","authors":[{"name":"Simon Wilkinson","is_ca":false},{"name":"Tony White","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07995878778245127,"gpt":0.3109012267291485,"spread":0.2309424389466973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005772587,0.0008602885,0.0007156671,0.0008638802,0.0005759153,0.0009510299,0.001260644,0.0009299678,0.004620687],"category_scores_gemma":[0.001360775,0.0004600026,0.000517725,0.0008522008,0.0006748787,0.001050895,0.0009072799,0.0009375666,0.00152459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006118398,"about_ca_system_score_gemma":0.001483561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002073116,"about_ca_topic_score_gemma":0.003642079,"domain_scores_codex":[0.9997241,0.00005822657,0.00001434873,0.00005292608,0.0001286798,0.00002167075],"domain_scores_gemma":[0.9996625,0.0001427086,0.00006090531,0.00004380123,0.00006824142,0.00002179439],"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.0001051671,0.0001029134,0.0006203908,0.0003753116,0.0001093478,0.000179075,0.0001263912,0.6281785,0.01199868,0.05254047,0.01530342,0.2903603],"study_design_scores_gemma":[0.00004910025,0.00005443679,0.0001291689,0.00004371562,0.00002498407,0.0001670527,0.00003478122,0.9370515,0.005775434,0.01591792,0.04073152,0.00002039626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00661247,0.001104891,0.9710087,0.0002361958,0.0002530426,0.0002292725,0.0001934408,0.002318554,0.01804348],"genre_scores_gemma":[0.05667185,0.0008750662,0.9310694,0.0001443353,0.00005307724,0.0005000443,0.0004570418,0.0005322929,0.009696942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004620687,"threshold_uncertainty_score":0.01545781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W194540509","doi":"","title":"A Modeling for the Total Tardiness SMSDST Problem Using Constraint Programming.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"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; Université du Québec","funders":"","keywords":"Tardiness; Constraint programming; Computer science; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Concurrent constraint logic programming; Constraint logic programming; Programming language; Job shop scheduling; Stochastic programming; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","authors":[{"name":"Aymen Sioud","is_ca":true},{"name":"Marc Gravel","is_ca":true},{"name":"Caroline Gagné","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1200230154725008,"gpt":0.3461662791720779,"spread":0.2261432636995771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819667,0.001020468,0.0008971825,0.001011036,0.0007727995,0.002367071,0.003432348,0.001486942,0.007131199],"category_scores_gemma":[0.004269744,0.0007597708,0.001930307,0.002053315,0.0007352715,0.001844357,0.001077565,0.002145055,0.0008403335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002668825,"about_ca_system_score_gemma":0.004996845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04467817,"about_ca_topic_score_gemma":0.05169515,"domain_scores_codex":[0.9987692,0.0004630358,0.00006481566,0.0002056571,0.0003208931,0.0001764531],"domain_scores_gemma":[0.9982787,0.001062455,0.0001981582,0.0000977045,0.0002368467,0.0001261779],"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.00004681028,0.00006316673,0.000309636,0.0001427145,0.00003621799,0.0001444485,0.00006081699,0.9213902,0.0005215223,0.06383476,0.003657901,0.009791809],"study_design_scores_gemma":[0.00001199703,0.00001688381,0.00007148895,0.00001909282,0.00001091648,0.00003331286,0.00002847186,0.9801165,0.0001392889,0.01667554,0.002868297,0.000008193721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01167853,0.0005872667,0.9673436,0.001085569,0.0001581171,0.0002852344,0.001394909,0.0002682594,0.01719866],"genre_scores_gemma":[0.3668702,0.001616154,0.6079632,0.0004417532,0.0002043638,0.0009856331,0.001942753,0.0003382356,0.01963764],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04467817,"threshold_uncertainty_score":0.08883625,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36478636","doi":"10.1002/cphc.202200731","title":"A Matrix Based Approach For Modeling Robotic Swarm Behavior.","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Matrix (chemical analysis); Artificial intelligence","authors":[{"name":"Sarosh Hashmi","is_ca":false},{"name":"Waqar Mahmood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07657845565800311,"gpt":0.3338920032185947,"spread":0.2573135475605917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560653,0.0008435601,0.0006206405,0.0005739639,0.000581791,0.0007692922,0.001130565,0.001527931,0.008344892],"category_scores_gemma":[0.0007336124,0.0005266578,0.0009297866,0.0004334139,0.0004977619,0.0007255804,0.0009447901,0.0009716849,0.001703272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007789254,"about_ca_system_score_gemma":0.0006949122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01346454,"about_ca_topic_score_gemma":0.01014184,"domain_scores_codex":[0.9999052,0.00002926909,0.000005172384,0.00001797797,0.00002905237,0.00001327433],"domain_scores_gemma":[0.9997953,0.00008931252,0.00003551245,0.00001956728,0.00003526373,0.00002507067],"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.00000897366,0.00001266921,0.0002219127,0.00003675739,0.00003477247,0.00005987214,0.00002065315,0.9748834,0.0009397412,0.01905468,0.0008544385,0.003872104],"study_design_scores_gemma":[0.000003069603,0.00000444634,0.0000372092,0.000002812805,0.000002247345,0.000006954851,0.000005526609,0.9951063,0.00004672913,0.003356714,0.001425774,0.000002146934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02070211,0.001087032,0.9468473,0.0007556523,0.0002903673,0.0001263904,0.0008731466,0.0008524355,0.02846558],"genre_scores_gemma":[0.6356565,0.001849643,0.3192169,0.0002591516,0.0001921236,0.001252595,0.001051038,0.0004208568,0.0401012],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01346454,"threshold_uncertainty_score":0.02791643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2266817871","doi":"","title":"An expectation-maximization algorithm to compute a stochastic factorization from data","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"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":"Stochastic matrix; Markov chain; Factorization; Algorithm; Matrix (chemical analysis); Computer science; Matrix decomposition; Matrix multiplication; Probabilistic logic; Mathematical optimization; Markov decision process; Markov process; Mathematics; Artificial intelligence; Machine learning","authors":[{"name":"André M. S. Barreto","is_ca":false},{"name":"Rafael L. Beirigo","is_ca":false},{"name":"Joëlle Pineau","is_ca":true},{"name":"Doina Precup","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.6099591275582319,"gpt":0.5389729520319333,"spread":0.0709861755262986,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002934909,0.001831774,0.001533216,0.001229008,0.0006820237,0.001182392,0.001940244,0.001428597,0.006992678],"category_scores_gemma":[0.009147091,0.001088454,0.001379553,0.001579504,0.001042781,0.00172893,0.001824423,0.003282177,0.002385388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001226592,"about_ca_system_score_gemma":0.003184216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006458485,"about_ca_topic_score_gemma":0.008442705,"domain_scores_codex":[0.9988773,0.000456531,0.00008552792,0.0002660677,0.0002341581,0.00008047579],"domain_scores_gemma":[0.996799,0.002450673,0.0001658544,0.0002103859,0.0002920212,0.00008199381],"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.0001919449,0.0002525224,0.001330362,0.0003402938,0.0002807191,0.0001611343,0.0001589209,0.5769126,0.004933702,0.04957493,0.009350187,0.3565127],"study_design_scores_gemma":[0.0000245254,0.00002761217,0.00008626068,0.00001174656,0.00001341317,0.000032002,0.000009426876,0.9802202,0.0007372819,0.01761817,0.001209409,0.000009943177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007739571,0.00003854053,0.9984156,0.00007393684,0.0000163764,0.00003652272,0.00003506934,0.0003914983,0.0002184409],"genre_scores_gemma":[0.04158413,0.0001286171,0.9561656,0.0001446832,0.00005665957,0.000406089,0.0003756707,0.0001416548,0.000996871],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006992678,"threshold_uncertainty_score":0.0233928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W153785916","doi":"","title":"Using Encyclopaedic Knowledge for Query Classification.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Information retrieval; Natural language processing; Artificial intelligence","authors":[{"name":"Richard Khoury","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2987819629349078,"gpt":0.4204165625896202,"spread":0.1216345996547124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116353,0.001028549,0.00102787,0.01543466,0.0009607936,0.003005904,0.001232652,0.001065645,0.0110122],"category_scores_gemma":[0.0102892,0.0002752048,0.0010227,0.008824158,0.0003615602,0.004686357,0.001686744,0.0007881396,0.005602468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0013872,"about_ca_system_score_gemma":0.002280605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03224246,"about_ca_topic_score_gemma":0.04018201,"domain_scores_codex":[0.9978339,0.0003083941,0.0003383839,0.0004824578,0.0007933816,0.0002433895],"domain_scores_gemma":[0.9963934,0.001415019,0.0002616503,0.0005424329,0.001147728,0.0002396957],"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.001060832,0.0005907006,0.05083696,0.001810257,0.0004085288,0.001028974,0.001195634,0.004961011,0.01816993,0.008289326,0.106381,0.8052667],"study_design_scores_gemma":[0.0002495635,0.0006404397,0.09181642,0.001434399,0.001239158,0.004763027,0.008385314,0.2735386,0.05056031,0.04252946,0.5245295,0.0003139156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2800356,0.01665699,0.3211316,0.005353436,0.001396883,0.00301853,0.2227712,0.03403124,0.1156044],"genre_scores_gemma":[0.535926,0.00423399,0.2398331,0.0008307671,0.0003971657,0.0006837456,0.2043895,0.000713864,0.01299183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03224246,"threshold_uncertainty_score":0.06410956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W152011799","doi":"","title":"Arabic Handwriting Descriptor Using Gaussian Steerable Filters.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Handwriting; Computer science; Artificial intelligence; Arabic; Gaussian; Pattern recognition (psychology); Speech recognition; Physics; Linguistics","authors":[{"name":"Ayman Al-Dmour","is_ca":false},{"name":"Ahmed Musa","is_ca":false},{"name":"Raed Abu Zitar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1202223762983931,"gpt":0.344228098910508,"spread":0.224005722612115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002958589,0.0006241686,0.0005303124,0.001533562,0.0002891156,0.0008813064,0.0004426987,0.0006077045,0.008408763],"category_scores_gemma":[0.001085339,0.0001866471,0.0004684324,0.001432599,0.0002541818,0.0008848415,0.0004914571,0.0005758763,0.006798301],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000227465,"about_ca_system_score_gemma":0.0005805737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002504584,"about_ca_topic_score_gemma":0.003187748,"domain_scores_codex":[0.9997436,0.00003587107,0.00002089725,0.00005811897,0.0001109466,0.00003050846],"domain_scores_gemma":[0.9995193,0.00005458225,0.00004651282,0.00009122858,0.0002486763,0.00003965433],"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.0003934058,0.00005200641,0.000474618,0.0002013582,0.00004398775,0.0001370305,0.00005648042,0.007754387,0.09555962,0.004036022,0.01380614,0.8774849],"study_design_scores_gemma":[0.00007256879,0.0004419758,0.01030236,0.0001217167,0.0001311645,0.001427009,0.0003501183,0.664272,0.2249687,0.005278765,0.09252099,0.0001127175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03632915,0.001413568,0.9446399,0.0002635687,0.0005756668,0.0001499202,0.001189915,0.004891159,0.01054722],"genre_scores_gemma":[0.3373139,0.00186808,0.6194364,0.0001899726,0.0002793246,0.0001821783,0.003309733,0.000522021,0.03689852],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008408763,"threshold_uncertainty_score":0.02813011,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W49892756","doi":"","title":"Exploratory Analysis of Transaction Data","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Database transaction; Computer science; Transaction data; Transaction processing; Asset (computer security); Financial transaction; Point (geometry); Data science; Data visualization; Grid; Visualization; Data modeling; Computer security; Industrial organization; Data mining; Business; Database; Geography","authors":[{"name":"Paul Whitney","is_ca":false},{"name":"Mark R. Weimar","is_ca":false},{"name":"Gus Calapristi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2323307498745459,"gpt":0.3481484468204088,"spread":0.1158176969458629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005571003,0.0009931755,0.0006679049,0.009170242,0.0007789199,0.003637616,0.0007873234,0.0004363483,0.004145484],"category_scores_gemma":[0.02684801,0.0002897263,0.001070109,0.007458218,0.000821445,0.002798534,0.001917772,0.0008392088,0.001127125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006738144,"about_ca_system_score_gemma":0.001217906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009982954,"about_ca_topic_score_gemma":0.001138278,"domain_scores_codex":[0.9943867,0.002101563,0.0004778142,0.0005972809,0.002170692,0.000265954],"domain_scores_gemma":[0.9760995,0.01537764,0.001918969,0.002628855,0.003569279,0.0004057626],"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.001397864,0.0006782929,0.1796542,0.003717186,0.0009719887,0.002788239,0.01834463,0.01532556,0.02653264,0.0725899,0.02204555,0.6559539],"study_design_scores_gemma":[0.0002065707,0.001660231,0.2315646,0.001611363,0.0006886296,0.005717737,0.04742537,0.2431224,0.03751694,0.2682201,0.1618247,0.0004414289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4346287,0.002268476,0.4956023,0.002581499,0.0002195153,0.002364577,0.0352598,0.004296827,0.02277836],"genre_scores_gemma":[0.7699694,0.0008405141,0.2084094,0.0001663802,0.000118978,0.001219813,0.01692794,0.00028026,0.002067364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009170242,"threshold_uncertainty_score":0.02946264,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2478686883","doi":"","title":"Plenary lecture 8: towards opposition and center-based sampling for high-dimensional search spaces","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Opposition (politics); Computer science; Population; Computational intelligence; Particle swarm optimization; Differential evolution; Artificial intelligence; Evolutionary computation; Algorithm; Machine learning; Sociology; Political science; Law","authors":[{"name":"Shahryar Rahnamayan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1643328675132108,"gpt":0.3920872015279786,"spread":0.2277543340147678,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464065,0.001609111,0.001383379,0.0006237458,0.0007178885,0.003175928,0.001205722,0.001555843,0.03517719],"category_scores_gemma":[0.007597671,0.0005499044,0.001365362,0.0006515293,0.00134542,0.003267174,0.001942409,0.006133966,0.01455357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001406229,"about_ca_system_score_gemma":0.0007326437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008529803,"about_ca_topic_score_gemma":0.0006118778,"domain_scores_codex":[0.9989472,0.0002925727,0.00005329059,0.000320456,0.0002926184,0.00009382252],"domain_scores_gemma":[0.9983999,0.0009720071,0.00005875595,0.00009567276,0.0003239032,0.0001497038],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004573797,0.0002284162,0.000650297,0.0009054723,0.0001413662,0.0003470762,0.0003783914,0.0359187,0.004782369,0.2746705,0.4092591,0.272261],"study_design_scores_gemma":[0.0001356552,0.0003878299,0.001220293,0.0007730725,0.00008434137,0.0006957965,0.0002651373,0.1464563,0.003151486,0.3107262,0.5359843,0.0001196982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01020172,0.02741285,0.7462912,0.02499887,0.04019739,0.000291127,0.0007673027,0.001968402,0.1478712],"genre_scores_gemma":[0.1941589,0.0310365,0.4688361,0.009587385,0.04537997,0.001088527,0.002435936,0.00249747,0.2449792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03517719,"threshold_uncertainty_score":0.1176795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115815646","doi":"","title":"The confluence of human capital management and human resource management and the benefits of knowledge engineering","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Knowledge Management and Sharing","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Knowledge management; Human resource management; Competitive advantage; Human resource management system; Business; Context (archaeology); Human capital; Resource management (computing); Computer science; Marketing; Economics","authors":[{"name":"Kevin J. O’Sullivan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05989098378268026,"gpt":0.3223248523561671,"spread":0.2624338685734869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005913751,0.0003859988,0.0003283722,0.001906906,0.002097068,0.008404274,0.0006576534,0.002059353,0.002671247],"category_scores_gemma":[0.01296892,0.000217067,0.0002394724,0.00221282,0.01457812,0.01039374,0.004875075,0.002025764,0.0003052188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002886843,"about_ca_system_score_gemma":0.004519396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001986548,"about_ca_topic_score_gemma":0.002621993,"domain_scores_codex":[0.9945061,0.003075703,0.0001414747,0.0002784159,0.001403719,0.0005946496],"domain_scores_gemma":[0.9829624,0.01232626,0.00158296,0.0008686967,0.001156193,0.001103432],"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.00004207037,0.00008474493,0.003965971,0.0002591835,0.00002833517,0.000210966,0.003379655,0.0009099519,0.0003359782,0.8863509,0.002408112,0.1020241],"study_design_scores_gemma":[0.00002020272,0.0001009458,0.01333634,0.0004810948,0.00002416531,0.0003538414,0.005276675,0.001635488,0.0007524745,0.9106694,0.06731128,0.00003809145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1525456,0.03515598,0.08053907,0.1028754,0.0006509322,0.0001347552,0.00004931114,0.0001272222,0.6279217],"genre_scores_gemma":[0.9705184,0.008316306,0.01257675,0.002334107,0.0006019907,0.00007790713,0.00001136452,0.00001994026,0.005543178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008404274,"threshold_uncertainty_score":0.03127527,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W21360298","doi":"10.1007/s10654-011-9560-y","title":"Solving Temporal Constraints Using Neural Networks.","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Artificial neural network; Computer science; Mathematical optimization; Constraint (computer-aided design); Constraint satisfaction problem; Hopfield network; Optimization problem; Focus (optics); Computation; Constraint satisfaction; Artificial intelligence; Algorithm; Mathematics","authors":[{"name":"Gabriela Ribas Klein","is_ca":true},{"name":"Malek Mouhoub","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1587728586955939,"gpt":0.3267786207031929,"spread":0.168005762007599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00128452,0.001405854,0.001084168,0.001009254,0.0006816244,0.001772074,0.001736898,0.001817614,0.01033964],"category_scores_gemma":[0.00729554,0.0007354089,0.001362529,0.001256784,0.0007164416,0.002428451,0.001728165,0.002333899,0.001123944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001322471,"about_ca_system_score_gemma":0.001676255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01588977,"about_ca_topic_score_gemma":0.02431977,"domain_scores_codex":[0.9995511,0.0001446287,0.00004222959,0.0001464828,0.00005653083,0.00005903118],"domain_scores_gemma":[0.9967833,0.002586942,0.000199909,0.0001467342,0.0001879632,0.00009520799],"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.0002162355,0.0001256981,0.00219394,0.0005314558,0.0002357342,0.0001592831,0.000166538,0.6985373,0.001085301,0.03507403,0.006847317,0.254827],"study_design_scores_gemma":[0.00001183854,0.000009311517,0.0001199123,0.00002651514,0.00001696864,0.00001822086,0.00001799794,0.9657856,0.0001774991,0.03259242,0.001218046,0.000005703737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02127482,0.00418822,0.9582368,0.001777287,0.0002890044,0.0001777953,0.001229425,0.0028739,0.009952655],"genre_scores_gemma":[0.449107,0.002271024,0.535791,0.0006541347,0.0002197464,0.0008701943,0.002411976,0.0003758268,0.008298968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01588977,"threshold_uncertainty_score":0.03458959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W36524623","doi":"10.1016/j.scitotenv.2021.145866","title":"Blending e-learning and knowledge management for optimizing learning paths","year":2008,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut National de Santé Publique du Québec","keywords":"Computer science; Process (computing); Path (computing); Quality (philosophy); Knowledge acquisition; Order (exchange); Artificial intelligence; Knowledge management; Machine learning; Human–computer interaction","authors":[{"name":"Dumitru Dan Burdescu","is_ca":false},{"name":"Marian Cristian Mihăescu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1169658852890127,"gpt":0.3397907915041923,"spread":0.2228249062151796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001298576,0.0008006651,0.0005735019,0.001208399,0.0004144988,0.002838768,0.001848409,0.001322296,0.007947139],"category_scores_gemma":[0.006228133,0.000319675,0.0005285506,0.001582162,0.0004241408,0.00492459,0.003175104,0.0009450274,0.002079355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008972287,"about_ca_system_score_gemma":0.002443923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003258301,"about_ca_topic_score_gemma":0.003717667,"domain_scores_codex":[0.9990587,0.0002759431,0.00006770291,0.0002340403,0.0002425721,0.0001211631],"domain_scores_gemma":[0.9977187,0.001075862,0.0001997635,0.0003300534,0.0004479638,0.0002277273],"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.0001663239,0.001648357,0.007335602,0.0003462298,0.00007888448,0.0001649964,0.0003770758,0.191074,0.003803554,0.01097997,0.002656749,0.7813681],"study_design_scores_gemma":[0.0001138852,0.0006806124,0.004718969,0.0002599337,0.000135107,0.0002053638,0.001368066,0.8773404,0.01178124,0.06557593,0.037755,0.00006555477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1882385,0.001276976,0.7619956,0.00223105,0.0001216868,0.0006504991,0.0004657136,0.003708314,0.04131165],"genre_scores_gemma":[0.6245546,0.001184636,0.3629774,0.0002504623,0.00003481879,0.0004259589,0.0006227016,0.0001757551,0.00977365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007947139,"threshold_uncertainty_score":0.02658588,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W118337989","doi":"","title":"Generalized semi-infinite optimization and its application in robotics' path planning problem","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Motion planning; Robotics; Artificial intelligence; Computer science; Mathematical optimization; Path (computing); Optimization problem; Robot; Mathematics","authors":[{"name":"Han Liu","is_ca":true},{"name":"Xiaolin Yang","is_ca":true},{"name":"Ji Zhang","is_ca":true},{"name":"Yongji Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08382174438595084,"gpt":0.3290489713069911,"spread":0.2452272269210402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210518,0.001003993,0.001692913,0.001034672,0.0007623364,0.001347477,0.001611308,0.001630849,0.002317491],"category_scores_gemma":[0.006415957,0.0006098365,0.001291205,0.001542829,0.002073762,0.001756951,0.00238568,0.002109463,0.0002123364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008836578,"about_ca_system_score_gemma":0.001302536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003497851,"about_ca_topic_score_gemma":0.002825747,"domain_scores_codex":[0.9991709,0.0004912807,0.00002997286,0.00009889814,0.0001609445,0.00004804559],"domain_scores_gemma":[0.9971985,0.002184097,0.0001729974,0.0001035685,0.0002033718,0.0001374692],"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.0000795916,0.00005839729,0.0002794682,0.0002030443,0.00005121115,0.0001134252,0.00011811,0.7203943,0.0009787725,0.2525504,0.001660463,0.02351288],"study_design_scores_gemma":[0.000006263126,0.00001967622,0.00005423823,0.00001223848,0.000005831032,0.00001710593,0.000009283158,0.9072272,0.000126756,0.09196008,0.0005533247,0.000008105567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01449997,0.0005992794,0.9785759,0.0004951764,0.00006922174,0.00002084808,0.00005031937,0.00009707325,0.00559218],"genre_scores_gemma":[0.5772372,0.001350732,0.4121307,0.0003115608,0.0001875939,0.0002869704,0.0002308849,0.0002381186,0.008026209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003497851,"threshold_uncertainty_score":0.01113337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W282001120","doi":"","title":"Statistical Issues with Labeled Sample Size Analysis for Semi-Supervised Linear Discriminant Analysis.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Linear discriminant analysis; Sample size determination; Statistical analysis; Artificial intelligence; Sample (material); Computer science; Statistics; Pattern recognition (psychology); Optimal discriminant analysis; Mathematics; Chromatography; Chemistry","authors":[{"name":"Han Liu","is_ca":true},{"name":"Di Wu","is_ca":true},{"name":"Ji Zhang","is_ca":true},{"name":"Xiaolin Yang","is_ca":false},{"name":"Xiao‐bing Yuan","is_ca":true},{"name":"Rafal Kustra","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.298741371835398,"gpt":0.4893615187071724,"spread":0.1906201468717744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.1352914,0.0014351,0.002715976,0.002099195,0.003366314,0.003931884,0.006971889,0.005274965,0.002765058],"category_scores_gemma":[0.3832131,0.001539992,0.001988981,0.002574718,0.01029629,0.007796757,0.004364126,0.008513629,0.0007453415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002278426,"about_ca_system_score_gemma":0.003808915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003489763,"about_ca_topic_score_gemma":0.005360896,"domain_scores_codex":[0.8931584,0.08396497,0.005300454,0.006925073,0.01007091,0.0005801676],"domain_scores_gemma":[0.4810307,0.4669878,0.00739042,0.03128948,0.01206013,0.001241472],"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.001253539,0.0004515785,0.01042397,0.002455273,0.001854235,0.0006918999,0.002323256,0.0887522,0.007362297,0.3133894,0.04219621,0.5288461],"study_design_scores_gemma":[0.0002517971,0.0002405407,0.002954792,0.0002015638,0.0002705788,0.0003803214,0.0003062979,0.4110564,0.005689572,0.56795,0.01059311,0.0001050626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003394515,0.001725829,0.9914984,0.001756957,0.0003736455,0.0002118131,0.0001277538,0.000316961,0.0005941148],"genre_scores_gemma":[0.1334301,0.0008744307,0.8581154,0.001711076,0.001898863,0.00184883,0.0005126682,0.0003659377,0.001242591],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1352914,"threshold_uncertainty_score":0.7154976,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; Artificial intelligence; Line graph","authors":[{"name":"Yu Wu","is_ca":true},{"name":"Per Austrin","is_ca":true},{"name":"Toniann Pitassi","is_ca":true},{"name":"David Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1818545937339058,"gpt":0.3737240228359098,"spread":0.191869429102004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004597373,0.00254304,0.003260809,0.001947403,0.00211516,0.007133087,0.005899872,0.003915017,0.01050683],"category_scores_gemma":[0.04149881,0.00191618,0.004220172,0.004044127,0.004291477,0.01480163,0.003570919,0.009728071,0.001513861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004186301,"about_ca_system_score_gemma":0.002428965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003605273,"about_ca_topic_score_gemma":0.003120507,"domain_scores_codex":[0.9934123,0.001894373,0.0002884182,0.001760987,0.001499636,0.001144345],"domain_scores_gemma":[0.9351272,0.05619656,0.002633583,0.003556244,0.001463857,0.001022463],"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.00123221,0.0008890684,0.005417077,0.002090233,0.0004689708,0.0005467692,0.001729934,0.4084981,0.00665605,0.4576705,0.03554016,0.07926092],"study_design_scores_gemma":[0.0001036629,0.00007010764,0.0004374772,0.00009557115,0.00007501015,0.0002698409,0.0002089966,0.2573353,0.001345963,0.7366906,0.003338052,0.00002931361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2421096,0.008616674,0.6868476,0.0180939,0.0004943081,0.000377275,0.004828931,0.002451061,0.03618066],"genre_scores_gemma":[0.7149357,0.0066467,0.2537917,0.003475225,0.001383293,0.0007479977,0.005053284,0.00139663,0.0125694],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01050683,"threshold_uncertainty_score":0.03514886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}