{"meta":{"query_hash":"6a96cabb7b09","filters":{"venue":"International Conference on Artificial Intelligence"},"cohort_total":23,"direct_labels_cover":0,"predictions_cover":23,"exported":23,"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/6a96cabb7b09","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Conference+on+Artificial+Intelligence"},"results":[{"id":"W118337989","doi":"","title":"Generalized semi-infinite optimization and its application in robotics' path planning problem","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Motion planning; Robotics; Artificial intelligence; Computer science; Mathematical optimization; Path (computing); Optimization problem; Robot; Mathematics","score_opus":0.08382174438595084,"score_gpt":0.32904897130699107,"score_spread":0.2452272269210402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118337989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01449997,0.00059927936,0.9785759,0.00049517635,0.000069221736,0.000020848078,0.000050319366,0.00009707325,0.00559218],"genre_scores_gemma":[0.5772372,0.0013507323,0.41213068,0.00031156078,0.00018759392,0.00028697037,0.0002308849,0.0002381186,0.008026209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991709,0.00049128075,0.000029972862,0.00009889814,0.00016094447,0.000048045593],"domain_scores_gemma":[0.99719846,0.0021840967,0.00017299737,0.000103568476,0.00020337179,0.00013746921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021051802,0.0010039925,0.0016929134,0.0010346718,0.0007623364,0.0013474771,0.0016113083,0.0016308492,0.002317491],"category_scores_gemma":[0.0064159567,0.00060983654,0.0012912054,0.0015428293,0.0020737615,0.0017569512,0.00238568,0.0021094629,0.00021233637],"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.0000795916,0.000058397294,0.00027946822,0.00020304433,0.000051211147,0.00011342516,0.00011810998,0.72039425,0.0009787725,0.2525504,0.0016604634,0.023512885],"study_design_scores_gemma":[0.000006263126,0.000019676223,0.000054238233,0.000012238481,0.0000058310316,0.000017105926,0.000009283158,0.90722716,0.000126756,0.09196008,0.0005533247,0.000008105567],"about_ca_topic_score_codex":0.0034978513,"about_ca_topic_score_gemma":0.002825747,"teacher_disagreement_score":0.0034978513,"about_ca_system_score_codex":0.0008836578,"about_ca_system_score_gemma":0.0013025356,"threshold_uncertainty_score":0.011133373},"labels":[],"label_agreement":null},{"id":"W152011799","doi":"","title":"Arabic Handwriting Descriptor Using Gaussian Steerable Filters.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Handwritten Text Recognition Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Handwriting; Computer science; Artificial intelligence; Arabic; Gaussian; Pattern recognition (psychology); Speech recognition; Physics; Linguistics","score_opus":0.12022237629839307,"score_gpt":0.34422809891050804,"score_spread":0.224005722612115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W152011799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036329146,0.0014135684,0.94463986,0.00026356865,0.0005756668,0.00014992016,0.0011899155,0.0048911595,0.010547216],"genre_scores_gemma":[0.33731386,0.0018680801,0.61943644,0.0001899726,0.0002793246,0.0001821783,0.0033097325,0.00052202103,0.036898524],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974364,0.00003587107,0.000020897247,0.000058118974,0.00011094661,0.000030508456],"domain_scores_gemma":[0.99951935,0.000054582248,0.00004651282,0.00009122858,0.00024867628,0.00003965433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029585892,0.0006241686,0.00053031236,0.0015335623,0.00028911565,0.00088130636,0.00044269869,0.0006077045,0.0084087625],"category_scores_gemma":[0.0010853388,0.00018664708,0.00046843235,0.0014325994,0.00025418182,0.00088484155,0.0004914571,0.0005758763,0.006798301],"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.00039340576,0.000052006406,0.00047461805,0.00020135823,0.000043987748,0.00013703051,0.000056480418,0.0077543873,0.09555962,0.004036022,0.013806143,0.87748486],"study_design_scores_gemma":[0.00007256879,0.00044197583,0.010302357,0.00012171671,0.00013116446,0.0014270087,0.0003501183,0.664272,0.22496866,0.0052787648,0.09252099,0.00011271748],"about_ca_topic_score_codex":0.002504584,"about_ca_topic_score_gemma":0.0031877477,"teacher_disagreement_score":0.0084087625,"about_ca_system_score_codex":0.00022746502,"about_ca_system_score_gemma":0.00058057375,"threshold_uncertainty_score":0.028130114},"labels":[],"label_agreement":null},{"id":"W153785916","doi":"","title":"Using Encyclopaedic Knowledge for Query Classification.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Information retrieval; Natural language processing; Artificial intelligence","score_opus":0.2987819629349078,"score_gpt":0.4204165625896202,"score_spread":0.1216345996547124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153785916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28003564,0.016656993,0.32113162,0.005353436,0.0013968829,0.0030185303,0.22277123,0.03403124,0.115604356],"genre_scores_gemma":[0.53592604,0.0042339903,0.23983313,0.0008307671,0.00039716566,0.0006837456,0.20438951,0.000713864,0.012991825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978339,0.0003083941,0.0003383839,0.0004824578,0.0007933816,0.00024338953],"domain_scores_gemma":[0.9963934,0.0014150188,0.00026165033,0.00054243294,0.0011477283,0.0002396957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011635304,0.0010285489,0.0010278695,0.015434656,0.0009607936,0.0030059044,0.0012326521,0.0010656447,0.0110122],"category_scores_gemma":[0.0102892,0.00027520483,0.0010227005,0.0088241575,0.0003615602,0.0046863575,0.0016867443,0.00078813965,0.0056024683],"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.0010608318,0.0005907006,0.050836958,0.0018102566,0.00040852884,0.0010289743,0.001195634,0.004961011,0.018169926,0.008289326,0.10638099,0.80526674],"study_design_scores_gemma":[0.00024956354,0.0006404397,0.09181642,0.0014343986,0.0012391584,0.0047630267,0.008385314,0.27353856,0.050560307,0.042529456,0.52452946,0.00031391563],"about_ca_topic_score_codex":0.03224246,"about_ca_topic_score_gemma":0.04018201,"teacher_disagreement_score":0.03224246,"about_ca_system_score_codex":0.0013872002,"about_ca_system_score_gemma":0.002280605,"threshold_uncertainty_score":0.064109564},"labels":[],"label_agreement":null},{"id":"W16563081","doi":"10.1521/pedi.2006.20.1.81","title":"Evolutionary Computing for Fuzzy System Optimization in Intelligent Control.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Fuzzy Logic and Control Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Fuzzy control system; Intelligent control; Fuzzy logic; Evolutionary computation; Control (management); Distributed computing; Artificial intelligence","score_opus":0.06437064323099818,"score_gpt":0.3006360433241824,"score_spread":0.23626540009318425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16563081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004110718,0.0057828147,0.97759867,0.000597178,0.00028612025,0.00012475731,0.00010335822,0.0004892843,0.010907018],"genre_scores_gemma":[0.2770635,0.0046850997,0.6984801,0.00047809983,0.00041437382,0.00087158714,0.00042837675,0.00023005753,0.017348735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952257,0.00017675046,0.000041766703,0.00009677564,0.00012022669,0.00004181537],"domain_scores_gemma":[0.9991893,0.0005126463,0.0000514082,0.00007021316,0.00014485235,0.000031498323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022080243,0.0010586199,0.0015812417,0.0010239537,0.00052815006,0.0015536448,0.001313926,0.0016315574,0.0077733467],"category_scores_gemma":[0.0030331353,0.00052392826,0.0011708395,0.0012549064,0.00081419665,0.0008720833,0.001398005,0.0017439814,0.0014107326],"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.00009452535,0.000079542704,0.00095750066,0.000531604,0.00023447338,0.0001561499,0.00018399481,0.5911812,0.0011309099,0.099582076,0.00804763,0.2978203],"study_design_scores_gemma":[0.000017688299,0.000038928603,0.00020146657,0.00005840555,0.000022652803,0.00002891858,0.000027686852,0.958536,0.00020444299,0.033739645,0.0071139196,0.000010164396],"about_ca_topic_score_codex":0.006206099,"about_ca_topic_score_gemma":0.006010275,"teacher_disagreement_score":0.0077733467,"about_ca_system_score_codex":0.0012254711,"about_ca_system_score_gemma":0.0012639373,"threshold_uncertainty_score":0.026004434},"labels":[],"label_agreement":null},{"id":"W194540509","doi":"","title":"A Modeling for the Total Tardiness SMSDST Problem Using Constraint Programming.","year":2010,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Tardiness; Constraint programming; Computer science; Mathematical optimization; Constraint satisfaction; Constraint (computer-aided design); Concurrent constraint logic programming; Constraint logic programming; Programming language; Job shop scheduling; Stochastic programming; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","score_opus":0.1200230154725008,"score_gpt":0.34616627917207793,"score_spread":0.22614326369957713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194540509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011678531,0.0005872667,0.96734357,0.0010855694,0.00015811707,0.00028523436,0.0013949093,0.00026825943,0.01719866],"genre_scores_gemma":[0.36687016,0.0016161539,0.6079632,0.00044175325,0.00020436382,0.0009856331,0.0019427526,0.0003382356,0.019637644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987692,0.0004630358,0.00006481566,0.00020565712,0.00032089307,0.00017645309],"domain_scores_gemma":[0.99827874,0.0010624552,0.00019815819,0.0000977045,0.00023684672,0.00012617785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018196668,0.0010204677,0.0008971825,0.001011036,0.00077279954,0.0023670709,0.003432348,0.0014869416,0.0071311994],"category_scores_gemma":[0.0042697443,0.0007597708,0.0019303068,0.0020533146,0.0007352715,0.0018443571,0.0010775651,0.002145055,0.00084033347],"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.000046810277,0.00006316673,0.00030963597,0.00014271447,0.000036217985,0.00014444854,0.000060816987,0.9213902,0.0005215223,0.06383476,0.003657901,0.009791809],"study_design_scores_gemma":[0.000011997034,0.000016883812,0.000071488954,0.000019092824,0.000010916478,0.000033312863,0.00002847186,0.9801165,0.00013928892,0.016675536,0.002868297,0.0000081937205],"about_ca_topic_score_codex":0.044678174,"about_ca_topic_score_gemma":0.051695153,"teacher_disagreement_score":0.044678174,"about_ca_system_score_codex":0.0026688245,"about_ca_system_score_gemma":0.0049968455,"threshold_uncertainty_score":0.08883625},"labels":[],"label_agreement":null},{"id":"W2115815646","doi":"","title":"The confluence of human capital management and human resource management and the benefits of knowledge engineering","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Knowledge Management and Sharing","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Knowledge management; Human resource management; Competitive advantage; Human resource management system; Business; Context (archaeology); Human capital; Resource management (computing); Computer science; Marketing; Economics","score_opus":0.059890983782680256,"score_gpt":0.32232485235616715,"score_spread":0.2624338685734869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115815646","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15254563,0.03515598,0.08053907,0.102875404,0.0006509322,0.00013475525,0.00004931114,0.00012722223,0.6279217],"genre_scores_gemma":[0.9705184,0.008316306,0.012576752,0.002334107,0.00060199073,0.000077907134,0.000011364522,0.000019940258,0.0055431784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99450606,0.0030757026,0.00014147468,0.00027841592,0.0014037192,0.00059464964],"domain_scores_gemma":[0.9829624,0.012326259,0.0015829599,0.00086869666,0.0011561925,0.0011034317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005913751,0.00038599884,0.00032837223,0.0019069059,0.002097068,0.0084042745,0.0006576534,0.002059353,0.0026712473],"category_scores_gemma":[0.012968921,0.00021706705,0.00023947237,0.0022128199,0.014578117,0.010393738,0.004875075,0.0020257642,0.00030521883],"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.00004207037,0.00008474493,0.0039659706,0.00025918346,0.000028335173,0.000210966,0.0033796548,0.0009099519,0.0003359782,0.8863509,0.002408112,0.10202412],"study_design_scores_gemma":[0.000020202722,0.000100945814,0.013336341,0.0004810948,0.000024165314,0.00035384137,0.0052766753,0.0016354875,0.00075247453,0.91066945,0.06731128,0.000038091446],"about_ca_topic_score_codex":0.0019865476,"about_ca_topic_score_gemma":0.0026219934,"teacher_disagreement_score":0.0084042745,"about_ca_system_score_codex":0.002886843,"about_ca_system_score_gemma":0.0045193955,"threshold_uncertainty_score":0.031275272},"labels":[],"label_agreement":null},{"id":"W21360298","doi":"10.1007/s10654-011-9560-y","title":"Solving Temporal Constraints Using Neural Networks.","year":2002,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Travelling salesman problem; Artificial neural network; Computer science; Mathematical optimization; Constraint (computer-aided design); Constraint satisfaction problem; Hopfield network; Optimization problem; Focus (optics); Computation; Constraint satisfaction; Artificial intelligence; Algorithm; Mathematics","score_opus":0.15877285869559393,"score_gpt":0.3267786207031929,"score_spread":0.16800576200759898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21360298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021274824,0.0041882205,0.9582368,0.0017772872,0.00028900444,0.00017779527,0.0012294248,0.0028738999,0.009952655],"genre_scores_gemma":[0.44910702,0.0022710238,0.53579104,0.00065413467,0.00021974645,0.00087019434,0.0024119758,0.00037582678,0.008298968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.00014462869,0.000042229585,0.00014648277,0.00005653083,0.00005903118],"domain_scores_gemma":[0.99678326,0.0025869422,0.000199909,0.00014673421,0.00018796323,0.00009520799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012845204,0.0014058535,0.001084168,0.0010092537,0.0006816244,0.0017720745,0.001736898,0.0018176144,0.010339642],"category_scores_gemma":[0.0072955396,0.00073540886,0.0013625291,0.0012567837,0.0007164416,0.002428451,0.0017281651,0.0023338988,0.0011239444],"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.00021623551,0.00012569809,0.00219394,0.0005314558,0.00023573416,0.0001592831,0.000166538,0.69853735,0.0010853006,0.03507403,0.0068473173,0.25482702],"study_design_scores_gemma":[0.000011838541,0.000009311517,0.00011991229,0.000026515141,0.000016968637,0.00001822086,0.000017997938,0.9657856,0.00017749913,0.032592416,0.0012180458,0.000005703737],"about_ca_topic_score_codex":0.015889771,"about_ca_topic_score_gemma":0.024319774,"teacher_disagreement_score":0.015889771,"about_ca_system_score_codex":0.0013224706,"about_ca_system_score_gemma":0.0016762553,"threshold_uncertainty_score":0.03458959},"labels":[],"label_agreement":null},{"id":"W2200051882","doi":"","title":"Data sparseness in linear SVM","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Support vector machine; Computer science; Inference; Machine learning; Convergence (economics); Artificial intelligence; Data mining; Bayes' theorem; Pattern recognition (psychology); Bayesian probability","score_opus":0.3493317464406938,"score_gpt":0.4170538751309196,"score_spread":0.06772212869022581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200051882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021288866,0.0005033699,0.9762304,0.0006752763,0.000037403013,0.00004932426,0.000053994725,0.0002502894,0.0009111441],"genre_scores_gemma":[0.74558175,0.00080653385,0.25034326,0.0005979073,0.0002288789,0.0002752937,0.00043930055,0.00016357844,0.0015636231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99500424,0.0025680098,0.00023491548,0.0006884239,0.0013109832,0.00019327343],"domain_scores_gemma":[0.97117776,0.023786748,0.0012313395,0.0015054651,0.0019852968,0.00031340818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008235198,0.0005635389,0.0012512441,0.00080623303,0.0006420108,0.0015323756,0.0013104529,0.0014306279,0.001037855],"category_scores_gemma":[0.055404235,0.00064525154,0.00047749802,0.0011204472,0.0017994284,0.0029551226,0.0018024121,0.0027842673,0.00033069015],"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.00044421866,0.00015155492,0.006849531,0.0004290402,0.00010984618,0.00029342473,0.0003973904,0.7008481,0.004596523,0.121865146,0.004397065,0.15961815],"study_design_scores_gemma":[0.00000879397,0.00003098865,0.00026518502,0.000011908706,0.0000042983966,0.000049011604,0.000014127057,0.96733,0.00062655355,0.031364862,0.00028917193,0.0000051990364],"about_ca_topic_score_codex":0.0014978894,"about_ca_topic_score_gemma":0.00094119355,"teacher_disagreement_score":0.008235198,"about_ca_system_score_codex":0.0011194582,"about_ca_system_score_gemma":0.00083791115,"threshold_uncertainty_score":0.0435524},"labels":[],"label_agreement":null},{"id":"W2217140526","doi":"","title":"Modular systems with preferences","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rotation formalisms in three dimensions; Modular design; Formalism (music); Computer science; Preference; Theoretical computer science; Programming language; Artificial intelligence; Mathematics","score_opus":0.18571591018512967,"score_gpt":0.3284845900494835,"score_spread":0.14276867986435382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217140526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008321784,0.000152233,0.9828744,0.00036719305,0.000035281002,0.00007998884,0.0000725387,0.00028079058,0.007815885],"genre_scores_gemma":[0.32268423,0.0004008941,0.6684826,0.00034005955,0.0001593681,0.00037209154,0.00027361972,0.00010895597,0.007178182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965322,0.0012374826,0.00033999325,0.0006438056,0.00090266875,0.0003439129],"domain_scores_gemma":[0.9970433,0.0009820119,0.0003926918,0.0008641251,0.0004603365,0.0002574823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043375706,0.00072537136,0.0005240803,0.0015492965,0.0011434817,0.0026039665,0.0017094347,0.0010535391,0.0054561016],"category_scores_gemma":[0.006597974,0.00068980845,0.0018166112,0.0015556886,0.0024351268,0.006541499,0.005147651,0.0020336863,0.0010853491],"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.000018263569,0.000019284085,0.00024934823,0.000065877546,0.0000416818,0.00017044401,0.00034746545,0.009035399,0.0015195741,0.96707034,0.00070734863,0.020755002],"study_design_scores_gemma":[0.000028917144,0.00004900916,0.00016003172,0.0000404224,0.00005434663,0.00018737068,0.000119717246,0.053827003,0.0020219798,0.92471534,0.018769376,0.000026427342],"about_ca_topic_score_codex":0.0016016244,"about_ca_topic_score_gemma":0.0014736953,"teacher_disagreement_score":0.0054561016,"about_ca_system_score_codex":0.0010682436,"about_ca_system_score_gemma":0.001173872,"threshold_uncertainty_score":0.022939503},"labels":[],"label_agreement":null},{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","score_opus":0.2196141500131067,"score_gpt":0.3844458776644416,"score_spread":0.16483172765133491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230033167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036793336,0.00025912264,0.95682675,0.00028710207,0.000031821557,0.00010313538,0.000101035774,0.0003246814,0.0052729477],"genre_scores_gemma":[0.8025454,0.00035033183,0.19255942,0.00014656674,0.000032126143,0.00024591348,0.00025591376,0.00011698366,0.0037472793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.0003424017,0.00003494546,0.00013721359,0.00015642094,0.00010059173],"domain_scores_gemma":[0.99555826,0.003667763,0.00024289075,0.00018272178,0.00014003355,0.0002082907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016735706,0.0009428684,0.00086050987,0.0005359966,0.00060679094,0.00074292405,0.0013202834,0.0007561723,0.0038001847],"category_scores_gemma":[0.0068629296,0.00037555548,0.0006135935,0.0006007868,0.0013179007,0.0022330107,0.0015616571,0.0016636905,0.00031760507],"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.000056891546,0.000034040895,0.00031100994,0.000043067565,0.000016986647,0.00003356813,0.000062941624,0.95587784,0.00028183576,0.03057133,0.0007596906,0.011950762],"study_design_scores_gemma":[0.0000061581686,0.00001221078,0.00003210011,0.000002913566,0.0000026513828,0.0000056432223,0.00000684285,0.98370355,0.00007848453,0.015903499,0.00024336281,0.0000024837937],"about_ca_topic_score_codex":0.011898999,"about_ca_topic_score_gemma":0.0134569835,"teacher_disagreement_score":0.011898999,"about_ca_system_score_codex":0.0017909604,"about_ca_system_score_gemma":0.0018659463,"threshold_uncertainty_score":0.023659468},"labels":[],"label_agreement":null},{"id":"W2265246327","doi":"","title":"On the empirical time complexity of random 3-SAT at the phase transition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Satisfiability; DPLL algorithm; Scaling; Exponential function; Context (archaeology); Computer science; Boolean satisfiability problem; Solver; Time complexity; Constant (computer programming); Function (biology); Algorithm; Mathematics; Theoretical computer science; Mathematical optimization; Jitter","score_opus":0.3905235528133467,"score_gpt":0.397099776394029,"score_spread":0.006576223580682272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265246327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8347362,0.0102781225,0.12722325,0.003960146,0.00027656383,0.00017934572,0.0055419668,0.0030488945,0.014755573],"genre_scores_gemma":[0.95631385,0.0016872633,0.031108782,0.0004833915,0.00019706936,0.0002850509,0.007879261,0.000742244,0.0013029907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99509335,0.0017142291,0.00026308204,0.0013283456,0.0009951808,0.00060579856],"domain_scores_gemma":[0.9176026,0.067239165,0.0032663345,0.007892534,0.00291402,0.0010853399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051260698,0.00091243855,0.00092737476,0.0016720464,0.00086504087,0.0018665858,0.0017578128,0.0013802561,0.0031139646],"category_scores_gemma":[0.06872711,0.0006321257,0.0008590729,0.002784123,0.0021522667,0.0043696226,0.0015937376,0.003454671,0.0008396363],"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.0024237507,0.0008651401,0.064884104,0.0014380859,0.00043207302,0.00052133115,0.0008792125,0.6988919,0.014150541,0.07243251,0.033428375,0.10965289],"study_design_scores_gemma":[0.00011971708,0.0003465635,0.017877184,0.00013882286,0.000078995145,0.0004950469,0.00027777164,0.9227089,0.007785523,0.044953223,0.0051504676,0.000067790876],"about_ca_topic_score_codex":0.003854351,"about_ca_topic_score_gemma":0.0028373783,"teacher_disagreement_score":0.0051260698,"about_ca_system_score_codex":0.0020276515,"about_ca_system_score_gemma":0.0017740314,"threshold_uncertainty_score":0.027109623},"labels":[],"label_agreement":null},{"id":"W2266817871","doi":"","title":"An expectation-maximization algorithm to compute a stochastic factorization from data","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Stochastic matrix; Markov chain; Factorization; Algorithm; Matrix (chemical analysis); Computer science; Matrix decomposition; Matrix multiplication; Probabilistic logic; Mathematical optimization; Markov decision process; Markov process; Mathematics; Artificial intelligence; Machine learning","score_opus":0.6099591275582319,"score_gpt":0.5389729520319333,"score_spread":0.0709861755262986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266817871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077395706,0.000038540533,0.9984156,0.00007393684,0.0000163764,0.000036522724,0.00003506934,0.0003914983,0.00021844092],"genre_scores_gemma":[0.04158413,0.00012861706,0.9561656,0.0001446832,0.00005665957,0.00040608904,0.00037567073,0.0001416548,0.000996871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.000456531,0.00008552792,0.00026606765,0.00023415805,0.000080475795],"domain_scores_gemma":[0.996799,0.002450673,0.00016585445,0.0002103859,0.00029202117,0.00008199381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029349087,0.0018317744,0.0015332156,0.0012290078,0.0006820237,0.0011823925,0.0019402438,0.0014285967,0.006992678],"category_scores_gemma":[0.009147091,0.0010884544,0.0013795531,0.0015795038,0.0010427808,0.0017289304,0.0018244227,0.0032821766,0.0023853884],"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.00019194486,0.00025252244,0.0013303622,0.0003402938,0.0002807191,0.00016113433,0.00015892087,0.5769126,0.0049337023,0.049574934,0.009350187,0.3565127],"study_design_scores_gemma":[0.000024525396,0.00002761217,0.000086260676,0.000011746559,0.000013413174,0.000032002004,0.000009426876,0.9802202,0.00073728187,0.017618168,0.0012094091,0.000009943177],"about_ca_topic_score_codex":0.006458485,"about_ca_topic_score_gemma":0.008442705,"teacher_disagreement_score":0.006992678,"about_ca_system_score_codex":0.0012265916,"about_ca_system_score_gemma":0.003184216,"threshold_uncertainty_score":0.023392797},"labels":[],"label_agreement":null},{"id":"W2274259390","doi":"","title":"Center-based initialization for large-scale black-box problems","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Ontario Tech University","funders":"","keywords":"Initialization; Population; Computer science; Mathematical optimization; Benchmark (surveying); Latin hypercube sampling; Differential evolution; Particle swarm optimization; Algorithm; Monte Carlo method; Mathematics; Statistics","score_opus":0.13442718921251331,"score_gpt":0.38022876577346093,"score_spread":0.24580157656094762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274259390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014681081,0.00033584982,0.98150843,0.00009254165,0.00003343837,0.00008011234,0.000020331185,0.00036375393,0.002884472],"genre_scores_gemma":[0.48342276,0.00042100417,0.5135127,0.00011819819,0.000044553857,0.00033146614,0.00014814181,0.00017087728,0.001830481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992186,0.00039400146,0.000034095203,0.00009160297,0.00020307179,0.00005866063],"domain_scores_gemma":[0.9981504,0.0010615779,0.00021260126,0.00017935991,0.0003255342,0.00007043334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002238477,0.0007785981,0.000987909,0.0007988118,0.0007584369,0.0007702814,0.0011221825,0.0009105582,0.0024770717],"category_scores_gemma":[0.0050545637,0.00035413302,0.0004996722,0.00075222226,0.00083998765,0.0010598919,0.0010423061,0.00088573736,0.00050189707],"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.00016249987,0.000073914125,0.0010213724,0.000108548455,0.000039318184,0.000110335575,0.00010415087,0.8988178,0.0036238143,0.02955879,0.0018339165,0.064545475],"study_design_scores_gemma":[0.000022194134,0.000035920206,0.00011969373,0.000010111229,0.000008153569,0.000034909084,0.000012961785,0.9911243,0.0020851938,0.004912046,0.0016261432,0.00000843083],"about_ca_topic_score_codex":0.0016658605,"about_ca_topic_score_gemma":0.0011993165,"teacher_disagreement_score":0.0024770717,"about_ca_system_score_codex":0.00070256396,"about_ca_system_score_gemma":0.0009593081,"threshold_uncertainty_score":0.0118383765},"labels":[],"label_agreement":null},{"id":"W2290243003","doi":"","title":"Using a recursive neural network to learn an agent's decision model for plan recognition","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Plan (archaeology); Artificial intelligence; Benchmark (surveying); Machine learning; A priori and a posteriori; Key (lock); Artificial neural network; Decision model; State (computer science); Algorithm","score_opus":0.49434150446930586,"score_gpt":0.41361309999127155,"score_spread":0.08072840447803431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290243003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048719577,0.00026257077,0.94642675,0.00030169476,0.00004061487,0.00007052663,0.00015175215,0.0016252777,0.002401274],"genre_scores_gemma":[0.6931954,0.00027468748,0.30248797,0.0001968153,0.00003043575,0.00017977544,0.00048226948,0.0001052707,0.003047425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967194,0.00008055503,0.000020213374,0.0001198434,0.00006342415,0.000044043336],"domain_scores_gemma":[0.9990964,0.0005656116,0.00008619863,0.00010504684,0.000114720875,0.000032089763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080490764,0.0006922797,0.00068064,0.0004482293,0.00034363318,0.0008008501,0.0014527811,0.001049604,0.0020410994],"category_scores_gemma":[0.0031259004,0.00047591238,0.00060009724,0.00050982327,0.0006052479,0.0016440003,0.00063232786,0.0016517588,0.00044710803],"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.00012354973,0.000094486444,0.0013748129,0.00005978778,0.00006458888,0.000083081955,0.000095047406,0.8566927,0.004084538,0.008160129,0.0012690172,0.12789822],"study_design_scores_gemma":[0.0000035396397,0.000010414827,0.000072228104,0.00000296974,0.000005318475,0.000005986461,0.0000031498787,0.9973252,0.00047658186,0.0019526304,0.00013829343,0.000003634783],"about_ca_topic_score_codex":0.019951144,"about_ca_topic_score_gemma":0.027770424,"teacher_disagreement_score":0.019951144,"about_ca_system_score_codex":0.0012412913,"about_ca_system_score_gemma":0.0013154278,"threshold_uncertainty_score":0.03966999},"labels":[],"label_agreement":null},{"id":"W2293319454","doi":"","title":"Correcting covariate shift with the Frank-Wolfe algorithm","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Domain Adaptation and Few-Shot Learning","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Covariate; Kernel (algebra); Matching (statistics); Computer science; Algorithm; Mathematics; Statistics; Econometrics","score_opus":0.1779524532938985,"score_gpt":0.34159124758799364,"score_spread":0.16363879429409514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293319454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00491892,0.000092431874,0.99423367,0.00009123355,0.000021491023,0.000022932405,0.000017399247,0.0003553128,0.00024659853],"genre_scores_gemma":[0.17778254,0.00013498064,0.81958187,0.00019983691,0.000048985967,0.00012626077,0.00014413988,0.00016971458,0.0018117136],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783117,0.0008242122,0.00013662112,0.0005212782,0.0005631434,0.00012359062],"domain_scores_gemma":[0.9960167,0.0018774866,0.00034182295,0.001034382,0.0006124683,0.00011721401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042498806,0.00074111205,0.0015193751,0.0009976574,0.0008834894,0.0012140065,0.0018249325,0.002179965,0.0018270906],"category_scores_gemma":[0.019616354,0.0007177065,0.0008733697,0.0010177928,0.001238775,0.0027871113,0.002594838,0.0019018956,0.00082391396],"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.00023855298,0.0001353235,0.0027577851,0.00015129591,0.00013853064,0.0001830466,0.0003122327,0.4554793,0.008195565,0.05838688,0.005405824,0.46861568],"study_design_scores_gemma":[0.000019972756,0.00004674588,0.00031169347,0.000010150604,0.000011225839,0.00010582499,0.00002002303,0.9676068,0.0032217063,0.02686654,0.0017598552,0.000019369229],"about_ca_topic_score_codex":0.00258281,"about_ca_topic_score_gemma":0.002420301,"teacher_disagreement_score":0.0042498806,"about_ca_system_score_codex":0.00077900296,"about_ca_system_score_gemma":0.0019809853,"threshold_uncertainty_score":0.022475839},"labels":[],"label_agreement":null},{"id":"W2293616274","doi":"","title":"Maximizing the coverage of information propagation in social networks","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Submodular set function; Computer science; Node (physics); Maximization; Set (abstract data type); Popularity; Theoretical computer science; Mathematical optimization; Mathematics","score_opus":0.0992775265964285,"score_gpt":0.34083534369133994,"score_spread":0.24155781709491145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293616274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07695448,0.0018472004,0.9144939,0.000921631,0.000041571682,0.0002336623,0.00042104317,0.0004829121,0.004603607],"genre_scores_gemma":[0.81511813,0.0022317294,0.17771359,0.00023337435,0.0002276493,0.00048572224,0.00092958054,0.00022229546,0.0028379592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997449,0.0011279435,0.00009998182,0.0005675595,0.0005120234,0.0002434623],"domain_scores_gemma":[0.9856332,0.012074484,0.0009498539,0.00052269205,0.00047122026,0.0003485396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030428926,0.0020068495,0.0023297512,0.0022101526,0.0010492677,0.0019211338,0.002964328,0.0023649796,0.0016573092],"category_scores_gemma":[0.014873197,0.0011690173,0.0012466308,0.0026825608,0.0015761025,0.004227543,0.0022097414,0.0014636933,0.00036182764],"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.00022366246,0.0001257052,0.0026997337,0.00045688846,0.00014789222,0.00025778133,0.00029946817,0.9046268,0.0029294493,0.018436145,0.003303505,0.066492945],"study_design_scores_gemma":[0.000017843124,0.000045436223,0.00040469956,0.000017448316,0.000029317567,0.00008286416,0.000043809458,0.9805002,0.0011121604,0.017031591,0.0007049078,0.0000098154915],"about_ca_topic_score_codex":0.0035736167,"about_ca_topic_score_gemma":0.0028378912,"teacher_disagreement_score":0.0035736167,"about_ca_system_score_codex":0.0019787531,"about_ca_system_score_gemma":0.0010018297,"threshold_uncertainty_score":0.016092539},"labels":[],"label_agreement":null},{"id":"W2443199731","doi":"","title":"Inapproximability of treewidth and related problems","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Partial k-tree; Pathwidth; Tree-depth; Graphical model; Tree decomposition; Combinatorics; Computer science; Mathematics; 1-planar graph; Inference; Discrete mathematics; Graph; Chordal graph; Theoretical computer science; Artificial intelligence; Line graph","score_opus":0.1818545937339058,"score_gpt":0.3737240228359098,"score_spread":0.19186942910200397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2443199731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24210958,0.008616674,0.68684757,0.0180939,0.0004943081,0.00037727502,0.0048289313,0.0024510606,0.03618066],"genre_scores_gemma":[0.71493566,0.0066466997,0.25379172,0.0034752246,0.0013832932,0.00074799766,0.0050532836,0.0013966297,0.012569403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934123,0.0018943725,0.00028841823,0.0017609869,0.0014996363,0.0011443447],"domain_scores_gemma":[0.9351272,0.05619656,0.0026335826,0.0035562438,0.0014638572,0.001022463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045973733,0.0025430396,0.0032608092,0.0019474027,0.00211516,0.007133087,0.0058998717,0.003915017,0.010506834],"category_scores_gemma":[0.041498806,0.00191618,0.0042201723,0.0040441267,0.004291477,0.014801628,0.0035709194,0.009728071,0.0015138612],"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.0012322098,0.0008890684,0.005417077,0.002090233,0.00046897083,0.00054676924,0.0017299345,0.40849808,0.0066560498,0.4576705,0.035540156,0.07926092],"study_design_scores_gemma":[0.000103662875,0.000070107635,0.00043747717,0.00009557115,0.00007501015,0.00026984088,0.00020899657,0.25733534,0.0013459626,0.73669064,0.0033380522,0.000029313613],"about_ca_topic_score_codex":0.0036052729,"about_ca_topic_score_gemma":0.0031205066,"teacher_disagreement_score":0.010506834,"about_ca_system_score_codex":0.004186301,"about_ca_system_score_gemma":0.0024289652,"threshold_uncertainty_score":0.03514886},"labels":[],"label_agreement":null},{"id":"W2478686883","doi":"","title":"Plenary lecture 8: towards opposition and center-based sampling for high-dimensional search spaces","year":2009,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Opposition (politics); Computer science; Population; Computational intelligence; Particle swarm optimization; Differential evolution; Artificial intelligence; Evolutionary computation; Algorithm; Machine learning; Sociology; Political science; Law","score_opus":0.16433286751321077,"score_gpt":0.3920872015279786,"score_spread":0.22775433401476783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478686883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010201718,0.02741285,0.74629116,0.02499887,0.040197387,0.00029112695,0.0007673027,0.0019684017,0.14787115],"genre_scores_gemma":[0.19415888,0.0310365,0.46883613,0.009587385,0.04537997,0.001088527,0.0024359364,0.0024974702,0.24497925],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989472,0.00029257266,0.000053290587,0.00032045605,0.00029261844,0.00009382252],"domain_scores_gemma":[0.9983999,0.0009720071,0.00005875595,0.00009567276,0.00032390322,0.00014970383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640654,0.0016091113,0.001383379,0.0006237458,0.00071788847,0.003175928,0.0012057218,0.0015558426,0.03517719],"category_scores_gemma":[0.0075976714,0.00054990436,0.0013653621,0.0006515293,0.0013454203,0.0032671744,0.0019424094,0.0061339657,0.014553568],"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.00045737968,0.00022841616,0.000650297,0.00090547226,0.00014136621,0.00034707616,0.00037839136,0.0359187,0.004782369,0.2746705,0.40925908,0.27226096],"study_design_scores_gemma":[0.00013565517,0.00038782987,0.0012202935,0.0007730725,0.00008434137,0.00069579645,0.0002651373,0.14645627,0.0031514864,0.31072617,0.5359843,0.00011969824],"about_ca_topic_score_codex":0.0008529803,"about_ca_topic_score_gemma":0.00061187777,"teacher_disagreement_score":0.03517719,"about_ca_system_score_codex":0.0014062291,"about_ca_system_score_gemma":0.0007326437,"threshold_uncertainty_score":0.11767948},"labels":[],"label_agreement":null},{"id":"W282001120","doi":"","title":"Statistical Issues with Labeled Sample Size Analysis for Semi-Supervised Linear Discriminant Analysis.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear discriminant analysis; Sample size determination; Statistical analysis; Artificial intelligence; Sample (material); Computer science; Statistics; Pattern recognition (psychology); Optimal discriminant analysis; Mathematics; Chromatography; Chemistry","score_opus":0.298741371835398,"score_gpt":0.4893615187071724,"score_spread":0.19062014687177442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W282001120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033945153,0.0017258287,0.9914984,0.0017569573,0.00037364548,0.0002118131,0.00012775384,0.00031696097,0.0005941148],"genre_scores_gemma":[0.13343011,0.0008744307,0.85811543,0.001711076,0.0018988627,0.0018488303,0.0005126682,0.00036593768,0.0012425908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.8931584,0.083964966,0.0053004543,0.0069250725,0.010070906,0.00058016763],"domain_scores_gemma":[0.4810307,0.46698776,0.00739042,0.03128948,0.012060129,0.0012414719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.13529135,0.0014351002,0.002715976,0.0020991955,0.0033663136,0.0039318837,0.0069718887,0.005274965,0.0027650583],"category_scores_gemma":[0.38321307,0.001539992,0.0019889807,0.0025747176,0.010296291,0.007796757,0.0043641264,0.0085136285,0.0007453415],"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.0012535392,0.00045157853,0.010423969,0.0024552732,0.0018542353,0.00069189986,0.002323256,0.088752195,0.0073622973,0.31338942,0.042196214,0.5288461],"study_design_scores_gemma":[0.00025179706,0.00024054074,0.002954792,0.00020156379,0.0002705788,0.00038032138,0.00030629794,0.4110564,0.0056895716,0.56795,0.010593109,0.00010506262],"about_ca_topic_score_codex":0.0034897628,"about_ca_topic_score_gemma":0.005360896,"teacher_disagreement_score":0.13529135,"about_ca_system_score_codex":0.0022784262,"about_ca_system_score_gemma":0.0038089154,"threshold_uncertainty_score":0.7154976},"labels":[],"label_agreement":null},{"id":"W36478636","doi":"10.1002/cphc.202200731","title":"A Matrix Based Approach For Modeling Robotic Swarm Behavior.","year":2006,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Matrix (chemical analysis); Artificial intelligence","score_opus":0.07657845565800311,"score_gpt":0.33389200321859475,"score_spread":0.25731354756059166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36478636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020702109,0.001087032,0.9468473,0.00075565226,0.00029036726,0.00012639041,0.0008731466,0.00085243554,0.028465584],"genre_scores_gemma":[0.6356565,0.0018496433,0.31921694,0.0002591516,0.00019212357,0.0012525951,0.0010510384,0.0004208568,0.040101197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999052,0.000029269087,0.000005172384,0.000017977969,0.000029052366,0.000013274328],"domain_scores_gemma":[0.99979526,0.00008931252,0.00003551245,0.00001956728,0.000035263725,0.000025070674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025606525,0.00084356015,0.0006206405,0.00057396386,0.00058179104,0.00076929224,0.0011305646,0.001527931,0.008344892],"category_scores_gemma":[0.0007336124,0.0005266578,0.0009297866,0.0004334139,0.0004977619,0.00072558044,0.0009447901,0.0009716849,0.0017032722],"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.00000897366,0.000012669211,0.00022191273,0.00003675739,0.000034772467,0.00005987214,0.000020653151,0.9748834,0.0009397412,0.019054677,0.0008544385,0.0038721042],"study_design_scores_gemma":[0.0000030696033,0.0000044463404,0.000037209196,0.0000028128052,0.0000022473446,0.0000069548514,0.000005526609,0.99510634,0.00004672913,0.0033567143,0.0014257738,0.0000021469339],"about_ca_topic_score_codex":0.013464545,"about_ca_topic_score_gemma":0.0101418365,"teacher_disagreement_score":0.013464545,"about_ca_system_score_codex":0.00077892543,"about_ca_system_score_gemma":0.00069491216,"threshold_uncertainty_score":0.027916431},"labels":[],"label_agreement":null},{"id":"W36524623","doi":"10.1016/j.scitotenv.2021.145866","title":"Blending e-learning and knowledge management for optimizing learning paths","year":2008,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Intelligent Tutoring Systems and Adaptive Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut National de Santé Publique du Québec","keywords":"Computer science; Process (computing); Path (computing); Quality (philosophy); Knowledge acquisition; Order (exchange); Artificial intelligence; Knowledge management; Machine learning; Human–computer interaction","score_opus":0.11696588528901271,"score_gpt":0.33979079150419234,"score_spread":0.22282490621517964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W36524623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18823853,0.0012769756,0.76199555,0.0022310496,0.00012168676,0.0006504991,0.00046571362,0.0037083144,0.04131165],"genre_scores_gemma":[0.6245546,0.0011846363,0.36297745,0.0002504623,0.00003481879,0.0004259589,0.0006227016,0.00017575514,0.00977365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.00027594308,0.00006770291,0.00023404026,0.00024257207,0.00012116308],"domain_scores_gemma":[0.9977187,0.0010758623,0.00019976351,0.00033005336,0.00044796377,0.00022772735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012985757,0.00080066506,0.00057350186,0.0012083988,0.00041449885,0.0028387683,0.0018484092,0.0013222962,0.007947139],"category_scores_gemma":[0.0062281326,0.00031967502,0.00052855065,0.0015821619,0.00042414083,0.00492459,0.003175104,0.0009450274,0.002079355],"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.0001663239,0.0016483571,0.0073356023,0.00034622985,0.00007888448,0.00016499635,0.00037707578,0.19107404,0.003803554,0.010979975,0.0026567488,0.78136814],"study_design_scores_gemma":[0.00011388523,0.0006806124,0.004718969,0.0002599337,0.00013510697,0.00020536383,0.0013680664,0.87734044,0.011781239,0.06557593,0.037755,0.00006555477],"about_ca_topic_score_codex":0.003258301,"about_ca_topic_score_gemma":0.0037176674,"teacher_disagreement_score":0.007947139,"about_ca_system_score_codex":0.00089722866,"about_ca_system_score_gemma":0.0024439227,"threshold_uncertainty_score":0.026585877},"labels":[],"label_agreement":null},{"id":"W49892756","doi":"","title":"Exploratory Analysis of Transaction Data","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Business Process Modeling and Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Database transaction; Computer science; Transaction data; Transaction processing; Asset (computer security); Financial transaction; Point (geometry); Data science; Data visualization; Grid; Visualization; Data modeling; Computer security; Industrial organization; Data mining; Business; Database; Geography","score_opus":0.23233074987454588,"score_gpt":0.3481484468204088,"score_spread":0.11581769694586291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49892756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43462873,0.0022684762,0.49560228,0.002581499,0.00021951532,0.0023645766,0.035259802,0.004296827,0.022778358],"genre_scores_gemma":[0.7699694,0.00084051414,0.20840943,0.00016638015,0.00011897799,0.0012198134,0.016927935,0.00028025996,0.0020673638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943867,0.0021015627,0.00047781423,0.00059728086,0.002170692,0.00026595403],"domain_scores_gemma":[0.9760995,0.015377638,0.0019189692,0.002628855,0.0035692789,0.00040576258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055710026,0.0009931755,0.0006679049,0.009170242,0.0007789199,0.0036376158,0.0007873234,0.00043634832,0.004145484],"category_scores_gemma":[0.026848007,0.0002897263,0.0010701086,0.0074582184,0.000821445,0.0027985335,0.001917772,0.0008392088,0.0011271251],"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.001397864,0.0006782929,0.17965424,0.0037171862,0.00097198866,0.0027882394,0.018344628,0.0153255565,0.026532644,0.0725899,0.022045547,0.6559539],"study_design_scores_gemma":[0.00020657065,0.0016602306,0.23156461,0.0016113634,0.0006886296,0.0057177367,0.047425374,0.24312241,0.03751694,0.26822007,0.16182469,0.00044142894],"about_ca_topic_score_codex":0.0009982954,"about_ca_topic_score_gemma":0.0011382782,"teacher_disagreement_score":0.009170242,"about_ca_system_score_codex":0.00067381444,"about_ca_system_score_gemma":0.0012179062,"threshold_uncertainty_score":0.029462636},"labels":[],"label_agreement":null},{"id":"W89723526","doi":"","title":"The AntSynNet Algorithm: Network Syntheses Using Ant Colony Optimization.","year":2004,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Heuristics; Metaheuristic; Routing (electronic design automation); Heuristic; Mathematical optimization; Domain (mathematical analysis); Ant colony; Process (computing); Set (abstract data type); Parallel metaheuristic; Algorithm; Artificial intelligence; Meta-optimization; Mathematics; Computer network","score_opus":0.07995878778245127,"score_gpt":0.31090122672914855,"score_spread":0.23094243894669728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W89723526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066124704,0.0011048913,0.97100866,0.00023619585,0.00025304256,0.00022927254,0.00019344078,0.0023185536,0.018043475],"genre_scores_gemma":[0.056671854,0.00087506615,0.9310694,0.00014433534,0.000053077238,0.0005000443,0.0004570418,0.0005322929,0.009696942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997241,0.000058226575,0.000014348729,0.00005292608,0.00012867976,0.000021670749],"domain_scores_gemma":[0.9996625,0.0001427086,0.000060905313,0.00004380123,0.000068241425,0.000021794385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005772587,0.0008602885,0.0007156671,0.0008638802,0.00057591527,0.0009510299,0.0012606436,0.0009299678,0.0046206866],"category_scores_gemma":[0.0013607752,0.00046000257,0.000517725,0.0008522008,0.00067487865,0.0010508953,0.0009072799,0.00093756657,0.0015245897],"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.00010516708,0.000102913364,0.0006203908,0.0003753116,0.0001093478,0.00017907495,0.00012639115,0.6281785,0.011998677,0.05254047,0.015303416,0.29036033],"study_design_scores_gemma":[0.000049100247,0.00005443679,0.00012916887,0.000043715623,0.000024984067,0.00016705271,0.000034781217,0.93705153,0.0057754344,0.015917921,0.040731516,0.000020396265],"about_ca_topic_score_codex":0.0020731161,"about_ca_topic_score_gemma":0.0036420794,"teacher_disagreement_score":0.0046206866,"about_ca_system_score_codex":0.0006118398,"about_ca_system_score_gemma":0.0014835615,"threshold_uncertainty_score":0.015457809},"labels":[],"label_agreement":null}]}