{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":36,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":36,"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":"66d27e29dde0","filters":{"venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"}},"results":[{"id":"W4225683910","doi":"10.24963/ijcai.2022/762","title":"A Survey of Vision-Language Pre-Trained Models","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Multimodal Machine Learning Applications","field":"Computer Science","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Transformer; Pace; Artificial intelligence; Pointer (user interface); Deep learning; Mainstream; Focus (optics); Natural language processing; Human–computer interaction; Engineering","authors":[{"name":"Yifan Du","is_ca":false},{"name":"Zikang Liu","is_ca":false},{"name":"Junyi Li","is_ca":true},{"name":"Wayne Xin Zhao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06806887872685286,"gpt":0.3226548770219884,"spread":0.2545859982951356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438612,0.0002198218,0.0002928567,0.0002797194,0.0003333049,0.0001408871,0.003792818,0.00005184806,0.0002373109],"category_scores_gemma":[0.0007432603,0.0001849174,0.0001571977,0.0008305204,0.0002065114,0.000387788,0.00152816,0.0005343712,0.00002008647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001252312,"about_ca_system_score_gemma":0.0001366588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001988351,"about_ca_topic_score_gemma":0.0000805459,"domain_scores_codex":[0.9970998,0.00006994529,0.0008302303,0.000557697,0.001189873,0.000252476],"domain_scores_gemma":[0.9973458,0.0002625229,0.0008364739,0.0004417466,0.001037119,0.00007636206],"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.0001138495,0.0004937642,0.0008779544,0.00002668179,0.00004359282,5.121116e-7,0.004407074,0.01824323,0.01855159,0.9407126,0.0001370585,0.01639207],"study_design_scores_gemma":[0.00005685314,0.0002122189,0.01801511,0.00009044784,0.000006923699,0.000007574803,0.0004266881,0.8683635,0.02715075,0.08542056,0.00004281114,0.0002065563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7610486,0.00005234881,0.1949646,0.01877477,0.001392664,0.00138333,0.0002346389,0.0002895969,0.02185937],"genre_scores_gemma":[0.9951455,0.000009845175,0.004325453,0.0001707131,0.00003273653,0.0001095392,0.000007494324,0.00001629149,0.0001824262],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8552921,"threshold_uncertainty_score":0.7540712,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4221158899","doi":"10.24963/ijcai.2022/556","title":"ARCANE: An Efficient Architecture for Exact Machine Unlearning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China; University of Guelph","keywords":"Computer science; Retraining; Artificial intelligence; Machine learning; Overhead (engineering); Preprocessor; Reuse; Data pre-processing; Engineering","authors":[{"name":"Haonan Yan","is_ca":true},{"name":"Xiaoguang Li","is_ca":false},{"name":"Ziyao Guo","is_ca":false},{"name":"Hui Li","is_ca":false},{"name":"Fenghua Li","is_ca":false},{"name":"Xiaodong Lin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07033739951453769,"gpt":0.3003064225058643,"spread":0.2299690229913266,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.001294385,0.0002988829,0.0002897514,0.0003883193,0.0007060852,0.0003325955,0.02565375,0.00007932058,0.0001723817],"category_scores_gemma":[0.008138231,0.000245547,0.0001886847,0.0006193635,0.0002651494,0.0003345131,0.0264588,0.0008670581,0.00001513668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002736858,"about_ca_system_score_gemma":0.0001234127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008201815,"about_ca_topic_score_gemma":0.00001965327,"domain_scores_codex":[0.9968253,0.00004032993,0.0006821753,0.000853357,0.001156104,0.0004427512],"domain_scores_gemma":[0.9967679,0.0002289594,0.0006718825,0.00164221,0.0005964474,0.00009253527],"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.0002390151,0.0005304329,0.0001839092,0.00005080476,0.00006402262,0.000002380763,0.001172189,0.01526736,0.01498238,0.9109908,0.003178195,0.05333852],"study_design_scores_gemma":[0.00005368085,0.0003201199,0.00008948907,0.00007241546,0.000007402453,0.00002410601,0.0004591167,0.5570666,0.07488411,0.3652062,0.00158626,0.000230565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1801572,0.00006064784,0.5924571,0.2122633,0.004142395,0.002032646,0.000364587,0.001093118,0.00742901],"genre_scores_gemma":[0.9542248,0.00001224079,0.04495566,0.0004108126,0.00008277881,0.000179619,0.0000124463,0.00002385567,0.00009780898],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7740676,"threshold_uncertainty_score":0.9999997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285604412","doi":"10.24963/ijcai.2022/545","title":"FOGS: First-Order Gradient Supervision with Learning-based Graph for Traffic Flow Forecasting","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"National Natural Science Foundation of China","keywords":"Computer science; Graph; Traffic flow (computer networking); Data mining; Deep learning; Artificial intelligence; Machine learning; Theoretical computer science","authors":[{"name":"Xuan Rao","is_ca":false},{"name":"Hao Wang","is_ca":false},{"name":"Liang Zhang","is_ca":true},{"name":"Jing Li","is_ca":false},{"name":"Shuo Shang","is_ca":false},{"name":"Peng Han","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04697044092855063,"gpt":0.2364344383597053,"spread":0.1894639974311547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004548578,0.0002552071,0.0002213153,0.0003276103,0.0005206013,0.000114706,0.0007421061,0.00005251823,0.0001358953],"category_scores_gemma":[0.0001578341,0.0002090075,0.0001614547,0.0004302156,0.0001177033,0.0001732778,0.0001496924,0.0004310252,0.000005207388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001677742,"about_ca_system_score_gemma":0.00003019305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000130111,"about_ca_topic_score_gemma":0.00004587549,"domain_scores_codex":[0.9982039,0.00001004017,0.0005041491,0.0003535102,0.0006391111,0.0002892537],"domain_scores_gemma":[0.9990584,0.00008733318,0.0001995605,0.0001266039,0.0004659909,0.00006207594],"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.0002998217,0.0002226436,0.00007984845,0.0001544981,0.00008786909,9.955357e-7,0.0009818497,0.924015,0.0006300739,0.04701802,0.002254851,0.02425446],"study_design_scores_gemma":[0.0001202925,0.0005058163,0.00004881443,0.0002489802,0.00002771336,0.00000637749,0.001193976,0.9767705,0.01409313,0.002750508,0.003990163,0.0002437348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2776992,0.00006217356,0.6852384,0.01113802,0.003718302,0.003572415,0.0001682464,0.004391463,0.01401181],"genre_scores_gemma":[0.9953892,0.00003513169,0.003825307,0.0001242283,0.000068575,0.0004171586,0.00001689358,0.0000416133,0.00008185919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7176901,"threshold_uncertainty_score":0.852308,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225368580","doi":"10.24963/ijcai.2022/122","title":"MNet: Rethinking 2D/3D Networks for Anisotropic Medical Image Segmentation","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"National Key Research and Development Program of China; Southeast University","keywords":"Computer science; Overfitting; Convolutional neural network; Representation (politics); Artificial intelligence; Pattern recognition (psychology); Segmentation; Code (set theory); Convolution (computer science); Noise (video); Embedding; Image (mathematics); Artificial neural network","authors":[{"name":"Zhangfu Dong","is_ca":false},{"name":"Yuting He","is_ca":false},{"name":"Xiaoming Qi","is_ca":false},{"name":"Yang Chen","is_ca":false},{"name":"Huazhong Shu","is_ca":false},{"name":"Jean-Louis Coatrieux","is_ca":false},{"name":"Guanyu Yang","is_ca":false},{"name":"Shuo Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06027301354964597,"gpt":0.3071543382944801,"spread":0.2468813247448341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007748161,0.0002392139,0.0002421487,0.0001611721,0.0007890835,0.0002272013,0.003138941,0.00007879839,0.000282473],"category_scores_gemma":[0.0004287926,0.0002090412,0.000173756,0.0005852371,0.0002174,0.0005233305,0.001203878,0.0006022161,0.00001758442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002438001,"about_ca_system_score_gemma":0.000109962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002102228,"about_ca_topic_score_gemma":0.00001983986,"domain_scores_codex":[0.996898,0.00003075539,0.0007808053,0.0006424093,0.001289403,0.0003586371],"domain_scores_gemma":[0.9979214,0.0002665384,0.000694094,0.0003049549,0.0007054167,0.0001076118],"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.0000784144,0.0001732352,0.00006757413,0.00001711049,0.00003063566,0.000001054841,0.0009158429,0.008095788,0.007034015,0.951304,0.0006193277,0.03166305],"study_design_scores_gemma":[0.00007845068,0.0001810478,0.00008185965,0.00009130237,0.00001079119,0.00002144917,0.0003719465,0.7018959,0.03612628,0.2599134,0.001003706,0.0002238941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0117064,0.00002433869,0.9554999,0.02664086,0.001753775,0.00104139,0.00002388376,0.0001859731,0.003123419],"genre_scores_gemma":[0.9585655,0.00006865746,0.03926365,0.001154011,0.0002705952,0.0004704996,0.00001027496,0.00002317705,0.0001735984],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9468591,"threshold_uncertainty_score":0.8524451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281563651","doi":"10.24963/ijcai.2022/295","title":"TGNN: A Joint Semi-supervised Framework for Graph-level Classification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Graph; Theoretical computer science; Leverage (statistics); Graph embedding; Semi-supervised learning; Data mining; Machine learning; Artificial intelligence","authors":[{"name":"Wei Ju","is_ca":false},{"name":"Xiao Luo","is_ca":false},{"name":"Meng Qu","is_ca":true},{"name":"Yifan Wang","is_ca":false},{"name":"Chong Chen","is_ca":false},{"name":"Minghua Deng","is_ca":false},{"name":"Xian‐Sheng Hua","is_ca":false},{"name":"Ming Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1618891638942209,"gpt":0.314095514498433,"spread":0.1522063506042121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008230558,0.0003654676,0.0003773564,0.0003868762,0.0007928049,0.0003029463,0.003645177,0.0001187545,0.0001724406],"category_scores_gemma":[0.0007761155,0.0003139251,0.0004054393,0.0008948212,0.000265754,0.0006159467,0.001160062,0.0008390983,0.00002669626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002347739,"about_ca_system_score_gemma":0.0001098251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001933213,"about_ca_topic_score_gemma":0.00000977102,"domain_scores_codex":[0.9962758,0.00003793397,0.001031196,0.0009103272,0.001257343,0.0004873632],"domain_scores_gemma":[0.9969612,0.0003042756,0.0009427083,0.0005098961,0.001154533,0.0001273452],"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.0001416957,0.000248255,0.0001010262,0.00003031277,0.00004528503,7.357532e-7,0.001007249,0.002174196,0.01266786,0.966373,0.0006541256,0.0165563],"study_design_scores_gemma":[0.00006630474,0.0002489523,0.0004425021,0.0001779913,0.00001252439,0.0000148364,0.0007734383,0.2501132,0.05547582,0.6916936,0.0006689921,0.0003118745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01956868,0.00003542902,0.9393179,0.0328446,0.003457316,0.001415755,0.0001098902,0.0002606363,0.002989813],"genre_scores_gemma":[0.951121,0.00005222349,0.04684922,0.001013368,0.0001986535,0.0004845808,0.000007916605,0.00003133394,0.000241757],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9315523,"threshold_uncertainty_score":0.9999313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4280641606","doi":"10.24963/ijcai.2022/455","title":"SELC: Self-Ensemble Label Correction Improves Learning with Noisy Labels","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Overfitting; Computer science; Artificial intelligence; Generalization; Code (set theory); Noise (video); Machine learning; Simplicity; Class (philosophy); Artificial neural network; Ensemble learning; Pattern recognition (psychology); Simple (philosophy); Deep neural networks; Mathematics; Image (mathematics)","authors":[{"name":"Yangdi Lu","is_ca":true},{"name":"Wenbo He","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04012080355832404,"gpt":0.2659571239602245,"spread":0.2258363204019005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931308,0.0002480588,0.0002284677,0.0002524885,0.0008155801,0.0003907199,0.002020798,0.00005644081,0.0001073936],"category_scores_gemma":[0.0004043165,0.0001935461,0.00008602596,0.0007091445,0.0001107547,0.0006023481,0.0008035938,0.0009127724,0.00006082332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002121462,"about_ca_system_score_gemma":0.0001375885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001409468,"about_ca_topic_score_gemma":0.00002754244,"domain_scores_codex":[0.9973847,0.00005855187,0.0005430999,0.0006398116,0.001075193,0.0002986249],"domain_scores_gemma":[0.9979628,0.0001323526,0.0007550709,0.0002952417,0.0007767741,0.00007772651],"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.0002082378,0.0005076937,0.002134554,0.00004113012,0.00008687747,0.000001956145,0.003265047,0.00282514,0.04519212,0.8782406,0.0007114002,0.06678526],"study_design_scores_gemma":[0.0001627008,0.001085144,0.002045786,0.0001996163,0.00003048082,0.00008361563,0.002230268,0.8442457,0.1171853,0.02492553,0.007288417,0.0005174971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5056158,0.00007010553,0.2870217,0.07616331,0.01038652,0.002293124,0.00004940194,0.002159916,0.1162402],"genre_scores_gemma":[0.9928484,0.00003224025,0.005175895,0.0002580916,0.00009917315,0.00009347697,0.000008150926,0.00001955865,0.001465001],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8533151,"threshold_uncertainty_score":0.7892582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3215163807","doi":"10.24963/ijcai.2022/180","title":"SimMC: Simple Masked Contrastive Learning of Skeleton Representations for Unsupervised Person Re-Identification","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"BC Research (Canada)","funders":"Nanyang Technological University","keywords":"Skeleton (computer programming); Computer science; Artificial intelligence; Discriminative model; Sequence (biology); Feature learning; Pattern recognition (psychology); Consistency (knowledge bases); Similarity (geometry); Representation (politics); Identification (biology); Deep learning; Natural language processing; Image (mathematics)","authors":[{"name":"Haocong Rao","is_ca":true},{"name":"Chunyan Miao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1077185773896893,"gpt":0.3326002944640817,"spread":0.2248817170743923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001659868,0.0001958068,0.0003050698,0.0002659519,0.000546873,0.0001734566,0.001767055,0.00005363315,0.0001314898],"category_scores_gemma":[0.001687451,0.0001777715,0.0002494529,0.0005802332,0.0001724577,0.0004104888,0.0003706756,0.0003785896,0.000007150381],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001340404,"about_ca_system_score_gemma":0.0001073554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001196749,"about_ca_topic_score_gemma":0.00001755504,"domain_scores_codex":[0.9974495,0.00008417091,0.000803027,0.0005623948,0.0008412879,0.0002596215],"domain_scores_gemma":[0.9967917,0.0005049416,0.0009710741,0.0002684129,0.001409977,0.00005393609],"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.0002683243,0.0003225008,0.001911363,0.00007158666,0.0001067356,6.050467e-7,0.006602368,0.008990317,0.1029924,0.8479318,0.0002317947,0.03057022],"study_design_scores_gemma":[0.0001807494,0.0004368144,0.004976959,0.0001292844,0.00002771393,0.000006701303,0.008589813,0.3691194,0.4695635,0.1460433,0.0006131024,0.0003127214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2747368,0.00003434821,0.6957059,0.01805371,0.002283046,0.001708799,0.0001281698,0.0002057141,0.007143528],"genre_scores_gemma":[0.9940506,0.00001922594,0.005262029,0.0001069114,0.00007595932,0.0001764393,0.00001376923,0.00001605418,0.000279078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7193137,"threshold_uncertainty_score":0.724931,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285605397","doi":"10.24963/ijcai.2022/296","title":"HashNWalk: Hash and Random Walk Based Anomaly Detection in Hyperedge Streams","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"Institute for Information and Communications Technology Promotion; Ministry of Science and ICT, South Korea; Korea Advanced Institute of Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Anomaly detection; Computer science; Hash function; Random walk; Constant (computer programming); Data stream; Anomaly (physics); Graph; Theoretical computer science; Data mining; Mathematics; Statistics","authors":[{"name":"Geon Lee","is_ca":true},{"name":"Minyoung Choe","is_ca":true},{"name":"Kijung Shin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03953152171979173,"gpt":0.2652976275254189,"spread":0.2257661058056271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006001177,0.0002124657,0.0002943258,0.0002912976,0.0003247825,0.000131921,0.0006645803,0.00003383154,0.0007453682],"category_scores_gemma":[0.0000619089,0.0001860677,0.0001667613,0.0004258922,0.0001603567,0.0001562032,0.0004123043,0.000436586,0.000006164345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000125873,"about_ca_system_score_gemma":0.00004527215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006699635,"about_ca_topic_score_gemma":0.0001726535,"domain_scores_codex":[0.9982013,0.00003297957,0.0006048044,0.0004095713,0.0005036268,0.0002477336],"domain_scores_gemma":[0.9989831,0.0001019731,0.0004144883,0.0001502334,0.0002981681,0.00005199966],"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.001819038,0.001609646,0.05973791,0.00006270224,0.0002236546,0.000002165919,0.001766151,0.005099672,0.06422441,0.5574586,0.0003620138,0.307634],"study_design_scores_gemma":[0.0003665304,0.0003455979,0.004943741,0.0002085784,0.0000560497,0.000004494056,0.002178409,0.4203719,0.3875403,0.1825629,0.0009600883,0.0004613166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9786286,0.00001414069,0.007041382,0.003500147,0.0004217232,0.0005469521,0.00004347233,0.00006263133,0.009740941],"genre_scores_gemma":[0.999175,0.000004943229,0.0003380307,0.000102579,0.0001122339,0.0001457581,0.000007186738,0.00001622005,0.00009801125],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4152723,"threshold_uncertainty_score":0.8161259,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285606778","doi":"10.24963/ijcai.2022/465","title":"Escaping Feature Twist: A Variational Graph Auto-Encoder for Node Clustering","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Autoencoder; Flattening; Theoretical computer science; Computer science; Topology (electrical circuits); Graph; Feature (linguistics); Algorithm; Twist; Artificial intelligence; Mathematics; Geometry; Deep learning; Combinatorics; Engineering","authors":[{"name":"Nairouz Mrabah","is_ca":true},{"name":"Mohamed Bouguessa","is_ca":true},{"name":"Riadh Ksantini","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05926104120348049,"gpt":0.2824810265796182,"spread":0.2232199853761377,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007169173,0.0003192411,0.0003063172,0.0003362626,0.0008014731,0.000321847,0.003163429,0.00008501043,0.00010784],"category_scores_gemma":[0.0003859466,0.0002784836,0.0003215413,0.0007680563,0.0001667066,0.0006675531,0.001407963,0.0006834973,0.00001040183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000227051,"about_ca_system_score_gemma":0.0001045235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001835744,"about_ca_topic_score_gemma":0.00001709095,"domain_scores_codex":[0.9969329,0.00002867453,0.000694854,0.0007677963,0.001135739,0.0004400589],"domain_scores_gemma":[0.9977078,0.0002456986,0.0007396684,0.000319227,0.0008947902,0.00009282678],"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.0001648393,0.0001708449,0.0001113097,0.00003591537,0.00006161464,0.000001287913,0.001215538,0.03954418,0.007597846,0.9411551,0.0009171348,0.00902443],"study_design_scores_gemma":[0.00008079018,0.0001375168,0.0002372896,0.0001328989,0.00001100697,0.0000280112,0.0003276508,0.6578476,0.01144686,0.3280919,0.001378215,0.0002803392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004161147,0.00003610555,0.9584076,0.02867313,0.003408341,0.0009032183,0.00006852354,0.000215237,0.00412672],"genre_scores_gemma":[0.9508177,0.00002275636,0.047003,0.001150814,0.0002423594,0.0002995488,0.000007329377,0.00002772415,0.0004287343],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9466566,"threshold_uncertainty_score":0.9999667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4281553483","doi":"10.24963/ijcai.2022/484","title":"Approximate Exploitability: Learning a Best Response","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","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":"Adversarial system; Computer science; Reinforcement learning; Scalability; Robustness (evolution); Artificial intelligence; Machine learning; Variety (cybernetics); Computation; Deep neural networks; Artificial neural network; Theoretical computer science; Algorithm","authors":[{"name":"Finbarr Timbers","is_ca":true},{"name":"Nolan Bard","is_ca":true},{"name":"Edward Lockhart","is_ca":true},{"name":"Marc Lanctot","is_ca":true},{"name":"Martin Schmid","is_ca":true},{"name":"Neil Burch","is_ca":true},{"name":"Julian Schrittwieser","is_ca":true},{"name":"Thomas Hubert","is_ca":true},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08809639599173266,"gpt":0.2973602486952115,"spread":0.2092638527034789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002789881,0.0004025043,0.0004234739,0.0004554369,0.001081287,0.0005190195,0.00536157,0.0000935223,0.0006589162],"category_scores_gemma":[0.002362454,0.0003497649,0.0003387607,0.00107293,0.0004934043,0.0008332912,0.002895761,0.001165012,0.0002080748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000437118,"about_ca_system_score_gemma":0.0002246251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001000764,"about_ca_topic_score_gemma":0.00001530121,"domain_scores_codex":[0.9950964,0.0001609882,0.001271506,0.0009944926,0.001897285,0.0005793254],"domain_scores_gemma":[0.9966922,0.0004440254,0.0009454505,0.0005990957,0.001171153,0.0001480913],"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.0007377137,0.0007059451,0.0007355756,0.00003032374,0.00005684322,0.000005430215,0.006125017,0.005940164,0.03582571,0.921765,0.0002178166,0.02785442],"study_design_scores_gemma":[0.00005973458,0.0009463301,0.0002323905,0.0002710725,0.0000189351,0.00005418564,0.01104608,0.2818469,0.4018309,0.2976894,0.005342788,0.0006613152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7861026,0.00006615539,0.1085731,0.06501894,0.005460396,0.002688464,0.00006224321,0.0008319143,0.03119626],"genre_scores_gemma":[0.9944797,0.00002828804,0.003545207,0.0003784286,0.0001172698,0.0003961323,0.000001763487,0.00003268664,0.00102058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6240757,"threshold_uncertainty_score":0.9998955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285600734","doi":"10.24963/ijcai.2022/478","title":"CCLF: A Contrastive-Curiosity-Driven Learning Framework for Sample-Efficient Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","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":"BC Research (Canada)","funders":"Nanyang Technological University; National Research Foundation Singapore; National Research Foundation","keywords":"Computer science; Reinforcement learning; Curiosity; Artificial intelligence; Encoder; Exploit; Sample (material); Machine learning; Code (set theory); Encoding (memory); Representation (politics)","authors":[{"name":"Chenyu Sun","is_ca":false},{"name":"Hangwei Qian","is_ca":true},{"name":"Chunyan Miao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06430454282604245,"gpt":0.2937313023092388,"spread":0.2294267594831964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001251875,0.0003715901,0.0004026537,0.0003437517,0.001419109,0.0004802821,0.003123904,0.00009863816,0.0003242398],"category_scores_gemma":[0.00382232,0.0003351152,0.0003299236,0.0006086847,0.0002314833,0.0003124301,0.001788158,0.001414028,0.0000368409],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004472782,"about_ca_system_score_gemma":0.0001631855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004863316,"about_ca_topic_score_gemma":0.000001979891,"domain_scores_codex":[0.9959245,0.0000632169,0.001049661,0.0007488555,0.001628684,0.0005851319],"domain_scores_gemma":[0.99624,0.0008829917,0.001294205,0.0003014569,0.001154,0.000127385],"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.00008984858,0.00007589168,0.0002860164,0.00002153708,0.00004622113,4.413612e-7,0.001702382,0.4939584,0.0008564221,0.5012636,0.0000322992,0.001666921],"study_design_scores_gemma":[0.0001115837,0.0007307802,0.0001315525,0.0002704457,0.00002128785,0.000008293553,0.001675023,0.9336187,0.01537294,0.04546282,0.002245376,0.0003512482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008247299,0.000008993653,0.9794016,0.006298661,0.001607997,0.0009196901,0.000009448588,0.0001949413,0.003311334],"genre_scores_gemma":[0.9763002,0.0000241019,0.0223253,0.0003808046,0.0001466768,0.0002352311,0.000009193174,0.00003064173,0.000547786],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.968053,"threshold_uncertainty_score":0.9999101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229029442","doi":"10.24963/ijcai.2022/168","title":"TopoSeg: Topology-aware Segmentation for Point Clouds","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Topological and Geometric Data Analysis","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":"University of Waterloo","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Point cloud; Segmentation; Topology (electrical circuits); Computer science; Correctness; Network topology; Persistent homology; Robustness (evolution); Scale-space segmentation; Computational topology; Artificial intelligence; Image segmentation; Algorithm; Mathematics; Computer network","authors":[{"name":"Weiquan Liu","is_ca":false},{"name":"Hanyun Guo","is_ca":false},{"name":"Weini Zhang","is_ca":false},{"name":"Yu Zang","is_ca":false},{"name":"Cheng Wang","is_ca":false},{"name":"Jonathan Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07334618563402434,"gpt":0.2990297860908401,"spread":0.2256836004568158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000808202,0.0002059811,0.0002742545,0.0003292787,0.000561934,0.0002064327,0.002833805,0.00005893351,0.0006794274],"category_scores_gemma":[0.0004807932,0.0001569258,0.0002723225,0.0008793839,0.0001839115,0.0003968448,0.001259293,0.0003155053,0.00003288051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001825793,"about_ca_system_score_gemma":0.00006955564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009427528,"about_ca_topic_score_gemma":0.00001687097,"domain_scores_codex":[0.9976122,0.00002748428,0.0006779735,0.000580673,0.0007997018,0.0003019017],"domain_scores_gemma":[0.9982437,0.0001826062,0.0005466101,0.0002729896,0.0006784422,0.00007568124],"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.00008346382,0.0002536083,0.0001726562,0.00001331927,0.00005810513,7.530713e-7,0.000497654,0.00056025,0.003266594,0.9753995,0.001164173,0.01852995],"study_design_scores_gemma":[0.0001208357,0.0007082158,0.0003773218,0.00004510332,0.00003698304,0.0000238793,0.002585505,0.1125052,0.135447,0.7440127,0.003760912,0.0003763328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08797341,0.00005633471,0.721185,0.168965,0.005999339,0.001840756,0.0004351818,0.0003459392,0.01319906],"genre_scores_gemma":[0.9930152,0.00002389491,0.005168408,0.0008818508,0.0001137897,0.0001733217,0.00001491482,0.000008435335,0.0006001637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9050418,"threshold_uncertainty_score":0.7439254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285600461","doi":"10.24963/ijcai.2022/548","title":"Private Stochastic Convex Optimization and Sparse Learning with Heavy-tailed Data Revisited","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"King Abdullah University of Science and Technology","keywords":"Bounded function; Lipschitz continuity; Convex optimization; Mathematics; Mathematical optimization; Regular polygon; Constraint (computer-aided design); Moment (physics); Upper and lower bounds; Curse of dimensionality; Estimator; Monotonic function; Optimization problem; Convex function; Applied mathematics; Mathematical analysis; Statistics; Physics","authors":[{"name":"Youming Tao","is_ca":false},{"name":"Yulian Wu","is_ca":true},{"name":"Xiuzhen Cheng","is_ca":false},{"name":"Di Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07149497516497867,"gpt":0.2739307753526263,"spread":0.2024358001876476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164566,0.0002536834,0.0002832463,0.0003132776,0.0005308171,0.0003464051,0.002806806,0.00004836078,0.0001652675],"category_scores_gemma":[0.0007126734,0.0002053252,0.00004754514,0.000704211,0.0002498705,0.0006935131,0.002276238,0.0005069258,0.000006528617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000121287,"about_ca_system_score_gemma":0.00008575557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000196139,"about_ca_topic_score_gemma":0.000002293659,"domain_scores_codex":[0.9973454,0.00004047478,0.0006166273,0.000757003,0.0009784169,0.000262065],"domain_scores_gemma":[0.9978574,0.0001330767,0.0007415513,0.0004563304,0.0007242629,0.00008741282],"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.0001706949,0.0001547895,0.0002946992,0.00002659455,0.00004985031,0.000001410896,0.0008943466,0.1962124,0.0006046304,0.7988927,0.00009473519,0.002603115],"study_design_scores_gemma":[0.00008031698,0.0003419294,0.0000650617,0.0002321478,0.00001921177,0.00004070611,0.0003919215,0.9717849,0.005612534,0.02109015,0.00009443514,0.0002467005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005862041,0.00001733815,0.9866982,0.005037285,0.000328059,0.0006495667,0.00002654416,0.0002209684,0.001160061],"genre_scores_gemma":[0.9562334,0.00003209174,0.043262,0.0002147712,0.0000409948,0.00007720804,0.00002062671,0.0000210896,0.00009780455],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9503714,"threshold_uncertainty_score":0.8372918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285606202","doi":"10.24963/ijcai.2022/811","title":"Ethics and Governance of Artificial Intelligence: A Survey of Machine Learning Researchers (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Ethics and Social Impacts of AI","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Institute on Governance","funders":"University of Oxford; Open Philanthropy Project; Georgetown University; Canadian Institute for Advanced Research","keywords":"Relevance (law); Corporate governance; Artificial intelligence; Work (physics); Political science; Public relations; Public sector; Private sector; Computer science; Engineering; Management; Law; Economics","authors":[{"name":"Baobao Zhang","is_ca":true},{"name":"Markus Anderljung","is_ca":true},{"name":"Lauren Kahn","is_ca":false},{"name":"Noemi Dreksler","is_ca":true},{"name":"Michael C. Horowitz","is_ca":false},{"name":"Allan Dafoe","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2634526621512286,"gpt":0.41029010875163,"spread":0.1468374466004014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.01110883,0.0002260675,0.000439977,0.0002026776,0.001245247,0.0001799666,0.001550862,0.0002148021,0.0007351761],"category_scores_gemma":[0.02207312,0.0002068199,0.0001763592,0.0007940421,0.002016574,0.0003674703,0.0006768326,0.002429262,0.000006063491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002317712,"about_ca_system_score_gemma":0.0007280247,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01897662,"about_ca_topic_score_gemma":0.005576087,"domain_scores_codex":[0.9951543,0.0003205549,0.00114294,0.0004389246,0.002532186,0.0004111553],"domain_scores_gemma":[0.9931941,0.00164183,0.001402049,0.0001664681,0.003445642,0.0001499249],"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.0004924646,0.0003677036,0.001817077,0.00007910432,0.00007467921,9.177916e-7,0.03154921,0.0004256354,0.004904335,0.9435599,0.00004289865,0.01668604],"study_design_scores_gemma":[0.00009940377,0.001064147,0.02079252,0.0008011992,0.00005230007,0.000004567552,0.07063801,0.01757922,0.1103986,0.7765636,0.001295868,0.0007105704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8867783,0.0002625291,0.0005846254,0.06315984,0.001824499,0.001221587,0.000497505,0.00008576691,0.04558537],"genre_scores_gemma":[0.9980321,0.001101104,0.0002480062,0.0001413266,0.00008492994,0.00001982335,0.000006083142,0.00002089857,0.0003457554],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1669963,"threshold_uncertainty_score":0.9998721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285601419","doi":"10.24963/ijcai.2022/738","title":"Homeomorphic-Invariance of EM: Non-Asymptotic Convergence in KL Divergence for Exponential Families via Mirror Descent (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Institute for Advanced Research; University of British Columbia","funders":"","keywords":"Bregman divergence; Divergence (linguistics); Kullback–Leibler divergence; Applied mathematics; Mathematics; Exponential family; Gradient descent; Gaussian; Convergence (economics); Invariant (physics); Exponential function; Probabilistic logic; Parametrization (atmospheric modeling); Expectation–maximization algorithm; Mathematical optimization; Computer science; Mathematical analysis; Artificial neural network; Artificial intelligence; Physics; Statistics; Maximum likelihood","authors":[{"name":"Frederik Künstner","is_ca":true},{"name":"Raunak Kumar","is_ca":false},{"name":"Mark Schmidt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06029236595116157,"gpt":0.2829675120279982,"spread":0.2226751460768367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001371909,0.0003352951,0.0005412344,0.0005204214,0.0002981517,0.000122412,0.003307719,0.00009507684,0.0002318754],"category_scores_gemma":[0.0003255214,0.0002985718,0.0003589771,0.001075079,0.0002685801,0.0004721467,0.001032056,0.0004816988,0.00000871383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001889295,"about_ca_system_score_gemma":0.0001812085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000300499,"about_ca_topic_score_gemma":0.000128374,"domain_scores_codex":[0.99638,0.00004099526,0.00123041,0.0008024734,0.001094494,0.0004516105],"domain_scores_gemma":[0.9973931,0.0002020288,0.0009914219,0.0003934243,0.0009160064,0.0001039839],"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.0004654154,0.0008653856,0.001267119,0.0001721063,0.000168096,0.000003922851,0.004866882,0.001239146,0.0818725,0.8920283,0.00008321132,0.01696794],"study_design_scores_gemma":[0.0002282258,0.0004465786,0.0119664,0.0003234496,0.00006343002,0.000014561,0.000969956,0.333966,0.3465595,0.3048327,0.00008970201,0.0005395171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1602877,0.00002904244,0.8333516,0.002216195,0.002296193,0.0009441171,0.00007860959,0.0000451362,0.0007513872],"genre_scores_gemma":[0.9579263,0.00008281176,0.04142587,0.0001890548,0.00004492021,0.000211265,0.0000041975,0.00001688679,0.00009871841],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7976385,"threshold_uncertainty_score":0.9999467,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285602129","doi":"10.24963/ijcai.2022/17","title":"Distortion in Voting with Top-t Preferences","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Social choice theory; Voting; Distortion (music); Ranking (information retrieval); Computer science; Mathematical economics; Social Welfare; Proxy (statistics); Set (abstract data type); Rank (graph theory); Econometrics; Mathematical optimization; Mathematics; Artificial intelligence; Machine learning; Combinatorics","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Daniel Halpern","is_ca":false},{"name":"Mohamad Latifian","is_ca":true},{"name":"Nisarg Shah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08510738125904387,"gpt":0.2508698555706798,"spread":0.1657624743116359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001233845,0.0001699732,0.0002982176,0.0002918307,0.0002461613,0.0001038623,0.00087759,0.00004432624,0.0006674224],"category_scores_gemma":[0.0002998386,0.000145917,0.00009598371,0.0003968955,0.0001413349,0.0002267971,0.0002392773,0.0004091088,0.00006484347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002219872,"about_ca_system_score_gemma":0.0000288928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002810089,"about_ca_topic_score_gemma":0.00008401094,"domain_scores_codex":[0.9982237,0.00001707346,0.0008746518,0.0004263392,0.0002265771,0.0002317178],"domain_scores_gemma":[0.9987286,0.00006091689,0.0008863145,0.0001293526,0.0001558399,0.00003896558],"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.0001557214,0.0001821992,0.04531852,0.00002790823,0.00002275791,6.346565e-7,0.001745003,0.001466786,0.000281844,0.9495708,0.00002373551,0.001204067],"study_design_scores_gemma":[0.000254733,0.0008320666,0.02473244,0.0007005614,0.00001316788,0.00003190622,0.008843597,0.0351612,0.03040201,0.8964431,0.001822292,0.0007628902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9552822,0.00003731286,0.001035751,0.002752554,0.0009665681,0.0003439226,0.00005292858,0.00003815702,0.03949063],"genre_scores_gemma":[0.99908,0.000009461294,0.0001224302,0.00009441961,0.00007826509,0.00008726888,0.000003051771,0.00001477721,0.000510332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05312769,"threshold_uncertainty_score":0.7307807,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285605323","doi":"10.24963/ijcai.2022/685","title":"Threshold Designer Adaptation: Improved Adaptation for Designers in Co-creative Systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Data Visualization and Analytics","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association; Alberta Machine Intelligence Institute","keywords":"Adaptation (eye); Computer science; Quality (philosophy); Human–computer interaction; Psychology","authors":[{"name":"Emily Halina","is_ca":true},{"name":"Matthew Guzdial","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1320557850142639,"gpt":0.3260284103045427,"spread":0.1939726252902788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118379,0.000221592,0.0002618661,0.0003877274,0.0003567881,0.0003697007,0.001854227,0.00005619201,0.00009614734],"category_scores_gemma":[0.0004011339,0.0001918825,0.0001290934,0.0006799061,0.000126425,0.0006450772,0.0003300938,0.0002631533,0.00001115347],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000283456,"about_ca_system_score_gemma":0.0001983543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001301037,"about_ca_topic_score_gemma":0.00003373322,"domain_scores_codex":[0.9975212,0.00004014661,0.0008203923,0.0005243299,0.0008250157,0.0002689624],"domain_scores_gemma":[0.9979904,0.0001441305,0.0006644745,0.0002202211,0.0009142624,0.00006647425],"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.0001439126,0.000222917,0.00008596377,0.00002750379,0.00002927787,6.327763e-7,0.003692292,0.05714385,0.002726278,0.9310064,0.0003824568,0.004538567],"study_design_scores_gemma":[0.0001110893,0.0002339994,0.00005116276,0.000105269,0.000009501875,0.000004809811,0.006844384,0.9449387,0.01278804,0.034315,0.0003885066,0.0002095154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002774278,0.00001963288,0.9821184,0.00407121,0.001224599,0.001208916,0.00007907655,0.00009144878,0.008412403],"genre_scores_gemma":[0.993071,0.00002222146,0.005763755,0.0002912285,0.00006864932,0.0003007422,0.00002235628,0.0000163328,0.0004437468],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9902967,"threshold_uncertainty_score":0.782474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285604884","doi":"10.24963/ijcai.2022/389","title":"One Weird Trick to Improve Your Semi-Weakly Supervised Semantic Segmentation Model","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Western Canada Research Grid; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Segmentation; Classifier (UML); Artificial intelligence; Hyperparameter; Pattern recognition (psychology); Pixel; Image segmentation; Machine learning","authors":[{"name":"Wonho Bae","is_ca":true},{"name":"Junhyug Noh","is_ca":false},{"name":"Milad Jalali Asadabadi","is_ca":true},{"name":"Danica J. Sutherland","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.090667810114998,"gpt":0.3025308155715213,"spread":0.2118630054565233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000501606,0.0002874269,0.0002972458,0.0003233354,0.0005894069,0.000251463,0.003276229,0.00005533317,0.0001282614],"category_scores_gemma":[0.0002046634,0.0002732318,0.0001785381,0.0009500072,0.0001081101,0.0006035674,0.001619534,0.0005158938,0.0001160266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003487234,"about_ca_system_score_gemma":0.0001201344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004018609,"about_ca_topic_score_gemma":0.00001372632,"domain_scores_codex":[0.9966063,0.00002552993,0.0008549038,0.0008216781,0.001290909,0.000400643],"domain_scores_gemma":[0.9979351,0.0001018239,0.0005617261,0.0004361953,0.0008170667,0.0001481137],"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.0001149041,0.0003864575,0.00005109708,0.00002208739,0.00003713773,3.743111e-7,0.001769593,0.05661092,0.238141,0.6755478,0.0003451732,0.0269734],"study_design_scores_gemma":[0.00005659283,0.000185632,0.00008850235,0.00005848747,0.0000127342,0.00000601797,0.0005021407,0.6279014,0.210611,0.1601418,0.0001754122,0.0002603649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1295899,0.00001730045,0.8105054,0.04981745,0.001823376,0.00198916,0.00008509158,0.0003178777,0.005854378],"genre_scores_gemma":[0.9716387,0.00002807277,0.0258781,0.001216837,0.0001464801,0.0004483547,0.000005503791,0.00002600208,0.0006119803],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8420487,"threshold_uncertainty_score":0.999972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285605296","doi":"10.24963/ijcai.2022/65","title":"Exploring the Benefits of Teams in Multiagent Learning","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Incentive; Multi-agent system; Computer science; Knowledge management; Reinforcement learning; Population; Social learning; Artificial intelligence; Management science; Engineering; Sociology; Microeconomics","authors":[{"name":"David Radke","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Tim Brecht","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.2138455794608266,"gpt":0.3363991438027922,"spread":0.1225535643419657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012055,0.0001437806,0.0002146552,0.0001624731,0.0007786689,0.00007126462,0.001222366,0.00002669064,0.0002901183],"category_scores_gemma":[0.0006221273,0.0001125924,0.0001320137,0.0003570977,0.0004810227,0.0002787067,0.0007139215,0.0004752586,0.00001468359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004195384,"about_ca_system_score_gemma":0.00007799457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003007679,"about_ca_topic_score_gemma":0.0009453815,"domain_scores_codex":[0.9980742,0.00004900178,0.0006234279,0.0002820163,0.0007199398,0.000251428],"domain_scores_gemma":[0.9987912,0.0001401719,0.0006145791,0.0001006208,0.0003149247,0.00003852336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","study_design_scores_codex":[0.0001180722,0.0003105635,0.01370393,0.00001056726,0.00002872787,3.686958e-7,0.05491131,0.006313863,0.007158435,0.9041666,0.00002950952,0.01324802],"study_design_scores_gemma":[0.0001807637,0.0005033967,0.01924732,0.000563819,0.00003558382,0.000004088186,0.4721237,0.008036233,0.4487836,0.04708151,0.002794012,0.0006460294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9702889,0.00003420911,0.000008970947,0.006989894,0.001008557,0.0003897165,0.00001183085,0.00002427516,0.0212437],"genre_scores_gemma":[0.9990407,0.0002572643,0.00008540999,0.00007094577,0.00007770481,0.0001900674,8.517495e-7,0.00001152168,0.0002655201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8570851,"threshold_uncertainty_score":0.598897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285606246","doi":"10.24963/ijcai.2022/698","title":"Deciphering Environmental Air Pollution with Large Scale City Data","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Air Quality Monitoring and Forecasting","field":"Environmental Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Air pollution; Casual; Scale (ratio); Natural (archaeology); Geography","authors":[{"name":"Mayukh Bhattacharyya","is_ca":false},{"name":"Sayan Nag","is_ca":true},{"name":"Udita Uday Ghosh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08496294791075351,"gpt":0.2787579445544969,"spread":0.1937949966437434,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009063198,0.0002037476,0.0001776587,0.0000583607,0.0007296106,0.00006448894,0.00175734,0.00004207527,0.002151347],"category_scores_gemma":[0.000121039,0.0001628451,0.00007237535,0.0002487059,0.0003329319,0.0004103007,0.002441691,0.0004431347,0.00007618441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004046552,"about_ca_system_score_gemma":0.00002057271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001721162,"about_ca_topic_score_gemma":0.00007041015,"domain_scores_codex":[0.9974546,0.00002381164,0.0004677134,0.0005727102,0.001163382,0.0003178145],"domain_scores_gemma":[0.9991102,0.00003877513,0.0004169679,0.0003218074,0.0000333524,0.00007887072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003580503,0.006924749,0.3833688,0.0001507413,0.0004729571,0.0000196225,0.03027485,0.1280022,0.1553214,0.1521239,0.005124922,0.1346354],"study_design_scores_gemma":[0.000554459,0.001528298,0.110705,0.0007394729,0.0001461448,0.0001856664,0.04149618,0.4496984,0.3219633,0.04763918,0.02324893,0.002094974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811683,0.000005760273,0.003256709,0.004559177,0.0006545362,0.0003156598,0.000204768,0.00006411344,0.009770922],"genre_scores_gemma":[0.997901,0.000009561635,0.001278786,0.000227493,0.0001100705,0.00003242284,0.00001507521,0.00001814368,0.000407484],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3216962,"threshold_uncertainty_score":0.9987608,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4225375697","doi":"10.24963/ijcai.2022/691","title":"Music-to-Dance Generation with Optimal Transport","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Music and Audio Processing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dance; Choreography; Computer science; Electronic dance music; Rhythm; Artificial intelligence; Visual arts; Aesthetics; Art","authors":[{"name":"Shuang Wu","is_ca":false},{"name":"Shijian Lu","is_ca":false},{"name":"Li Cheng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08363649097721516,"gpt":0.2648976207822843,"spread":0.1812611298050691,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656482,0.0002429405,0.0002350748,0.0002188231,0.0006023506,0.0002322786,0.002382261,0.00003960853,0.0003143988],"category_scores_gemma":[0.00008183983,0.000187153,0.0001098111,0.0007152322,0.0001407865,0.0005512949,0.0005191622,0.0004017744,0.00003274027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001489245,"about_ca_system_score_gemma":0.000162116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004011741,"about_ca_topic_score_gemma":0.00002445984,"domain_scores_codex":[0.997261,0.00001562438,0.0005685606,0.0006395283,0.001208674,0.0003065465],"domain_scores_gemma":[0.9984714,0.00003061662,0.0004417571,0.0002568127,0.0006993336,0.0001000239],"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.000167756,0.000301464,0.0003268906,0.00002947363,0.00004482012,0.000005390385,0.005166424,0.02075223,0.0402744,0.9062021,0.0008574582,0.02587153],"study_design_scores_gemma":[0.0001523558,0.0008638946,0.001006996,0.0003910287,0.00002817597,0.0001164571,0.001661442,0.3679352,0.5922875,0.03001941,0.004715446,0.0008220741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4350744,0.00001693343,0.5045496,0.03724942,0.002025813,0.000768777,0.00002949281,0.0001958519,0.02008968],"genre_scores_gemma":[0.9830011,0.000006064182,0.01452674,0.001727716,0.0001863863,0.0001156003,0.000002764293,0.00001632926,0.0004173577],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8761827,"threshold_uncertainty_score":0.7631876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4224255863","doi":"10.24963/ijcai.2022/177","title":"Continual Semantic Segmentation Leveraging Image-level Labels and Rehearsal","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Forgetting; Computer science; Leverage (statistics); Pascal (unit); Artificial intelligence; Segmentation; Machine learning; Deep learning; Deep neural networks","authors":[{"name":"Mathieu Pagé Fortin","is_ca":true},{"name":"Brahim Chaib-draa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08905293292888322,"gpt":0.288522880963504,"spread":0.1994699480346208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009098354,0.0002031171,0.0002137298,0.0002439481,0.0005729305,0.0004438072,0.001283309,0.00003825089,0.0002456591],"category_scores_gemma":[0.0003395188,0.0001819999,0.00009576826,0.0003988038,0.0001916619,0.0006403768,0.0009321505,0.0004616553,0.00003454704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001314357,"about_ca_system_score_gemma":0.00007895942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006631703,"about_ca_topic_score_gemma":0.000008487544,"domain_scores_codex":[0.9976324,0.00004520269,0.0005938117,0.0005047684,0.0009583017,0.0002654996],"domain_scores_gemma":[0.998565,0.0001239104,0.0005097185,0.0001689316,0.0005538849,0.00007856194],"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.00008640192,0.0001697249,0.0006169988,0.00003130009,0.00004866362,0.000003263058,0.00718623,0.0006210442,0.0611656,0.8902091,0.0003201028,0.03954157],"study_design_scores_gemma":[0.0003768955,0.000509811,0.006210398,0.0003670714,0.00003448646,0.0001378251,0.01397007,0.5532087,0.2263071,0.19583,0.002228853,0.0008187636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5560878,0.00006082879,0.3612452,0.05250603,0.003754897,0.001267171,0.00005860779,0.0003716729,0.02464786],"genre_scores_gemma":[0.9873959,0.00002484206,0.01124364,0.000591423,0.00006337838,0.00004501703,0.000002947764,0.000013991,0.0006188295],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6943791,"threshold_uncertainty_score":0.742174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285601870","doi":"10.24963/ijcai.2022/731","title":"Improving Inductive Link Prediction Using Hyper-Relational Facts (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Bundesministerium für Bildung und Forschung","keywords":"Computer science; Statistical relational learning; Inference; Inductive logic programming; Link (geometry); Metric (unit); Inductive bias; Task (project management); Set (abstract data type); Inductive reasoning; Artificial intelligence; Relational database; Machine learning; Graph; Code (set theory); Training set; Theoretical computer science; Multi-task learning; Information retrieval; Programming language","authors":[{"name":"Mehdi Ali","is_ca":false},{"name":"Max Berrendorf","is_ca":false},{"name":"Mikhail Galkin","is_ca":true},{"name":"Veronika Thost","is_ca":false},{"name":"Tengfei Ma","is_ca":false},{"name":"Volker Tresp","is_ca":false},{"name":"Jens Lehmann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09351631533544383,"gpt":0.2831491543966582,"spread":0.1896328390612143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005759285,0.0003001736,0.000260651,0.0003484717,0.0007863108,0.0002162019,0.002084774,0.00009707257,0.000178859],"category_scores_gemma":[0.0003888612,0.0002649591,0.000206973,0.0007350626,0.0002326921,0.001188568,0.001260291,0.001018372,0.00001820142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003937126,"about_ca_system_score_gemma":0.0001578547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008153079,"about_ca_topic_score_gemma":0.000008727624,"domain_scores_codex":[0.9966159,0.00002706471,0.0008637292,0.0007332737,0.001382017,0.0003779528],"domain_scores_gemma":[0.9975398,0.0001395778,0.0009974879,0.0002857828,0.0009353003,0.0001020932],"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.0001305367,0.0002410283,0.0004864713,0.00001825518,0.00005621496,0.000002283871,0.001124815,0.03121226,0.05788626,0.8580759,0.00006265003,0.0507034],"study_design_scores_gemma":[0.00008895725,0.0002307764,0.003089989,0.0001477691,0.00001769322,0.00005381423,0.0007006322,0.6711453,0.08130223,0.2425056,0.0003530707,0.0003641867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6145471,0.00005134047,0.3445906,0.01915834,0.009397382,0.001699709,0.0001514682,0.0005246701,0.009879447],"genre_scores_gemma":[0.9889435,0.0000118242,0.01030918,0.0002675675,0.0002774105,0.00005705743,0.000005111072,0.00002151678,0.0001068696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.639933,"threshold_uncertainty_score":0.9999803,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4229076201","doi":"10.24963/ijcai.2022/538","title":"Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Compute Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Curriculum; Computer science; Witness; Set (abstract data type); Class (philosophy); Process (computing); Artificial intelligence; Domain (mathematical analysis); Tree (set theory); Machine learning; Human–computer interaction; Programming language; Mathematics; Psychology","authors":[{"name":"Levi H. S. Lelis","is_ca":true},{"name":"João Gabriel Gama Vila Nova","is_ca":false},{"name":"Eugene Chen","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true},{"name":"Carrie Demmans Epp","is_ca":true},{"name":"Michael Bowling","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09833545549548467,"gpt":0.3364742101218567,"spread":0.238138754626372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001483483,0.00038483,0.0003816434,0.0001764381,0.001547519,0.0006668415,0.005575395,0.00006526295,0.0002091787],"category_scores_gemma":[0.0006977349,0.0002438329,0.0002044566,0.0007077974,0.0005255439,0.0007654819,0.001361479,0.0008753677,0.00002598398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001908097,"about_ca_system_score_gemma":0.0001568271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003452322,"about_ca_topic_score_gemma":0.0002883305,"domain_scores_codex":[0.9958683,0.0001262268,0.000930643,0.0009896646,0.001638973,0.0004462424],"domain_scores_gemma":[0.996663,0.0005761159,0.0008100715,0.0005490234,0.001295308,0.0001064504],"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.0006760936,0.002108314,0.02891101,0.00001595813,0.0001888187,0.000005249344,0.02904603,0.01428005,0.002143863,0.8919258,0.0003779847,0.03032086],"study_design_scores_gemma":[0.000211476,0.005072319,0.007451442,0.0003348249,0.0001051217,0.00002966969,0.08201423,0.3786945,0.08045864,0.4419741,0.00256558,0.001088088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8899853,0.00002740257,0.08644334,0.01821699,0.00159366,0.00197298,0.00004589801,0.0002416585,0.001472768],"genre_scores_gemma":[0.9962023,0.000008896382,0.002271725,0.0005111501,0.0002634494,0.0005238403,0.000006433155,0.000032373,0.0001798411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4499517,"threshold_uncertainty_score":0.9998049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285601644","doi":"10.24963/ijcai.2022/39","title":"Efficient Resource Allocation with Secretive Agents","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Distortion (music); Preference; Welfare; Social Welfare; Homogeneous; Function (biology); Resource allocation; Mathematical economics; Microeconomics; Social welfare function; Resource (disambiguation); Nash equilibrium; Economics; Computer science; Mathematics; Combinatorics; Political science; Computer network","authors":[{"name":"Soroush Ebadian","is_ca":true},{"name":"Rupert Freeman","is_ca":false},{"name":"Nisarg Shah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08116218144506153,"gpt":0.2521003363069624,"spread":0.1709381548619009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001281589,0.000192168,0.0002832238,0.0002443435,0.0004067958,0.0001092985,0.00100679,0.00004647554,0.0009787054],"category_scores_gemma":[0.0002884183,0.0001664514,0.0001276132,0.0003794264,0.0001946396,0.00008004055,0.0003159043,0.0003763192,0.0001638518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002407477,"about_ca_system_score_gemma":0.00003047434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009567949,"about_ca_topic_score_gemma":0.000006217212,"domain_scores_codex":[0.9981856,0.00002049106,0.0007739535,0.0004747642,0.0003062247,0.0002390089],"domain_scores_gemma":[0.9984198,0.00006486412,0.0009976908,0.0001925195,0.0002676451,0.00005750262],"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.0002322975,0.0002287319,0.001355809,0.00002649187,0.00005719374,6.250693e-7,0.002823658,0.01178102,0.0005282295,0.9824851,0.0001712348,0.0003095997],"study_design_scores_gemma":[0.0004169205,0.001429501,0.005991605,0.000842075,0.00004475601,0.00007570808,0.02196148,0.3754763,0.07482091,0.497371,0.0202219,0.001347754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8667615,0.00003287818,0.00296388,0.007921987,0.001124718,0.000672248,0.0001411235,0.0000743816,0.1203073],"genre_scores_gemma":[0.9981581,0.000004940795,0.0001389815,0.0002606247,0.0000927329,0.00008916231,0.000005707627,0.00002147969,0.001228268],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4851141,"threshold_uncertainty_score":0.9999346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285603593","doi":"10.24963/ijcai.2022/750","title":"Unbiased Gradient Estimation in Unrolled Computation Graphs with Persistent Evolution Strategies (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Ferroelectric and Negative Capacitance Devices","field":"Engineering","cited_by":2,"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":"Computation; Computer science; Variance (accounting); Algorithm; Graph; Unbiased Estimation; Sequence (biology); Theoretical computer science; Mathematics; Statistics; Biology","authors":[{"name":"Paul Vicol","is_ca":true},{"name":"Luke Metz","is_ca":false},{"name":"Jascha Sohl‐Dickstein","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03737054132645817,"gpt":0.2495246221453384,"spread":0.2121540808188802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313683,0.0002121359,0.000218637,0.0003609399,0.0002017749,0.0001056463,0.000428016,0.00004260788,0.0001087957],"category_scores_gemma":[0.00007342659,0.0001744919,0.0001128558,0.0006261112,0.0001436488,0.0003676817,0.00005378413,0.0004113777,0.000008483973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005012899,"about_ca_system_score_gemma":0.00006668879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007217968,"about_ca_topic_score_gemma":0.0001043247,"domain_scores_codex":[0.9982736,0.00001458354,0.0005310965,0.0002790019,0.0006768166,0.0002248634],"domain_scores_gemma":[0.9991395,0.00006726505,0.000275998,0.00007887754,0.000396879,0.00004151576],"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.0004143548,0.000244479,0.0003189921,0.00007809747,0.00009544698,0.000001942053,0.002616489,0.5817277,0.009161475,0.4015172,0.00007035226,0.003753454],"study_design_scores_gemma":[0.0001553912,0.0003485759,0.006151176,0.0002626101,0.00002196589,0.00001199772,0.01099246,0.8608615,0.021556,0.099361,0.00001413129,0.0002631249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.980579,0.0000424482,0.008094307,0.001031666,0.0005475859,0.0005538273,0.00002412587,0.0001148872,0.009012214],"genre_scores_gemma":[0.9993318,0.00002367373,0.0004298007,0.00003244286,0.00001799713,0.0001141981,0.00001041988,0.00001738186,0.00002233143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3021562,"threshold_uncertainty_score":0.7115572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285607048","doi":"10.24963/ijcai.2022/5","title":"How Should We Vote? A Comparison of Voting Systems within Social Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Voting; Computer science; Context (archaeology); Bullet voting; Population; Social network (sociolinguistics); Cardinal voting systems; Democracy; Ranked voting system; Political science; Sociology; World Wide Web","authors":[{"name":"Shiri Alouf-Heffetz","is_ca":false},{"name":"Ben Armstrong","is_ca":true},{"name":"Kate Larson","is_ca":true},{"name":"Nimrod Talmon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.105578830369521,"gpt":0.3195361004765339,"spread":0.2139572701070129,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572334,0.0002388982,0.0004325515,0.0001273601,0.000617809,0.0002567987,0.001120411,0.00006549291,0.0001025857],"category_scores_gemma":[0.00008589761,0.0002066034,0.0002574289,0.0003589961,0.0002717617,0.0001973715,0.000511365,0.0006941971,0.000002980754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001101737,"about_ca_system_score_gemma":0.00007740637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003252641,"about_ca_topic_score_gemma":0.00001470235,"domain_scores_codex":[0.9975956,0.00003568163,0.0008640519,0.0003511342,0.0008833079,0.000270223],"domain_scores_gemma":[0.9976314,0.0001023106,0.001353265,0.0001114244,0.0007453399,0.00005622064],"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.00007483882,0.0002693063,0.007728695,0.00003213172,0.00009003659,1.275672e-7,0.002783433,0.02114516,0.001684086,0.9633548,0.0001869513,0.002650436],"study_design_scores_gemma":[0.00009576794,0.0002019119,0.0004581066,0.0003358431,0.00004015934,0.00000161266,0.03023848,0.9025294,0.01541804,0.04947684,0.0007922483,0.0004116397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8874677,0.0001202095,0.040188,0.03653731,0.009322469,0.00190629,0.0005096673,0.0001429901,0.02380538],"genre_scores_gemma":[0.9990324,0.000003894798,0.000103735,0.00004501729,0.0003909027,0.00006860638,0.000008978515,0.00002061022,0.0003259043],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.913878,"threshold_uncertainty_score":0.8425044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285601015","doi":"10.24963/ijcai.2022/433","title":"Online Evasion Attacks on Recurrent Models:The Power of Hallucinating the Future","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kootenay Association for Science & Technology","funders":"Office of Experimental Program to Stimulate Competitive Research; Ministry of Science and ICT, South Korea; Institute for Information and Communications Technology Promotion; National Science Foundation","keywords":"Computer science; Generality; Hallucinating; Robustness (evolution); Vulnerability (computing); Adversarial system; Computer security; Machine learning; Artificial intelligence","authors":[{"name":"Byunggill Joe","is_ca":true},{"name":"Insik Shin","is_ca":true},{"name":"Jihun Hamm","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07167116162927387,"gpt":0.3026082033544833,"spread":0.2309370417252094,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595218,0.0002852065,0.0002785686,0.0001882774,0.0008744713,0.0001766063,0.004958783,0.00006627374,0.0001938684],"category_scores_gemma":[0.0006554149,0.0001671289,0.0002469606,0.0006563897,0.0002761502,0.0003737436,0.002103493,0.001331383,0.00001110886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002097153,"about_ca_system_score_gemma":0.000114386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000569789,"about_ca_topic_score_gemma":0.00002764581,"domain_scores_codex":[0.9964015,0.0001027858,0.0008429238,0.0005588143,0.001790354,0.0003035471],"domain_scores_gemma":[0.9970554,0.0003535785,0.001117908,0.0005046102,0.0009165342,0.00005192887],"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.0001433719,0.0003544224,0.00005055404,0.00001644537,0.00003977201,9.719765e-7,0.004188723,0.08095767,0.0009719567,0.884087,0.0002445393,0.0289446],"study_design_scores_gemma":[0.00007249424,0.0004333016,0.0003534948,0.0002795939,0.0000163309,0.00001746056,0.005796434,0.8247341,0.01246754,0.1544035,0.001182962,0.0002427671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4776554,0.0002382921,0.1961561,0.2805346,0.01607945,0.002576359,0.0001319586,0.0003411639,0.02628672],"genre_scores_gemma":[0.9969448,0.000043,0.001944939,0.0005939503,0.0002517364,0.00004675672,0.000002911241,0.00001902863,0.000152911],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7437764,"threshold_uncertainty_score":0.9214734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285602009","doi":"10.24963/ijcai.2022/355","title":"The Limits of Morality in Strategic Games","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Outcome (game theory); Morality; Constraint (computer-aided design); Computer science; Strategic dominance; Sacrifice; Mathematical economics; Management science; Economics; Mathematics; Epistemology; Philosophy","authors":[{"name":"Rui Cao","is_ca":true},{"name":"Pavel Naumov","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1187470422134905,"gpt":0.3039596029042101,"spread":0.1852125606907196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348851,0.0001972187,0.0002566099,0.0001697841,0.0003693053,0.0002118788,0.0035729,0.00004951712,0.000101485],"category_scores_gemma":[0.0004602357,0.0001312371,0.0001716224,0.0006388932,0.000329088,0.0002804644,0.0009523003,0.0004936241,0.00001909359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001500947,"about_ca_system_score_gemma":0.000172169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001413211,"about_ca_topic_score_gemma":0.0001227868,"domain_scores_codex":[0.9975237,0.00005237192,0.0007871802,0.0004308652,0.0009056237,0.0003003023],"domain_scores_gemma":[0.9980542,0.0002233439,0.0006678836,0.0003058481,0.0006942401,0.00005446096],"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.00006979855,0.00023875,0.0008832403,0.00001652158,0.00001996781,9.760817e-7,0.001622249,0.0004012008,0.003178945,0.9870251,0.00008749666,0.006455701],"study_design_scores_gemma":[0.00007892691,0.0003150456,0.002966712,0.0001586584,0.000007977921,0.00001533975,0.003492449,0.1008971,0.123143,0.7679569,0.000702347,0.0002655714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8170314,0.0001984205,0.003994198,0.0334878,0.003977183,0.001051739,0.00003548476,0.0001436229,0.1400802],"genre_scores_gemma":[0.9989683,0.00008118709,0.0003758703,0.0001107153,0.00005586987,0.0000607418,7.833879e-7,0.000007969677,0.0003385673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2190682,"threshold_uncertainty_score":0.6639397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285604500","doi":"10.24963/ijcai.2022/440","title":"Multi-policy Grounding and Ensemble Policy Learning for Transfer Learning with Dynamics Mismatch","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Task (project management); Quality (philosophy); Imitation; Feature (linguistics); Policy learning; Artificial intelligence; Transfer of learning; Ensemble learning; Machine learning; Algorithm; Engineering","authors":[{"name":"Hyun-Rok Lee","is_ca":true},{"name":"Ram Ananth Sreenivasan","is_ca":true},{"name":"Yeonjeong Jeong","is_ca":true},{"name":"Jongseong Jang","is_ca":false},{"name":"Dongsub Shim","is_ca":false},{"name":"Chi-Guhn Lee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05565352146568232,"gpt":0.2892777634608105,"spread":0.2336242419951282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008477565,0.000297853,0.0003013169,0.0004983012,0.00104971,0.0004849099,0.001647534,0.00006740851,0.00002704742],"category_scores_gemma":[0.0008066078,0.0002503875,0.0001331941,0.0007033254,0.0002175589,0.0004894105,0.0007147017,0.000847212,0.000007447737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004520312,"about_ca_system_score_gemma":0.0002259229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001927072,"about_ca_topic_score_gemma":0.0000284746,"domain_scores_codex":[0.9974313,0.00004089286,0.0006186008,0.0005849238,0.0008768204,0.0004474346],"domain_scores_gemma":[0.9984489,0.0002167528,0.0004189728,0.000178575,0.0006368375,0.00009993421],"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.0001136809,0.0000744414,0.0007128984,0.00005404244,0.00005245817,7.834656e-7,0.003318614,0.2383092,0.004093891,0.7449074,0.000008712052,0.008353806],"study_design_scores_gemma":[0.0001589705,0.000628082,0.0002901963,0.0001761661,0.00001499808,0.00003937485,0.002811808,0.9681931,0.01287531,0.0139038,0.0005953997,0.0003128481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05129258,0.000007896906,0.9309913,0.01308618,0.0003810738,0.0006020953,0.00000548679,0.0001485206,0.003484864],"genre_scores_gemma":[0.9864537,0.00004285971,0.01143975,0.0002183397,0.0001262527,0.0001064593,0.000005277387,0.00003268978,0.001574663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9351611,"threshold_uncertainty_score":0.9999948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4221151300","doi":"10.24963/ijcai.2022/755","title":"Rx-refill Graph Neural Network to Reduce Drug Overprescribing Risks (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Machine Learning in Healthcare","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Sherbrooke","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Dosing; Medical prescription; Drug; Drug overdose; Substance abuse; Computer science; Medicine; Graph; Intensive care medicine; Medical emergency; Psychiatry; Pharmacology; Poison control; Theoretical computer science","authors":[{"name":"Jianfei Zhang","is_ca":true},{"name":"Ai-Te Kuo","is_ca":false},{"name":"Jianan Zhao","is_ca":false},{"name":"Qianlong Wen","is_ca":false},{"name":"Erin L. Winstanley","is_ca":false},{"name":"Chuxu Zhang","is_ca":false},{"name":"Yanfang Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1026675648781423,"gpt":0.3312915834646052,"spread":0.2286240185864629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001584161,0.0003858919,0.0003856431,0.0003773133,0.0009859734,0.000446512,0.004888097,0.0000723642,0.0004210731],"category_scores_gemma":[0.0008816729,0.0003406146,0.0002747377,0.001123853,0.0001528854,0.0005320102,0.00252956,0.001393153,0.00007641439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003142444,"about_ca_system_score_gemma":0.0001556732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008210191,"about_ca_topic_score_gemma":0.00007874311,"domain_scores_codex":[0.9954098,0.00007609317,0.001108007,0.0009859429,0.001758297,0.000661878],"domain_scores_gemma":[0.9971505,0.0002448461,0.0008726286,0.0005450696,0.0009604427,0.0002264917],"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.0002579394,0.0002872651,0.001284296,0.0000551929,0.00006420974,0.000006420871,0.003932379,0.08157202,0.003914614,0.8716328,0.003516772,0.03347614],"study_design_scores_gemma":[0.0001824393,0.000735911,0.01598978,0.0008777637,0.00003599108,0.0001067432,0.00250649,0.5465623,0.05350963,0.3730593,0.005143031,0.001290658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7857543,0.0001230616,0.01581484,0.145765,0.01395339,0.00258201,0.0001037875,0.0008570035,0.03504661],"genre_scores_gemma":[0.9931179,0.00002092446,0.004067874,0.001902567,0.000341904,0.0001478284,0.00000359577,0.00003163984,0.0003657652],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4985735,"threshold_uncertainty_score":0.9999046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285600159","doi":"10.24963/ijcai.2022/253","title":"Large Neighbourhood Search for Anytime MaxSAT Solving","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Maximum satisfiability problem; Solver; Neighbourhood (mathematics); Computer science; Boolean satisfiability problem; Limit (mathematics); Mathematical optimization; Satisfiability; Algorithm; Mathematics; Boolean function","authors":[{"name":"Randy Hickey","is_ca":true},{"name":"Fahiem Bacchus","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06885179694586264,"gpt":0.3000225798449502,"spread":0.2311707828990875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001330348,0.0002386178,0.0002635396,0.0002541379,0.0004867016,0.000161078,0.001192635,0.0000694273,0.001153496],"category_scores_gemma":[0.0003972369,0.000222506,0.0001987362,0.0004121121,0.00009203827,0.0002188914,0.0004630266,0.0005280475,0.00002875835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002748633,"about_ca_system_score_gemma":0.00005984716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268082,"about_ca_topic_score_gemma":0.000005282116,"domain_scores_codex":[0.9977557,0.00002496923,0.0006684676,0.0003630219,0.0007694593,0.0004183701],"domain_scores_gemma":[0.9986954,0.0001704043,0.000215125,0.0001794863,0.0006604436,0.00007911964],"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.0001718907,0.0002526611,0.000652187,0.0001342752,0.0001262577,8.046417e-7,0.003235106,0.1957548,0.03487965,0.7542949,0.0007246248,0.009772807],"study_design_scores_gemma":[0.00008724739,0.0001126567,0.0002138992,0.000104675,0.00001664261,0.000009515999,0.001987586,0.7723817,0.203937,0.02004489,0.0008458476,0.0002582994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3718718,0.0001048825,0.5161995,0.01469449,0.007528091,0.003033775,0.0006696238,0.001105388,0.08479244],"genre_scores_gemma":[0.9903582,0.00002633499,0.008774809,0.0001666184,0.0001724914,0.0001355281,0.000008516247,0.00005219567,0.000305314],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7342501,"threshold_uncertainty_score":0.9997596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285603622","doi":"10.24963/ijcai.2022/795","title":"Bayesian Auctions with Efficient Queries (Extended Abstract)","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision 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":"Science North","funders":"Fundamental Research Funds for the Central Universities; Shanghai University of Finance and Economics; Shanghai Municipal Education Commission; National Natural Science Foundation of China; Hong Kong Polytechnic University; National Science Foundation","keywords":"Subadditivity; Submodular set function; Common value auction; Oracle; Computer science; Mechanism design; Valuation (finance); Constant (computer programming); Competitive analysis; Logarithm; Incentive compatibility; Bayesian probability; Monotone polygon; Quantile; Mathematical optimization; Upper and lower bounds; Theoretical computer science; Mathematical economics; Mathematics; Discrete mathematics; Incentive; Econometrics; Artificial intelligence; Statistics","authors":[{"name":"Jing Chen","is_ca":false},{"name":"Bo Li","is_ca":false},{"name":"Yingkai Li","is_ca":true},{"name":"Pinyan Lu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1159990889360982,"gpt":0.3430489784643151,"spread":0.2270498895282169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001754755,0.0002351876,0.0002755162,0.0003765274,0.001273869,0.0003308087,0.002139761,0.00005093362,0.004766377],"category_scores_gemma":[0.001000841,0.0001592883,0.0002031574,0.001094419,0.0006405875,0.0002607928,0.0005259673,0.0005527415,0.0001942933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001645953,"about_ca_system_score_gemma":0.0001432079,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005412392,"about_ca_topic_score_gemma":0.00004030373,"domain_scores_codex":[0.9958092,0.00003760279,0.00102442,0.0006489705,0.002210206,0.0002695899],"domain_scores_gemma":[0.9967907,0.0003175009,0.0009913285,0.0003883637,0.00140516,0.0001069366],"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.0002879514,0.0004328177,0.0001927119,0.000004688679,0.00003610022,7.549136e-7,0.001441413,0.01590298,0.003862886,0.9682423,0.0006817851,0.008913605],"study_design_scores_gemma":[0.00009152026,0.0003260812,0.002588292,0.00009608018,0.00003024122,0.00007850454,0.02430129,0.04078674,0.1047059,0.8159084,0.0106593,0.0004275929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.647144,0.00002653616,0.07983638,0.0927524,0.004219286,0.001988796,0.0003844812,0.0003504879,0.1732977],"genre_scores_gemma":[0.9966766,0.000006042925,0.0005505222,0.000254489,0.000119477,0.000193231,0.000003164998,0.00001680454,0.002179625],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3495327,"threshold_uncertainty_score":0.9961434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285601267","doi":"10.24963/ijcai.2022/660","title":"Efficient Budgeted Graph Search","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint 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 Alberta","funders":"","keywords":"Iterative deepening depth-first search; Heuristics; Search tree; Mathematical optimization; Graph; Computer science; Search algorithm; Best-first search; Range (aeronautics); Beam search; Tree (set theory); Incremental heuristic search; Limit (mathematics); Local search (optimization); Search problem; Iterative method; Mathematics; Algorithm; Theoretical computer science; Combinatorics","authors":[{"name":"Jasmeet Kaur","is_ca":true},{"name":"Nathan Sturtevant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05721922264094473,"gpt":0.2742359353565563,"spread":0.2170167127156115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007521309,0.0002018309,0.0001943496,0.0003991464,0.0006075698,0.0002522017,0.002129908,0.0000470077,0.0008192682],"category_scores_gemma":[0.0002142297,0.0001721311,0.000186139,0.0009014491,0.0002134826,0.0001837802,0.001038196,0.0005047281,0.00006082494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000203028,"about_ca_system_score_gemma":0.0001319435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005423789,"about_ca_topic_score_gemma":0.000009055361,"domain_scores_codex":[0.9972506,0.00003678702,0.0006133029,0.0005164812,0.001295946,0.0002868688],"domain_scores_gemma":[0.9983719,0.00008309427,0.0003695347,0.0002644269,0.0008223559,0.00008870841],"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.00005504159,0.0002177003,0.000340307,0.00001086105,0.00002924463,0.000001096854,0.001314447,0.04933427,0.005625276,0.926227,0.0001839328,0.01666079],"study_design_scores_gemma":[0.00008433239,0.000193155,0.001394994,0.00008246358,0.000009289601,0.00003780837,0.001583585,0.8537741,0.08577254,0.05628679,0.0004652041,0.0003157443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3609794,0.0000326315,0.4858266,0.0744604,0.007608453,0.001740955,0.00009446442,0.0006144179,0.06864268],"genre_scores_gemma":[0.9958848,0.00001480574,0.003324556,0.0004033029,0.00005382925,0.00005493559,0.000002411898,0.00001146334,0.0002498987],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8699403,"threshold_uncertainty_score":0.8970413,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285606915","doi":"10.24963/ijcai.2022/246","title":"A Solver + Gradient Descent Training Algorithm for Deep Neural Networks","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Adversarial Robustness in Machine Learning","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 Waterloo; University of Toronto","funders":"","keywords":"Maxima and minima; MNIST database; Solver; Computer science; Artificial neural network; Gradient descent; Algorithm; Convergence (economics); Stochastic gradient descent; Artificial intelligence; Mathematical optimization; Mathematics","authors":[{"name":"Dhananjay Ashok","is_ca":true},{"name":"Vineel Nagisetty","is_ca":false},{"name":"Christopher Srinivasa","is_ca":false},{"name":"Vijay Ganesh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07515808732222891,"gpt":0.2862519700429457,"spread":0.2110938827207168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001094297,0.000306333,0.0003269568,0.0002423697,0.0008641601,0.0003073275,0.003288192,0.00006768921,0.0001442373],"category_scores_gemma":[0.0004390398,0.0002651344,0.0003050368,0.0005118047,0.0001950192,0.0004570584,0.001494043,0.0007756428,0.000006152123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003054143,"about_ca_system_score_gemma":0.0000756911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003865652,"about_ca_topic_score_gemma":0.00001164337,"domain_scores_codex":[0.9969482,0.00004068399,0.0007738899,0.0007010332,0.001025945,0.0005101818],"domain_scores_gemma":[0.9980134,0.00021173,0.0007177264,0.0002741153,0.0006742162,0.0001088386],"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.00007967687,0.0001718435,0.00007281399,0.00001216152,0.00005279728,0.000001934582,0.003060592,0.1412097,0.0003682412,0.6054577,0.00008905474,0.2494235],"study_design_scores_gemma":[0.00009037032,0.0002357808,0.00007925704,0.00005841871,0.00001498507,0.00002631355,0.001503111,0.9399439,0.002967878,0.05435712,0.0004530128,0.0002698261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004929168,0.00001940662,0.9817699,0.007377195,0.003644229,0.0006559698,0.00001380025,0.0001341674,0.00145619],"genre_scores_gemma":[0.9612236,0.000009078177,0.03758924,0.000533051,0.0002966352,0.0002063101,0.00000457073,0.00002644672,0.0001110579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9562944,"threshold_uncertainty_score":0.9999801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285604285","doi":"10.24963/ijcai.2022/360","title":"Epistemic Logic of Likelihood and Belief","year":2022,"lang":"en","type":"article","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Computer science; Sublanguage; Probabilistic argumentation; Semantics (computer science); Belief revision; Modal logic; Theoretical computer science; Event (particle physics); Artificial intelligence; Epistemic modal logic; Datalog; Epistemology; Multimodal logic; Description logic; Programming language; Modal","authors":[{"name":"James P. Delgrande","is_ca":true},{"name":"Joshua Sack","is_ca":false},{"name":"Gerhard Lakemeyer","is_ca":false},{"name":"Maurice Pagnucco","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05277767543155166,"gpt":0.2654178339863315,"spread":0.2126401585547798,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980685,0.0002143008,0.00029873,0.0002166203,0.0003257513,0.0001330609,0.002347715,0.00005760283,0.0001861217],"category_scores_gemma":[0.0004018815,0.0001667285,0.0001530122,0.0004308687,0.0002884367,0.0002875976,0.001596748,0.0003934258,0.0000233154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001088187,"about_ca_system_score_gemma":0.000110714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006763719,"about_ca_topic_score_gemma":0.00001627171,"domain_scores_codex":[0.9977382,0.00002901946,0.0006730154,0.0005000567,0.0007838084,0.0002758934],"domain_scores_gemma":[0.9981763,0.0001219871,0.0006588581,0.0002464664,0.0007143735,0.0000820624],"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.00004716549,0.0002412404,0.0006647935,0.00003699333,0.00003009192,0.000001004351,0.001923107,0.00006697294,0.01024304,0.9752864,0.0001472154,0.01131199],"study_design_scores_gemma":[0.00008775125,0.0005214083,0.001191719,0.0002000522,0.00001639341,0.00005673501,0.001388313,0.04519062,0.1396673,0.8107651,0.0006096979,0.0003048801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.663126,0.0005853973,0.06682502,0.06010564,0.00714195,0.001980019,0.0001113626,0.0004432655,0.1996814],"genre_scores_gemma":[0.997519,0.00008788887,0.001717169,0.0002492653,0.00006973682,0.00004209221,0.000001164409,0.000009902855,0.0003037674],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.334393,"threshold_uncertainty_score":0.6798991,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}