{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27473682,0.000034348213,0.6957059,0.018053712,0.0022830465,0.001708799,0.00012816982,0.00020571405,0.007143528],"genre_scores_gemma":[0.99405056,0.000019225945,0.005262029,0.000106911386,0.000075959324,0.00017643931,0.000013769234,0.000016054179,0.000279078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9974495,0.00008417091,0.000803027,0.0005623948,0.0008412879,0.0002596215],"domain_scores_gemma":[0.99679166,0.00050494156,0.0009710741,0.0002684129,0.0014099772,0.000053936088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016598683,0.00019580683,0.00030506984,0.00026595185,0.000546873,0.00017345665,0.0017670555,0.000053633146,0.00013148983],"category_scores_gemma":[0.0016874506,0.00017777146,0.00024945295,0.00058023323,0.00017245773,0.00041048884,0.00037067555,0.00037858955,0.000007150381],"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.00026832428,0.00032250077,0.0019113625,0.000071586655,0.000106735584,6.050467e-7,0.0066023683,0.008990317,0.10299238,0.8479318,0.0002317947,0.030570216],"study_design_scores_gemma":[0.00018074944,0.0004368144,0.004976959,0.00012928435,0.000027713933,0.0000067013034,0.0085898135,0.36911938,0.46956345,0.1460433,0.0006131024,0.00031272144],"about_ca_topic_score_codex":0.000119674936,"about_ca_topic_score_gemma":0.000017555041,"teacher_disagreement_score":0.71931374,"about_ca_system_score_codex":0.00013404044,"about_ca_system_score_gemma":0.00010735542,"threshold_uncertainty_score":0.724931},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7857543,0.00012306162,0.015814839,0.14576499,0.013953394,0.0025820096,0.00010378752,0.0008570035,0.03504661],"genre_scores_gemma":[0.9931179,0.000020924457,0.0040678736,0.0019025669,0.00034190403,0.0001478284,0.0000035957703,0.000031639836,0.00036576515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954098,0.000076093165,0.0011080068,0.0009859429,0.0017582972,0.00066187803],"domain_scores_gemma":[0.99715054,0.00024484607,0.0008726286,0.0005450696,0.0009604427,0.00022649174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015841611,0.00038589194,0.00038564313,0.0003773133,0.0009859734,0.00044651204,0.004888097,0.0000723642,0.00042107314],"category_scores_gemma":[0.0008816729,0.0003406146,0.0002747377,0.0011238528,0.00015288542,0.00053201016,0.0025295604,0.0013931534,0.00007641439],"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.00025793942,0.0002872651,0.0012842963,0.000055192897,0.000064209744,0.000006420871,0.003932379,0.08157202,0.003914614,0.87163275,0.0035167716,0.033476144],"study_design_scores_gemma":[0.00018243933,0.000735911,0.015989782,0.00087776367,0.000035991085,0.00010674315,0.0025064903,0.5465623,0.05350963,0.37305927,0.0051430315,0.0012906585],"about_ca_topic_score_codex":0.0008210191,"about_ca_topic_score_gemma":0.000078743105,"teacher_disagreement_score":0.49857348,"about_ca_system_score_codex":0.00031424436,"about_ca_system_score_gemma":0.0001556732,"threshold_uncertainty_score":0.9999046},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18015718,0.000060647842,0.5924571,0.2122633,0.0041423948,0.0020326464,0.00036458697,0.0010931179,0.00742901],"genre_scores_gemma":[0.95422477,0.000012240787,0.044955656,0.00041081256,0.00008277881,0.00017961899,0.000012446303,0.000023855671,0.00009780898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968253,0.000040329927,0.00068217533,0.00085335696,0.001156104,0.0004427512],"domain_scores_gemma":[0.99676794,0.0002289594,0.00067188253,0.0016422097,0.00059644744,0.00009253527],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012943851,0.00029888292,0.00028975145,0.00038831925,0.0007060852,0.00033259555,0.02565375,0.000079320576,0.00017238168],"category_scores_gemma":[0.008138231,0.00024554704,0.00018868472,0.0006193635,0.00026514943,0.0003345131,0.026458804,0.00086705806,0.000015136678],"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.00023901512,0.00053043285,0.00018390919,0.000050804756,0.00006402262,0.0000023807627,0.001172189,0.015267359,0.014982385,0.9109908,0.0031781953,0.053338524],"study_design_scores_gemma":[0.00005368085,0.00032011987,0.00008948907,0.00007241546,0.000007402453,0.000024106013,0.00045911674,0.55706656,0.07488411,0.36520615,0.00158626,0.00023056501],"about_ca_topic_score_codex":0.00008201815,"about_ca_topic_score_gemma":0.000019653266,"teacher_disagreement_score":0.7740676,"about_ca_system_score_codex":0.00027368582,"about_ca_system_score_gemma":0.0001234127,"threshold_uncertainty_score":0.9999997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5560878,0.00006082879,0.36124516,0.052506033,0.003754897,0.0012671713,0.00005860779,0.0003716729,0.024647862],"genre_scores_gemma":[0.98739594,0.000024842062,0.0112436395,0.00059142296,0.00006337838,0.000045017034,0.0000029477644,0.000013990995,0.0006188295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763244,0.000045202687,0.00059381174,0.0005047684,0.0009583017,0.00026549964],"domain_scores_gemma":[0.998565,0.0001239104,0.00050971855,0.00016893157,0.0005538849,0.00007856194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009098354,0.0002031171,0.00021372977,0.0002439481,0.0005729305,0.00044380722,0.0012833087,0.00003825089,0.00024565912],"category_scores_gemma":[0.0003395188,0.0001819999,0.000095768264,0.00039880382,0.0001916619,0.0006403768,0.0009321505,0.00046165526,0.000034547036],"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.00008640192,0.00016972492,0.0006169988,0.000031300086,0.00004866362,0.0000032630585,0.00718623,0.0006210442,0.0611656,0.8902091,0.00032010284,0.039541572],"study_design_scores_gemma":[0.00037689548,0.00050981104,0.0062103984,0.00036707142,0.000034486457,0.00013782512,0.013970067,0.5532087,0.22630708,0.19583002,0.0022288528,0.00081876357],"about_ca_topic_score_codex":0.00006631703,"about_ca_topic_score_gemma":0.000008487544,"teacher_disagreement_score":0.6943791,"about_ca_system_score_codex":0.00013143572,"about_ca_system_score_gemma":0.00007895942,"threshold_uncertainty_score":0.742174},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011706395,0.000024338691,0.95549995,0.02664086,0.0017537752,0.0010413904,0.000023883758,0.00018597314,0.0031234191],"genre_scores_gemma":[0.95856553,0.00006865746,0.039263655,0.0011540106,0.0002705952,0.00047049957,0.000010274956,0.00002317705,0.00017359843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996898,0.000030755386,0.0007808053,0.00064240926,0.0012894031,0.0003586371],"domain_scores_gemma":[0.9979214,0.0002665384,0.000694094,0.00030495485,0.0007054167,0.00010761176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077481614,0.00023921387,0.00024214869,0.00016117214,0.00078908354,0.00022720126,0.0031389408,0.00007879839,0.00028247302],"category_scores_gemma":[0.00042879264,0.00020904116,0.00017375602,0.0005852371,0.00021740001,0.00052333047,0.0012038782,0.0006022161,0.000017584418],"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.0000784144,0.00017323524,0.00006757413,0.00001711049,0.000030635656,0.0000010548412,0.00091584295,0.008095788,0.0070340154,0.95130396,0.0006193277,0.031663045],"study_design_scores_gemma":[0.000078450685,0.00018104776,0.00008185965,0.00009130237,0.000010791187,0.000021449172,0.0003719465,0.7018959,0.036126282,0.25991338,0.0010037055,0.00022389411],"about_ca_topic_score_codex":0.000021022277,"about_ca_topic_score_gemma":0.00001983986,"teacher_disagreement_score":0.9468591,"about_ca_system_score_codex":0.00024380012,"about_ca_system_score_gemma":0.000109961955,"threshold_uncertainty_score":0.8524451},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43507442,0.000016933434,0.5045496,0.03724942,0.0020258129,0.00076877704,0.000029492812,0.00019585186,0.02008968],"genre_scores_gemma":[0.98300105,0.0000060641823,0.014526743,0.0017277156,0.0001863863,0.00011560034,0.0000027642927,0.000016329257,0.0004173577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99726105,0.00001562438,0.0005685606,0.0006395283,0.0012086738,0.00030654646],"domain_scores_gemma":[0.99847144,0.00003061662,0.0004417571,0.0002568127,0.0006993336,0.000100023855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656482,0.00024294047,0.00023507475,0.0002188231,0.00060235057,0.00023227862,0.0023822605,0.00003960853,0.00031439884],"category_scores_gemma":[0.000081839826,0.00018715295,0.00010981106,0.00071523216,0.00014078652,0.00055129494,0.00051916216,0.0004017744,0.000032740267],"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.000167756,0.000301464,0.00032689056,0.000029473633,0.00004482012,0.000005390385,0.0051664235,0.020752233,0.040274404,0.90620214,0.00085745816,0.025871528],"study_design_scores_gemma":[0.00015235583,0.0008638946,0.001006996,0.00039102873,0.000028175975,0.000116457064,0.0016614422,0.36793518,0.59228754,0.030019406,0.0047154464,0.00082207413],"about_ca_topic_score_codex":0.00004011741,"about_ca_topic_score_gemma":0.000024459838,"teacher_disagreement_score":0.87618273,"about_ca_system_score_codex":0.00014892448,"about_ca_system_score_gemma":0.00016211598,"threshold_uncertainty_score":0.7631876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7610486,0.00005234881,0.19496465,0.018774766,0.001392664,0.0013833297,0.0002346389,0.00028959685,0.021859374],"genre_scores_gemma":[0.9951455,0.000009845175,0.004325453,0.00017071307,0.00003273653,0.0001095392,0.0000074943237,0.000016291491,0.00018242623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709976,0.00006994529,0.0008302303,0.00055769697,0.001189873,0.00025247596],"domain_scores_gemma":[0.9973458,0.00026252287,0.00083647395,0.00044174658,0.0010371188,0.00007636206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014386115,0.00021982183,0.0002928567,0.00027971936,0.0003333049,0.00014088712,0.0037928177,0.000051848063,0.00023731089],"category_scores_gemma":[0.00074326026,0.00018491739,0.00015719773,0.00083052035,0.00020651137,0.00038778796,0.0015281603,0.00053437124,0.000020086469],"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.00011384955,0.00049376424,0.0008779544,0.000026681793,0.000043592823,5.121116e-7,0.004407074,0.018243227,0.018551586,0.94071263,0.0001370585,0.016392067],"study_design_scores_gemma":[0.00005685314,0.00021221889,0.018015115,0.00009044784,0.0000069236994,0.0000075748026,0.0004266881,0.8683635,0.027150746,0.085420564,0.000042811138,0.0002065563],"about_ca_topic_score_codex":0.0019883513,"about_ca_topic_score_gemma":0.0000805459,"teacher_disagreement_score":0.8552921,"about_ca_system_score_codex":0.00012523124,"about_ca_system_score_gemma":0.00013665881,"threshold_uncertainty_score":0.7540712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08797341,0.000056334706,0.72118497,0.16896503,0.005999339,0.001840756,0.00043518184,0.0003459392,0.013199056],"genre_scores_gemma":[0.9930152,0.00002389491,0.0051684077,0.00088185084,0.00011378969,0.0001733217,0.000014914821,0.000008435335,0.00060016365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761224,0.00002748428,0.0006779735,0.000580673,0.0007997018,0.00030190175],"domain_scores_gemma":[0.9982437,0.0001826062,0.0005466101,0.00027298962,0.0006784422,0.00007568124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000808202,0.00020598112,0.00027425447,0.00032927873,0.000561934,0.00020643265,0.0028338046,0.000058933514,0.0006794274],"category_scores_gemma":[0.00048079315,0.00015692577,0.00027232248,0.0008793839,0.00018391153,0.00039684484,0.0012592928,0.00031550534,0.00003288051],"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.00008346382,0.0002536083,0.00017265625,0.000013319266,0.00005810513,7.530713e-7,0.000497654,0.00056024996,0.0032665937,0.9753995,0.0011641732,0.018529946],"study_design_scores_gemma":[0.000120835655,0.0007082158,0.00037732185,0.000045103316,0.00003698304,0.0000238793,0.0025855051,0.11250525,0.13544703,0.74401265,0.0037609122,0.00037633284],"about_ca_topic_score_codex":0.00009427528,"about_ca_topic_score_gemma":0.000016870967,"teacher_disagreement_score":0.9050418,"about_ca_system_score_codex":0.00018257932,"about_ca_system_score_gemma":0.000069555645,"threshold_uncertainty_score":0.7439254},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8899853,0.000027402573,0.08644334,0.018216992,0.0015936595,0.0019729803,0.000045898007,0.00024165848,0.0014727677],"genre_scores_gemma":[0.9962023,0.0000088963825,0.0022717246,0.0005111501,0.00026344942,0.0005238403,0.0000064331552,0.000032373002,0.00017984114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99586827,0.0001262268,0.000930643,0.0009896646,0.0016389734,0.0004462424],"domain_scores_gemma":[0.99666303,0.00057611585,0.0008100715,0.0005490234,0.0012953082,0.00010645039],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014834832,0.00038482997,0.00038164336,0.00017643806,0.001547519,0.00066684146,0.0055753947,0.000065262946,0.00020917866],"category_scores_gemma":[0.0006977349,0.00024383287,0.00020445662,0.0007077974,0.00052554393,0.0007654819,0.0013614788,0.0008753677,0.000025983982],"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.0006760936,0.0021083138,0.028911011,0.000015958127,0.00018881868,0.0000052493438,0.029046033,0.01428005,0.002143863,0.89192575,0.00037798472,0.030320862],"study_design_scores_gemma":[0.00021147596,0.0050723194,0.0074514416,0.00033482493,0.00010512165,0.000029669693,0.082014225,0.37869453,0.08045864,0.44197407,0.00256558,0.0010880877],"about_ca_topic_score_codex":0.00034523223,"about_ca_topic_score_gemma":0.00028833054,"teacher_disagreement_score":0.44995168,"about_ca_system_score_codex":0.00019080975,"about_ca_system_score_gemma":0.0001568271,"threshold_uncertainty_score":0.9998049},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5056158,0.00007010553,0.28702167,0.076163314,0.010386523,0.0022931236,0.000049401937,0.0021599156,0.116240196],"genre_scores_gemma":[0.9928484,0.00003224025,0.005175895,0.00025809158,0.00009917315,0.00009347697,0.000008150926,0.000019558649,0.0014650008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973847,0.00005855187,0.00054309994,0.00063981157,0.0010751933,0.00029862495],"domain_scores_gemma":[0.99796283,0.00013235255,0.0007550709,0.00029524165,0.00077677413,0.00007772651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089313084,0.00024805882,0.00022846769,0.00025248853,0.00081558013,0.00039071988,0.0020207984,0.000056440815,0.00010739356],"category_scores_gemma":[0.00040431647,0.00019354613,0.00008602596,0.0007091445,0.00011075469,0.0006023481,0.00080359384,0.00091277243,0.00006082332],"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.00020823776,0.0005076937,0.002134554,0.000041130115,0.00008687747,0.0000019561453,0.0032650472,0.0028251398,0.04519212,0.8782406,0.0007114002,0.06678526],"study_design_scores_gemma":[0.00016270082,0.0010851442,0.0020457865,0.00019961629,0.000030480816,0.000083615625,0.0022302684,0.8442457,0.1171853,0.024925528,0.007288417,0.00051749713],"about_ca_topic_score_codex":0.00014094675,"about_ca_topic_score_gemma":0.000027542437,"teacher_disagreement_score":0.85331506,"about_ca_system_score_codex":0.0002121462,"about_ca_system_score_gemma":0.00013758846,"threshold_uncertainty_score":0.78925824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7861026,0.00006615539,0.10857306,0.06501894,0.0054603964,0.0026884635,0.000062243205,0.0008319143,0.031196255],"genre_scores_gemma":[0.99447966,0.000028288041,0.003545207,0.0003784286,0.00011726981,0.00039613227,0.0000017634871,0.000032686636,0.00102058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9950964,0.0001609882,0.0012715063,0.0009944926,0.0018972855,0.00057932537],"domain_scores_gemma":[0.9966922,0.00044402538,0.0009454505,0.0005990957,0.0011711534,0.00014809132],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002789881,0.00040250435,0.0004234739,0.00045543688,0.0010812873,0.0005190195,0.0053615696,0.0000935223,0.0006589162],"category_scores_gemma":[0.0023624538,0.0003497649,0.00033876073,0.0010729304,0.00049340434,0.00083329115,0.0028957608,0.0011650118,0.00020807481],"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.0007377137,0.00070594513,0.0007355756,0.000030323743,0.000056843215,0.000005430215,0.0061250166,0.0059401644,0.035825714,0.921765,0.00021781663,0.027854422],"study_design_scores_gemma":[0.00005973458,0.0009463301,0.00023239046,0.00027107247,0.000018935101,0.000054185643,0.011046075,0.28184694,0.40183085,0.29768938,0.0053427876,0.0006613152],"about_ca_topic_score_codex":0.00010007639,"about_ca_topic_score_gemma":0.000015301208,"teacher_disagreement_score":0.62407565,"about_ca_system_score_codex":0.00043711803,"about_ca_system_score_gemma":0.00022462505,"threshold_uncertainty_score":0.99989545},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019568678,0.000035429024,0.9393179,0.0328446,0.0034573164,0.0014157553,0.00010989021,0.0002606363,0.0029898135],"genre_scores_gemma":[0.951121,0.00005222349,0.046849225,0.0010133678,0.00019865355,0.00048458079,0.000007916605,0.000031333944,0.00024175702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99627584,0.00003793397,0.0010311961,0.00091032725,0.0012573435,0.00048736317],"domain_scores_gemma":[0.99696124,0.00030427563,0.00094270834,0.00050989614,0.0011545334,0.00012734519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008230558,0.0003654676,0.0003773564,0.00038687617,0.0007928049,0.00030294628,0.0036451772,0.00011875446,0.00017244062],"category_scores_gemma":[0.0007761155,0.00031392512,0.00040543932,0.00089482125,0.000265754,0.0006159467,0.0011600617,0.0008390983,0.000026696263],"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.00014169574,0.000248255,0.00010102624,0.000030312767,0.000045285025,7.3575325e-7,0.0010072488,0.0021741963,0.01266786,0.96637297,0.0006541256,0.016556296],"study_design_scores_gemma":[0.00006630474,0.00024895227,0.0004425021,0.0001779913,0.000012524386,0.000014836397,0.00077343825,0.2501132,0.055475824,0.6916936,0.00066899206,0.00031187446],"about_ca_topic_score_codex":0.000019332132,"about_ca_topic_score_gemma":0.00000977102,"teacher_disagreement_score":0.9315523,"about_ca_system_score_codex":0.00023477394,"about_ca_system_score_gemma":0.00010982506,"threshold_uncertainty_score":0.9999313},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3718718,0.00010488252,0.5161995,0.0146944905,0.007528091,0.0030337751,0.0006696238,0.0011053883,0.084792435],"genre_scores_gemma":[0.9903582,0.000026334994,0.008774809,0.00016661843,0.00017249142,0.00013552807,0.000008516247,0.000052195668,0.00030531402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977557,0.000024969226,0.0006684676,0.00036302194,0.0007694593,0.00041837012],"domain_scores_gemma":[0.99869543,0.00017040427,0.00021512495,0.0001794863,0.00066044356,0.00007911964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013303483,0.00023861778,0.00026353964,0.00025413794,0.00048670155,0.00016107796,0.0011926353,0.000069427304,0.0011534961],"category_scores_gemma":[0.00039723687,0.00022250597,0.00019873619,0.00041211207,0.00009203827,0.00021889142,0.0004630266,0.0005280475,0.000028758352],"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.00017189067,0.00025266115,0.00065218704,0.0001342752,0.00012625771,8.046417e-7,0.0032351061,0.1957548,0.034879647,0.75429493,0.00072462484,0.009772807],"study_design_scores_gemma":[0.00008724739,0.00011265669,0.00021389915,0.00010467498,0.00001664261,0.000009515999,0.0019875865,0.7723817,0.20393704,0.020044891,0.0008458476,0.0002582994],"about_ca_topic_score_codex":0.0000126808245,"about_ca_topic_score_gemma":0.0000052821165,"teacher_disagreement_score":0.73425007,"about_ca_system_score_codex":0.00027486327,"about_ca_system_score_gemma":0.00005984716,"threshold_uncertainty_score":0.9997596},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005862041,0.000017338152,0.98669815,0.005037285,0.00032805905,0.0006495667,0.000026544156,0.00022096843,0.0011600605],"genre_scores_gemma":[0.9562334,0.000032091735,0.043262005,0.0002147712,0.000040994804,0.00007720804,0.000020626714,0.000021089603,0.00009780455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973454,0.00004047478,0.00061662734,0.00075700297,0.0009784169,0.00026206503],"domain_scores_gemma":[0.9978574,0.00013307668,0.0007415513,0.00045633042,0.0007242629,0.000087412816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008164566,0.0002536834,0.00028324628,0.0003132776,0.0005308171,0.00034640508,0.0028068065,0.00004836078,0.00016526751],"category_scores_gemma":[0.00071267335,0.00020532518,0.00004754514,0.000704211,0.00024987047,0.00069351314,0.002276238,0.0005069258,0.0000065286167],"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.00017069491,0.00015478954,0.0002946992,0.00002659455,0.000049850307,0.000001410896,0.00089434657,0.19621237,0.0006046304,0.79889274,0.00009473519,0.0026031146],"study_design_scores_gemma":[0.00008031698,0.0003419294,0.0000650617,0.00023214784,0.000019211775,0.00004070611,0.00039192147,0.9717849,0.0056125335,0.021090146,0.00009443514,0.00024670045],"about_ca_topic_score_codex":0.000019613899,"about_ca_topic_score_gemma":0.0000022936595,"teacher_disagreement_score":0.9503714,"about_ca_system_score_codex":0.00012128705,"about_ca_system_score_gemma":0.00008575557,"threshold_uncertainty_score":0.8372918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008247299,0.000008993653,0.97940165,0.0062986608,0.0016079972,0.00091969006,0.000009448588,0.0001949413,0.0033113337],"genre_scores_gemma":[0.97630024,0.000024101902,0.022325302,0.00038080462,0.00014667677,0.00023523114,0.000009193174,0.00003064173,0.000547786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959245,0.000063216896,0.0010496606,0.0007488555,0.0016286838,0.00058513193],"domain_scores_gemma":[0.99623996,0.0008829917,0.0012942046,0.0003014569,0.0011540003,0.00012738498],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012518751,0.00037159008,0.00040265374,0.00034375172,0.0014191092,0.00048028215,0.0031239039,0.000098638164,0.00032423984],"category_scores_gemma":[0.0038223201,0.00033511524,0.00032992358,0.00060868467,0.00023148328,0.0003124301,0.0017881575,0.001414028,0.0000368409],"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.00008984858,0.00007589168,0.00028601644,0.000021537076,0.000046221132,4.4136118e-7,0.0017023822,0.49395838,0.0008564221,0.5012636,0.000032299202,0.0016669213],"study_design_scores_gemma":[0.000111583715,0.00073078024,0.00013155253,0.00027044574,0.000021287853,0.000008293553,0.0016750226,0.93361866,0.015372938,0.045462817,0.0022453764,0.00035124822],"about_ca_topic_score_codex":0.000048633163,"about_ca_topic_score_gemma":0.0000019798913,"teacher_disagreement_score":0.968053,"about_ca_system_score_codex":0.0004472782,"about_ca_system_score_gemma":0.00016318554,"threshold_uncertainty_score":0.9999101},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47765535,0.00023829212,0.1961561,0.28053463,0.016079454,0.0025763593,0.00013195859,0.00034116386,0.02628672],"genre_scores_gemma":[0.9969448,0.000043,0.0019449391,0.00059395033,0.00025173638,0.000046756715,0.0000029112414,0.000019028634,0.00015291097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640155,0.00010278583,0.00084292376,0.0005588143,0.001790354,0.00030354707],"domain_scores_gemma":[0.9970554,0.0003535785,0.0011179079,0.0005046102,0.0009165342,0.000051928866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015952181,0.00028520654,0.0002785686,0.00018827738,0.00087447127,0.00017660628,0.004958783,0.00006627374,0.00019386836],"category_scores_gemma":[0.0006554149,0.00016712892,0.0002469606,0.0006563897,0.0002761502,0.00037374365,0.0021034933,0.0013313831,0.000011108861],"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.00014337189,0.00035442237,0.000050554045,0.000016445374,0.000039772014,9.719765e-7,0.004188723,0.08095767,0.0009719567,0.88408697,0.0002445393,0.028944602],"study_design_scores_gemma":[0.000072494244,0.0004333016,0.00035349478,0.00027959386,0.000016330896,0.000017460558,0.005796434,0.8247341,0.012467535,0.15440352,0.0011829617,0.0002427671],"about_ca_topic_score_codex":0.000056978904,"about_ca_topic_score_gemma":0.000027645809,"teacher_disagreement_score":0.74377644,"about_ca_system_score_codex":0.00020971526,"about_ca_system_score_gemma":0.00011438604,"threshold_uncertainty_score":0.92147344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36097944,0.000032631502,0.48582655,0.0744604,0.0076084533,0.0017409546,0.00009446442,0.00061441795,0.06864268],"genre_scores_gemma":[0.9958848,0.0000148057425,0.003324556,0.00040330287,0.00005382925,0.000054935586,0.0000024118979,0.000011463339,0.0002498987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972506,0.00003678702,0.00061330287,0.00051648123,0.0012959458,0.00028686883],"domain_scores_gemma":[0.9983719,0.000083094266,0.00036953474,0.00026442687,0.0008223559,0.00008870841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075213093,0.00020183089,0.00019434959,0.0003991464,0.00060756976,0.00025220175,0.0021299082,0.000047007696,0.0008192682],"category_scores_gemma":[0.00021422969,0.0001721311,0.00018613899,0.00090144906,0.00021348256,0.00018378023,0.0010381965,0.00050472806,0.000060824943],"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.000055041593,0.00021770032,0.00034030696,0.000010861048,0.000029244628,0.0000010968536,0.0013144468,0.049334265,0.005625276,0.92622703,0.00018393285,0.016660789],"study_design_scores_gemma":[0.00008433239,0.00019315496,0.0013949936,0.00008246358,0.000009289601,0.000037808368,0.0015835852,0.85377413,0.08577254,0.056286786,0.00046520407,0.00031574434],"about_ca_topic_score_codex":0.000054237895,"about_ca_topic_score_gemma":0.000009055361,"teacher_disagreement_score":0.8699403,"about_ca_system_score_codex":0.00020302803,"about_ca_system_score_gemma":0.00013194353,"threshold_uncertainty_score":0.89704126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16028774,0.000029042436,0.8333516,0.0022161948,0.0022961926,0.0009441171,0.00007860959,0.000045136196,0.00075138715],"genre_scores_gemma":[0.9579263,0.000082811755,0.041425873,0.0001890548,0.00004492021,0.00021126495,0.0000041975004,0.000016886794,0.00009871841],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99638003,0.00004099526,0.0012304104,0.0008024734,0.001094494,0.00045161045],"domain_scores_gemma":[0.99739313,0.00020202884,0.0009914219,0.00039342427,0.0009160064,0.0001039839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013719088,0.00033529513,0.00054123445,0.0005204214,0.0002981517,0.000122412,0.0033077195,0.000095076844,0.00023187541],"category_scores_gemma":[0.00032552143,0.00029857183,0.00035897712,0.0010750786,0.00026858013,0.00047214673,0.0010320562,0.0004816988,0.00000871383],"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.0004654154,0.0008653856,0.0012671191,0.00017210627,0.00016809597,0.0000039228507,0.0048668818,0.0012391458,0.0818725,0.8920283,0.00008321132,0.016967941],"study_design_scores_gemma":[0.00022822579,0.0004465786,0.011966397,0.00032344964,0.00006343002,0.0000145609965,0.00096995605,0.33396596,0.34655952,0.3048327,0.00008970201,0.0005395171],"about_ca_topic_score_codex":0.00030049897,"about_ca_topic_score_gemma":0.00012837395,"teacher_disagreement_score":0.79763854,"about_ca_system_score_codex":0.00018892947,"about_ca_system_score_gemma":0.00018120847,"threshold_uncertainty_score":0.99994665},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8667615,0.00003287818,0.0029638796,0.007921987,0.0011247179,0.00067224796,0.00014112347,0.0000743816,0.12030727],"genre_scores_gemma":[0.9981581,0.000004940795,0.00013898154,0.00026062466,0.0000927329,0.00008916231,0.0000057076268,0.000021479687,0.0012282678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981856,0.00002049106,0.0007739535,0.00047476424,0.00030622474,0.00023900894],"domain_scores_gemma":[0.99841976,0.00006486412,0.0009976908,0.0001925195,0.00026764505,0.00005750262],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001281589,0.00019216804,0.00028322375,0.00024434348,0.00040679582,0.00010929855,0.0010067903,0.000046475543,0.0009787054],"category_scores_gemma":[0.00028841835,0.0001664514,0.00012761321,0.0003794264,0.00019463956,0.000080040554,0.0003159043,0.00037631922,0.0001638518],"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.00023229746,0.0002287319,0.0013558089,0.000026491873,0.00005719374,6.2506933e-7,0.0028236576,0.011781018,0.00052822946,0.9824851,0.00017123483,0.0003095997],"study_design_scores_gemma":[0.0004169205,0.0014295011,0.005991605,0.00084207504,0.000044756012,0.00007570808,0.021961482,0.37547633,0.07482091,0.49737105,0.020221898,0.0013477538],"about_ca_topic_score_codex":0.00009567949,"about_ca_topic_score_gemma":0.0000062172116,"teacher_disagreement_score":0.48511407,"about_ca_system_score_codex":0.00024074773,"about_ca_system_score_gemma":0.000030474335,"threshold_uncertainty_score":0.99993455},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6145471,0.000051340474,0.3445906,0.019158337,0.009397382,0.0016997094,0.00015146824,0.00052467006,0.009879447],"genre_scores_gemma":[0.98894346,0.000011824195,0.010309176,0.00026756755,0.0002774105,0.000057057427,0.000005111072,0.00002151678,0.000106869586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661595,0.000027064707,0.00086372916,0.00073327374,0.0013820173,0.0003779528],"domain_scores_gemma":[0.99753976,0.00013957782,0.0009974879,0.00028578276,0.00093530025,0.00010209321],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057592854,0.00030017362,0.00026065097,0.00034847175,0.0007863108,0.00021620188,0.002084774,0.000097072574,0.00017885896],"category_scores_gemma":[0.00038886117,0.00026495906,0.00020697303,0.00073506264,0.00023269208,0.0011885678,0.0012602911,0.0010183717,0.000018201421],"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.00013053669,0.0002410283,0.0004864713,0.00001825518,0.00005621496,0.0000022838715,0.0011248146,0.031212255,0.057886258,0.85807586,0.000062650026,0.050703395],"study_design_scores_gemma":[0.00008895725,0.00023077638,0.0030899888,0.00014776905,0.00001769322,0.000053814234,0.0007006322,0.6711453,0.08130223,0.24250555,0.00035307067,0.00036418674],"about_ca_topic_score_codex":0.000081530794,"about_ca_topic_score_gemma":0.000008727624,"teacher_disagreement_score":0.63993305,"about_ca_system_score_codex":0.00039371257,"about_ca_system_score_gemma":0.00015785468,"threshold_uncertainty_score":0.9999803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8170314,0.00019842053,0.003994198,0.033487804,0.0039771833,0.0010517391,0.000035484758,0.00014362286,0.14008017],"genre_scores_gemma":[0.9989683,0.000081187085,0.0003758703,0.00011071526,0.000055869867,0.000060741797,7.833879e-7,0.000007969677,0.0003385673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752367,0.000052371917,0.0007871802,0.0004308652,0.0009056237,0.00030030232],"domain_scores_gemma":[0.9980542,0.00022334387,0.0006678836,0.00030584814,0.0006942401,0.00005446096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348851,0.00019721872,0.00025660993,0.00016978414,0.0003693053,0.00021187878,0.0035728998,0.00004951712,0.00010148501],"category_scores_gemma":[0.0004602357,0.00013123706,0.0001716224,0.00063889317,0.00032908804,0.00028046442,0.0009523003,0.0004936241,0.000019093592],"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.00006979855,0.00023874997,0.00088324025,0.000016521577,0.000019967809,9.760817e-7,0.0016222491,0.00040120078,0.0031789453,0.98702514,0.000087496664,0.006455701],"study_design_scores_gemma":[0.00007892691,0.00031504562,0.0029667118,0.00015865838,0.000007977921,0.000015339754,0.0034924487,0.10089709,0.12314298,0.7679569,0.00070234697,0.00026557143],"about_ca_topic_score_codex":0.00014132114,"about_ca_topic_score_gemma":0.00012278683,"teacher_disagreement_score":0.21906824,"about_ca_system_score_codex":0.0001500947,"about_ca_system_score_gemma":0.00017216896,"threshold_uncertainty_score":0.66393965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95528215,0.00003731286,0.0010357513,0.0027525541,0.00096656807,0.00034392258,0.000052928583,0.00003815702,0.039490625],"genre_scores_gemma":[0.99908,0.000009461294,0.00012243024,0.00009441961,0.00007826509,0.000087268876,0.000003051771,0.000014777206,0.000510332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822366,0.00001707346,0.00087465177,0.0004263392,0.00022657712,0.00023171777],"domain_scores_gemma":[0.99872863,0.00006091689,0.00088631455,0.0001293526,0.00015583994,0.000038965583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012338449,0.00016997321,0.00029821755,0.0002918307,0.0002461613,0.0001038623,0.00087759,0.000044326236,0.00066742237],"category_scores_gemma":[0.0002998386,0.00014591705,0.00009598371,0.00039689548,0.00014133494,0.00022679713,0.00023927729,0.0004091088,0.000064843465],"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.00015572143,0.00018219925,0.04531852,0.00002790823,0.00002275791,6.3465654e-7,0.0017450027,0.0014667861,0.00028184403,0.94957083,0.000023735513,0.0012040668],"study_design_scores_gemma":[0.000254733,0.0008320666,0.024732443,0.0007005614,0.000013167877,0.000031906216,0.008843597,0.0351612,0.03040201,0.8964431,0.0018222921,0.00076289015],"about_ca_topic_score_codex":0.00028100895,"about_ca_topic_score_gemma":0.000084010935,"teacher_disagreement_score":0.05312769,"about_ca_system_score_codex":0.00022198724,"about_ca_system_score_gemma":0.000028892802,"threshold_uncertainty_score":0.7307807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98057896,0.000042448195,0.008094307,0.0010316657,0.0005475859,0.00055382727,0.00002412587,0.00011488724,0.009012214],"genre_scores_gemma":[0.9993318,0.000023673729,0.00042980065,0.00003244286,0.00001799713,0.00011419814,0.0000104198825,0.000017381863,0.00002233143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982736,0.000014583543,0.0005310965,0.00027900186,0.00067681656,0.0002248634],"domain_scores_gemma":[0.9991395,0.00006726505,0.000275998,0.00007887754,0.00039687904,0.000041515756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033136827,0.00021213594,0.00021863697,0.00036093994,0.00020177486,0.00010564631,0.000428016,0.000042607877,0.00010879575],"category_scores_gemma":[0.000073426585,0.00017449187,0.000112855814,0.00062611117,0.00014364877,0.0003676817,0.00005378413,0.0004113777,0.000008483973],"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.0004143548,0.00024447904,0.00031899207,0.00007809747,0.00009544698,0.000001942053,0.0026164886,0.58172774,0.009161475,0.40151715,0.00007035226,0.0037534537],"study_design_scores_gemma":[0.00015539117,0.00034857594,0.006151176,0.0002626101,0.000021965894,0.000011997722,0.010992461,0.86086154,0.021556001,0.099361,0.000014131292,0.00026312494],"about_ca_topic_score_codex":0.00007217968,"about_ca_topic_score_gemma":0.00010432472,"teacher_disagreement_score":0.30215615,"about_ca_system_score_codex":0.0005012899,"about_ca_system_score_gemma":0.000066688786,"threshold_uncertainty_score":0.7115572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64714396,0.00002653616,0.07983638,0.0927524,0.004219286,0.0019887963,0.00038448125,0.00035048794,0.17329766],"genre_scores_gemma":[0.9966766,0.000006042925,0.00055052224,0.00025448902,0.00011947704,0.00019323103,0.0000031649981,0.000016804535,0.0021796254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958092,0.00003760279,0.0010244204,0.00064897054,0.0022102064,0.00026958995],"domain_scores_gemma":[0.9967907,0.00031750088,0.0009913285,0.0003883637,0.0014051602,0.00010693657],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001754755,0.0002351876,0.00027551615,0.00037652737,0.001273869,0.0003308087,0.0021397609,0.000050933624,0.004766377],"category_scores_gemma":[0.0010008415,0.00015928835,0.00020315738,0.0010944194,0.00064058753,0.00026079276,0.0005259673,0.00055274146,0.00019429327],"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.00028795144,0.00043281773,0.0001927119,0.000004688679,0.000036100224,7.5491363e-7,0.001441413,0.01590298,0.003862886,0.9682423,0.00068178505,0.008913605],"study_design_scores_gemma":[0.00009152026,0.0003260812,0.002588292,0.00009608018,0.00003024122,0.00007850454,0.024301292,0.040786743,0.104705915,0.81590843,0.0106593,0.00042759292],"about_ca_topic_score_codex":0.000054123924,"about_ca_topic_score_gemma":0.000040303734,"teacher_disagreement_score":0.34953266,"about_ca_system_score_codex":0.00016459533,"about_ca_system_score_gemma":0.00014320787,"threshold_uncertainty_score":0.9961434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.663126,0.0005853973,0.066825025,0.060105637,0.00714195,0.0019800193,0.00011136262,0.00044326545,0.19968136],"genre_scores_gemma":[0.997519,0.00008788887,0.001717169,0.00024926534,0.00006973682,0.00004209221,0.0000011644091,0.000009902855,0.0003037674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977382,0.00002901946,0.0006730154,0.0005000567,0.00078380835,0.0002758934],"domain_scores_gemma":[0.9981763,0.00012198706,0.0006588581,0.00024646637,0.0007143735,0.000082062405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007980685,0.00021430076,0.00029872995,0.00021662026,0.00032575135,0.0001330609,0.0023477147,0.000057602832,0.00018612166],"category_scores_gemma":[0.00040188152,0.0001667285,0.00015301215,0.00043086868,0.00028843665,0.00028759756,0.0015967484,0.00039342578,0.000023315399],"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.00004716549,0.00024124044,0.00066479354,0.000036993333,0.000030091924,0.0000010043507,0.001923107,0.00006697294,0.010243041,0.97528636,0.00014721535,0.011311992],"study_design_scores_gemma":[0.00008775125,0.00052140834,0.0011917189,0.00020005216,0.000016393415,0.000056735014,0.0013883131,0.045190625,0.13966726,0.81076515,0.0006096979,0.00030488014],"about_ca_topic_score_codex":0.00006763719,"about_ca_topic_score_gemma":0.000016271712,"teacher_disagreement_score":0.33439302,"about_ca_system_score_codex":0.000108818684,"about_ca_system_score_gemma":0.00011071397,"threshold_uncertainty_score":0.6798991},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27769917,0.00006217356,0.68523836,0.011138016,0.0037183024,0.0035724146,0.00016824638,0.0043914635,0.014011808],"genre_scores_gemma":[0.9953892,0.000035131692,0.0038253071,0.00012422827,0.000068575,0.00041715856,0.000016893577,0.000041613297,0.000081859194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820393,0.000010040166,0.0005041491,0.00035351017,0.0006391111,0.00028925372],"domain_scores_gemma":[0.9990584,0.00008733318,0.00019956047,0.00012660386,0.00046599092,0.00006207594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045485777,0.00025520712,0.00022131532,0.0003276103,0.0005206013,0.00011470599,0.00074210606,0.000052518233,0.00013589533],"category_scores_gemma":[0.00015783412,0.00020900754,0.00016145472,0.00043021564,0.000117703334,0.00017327783,0.0001496924,0.00043102517,0.0000052073883],"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.00029982172,0.0002226436,0.00007984845,0.0001544981,0.00008786909,9.955357e-7,0.0009818497,0.92401505,0.00063007395,0.047018018,0.002254851,0.024254462],"study_design_scores_gemma":[0.000120292505,0.0005058163,0.000048814425,0.00024898018,0.00002771336,0.0000063774896,0.0011939758,0.9767705,0.014093128,0.0027505083,0.0039901626,0.00024373476],"about_ca_topic_score_codex":0.000013011098,"about_ca_topic_score_gemma":0.000045875495,"teacher_disagreement_score":0.71769005,"about_ca_system_score_codex":0.00016777415,"about_ca_system_score_gemma":0.000030193047,"threshold_uncertainty_score":0.85230803},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051292576,0.000007896906,0.9309913,0.013086185,0.0003810738,0.0006020953,0.00000548679,0.0001485206,0.0034848636],"genre_scores_gemma":[0.9864537,0.00004285971,0.011439752,0.00021833966,0.0001262527,0.000106459265,0.0000052773867,0.000032689783,0.0015746626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743134,0.000040892857,0.0006186008,0.0005849238,0.0008768204,0.00044743464],"domain_scores_gemma":[0.9984489,0.00021675284,0.00041897278,0.00017857504,0.0006368375,0.00009993421],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084775646,0.000297853,0.0003013169,0.0004983012,0.0010497103,0.00048490995,0.0016475341,0.00006740851,0.000027047416],"category_scores_gemma":[0.0008066078,0.00025038753,0.00013319415,0.0007033254,0.00021755892,0.00048941054,0.00071470166,0.000847212,0.000007447737],"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.000113680886,0.0000744414,0.00071289844,0.000054042437,0.00005245817,7.8346557e-7,0.0033186143,0.23830922,0.0040938915,0.74490744,0.000008712052,0.008353806],"study_design_scores_gemma":[0.00015897055,0.00062808197,0.00029019633,0.00017616605,0.00001499808,0.00003937485,0.0028118084,0.96819305,0.01287531,0.013903801,0.0005953997,0.0003128481],"about_ca_topic_score_codex":0.00019270723,"about_ca_topic_score_gemma":0.000028474604,"teacher_disagreement_score":0.9351611,"about_ca_system_score_codex":0.00045203118,"about_ca_system_score_gemma":0.00022592291,"threshold_uncertainty_score":0.9999948},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12958995,0.00001730045,0.81050545,0.049817447,0.0018233759,0.0019891604,0.00008509158,0.00031787768,0.005854378],"genre_scores_gemma":[0.9716387,0.00002807277,0.0258781,0.0012168366,0.00014648006,0.00044835467,0.000005503791,0.000026002082,0.00061198033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660635,0.00002552993,0.0008549038,0.0008216781,0.0012909092,0.000400643],"domain_scores_gemma":[0.99793506,0.00010182395,0.0005617261,0.00043619535,0.0008170667,0.00014811366],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000501606,0.00028742693,0.00029724577,0.00032333544,0.0005894069,0.00025146303,0.0032762287,0.000055333174,0.00012826141],"category_scores_gemma":[0.00020466342,0.0002732318,0.00017853807,0.00095000723,0.000108110115,0.0006035674,0.0016195336,0.0005158938,0.000116026575],"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.000114904135,0.00038645745,0.000051097082,0.000022087392,0.00003713773,3.7431113e-7,0.0017695931,0.05661092,0.23814102,0.67554784,0.00034517323,0.0269734],"study_design_scores_gemma":[0.00005659283,0.00018563197,0.00008850235,0.000058487472,0.0000127341955,0.00000601797,0.00050214067,0.6279014,0.210611,0.16014177,0.0001754122,0.0002603649],"about_ca_topic_score_codex":0.000040186093,"about_ca_topic_score_gemma":0.000013726324,"teacher_disagreement_score":0.8420487,"about_ca_system_score_codex":0.00034872344,"about_ca_system_score_gemma":0.00012013441,"threshold_uncertainty_score":0.999972},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702889,0.000034209108,0.000008970947,0.0069898944,0.0010085567,0.0003897165,0.000011830845,0.000024275163,0.021243695],"genre_scores_gemma":[0.9990407,0.0002572643,0.000085409985,0.000070945774,0.00007770481,0.00019006744,8.5174946e-7,0.000011521677,0.00026552012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.9980742,0.000049001777,0.0006234279,0.0002820163,0.00071993977,0.00025142796],"domain_scores_gemma":[0.99879116,0.00014017192,0.00061457907,0.00010062084,0.0003149247,0.000038523358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054995,0.00014378058,0.00021465521,0.00016247305,0.00077866885,0.00007126462,0.0012223661,0.000026690635,0.0002901183],"category_scores_gemma":[0.00062212726,0.00011259237,0.00013201372,0.00035709774,0.00048102267,0.0002787067,0.0007139215,0.00047525862,0.000014683594],"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.00011807219,0.00031056345,0.0137039265,0.000010567263,0.000028727869,3.6869577e-7,0.054911308,0.006313863,0.0071584354,0.90416664,0.000029509516,0.013248022],"study_design_scores_gemma":[0.00018076372,0.00050339673,0.019247318,0.000563819,0.00003558382,0.0000040881855,0.47212368,0.008036233,0.44878358,0.047081508,0.0027940117,0.0006460294],"about_ca_topic_score_codex":0.0030076788,"about_ca_topic_score_gemma":0.0009453815,"teacher_disagreement_score":0.8570851,"about_ca_system_score_codex":0.00041953838,"about_ca_system_score_gemma":0.00007799457,"threshold_uncertainty_score":0.598897},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027742777,0.000019632878,0.9821184,0.0040712096,0.001224599,0.0012089163,0.00007907655,0.00009144878,0.008412403],"genre_scores_gemma":[0.99307096,0.00002222146,0.005763755,0.00029122847,0.00006864932,0.0003007422,0.000022356278,0.0000163328,0.00044374683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752116,0.00004014661,0.0008203923,0.0005243299,0.00082501565,0.00026896235],"domain_scores_gemma":[0.9979904,0.00014413046,0.0006644745,0.0002202211,0.00091426243,0.000066474255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183788,0.00022159198,0.00026186614,0.00038772743,0.0003567881,0.00036970066,0.0018542273,0.00005619201,0.00009614734],"category_scores_gemma":[0.00040113393,0.00019188247,0.00012909336,0.00067990605,0.00012642499,0.0006450772,0.00033009375,0.0002631533,0.000011153466],"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.00014391262,0.00022291699,0.00008596377,0.000027503791,0.000029277873,6.327763e-7,0.0036922917,0.05714385,0.0027262776,0.9310064,0.00038245678,0.0045385673],"study_design_scores_gemma":[0.00011108929,0.00023399942,0.00005116276,0.00010526902,0.000009501875,0.000004809811,0.006844384,0.9449387,0.012788038,0.034315005,0.0003885066,0.00020951539],"about_ca_topic_score_codex":0.00013010368,"about_ca_topic_score_gemma":0.000033733224,"teacher_disagreement_score":0.99029666,"about_ca_system_score_codex":0.00028345603,"about_ca_system_score_gemma":0.0001983543,"threshold_uncertainty_score":0.78247404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97862864,0.00001414069,0.0070413817,0.0035001466,0.00042172323,0.0005469521,0.000043472326,0.00006263133,0.009740941],"genre_scores_gemma":[0.999175,0.000004943229,0.00033803075,0.00010257898,0.0001122339,0.0001457581,0.000007186738,0.00001622005,0.00009801125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982013,0.000032979573,0.00060480443,0.00040957128,0.00050362677,0.00024773355],"domain_scores_gemma":[0.99898314,0.00010197307,0.00041448828,0.0001502334,0.00029816813,0.000051999665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060011767,0.00021246575,0.00029432576,0.00029129756,0.0003247825,0.00013192096,0.0006645803,0.000033831537,0.0007453682],"category_scores_gemma":[0.000061908904,0.00018606766,0.00016676125,0.00042589215,0.00016035666,0.00015620323,0.00041230433,0.000436586,0.0000061643455],"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.0018190383,0.0016096457,0.05973791,0.00006270224,0.00022365461,0.0000021659189,0.0017661513,0.0050996724,0.06422441,0.55745864,0.00036201382,0.307634],"study_design_scores_gemma":[0.0003665304,0.00034559786,0.0049437415,0.00020857836,0.0000560497,0.0000044940557,0.0021784094,0.42037195,0.3875403,0.18256293,0.0009600883,0.00046131655],"about_ca_topic_score_codex":0.0006699635,"about_ca_topic_score_gemma":0.00017265353,"teacher_disagreement_score":0.4152723,"about_ca_system_score_codex":0.00012587303,"about_ca_system_score_gemma":0.00004527215,"threshold_uncertainty_score":0.8161259},"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":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8867783,0.00026252912,0.0005846254,0.06315984,0.0018244993,0.0012215873,0.000497505,0.00008576691,0.045585368],"genre_scores_gemma":[0.9980321,0.0011011044,0.0002480062,0.0001413266,0.00008492994,0.00001982335,0.0000060831417,0.000020898573,0.00034575543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515426,0.00032055491,0.0011429397,0.00043892456,0.0025321862,0.0004111553],"domain_scores_gemma":[0.9931941,0.0016418301,0.0014020492,0.00016646807,0.0034456416,0.00014992495],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.011108829,0.00022606745,0.00043997695,0.00020267759,0.0012452467,0.00017996658,0.0015508621,0.00021480212,0.0007351761],"category_scores_gemma":[0.022073124,0.00020681985,0.00017635919,0.0007940421,0.0020165744,0.00036747026,0.0006768326,0.0024292618,0.0000060634907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049246463,0.00036770361,0.0018170772,0.00007910432,0.000074679214,9.177916e-7,0.03154921,0.00042563537,0.004904335,0.94355994,0.000042898646,0.016686045],"study_design_scores_gemma":[0.00009940377,0.0010641465,0.020792522,0.00080119923,0.00005230007,0.000004567552,0.07063801,0.017579224,0.1103986,0.7765636,0.0012958681,0.0007105704],"about_ca_topic_score_codex":0.018976621,"about_ca_topic_score_gemma":0.005576087,"teacher_disagreement_score":0.16699633,"about_ca_system_score_codex":0.00023177116,"about_ca_system_score_gemma":0.0007280247,"threshold_uncertainty_score":0.99987215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811683,0.0000057602733,0.0032567086,0.004559177,0.0006545362,0.00031565977,0.00020476796,0.00006411344,0.009770922],"genre_scores_gemma":[0.99790096,0.000009561635,0.0012787859,0.00022749297,0.000110070534,0.000032422842,0.000015075209,0.000018143677,0.000407484],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974546,0.000023811639,0.00046771343,0.00057271024,0.0011633823,0.00031781447],"domain_scores_gemma":[0.9991102,0.000038775128,0.0004169679,0.0003218074,0.000033352404,0.00007887072],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009063198,0.00020374762,0.00017765869,0.000058360696,0.0007296106,0.000064488944,0.0017573403,0.000042075273,0.0021513468],"category_scores_gemma":[0.00012103895,0.0001628451,0.00007237535,0.0002487059,0.0003329319,0.00041030074,0.002441691,0.00044313472,0.000076184406],"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.0035805032,0.0069247494,0.38336876,0.0001507413,0.00047295706,0.000019622496,0.030274853,0.1280022,0.15532136,0.1521239,0.005124922,0.13463545],"study_design_scores_gemma":[0.000554459,0.0015282979,0.11070499,0.0007394729,0.00014614481,0.00018566636,0.041496176,0.4496984,0.3219633,0.04763918,0.023248928,0.002094974],"about_ca_topic_score_codex":0.00017211618,"about_ca_topic_score_gemma":0.00007041015,"teacher_disagreement_score":0.3216962,"about_ca_system_score_codex":0.00040465518,"about_ca_system_score_gemma":0.000020572706,"threshold_uncertainty_score":0.9987608},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041611474,0.000036105554,0.9584076,0.028673131,0.003408341,0.0009032183,0.00006852354,0.00021523704,0.00412672],"genre_scores_gemma":[0.9508177,0.000022756358,0.047003005,0.0011508138,0.00024235938,0.0002995488,0.000007329377,0.000027724154,0.00042873435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693286,0.000028674529,0.000694854,0.0007677963,0.0011357393,0.00044005885],"domain_scores_gemma":[0.9977078,0.00024569855,0.0007396684,0.00031922702,0.00089479017,0.00009282678],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007169173,0.00031924108,0.00030631718,0.00033626257,0.0008014731,0.00032184695,0.003163429,0.00008501043,0.00010784003],"category_scores_gemma":[0.00038594657,0.00027848364,0.0003215413,0.0007680563,0.00016670655,0.0006675531,0.0014079626,0.00068349735,0.000010401825],"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.00016483928,0.00017084487,0.000111309695,0.000035915367,0.000061614635,0.000001287913,0.0012155378,0.039544176,0.007597846,0.9411551,0.0009171348,0.00902443],"study_design_scores_gemma":[0.00008079018,0.00013751684,0.00023728961,0.00013289887,0.000011006967,0.000028011196,0.00032765078,0.6578476,0.011446864,0.32809186,0.0013782146,0.00028033918],"about_ca_topic_score_codex":0.000018357441,"about_ca_topic_score_gemma":0.000017090946,"teacher_disagreement_score":0.9466566,"about_ca_system_score_codex":0.00022705099,"about_ca_system_score_gemma":0.00010452346,"threshold_uncertainty_score":0.99996674},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049291677,0.000019406623,0.98176986,0.0073771947,0.0036442294,0.00065596984,0.000013800249,0.00013416738,0.0014561902],"genre_scores_gemma":[0.9612236,0.000009078177,0.037589237,0.000533051,0.00029663523,0.00020631013,0.00000457073,0.00002644672,0.000111057874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694824,0.00004068399,0.0007738899,0.0007010332,0.0010259448,0.00051018177],"domain_scores_gemma":[0.9980134,0.00021173003,0.00071772636,0.00027411527,0.0006742162,0.000108838576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010942972,0.000306333,0.00032695683,0.00024236974,0.0008641601,0.00030732746,0.003288192,0.00006768921,0.0001442373],"category_scores_gemma":[0.00043903984,0.00026513435,0.00030503678,0.0005118047,0.00019501922,0.00045705837,0.0014940426,0.00077564275,0.0000061521228],"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.00007967687,0.0001718435,0.000072813986,0.000012161518,0.000052797284,0.000001934582,0.0030605919,0.14120966,0.00036824116,0.6054577,0.00008905474,0.24942352],"study_design_scores_gemma":[0.00009037032,0.00023578084,0.00007925704,0.00005841871,0.0000149850675,0.000026313546,0.0015031113,0.9399439,0.002967878,0.054357123,0.00045301282,0.00026982612],"about_ca_topic_score_codex":0.000038656515,"about_ca_topic_score_gemma":0.000011643374,"teacher_disagreement_score":0.9562944,"about_ca_system_score_codex":0.00030541432,"about_ca_system_score_gemma":0.0000756911,"threshold_uncertainty_score":0.9999801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8874677,0.00012020947,0.040187996,0.03653731,0.009322469,0.0019062902,0.00050966727,0.00014299013,0.023805384],"genre_scores_gemma":[0.9990324,0.000003894798,0.00010373497,0.00004501729,0.0003909027,0.00006860638,0.000008978515,0.000020610218,0.00032590432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975956,0.00003568163,0.0008640519,0.0003511342,0.00088330795,0.00027022298],"domain_scores_gemma":[0.99763143,0.00010231063,0.0013532655,0.00011142443,0.0007453399,0.000056220637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572334,0.00023889822,0.00043255155,0.00012736012,0.000617809,0.00025679872,0.0011204113,0.00006549291,0.00010258573],"category_scores_gemma":[0.000085897605,0.00020660344,0.0002574289,0.00035899613,0.00027176167,0.0001973715,0.00051136495,0.0006941971,0.0000029807543],"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.00007483882,0.0002693063,0.007728695,0.000032131724,0.00009003659,1.2756725e-7,0.0027834328,0.021145161,0.0016840858,0.9633548,0.0001869513,0.002650436],"study_design_scores_gemma":[0.00009576794,0.00020191191,0.00045810663,0.00033584313,0.000040159342,0.0000016126602,0.030238481,0.90252936,0.01541804,0.04947684,0.0007922483,0.00041163975],"about_ca_topic_score_codex":0.00032526415,"about_ca_topic_score_gemma":0.00001470235,"teacher_disagreement_score":0.91387796,"about_ca_system_score_codex":0.00011017372,"about_ca_system_score_gemma":0.00007740637,"threshold_uncertainty_score":0.8425044},"labels":[],"label_agreement":null}]}