{"meta":{"query_hash":"66d27e29dde0","filters":{"venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"},"cohort_total":36,"direct_labels_cover":0,"predictions_cover":36,"exported":36,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/66d27e29dde0","api":"https://metacan.xera.ac/api/v1/cohort?venue=Proceedings+of+the+Thirty-First+International+Joint+Conference+on+Artificial+Intelligence"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.10771857738968935,"score_gpt":0.3326002944640817,"score_spread":0.22488171707439233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215163807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017770924,0.0003865549,0.97654516,0.00010076476,0.00008088464,0.00009155279,0.00021598653,0.0034327079,0.001375511],"genre_scores_gemma":[0.29066238,0.00042886776,0.69608366,0.0004035359,0.00012333851,0.0002317503,0.0022570547,0.0006401162,0.009169308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991373,0.00013467085,0.000025837993,0.00039061767,0.0002184319,0.00009316801],"domain_scores_gemma":[0.99908245,0.00021983888,0.00008708086,0.0003482849,0.0001895585,0.00007271702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589482,0.0011792015,0.0010944918,0.0010648977,0.0004142409,0.0006230013,0.0027469716,0.0012983641,0.0036457516],"category_scores_gemma":[0.0028319077,0.0005742167,0.0010740729,0.00084000843,0.00086877076,0.0014529333,0.001957057,0.0017498003,0.002636478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037651265,0.00026968776,0.0023398122,0.00013011706,0.00015162646,0.00015723339,0.00013420734,0.12659997,0.027145261,0.005812268,0.009791343,0.8270919],"study_design_scores_gemma":[0.00001489617,0.000112358524,0.00073003245,0.000013168309,0.000019009767,0.00016342675,0.000015945861,0.98323935,0.008895691,0.003983922,0.002793629,0.00001856914],"about_ca_topic_score_codex":0.0044864123,"about_ca_topic_score_gemma":0.008806055,"teacher_disagreement_score":0.0044864123,"about_ca_system_score_codex":0.00067157636,"about_ca_system_score_gemma":0.001007833,"threshold_uncertainty_score":0.012196243},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10266756487814233,"score_gpt":0.3312915834646052,"score_spread":0.22862401858646286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221151300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47738543,0.004116587,0.495463,0.0035725099,0.00058276916,0.00020543899,0.0038458,0.0055503775,0.009278123],"genre_scores_gemma":[0.94939816,0.0005846916,0.04156137,0.0004991431,0.00009182297,0.00007862788,0.0023863798,0.000061376704,0.005338404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998456,0.000033135886,0.000009498498,0.000058018188,0.000026578322,0.000027138662],"domain_scores_gemma":[0.9996026,0.00019457481,0.00005092175,0.000026559928,0.00010158185,0.000023866727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039114212,0.0007923851,0.0005788311,0.00058449444,0.00020411165,0.00035928885,0.0008892243,0.000611516,0.0018804416],"category_scores_gemma":[0.001443613,0.00020792651,0.00051082805,0.00043169633,0.00019963356,0.00060575374,0.00039587717,0.0008018536,0.00027994873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003299593,0.0003496168,0.008315469,0.000107480766,0.00017185585,0.00014976144,0.000043471027,0.7638032,0.0025874558,0.0015362446,0.007868029,0.21473745],"study_design_scores_gemma":[0.0000058033484,0.000036647485,0.00075705675,0.000005050723,0.000017468412,0.000011235116,0.0000039889555,0.99790704,0.0004121555,0.0005666209,0.0002733635,0.0000035307646],"about_ca_topic_score_codex":0.024587281,"about_ca_topic_score_gemma":0.025867308,"teacher_disagreement_score":0.024587281,"about_ca_system_score_codex":0.000749555,"about_ca_system_score_gemma":0.00070215634,"threshold_uncertainty_score":0.048888326},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07033739951453769,"score_gpt":0.30030642250586426,"score_spread":0.22996902299132657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221158899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015215983,0.0005454959,0.97324544,0.00014366223,0.00008062763,0.000091464906,0.00011573876,0.009132528,0.0014289524],"genre_scores_gemma":[0.4416469,0.0007419593,0.5459884,0.0005581485,0.000102847414,0.00045183153,0.0018516682,0.0006050745,0.008053286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990538,0.00016548303,0.00006836097,0.0003169924,0.0002883192,0.00010701958],"domain_scores_gemma":[0.99885833,0.0002580932,0.0000736181,0.00047473866,0.00028385568,0.00005133587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013053822,0.0011864145,0.0010666823,0.00070548087,0.0005244699,0.0008454174,0.0035992858,0.0009839348,0.003207585],"category_scores_gemma":[0.0039328155,0.0006361367,0.0009351751,0.000713504,0.00061259896,0.0029921432,0.0020491409,0.0026881401,0.001836435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038493736,0.00029022867,0.0021614684,0.00017961017,0.00018147311,0.00015434285,0.00015253744,0.2780515,0.00980534,0.00834442,0.00843181,0.6918623],"study_design_scores_gemma":[0.0000099683575,0.0000689329,0.00017371362,0.000008446637,0.000019177132,0.00005091298,0.000012375996,0.9902249,0.003297447,0.004236072,0.0018864917,0.000011479113],"about_ca_topic_score_codex":0.006304505,"about_ca_topic_score_gemma":0.008362858,"teacher_disagreement_score":0.006304505,"about_ca_system_score_codex":0.0007341355,"about_ca_system_score_gemma":0.0013865754,"threshold_uncertainty_score":0.012535632},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08905293292888322,"score_gpt":0.28852288096350404,"score_spread":0.19946994803462081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224255863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18650462,0.0010165956,0.7981532,0.00063256687,0.00016416129,0.00014044193,0.00034804753,0.008481812,0.0045584994],"genre_scores_gemma":[0.816378,0.0003451489,0.17605664,0.00036657194,0.000078796904,0.00010557834,0.0011955815,0.0005588973,0.0049147825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993136,0.00011930858,0.000035969824,0.00032379173,0.00010856157,0.00009877906],"domain_scores_gemma":[0.9981477,0.00056295044,0.00015949378,0.0007350678,0.00024860847,0.00014624867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013824281,0.00145036,0.0011469962,0.00080838974,0.0005098957,0.0012677937,0.0029065197,0.001332308,0.002260032],"category_scores_gemma":[0.004509275,0.00065078115,0.0009007436,0.000796558,0.0014475452,0.004885665,0.002727932,0.0027896794,0.0012449992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077216927,0.00069189584,0.005779948,0.00029984114,0.00020941668,0.00019292574,0.0008811603,0.1838629,0.075429894,0.009392211,0.0063499836,0.7161376],"study_design_scores_gemma":[0.000027017002,0.00026364828,0.0014674244,0.00003205657,0.000057851146,0.00012176025,0.000103382125,0.94856393,0.027932089,0.018489206,0.0028977026,0.000043952277],"about_ca_topic_score_codex":0.00469138,"about_ca_topic_score_gemma":0.008458031,"teacher_disagreement_score":0.00469138,"about_ca_system_score_codex":0.0007595453,"about_ca_system_score_gemma":0.0011122952,"threshold_uncertainty_score":0.0093281865},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06027301354964597,"score_gpt":0.3071543382944801,"score_spread":0.2468813247448341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225368580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012951371,0.00069115846,0.979763,0.0004504251,0.0001432707,0.000067994195,0.00038496105,0.0038979708,0.0016499058],"genre_scores_gemma":[0.26982513,0.0010893948,0.71751773,0.0008568464,0.00019965383,0.00027225158,0.0024782561,0.0014612845,0.0062994496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956983,0.00009959765,0.00002650299,0.0001285462,0.00013215565,0.000043402702],"domain_scores_gemma":[0.99941397,0.0002558465,0.00006177819,0.00012632833,0.000104429266,0.000037558733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010814283,0.001297295,0.00085465255,0.0011678999,0.00042372965,0.0013661425,0.0022568936,0.0016156866,0.0026683332],"category_scores_gemma":[0.0035012502,0.0007799088,0.0012932769,0.0010165098,0.00066235487,0.0022265096,0.0020225018,0.0016079535,0.0011505104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002752906,0.00008787286,0.0017445624,0.00020578848,0.00022715451,0.00016557582,0.000117088355,0.57479584,0.013824199,0.014501132,0.010581031,0.38347447],"study_design_scores_gemma":[0.00000821453,0.00001675532,0.000099935445,0.000008647591,0.000011130762,0.000038459493,0.000007761281,0.99137056,0.0018344718,0.004598118,0.0019980096,0.000007876965],"about_ca_topic_score_codex":0.009121102,"about_ca_topic_score_gemma":0.01442141,"teacher_disagreement_score":0.009121102,"about_ca_system_score_codex":0.0011236501,"about_ca_system_score_gemma":0.00095422607,"threshold_uncertainty_score":0.018136024},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08363649097721516,"score_gpt":0.2648976207822843,"score_spread":0.18126112980506914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225375697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06097936,0.0004955136,0.928574,0.00045818344,0.000130805,0.0001003595,0.0002628352,0.0017225348,0.007276445],"genre_scores_gemma":[0.8528879,0.00023757324,0.13297944,0.0003578949,0.000052150597,0.00017649356,0.00091554044,0.00032913644,0.012063775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980265,0.000050459832,0.000009297581,0.00006290538,0.000045372657,0.00002930021],"domain_scores_gemma":[0.999678,0.00017211515,0.000026770056,0.000045648187,0.000045769983,0.000031613607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252816,0.00074918004,0.0005245986,0.00035433855,0.00029903103,0.00045980135,0.0011072926,0.0008996037,0.0037310768],"category_scores_gemma":[0.0016543815,0.0003105933,0.0005953841,0.00027637705,0.00061223126,0.0007367111,0.0011269716,0.0010916298,0.0006753899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016242344,0.000055511315,0.0007127526,0.0000665876,0.000027559117,0.00013102607,0.000066481065,0.88961256,0.0045583462,0.0072382214,0.0026574603,0.094711006],"study_design_scores_gemma":[0.000008106405,0.000027510974,0.00006599225,0.000004287337,0.000003214787,0.000023914374,0.000007805919,0.99573815,0.00096210424,0.0026848158,0.0004711758,0.000002989321],"about_ca_topic_score_codex":0.00299922,"about_ca_topic_score_gemma":0.0043998705,"teacher_disagreement_score":0.0037310768,"about_ca_system_score_codex":0.00072991604,"about_ca_system_score_gemma":0.00054434687,"threshold_uncertainty_score":0.012481689},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06806887872685286,"score_gpt":0.3226548770219884,"score_spread":0.25458599829513556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225683910","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015976133,0.07578043,0.87865776,0.0028370707,0.00093394064,0.00019459843,0.0011031445,0.007855053,0.016661901],"genre_scores_gemma":[0.36185893,0.08828411,0.47875363,0.004141655,0.0016356803,0.00078138756,0.011870522,0.0024544918,0.0502197],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994023,0.00015991599,0.00004790814,0.00020034004,0.00012535597,0.00006427346],"domain_scores_gemma":[0.99885356,0.00059085723,0.000037285256,0.00018518924,0.00028448633,0.000048612957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011124833,0.0018073897,0.0011073633,0.0009548017,0.00037069106,0.0013613247,0.0028363978,0.0015130781,0.00615347],"category_scores_gemma":[0.0049510696,0.0007291263,0.0012160607,0.0012142834,0.0005826692,0.002801838,0.0011924254,0.0027793716,0.004400886],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016549169,0.00016573192,0.0015560144,0.00092827785,0.00016834197,0.000112410286,0.00014321771,0.07835431,0.0044256905,0.013907726,0.025212051,0.8748607],"study_design_scores_gemma":[0.000027026032,0.0003483755,0.0015831008,0.00069608586,0.00017172213,0.0003258375,0.00013056833,0.88694775,0.011167334,0.02512463,0.07339535,0.00008217558],"about_ca_topic_score_codex":0.009325035,"about_ca_topic_score_gemma":0.010376766,"teacher_disagreement_score":0.009325035,"about_ca_system_score_codex":0.0012704089,"about_ca_system_score_gemma":0.0017852503,"threshold_uncertainty_score":0.020585418},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07334618563402434,"score_gpt":0.29902978609084013,"score_spread":0.2256836004568158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229029442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022725163,0.0001455412,0.96903294,0.00012603735,0.00003898093,0.000085809384,0.00034684845,0.00659299,0.0009056184],"genre_scores_gemma":[0.48449886,0.00026501843,0.5080245,0.00031252127,0.00006133042,0.00025958547,0.0025161747,0.0013025608,0.0027593614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964297,0.00003348103,0.000013580685,0.00011050463,0.00014207003,0.00005738856],"domain_scores_gemma":[0.99965155,0.000074451826,0.00004294443,0.00011165953,0.00007913748,0.000040317136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045953252,0.0010575479,0.0010360611,0.0012150528,0.0005473752,0.0011576059,0.0023901558,0.0016204232,0.002851852],"category_scores_gemma":[0.0017832937,0.0006523818,0.0010611463,0.0011917243,0.00093353516,0.001975398,0.0027058395,0.0012952609,0.0011090422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028176626,0.000106424915,0.0024029114,0.00014844067,0.000129811,0.00019437716,0.00015819792,0.5881257,0.028965805,0.011087814,0.008810601,0.35958815],"study_design_scores_gemma":[0.000007601113,0.000020628042,0.00025742807,0.0000049752043,0.000005817613,0.00004257846,0.000011332917,0.9897856,0.004531296,0.004408807,0.0009170013,0.0000069439184],"about_ca_topic_score_codex":0.0051770597,"about_ca_topic_score_gemma":0.0066719265,"teacher_disagreement_score":0.0051770597,"about_ca_system_score_codex":0.0010903095,"about_ca_system_score_gemma":0.0009378654,"threshold_uncertainty_score":0.010293841},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09833545549548467,"score_gpt":0.3364742101218567,"score_spread":0.23813875462637202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229076201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98754245,0.00033958245,0.00615883,0.0003189942,0.000034089124,0.00040162686,0.00056236197,0.00034236387,0.0042996136],"genre_scores_gemma":[0.9792575,0.00033536766,0.012624872,0.0002541049,0.000028734676,0.00043123704,0.0021435248,0.00011797688,0.004806704],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9949591,0.0029934845,0.00043257454,0.00065113156,0.00073373644,0.00022997722],"domain_scores_gemma":[0.9303154,0.05479906,0.0027661435,0.0065318816,0.0031017975,0.002485739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007960914,0.0008555313,0.0008446291,0.0013750376,0.0010229148,0.0015828868,0.0016220602,0.001666246,0.0063110203],"category_scores_gemma":[0.067397445,0.000505745,0.00055399654,0.0008774641,0.0015755832,0.003717816,0.0021515368,0.0023694378,0.0019770975],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0051671425,0.02852463,0.23517905,0.0037097596,0.0005697123,0.0021193982,0.06045556,0.029231189,0.0120118465,0.009760953,0.06460122,0.5486695],"study_design_scores_gemma":[0.0028912602,0.04372328,0.4154945,0.0013014748,0.0004026532,0.0053223725,0.056930095,0.1831465,0.029691359,0.022792375,0.23769511,0.00060899736],"about_ca_topic_score_codex":0.0018924654,"about_ca_topic_score_gemma":0.0035738358,"teacher_disagreement_score":0.007960914,"about_ca_system_score_codex":0.000750516,"about_ca_system_score_gemma":0.0005753614,"threshold_uncertainty_score":0.04210186},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04012080355832404,"score_gpt":0.26595712396022453,"score_spread":0.2258363204019005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280641606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06534385,0.0011256716,0.90482146,0.0007967912,0.00045912946,0.00018341136,0.0005110961,0.023610625,0.0031479714],"genre_scores_gemma":[0.5053137,0.00037934774,0.47790107,0.0013142616,0.00031195977,0.00032866976,0.0029821864,0.002525426,0.008943302],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714714,0.0007531107,0.00011344871,0.00093776075,0.00079214585,0.00025644005],"domain_scores_gemma":[0.9902236,0.0033596263,0.00068151456,0.0031184417,0.0022794956,0.00033734608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004666436,0.0027489641,0.0019221909,0.0015795684,0.0011254981,0.0014230547,0.003995442,0.0029030738,0.0028225027],"category_scores_gemma":[0.01577449,0.00074572937,0.001253107,0.0011263941,0.0012879395,0.0035269947,0.0032736792,0.004855857,0.0018332737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005013316,0.00061924965,0.008885688,0.00022578883,0.0004408467,0.00021720487,0.00035155241,0.2962113,0.015307812,0.0054527475,0.029947901,0.64183855],"study_design_scores_gemma":[0.000029180033,0.0000900508,0.00049364875,0.000020306841,0.00002992942,0.000046861067,0.000025685678,0.98562694,0.0076671396,0.004064769,0.0018817888,0.00002379641],"about_ca_topic_score_codex":0.008378405,"about_ca_topic_score_gemma":0.018481601,"teacher_disagreement_score":0.008378405,"about_ca_system_score_codex":0.0012861358,"about_ca_system_score_gemma":0.0022424688,"threshold_uncertainty_score":0.024678767},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08809639599173266,"score_gpt":0.29736024869521155,"score_spread":0.2092638527034789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281553483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076356016,0.00033347073,0.9152833,0.0011390895,0.00006665567,0.0001232949,0.0001345306,0.00090034615,0.0056632473],"genre_scores_gemma":[0.9102951,0.00015040378,0.08596006,0.00037212585,0.000045478104,0.00021715082,0.00016735574,0.00015803694,0.002634248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659926,0.0015881935,0.00014384487,0.0007115098,0.00055118295,0.00040602262],"domain_scores_gemma":[0.98708564,0.009275021,0.0010797116,0.0013888808,0.0006821349,0.00048858934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004515212,0.001274276,0.0015664824,0.0008262006,0.0007199606,0.0014794194,0.0023095817,0.0020585565,0.003630368],"category_scores_gemma":[0.028769579,0.0007097049,0.00083236257,0.00065242656,0.0026280605,0.0034304094,0.0029132403,0.0032704696,0.0006234412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033516536,0.00013476431,0.0019662771,0.00009348882,0.00008739592,0.00010534744,0.00018445164,0.9172845,0.001585653,0.03992362,0.0024192762,0.035880115],"study_design_scores_gemma":[0.000021241882,0.00006111879,0.0001105185,0.000012428174,0.000008558197,0.000022888535,0.000023052327,0.9644516,0.00042002814,0.034516748,0.0003443053,0.0000074232903],"about_ca_topic_score_codex":0.0029902617,"about_ca_topic_score_gemma":0.0029550872,"teacher_disagreement_score":0.004515212,"about_ca_system_score_codex":0.0019792232,"about_ca_system_score_gemma":0.0018062528,"threshold_uncertainty_score":0.023879051},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16188916389422092,"score_gpt":0.31409551449843304,"score_spread":0.15220635060421212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281563651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007049283,0.0003069009,0.9886126,0.0001731211,0.00004712357,0.00008547082,0.0003505965,0.0027123524,0.0006626443],"genre_scores_gemma":[0.33075276,0.0004965465,0.6578252,0.00048189395,0.00022296293,0.00053456065,0.004928574,0.00071628403,0.0040411856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978326,0.0008103981,0.000104223276,0.00071362447,0.0004004237,0.00013882654],"domain_scores_gemma":[0.99663395,0.0012300923,0.00042125036,0.0007925159,0.00075804105,0.00016417647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023678006,0.0017918446,0.0018351951,0.0027136458,0.00077798887,0.0014986387,0.0040187854,0.00212304,0.0017447983],"category_scores_gemma":[0.005963222,0.00070233765,0.0016321493,0.002338739,0.0013733577,0.0030651998,0.0017532569,0.0026553483,0.001337587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027976962,0.00037702647,0.003690998,0.00031325856,0.00031753836,0.00016511456,0.0002069408,0.50010604,0.0052652624,0.019965412,0.016884176,0.45242837],"study_design_scores_gemma":[0.000004340083,0.000015289641,0.00011610239,0.0000060726534,0.0000072403,0.000016759124,0.000008199657,0.98903614,0.0004864224,0.009744652,0.0005528149,0.000006005466],"about_ca_topic_score_codex":0.0077268174,"about_ca_topic_score_gemma":0.012914114,"teacher_disagreement_score":0.0077268174,"about_ca_system_score_codex":0.0014197647,"about_ca_system_score_gemma":0.0016455436,"threshold_uncertainty_score":0.015363693},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06885179694586264,"score_gpt":0.3000225798449502,"score_spread":0.23117078289908755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017890284,0.0005980623,0.96749187,0.00047779802,0.00013850011,0.000083389474,0.00014187665,0.0020241798,0.011154064],"genre_scores_gemma":[0.29323545,0.00038053552,0.69884855,0.00027976124,0.00009321333,0.0002935962,0.00051504426,0.000743754,0.0056101084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882525,0.0005413343,0.00006136494,0.00018283655,0.0002864184,0.00010286028],"domain_scores_gemma":[0.99743575,0.0017197184,0.00015710699,0.0003640189,0.00023533082,0.00008820186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018033956,0.000774102,0.0008644761,0.00056156755,0.0006611172,0.0011339162,0.0016524909,0.0012300343,0.007936391],"category_scores_gemma":[0.008211076,0.00043309093,0.0011023843,0.00092279934,0.001074447,0.001983709,0.0019088654,0.001824038,0.0014173749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020270099,0.00008479662,0.0008417522,0.0003185466,0.0000594129,0.00012916778,0.0001605316,0.7825508,0.0033942387,0.082908176,0.008643262,0.12070657],"study_design_scores_gemma":[0.000043199543,0.000038427967,0.000078707,0.000027577553,0.000011443814,0.000027906435,0.000023647164,0.9532536,0.0017440409,0.03937575,0.005365857,0.000009866238],"about_ca_topic_score_codex":0.0027847202,"about_ca_topic_score_gemma":0.0071449503,"teacher_disagreement_score":0.007936391,"about_ca_system_score_codex":0.0011172737,"about_ca_system_score_gemma":0.0015227891,"threshold_uncertainty_score":0.026549876},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07149497516497867,"score_gpt":0.2739307753526263,"score_spread":0.20243580018764762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014377367,0.0007823136,0.98116595,0.0016576574,0.000059520185,0.000045660134,0.00014617291,0.00011862079,0.0016467491],"genre_scores_gemma":[0.79605335,0.00262082,0.19328606,0.0013085236,0.0007814333,0.00030841012,0.0005618141,0.00021975498,0.004859741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995182,0.0022864232,0.000188839,0.0007822166,0.001118777,0.00044173622],"domain_scores_gemma":[0.9771738,0.017635334,0.0014364735,0.002120473,0.0011343854,0.00049963174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006936723,0.0015770715,0.0027402423,0.0008831569,0.00076947216,0.0021488173,0.0027101277,0.0026413111,0.0019629437],"category_scores_gemma":[0.02866687,0.0010836641,0.0010338061,0.0019215014,0.004398534,0.005711586,0.0038179941,0.0054152915,0.0003854985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021171464,0.00011170194,0.0014061087,0.0003311583,0.00011501266,0.00032774953,0.00014227614,0.68214875,0.0017903299,0.28121465,0.0033884763,0.028812084],"study_design_scores_gemma":[0.000022229313,0.000037588085,0.00016678154,0.00002046035,0.00000842492,0.000062241525,0.000016826854,0.90918994,0.00046863695,0.08944354,0.00055037206,0.0000129066175],"about_ca_topic_score_codex":0.0025221882,"about_ca_topic_score_gemma":0.0017340604,"teacher_disagreement_score":0.006936723,"about_ca_system_score_codex":0.0024592655,"about_ca_system_score_gemma":0.0020837667,"threshold_uncertainty_score":0.036685348},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.06430454282604245,"score_gpt":0.29373130230923883,"score_spread":0.22942675948319638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285600734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007374036,0.00027393023,0.9896254,0.00024915836,0.00003898202,0.00011317956,0.00006554285,0.0008719119,0.0013879024],"genre_scores_gemma":[0.60264546,0.00026940892,0.3917251,0.00060829596,0.000109575274,0.00076384156,0.00028880817,0.0003269286,0.0032626395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906594,0.0003692004,0.00004480981,0.00019261942,0.00020610017,0.00012128721],"domain_scores_gemma":[0.9974492,0.0015185266,0.00024299542,0.00023039432,0.00037291023,0.0001858608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029639516,0.0015701626,0.0015105932,0.0007613683,0.00045710147,0.0010254126,0.0034074378,0.0017863153,0.003992889],"category_scores_gemma":[0.008099501,0.0006680427,0.0007215178,0.00048398512,0.0018359326,0.0012926112,0.0021457328,0.0029027436,0.0006958628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001487363,0.00021260716,0.0013945759,0.00017697844,0.0000909873,0.00010124457,0.00013251926,0.85408837,0.0027607682,0.021965789,0.0033449158,0.11558258],"study_design_scores_gemma":[0.0000211617,0.00004608157,0.000051813422,0.000009630488,0.000005082447,0.00001115088,0.0000036869985,0.99271446,0.00033822496,0.006336604,0.00045615694,0.0000059674917],"about_ca_topic_score_codex":0.0042967717,"about_ca_topic_score_gemma":0.0054123034,"teacher_disagreement_score":0.0042967717,"about_ca_system_score_codex":0.0015095077,"about_ca_system_score_gemma":0.0021707613,"threshold_uncertainty_score":0.015675008},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07167116162927387,"score_gpt":0.3026082033544833,"score_spread":0.23093704172520943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13166356,0.0006489601,0.8591498,0.0010584955,0.00013903943,0.00006560371,0.00007936732,0.0010036746,0.006191437],"genre_scores_gemma":[0.98026705,0.00016042871,0.017657943,0.00017783583,0.00004327729,0.000031007534,0.00004237035,0.00005753718,0.0015625759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985701,0.0005709435,0.00005017372,0.00020720328,0.0003735155,0.00022803603],"domain_scores_gemma":[0.99442506,0.003542777,0.00056833826,0.0010038911,0.00028055743,0.00017933546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022901031,0.0010831893,0.0011148375,0.00037004566,0.0005804739,0.0009020443,0.0012165803,0.0013650176,0.0013328639],"category_scores_gemma":[0.009665108,0.00035448922,0.0007499955,0.0002604761,0.001872323,0.0031451061,0.002845463,0.002336576,0.0002833996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029969827,0.0000791814,0.0013343998,0.00007299766,0.0000995473,0.0003174883,0.0002079744,0.8845735,0.00990525,0.055376157,0.002904472,0.044829328],"study_design_scores_gemma":[0.000005955785,0.00004586888,0.00007526151,0.000005333576,0.0000047820404,0.00005738265,0.000012878673,0.98620254,0.0013115712,0.011996721,0.0002733832,0.000008258261],"about_ca_topic_score_codex":0.0014961504,"about_ca_topic_score_gemma":0.0013697473,"teacher_disagreement_score":0.0022901031,"about_ca_system_score_codex":0.00068266294,"about_ca_system_score_gemma":0.0006878974,"threshold_uncertainty_score":0.012111366},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05721922264094473,"score_gpt":0.27423593535655627,"score_spread":0.21701671271561154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026436195,0.0005155325,0.95974874,0.0004513809,0.00005365997,0.00016251249,0.00028988585,0.0016478784,0.010694167],"genre_scores_gemma":[0.3655484,0.00045265563,0.6272655,0.0002467698,0.000033147844,0.00029576785,0.0009949206,0.0004587113,0.004704217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.0008096438,0.00009847004,0.00034968308,0.00048277574,0.00029681574],"domain_scores_gemma":[0.9978364,0.0010852378,0.0001452505,0.0005330044,0.0002729896,0.00012707648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576146,0.0010154383,0.0009853082,0.0010590793,0.0006978153,0.001393075,0.001978708,0.0011113664,0.0063316994],"category_scores_gemma":[0.007175866,0.00053482054,0.00076403643,0.0016843003,0.0008389949,0.0028871188,0.0021784927,0.0013608088,0.0008746814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028728598,0.00019322263,0.0014319847,0.0002936897,0.00008963519,0.000109542794,0.00019385481,0.6331864,0.0045841145,0.103961825,0.011971049,0.24369738],"study_design_scores_gemma":[0.000043118405,0.000041794225,0.0001446063,0.000021460934,0.000016738595,0.000044111344,0.00004590342,0.934707,0.0014258688,0.0594798,0.004019612,0.000010093101],"about_ca_topic_score_codex":0.005783511,"about_ca_topic_score_gemma":0.008397546,"teacher_disagreement_score":0.0063316994,"about_ca_system_score_codex":0.0014147492,"about_ca_system_score_gemma":0.002927915,"threshold_uncertainty_score":0.021181703},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.060292365951161574,"score_gpt":0.28296751202799825,"score_spread":0.22267514607683667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061430777,0.00025372044,0.99070823,0.000415247,0.000040694416,0.000019349722,0.000035914,0.0001496518,0.0022341828],"genre_scores_gemma":[0.50126606,0.0023893514,0.47570032,0.0013186488,0.0004178354,0.0004929383,0.000516866,0.0010385585,0.01685951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978643,0.0011728243,0.00009813711,0.00033236737,0.0004207159,0.00011160317],"domain_scores_gemma":[0.98691314,0.009524163,0.0007408641,0.001086951,0.0013826453,0.00035231438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067281146,0.0012858841,0.0010270703,0.0012032372,0.0006444252,0.001811853,0.0017448249,0.001281878,0.005034948],"category_scores_gemma":[0.04553808,0.0006054551,0.0018142988,0.0012672016,0.0027637833,0.004018709,0.0035602094,0.0037320605,0.0015513786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001223719,0.00007575207,0.0021120117,0.00025852182,0.000102550526,0.0003484665,0.0004307943,0.13543864,0.0024879482,0.7950479,0.006914045,0.05666098],"study_design_scores_gemma":[0.000008894941,0.00003453716,0.0004027888,0.000045749108,0.00001327622,0.00014052076,0.000043605087,0.6607895,0.00095195876,0.3353726,0.002173921,0.000022707382],"about_ca_topic_score_codex":0.0023510095,"about_ca_topic_score_gemma":0.0017744175,"teacher_disagreement_score":0.0067281146,"about_ca_system_score_codex":0.0018294295,"about_ca_system_score_gemma":0.0009818531,"threshold_uncertainty_score":0.035582066},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08116218144506153,"score_gpt":0.25210033630696244,"score_spread":0.1709381548619009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24707085,0.0005270899,0.7401393,0.0007743801,0.000058510363,0.00016640352,0.00015556095,0.00011448138,0.010993421],"genre_scores_gemma":[0.94665295,0.00023927631,0.048470113,0.000080263875,0.000036828595,0.00009586029,0.000051994477,0.000019439887,0.0043532453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560803,0.0022893455,0.00021061506,0.0005799025,0.0006002308,0.0007118244],"domain_scores_gemma":[0.99343723,0.0036813375,0.00096279144,0.0011479236,0.00034357765,0.0004270648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041899346,0.0009247445,0.0018732721,0.00053023983,0.00058250735,0.002821337,0.001995947,0.0012826176,0.0025402228],"category_scores_gemma":[0.013650183,0.0006133459,0.0007913034,0.0010717426,0.0020745688,0.004105554,0.0024548278,0.0012999963,0.00040117363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007555875,0.0001533055,0.0013381515,0.00014373743,0.000135989,0.00033367594,0.00030751002,0.67268366,0.0035231963,0.29188105,0.0009291633,0.027814938],"study_design_scores_gemma":[0.00009314408,0.00011719364,0.0002573967,0.000016495404,0.000027714215,0.00007122539,0.00009876517,0.80883485,0.0013712161,0.1875576,0.001533638,0.00002079356],"about_ca_topic_score_codex":0.0014233998,"about_ca_topic_score_gemma":0.0010050659,"teacher_disagreement_score":0.0041899346,"about_ca_system_score_codex":0.0017255577,"about_ca_system_score_gemma":0.001135477,"threshold_uncertainty_score":0.022158802},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09351631533544383,"score_gpt":0.28314915439665816,"score_spread":0.18963283906121434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285601870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21332867,0.0065303952,0.64397925,0.0049383645,0.0017157724,0.0003639025,0.043594405,0.057025094,0.028524263],"genre_scores_gemma":[0.6340233,0.0014008379,0.26861197,0.001003915,0.00039062992,0.00014136174,0.07942674,0.001344803,0.0136563545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899226,0.00019516386,0.000047949306,0.00036701758,0.00030161423,0.000095846815],"domain_scores_gemma":[0.995915,0.0019912675,0.00022124413,0.00095970713,0.0007414037,0.00017132345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942708,0.0011743366,0.0006503357,0.0024379024,0.0006961175,0.001920949,0.0020052714,0.0011969381,0.011742614],"category_scores_gemma":[0.008342403,0.00031021482,0.00091492175,0.0026091286,0.000522806,0.00449188,0.0019798938,0.0016490889,0.006345187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005701342,0.0007093168,0.016421728,0.0007776963,0.00029028257,0.00061046827,0.00025724515,0.17102562,0.0064558876,0.0140159065,0.15155716,0.63730854],"study_design_scores_gemma":[0.000037716785,0.0000791941,0.0021498976,0.00010446545,0.00008331715,0.00024466656,0.00013769229,0.9447178,0.008860598,0.027610928,0.015941024,0.000032583554],"about_ca_topic_score_codex":0.011877759,"about_ca_topic_score_gemma":0.01889401,"teacher_disagreement_score":0.011877759,"about_ca_system_score_codex":0.0007241505,"about_ca_system_score_gemma":0.0010959739,"threshold_uncertainty_score":0.039282978},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11874704221349053,"score_gpt":0.30395960290421015,"score_spread":0.18521256069071962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285602009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14700438,0.0033745402,0.69189197,0.012936564,0.0005342023,0.00020930139,0.00025240163,0.0004037442,0.1433929],"genre_scores_gemma":[0.9528214,0.0007090094,0.040870424,0.00063742936,0.00026786266,0.00022762887,0.00008778353,0.00007096795,0.0043075057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98398626,0.008723597,0.0011231158,0.001798692,0.0031046292,0.001263736],"domain_scores_gemma":[0.97176516,0.01980207,0.0021200425,0.0023201832,0.002268785,0.0017237641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011078882,0.0007929361,0.0010651579,0.0019318288,0.0031579982,0.0077399393,0.0020618741,0.0032806434,0.0039613256],"category_scores_gemma":[0.038102902,0.0011770177,0.0016147324,0.0010787509,0.018229248,0.021440923,0.0068783127,0.006861718,0.00046643242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022003387,0.000012915402,0.00020043495,0.00004300362,0.00001232984,0.00006525602,0.00047668378,0.002628276,0.00017942132,0.9932515,0.00029860964,0.0028095862],"study_design_scores_gemma":[0.000008170265,0.000009737571,0.00007067172,0.000022345328,0.000005897018,0.000027245882,0.000109539855,0.00453916,0.00009975715,0.99338406,0.0017151494,0.000008284133],"about_ca_topic_score_codex":0.0021204401,"about_ca_topic_score_gemma":0.0012797614,"teacher_disagreement_score":0.011078882,"about_ca_system_score_codex":0.003457154,"about_ca_system_score_gemma":0.0022774206,"threshold_uncertainty_score":0.058591425},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08510738125904387,"score_gpt":0.25086985557067976,"score_spread":0.16576247431163588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285602129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12924024,0.0028523772,0.8448318,0.00281854,0.00017178182,0.00019115204,0.0007715,0.00045296093,0.01866971],"genre_scores_gemma":[0.9149344,0.0015065932,0.07332025,0.0005424493,0.00021134403,0.00028165622,0.00077951694,0.00026542757,0.008158361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9847036,0.007439428,0.0008936858,0.0024118104,0.0031057475,0.0014457504],"domain_scores_gemma":[0.93791085,0.04637155,0.0042587584,0.0077379374,0.0024066302,0.0013142122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016158087,0.001218708,0.0041391244,0.0014877348,0.0013241747,0.005118637,0.0038888867,0.0020804498,0.005022084],"category_scores_gemma":[0.08120872,0.0012004536,0.0017673242,0.0021386172,0.0036910677,0.0069034225,0.0032086417,0.004169811,0.0011713175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013608172,0.00009053571,0.005303634,0.00040547983,0.00027094447,0.0003401816,0.00069234194,0.35605,0.0016429437,0.5750599,0.00506954,0.053713713],"study_design_scores_gemma":[0.000085987056,0.000117847325,0.0013302658,0.00007078292,0.000056485344,0.00019324038,0.00015200177,0.44618973,0.00095152494,0.54856974,0.0022244197,0.000058046913],"about_ca_topic_score_codex":0.004213849,"about_ca_topic_score_gemma":0.0028171837,"teacher_disagreement_score":0.016158087,"about_ca_system_score_codex":0.005459557,"about_ca_system_score_gemma":0.0017565507,"threshold_uncertainty_score":0.08545315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037370541326458166,"score_gpt":0.2495246221453384,"score_spread":0.21215408081888024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285603593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036760826,0.000089790025,0.9612518,0.00010728497,0.00001810831,0.000025851783,0.000027735468,0.0004402549,0.001278373],"genre_scores_gemma":[0.5820968,0.000106735795,0.41397712,0.000106783955,0.000016381911,0.00010073453,0.00008970971,0.00027754751,0.003228224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998029,0.00006112406,0.000009074621,0.00004189956,0.00005977746,0.000025245725],"domain_scores_gemma":[0.99903154,0.0005738117,0.00010257184,0.00011518898,0.000143668,0.000033269698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004963526,0.0004828801,0.00038183117,0.00038954982,0.00026446063,0.00055991346,0.00062120246,0.0004067601,0.0018106299],"category_scores_gemma":[0.0032195784,0.0003310898,0.00022735941,0.00034032582,0.00069036643,0.00096897164,0.0005603779,0.00058686465,0.00023558576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008889789,0.00004271119,0.0008774827,0.00005537099,0.000025272142,0.000074446034,0.000075888005,0.89105356,0.010349425,0.017598387,0.0011062936,0.07865231],"study_design_scores_gemma":[0.0000041189546,0.000008436464,0.00006565818,0.0000018248683,0.0000015276484,0.0000041048065,0.0000036170075,0.9946964,0.0011729968,0.0038838505,0.00015537578,0.000002087825],"about_ca_topic_score_codex":0.005447381,"about_ca_topic_score_gemma":0.00612544,"teacher_disagreement_score":0.005447381,"about_ca_system_score_codex":0.0006087512,"about_ca_system_score_gemma":0.0007559143,"threshold_uncertainty_score":0.010831356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11599908893609821,"score_gpt":0.34304897846431515,"score_spread":0.22704988952821692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285603622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016225567,0.0013054094,0.968764,0.0017568825,0.00019434227,0.00030626418,0.0005388809,0.00048070826,0.010428009],"genre_scores_gemma":[0.6348016,0.002562572,0.3428183,0.0014572717,0.0009851267,0.00093694864,0.0011296737,0.00027134334,0.01503722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99217063,0.0034075985,0.00052753685,0.0009668388,0.0021607352,0.00076666026],"domain_scores_gemma":[0.9795648,0.012885299,0.001742017,0.0035293968,0.0017420537,0.00053645595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007555503,0.0014378607,0.0019812295,0.0011068855,0.00075761304,0.0047418345,0.0032043925,0.0023468751,0.014582524],"category_scores_gemma":[0.0340897,0.0010690433,0.0015300333,0.0033484194,0.0014868242,0.009637428,0.0030736686,0.0036057525,0.0028907203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008098678,0.0006729145,0.0012596138,0.0009180593,0.00014938362,0.00030567808,0.00031475184,0.13593122,0.004988445,0.70728636,0.018936303,0.12842745],"study_design_scores_gemma":[0.00019980689,0.00020937086,0.00050710945,0.000087729386,0.000054064134,0.00037862879,0.0000559397,0.4666068,0.001715476,0.52046853,0.009657645,0.000058876765],"about_ca_topic_score_codex":0.0016004201,"about_ca_topic_score_gemma":0.0010969243,"teacher_disagreement_score":0.014582524,"about_ca_system_score_codex":0.0024109145,"about_ca_system_score_gemma":0.0020217637,"threshold_uncertainty_score":0.048783362},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05277767543155166,"score_gpt":0.26541783398633145,"score_spread":0.2126401585547798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285604285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009697639,0.0017604163,0.91082054,0.010482164,0.00033179906,0.00012398302,0.00059072935,0.0005571225,0.06563563],"genre_scores_gemma":[0.60125893,0.002007985,0.37026796,0.003454152,0.0015259375,0.0005538815,0.00074890803,0.00024865946,0.019933643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930467,0.0032073134,0.000585394,0.0010284258,0.00164276,0.0004893912],"domain_scores_gemma":[0.98955524,0.007278435,0.00062042614,0.00075517123,0.0013748042,0.00041607427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007859171,0.0011421085,0.0009813518,0.0024619985,0.0031019386,0.006163177,0.0021602067,0.0027895032,0.006358836],"category_scores_gemma":[0.015267191,0.0010326323,0.0027602897,0.0017682557,0.009293745,0.017134322,0.0056607807,0.0071934336,0.0012158701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001048996,0.0000069131174,0.000056187248,0.000038643197,0.000009050399,0.00007176227,0.0002769043,0.0009621512,0.00012172773,0.99529403,0.0006481221,0.0025039588],"study_design_scores_gemma":[0.000011158667,0.0000068811028,0.000033951277,0.00002653867,0.0000131171755,0.00007840804,0.00006376182,0.006561679,0.00018509115,0.98743826,0.005569653,0.000011564115],"about_ca_topic_score_codex":0.0035299873,"about_ca_topic_score_gemma":0.0025625266,"teacher_disagreement_score":0.007859171,"about_ca_system_score_codex":0.0037507745,"about_ca_system_score_gemma":0.0024050109,"threshold_uncertainty_score":0.04156375},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04697044092855063,"score_gpt":0.23643443835970532,"score_spread":0.1894639974311547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285604412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029227952,0.0006640311,0.96100026,0.00035113507,0.00017004227,0.00009676205,0.00048817368,0.0060206335,0.0019810481],"genre_scores_gemma":[0.74075,0.0005104627,0.25172618,0.00046923684,0.00019386067,0.00016879314,0.0023360134,0.00051554065,0.0033299369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996177,0.00008473035,0.000016636412,0.00012570062,0.00009737525,0.000057866004],"domain_scores_gemma":[0.9991659,0.00033821104,0.00009108411,0.00013982908,0.00018937449,0.00007560203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080858124,0.0015287808,0.0013765057,0.0010456,0.00048219107,0.000706576,0.0021377993,0.0011851229,0.0021562756],"category_scores_gemma":[0.0033464548,0.00062820537,0.0008780584,0.0009867775,0.00070784637,0.0017580555,0.0010514631,0.0021487111,0.00062569545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019113277,0.00021509483,0.0027261486,0.00013768038,0.00009093108,0.00011990706,0.00009441568,0.7730879,0.0027492284,0.0075738295,0.015529412,0.19748433],"study_design_scores_gemma":[0.0000041289577,0.000007632595,0.000078299585,0.0000023200394,0.0000025752158,0.000004570405,0.0000022916897,0.997598,0.00018860765,0.0018992011,0.00020982612,0.00000252324],"about_ca_topic_score_codex":0.022901505,"about_ca_topic_score_gemma":0.023733905,"teacher_disagreement_score":0.022901505,"about_ca_system_score_codex":0.0009197942,"about_ca_system_score_gemma":0.0018089561,"threshold_uncertainty_score":0.0455364},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055653521465682323,"score_gpt":0.28927776346081047,"score_spread":0.23362424199512816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285604500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013246997,0.00016600409,0.9850551,0.00011669704,0.00003705635,0.000032587886,0.000015677006,0.00043619704,0.00089359644],"genre_scores_gemma":[0.7903178,0.0001882864,0.20579298,0.00022118191,0.00006949922,0.00024050204,0.00013120638,0.00015045813,0.002888124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993881,0.00017611643,0.000037046713,0.00015818713,0.00013290746,0.00010762046],"domain_scores_gemma":[0.99790144,0.0012658151,0.00021884542,0.0002256922,0.0002636647,0.00012451885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017494113,0.0011657036,0.0016808914,0.00063984026,0.00059878285,0.0010195387,0.0018550695,0.0020745303,0.0027211446],"category_scores_gemma":[0.0061750086,0.00064580585,0.0006900317,0.00062246836,0.0012359475,0.0019331694,0.0019548193,0.0023151108,0.0005068091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006422516,0.00005565157,0.00054698583,0.00003197197,0.00003521807,0.000055087938,0.000062929495,0.92854106,0.0011096739,0.0071988683,0.00050156435,0.061796788],"study_design_scores_gemma":[0.0000041319895,0.0000173757,0.0000247633,0.000002788569,0.000002245729,0.0000052700625,0.0000026341056,0.99782795,0.00021750729,0.0017835519,0.0001096328,0.000002258575],"about_ca_topic_score_codex":0.0044042906,"about_ca_topic_score_gemma":0.0022595753,"teacher_disagreement_score":0.0044042906,"about_ca_system_score_codex":0.0009915106,"about_ca_system_score_gemma":0.0016996098,"threshold_uncertainty_score":0.009251893},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.090667810114998,"score_gpt":0.3025308155715213,"score_spread":0.21186300545652328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285604884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008093038,0.00038357644,0.97778475,0.0027653319,0.0003295601,0.00008193416,0.00028606993,0.006941692,0.0033340864],"genre_scores_gemma":[0.17249617,0.000538424,0.80456156,0.0035685059,0.00049392757,0.00029734173,0.002040051,0.0025786546,0.013425383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980635,0.00050564506,0.000102544895,0.00077667047,0.00041876416,0.00013279525],"domain_scores_gemma":[0.9958728,0.0010219231,0.00015925645,0.0015893364,0.0011625894,0.00019415702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038808766,0.002193092,0.0017297453,0.0011166311,0.0010106142,0.0024381191,0.002756398,0.0027606874,0.005871609],"category_scores_gemma":[0.011055444,0.001089138,0.0017553354,0.0007594448,0.0019503884,0.006257935,0.0027000408,0.0060185846,0.008347963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076240714,0.00031651492,0.003980501,0.0003411878,0.00045643694,0.00017747394,0.00038297067,0.14328092,0.041296184,0.035410807,0.06925506,0.70433956],"study_design_scores_gemma":[0.000044802575,0.00016289686,0.0007346129,0.000052802217,0.000051158877,0.00015628005,0.0000700779,0.9220182,0.012670273,0.050706267,0.013276933,0.00005574649],"about_ca_topic_score_codex":0.0046529234,"about_ca_topic_score_gemma":0.008937975,"teacher_disagreement_score":0.005871609,"about_ca_system_score_codex":0.00097596773,"about_ca_system_score_gemma":0.0014165301,"threshold_uncertainty_score":0.020524263},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.21384557946082658,"score_gpt":0.33639914380279223,"score_spread":0.12255356434196565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285605296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.407668,0.0021694019,0.5605513,0.0057050074,0.0001432211,0.000115335184,0.000047315676,0.00010398254,0.023496447],"genre_scores_gemma":[0.9736912,0.00035130902,0.024410203,0.00018379728,0.00006658741,0.00008573688,0.000017158727,0.000015547457,0.0011783472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983365,0.0012184213,0.000035965102,0.00014435199,0.000142283,0.00012246579],"domain_scores_gemma":[0.9923321,0.005943323,0.0004896023,0.0003345915,0.0003423777,0.00055798923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034278524,0.0005830953,0.0006511134,0.0004803462,0.00078588125,0.0014695822,0.0010017549,0.0014244146,0.0018035115],"category_scores_gemma":[0.015356594,0.00037009327,0.0005164758,0.0003181348,0.0014290083,0.0028720186,0.0024310169,0.0015470977,0.00016912911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001891252,0.00023165278,0.0077695195,0.00013263381,0.00015662069,0.00016594933,0.00063498685,0.71444213,0.0009437738,0.24519573,0.0011913654,0.028946474],"study_design_scores_gemma":[0.000034135814,0.000082989085,0.00038156813,0.000016671362,0.000013495267,0.000014743509,0.00009114446,0.8528338,0.00011223648,0.1457061,0.0007072158,0.00000586924],"about_ca_topic_score_codex":0.0016986349,"about_ca_topic_score_gemma":0.0012065684,"teacher_disagreement_score":0.0034278524,"about_ca_system_score_codex":0.0007728662,"about_ca_system_score_gemma":0.0007238653,"threshold_uncertainty_score":0.018128395},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.13205578501426393,"score_gpt":0.3260284103045427,"score_spread":0.19397262529027878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285605323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045583367,0.00023552118,0.93680114,0.0002964675,0.00012484944,0.00044968675,0.00012793418,0.011155772,0.0052252878],"genre_scores_gemma":[0.41376093,0.00019264469,0.5747687,0.0004499779,0.000062624575,0.0008662301,0.00055608986,0.00148325,0.007859513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954425,0.0019492649,0.00026345963,0.001269707,0.0008241189,0.00025089868],"domain_scores_gemma":[0.9904648,0.0045480533,0.0006237284,0.0025888996,0.0013436164,0.0004308044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004548527,0.0014600396,0.0009269658,0.0013169866,0.0007569041,0.0027252212,0.0023793548,0.0018741623,0.005435992],"category_scores_gemma":[0.024214238,0.00078049244,0.00095247483,0.0008133341,0.0010926047,0.0041253986,0.0038623451,0.0018927717,0.0029827226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009066355,0.0012425533,0.014397227,0.0006658727,0.00018858523,0.00040657798,0.008475013,0.041525766,0.07346767,0.008724405,0.013221424,0.8367782],"study_design_scores_gemma":[0.0003117649,0.0010627726,0.010836823,0.00020985951,0.00021711586,0.00085710705,0.0033619644,0.83454156,0.06280709,0.030108185,0.05538543,0.00030044263],"about_ca_topic_score_codex":0.0011448681,"about_ca_topic_score_gemma":0.0018195385,"teacher_disagreement_score":0.005435992,"about_ca_system_score_codex":0.00075952,"about_ca_system_score_gemma":0.0011703455,"threshold_uncertainty_score":0.024055183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03953152171979173,"score_gpt":0.26529762752541886,"score_spread":0.22576610580562712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285605397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097121164,0.0011872668,0.8760233,0.00044245046,0.0002087753,0.000293303,0.0025732531,0.020982342,0.001168169],"genre_scores_gemma":[0.5260123,0.00052974484,0.46264002,0.00022404641,0.00011801103,0.00026491398,0.0069152303,0.0007607097,0.0025350123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984546,0.0002889752,0.00015355613,0.0004995339,0.00048695182,0.000116470714],"domain_scores_gemma":[0.9935875,0.0027519695,0.00082219846,0.0014690593,0.0010047077,0.0003645809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014051641,0.0011721757,0.0011559047,0.0038112411,0.0007423706,0.0016627731,0.0022373644,0.0011661546,0.0015142565],"category_scores_gemma":[0.011334468,0.00056600163,0.0007002532,0.0031315028,0.0006850019,0.0041816263,0.0019237421,0.0012473844,0.0011473579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001553286,0.0004313385,0.045739856,0.00072692015,0.000517974,0.0005919473,0.0008240683,0.18687274,0.02392731,0.015201444,0.020128584,0.7034844],"study_design_scores_gemma":[0.000041925938,0.000117134834,0.0016640162,0.000018178454,0.000029473498,0.00027692452,0.00008779213,0.96974295,0.007299219,0.017289307,0.003402274,0.000030800304],"about_ca_topic_score_codex":0.0034804924,"about_ca_topic_score_gemma":0.0045045465,"teacher_disagreement_score":0.0038112411,"about_ca_system_score_codex":0.00068140746,"about_ca_system_score_gemma":0.0010177686,"threshold_uncertainty_score":0.0074313283},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.26345266215122864,"score_gpt":0.41029010875163,"score_spread":0.14683744660040138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285606202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760172,0.0024553253,0.00045800325,0.016424924,0.000071584196,0.000061728926,0.00016882051,0.000010459292,0.0043320716],"genre_scores_gemma":[0.99392515,0.0019532908,0.0003887692,0.0028342425,0.000065873224,0.00007711474,0.00010014491,0.000012223241,0.00064328196],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9760577,0.015011314,0.0025254874,0.0011000143,0.0036474275,0.0016580774],"domain_scores_gemma":[0.8164088,0.0958949,0.049288042,0.0048760776,0.01849885,0.015033341],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.030216716,0.00012856466,0.00049223466,0.002724511,0.0030185734,0.0056989887,0.0006117643,0.00168761,0.002375828],"category_scores_gemma":[0.09030905,0.0005135483,0.00034009278,0.0038703266,0.0032081448,0.00505069,0.0027273821,0.002332358,0.00043427452],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013815776,0.00021049591,0.79293925,0.00039175453,0.00007743092,0.00042954623,0.152005,0.00019796472,0.0006250525,0.004673467,0.013234526,0.035077374],"study_design_scores_gemma":[0.00004222496,0.00032174488,0.42964354,0.0011688333,0.000037897313,0.0011155899,0.50602263,0.0011151591,0.0004127183,0.0024968244,0.057507172,0.00011569061],"about_ca_topic_score_codex":0.005215354,"about_ca_topic_score_gemma":0.0060716546,"teacher_disagreement_score":0.9983124,"about_ca_system_score_codex":0.002695121,"about_ca_system_score_gemma":0.0045940075,"threshold_uncertainty_score":0.15980315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Air pollution; Casual; Scale (ratio); Natural (archaeology); Geography","score_opus":0.08496294791075351,"score_gpt":0.27875794455449693,"score_spread":0.19379499664374342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285606246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329503,0.0020223185,0.045384377,0.0065158242,0.0005242524,0.00027251433,0.20204155,0.0030013253,0.0072874664],"genre_scores_gemma":[0.7143263,0.0007239091,0.047252625,0.00040842243,0.00017232023,0.00018026448,0.23501812,0.00017042572,0.0017475134],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989793,0.00030749512,0.00010056549,0.00028217098,0.00021666575,0.00011393922],"domain_scores_gemma":[0.9962967,0.001273125,0.00041897414,0.0011903606,0.0005871709,0.00023357495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015906224,0.0007486463,0.0006624641,0.002600374,0.0006032921,0.0013807518,0.0019639763,0.0019928634,0.0011908681],"category_scores_gemma":[0.00674979,0.0003666813,0.0010276464,0.0051711667,0.00053786027,0.0021457288,0.001854668,0.0017910908,0.0010655507],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055911776,0.001347707,0.47389057,0.00084009435,0.0009878218,0.0016400333,0.00090034463,0.27165928,0.0053790165,0.008401456,0.11117109,0.123223394],"study_design_scores_gemma":[0.00009244414,0.00015889185,0.24345356,0.00015193512,0.00016694226,0.0003000263,0.0023113547,0.664418,0.0033208176,0.011375092,0.074086845,0.00016407436],"about_ca_topic_score_codex":0.049814012,"about_ca_topic_score_gemma":0.09272111,"teacher_disagreement_score":0.049814012,"about_ca_system_score_codex":0.0011533535,"about_ca_system_score_gemma":0.0010866942,"threshold_uncertainty_score":0.09904814},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05926104120348049,"score_gpt":0.2824810265796182,"score_spread":0.22321998537613771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285606778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024776137,0.00032302336,0.97109365,0.00022373171,0.000062455016,0.000040885945,0.00021547424,0.001967209,0.0012974186],"genre_scores_gemma":[0.59693545,0.00033650754,0.39398688,0.00045989925,0.00007814568,0.00014109281,0.0011116844,0.0008874484,0.006062834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995278,0.00012534877,0.000018406818,0.00014679666,0.0001160334,0.000065664935],"domain_scores_gemma":[0.9990188,0.0004240971,0.00007991028,0.00022375322,0.00017356193,0.000079868914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077981997,0.00087278656,0.0010416519,0.0006619879,0.0004912084,0.0007627593,0.0022818358,0.0014654819,0.0022108802],"category_scores_gemma":[0.0032544537,0.0006202562,0.0007089775,0.00083310646,0.0010196315,0.0016955481,0.0015047996,0.002053425,0.0008705429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015800569,0.000091184724,0.0014434317,0.00011820206,0.00008921934,0.0001537549,0.00021037298,0.7652719,0.011458565,0.037621506,0.0075281085,0.17585576],"study_design_scores_gemma":[0.0000037395682,0.000009557258,0.000045757602,0.0000028382335,0.0000029593539,0.000012546159,0.0000056567555,0.99402195,0.00071655447,0.004855919,0.0003183619,0.0000041627086],"about_ca_topic_score_codex":0.009072472,"about_ca_topic_score_gemma":0.01824544,"teacher_disagreement_score":0.009072472,"about_ca_system_score_codex":0.0012075935,"about_ca_system_score_gemma":0.0012862821,"threshold_uncertainty_score":0.018039346},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07515808732222891,"score_gpt":0.28625197004294567,"score_spread":0.21109388272071677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285606915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020439385,0.00012606037,0.9927146,0.00011008747,0.00004652191,0.000054443277,0.000096214884,0.0027974227,0.0020107424],"genre_scores_gemma":[0.044322666,0.00009912399,0.9502601,0.00022510538,0.00003152178,0.00028290146,0.00041577907,0.0006571373,0.0037056394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99959797,0.00010346878,0.000026862634,0.00008695778,0.00013800738,0.00004683269],"domain_scores_gemma":[0.99954945,0.00021735829,0.000037036338,0.00006182901,0.00010703878,0.00002729308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008229034,0.001806368,0.0008471891,0.00064409524,0.00038985687,0.0007987634,0.0015794775,0.0012946473,0.006802053],"category_scores_gemma":[0.0024134286,0.000808666,0.00066999195,0.00068478874,0.0006318809,0.00090351,0.0013811832,0.002013635,0.0027966537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011061908,0.00011060177,0.00079533475,0.00018870113,0.000101956844,0.00012053917,0.00007034596,0.6449279,0.00525123,0.029178364,0.015814764,0.3033296],"study_design_scores_gemma":[0.000025233747,0.00001930282,0.000032219126,0.000010331533,0.000004580836,0.000022968336,0.0000047284116,0.98954153,0.0011267498,0.0056919986,0.0035158668,0.0000043808795],"about_ca_topic_score_codex":0.004630017,"about_ca_topic_score_gemma":0.008323879,"teacher_disagreement_score":0.006802053,"about_ca_system_score_codex":0.00080698205,"about_ca_system_score_gemma":0.0016802208,"threshold_uncertainty_score":0.022755146},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10557883036952102,"score_gpt":0.3195361004765339,"score_spread":0.21395727010701288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285607048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8575399,0.0010396343,0.107588716,0.0027750512,0.000112850554,0.00029981358,0.00031755367,0.00012463049,0.03020184],"genre_scores_gemma":[0.98911345,0.000168046,0.009771163,0.0000828787,0.000023241237,0.00008414164,0.00010745583,0.000020345895,0.00062933564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98515505,0.010951772,0.0005270909,0.0013824,0.001391538,0.00059221947],"domain_scores_gemma":[0.9441094,0.04356872,0.004042974,0.004581836,0.0027544012,0.0009427138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016326008,0.00032089217,0.00080450246,0.0015095551,0.0014499968,0.003460219,0.00088050886,0.0015316906,0.003113676],"category_scores_gemma":[0.07449449,0.0002346561,0.0005474,0.0012548084,0.0022639935,0.0044332137,0.001104736,0.00096618064,0.0006402584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001789383,0.00045043018,0.12694503,0.0007592533,0.0010665306,0.0002202254,0.004252302,0.23711023,0.006746666,0.41443947,0.0046659266,0.20155452],"study_design_scores_gemma":[0.00047059782,0.0009533637,0.064660124,0.00018660216,0.00025296194,0.00023265553,0.004398951,0.49965227,0.00532533,0.41057608,0.013124351,0.00016679695],"about_ca_topic_score_codex":0.0012876139,"about_ca_topic_score_gemma":0.0018267166,"teacher_disagreement_score":0.016326008,"about_ca_system_score_codex":0.0016009285,"about_ca_system_score_gemma":0.0007977567,"threshold_uncertainty_score":0.0863412},"labels":[],"label_agreement":null}]}